/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_unwindbound5.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-fb4f59a-m [2022-04-28 07:57:19,430 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-28 07:57:19,449 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-28 07:57:19,492 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-28 07:57:19,492 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-28 07:57:19,493 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-28 07:57:19,494 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-28 07:57:19,495 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-28 07:57:19,496 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-28 07:57:19,497 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-28 07:57:19,498 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-28 07:57:19,498 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-28 07:57:19,504 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-28 07:57:19,507 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-28 07:57:19,508 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-28 07:57:19,510 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-28 07:57:19,510 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-28 07:57:19,512 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-28 07:57:19,517 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-28 07:57:19,521 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-28 07:57:19,521 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-28 07:57:19,523 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-28 07:57:19,524 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-28 07:57:19,526 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-28 07:57:19,527 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-28 07:57:19,530 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-28 07:57:19,530 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-28 07:57:19,531 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-28 07:57:19,531 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-28 07:57:19,531 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-28 07:57:19,532 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-28 07:57:19,532 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-28 07:57:19,532 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-28 07:57:19,533 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-28 07:57:19,533 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-28 07:57:19,534 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-28 07:57:19,534 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-28 07:57:19,534 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-28 07:57:19,534 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-28 07:57:19,534 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-28 07:57:19,535 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-28 07:57:19,536 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-28 07:57:19,536 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:57:19,542 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-28 07:57:19,542 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-28 07:57:19,543 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-28 07:57:19,543 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-28 07:57:19,543 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-28 07:57:19,543 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-28 07:57:19,544 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-28 07:57:19,544 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-28 07:57:19,544 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-28 07:57:19,544 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-28 07:57:19,544 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-28 07:57:19,544 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-28 07:57:19,544 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-28 07:57:19,544 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-28 07:57:19,545 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-28 07:57:19,545 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-28 07:57:19,545 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-28 07:57:19,545 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-28 07:57:19,545 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-28 07:57:19,545 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-28 07:57:19,545 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-04-28 07:57:19,545 INFO L138 SettingsManager]: * Trace refinement strategy=ACCELERATED_INTERPOLATION [2022-04-28 07:57:19,546 INFO L138 SettingsManager]: * Trace refinement strategy used in Accelerated Interpolation=CAMEL [2022-04-28 07:57:19,546 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-28 07:57:19,546 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=JORDAN [2022-04-28 07:57:19,546 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:57:19,711 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-28 07:57:19,724 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-28 07:57:19,726 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-28 07:57:19,727 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-28 07:57:19,727 INFO L275 PluginConnector]: CDTParser initialized [2022-04-28 07:57:19,728 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/nla-digbench-scaling/ps6-ll_unwindbound5.c [2022-04-28 07:57:19,772 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fe9aedb8f/585630765a3142298424b58f6be70ddd/FLAG3674aff79 [2022-04-28 07:57:20,105 INFO L306 CDTParser]: Found 1 translation units. [2022-04-28 07:57:20,105 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/ps6-ll_unwindbound5.c [2022-04-28 07:57:20,109 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fe9aedb8f/585630765a3142298424b58f6be70ddd/FLAG3674aff79 [2022-04-28 07:57:20,118 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fe9aedb8f/585630765a3142298424b58f6be70ddd [2022-04-28 07:57:20,120 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-28 07:57:20,121 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-28 07:57:20,124 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-28 07:57:20,124 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-28 07:57:20,127 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-28 07:57:20,128 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.04 07:57:20" (1/1) ... [2022-04-28 07:57:20,129 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4c5e4ab0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 07:57:20, skipping insertion in model container [2022-04-28 07:57:20,129 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.04 07:57:20" (1/1) ... [2022-04-28 07:57:20,133 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-28 07:57:20,144 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-28 07:57:20,288 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_unwindbound5.c[458,471] [2022-04-28 07:57:20,302 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-28 07:57:20,308 INFO L203 MainTranslator]: Completed pre-run [2022-04-28 07:57:20,316 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_unwindbound5.c[458,471] [2022-04-28 07:57:20,323 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-28 07:57:20,332 INFO L208 MainTranslator]: Completed translation [2022-04-28 07:57:20,333 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 07:57:20 WrapperNode [2022-04-28 07:57:20,334 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-28 07:57:20,334 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-28 07:57:20,334 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-28 07:57:20,334 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-28 07:57:20,342 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 07:57:20" (1/1) ... [2022-04-28 07:57:20,342 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 07:57:20" (1/1) ... [2022-04-28 07:57:20,348 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 07:57:20" (1/1) ... [2022-04-28 07:57:20,348 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 07:57:20" (1/1) ... [2022-04-28 07:57:20,357 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 07:57:20" (1/1) ... [2022-04-28 07:57:20,361 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 07:57:20" (1/1) ... [2022-04-28 07:57:20,362 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 07:57:20" (1/1) ... [2022-04-28 07:57:20,363 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-28 07:57:20,364 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-28 07:57:20,364 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-28 07:57:20,364 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-28 07:57:20,365 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 07:57:20" (1/1) ... [2022-04-28 07:57:20,369 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-28 07:57:20,378 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 07:57:20,387 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:57:20,391 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:57:20,419 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-28 07:57:20,420 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-28 07:57:20,420 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-28 07:57:20,420 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-28 07:57:20,421 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-28 07:57:20,421 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-28 07:57:20,421 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-28 07:57:20,421 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-28 07:57:20,422 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-28 07:57:20,422 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-28 07:57:20,422 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_short [2022-04-28 07:57:20,423 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-28 07:57:20,423 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-28 07:57:20,423 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-28 07:57:20,423 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-28 07:57:20,423 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-28 07:57:20,423 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-28 07:57:20,423 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-28 07:57:20,423 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-28 07:57:20,423 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-28 07:57:20,468 INFO L234 CfgBuilder]: Building ICFG [2022-04-28 07:57:20,469 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-28 07:57:20,655 INFO L275 CfgBuilder]: Performing block encoding [2022-04-28 07:57:20,660 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-28 07:57:20,660 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-28 07:57:20,661 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.04 07:57:20 BoogieIcfgContainer [2022-04-28 07:57:20,662 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-28 07:57:20,676 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-28 07:57:20,676 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-28 07:57:20,685 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-28 07:57:20,685 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.04 07:57:20" (1/3) ... [2022-04-28 07:57:20,686 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@77b0f9a6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.04 07:57:20, skipping insertion in model container [2022-04-28 07:57:20,686 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 07:57:20" (2/3) ... [2022-04-28 07:57:20,686 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@77b0f9a6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.04 07:57:20, skipping insertion in model container [2022-04-28 07:57:20,686 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.04 07:57:20" (3/3) ... [2022-04-28 07:57:20,687 INFO L111 eAbstractionObserver]: Analyzing ICFG ps6-ll_unwindbound5.c [2022-04-28 07:57:20,714 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-04-28 07:57:20,714 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-28 07:57:20,753 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-28 07:57:20,758 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@cbd6bdf, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@7f796b31 [2022-04-28 07:57:20,758 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-28 07:57:20,764 INFO L276 IsEmpty]: Start isEmpty. Operand has 29 states, 17 states have (on average 1.3529411764705883) internal successors, (23), 18 states have internal predecessors, (23), 6 states have call successors, (6), 4 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-28 07:57:20,769 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-04-28 07:57:20,769 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 07:57:20,769 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 07:57:20,770 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 07:57:20,773 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 07:57:20,774 INFO L85 PathProgramCache]: Analyzing trace with hash 21872251, now seen corresponding path program 1 times [2022-04-28 07:57:20,779 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 07:57:20,779 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [247814495] [2022-04-28 07:57:20,787 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 07:57:20,788 INFO L85 PathProgramCache]: Analyzing trace with hash 21872251, now seen corresponding path program 2 times [2022-04-28 07:57:20,790 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 07:57:20,790 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1483274813] [2022-04-28 07:57:20,790 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 07:57:20,791 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 07:57:20,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 07:57:20,900 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 07:57:20,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 07:57:20,916 INFO L290 TraceCheckUtils]: 0: Hoare triple {41#(and (= ~counter~0 |old(~counter~0)|) (= |#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);~counter~0 := 0; {32#true} is VALID [2022-04-28 07:57:20,916 INFO L290 TraceCheckUtils]: 1: Hoare triple {32#true} assume true; {32#true} is VALID [2022-04-28 07:57:20,916 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {32#true} {32#true} #61#return; {32#true} is VALID [2022-04-28 07:57:20,917 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-28 07:57:20,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 07:57:20,923 INFO L290 TraceCheckUtils]: 0: Hoare triple {32#true} ~cond := #in~cond; {32#true} is VALID [2022-04-28 07:57:20,924 INFO L290 TraceCheckUtils]: 1: Hoare triple {32#true} assume 0 == ~cond;assume false; {33#false} is VALID [2022-04-28 07:57:20,924 INFO L290 TraceCheckUtils]: 2: Hoare triple {33#false} assume true; {33#false} is VALID [2022-04-28 07:57:20,925 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {33#false} {32#true} #53#return; {33#false} is VALID [2022-04-28 07:57:20,926 INFO L272 TraceCheckUtils]: 0: Hoare triple {32#true} call ULTIMATE.init(); {41#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 07:57:20,926 INFO L290 TraceCheckUtils]: 1: Hoare triple {41#(and (= ~counter~0 |old(~counter~0)|) (= |#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);~counter~0 := 0; {32#true} is VALID [2022-04-28 07:57:20,926 INFO L290 TraceCheckUtils]: 2: Hoare triple {32#true} assume true; {32#true} is VALID [2022-04-28 07:57:20,926 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {32#true} {32#true} #61#return; {32#true} is VALID [2022-04-28 07:57:20,926 INFO L272 TraceCheckUtils]: 4: Hoare triple {32#true} call #t~ret6 := main(); {32#true} is VALID [2022-04-28 07:57:20,927 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:57:20,927 INFO L272 TraceCheckUtils]: 6: Hoare triple {32#true} call assume_abort_if_not((if ~k~0 <= 256 then 1 else 0)); {32#true} is VALID [2022-04-28 07:57:20,927 INFO L290 TraceCheckUtils]: 7: Hoare triple {32#true} ~cond := #in~cond; {32#true} is VALID [2022-04-28 07:57:20,928 INFO L290 TraceCheckUtils]: 8: Hoare triple {32#true} assume 0 == ~cond;assume false; {33#false} is VALID [2022-04-28 07:57:20,928 INFO L290 TraceCheckUtils]: 9: Hoare triple {33#false} assume true; {33#false} is VALID [2022-04-28 07:57:20,928 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {33#false} {32#true} #53#return; {33#false} is VALID [2022-04-28 07:57:20,928 INFO L290 TraceCheckUtils]: 11: Hoare triple {33#false} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {33#false} is VALID [2022-04-28 07:57:20,928 INFO L290 TraceCheckUtils]: 12: Hoare triple {33#false} assume !true; {33#false} is VALID [2022-04-28 07:57:20,929 INFO L272 TraceCheckUtils]: 13: 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:57:20,929 INFO L290 TraceCheckUtils]: 14: Hoare triple {33#false} ~cond := #in~cond; {33#false} is VALID [2022-04-28 07:57:20,929 INFO L290 TraceCheckUtils]: 15: Hoare triple {33#false} assume 0 == ~cond; {33#false} is VALID [2022-04-28 07:57:20,929 INFO L290 TraceCheckUtils]: 16: Hoare triple {33#false} assume !false; {33#false} is VALID [2022-04-28 07:57:20,930 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 07:57:20,930 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 07:57:20,930 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1483274813] [2022-04-28 07:57:20,931 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1483274813] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 07:57:20,931 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 07:57:20,931 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-28 07:57:20,933 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 07:57:20,934 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [247814495] [2022-04-28 07:57:20,934 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [247814495] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 07:57:20,934 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 07:57:20,934 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-28 07:57:20,934 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [677222235] [2022-04-28 07:57:20,935 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 07:57:20,939 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, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 17 [2022-04-28 07:57:20,941 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 07:57:20,943 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, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-28 07:57:20,970 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 17 edges. 17 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 07:57:20,970 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-28 07:57:20,971 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 07:57:20,992 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-28 07:57:20,993 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-28 07:57:20,997 INFO L87 Difference]: Start difference. First operand has 29 states, 17 states have (on average 1.3529411764705883) internal successors, (23), 18 states have internal predecessors, (23), 6 states have call successors, (6), 4 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) 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, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-28 07:57:21,315 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 07:57:21,315 INFO L93 Difference]: Finished difference Result 50 states and 65 transitions. [2022-04-28 07:57:21,315 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-28 07:57:21,316 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, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 17 [2022-04-28 07:57:21,316 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 07:57:21,317 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, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-28 07:57:21,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 65 transitions. [2022-04-28 07:57:21,323 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, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-28 07:57:21,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 65 transitions. [2022-04-28 07:57:21,337 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 65 transitions. [2022-04-28 07:57:21,408 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 65 edges. 65 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 07:57:21,417 INFO L225 Difference]: With dead ends: 50 [2022-04-28 07:57:21,417 INFO L226 Difference]: Without dead ends: 25 [2022-04-28 07:57:21,420 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 6 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:57:21,423 INFO L413 NwaCegarLoop]: 30 mSDtfsCounter, 10 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 34 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 07:57:21,425 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 34 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 07:57:21,436 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2022-04-28 07:57:21,462 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 24. [2022-04-28 07:57:21,462 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 07:57:21,462 INFO L82 GeneralOperation]: Start isEquivalent. First operand 25 states. Second operand has 24 states, 14 states have (on average 1.2142857142857142) internal successors, (17), 15 states have internal predecessors, (17), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-28 07:57:21,463 INFO L74 IsIncluded]: Start isIncluded. First operand 25 states. Second operand has 24 states, 14 states have (on average 1.2142857142857142) internal successors, (17), 15 states have internal predecessors, (17), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-28 07:57:21,463 INFO L87 Difference]: Start difference. First operand 25 states. Second operand has 24 states, 14 states have (on average 1.2142857142857142) internal successors, (17), 15 states have internal predecessors, (17), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-28 07:57:21,473 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 07:57:21,473 INFO L93 Difference]: Finished difference Result 25 states and 28 transitions. [2022-04-28 07:57:21,473 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 28 transitions. [2022-04-28 07:57:21,474 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 07:57:21,474 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 07:57:21,474 INFO L74 IsIncluded]: Start isIncluded. First operand has 24 states, 14 states have (on average 1.2142857142857142) internal successors, (17), 15 states have internal predecessors, (17), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand 25 states. [2022-04-28 07:57:21,474 INFO L87 Difference]: Start difference. First operand has 24 states, 14 states have (on average 1.2142857142857142) internal successors, (17), 15 states have internal predecessors, (17), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand 25 states. [2022-04-28 07:57:21,477 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 07:57:21,477 INFO L93 Difference]: Finished difference Result 25 states and 28 transitions. [2022-04-28 07:57:21,477 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 28 transitions. [2022-04-28 07:57:21,477 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 07:57:21,478 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 07:57:21,478 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 07:57:21,478 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 07:57:21,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 14 states have (on average 1.2142857142857142) internal successors, (17), 15 states have internal predecessors, (17), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-28 07:57:21,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 27 transitions. [2022-04-28 07:57:21,481 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 27 transitions. Word has length 17 [2022-04-28 07:57:21,481 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 07:57:21,481 INFO L495 AbstractCegarLoop]: Abstraction has 24 states and 27 transitions. [2022-04-28 07:57:21,482 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, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-28 07:57:21,482 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 24 states and 27 transitions. [2022-04-28 07:57:21,532 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:57:21,532 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 27 transitions. [2022-04-28 07:57:21,532 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-04-28 07:57:21,533 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 07:57:21,533 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 07:57:21,533 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-28 07:57:21,533 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 07:57:21,536 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 07:57:21,537 INFO L85 PathProgramCache]: Analyzing trace with hash -119968982, now seen corresponding path program 1 times [2022-04-28 07:57:21,537 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 07:57:21,537 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1742236250] [2022-04-28 07:57:21,539 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 07:57:21,539 INFO L85 PathProgramCache]: Analyzing trace with hash -119968982, now seen corresponding path program 2 times [2022-04-28 07:57:21,540 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 07:57:21,543 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [381724035] [2022-04-28 07:57:21,543 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 07:57:21,544 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 07:57:21,616 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 07:57:21,617 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [584708314] [2022-04-28 07:57:21,617 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 07:57:21,617 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 07:57:21,617 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 07:57:21,659 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:57:21,672 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:57:21,763 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-04-28 07:57:21,763 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 07:57:21,765 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 5 conjunts are in the unsatisfiable core [2022-04-28 07:57:21,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 07:57:21,779 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 07:57:21,925 INFO L272 TraceCheckUtils]: 0: Hoare triple {242#true} call ULTIMATE.init(); {242#true} is VALID [2022-04-28 07:57:21,926 INFO L290 TraceCheckUtils]: 1: Hoare triple {242#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);~counter~0 := 0; {250#(<= ~counter~0 0)} is VALID [2022-04-28 07:57:21,926 INFO L290 TraceCheckUtils]: 2: Hoare triple {250#(<= ~counter~0 0)} assume true; {250#(<= ~counter~0 0)} is VALID [2022-04-28 07:57:21,927 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {250#(<= ~counter~0 0)} {242#true} #61#return; {250#(<= ~counter~0 0)} is VALID [2022-04-28 07:57:21,927 INFO L272 TraceCheckUtils]: 4: Hoare triple {250#(<= ~counter~0 0)} call #t~ret6 := main(); {250#(<= ~counter~0 0)} is VALID [2022-04-28 07:57:21,928 INFO L290 TraceCheckUtils]: 5: Hoare triple {250#(<= ~counter~0 0)} 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; {250#(<= ~counter~0 0)} is VALID [2022-04-28 07:57:21,928 INFO L272 TraceCheckUtils]: 6: Hoare triple {250#(<= ~counter~0 0)} call assume_abort_if_not((if ~k~0 <= 256 then 1 else 0)); {250#(<= ~counter~0 0)} is VALID [2022-04-28 07:57:21,929 INFO L290 TraceCheckUtils]: 7: Hoare triple {250#(<= ~counter~0 0)} ~cond := #in~cond; {250#(<= ~counter~0 0)} is VALID [2022-04-28 07:57:21,930 INFO L290 TraceCheckUtils]: 8: Hoare triple {250#(<= ~counter~0 0)} assume !(0 == ~cond); {250#(<= ~counter~0 0)} is VALID [2022-04-28 07:57:21,930 INFO L290 TraceCheckUtils]: 9: Hoare triple {250#(<= ~counter~0 0)} assume true; {250#(<= ~counter~0 0)} is VALID [2022-04-28 07:57:21,931 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {250#(<= ~counter~0 0)} {250#(<= ~counter~0 0)} #53#return; {250#(<= ~counter~0 0)} is VALID [2022-04-28 07:57:21,931 INFO L290 TraceCheckUtils]: 11: Hoare triple {250#(<= ~counter~0 0)} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {250#(<= ~counter~0 0)} is VALID [2022-04-28 07:57:21,932 INFO L290 TraceCheckUtils]: 12: Hoare triple {250#(<= ~counter~0 0)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {284#(<= |main_#t~post5| 0)} is VALID [2022-04-28 07:57:21,933 INFO L290 TraceCheckUtils]: 13: Hoare triple {284#(<= |main_#t~post5| 0)} assume !(#t~post5 < 5);havoc #t~post5; {243#false} is VALID [2022-04-28 07:57:21,933 INFO L272 TraceCheckUtils]: 14: Hoare triple {243#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)); {243#false} is VALID [2022-04-28 07:57:21,933 INFO L290 TraceCheckUtils]: 15: Hoare triple {243#false} ~cond := #in~cond; {243#false} is VALID [2022-04-28 07:57:21,934 INFO L290 TraceCheckUtils]: 16: Hoare triple {243#false} assume 0 == ~cond; {243#false} is VALID [2022-04-28 07:57:21,934 INFO L290 TraceCheckUtils]: 17: Hoare triple {243#false} assume !false; {243#false} is VALID [2022-04-28 07:57:21,935 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 07:57:21,935 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-28 07:57:21,935 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 07:57:21,935 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [381724035] [2022-04-28 07:57:21,935 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 07:57:21,935 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [584708314] [2022-04-28 07:57:21,936 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [584708314] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 07:57:21,936 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 07:57:21,936 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 07:57:21,938 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 07:57:21,939 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1742236250] [2022-04-28 07:57:21,939 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1742236250] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 07:57:21,939 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 07:57:21,939 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 07:57:21,939 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [948241502] [2022-04-28 07:57:21,939 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 07:57:21,940 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 18 [2022-04-28 07:57:21,941 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 07:57:21,941 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-28 07:57:21,958 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 18 edges. 18 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 07:57:21,958 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-28 07:57:21,958 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 07:57:21,959 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-28 07:57:21,959 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-28 07:57:21,961 INFO L87 Difference]: Start difference. First operand 24 states and 27 transitions. Second operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-28 07:57:22,032 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 07:57:22,033 INFO L93 Difference]: Finished difference Result 34 states and 38 transitions. [2022-04-28 07:57:22,033 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-28 07:57:22,033 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 18 [2022-04-28 07:57:22,033 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 07:57:22,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-28 07:57:22,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 38 transitions. [2022-04-28 07:57:22,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-28 07:57:22,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 38 transitions. [2022-04-28 07:57:22,037 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 38 transitions. [2022-04-28 07:57:22,063 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 38 edges. 38 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 07:57:22,064 INFO L225 Difference]: With dead ends: 34 [2022-04-28 07:57:22,065 INFO L226 Difference]: Without dead ends: 26 [2022-04-28 07:57:22,065 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-28 07:57:22,066 INFO L413 NwaCegarLoop]: 25 mSDtfsCounter, 0 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 63 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 07:57:22,066 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 63 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 07:57:22,067 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2022-04-28 07:57:22,076 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2022-04-28 07:57:22,076 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 07:57:22,076 INFO L82 GeneralOperation]: Start isEquivalent. First operand 26 states. Second operand has 26 states, 16 states have (on average 1.1875) internal successors, (19), 17 states have internal predecessors, (19), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-28 07:57:22,077 INFO L74 IsIncluded]: Start isIncluded. First operand 26 states. Second operand has 26 states, 16 states have (on average 1.1875) internal successors, (19), 17 states have internal predecessors, (19), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-28 07:57:22,077 INFO L87 Difference]: Start difference. First operand 26 states. Second operand has 26 states, 16 states have (on average 1.1875) internal successors, (19), 17 states have internal predecessors, (19), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-28 07:57:22,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 07:57:22,079 INFO L93 Difference]: Finished difference Result 26 states and 29 transitions. [2022-04-28 07:57:22,079 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 29 transitions. [2022-04-28 07:57:22,079 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 07:57:22,079 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 07:57:22,079 INFO L74 IsIncluded]: Start isIncluded. First operand has 26 states, 16 states have (on average 1.1875) internal successors, (19), 17 states have internal predecessors, (19), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand 26 states. [2022-04-28 07:57:22,080 INFO L87 Difference]: Start difference. First operand has 26 states, 16 states have (on average 1.1875) internal successors, (19), 17 states have internal predecessors, (19), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand 26 states. [2022-04-28 07:57:22,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 07:57:22,101 INFO L93 Difference]: Finished difference Result 26 states and 29 transitions. [2022-04-28 07:57:22,101 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 29 transitions. [2022-04-28 07:57:22,101 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 07:57:22,101 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 07:57:22,101 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 07:57:22,101 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 07:57:22,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 16 states have (on average 1.1875) internal successors, (19), 17 states have internal predecessors, (19), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-28 07:57:22,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 29 transitions. [2022-04-28 07:57:22,103 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 29 transitions. Word has length 18 [2022-04-28 07:57:22,103 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 07:57:22,103 INFO L495 AbstractCegarLoop]: Abstraction has 26 states and 29 transitions. [2022-04-28 07:57:22,104 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-28 07:57:22,104 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 26 states and 29 transitions. [2022-04-28 07:57:22,127 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 29 edges. 29 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 07:57:22,127 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 29 transitions. [2022-04-28 07:57:22,128 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-04-28 07:57:22,128 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 07:57:22,128 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 07:57:22,147 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:57:22,344 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:57:22,345 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 07:57:22,345 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 07:57:22,345 INFO L85 PathProgramCache]: Analyzing trace with hash -118181522, now seen corresponding path program 1 times [2022-04-28 07:57:22,346 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 07:57:22,346 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [42048188] [2022-04-28 07:57:22,346 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 07:57:22,346 INFO L85 PathProgramCache]: Analyzing trace with hash -118181522, now seen corresponding path program 2 times [2022-04-28 07:57:22,346 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 07:57:22,346 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1927687808] [2022-04-28 07:57:22,346 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 07:57:22,347 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 07:57:22,357 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 07:57:22,357 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2029940443] [2022-04-28 07:57:22,357 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 07:57:22,358 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 07:57:22,358 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 07:57:22,361 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:57:22,362 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:57:22,395 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-04-28 07:57:22,395 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 07:57:22,396 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-28 07:57:22,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 07:57:22,406 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 07:57:22,514 INFO L272 TraceCheckUtils]: 0: Hoare triple {471#true} call ULTIMATE.init(); {471#true} is VALID [2022-04-28 07:57:22,514 INFO L290 TraceCheckUtils]: 1: Hoare triple {471#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);~counter~0 := 0; {471#true} is VALID [2022-04-28 07:57:22,514 INFO L290 TraceCheckUtils]: 2: Hoare triple {471#true} assume true; {471#true} is VALID [2022-04-28 07:57:22,514 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {471#true} {471#true} #61#return; {471#true} is VALID [2022-04-28 07:57:22,514 INFO L272 TraceCheckUtils]: 4: Hoare triple {471#true} call #t~ret6 := main(); {471#true} is VALID [2022-04-28 07:57:22,515 INFO L290 TraceCheckUtils]: 5: Hoare triple {471#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; {471#true} is VALID [2022-04-28 07:57:22,519 INFO L272 TraceCheckUtils]: 6: Hoare triple {471#true} call assume_abort_if_not((if ~k~0 <= 256 then 1 else 0)); {471#true} is VALID [2022-04-28 07:57:22,519 INFO L290 TraceCheckUtils]: 7: Hoare triple {471#true} ~cond := #in~cond; {471#true} is VALID [2022-04-28 07:57:22,520 INFO L290 TraceCheckUtils]: 8: Hoare triple {471#true} assume !(0 == ~cond); {471#true} is VALID [2022-04-28 07:57:22,520 INFO L290 TraceCheckUtils]: 9: Hoare triple {471#true} assume true; {471#true} is VALID [2022-04-28 07:57:22,522 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {471#true} {471#true} #53#return; {471#true} is VALID [2022-04-28 07:57:22,523 INFO L290 TraceCheckUtils]: 11: Hoare triple {471#true} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {509#(and (= main_~x~0 0) (= main_~y~0 0))} is VALID [2022-04-28 07:57:22,523 INFO L290 TraceCheckUtils]: 12: Hoare triple {509#(and (= main_~x~0 0) (= main_~y~0 0))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {509#(and (= main_~x~0 0) (= main_~y~0 0))} is VALID [2022-04-28 07:57:22,524 INFO L290 TraceCheckUtils]: 13: Hoare triple {509#(and (= main_~x~0 0) (= main_~y~0 0))} assume !!(#t~post5 < 5);havoc #t~post5; {509#(and (= main_~x~0 0) (= main_~y~0 0))} is VALID [2022-04-28 07:57:22,524 INFO L272 TraceCheckUtils]: 14: Hoare triple {509#(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)); {519#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 07:57:22,525 INFO L290 TraceCheckUtils]: 15: Hoare triple {519#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {523#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 07:57:22,525 INFO L290 TraceCheckUtils]: 16: Hoare triple {523#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {472#false} is VALID [2022-04-28 07:57:22,526 INFO L290 TraceCheckUtils]: 17: Hoare triple {472#false} assume !false; {472#false} is VALID [2022-04-28 07:57:22,526 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 07:57:22,526 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-28 07:57:22,526 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 07:57:22,526 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1927687808] [2022-04-28 07:57:22,526 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 07:57:22,526 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2029940443] [2022-04-28 07:57:22,527 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2029940443] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 07:57:22,527 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 07:57:22,527 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 07:57:22,527 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 07:57:22,527 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [42048188] [2022-04-28 07:57:22,527 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [42048188] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 07:57:22,527 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 07:57:22,527 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 07:57:22,527 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1947500587] [2022-04-28 07:57:22,527 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 07:57:22,528 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 18 [2022-04-28 07:57:22,528 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 07:57:22,528 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-28 07:57:22,541 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 18 edges. 18 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 07:57:22,541 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 07:57:22,541 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 07:57:22,541 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 07:57:22,541 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-28 07:57:22,542 INFO L87 Difference]: Start difference. First operand 26 states and 29 transitions. Second operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-28 07:57:22,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 07:57:22,696 INFO L93 Difference]: Finished difference Result 36 states and 41 transitions. [2022-04-28 07:57:22,697 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 07:57:22,697 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 18 [2022-04-28 07:57:22,697 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 07:57:22,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-28 07:57:22,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 41 transitions. [2022-04-28 07:57:22,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-28 07:57:22,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 41 transitions. [2022-04-28 07:57:22,700 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 41 transitions. [2022-04-28 07:57:22,732 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 41 edges. 41 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 07:57:22,733 INFO L225 Difference]: With dead ends: 36 [2022-04-28 07:57:22,733 INFO L226 Difference]: Without dead ends: 32 [2022-04-28 07:57:22,733 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 14 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:57:22,734 INFO L413 NwaCegarLoop]: 25 mSDtfsCounter, 6 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 87 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 07:57:22,734 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 87 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 07:57:22,735 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2022-04-28 07:57:22,747 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2022-04-28 07:57:22,747 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 07:57:22,748 INFO L82 GeneralOperation]: Start isEquivalent. First operand 32 states. Second operand has 32 states, 20 states have (on average 1.15) internal successors, (23), 21 states have internal predecessors, (23), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-28 07:57:22,748 INFO L74 IsIncluded]: Start isIncluded. First operand 32 states. Second operand has 32 states, 20 states have (on average 1.15) internal successors, (23), 21 states have internal predecessors, (23), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-28 07:57:22,748 INFO L87 Difference]: Start difference. First operand 32 states. Second operand has 32 states, 20 states have (on average 1.15) internal successors, (23), 21 states have internal predecessors, (23), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-28 07:57:22,750 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 07:57:22,750 INFO L93 Difference]: Finished difference Result 32 states and 35 transitions. [2022-04-28 07:57:22,750 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 35 transitions. [2022-04-28 07:57:22,750 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 07:57:22,750 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 07:57:22,750 INFO L74 IsIncluded]: Start isIncluded. First operand has 32 states, 20 states have (on average 1.15) internal successors, (23), 21 states have internal predecessors, (23), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand 32 states. [2022-04-28 07:57:22,751 INFO L87 Difference]: Start difference. First operand has 32 states, 20 states have (on average 1.15) internal successors, (23), 21 states have internal predecessors, (23), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand 32 states. [2022-04-28 07:57:22,752 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 07:57:22,753 INFO L93 Difference]: Finished difference Result 32 states and 35 transitions. [2022-04-28 07:57:22,753 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 35 transitions. [2022-04-28 07:57:22,753 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 07:57:22,753 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 07:57:22,753 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 07:57:22,753 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 07:57:22,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 20 states have (on average 1.15) internal successors, (23), 21 states have internal predecessors, (23), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-28 07:57:22,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 35 transitions. [2022-04-28 07:57:22,754 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 35 transitions. Word has length 18 [2022-04-28 07:57:22,755 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 07:57:22,755 INFO L495 AbstractCegarLoop]: Abstraction has 32 states and 35 transitions. [2022-04-28 07:57:22,755 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-28 07:57:22,755 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 32 states and 35 transitions. [2022-04-28 07:57:22,788 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:57:22,789 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 35 transitions. [2022-04-28 07:57:22,789 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-04-28 07:57:22,789 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 07:57:22,790 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 07:57:22,806 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:57:22,996 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:57:22,996 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 07:57:22,996 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 07:57:22,998 INFO L85 PathProgramCache]: Analyzing trace with hash -1364840471, now seen corresponding path program 1 times [2022-04-28 07:57:22,998 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 07:57:22,998 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [484615385] [2022-04-28 07:57:23,176 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 4 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-28 07:57:23,176 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONLINEAR_UPDATE [2022-04-28 07:57:23,176 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 07:57:23,176 INFO L85 PathProgramCache]: Analyzing trace with hash -1364840471, now seen corresponding path program 2 times [2022-04-28 07:57:23,176 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 07:57:23,177 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [684732976] [2022-04-28 07:57:23,177 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 07:57:23,177 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 07:57:23,187 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 07:57:23,187 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [304281222] [2022-04-28 07:57:23,187 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 07:57:23,187 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 07:57:23,187 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 07:57:23,188 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:57:23,189 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:57:23,375 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 07:57:23,375 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 07:57:23,376 INFO L263 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-28 07:57:23,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 07:57:23,385 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 07:57:23,502 INFO L272 TraceCheckUtils]: 0: Hoare triple {731#true} call ULTIMATE.init(); {731#true} is VALID [2022-04-28 07:57:23,503 INFO L290 TraceCheckUtils]: 1: Hoare triple {731#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);~counter~0 := 0; {739#(<= ~counter~0 0)} is VALID [2022-04-28 07:57:23,503 INFO L290 TraceCheckUtils]: 2: Hoare triple {739#(<= ~counter~0 0)} assume true; {739#(<= ~counter~0 0)} is VALID [2022-04-28 07:57:23,503 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {739#(<= ~counter~0 0)} {731#true} #61#return; {739#(<= ~counter~0 0)} is VALID [2022-04-28 07:57:23,504 INFO L272 TraceCheckUtils]: 4: Hoare triple {739#(<= ~counter~0 0)} call #t~ret6 := main(); {739#(<= ~counter~0 0)} is VALID [2022-04-28 07:57:23,504 INFO L290 TraceCheckUtils]: 5: Hoare triple {739#(<= ~counter~0 0)} 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; {739#(<= ~counter~0 0)} is VALID [2022-04-28 07:57:23,504 INFO L272 TraceCheckUtils]: 6: Hoare triple {739#(<= ~counter~0 0)} call assume_abort_if_not((if ~k~0 <= 256 then 1 else 0)); {739#(<= ~counter~0 0)} is VALID [2022-04-28 07:57:23,505 INFO L290 TraceCheckUtils]: 7: Hoare triple {739#(<= ~counter~0 0)} ~cond := #in~cond; {739#(<= ~counter~0 0)} is VALID [2022-04-28 07:57:23,505 INFO L290 TraceCheckUtils]: 8: Hoare triple {739#(<= ~counter~0 0)} assume !(0 == ~cond); {739#(<= ~counter~0 0)} is VALID [2022-04-28 07:57:23,505 INFO L290 TraceCheckUtils]: 9: Hoare triple {739#(<= ~counter~0 0)} assume true; {739#(<= ~counter~0 0)} is VALID [2022-04-28 07:57:23,506 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {739#(<= ~counter~0 0)} {739#(<= ~counter~0 0)} #53#return; {739#(<= ~counter~0 0)} is VALID [2022-04-28 07:57:23,506 INFO L290 TraceCheckUtils]: 11: Hoare triple {739#(<= ~counter~0 0)} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {739#(<= ~counter~0 0)} is VALID [2022-04-28 07:57:23,507 INFO L290 TraceCheckUtils]: 12: Hoare triple {739#(<= ~counter~0 0)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {773#(<= ~counter~0 1)} is VALID [2022-04-28 07:57:23,507 INFO L290 TraceCheckUtils]: 13: Hoare triple {773#(<= ~counter~0 1)} assume !!(#t~post5 < 5);havoc #t~post5; {773#(<= ~counter~0 1)} is VALID [2022-04-28 07:57:23,508 INFO L272 TraceCheckUtils]: 14: Hoare triple {773#(<= ~counter~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)); {773#(<= ~counter~0 1)} is VALID [2022-04-28 07:57:23,508 INFO L290 TraceCheckUtils]: 15: Hoare triple {773#(<= ~counter~0 1)} ~cond := #in~cond; {773#(<= ~counter~0 1)} is VALID [2022-04-28 07:57:23,508 INFO L290 TraceCheckUtils]: 16: Hoare triple {773#(<= ~counter~0 1)} assume !(0 == ~cond); {773#(<= ~counter~0 1)} is VALID [2022-04-28 07:57:23,509 INFO L290 TraceCheckUtils]: 17: Hoare triple {773#(<= ~counter~0 1)} assume true; {773#(<= ~counter~0 1)} is VALID [2022-04-28 07:57:23,509 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {773#(<= ~counter~0 1)} {773#(<= ~counter~0 1)} #55#return; {773#(<= ~counter~0 1)} is VALID [2022-04-28 07:57:23,509 INFO L290 TraceCheckUtils]: 19: Hoare triple {773#(<= ~counter~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; {773#(<= ~counter~0 1)} is VALID [2022-04-28 07:57:23,510 INFO L290 TraceCheckUtils]: 20: Hoare triple {773#(<= ~counter~0 1)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {798#(<= |main_#t~post5| 1)} is VALID [2022-04-28 07:57:23,510 INFO L290 TraceCheckUtils]: 21: Hoare triple {798#(<= |main_#t~post5| 1)} assume !(#t~post5 < 5);havoc #t~post5; {732#false} is VALID [2022-04-28 07:57:23,510 INFO L272 TraceCheckUtils]: 22: Hoare triple {732#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)); {732#false} is VALID [2022-04-28 07:57:23,510 INFO L290 TraceCheckUtils]: 23: Hoare triple {732#false} ~cond := #in~cond; {732#false} is VALID [2022-04-28 07:57:23,511 INFO L290 TraceCheckUtils]: 24: Hoare triple {732#false} assume 0 == ~cond; {732#false} is VALID [2022-04-28 07:57:23,511 INFO L290 TraceCheckUtils]: 25: Hoare triple {732#false} assume !false; {732#false} is VALID [2022-04-28 07:57:23,511 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 07:57:23,511 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 07:57:23,635 INFO L290 TraceCheckUtils]: 25: Hoare triple {732#false} assume !false; {732#false} is VALID [2022-04-28 07:57:23,635 INFO L290 TraceCheckUtils]: 24: Hoare triple {732#false} assume 0 == ~cond; {732#false} is VALID [2022-04-28 07:57:23,635 INFO L290 TraceCheckUtils]: 23: Hoare triple {732#false} ~cond := #in~cond; {732#false} is VALID [2022-04-28 07:57:23,636 INFO L272 TraceCheckUtils]: 22: Hoare triple {732#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)); {732#false} is VALID [2022-04-28 07:57:23,636 INFO L290 TraceCheckUtils]: 21: Hoare triple {826#(< |main_#t~post5| 5)} assume !(#t~post5 < 5);havoc #t~post5; {732#false} is VALID [2022-04-28 07:57:23,636 INFO L290 TraceCheckUtils]: 20: Hoare triple {830#(< ~counter~0 5)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {826#(< |main_#t~post5| 5)} is VALID [2022-04-28 07:57:23,637 INFO L290 TraceCheckUtils]: 19: Hoare triple {830#(< ~counter~0 5)} 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; {830#(< ~counter~0 5)} is VALID [2022-04-28 07:57:23,637 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {731#true} {830#(< ~counter~0 5)} #55#return; {830#(< ~counter~0 5)} is VALID [2022-04-28 07:57:23,637 INFO L290 TraceCheckUtils]: 17: Hoare triple {731#true} assume true; {731#true} is VALID [2022-04-28 07:57:23,637 INFO L290 TraceCheckUtils]: 16: Hoare triple {731#true} assume !(0 == ~cond); {731#true} is VALID [2022-04-28 07:57:23,638 INFO L290 TraceCheckUtils]: 15: Hoare triple {731#true} ~cond := #in~cond; {731#true} is VALID [2022-04-28 07:57:23,638 INFO L272 TraceCheckUtils]: 14: Hoare triple {830#(< ~counter~0 5)} 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)); {731#true} is VALID [2022-04-28 07:57:23,638 INFO L290 TraceCheckUtils]: 13: Hoare triple {830#(< ~counter~0 5)} assume !!(#t~post5 < 5);havoc #t~post5; {830#(< ~counter~0 5)} is VALID [2022-04-28 07:57:23,638 INFO L290 TraceCheckUtils]: 12: Hoare triple {855#(< ~counter~0 4)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {830#(< ~counter~0 5)} is VALID [2022-04-28 07:57:23,639 INFO L290 TraceCheckUtils]: 11: Hoare triple {855#(< ~counter~0 4)} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {855#(< ~counter~0 4)} is VALID [2022-04-28 07:57:23,641 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {731#true} {855#(< ~counter~0 4)} #53#return; {855#(< ~counter~0 4)} is VALID [2022-04-28 07:57:23,642 INFO L290 TraceCheckUtils]: 9: Hoare triple {731#true} assume true; {731#true} is VALID [2022-04-28 07:57:23,642 INFO L290 TraceCheckUtils]: 8: Hoare triple {731#true} assume !(0 == ~cond); {731#true} is VALID [2022-04-28 07:57:23,642 INFO L290 TraceCheckUtils]: 7: Hoare triple {731#true} ~cond := #in~cond; {731#true} is VALID [2022-04-28 07:57:23,642 INFO L272 TraceCheckUtils]: 6: Hoare triple {855#(< ~counter~0 4)} call assume_abort_if_not((if ~k~0 <= 256 then 1 else 0)); {731#true} is VALID [2022-04-28 07:57:23,643 INFO L290 TraceCheckUtils]: 5: Hoare triple {855#(< ~counter~0 4)} 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; {855#(< ~counter~0 4)} is VALID [2022-04-28 07:57:23,643 INFO L272 TraceCheckUtils]: 4: Hoare triple {855#(< ~counter~0 4)} call #t~ret6 := main(); {855#(< ~counter~0 4)} is VALID [2022-04-28 07:57:23,644 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {855#(< ~counter~0 4)} {731#true} #61#return; {855#(< ~counter~0 4)} is VALID [2022-04-28 07:57:23,644 INFO L290 TraceCheckUtils]: 2: Hoare triple {855#(< ~counter~0 4)} assume true; {855#(< ~counter~0 4)} is VALID [2022-04-28 07:57:23,645 INFO L290 TraceCheckUtils]: 1: Hoare triple {731#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);~counter~0 := 0; {855#(< ~counter~0 4)} is VALID [2022-04-28 07:57:23,646 INFO L272 TraceCheckUtils]: 0: Hoare triple {731#true} call ULTIMATE.init(); {731#true} is VALID [2022-04-28 07:57:23,646 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 07:57:23,647 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 07:57:23,647 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [684732976] [2022-04-28 07:57:23,647 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 07:57:23,647 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [304281222] [2022-04-28 07:57:23,647 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [304281222] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 07:57:23,647 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 07:57:23,647 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2022-04-28 07:57:23,648 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 07:57:23,648 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [484615385] [2022-04-28 07:57:23,648 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [484615385] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 07:57:23,648 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 07:57:23,648 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 07:57:23,648 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [727042164] [2022-04-28 07:57:23,648 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 07:57:23,649 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 4 states have call successors, (5), 4 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) Word has length 26 [2022-04-28 07:57:23,649 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 07:57:23,649 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 4 states have call successors, (5), 4 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-28 07:57:23,664 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 26 edges. 26 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 07:57:23,665 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 07:57:23,665 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 07:57:23,666 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 07:57:23,666 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2022-04-28 07:57:23,667 INFO L87 Difference]: Start difference. First operand 32 states and 35 transitions. Second operand has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 4 states have call successors, (5), 4 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-28 07:57:23,760 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 07:57:23,760 INFO L93 Difference]: Finished difference Result 42 states and 46 transitions. [2022-04-28 07:57:23,760 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-28 07:57:23,760 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 4 states have call successors, (5), 4 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) Word has length 26 [2022-04-28 07:57:23,760 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 07:57:23,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 4 states have call successors, (5), 4 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-28 07:57:23,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 46 transitions. [2022-04-28 07:57:23,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 4 states have call successors, (5), 4 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-28 07:57:23,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 46 transitions. [2022-04-28 07:57:23,769 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 46 transitions. [2022-04-28 07:57:23,797 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:57:23,801 INFO L225 Difference]: With dead ends: 42 [2022-04-28 07:57:23,801 INFO L226 Difference]: Without dead ends: 34 [2022-04-28 07:57:23,801 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2022-04-28 07:57:23,802 INFO L413 NwaCegarLoop]: 26 mSDtfsCounter, 6 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 78 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 07:57:23,803 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 78 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 07:57:23,805 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2022-04-28 07:57:23,821 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2022-04-28 07:57:23,821 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 07:57:23,822 INFO L82 GeneralOperation]: Start isEquivalent. First operand 34 states. Second operand has 34 states, 22 states have (on average 1.1363636363636365) internal successors, (25), 23 states have internal predecessors, (25), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-28 07:57:23,822 INFO L74 IsIncluded]: Start isIncluded. First operand 34 states. Second operand has 34 states, 22 states have (on average 1.1363636363636365) internal successors, (25), 23 states have internal predecessors, (25), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-28 07:57:23,824 INFO L87 Difference]: Start difference. First operand 34 states. Second operand has 34 states, 22 states have (on average 1.1363636363636365) internal successors, (25), 23 states have internal predecessors, (25), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-28 07:57:23,827 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 07:57:23,827 INFO L93 Difference]: Finished difference Result 34 states and 37 transitions. [2022-04-28 07:57:23,827 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 37 transitions. [2022-04-28 07:57:23,830 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 07:57:23,830 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 07:57:23,832 INFO L74 IsIncluded]: Start isIncluded. First operand has 34 states, 22 states have (on average 1.1363636363636365) internal successors, (25), 23 states have internal predecessors, (25), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand 34 states. [2022-04-28 07:57:23,832 INFO L87 Difference]: Start difference. First operand has 34 states, 22 states have (on average 1.1363636363636365) internal successors, (25), 23 states have internal predecessors, (25), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand 34 states. [2022-04-28 07:57:23,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 07:57:23,834 INFO L93 Difference]: Finished difference Result 34 states and 37 transitions. [2022-04-28 07:57:23,834 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 37 transitions. [2022-04-28 07:57:23,835 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 07:57:23,837 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 07:57:23,837 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 07:57:23,838 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 07:57:23,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 22 states have (on average 1.1363636363636365) internal successors, (25), 23 states have internal predecessors, (25), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-28 07:57:23,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 37 transitions. [2022-04-28 07:57:23,840 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 37 transitions. Word has length 26 [2022-04-28 07:57:23,840 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 07:57:23,840 INFO L495 AbstractCegarLoop]: Abstraction has 34 states and 37 transitions. [2022-04-28 07:57:23,840 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 4 states have call successors, (5), 4 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-28 07:57:23,840 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 34 states and 37 transitions. [2022-04-28 07:57:23,866 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 37 edges. 37 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 07:57:23,867 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 37 transitions. [2022-04-28 07:57:23,867 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-04-28 07:57:23,867 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 07:57:23,867 INFO L195 NwaCegarLoop]: trace histogram [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:57:23,875 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2022-04-28 07:57:24,072 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:57:24,073 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 07:57:24,073 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 07:57:24,073 INFO L85 PathProgramCache]: Analyzing trace with hash -1363053011, now seen corresponding path program 1 times [2022-04-28 07:57:24,073 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 07:57:24,073 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [703494228] [2022-04-28 07:57:24,214 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 4 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-28 07:57:24,214 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONLINEAR_UPDATE [2022-04-28 07:57:24,214 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 07:57:24,214 INFO L85 PathProgramCache]: Analyzing trace with hash -1363053011, now seen corresponding path program 2 times [2022-04-28 07:57:24,214 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 07:57:24,214 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [735519436] [2022-04-28 07:57:24,214 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 07:57:24,215 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 07:57:24,225 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 07:57:24,226 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1649945364] [2022-04-28 07:57:24,226 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 07:57:24,226 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 07:57:24,226 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 07:57:24,227 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:57:24,228 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:57:24,262 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 07:57:24,262 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 07:57:24,263 INFO L263 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 11 conjunts are in the unsatisfiable core [2022-04-28 07:57:24,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 07:57:24,278 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 07:57:24,376 INFO L272 TraceCheckUtils]: 0: Hoare triple {1116#true} call ULTIMATE.init(); {1116#true} is VALID [2022-04-28 07:57:24,377 INFO L290 TraceCheckUtils]: 1: Hoare triple {1116#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);~counter~0 := 0; {1116#true} is VALID [2022-04-28 07:57:24,377 INFO L290 TraceCheckUtils]: 2: Hoare triple {1116#true} assume true; {1116#true} is VALID [2022-04-28 07:57:24,377 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1116#true} {1116#true} #61#return; {1116#true} is VALID [2022-04-28 07:57:24,377 INFO L272 TraceCheckUtils]: 4: Hoare triple {1116#true} call #t~ret6 := main(); {1116#true} is VALID [2022-04-28 07:57:24,377 INFO L290 TraceCheckUtils]: 5: Hoare triple {1116#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; {1116#true} is VALID [2022-04-28 07:57:24,377 INFO L272 TraceCheckUtils]: 6: Hoare triple {1116#true} call assume_abort_if_not((if ~k~0 <= 256 then 1 else 0)); {1116#true} is VALID [2022-04-28 07:57:24,377 INFO L290 TraceCheckUtils]: 7: Hoare triple {1116#true} ~cond := #in~cond; {1116#true} is VALID [2022-04-28 07:57:24,378 INFO L290 TraceCheckUtils]: 8: Hoare triple {1116#true} assume !(0 == ~cond); {1116#true} is VALID [2022-04-28 07:57:24,378 INFO L290 TraceCheckUtils]: 9: Hoare triple {1116#true} assume true; {1116#true} is VALID [2022-04-28 07:57:24,378 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1116#true} {1116#true} #53#return; {1116#true} is VALID [2022-04-28 07:57:24,388 INFO L290 TraceCheckUtils]: 11: Hoare triple {1116#true} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {1154#(and (= main_~x~0 0) (= main_~y~0 0))} is VALID [2022-04-28 07:57:24,388 INFO L290 TraceCheckUtils]: 12: Hoare triple {1154#(and (= main_~x~0 0) (= main_~y~0 0))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {1154#(and (= main_~x~0 0) (= main_~y~0 0))} is VALID [2022-04-28 07:57:24,389 INFO L290 TraceCheckUtils]: 13: Hoare triple {1154#(and (= main_~x~0 0) (= main_~y~0 0))} assume !!(#t~post5 < 5);havoc #t~post5; {1154#(and (= main_~x~0 0) (= main_~y~0 0))} is VALID [2022-04-28 07:57:24,389 INFO L272 TraceCheckUtils]: 14: Hoare triple {1154#(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)); {1116#true} is VALID [2022-04-28 07:57:24,389 INFO L290 TraceCheckUtils]: 15: Hoare triple {1116#true} ~cond := #in~cond; {1116#true} is VALID [2022-04-28 07:57:24,389 INFO L290 TraceCheckUtils]: 16: Hoare triple {1116#true} assume !(0 == ~cond); {1116#true} is VALID [2022-04-28 07:57:24,389 INFO L290 TraceCheckUtils]: 17: Hoare triple {1116#true} assume true; {1116#true} is VALID [2022-04-28 07:57:24,389 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {1116#true} {1154#(and (= main_~x~0 0) (= main_~y~0 0))} #55#return; {1154#(and (= main_~x~0 0) (= main_~y~0 0))} is VALID [2022-04-28 07:57:24,390 INFO L290 TraceCheckUtils]: 19: Hoare triple {1154#(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; {1179#(and (= (+ (- 1) main_~y~0) 0) (= (+ main_~x~0 (* (- 1) main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) 0))} is VALID [2022-04-28 07:57:24,391 INFO L290 TraceCheckUtils]: 20: Hoare triple {1179#(and (= (+ (- 1) main_~y~0) 0) (= (+ main_~x~0 (* (- 1) main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) 0))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {1179#(and (= (+ (- 1) main_~y~0) 0) (= (+ main_~x~0 (* (- 1) main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) 0))} is VALID [2022-04-28 07:57:24,391 INFO L290 TraceCheckUtils]: 21: Hoare triple {1179#(and (= (+ (- 1) main_~y~0) 0) (= (+ main_~x~0 (* (- 1) main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) 0))} assume !!(#t~post5 < 5);havoc #t~post5; {1179#(and (= (+ (- 1) main_~y~0) 0) (= (+ main_~x~0 (* (- 1) main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) 0))} is VALID [2022-04-28 07:57:24,392 INFO L272 TraceCheckUtils]: 22: Hoare triple {1179#(and (= (+ (- 1) main_~y~0) 0) (= (+ main_~x~0 (* (- 1) main_~y~0 main_~y~0 main_~y~0 main_~y~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)); {1189#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 07:57:24,392 INFO L290 TraceCheckUtils]: 23: Hoare triple {1189#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1193#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 07:57:24,392 INFO L290 TraceCheckUtils]: 24: Hoare triple {1193#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1117#false} is VALID [2022-04-28 07:57:24,392 INFO L290 TraceCheckUtils]: 25: Hoare triple {1117#false} assume !false; {1117#false} is VALID [2022-04-28 07:57:24,393 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 07:57:24,393 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 07:57:24,521 INFO L290 TraceCheckUtils]: 25: Hoare triple {1117#false} assume !false; {1117#false} is VALID [2022-04-28 07:57:24,522 INFO L290 TraceCheckUtils]: 24: Hoare triple {1193#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1117#false} is VALID [2022-04-28 07:57:24,522 INFO L290 TraceCheckUtils]: 23: Hoare triple {1189#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1193#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 07:57:24,523 INFO L272 TraceCheckUtils]: 22: Hoare triple {1209#(= (+ (* 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)); {1189#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 07:57:24,523 INFO L290 TraceCheckUtils]: 21: Hoare triple {1209#(= (+ (* 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 !!(#t~post5 < 5);havoc #t~post5; {1209#(= (+ (* 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:57:24,524 INFO L290 TraceCheckUtils]: 20: Hoare triple {1209#(= (+ (* 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)))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {1209#(= (+ (* 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:57:24,696 INFO L290 TraceCheckUtils]: 19: Hoare triple {1209#(= (+ (* 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; {1209#(= (+ (* 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:57:24,697 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {1116#true} {1209#(= (+ (* 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)))} #55#return; {1209#(= (+ (* 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:57:24,697 INFO L290 TraceCheckUtils]: 17: Hoare triple {1116#true} assume true; {1116#true} is VALID [2022-04-28 07:57:24,697 INFO L290 TraceCheckUtils]: 16: Hoare triple {1116#true} assume !(0 == ~cond); {1116#true} is VALID [2022-04-28 07:57:24,697 INFO L290 TraceCheckUtils]: 15: Hoare triple {1116#true} ~cond := #in~cond; {1116#true} is VALID [2022-04-28 07:57:24,697 INFO L272 TraceCheckUtils]: 14: Hoare triple {1209#(= (+ (* 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)); {1116#true} is VALID [2022-04-28 07:57:24,699 INFO L290 TraceCheckUtils]: 13: Hoare triple {1209#(= (+ (* 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 !!(#t~post5 < 5);havoc #t~post5; {1209#(= (+ (* 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:57:24,699 INFO L290 TraceCheckUtils]: 12: Hoare triple {1209#(= (+ (* 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)))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {1209#(= (+ (* 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:57:24,700 INFO L290 TraceCheckUtils]: 11: Hoare triple {1116#true} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {1209#(= (+ (* 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:57:24,700 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1116#true} {1116#true} #53#return; {1116#true} is VALID [2022-04-28 07:57:24,700 INFO L290 TraceCheckUtils]: 9: Hoare triple {1116#true} assume true; {1116#true} is VALID [2022-04-28 07:57:24,700 INFO L290 TraceCheckUtils]: 8: Hoare triple {1116#true} assume !(0 == ~cond); {1116#true} is VALID [2022-04-28 07:57:24,700 INFO L290 TraceCheckUtils]: 7: Hoare triple {1116#true} ~cond := #in~cond; {1116#true} is VALID [2022-04-28 07:57:24,700 INFO L272 TraceCheckUtils]: 6: Hoare triple {1116#true} call assume_abort_if_not((if ~k~0 <= 256 then 1 else 0)); {1116#true} is VALID [2022-04-28 07:57:24,700 INFO L290 TraceCheckUtils]: 5: Hoare triple {1116#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; {1116#true} is VALID [2022-04-28 07:57:24,700 INFO L272 TraceCheckUtils]: 4: Hoare triple {1116#true} call #t~ret6 := main(); {1116#true} is VALID [2022-04-28 07:57:24,701 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1116#true} {1116#true} #61#return; {1116#true} is VALID [2022-04-28 07:57:24,701 INFO L290 TraceCheckUtils]: 2: Hoare triple {1116#true} assume true; {1116#true} is VALID [2022-04-28 07:57:24,701 INFO L290 TraceCheckUtils]: 1: Hoare triple {1116#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);~counter~0 := 0; {1116#true} is VALID [2022-04-28 07:57:24,701 INFO L272 TraceCheckUtils]: 0: Hoare triple {1116#true} call ULTIMATE.init(); {1116#true} is VALID [2022-04-28 07:57:24,701 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-04-28 07:57:24,701 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 07:57:24,701 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [735519436] [2022-04-28 07:57:24,702 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 07:57:24,702 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1649945364] [2022-04-28 07:57:24,702 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1649945364] provided 1 perfect and 1 imperfect interpolant sequences [2022-04-28 07:57:24,702 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-04-28 07:57:24,702 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 7 [2022-04-28 07:57:24,702 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 07:57:24,702 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [703494228] [2022-04-28 07:57:24,702 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [703494228] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 07:57:24,702 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 07:57:24,702 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 07:57:24,702 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [806561232] [2022-04-28 07:57:24,702 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 07:57:24,703 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 26 [2022-04-28 07:57:24,703 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 07:57:24,703 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-28 07:57:24,762 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 24 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 07:57:24,762 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 07:57:24,762 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 07:57:24,763 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 07:57:24,763 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-04-28 07:57:24,763 INFO L87 Difference]: Start difference. First operand 34 states and 37 transitions. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-28 07:57:24,887 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 07:57:24,887 INFO L93 Difference]: Finished difference Result 40 states and 42 transitions. [2022-04-28 07:57:24,888 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 07:57:24,888 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 26 [2022-04-28 07:57:24,889 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 07:57:24,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-28 07:57:24,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 32 transitions. [2022-04-28 07:57:24,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-28 07:57:24,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 32 transitions. [2022-04-28 07:57:24,894 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 32 transitions. [2022-04-28 07:57:24,995 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:57:24,996 INFO L225 Difference]: With dead ends: 40 [2022-04-28 07:57:24,996 INFO L226 Difference]: Without dead ends: 36 [2022-04-28 07:57:24,996 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 44 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-04-28 07:57:24,996 INFO L413 NwaCegarLoop]: 22 mSDtfsCounter, 7 mSDsluCounter, 51 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 73 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:57:24,997 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 73 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 07:57:24,997 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2022-04-28 07:57:25,015 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2022-04-28 07:57:25,015 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 07:57:25,015 INFO L82 GeneralOperation]: Start isEquivalent. First operand 36 states. Second operand has 36 states, 24 states have (on average 1.0833333333333333) internal successors, (26), 24 states have internal predecessors, (26), 7 states have call successors, (7), 6 states have call predecessors, (7), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-28 07:57:25,016 INFO L74 IsIncluded]: Start isIncluded. First operand 36 states. Second operand has 36 states, 24 states have (on average 1.0833333333333333) internal successors, (26), 24 states have internal predecessors, (26), 7 states have call successors, (7), 6 states have call predecessors, (7), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-28 07:57:25,016 INFO L87 Difference]: Start difference. First operand 36 states. Second operand has 36 states, 24 states have (on average 1.0833333333333333) internal successors, (26), 24 states have internal predecessors, (26), 7 states have call successors, (7), 6 states have call predecessors, (7), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-28 07:57:25,017 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 07:57:25,017 INFO L93 Difference]: Finished difference Result 36 states and 38 transitions. [2022-04-28 07:57:25,017 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 38 transitions. [2022-04-28 07:57:25,017 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 07:57:25,017 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 07:57:25,017 INFO L74 IsIncluded]: Start isIncluded. First operand has 36 states, 24 states have (on average 1.0833333333333333) internal successors, (26), 24 states have internal predecessors, (26), 7 states have call successors, (7), 6 states have call predecessors, (7), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand 36 states. [2022-04-28 07:57:25,018 INFO L87 Difference]: Start difference. First operand has 36 states, 24 states have (on average 1.0833333333333333) internal successors, (26), 24 states have internal predecessors, (26), 7 states have call successors, (7), 6 states have call predecessors, (7), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand 36 states. [2022-04-28 07:57:25,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 07:57:25,019 INFO L93 Difference]: Finished difference Result 36 states and 38 transitions. [2022-04-28 07:57:25,019 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 38 transitions. [2022-04-28 07:57:25,019 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 07:57:25,019 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 07:57:25,019 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 07:57:25,019 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 07:57:25,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 24 states have (on average 1.0833333333333333) internal successors, (26), 24 states have internal predecessors, (26), 7 states have call successors, (7), 6 states have call predecessors, (7), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-28 07:57:25,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 38 transitions. [2022-04-28 07:57:25,020 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 38 transitions. Word has length 26 [2022-04-28 07:57:25,020 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 07:57:25,020 INFO L495 AbstractCegarLoop]: Abstraction has 36 states and 38 transitions. [2022-04-28 07:57:25,020 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-28 07:57:25,020 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 36 states and 38 transitions. [2022-04-28 07:57:25,231 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 38 edges. 38 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 07:57:25,231 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 38 transitions. [2022-04-28 07:57:25,232 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-04-28 07:57:25,232 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 07:57:25,232 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 07:57:25,251 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:57:25,432 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:57:25,432 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 07:57:25,433 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 07:57:25,433 INFO L85 PathProgramCache]: Analyzing trace with hash -1559147673, now seen corresponding path program 1 times [2022-04-28 07:57:25,433 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 07:57:25,433 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [827194559] [2022-04-28 07:57:25,529 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 4 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-28 07:57:25,529 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONLINEAR_UPDATE [2022-04-28 07:57:25,529 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 07:57:25,529 INFO L85 PathProgramCache]: Analyzing trace with hash -1559147673, now seen corresponding path program 2 times [2022-04-28 07:57:25,529 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 07:57:25,529 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [53623719] [2022-04-28 07:57:25,529 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 07:57:25,529 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 07:57:25,538 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 07:57:25,539 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1542913611] [2022-04-28 07:57:25,539 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 07:57:25,539 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 07:57:25,539 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 07:57:25,540 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:57:25,541 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:57:25,575 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 07:57:25,575 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 07:57:25,576 INFO L263 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 12 conjunts are in the unsatisfiable core [2022-04-28 07:57:25,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 07:57:25,585 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 07:57:25,808 INFO L272 TraceCheckUtils]: 0: Hoare triple {1504#true} call ULTIMATE.init(); {1504#true} is VALID [2022-04-28 07:57:25,808 INFO L290 TraceCheckUtils]: 1: Hoare triple {1504#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);~counter~0 := 0; {1504#true} is VALID [2022-04-28 07:57:25,808 INFO L290 TraceCheckUtils]: 2: Hoare triple {1504#true} assume true; {1504#true} is VALID [2022-04-28 07:57:25,808 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1504#true} {1504#true} #61#return; {1504#true} is VALID [2022-04-28 07:57:25,808 INFO L272 TraceCheckUtils]: 4: Hoare triple {1504#true} call #t~ret6 := main(); {1504#true} is VALID [2022-04-28 07:57:25,808 INFO L290 TraceCheckUtils]: 5: Hoare triple {1504#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; {1504#true} is VALID [2022-04-28 07:57:25,809 INFO L272 TraceCheckUtils]: 6: Hoare triple {1504#true} call assume_abort_if_not((if ~k~0 <= 256 then 1 else 0)); {1504#true} is VALID [2022-04-28 07:57:25,809 INFO L290 TraceCheckUtils]: 7: Hoare triple {1504#true} ~cond := #in~cond; {1504#true} is VALID [2022-04-28 07:57:25,809 INFO L290 TraceCheckUtils]: 8: Hoare triple {1504#true} assume !(0 == ~cond); {1504#true} is VALID [2022-04-28 07:57:25,809 INFO L290 TraceCheckUtils]: 9: Hoare triple {1504#true} assume true; {1504#true} is VALID [2022-04-28 07:57:25,809 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1504#true} {1504#true} #53#return; {1504#true} is VALID [2022-04-28 07:57:25,809 INFO L290 TraceCheckUtils]: 11: Hoare triple {1504#true} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {1542#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-28 07:57:25,810 INFO L290 TraceCheckUtils]: 12: Hoare triple {1542#(and (= main_~c~0 0) (= main_~y~0 0))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {1542#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-28 07:57:25,810 INFO L290 TraceCheckUtils]: 13: Hoare triple {1542#(and (= main_~c~0 0) (= main_~y~0 0))} assume !!(#t~post5 < 5);havoc #t~post5; {1542#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-28 07:57:25,810 INFO L272 TraceCheckUtils]: 14: Hoare triple {1542#(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)); {1504#true} is VALID [2022-04-28 07:57:25,810 INFO L290 TraceCheckUtils]: 15: Hoare triple {1504#true} ~cond := #in~cond; {1504#true} is VALID [2022-04-28 07:57:25,810 INFO L290 TraceCheckUtils]: 16: Hoare triple {1504#true} assume !(0 == ~cond); {1504#true} is VALID [2022-04-28 07:57:25,810 INFO L290 TraceCheckUtils]: 17: Hoare triple {1504#true} assume true; {1504#true} is VALID [2022-04-28 07:57:25,811 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {1504#true} {1542#(and (= main_~c~0 0) (= main_~y~0 0))} #55#return; {1542#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-28 07:57:25,811 INFO L290 TraceCheckUtils]: 19: Hoare triple {1542#(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; {1567#(and (= (+ (- 1) main_~y~0) 0) (< 0 main_~k~0) (<= main_~c~0 1))} is VALID [2022-04-28 07:57:25,812 INFO L290 TraceCheckUtils]: 20: Hoare triple {1567#(and (= (+ (- 1) main_~y~0) 0) (< 0 main_~k~0) (<= main_~c~0 1))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {1567#(and (= (+ (- 1) main_~y~0) 0) (< 0 main_~k~0) (<= main_~c~0 1))} is VALID [2022-04-28 07:57:25,812 INFO L290 TraceCheckUtils]: 21: Hoare triple {1567#(and (= (+ (- 1) main_~y~0) 0) (< 0 main_~k~0) (<= main_~c~0 1))} assume !!(#t~post5 < 5);havoc #t~post5; {1567#(and (= (+ (- 1) main_~y~0) 0) (< 0 main_~k~0) (<= main_~c~0 1))} is VALID [2022-04-28 07:57:25,812 INFO L272 TraceCheckUtils]: 22: Hoare triple {1567#(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)); {1504#true} is VALID [2022-04-28 07:57:25,812 INFO L290 TraceCheckUtils]: 23: Hoare triple {1504#true} ~cond := #in~cond; {1504#true} is VALID [2022-04-28 07:57:25,812 INFO L290 TraceCheckUtils]: 24: Hoare triple {1504#true} assume !(0 == ~cond); {1504#true} is VALID [2022-04-28 07:57:25,813 INFO L290 TraceCheckUtils]: 25: Hoare triple {1504#true} assume true; {1504#true} is VALID [2022-04-28 07:57:25,813 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {1504#true} {1567#(and (= (+ (- 1) main_~y~0) 0) (< 0 main_~k~0) (<= main_~c~0 1))} #55#return; {1567#(and (= (+ (- 1) main_~y~0) 0) (< 0 main_~k~0) (<= main_~c~0 1))} is VALID [2022-04-28 07:57:25,813 INFO L290 TraceCheckUtils]: 27: Hoare triple {1567#(and (= (+ (- 1) main_~y~0) 0) (< 0 main_~k~0) (<= main_~c~0 1))} assume !(~c~0 < ~k~0); {1592#(and (= (+ (- 1) main_~y~0) 0) (<= main_~k~0 1) (< 0 main_~k~0))} is VALID [2022-04-28 07:57:25,814 INFO L272 TraceCheckUtils]: 28: Hoare triple {1592#(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)); {1504#true} is VALID [2022-04-28 07:57:25,814 INFO L290 TraceCheckUtils]: 29: Hoare triple {1504#true} ~cond := #in~cond; {1504#true} is VALID [2022-04-28 07:57:25,814 INFO L290 TraceCheckUtils]: 30: Hoare triple {1504#true} assume !(0 == ~cond); {1504#true} is VALID [2022-04-28 07:57:25,814 INFO L290 TraceCheckUtils]: 31: Hoare triple {1504#true} assume true; {1504#true} is VALID [2022-04-28 07:57:25,814 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {1504#true} {1592#(and (= (+ (- 1) main_~y~0) 0) (<= main_~k~0 1) (< 0 main_~k~0))} #57#return; {1592#(and (= (+ (- 1) main_~y~0) 0) (<= main_~k~0 1) (< 0 main_~k~0))} is VALID [2022-04-28 07:57:25,815 INFO L272 TraceCheckUtils]: 33: Hoare triple {1592#(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)); {1611#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 07:57:25,815 INFO L290 TraceCheckUtils]: 34: Hoare triple {1611#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1615#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 07:57:25,816 INFO L290 TraceCheckUtils]: 35: Hoare triple {1615#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1505#false} is VALID [2022-04-28 07:57:25,816 INFO L290 TraceCheckUtils]: 36: Hoare triple {1505#false} assume !false; {1505#false} is VALID [2022-04-28 07:57:25,816 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-04-28 07:57:25,816 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 07:57:26,048 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 07:57:26,048 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [53623719] [2022-04-28 07:57:26,048 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 07:57:26,048 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1542913611] [2022-04-28 07:57:26,048 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1542913611] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 07:57:26,048 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-28 07:57:26,048 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2022-04-28 07:57:26,049 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 07:57:26,049 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [827194559] [2022-04-28 07:57:26,049 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [827194559] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 07:57:26,049 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 07:57:26,049 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-28 07:57:26,049 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1369716872] [2022-04-28 07:57:26,049 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 07:57:26,049 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 states have internal predecessors, (19), 4 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) Word has length 37 [2022-04-28 07:57:26,049 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 07:57:26,050 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 7 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 states have internal predecessors, (19), 4 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) [2022-04-28 07:57:26,070 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:57:26,070 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-28 07:57:26,070 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 07:57:26,071 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-28 07:57:26,071 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2022-04-28 07:57:26,071 INFO L87 Difference]: Start difference. First operand 36 states and 38 transitions. Second operand has 7 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 states have internal predecessors, (19), 4 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) [2022-04-28 07:57:26,278 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 07:57:26,278 INFO L93 Difference]: Finished difference Result 44 states and 48 transitions. [2022-04-28 07:57:26,278 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-28 07:57:26,278 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 states have internal predecessors, (19), 4 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) Word has length 37 [2022-04-28 07:57:26,279 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 07:57:26,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 states have internal predecessors, (19), 4 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) [2022-04-28 07:57:26,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 44 transitions. [2022-04-28 07:57:26,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 states have internal predecessors, (19), 4 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) [2022-04-28 07:57:26,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 44 transitions. [2022-04-28 07:57:26,281 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 44 transitions. [2022-04-28 07:57:26,314 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:57:26,315 INFO L225 Difference]: With dead ends: 44 [2022-04-28 07:57:26,315 INFO L226 Difference]: Without dead ends: 38 [2022-04-28 07:57:26,316 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 46 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:57:26,316 INFO L413 NwaCegarLoop]: 31 mSDtfsCounter, 2 mSDsluCounter, 110 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 141 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 57 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 07:57:26,316 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 141 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 07:57:26,317 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2022-04-28 07:57:26,343 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2022-04-28 07:57:26,343 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 07:57:26,343 INFO L82 GeneralOperation]: Start isEquivalent. First operand 38 states. Second operand has 38 states, 25 states have (on average 1.08) internal successors, (27), 25 states have internal predecessors, (27), 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:57:26,344 INFO L74 IsIncluded]: Start isIncluded. First operand 38 states. Second operand has 38 states, 25 states have (on average 1.08) internal successors, (27), 25 states have internal predecessors, (27), 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:57:26,344 INFO L87 Difference]: Start difference. First operand 38 states. Second operand has 38 states, 25 states have (on average 1.08) internal successors, (27), 25 states have internal predecessors, (27), 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:57:26,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 07:57:26,345 INFO L93 Difference]: Finished difference Result 38 states and 41 transitions. [2022-04-28 07:57:26,345 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 41 transitions. [2022-04-28 07:57:26,345 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 07:57:26,345 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 07:57:26,346 INFO L74 IsIncluded]: Start isIncluded. First operand has 38 states, 25 states have (on average 1.08) internal successors, (27), 25 states have internal predecessors, (27), 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 38 states. [2022-04-28 07:57:26,346 INFO L87 Difference]: Start difference. First operand has 38 states, 25 states have (on average 1.08) internal successors, (27), 25 states have internal predecessors, (27), 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 38 states. [2022-04-28 07:57:26,347 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 07:57:26,347 INFO L93 Difference]: Finished difference Result 38 states and 41 transitions. [2022-04-28 07:57:26,347 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 41 transitions. [2022-04-28 07:57:26,347 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 07:57:26,347 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 07:57:26,347 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 07:57:26,347 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 07:57:26,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 25 states have (on average 1.08) internal successors, (27), 25 states have internal predecessors, (27), 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:57:26,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 41 transitions. [2022-04-28 07:57:26,349 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 41 transitions. Word has length 37 [2022-04-28 07:57:26,349 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 07:57:26,349 INFO L495 AbstractCegarLoop]: Abstraction has 38 states and 41 transitions. [2022-04-28 07:57:26,349 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 states have internal predecessors, (19), 4 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) [2022-04-28 07:57:26,349 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 38 states and 41 transitions. [2022-04-28 07:57:26,434 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 41 edges. 41 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 07:57:26,434 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 41 transitions. [2022-04-28 07:57:26,435 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-04-28 07:57:26,435 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 07:57:26,435 INFO L195 NwaCegarLoop]: trace histogram [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, 1] [2022-04-28 07:57:26,454 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:57:26,635 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:57:26,636 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 07:57:26,636 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 07:57:26,636 INFO L85 PathProgramCache]: Analyzing trace with hash -951509150, now seen corresponding path program 1 times [2022-04-28 07:57:26,636 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 07:57:26,636 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [146536884] [2022-04-28 07:57:26,762 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 4 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-28 07:57:26,763 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONLINEAR_UPDATE [2022-04-28 07:57:26,763 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 07:57:26,763 INFO L85 PathProgramCache]: Analyzing trace with hash -951509150, now seen corresponding path program 2 times [2022-04-28 07:57:26,763 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 07:57:26,763 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [741143481] [2022-04-28 07:57:26,763 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 07:57:26,763 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 07:57:26,771 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 07:57:26,772 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1396193863] [2022-04-28 07:57:26,772 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 07:57:26,772 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 07:57:26,772 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 07:57:26,773 INFO L229 MonitoredProcess]: Starting monitored process 7 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:57:26,819 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-04-28 07:57:26,855 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 07:57:26,855 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 07:57:26,856 INFO L263 TraceCheckSpWp]: Trace formula consists of 131 conjuncts, 9 conjunts are in the unsatisfiable core [2022-04-28 07:57:26,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 07:57:26,868 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 07:57:27,022 INFO L272 TraceCheckUtils]: 0: Hoare triple {1925#true} call ULTIMATE.init(); {1925#true} is VALID [2022-04-28 07:57:27,023 INFO L290 TraceCheckUtils]: 1: Hoare triple {1925#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);~counter~0 := 0; {1933#(<= ~counter~0 0)} is VALID [2022-04-28 07:57:27,023 INFO L290 TraceCheckUtils]: 2: Hoare triple {1933#(<= ~counter~0 0)} assume true; {1933#(<= ~counter~0 0)} is VALID [2022-04-28 07:57:27,023 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1933#(<= ~counter~0 0)} {1925#true} #61#return; {1933#(<= ~counter~0 0)} is VALID [2022-04-28 07:57:27,024 INFO L272 TraceCheckUtils]: 4: Hoare triple {1933#(<= ~counter~0 0)} call #t~ret6 := main(); {1933#(<= ~counter~0 0)} is VALID [2022-04-28 07:57:27,025 INFO L290 TraceCheckUtils]: 5: Hoare triple {1933#(<= ~counter~0 0)} 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; {1933#(<= ~counter~0 0)} is VALID [2022-04-28 07:57:27,025 INFO L272 TraceCheckUtils]: 6: Hoare triple {1933#(<= ~counter~0 0)} call assume_abort_if_not((if ~k~0 <= 256 then 1 else 0)); {1933#(<= ~counter~0 0)} is VALID [2022-04-28 07:57:27,026 INFO L290 TraceCheckUtils]: 7: Hoare triple {1933#(<= ~counter~0 0)} ~cond := #in~cond; {1933#(<= ~counter~0 0)} is VALID [2022-04-28 07:57:27,026 INFO L290 TraceCheckUtils]: 8: Hoare triple {1933#(<= ~counter~0 0)} assume !(0 == ~cond); {1933#(<= ~counter~0 0)} is VALID [2022-04-28 07:57:27,026 INFO L290 TraceCheckUtils]: 9: Hoare triple {1933#(<= ~counter~0 0)} assume true; {1933#(<= ~counter~0 0)} is VALID [2022-04-28 07:57:27,026 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1933#(<= ~counter~0 0)} {1933#(<= ~counter~0 0)} #53#return; {1933#(<= ~counter~0 0)} is VALID [2022-04-28 07:57:27,027 INFO L290 TraceCheckUtils]: 11: Hoare triple {1933#(<= ~counter~0 0)} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {1933#(<= ~counter~0 0)} is VALID [2022-04-28 07:57:27,027 INFO L290 TraceCheckUtils]: 12: Hoare triple {1933#(<= ~counter~0 0)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {1967#(<= ~counter~0 1)} is VALID [2022-04-28 07:57:27,028 INFO L290 TraceCheckUtils]: 13: Hoare triple {1967#(<= ~counter~0 1)} assume !!(#t~post5 < 5);havoc #t~post5; {1967#(<= ~counter~0 1)} is VALID [2022-04-28 07:57:27,028 INFO L272 TraceCheckUtils]: 14: Hoare triple {1967#(<= ~counter~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)); {1967#(<= ~counter~0 1)} is VALID [2022-04-28 07:57:27,028 INFO L290 TraceCheckUtils]: 15: Hoare triple {1967#(<= ~counter~0 1)} ~cond := #in~cond; {1967#(<= ~counter~0 1)} is VALID [2022-04-28 07:57:27,028 INFO L290 TraceCheckUtils]: 16: Hoare triple {1967#(<= ~counter~0 1)} assume !(0 == ~cond); {1967#(<= ~counter~0 1)} is VALID [2022-04-28 07:57:27,029 INFO L290 TraceCheckUtils]: 17: Hoare triple {1967#(<= ~counter~0 1)} assume true; {1967#(<= ~counter~0 1)} is VALID [2022-04-28 07:57:27,029 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {1967#(<= ~counter~0 1)} {1967#(<= ~counter~0 1)} #55#return; {1967#(<= ~counter~0 1)} is VALID [2022-04-28 07:57:27,029 INFO L290 TraceCheckUtils]: 19: Hoare triple {1967#(<= ~counter~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; {1967#(<= ~counter~0 1)} is VALID [2022-04-28 07:57:27,030 INFO L290 TraceCheckUtils]: 20: Hoare triple {1967#(<= ~counter~0 1)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {1992#(<= ~counter~0 2)} is VALID [2022-04-28 07:57:27,030 INFO L290 TraceCheckUtils]: 21: Hoare triple {1992#(<= ~counter~0 2)} assume !!(#t~post5 < 5);havoc #t~post5; {1992#(<= ~counter~0 2)} is VALID [2022-04-28 07:57:27,031 INFO L272 TraceCheckUtils]: 22: Hoare triple {1992#(<= ~counter~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)); {1992#(<= ~counter~0 2)} is VALID [2022-04-28 07:57:27,031 INFO L290 TraceCheckUtils]: 23: Hoare triple {1992#(<= ~counter~0 2)} ~cond := #in~cond; {1992#(<= ~counter~0 2)} is VALID [2022-04-28 07:57:27,031 INFO L290 TraceCheckUtils]: 24: Hoare triple {1992#(<= ~counter~0 2)} assume !(0 == ~cond); {1992#(<= ~counter~0 2)} is VALID [2022-04-28 07:57:27,031 INFO L290 TraceCheckUtils]: 25: Hoare triple {1992#(<= ~counter~0 2)} assume true; {1992#(<= ~counter~0 2)} is VALID [2022-04-28 07:57:27,032 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {1992#(<= ~counter~0 2)} {1992#(<= ~counter~0 2)} #55#return; {1992#(<= ~counter~0 2)} is VALID [2022-04-28 07:57:27,032 INFO L290 TraceCheckUtils]: 27: Hoare triple {1992#(<= ~counter~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; {1992#(<= ~counter~0 2)} is VALID [2022-04-28 07:57:27,033 INFO L290 TraceCheckUtils]: 28: Hoare triple {1992#(<= ~counter~0 2)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {2017#(<= |main_#t~post5| 2)} is VALID [2022-04-28 07:57:27,033 INFO L290 TraceCheckUtils]: 29: Hoare triple {2017#(<= |main_#t~post5| 2)} assume !(#t~post5 < 5);havoc #t~post5; {1926#false} is VALID [2022-04-28 07:57:27,033 INFO L272 TraceCheckUtils]: 30: Hoare triple {1926#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)); {1926#false} is VALID [2022-04-28 07:57:27,033 INFO L290 TraceCheckUtils]: 31: Hoare triple {1926#false} ~cond := #in~cond; {1926#false} is VALID [2022-04-28 07:57:27,033 INFO L290 TraceCheckUtils]: 32: Hoare triple {1926#false} assume !(0 == ~cond); {1926#false} is VALID [2022-04-28 07:57:27,033 INFO L290 TraceCheckUtils]: 33: Hoare triple {1926#false} assume true; {1926#false} is VALID [2022-04-28 07:57:27,034 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {1926#false} {1926#false} #57#return; {1926#false} is VALID [2022-04-28 07:57:27,034 INFO L272 TraceCheckUtils]: 35: Hoare triple {1926#false} call __VERIFIER_assert((if ~k~0 * ~y~0 == ~y~0 * ~y~0 then 1 else 0)); {1926#false} is VALID [2022-04-28 07:57:27,034 INFO L290 TraceCheckUtils]: 36: Hoare triple {1926#false} ~cond := #in~cond; {1926#false} is VALID [2022-04-28 07:57:27,034 INFO L290 TraceCheckUtils]: 37: Hoare triple {1926#false} assume 0 == ~cond; {1926#false} is VALID [2022-04-28 07:57:27,038 INFO L290 TraceCheckUtils]: 38: Hoare triple {1926#false} assume !false; {1926#false} is VALID [2022-04-28 07:57:27,039 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 12 proven. 12 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-28 07:57:27,039 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 07:57:27,207 INFO L290 TraceCheckUtils]: 38: Hoare triple {1926#false} assume !false; {1926#false} is VALID [2022-04-28 07:57:27,208 INFO L290 TraceCheckUtils]: 37: Hoare triple {1926#false} assume 0 == ~cond; {1926#false} is VALID [2022-04-28 07:57:27,208 INFO L290 TraceCheckUtils]: 36: Hoare triple {1926#false} ~cond := #in~cond; {1926#false} is VALID [2022-04-28 07:57:27,208 INFO L272 TraceCheckUtils]: 35: Hoare triple {1926#false} call __VERIFIER_assert((if ~k~0 * ~y~0 == ~y~0 * ~y~0 then 1 else 0)); {1926#false} is VALID [2022-04-28 07:57:27,208 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {1925#true} {1926#false} #57#return; {1926#false} is VALID [2022-04-28 07:57:27,208 INFO L290 TraceCheckUtils]: 33: Hoare triple {1925#true} assume true; {1925#true} is VALID [2022-04-28 07:57:27,208 INFO L290 TraceCheckUtils]: 32: Hoare triple {1925#true} assume !(0 == ~cond); {1925#true} is VALID [2022-04-28 07:57:27,208 INFO L290 TraceCheckUtils]: 31: Hoare triple {1925#true} ~cond := #in~cond; {1925#true} is VALID [2022-04-28 07:57:27,208 INFO L272 TraceCheckUtils]: 30: Hoare triple {1926#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)); {1925#true} is VALID [2022-04-28 07:57:27,209 INFO L290 TraceCheckUtils]: 29: Hoare triple {2075#(< |main_#t~post5| 5)} assume !(#t~post5 < 5);havoc #t~post5; {1926#false} is VALID [2022-04-28 07:57:27,210 INFO L290 TraceCheckUtils]: 28: Hoare triple {2079#(< ~counter~0 5)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {2075#(< |main_#t~post5| 5)} is VALID [2022-04-28 07:57:27,211 INFO L290 TraceCheckUtils]: 27: Hoare triple {2079#(< ~counter~0 5)} 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; {2079#(< ~counter~0 5)} is VALID [2022-04-28 07:57:27,211 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {1925#true} {2079#(< ~counter~0 5)} #55#return; {2079#(< ~counter~0 5)} is VALID [2022-04-28 07:57:27,211 INFO L290 TraceCheckUtils]: 25: Hoare triple {1925#true} assume true; {1925#true} is VALID [2022-04-28 07:57:27,211 INFO L290 TraceCheckUtils]: 24: Hoare triple {1925#true} assume !(0 == ~cond); {1925#true} is VALID [2022-04-28 07:57:27,211 INFO L290 TraceCheckUtils]: 23: Hoare triple {1925#true} ~cond := #in~cond; {1925#true} is VALID [2022-04-28 07:57:27,212 INFO L272 TraceCheckUtils]: 22: Hoare triple {2079#(< ~counter~0 5)} 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)); {1925#true} is VALID [2022-04-28 07:57:27,214 INFO L290 TraceCheckUtils]: 21: Hoare triple {2079#(< ~counter~0 5)} assume !!(#t~post5 < 5);havoc #t~post5; {2079#(< ~counter~0 5)} is VALID [2022-04-28 07:57:27,215 INFO L290 TraceCheckUtils]: 20: Hoare triple {2104#(< ~counter~0 4)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {2079#(< ~counter~0 5)} is VALID [2022-04-28 07:57:27,215 INFO L290 TraceCheckUtils]: 19: Hoare triple {2104#(< ~counter~0 4)} 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; {2104#(< ~counter~0 4)} is VALID [2022-04-28 07:57:27,215 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {1925#true} {2104#(< ~counter~0 4)} #55#return; {2104#(< ~counter~0 4)} is VALID [2022-04-28 07:57:27,215 INFO L290 TraceCheckUtils]: 17: Hoare triple {1925#true} assume true; {1925#true} is VALID [2022-04-28 07:57:27,216 INFO L290 TraceCheckUtils]: 16: Hoare triple {1925#true} assume !(0 == ~cond); {1925#true} is VALID [2022-04-28 07:57:27,216 INFO L290 TraceCheckUtils]: 15: Hoare triple {1925#true} ~cond := #in~cond; {1925#true} is VALID [2022-04-28 07:57:27,216 INFO L272 TraceCheckUtils]: 14: Hoare triple {2104#(< ~counter~0 4)} 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)); {1925#true} is VALID [2022-04-28 07:57:27,216 INFO L290 TraceCheckUtils]: 13: Hoare triple {2104#(< ~counter~0 4)} assume !!(#t~post5 < 5);havoc #t~post5; {2104#(< ~counter~0 4)} is VALID [2022-04-28 07:57:27,216 INFO L290 TraceCheckUtils]: 12: Hoare triple {1992#(<= ~counter~0 2)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {2104#(< ~counter~0 4)} is VALID [2022-04-28 07:57:27,217 INFO L290 TraceCheckUtils]: 11: Hoare triple {1992#(<= ~counter~0 2)} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {1992#(<= ~counter~0 2)} is VALID [2022-04-28 07:57:27,217 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1925#true} {1992#(<= ~counter~0 2)} #53#return; {1992#(<= ~counter~0 2)} is VALID [2022-04-28 07:57:27,217 INFO L290 TraceCheckUtils]: 9: Hoare triple {1925#true} assume true; {1925#true} is VALID [2022-04-28 07:57:27,217 INFO L290 TraceCheckUtils]: 8: Hoare triple {1925#true} assume !(0 == ~cond); {1925#true} is VALID [2022-04-28 07:57:27,217 INFO L290 TraceCheckUtils]: 7: Hoare triple {1925#true} ~cond := #in~cond; {1925#true} is VALID [2022-04-28 07:57:27,217 INFO L272 TraceCheckUtils]: 6: Hoare triple {1992#(<= ~counter~0 2)} call assume_abort_if_not((if ~k~0 <= 256 then 1 else 0)); {1925#true} is VALID [2022-04-28 07:57:27,218 INFO L290 TraceCheckUtils]: 5: Hoare triple {1992#(<= ~counter~0 2)} 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; {1992#(<= ~counter~0 2)} is VALID [2022-04-28 07:57:27,218 INFO L272 TraceCheckUtils]: 4: Hoare triple {1992#(<= ~counter~0 2)} call #t~ret6 := main(); {1992#(<= ~counter~0 2)} is VALID [2022-04-28 07:57:27,218 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1992#(<= ~counter~0 2)} {1925#true} #61#return; {1992#(<= ~counter~0 2)} is VALID [2022-04-28 07:57:27,219 INFO L290 TraceCheckUtils]: 2: Hoare triple {1992#(<= ~counter~0 2)} assume true; {1992#(<= ~counter~0 2)} is VALID [2022-04-28 07:57:27,219 INFO L290 TraceCheckUtils]: 1: Hoare triple {1925#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);~counter~0 := 0; {1992#(<= ~counter~0 2)} is VALID [2022-04-28 07:57:27,219 INFO L272 TraceCheckUtils]: 0: Hoare triple {1925#true} call ULTIMATE.init(); {1925#true} is VALID [2022-04-28 07:57:27,219 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 6 proven. 8 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-04-28 07:57:27,219 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 07:57:27,220 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [741143481] [2022-04-28 07:57:27,220 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 07:57:27,220 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1396193863] [2022-04-28 07:57:27,220 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1396193863] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 07:57:27,220 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 07:57:27,220 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 9 [2022-04-28 07:57:27,220 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 07:57:27,220 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [146536884] [2022-04-28 07:57:27,220 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [146536884] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 07:57:27,220 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 07:57:27,220 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-28 07:57:27,220 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1626714553] [2022-04-28 07:57:27,220 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 07:57:27,221 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.333333333333333) internal successors, (26), 5 states have internal predecessors, (26), 5 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (5), 4 states have call predecessors, (5), 5 states have call successors, (5) Word has length 39 [2022-04-28 07:57:27,221 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 07:57:27,221 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 4.333333333333333) internal successors, (26), 5 states have internal predecessors, (26), 5 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (5), 4 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-28 07:57:27,245 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 38 edges. 38 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 07:57:27,245 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-28 07:57:27,245 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 07:57:27,246 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-28 07:57:27,246 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2022-04-28 07:57:27,246 INFO L87 Difference]: Start difference. First operand 38 states and 41 transitions. Second operand has 6 states, 6 states have (on average 4.333333333333333) internal successors, (26), 5 states have internal predecessors, (26), 5 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (5), 4 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-28 07:57:27,357 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 07:57:27,357 INFO L93 Difference]: Finished difference Result 54 states and 56 transitions. [2022-04-28 07:57:27,358 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-28 07:57:27,358 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.333333333333333) internal successors, (26), 5 states have internal predecessors, (26), 5 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (5), 4 states have call predecessors, (5), 5 states have call successors, (5) Word has length 39 [2022-04-28 07:57:27,358 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 07:57:27,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 4.333333333333333) internal successors, (26), 5 states have internal predecessors, (26), 5 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (5), 4 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-28 07:57:27,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 54 transitions. [2022-04-28 07:57:27,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 4.333333333333333) internal successors, (26), 5 states have internal predecessors, (26), 5 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (5), 4 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-28 07:57:27,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 54 transitions. [2022-04-28 07:57:27,360 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 54 transitions. [2022-04-28 07:57:27,395 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 54 edges. 54 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 07:57:27,396 INFO L225 Difference]: With dead ends: 54 [2022-04-28 07:57:27,396 INFO L226 Difference]: Without dead ends: 44 [2022-04-28 07:57:27,396 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 69 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=42, Invalid=68, Unknown=0, NotChecked=0, Total=110 [2022-04-28 07:57:27,396 INFO L413 NwaCegarLoop]: 27 mSDtfsCounter, 12 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 84 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 07:57:27,397 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 84 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 07:57:27,397 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2022-04-28 07:57:27,425 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2022-04-28 07:57:27,426 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 07:57:27,426 INFO L82 GeneralOperation]: Start isEquivalent. First operand 44 states. Second operand has 44 states, 30 states have (on average 1.0666666666666667) internal successors, (32), 30 states have internal predecessors, (32), 8 states have call successors, (8), 7 states have call predecessors, (8), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-28 07:57:27,426 INFO L74 IsIncluded]: Start isIncluded. First operand 44 states. Second operand has 44 states, 30 states have (on average 1.0666666666666667) internal successors, (32), 30 states have internal predecessors, (32), 8 states have call successors, (8), 7 states have call predecessors, (8), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-28 07:57:27,426 INFO L87 Difference]: Start difference. First operand 44 states. Second operand has 44 states, 30 states have (on average 1.0666666666666667) internal successors, (32), 30 states have internal predecessors, (32), 8 states have call successors, (8), 7 states have call predecessors, (8), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-28 07:57:27,427 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 07:57:27,427 INFO L93 Difference]: Finished difference Result 44 states and 46 transitions. [2022-04-28 07:57:27,428 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 46 transitions. [2022-04-28 07:57:27,428 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 07:57:27,428 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 07:57:27,428 INFO L74 IsIncluded]: Start isIncluded. First operand has 44 states, 30 states have (on average 1.0666666666666667) internal successors, (32), 30 states have internal predecessors, (32), 8 states have call successors, (8), 7 states have call predecessors, (8), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand 44 states. [2022-04-28 07:57:27,428 INFO L87 Difference]: Start difference. First operand has 44 states, 30 states have (on average 1.0666666666666667) internal successors, (32), 30 states have internal predecessors, (32), 8 states have call successors, (8), 7 states have call predecessors, (8), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand 44 states. [2022-04-28 07:57:27,429 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 07:57:27,429 INFO L93 Difference]: Finished difference Result 44 states and 46 transitions. [2022-04-28 07:57:27,429 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 46 transitions. [2022-04-28 07:57:27,429 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 07:57:27,429 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 07:57:27,429 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 07:57:27,429 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 07:57:27,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 30 states have (on average 1.0666666666666667) internal successors, (32), 30 states have internal predecessors, (32), 8 states have call successors, (8), 7 states have call predecessors, (8), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-28 07:57:27,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 46 transitions. [2022-04-28 07:57:27,431 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 46 transitions. Word has length 39 [2022-04-28 07:57:27,431 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 07:57:27,431 INFO L495 AbstractCegarLoop]: Abstraction has 44 states and 46 transitions. [2022-04-28 07:57:27,431 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.333333333333333) internal successors, (26), 5 states have internal predecessors, (26), 5 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (5), 4 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-28 07:57:27,431 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 44 states and 46 transitions. [2022-04-28 07:57:27,515 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:57:27,515 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 46 transitions. [2022-04-28 07:57:27,516 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-04-28 07:57:27,516 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 07:57:27,516 INFO L195 NwaCegarLoop]: trace histogram [5, 4, 4, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 07:57:27,534 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-04-28 07:57:27,716 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 07:57:27,717 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 07:57:27,717 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 07:57:27,717 INFO L85 PathProgramCache]: Analyzing trace with hash 1537538120, now seen corresponding path program 3 times [2022-04-28 07:57:27,717 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 07:57:27,717 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [950820826] [2022-04-28 07:57:27,838 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 4 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-28 07:57:27,838 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONLINEAR_UPDATE [2022-04-28 07:57:27,838 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 07:57:27,838 INFO L85 PathProgramCache]: Analyzing trace with hash 1537538120, now seen corresponding path program 4 times [2022-04-28 07:57:27,838 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 07:57:27,838 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1388046385] [2022-04-28 07:57:27,838 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 07:57:27,839 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 07:57:27,847 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 07:57:27,847 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1790042927] [2022-04-28 07:57:27,848 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 07:57:27,848 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 07:57:27,848 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 07:57:27,852 INFO L229 MonitoredProcess]: Starting monitored process 8 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:57:27,877 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-04-28 07:57:27,900 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 07:57:27,901 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 07:57:27,901 INFO L263 TraceCheckSpWp]: Trace formula consists of 92 conjuncts, 16 conjunts are in the unsatisfiable core [2022-04-28 07:57:27,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 07:57:27,917 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 07:57:28,165 INFO L272 TraceCheckUtils]: 0: Hoare triple {2455#true} call ULTIMATE.init(); {2455#true} is VALID [2022-04-28 07:57:28,165 INFO L290 TraceCheckUtils]: 1: Hoare triple {2455#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);~counter~0 := 0; {2455#true} is VALID [2022-04-28 07:57:28,165 INFO L290 TraceCheckUtils]: 2: Hoare triple {2455#true} assume true; {2455#true} is VALID [2022-04-28 07:57:28,165 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2455#true} {2455#true} #61#return; {2455#true} is VALID [2022-04-28 07:57:28,165 INFO L272 TraceCheckUtils]: 4: Hoare triple {2455#true} call #t~ret6 := main(); {2455#true} is VALID [2022-04-28 07:57:28,165 INFO L290 TraceCheckUtils]: 5: Hoare triple {2455#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; {2455#true} is VALID [2022-04-28 07:57:28,165 INFO L272 TraceCheckUtils]: 6: Hoare triple {2455#true} call assume_abort_if_not((if ~k~0 <= 256 then 1 else 0)); {2455#true} is VALID [2022-04-28 07:57:28,165 INFO L290 TraceCheckUtils]: 7: Hoare triple {2455#true} ~cond := #in~cond; {2455#true} is VALID [2022-04-28 07:57:28,165 INFO L290 TraceCheckUtils]: 8: Hoare triple {2455#true} assume !(0 == ~cond); {2455#true} is VALID [2022-04-28 07:57:28,166 INFO L290 TraceCheckUtils]: 9: Hoare triple {2455#true} assume true; {2455#true} is VALID [2022-04-28 07:57:28,166 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {2455#true} {2455#true} #53#return; {2455#true} is VALID [2022-04-28 07:57:28,166 INFO L290 TraceCheckUtils]: 11: Hoare triple {2455#true} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {2493#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-28 07:57:28,166 INFO L290 TraceCheckUtils]: 12: Hoare triple {2493#(and (= main_~c~0 0) (= main_~y~0 0))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {2493#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-28 07:57:28,167 INFO L290 TraceCheckUtils]: 13: Hoare triple {2493#(and (= main_~c~0 0) (= main_~y~0 0))} assume !!(#t~post5 < 5);havoc #t~post5; {2493#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-28 07:57:28,167 INFO L272 TraceCheckUtils]: 14: Hoare triple {2493#(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)); {2455#true} is VALID [2022-04-28 07:57:28,167 INFO L290 TraceCheckUtils]: 15: Hoare triple {2455#true} ~cond := #in~cond; {2455#true} is VALID [2022-04-28 07:57:28,167 INFO L290 TraceCheckUtils]: 16: Hoare triple {2455#true} assume !(0 == ~cond); {2455#true} is VALID [2022-04-28 07:57:28,167 INFO L290 TraceCheckUtils]: 17: Hoare triple {2455#true} assume true; {2455#true} is VALID [2022-04-28 07:57:28,168 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {2455#true} {2493#(and (= main_~c~0 0) (= main_~y~0 0))} #55#return; {2493#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-28 07:57:28,169 INFO L290 TraceCheckUtils]: 19: Hoare triple {2493#(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; {2518#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} is VALID [2022-04-28 07:57:28,169 INFO L290 TraceCheckUtils]: 20: Hoare triple {2518#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {2518#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} is VALID [2022-04-28 07:57:28,169 INFO L290 TraceCheckUtils]: 21: Hoare triple {2518#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} assume !!(#t~post5 < 5);havoc #t~post5; {2518#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} is VALID [2022-04-28 07:57:28,169 INFO L272 TraceCheckUtils]: 22: Hoare triple {2518#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~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)); {2455#true} is VALID [2022-04-28 07:57:28,169 INFO L290 TraceCheckUtils]: 23: Hoare triple {2455#true} ~cond := #in~cond; {2455#true} is VALID [2022-04-28 07:57:28,170 INFO L290 TraceCheckUtils]: 24: Hoare triple {2455#true} assume !(0 == ~cond); {2455#true} is VALID [2022-04-28 07:57:28,170 INFO L290 TraceCheckUtils]: 25: Hoare triple {2455#true} assume true; {2455#true} is VALID [2022-04-28 07:57:28,171 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {2455#true} {2518#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} #55#return; {2518#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} is VALID [2022-04-28 07:57:28,171 INFO L290 TraceCheckUtils]: 27: Hoare triple {2518#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~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; {2543#(and (= main_~y~0 2) (< 1 main_~k~0) (<= main_~c~0 2))} is VALID [2022-04-28 07:57:28,172 INFO L290 TraceCheckUtils]: 28: Hoare triple {2543#(and (= main_~y~0 2) (< 1 main_~k~0) (<= main_~c~0 2))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {2543#(and (= main_~y~0 2) (< 1 main_~k~0) (<= main_~c~0 2))} is VALID [2022-04-28 07:57:28,172 INFO L290 TraceCheckUtils]: 29: Hoare triple {2543#(and (= main_~y~0 2) (< 1 main_~k~0) (<= main_~c~0 2))} assume !!(#t~post5 < 5);havoc #t~post5; {2543#(and (= main_~y~0 2) (< 1 main_~k~0) (<= main_~c~0 2))} is VALID [2022-04-28 07:57:28,172 INFO L272 TraceCheckUtils]: 30: Hoare triple {2543#(and (= main_~y~0 2) (< 1 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)); {2455#true} is VALID [2022-04-28 07:57:28,172 INFO L290 TraceCheckUtils]: 31: Hoare triple {2455#true} ~cond := #in~cond; {2455#true} is VALID [2022-04-28 07:57:28,172 INFO L290 TraceCheckUtils]: 32: Hoare triple {2455#true} assume !(0 == ~cond); {2455#true} is VALID [2022-04-28 07:57:28,172 INFO L290 TraceCheckUtils]: 33: Hoare triple {2455#true} assume true; {2455#true} is VALID [2022-04-28 07:57:28,173 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {2455#true} {2543#(and (= main_~y~0 2) (< 1 main_~k~0) (<= main_~c~0 2))} #55#return; {2543#(and (= main_~y~0 2) (< 1 main_~k~0) (<= main_~c~0 2))} is VALID [2022-04-28 07:57:28,173 INFO L290 TraceCheckUtils]: 35: Hoare triple {2543#(and (= main_~y~0 2) (< 1 main_~k~0) (<= main_~c~0 2))} assume !(~c~0 < ~k~0); {2568#(and (= main_~y~0 2) (< 1 main_~k~0) (<= main_~k~0 2))} is VALID [2022-04-28 07:57:28,173 INFO L272 TraceCheckUtils]: 36: Hoare triple {2568#(and (= main_~y~0 2) (< 1 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)); {2455#true} is VALID [2022-04-28 07:57:28,173 INFO L290 TraceCheckUtils]: 37: Hoare triple {2455#true} ~cond := #in~cond; {2455#true} is VALID [2022-04-28 07:57:28,174 INFO L290 TraceCheckUtils]: 38: Hoare triple {2455#true} assume !(0 == ~cond); {2455#true} is VALID [2022-04-28 07:57:28,174 INFO L290 TraceCheckUtils]: 39: Hoare triple {2455#true} assume true; {2455#true} is VALID [2022-04-28 07:57:28,174 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {2455#true} {2568#(and (= main_~y~0 2) (< 1 main_~k~0) (<= main_~k~0 2))} #57#return; {2568#(and (= main_~y~0 2) (< 1 main_~k~0) (<= main_~k~0 2))} is VALID [2022-04-28 07:57:28,175 INFO L272 TraceCheckUtils]: 41: Hoare triple {2568#(and (= main_~y~0 2) (< 1 main_~k~0) (<= main_~k~0 2))} call __VERIFIER_assert((if ~k~0 * ~y~0 == ~y~0 * ~y~0 then 1 else 0)); {2587#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 07:57:28,175 INFO L290 TraceCheckUtils]: 42: Hoare triple {2587#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {2591#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 07:57:28,175 INFO L290 TraceCheckUtils]: 43: Hoare triple {2591#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {2456#false} is VALID [2022-04-28 07:57:28,175 INFO L290 TraceCheckUtils]: 44: Hoare triple {2456#false} assume !false; {2456#false} is VALID [2022-04-28 07:57:28,175 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 8 proven. 12 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-04-28 07:57:28,176 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 07:57:28,452 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 07:57:28,452 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1388046385] [2022-04-28 07:57:28,452 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 07:57:28,452 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1790042927] [2022-04-28 07:57:28,453 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1790042927] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 07:57:28,453 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-28 07:57:28,453 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2022-04-28 07:57:28,453 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 07:57:28,453 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [950820826] [2022-04-28 07:57:28,453 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [950820826] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 07:57:28,453 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 07:57:28,453 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-28 07:57:28,453 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1882238291] [2022-04-28 07:57:28,453 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 07:57:28,454 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 5 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) Word has length 45 [2022-04-28 07:57:28,454 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 07:57:28,454 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 8 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 5 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) [2022-04-28 07:57:28,480 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 36 edges. 36 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 07:57:28,481 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-28 07:57:28,481 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 07:57:28,481 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-28 07:57:28,481 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2022-04-28 07:57:28,481 INFO L87 Difference]: Start difference. First operand 44 states and 46 transitions. Second operand has 8 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 5 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) [2022-04-28 07:57:28,760 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 07:57:28,761 INFO L93 Difference]: Finished difference Result 52 states and 56 transitions. [2022-04-28 07:57:28,761 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-28 07:57:28,761 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 5 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) Word has length 45 [2022-04-28 07:57:28,761 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 07:57:28,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 5 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) [2022-04-28 07:57:28,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 49 transitions. [2022-04-28 07:57:28,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 5 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) [2022-04-28 07:57:28,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 49 transitions. [2022-04-28 07:57:28,764 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 49 transitions. [2022-04-28 07:57:28,791 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 49 edges. 49 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 07:57:28,792 INFO L225 Difference]: With dead ends: 52 [2022-04-28 07:57:28,792 INFO L226 Difference]: Without dead ends: 46 [2022-04-28 07:57:28,793 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 53 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:57:28,793 INFO L413 NwaCegarLoop]: 35 mSDtfsCounter, 2 mSDsluCounter, 144 mSDsCounter, 0 mSdLazyCounter, 85 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 179 SdHoareTripleChecker+Invalid, 86 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 85 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 07:57:28,793 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 179 Invalid, 86 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 85 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 07:57:28,793 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2022-04-28 07:57:28,850 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2022-04-28 07:57:28,850 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 07:57:28,851 INFO L82 GeneralOperation]: Start isEquivalent. First operand 46 states. Second operand has 46 states, 31 states have (on average 1.064516129032258) internal successors, (33), 31 states have internal predecessors, (33), 9 states have call successors, (9), 7 states have call predecessors, (9), 5 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-28 07:57:28,851 INFO L74 IsIncluded]: Start isIncluded. First operand 46 states. Second operand has 46 states, 31 states have (on average 1.064516129032258) internal successors, (33), 31 states have internal predecessors, (33), 9 states have call successors, (9), 7 states have call predecessors, (9), 5 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-28 07:57:28,852 INFO L87 Difference]: Start difference. First operand 46 states. Second operand has 46 states, 31 states have (on average 1.064516129032258) internal successors, (33), 31 states have internal predecessors, (33), 9 states have call successors, (9), 7 states have call predecessors, (9), 5 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-28 07:57:28,853 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 07:57:28,853 INFO L93 Difference]: Finished difference Result 46 states and 49 transitions. [2022-04-28 07:57:28,853 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 49 transitions. [2022-04-28 07:57:28,854 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 07:57:28,854 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 07:57:28,860 INFO L74 IsIncluded]: Start isIncluded. First operand has 46 states, 31 states have (on average 1.064516129032258) internal successors, (33), 31 states have internal predecessors, (33), 9 states have call successors, (9), 7 states have call predecessors, (9), 5 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Second operand 46 states. [2022-04-28 07:57:28,861 INFO L87 Difference]: Start difference. First operand has 46 states, 31 states have (on average 1.064516129032258) internal successors, (33), 31 states have internal predecessors, (33), 9 states have call successors, (9), 7 states have call predecessors, (9), 5 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Second operand 46 states. [2022-04-28 07:57:28,862 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 07:57:28,862 INFO L93 Difference]: Finished difference Result 46 states and 49 transitions. [2022-04-28 07:57:28,862 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 49 transitions. [2022-04-28 07:57:28,862 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 07:57:28,862 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 07:57:28,862 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 07:57:28,862 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 07:57:28,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 31 states have (on average 1.064516129032258) internal successors, (33), 31 states have internal predecessors, (33), 9 states have call successors, (9), 7 states have call predecessors, (9), 5 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-28 07:57:28,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 49 transitions. [2022-04-28 07:57:28,864 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 49 transitions. Word has length 45 [2022-04-28 07:57:28,864 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 07:57:28,864 INFO L495 AbstractCegarLoop]: Abstraction has 46 states and 49 transitions. [2022-04-28 07:57:28,864 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 5 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) [2022-04-28 07:57:28,864 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 46 states and 49 transitions. [2022-04-28 07:57:29,001 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 49 edges. 49 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 07:57:29,001 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 49 transitions. [2022-04-28 07:57:29,002 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2022-04-28 07:57:29,002 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 07:57:29,002 INFO L195 NwaCegarLoop]: trace histogram [5, 4, 4, 4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 07:57:29,023 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2022-04-28 07:57:29,202 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 07:57:29,203 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 07:57:29,203 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 07:57:29,203 INFO L85 PathProgramCache]: Analyzing trace with hash -1448798205, now seen corresponding path program 3 times [2022-04-28 07:57:29,203 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 07:57:29,203 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [865527743] [2022-04-28 07:57:29,309 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 4 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-28 07:57:29,309 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONLINEAR_UPDATE [2022-04-28 07:57:29,309 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 07:57:29,309 INFO L85 PathProgramCache]: Analyzing trace with hash -1448798205, now seen corresponding path program 4 times [2022-04-28 07:57:29,309 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 07:57:29,310 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1580554439] [2022-04-28 07:57:29,310 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 07:57:29,310 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 07:57:29,332 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 07:57:29,332 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1312649119] [2022-04-28 07:57:29,332 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 07:57:29,333 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 07:57:29,333 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 07:57:29,352 INFO L229 MonitoredProcess]: Starting monitored process 9 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:57:29,388 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-04-28 07:57:29,426 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 07:57:29,427 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 07:57:29,427 INFO L263 TraceCheckSpWp]: Trace formula consists of 152 conjuncts, 11 conjunts are in the unsatisfiable core [2022-04-28 07:57:29,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 07:57:29,441 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 07:57:29,620 INFO L272 TraceCheckUtils]: 0: Hoare triple {2949#true} call ULTIMATE.init(); {2949#true} is VALID [2022-04-28 07:57:29,621 INFO L290 TraceCheckUtils]: 1: Hoare triple {2949#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);~counter~0 := 0; {2957#(<= ~counter~0 0)} is VALID [2022-04-28 07:57:29,621 INFO L290 TraceCheckUtils]: 2: Hoare triple {2957#(<= ~counter~0 0)} assume true; {2957#(<= ~counter~0 0)} is VALID [2022-04-28 07:57:29,622 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2957#(<= ~counter~0 0)} {2949#true} #61#return; {2957#(<= ~counter~0 0)} is VALID [2022-04-28 07:57:29,626 INFO L272 TraceCheckUtils]: 4: Hoare triple {2957#(<= ~counter~0 0)} call #t~ret6 := main(); {2957#(<= ~counter~0 0)} is VALID [2022-04-28 07:57:29,627 INFO L290 TraceCheckUtils]: 5: Hoare triple {2957#(<= ~counter~0 0)} 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; {2957#(<= ~counter~0 0)} is VALID [2022-04-28 07:57:29,627 INFO L272 TraceCheckUtils]: 6: Hoare triple {2957#(<= ~counter~0 0)} call assume_abort_if_not((if ~k~0 <= 256 then 1 else 0)); {2957#(<= ~counter~0 0)} is VALID [2022-04-28 07:57:29,628 INFO L290 TraceCheckUtils]: 7: Hoare triple {2957#(<= ~counter~0 0)} ~cond := #in~cond; {2957#(<= ~counter~0 0)} is VALID [2022-04-28 07:57:29,628 INFO L290 TraceCheckUtils]: 8: Hoare triple {2957#(<= ~counter~0 0)} assume !(0 == ~cond); {2957#(<= ~counter~0 0)} is VALID [2022-04-28 07:57:29,628 INFO L290 TraceCheckUtils]: 9: Hoare triple {2957#(<= ~counter~0 0)} assume true; {2957#(<= ~counter~0 0)} is VALID [2022-04-28 07:57:29,629 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {2957#(<= ~counter~0 0)} {2957#(<= ~counter~0 0)} #53#return; {2957#(<= ~counter~0 0)} is VALID [2022-04-28 07:57:29,629 INFO L290 TraceCheckUtils]: 11: Hoare triple {2957#(<= ~counter~0 0)} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {2957#(<= ~counter~0 0)} is VALID [2022-04-28 07:57:29,630 INFO L290 TraceCheckUtils]: 12: Hoare triple {2957#(<= ~counter~0 0)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {2991#(<= ~counter~0 1)} is VALID [2022-04-28 07:57:29,630 INFO L290 TraceCheckUtils]: 13: Hoare triple {2991#(<= ~counter~0 1)} assume !!(#t~post5 < 5);havoc #t~post5; {2991#(<= ~counter~0 1)} is VALID [2022-04-28 07:57:29,630 INFO L272 TraceCheckUtils]: 14: Hoare triple {2991#(<= ~counter~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)); {2991#(<= ~counter~0 1)} is VALID [2022-04-28 07:57:29,631 INFO L290 TraceCheckUtils]: 15: Hoare triple {2991#(<= ~counter~0 1)} ~cond := #in~cond; {2991#(<= ~counter~0 1)} is VALID [2022-04-28 07:57:29,631 INFO L290 TraceCheckUtils]: 16: Hoare triple {2991#(<= ~counter~0 1)} assume !(0 == ~cond); {2991#(<= ~counter~0 1)} is VALID [2022-04-28 07:57:29,632 INFO L290 TraceCheckUtils]: 17: Hoare triple {2991#(<= ~counter~0 1)} assume true; {2991#(<= ~counter~0 1)} is VALID [2022-04-28 07:57:29,632 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {2991#(<= ~counter~0 1)} {2991#(<= ~counter~0 1)} #55#return; {2991#(<= ~counter~0 1)} is VALID [2022-04-28 07:57:29,632 INFO L290 TraceCheckUtils]: 19: Hoare triple {2991#(<= ~counter~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; {2991#(<= ~counter~0 1)} is VALID [2022-04-28 07:57:29,633 INFO L290 TraceCheckUtils]: 20: Hoare triple {2991#(<= ~counter~0 1)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {3016#(<= ~counter~0 2)} is VALID [2022-04-28 07:57:29,633 INFO L290 TraceCheckUtils]: 21: Hoare triple {3016#(<= ~counter~0 2)} assume !!(#t~post5 < 5);havoc #t~post5; {3016#(<= ~counter~0 2)} is VALID [2022-04-28 07:57:29,634 INFO L272 TraceCheckUtils]: 22: Hoare triple {3016#(<= ~counter~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)); {3016#(<= ~counter~0 2)} is VALID [2022-04-28 07:57:29,634 INFO L290 TraceCheckUtils]: 23: Hoare triple {3016#(<= ~counter~0 2)} ~cond := #in~cond; {3016#(<= ~counter~0 2)} is VALID [2022-04-28 07:57:29,634 INFO L290 TraceCheckUtils]: 24: Hoare triple {3016#(<= ~counter~0 2)} assume !(0 == ~cond); {3016#(<= ~counter~0 2)} is VALID [2022-04-28 07:57:29,634 INFO L290 TraceCheckUtils]: 25: Hoare triple {3016#(<= ~counter~0 2)} assume true; {3016#(<= ~counter~0 2)} is VALID [2022-04-28 07:57:29,635 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {3016#(<= ~counter~0 2)} {3016#(<= ~counter~0 2)} #55#return; {3016#(<= ~counter~0 2)} is VALID [2022-04-28 07:57:29,635 INFO L290 TraceCheckUtils]: 27: Hoare triple {3016#(<= ~counter~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; {3016#(<= ~counter~0 2)} is VALID [2022-04-28 07:57:29,636 INFO L290 TraceCheckUtils]: 28: Hoare triple {3016#(<= ~counter~0 2)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {3041#(<= ~counter~0 3)} is VALID [2022-04-28 07:57:29,636 INFO L290 TraceCheckUtils]: 29: Hoare triple {3041#(<= ~counter~0 3)} assume !!(#t~post5 < 5);havoc #t~post5; {3041#(<= ~counter~0 3)} is VALID [2022-04-28 07:57:29,636 INFO L272 TraceCheckUtils]: 30: Hoare triple {3041#(<= ~counter~0 3)} 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)); {3041#(<= ~counter~0 3)} is VALID [2022-04-28 07:57:29,637 INFO L290 TraceCheckUtils]: 31: Hoare triple {3041#(<= ~counter~0 3)} ~cond := #in~cond; {3041#(<= ~counter~0 3)} is VALID [2022-04-28 07:57:29,637 INFO L290 TraceCheckUtils]: 32: Hoare triple {3041#(<= ~counter~0 3)} assume !(0 == ~cond); {3041#(<= ~counter~0 3)} is VALID [2022-04-28 07:57:29,637 INFO L290 TraceCheckUtils]: 33: Hoare triple {3041#(<= ~counter~0 3)} assume true; {3041#(<= ~counter~0 3)} is VALID [2022-04-28 07:57:29,638 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {3041#(<= ~counter~0 3)} {3041#(<= ~counter~0 3)} #55#return; {3041#(<= ~counter~0 3)} is VALID [2022-04-28 07:57:29,638 INFO L290 TraceCheckUtils]: 35: Hoare triple {3041#(<= ~counter~0 3)} 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; {3041#(<= ~counter~0 3)} is VALID [2022-04-28 07:57:29,638 INFO L290 TraceCheckUtils]: 36: Hoare triple {3041#(<= ~counter~0 3)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {3066#(<= |main_#t~post5| 3)} is VALID [2022-04-28 07:57:29,639 INFO L290 TraceCheckUtils]: 37: Hoare triple {3066#(<= |main_#t~post5| 3)} assume !(#t~post5 < 5);havoc #t~post5; {2950#false} is VALID [2022-04-28 07:57:29,639 INFO L272 TraceCheckUtils]: 38: Hoare triple {2950#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)); {2950#false} is VALID [2022-04-28 07:57:29,639 INFO L290 TraceCheckUtils]: 39: Hoare triple {2950#false} ~cond := #in~cond; {2950#false} is VALID [2022-04-28 07:57:29,639 INFO L290 TraceCheckUtils]: 40: Hoare triple {2950#false} assume !(0 == ~cond); {2950#false} is VALID [2022-04-28 07:57:29,639 INFO L290 TraceCheckUtils]: 41: Hoare triple {2950#false} assume true; {2950#false} is VALID [2022-04-28 07:57:29,640 INFO L284 TraceCheckUtils]: 42: Hoare quadruple {2950#false} {2950#false} #57#return; {2950#false} is VALID [2022-04-28 07:57:29,640 INFO L272 TraceCheckUtils]: 43: Hoare triple {2950#false} call __VERIFIER_assert((if ~k~0 * ~y~0 == ~y~0 * ~y~0 then 1 else 0)); {2950#false} is VALID [2022-04-28 07:57:29,640 INFO L290 TraceCheckUtils]: 44: Hoare triple {2950#false} ~cond := #in~cond; {2950#false} is VALID [2022-04-28 07:57:29,640 INFO L290 TraceCheckUtils]: 45: Hoare triple {2950#false} assume 0 == ~cond; {2950#false} is VALID [2022-04-28 07:57:29,641 INFO L290 TraceCheckUtils]: 46: Hoare triple {2950#false} assume !false; {2950#false} is VALID [2022-04-28 07:57:29,641 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 18 proven. 30 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-28 07:57:29,641 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 07:57:29,832 INFO L290 TraceCheckUtils]: 46: Hoare triple {2950#false} assume !false; {2950#false} is VALID [2022-04-28 07:57:29,833 INFO L290 TraceCheckUtils]: 45: Hoare triple {2950#false} assume 0 == ~cond; {2950#false} is VALID [2022-04-28 07:57:29,833 INFO L290 TraceCheckUtils]: 44: Hoare triple {2950#false} ~cond := #in~cond; {2950#false} is VALID [2022-04-28 07:57:29,834 INFO L272 TraceCheckUtils]: 43: Hoare triple {2950#false} call __VERIFIER_assert((if ~k~0 * ~y~0 == ~y~0 * ~y~0 then 1 else 0)); {2950#false} is VALID [2022-04-28 07:57:29,834 INFO L284 TraceCheckUtils]: 42: Hoare quadruple {2949#true} {2950#false} #57#return; {2950#false} is VALID [2022-04-28 07:57:29,834 INFO L290 TraceCheckUtils]: 41: Hoare triple {2949#true} assume true; {2949#true} is VALID [2022-04-28 07:57:29,834 INFO L290 TraceCheckUtils]: 40: Hoare triple {2949#true} assume !(0 == ~cond); {2949#true} is VALID [2022-04-28 07:57:29,835 INFO L290 TraceCheckUtils]: 39: Hoare triple {2949#true} ~cond := #in~cond; {2949#true} is VALID [2022-04-28 07:57:29,835 INFO L272 TraceCheckUtils]: 38: Hoare triple {2950#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)); {2949#true} is VALID [2022-04-28 07:57:29,836 INFO L290 TraceCheckUtils]: 37: Hoare triple {3124#(< |main_#t~post5| 5)} assume !(#t~post5 < 5);havoc #t~post5; {2950#false} is VALID [2022-04-28 07:57:29,836 INFO L290 TraceCheckUtils]: 36: Hoare triple {3128#(< ~counter~0 5)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {3124#(< |main_#t~post5| 5)} is VALID [2022-04-28 07:57:29,837 INFO L290 TraceCheckUtils]: 35: Hoare triple {3128#(< ~counter~0 5)} 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; {3128#(< ~counter~0 5)} is VALID [2022-04-28 07:57:29,837 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {2949#true} {3128#(< ~counter~0 5)} #55#return; {3128#(< ~counter~0 5)} is VALID [2022-04-28 07:57:29,837 INFO L290 TraceCheckUtils]: 33: Hoare triple {2949#true} assume true; {2949#true} is VALID [2022-04-28 07:57:29,837 INFO L290 TraceCheckUtils]: 32: Hoare triple {2949#true} assume !(0 == ~cond); {2949#true} is VALID [2022-04-28 07:57:29,837 INFO L290 TraceCheckUtils]: 31: Hoare triple {2949#true} ~cond := #in~cond; {2949#true} is VALID [2022-04-28 07:57:29,837 INFO L272 TraceCheckUtils]: 30: Hoare triple {3128#(< ~counter~0 5)} 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)); {2949#true} is VALID [2022-04-28 07:57:29,838 INFO L290 TraceCheckUtils]: 29: Hoare triple {3128#(< ~counter~0 5)} assume !!(#t~post5 < 5);havoc #t~post5; {3128#(< ~counter~0 5)} is VALID [2022-04-28 07:57:29,838 INFO L290 TraceCheckUtils]: 28: Hoare triple {3041#(<= ~counter~0 3)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {3128#(< ~counter~0 5)} is VALID [2022-04-28 07:57:29,838 INFO L290 TraceCheckUtils]: 27: Hoare triple {3041#(<= ~counter~0 3)} 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; {3041#(<= ~counter~0 3)} is VALID [2022-04-28 07:57:29,839 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {2949#true} {3041#(<= ~counter~0 3)} #55#return; {3041#(<= ~counter~0 3)} is VALID [2022-04-28 07:57:29,839 INFO L290 TraceCheckUtils]: 25: Hoare triple {2949#true} assume true; {2949#true} is VALID [2022-04-28 07:57:29,839 INFO L290 TraceCheckUtils]: 24: Hoare triple {2949#true} assume !(0 == ~cond); {2949#true} is VALID [2022-04-28 07:57:29,839 INFO L290 TraceCheckUtils]: 23: Hoare triple {2949#true} ~cond := #in~cond; {2949#true} is VALID [2022-04-28 07:57:29,839 INFO L272 TraceCheckUtils]: 22: Hoare triple {3041#(<= ~counter~0 3)} 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)); {2949#true} is VALID [2022-04-28 07:57:29,839 INFO L290 TraceCheckUtils]: 21: Hoare triple {3041#(<= ~counter~0 3)} assume !!(#t~post5 < 5);havoc #t~post5; {3041#(<= ~counter~0 3)} is VALID [2022-04-28 07:57:29,840 INFO L290 TraceCheckUtils]: 20: Hoare triple {3016#(<= ~counter~0 2)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {3041#(<= ~counter~0 3)} is VALID [2022-04-28 07:57:29,840 INFO L290 TraceCheckUtils]: 19: Hoare triple {3016#(<= ~counter~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; {3016#(<= ~counter~0 2)} is VALID [2022-04-28 07:57:29,840 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {2949#true} {3016#(<= ~counter~0 2)} #55#return; {3016#(<= ~counter~0 2)} is VALID [2022-04-28 07:57:29,841 INFO L290 TraceCheckUtils]: 17: Hoare triple {2949#true} assume true; {2949#true} is VALID [2022-04-28 07:57:29,841 INFO L290 TraceCheckUtils]: 16: Hoare triple {2949#true} assume !(0 == ~cond); {2949#true} is VALID [2022-04-28 07:57:29,841 INFO L290 TraceCheckUtils]: 15: Hoare triple {2949#true} ~cond := #in~cond; {2949#true} is VALID [2022-04-28 07:57:29,841 INFO L272 TraceCheckUtils]: 14: Hoare triple {3016#(<= ~counter~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)); {2949#true} is VALID [2022-04-28 07:57:29,841 INFO L290 TraceCheckUtils]: 13: Hoare triple {3016#(<= ~counter~0 2)} assume !!(#t~post5 < 5);havoc #t~post5; {3016#(<= ~counter~0 2)} is VALID [2022-04-28 07:57:29,841 INFO L290 TraceCheckUtils]: 12: Hoare triple {2991#(<= ~counter~0 1)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {3016#(<= ~counter~0 2)} is VALID [2022-04-28 07:57:29,842 INFO L290 TraceCheckUtils]: 11: Hoare triple {2991#(<= ~counter~0 1)} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {2991#(<= ~counter~0 1)} is VALID [2022-04-28 07:57:29,842 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {2949#true} {2991#(<= ~counter~0 1)} #53#return; {2991#(<= ~counter~0 1)} is VALID [2022-04-28 07:57:29,842 INFO L290 TraceCheckUtils]: 9: Hoare triple {2949#true} assume true; {2949#true} is VALID [2022-04-28 07:57:29,842 INFO L290 TraceCheckUtils]: 8: Hoare triple {2949#true} assume !(0 == ~cond); {2949#true} is VALID [2022-04-28 07:57:29,842 INFO L290 TraceCheckUtils]: 7: Hoare triple {2949#true} ~cond := #in~cond; {2949#true} is VALID [2022-04-28 07:57:29,842 INFO L272 TraceCheckUtils]: 6: Hoare triple {2991#(<= ~counter~0 1)} call assume_abort_if_not((if ~k~0 <= 256 then 1 else 0)); {2949#true} is VALID [2022-04-28 07:57:29,843 INFO L290 TraceCheckUtils]: 5: Hoare triple {2991#(<= ~counter~0 1)} 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; {2991#(<= ~counter~0 1)} is VALID [2022-04-28 07:57:29,843 INFO L272 TraceCheckUtils]: 4: Hoare triple {2991#(<= ~counter~0 1)} call #t~ret6 := main(); {2991#(<= ~counter~0 1)} is VALID [2022-04-28 07:57:29,843 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2991#(<= ~counter~0 1)} {2949#true} #61#return; {2991#(<= ~counter~0 1)} is VALID [2022-04-28 07:57:29,843 INFO L290 TraceCheckUtils]: 2: Hoare triple {2991#(<= ~counter~0 1)} assume true; {2991#(<= ~counter~0 1)} is VALID [2022-04-28 07:57:29,844 INFO L290 TraceCheckUtils]: 1: Hoare triple {2949#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);~counter~0 := 0; {2991#(<= ~counter~0 1)} is VALID [2022-04-28 07:57:29,844 INFO L272 TraceCheckUtils]: 0: Hoare triple {2949#true} call ULTIMATE.init(); {2949#true} is VALID [2022-04-28 07:57:29,844 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 8 proven. 18 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-04-28 07:57:29,844 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 07:57:29,844 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1580554439] [2022-04-28 07:57:29,844 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 07:57:29,845 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1312649119] [2022-04-28 07:57:29,845 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1312649119] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 07:57:29,845 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 07:57:29,845 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 9 [2022-04-28 07:57:29,846 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 07:57:29,847 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [865527743] [2022-04-28 07:57:29,847 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [865527743] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 07:57:29,847 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 07:57:29,847 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-28 07:57:29,847 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [570614914] [2022-04-28 07:57:29,847 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 07:57:29,848 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.571428571428571) internal successors, (32), 6 states have internal predecessors, (32), 6 states have call successors, (8), 6 states have call predecessors, (8), 5 states have return successors, (6), 5 states have call predecessors, (6), 6 states have call successors, (6) Word has length 47 [2022-04-28 07:57:29,848 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 07:57:29,849 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 7 states, 7 states have (on average 4.571428571428571) internal successors, (32), 6 states have internal predecessors, (32), 6 states have call successors, (8), 6 states have call predecessors, (8), 5 states have return successors, (6), 5 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-28 07:57:29,876 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:57:29,876 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-28 07:57:29,876 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 07:57:29,877 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-28 07:57:29,877 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2022-04-28 07:57:29,877 INFO L87 Difference]: Start difference. First operand 46 states and 49 transitions. Second operand has 7 states, 7 states have (on average 4.571428571428571) internal successors, (32), 6 states have internal predecessors, (32), 6 states have call successors, (8), 6 states have call predecessors, (8), 5 states have return successors, (6), 5 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-28 07:57:30,014 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 07:57:30,014 INFO L93 Difference]: Finished difference Result 62 states and 64 transitions. [2022-04-28 07:57:30,014 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-04-28 07:57:30,014 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.571428571428571) internal successors, (32), 6 states have internal predecessors, (32), 6 states have call successors, (8), 6 states have call predecessors, (8), 5 states have return successors, (6), 5 states have call predecessors, (6), 6 states have call successors, (6) Word has length 47 [2022-04-28 07:57:30,015 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 07:57:30,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 4.571428571428571) internal successors, (32), 6 states have internal predecessors, (32), 6 states have call successors, (8), 6 states have call predecessors, (8), 5 states have return successors, (6), 5 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-28 07:57:30,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 62 transitions. [2022-04-28 07:57:30,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 4.571428571428571) internal successors, (32), 6 states have internal predecessors, (32), 6 states have call successors, (8), 6 states have call predecessors, (8), 5 states have return successors, (6), 5 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-28 07:57:30,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 62 transitions. [2022-04-28 07:57:30,023 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 10 states and 62 transitions. [2022-04-28 07:57:30,060 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 62 edges. 62 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 07:57:30,062 INFO L225 Difference]: With dead ends: 62 [2022-04-28 07:57:30,062 INFO L226 Difference]: Without dead ends: 52 [2022-04-28 07:57:30,063 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 85 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=50, Invalid=82, Unknown=0, NotChecked=0, Total=132 [2022-04-28 07:57:30,064 INFO L413 NwaCegarLoop]: 28 mSDtfsCounter, 12 mSDsluCounter, 71 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 99 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 07:57:30,065 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 99 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 07:57:30,065 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2022-04-28 07:57:30,103 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2022-04-28 07:57:30,103 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 07:57:30,103 INFO L82 GeneralOperation]: Start isEquivalent. First operand 52 states. Second operand has 52 states, 36 states have (on average 1.0555555555555556) internal successors, (38), 36 states have internal predecessors, (38), 9 states have call successors, (9), 8 states have call predecessors, (9), 6 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-28 07:57:30,104 INFO L74 IsIncluded]: Start isIncluded. First operand 52 states. Second operand has 52 states, 36 states have (on average 1.0555555555555556) internal successors, (38), 36 states have internal predecessors, (38), 9 states have call successors, (9), 8 states have call predecessors, (9), 6 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-28 07:57:30,105 INFO L87 Difference]: Start difference. First operand 52 states. Second operand has 52 states, 36 states have (on average 1.0555555555555556) internal successors, (38), 36 states have internal predecessors, (38), 9 states have call successors, (9), 8 states have call predecessors, (9), 6 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-28 07:57:30,107 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 07:57:30,107 INFO L93 Difference]: Finished difference Result 52 states and 54 transitions. [2022-04-28 07:57:30,107 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 54 transitions. [2022-04-28 07:57:30,107 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 07:57:30,107 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 07:57:30,107 INFO L74 IsIncluded]: Start isIncluded. First operand has 52 states, 36 states have (on average 1.0555555555555556) internal successors, (38), 36 states have internal predecessors, (38), 9 states have call successors, (9), 8 states have call predecessors, (9), 6 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Second operand 52 states. [2022-04-28 07:57:30,108 INFO L87 Difference]: Start difference. First operand has 52 states, 36 states have (on average 1.0555555555555556) internal successors, (38), 36 states have internal predecessors, (38), 9 states have call successors, (9), 8 states have call predecessors, (9), 6 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Second operand 52 states. [2022-04-28 07:57:30,108 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 07:57:30,108 INFO L93 Difference]: Finished difference Result 52 states and 54 transitions. [2022-04-28 07:57:30,108 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 54 transitions. [2022-04-28 07:57:30,109 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 07:57:30,109 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 07:57:30,109 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 07:57:30,109 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 07:57:30,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 36 states have (on average 1.0555555555555556) internal successors, (38), 36 states have internal predecessors, (38), 9 states have call successors, (9), 8 states have call predecessors, (9), 6 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-28 07:57:30,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 54 transitions. [2022-04-28 07:57:30,112 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 54 transitions. Word has length 47 [2022-04-28 07:57:30,112 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 07:57:30,112 INFO L495 AbstractCegarLoop]: Abstraction has 52 states and 54 transitions. [2022-04-28 07:57:30,112 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.571428571428571) internal successors, (32), 6 states have internal predecessors, (32), 6 states have call successors, (8), 6 states have call predecessors, (8), 5 states have return successors, (6), 5 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-28 07:57:30,112 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 52 states and 54 transitions. [2022-04-28 07:57:30,206 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 54 edges. 54 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 07:57:30,206 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 54 transitions. [2022-04-28 07:57:30,206 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2022-04-28 07:57:30,206 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 07:57:30,206 INFO L195 NwaCegarLoop]: trace histogram [6, 5, 5, 4, 4, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 07:57:30,224 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-04-28 07:57:30,407 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable8 [2022-04-28 07:57:30,407 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 07:57:30,407 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 07:57:30,407 INFO L85 PathProgramCache]: Analyzing trace with hash 468857897, now seen corresponding path program 5 times [2022-04-28 07:57:30,407 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 07:57:30,408 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1260352488] [2022-04-28 07:57:30,523 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 4 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-28 07:57:30,523 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONLINEAR_UPDATE [2022-04-28 07:57:30,523 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 07:57:30,523 INFO L85 PathProgramCache]: Analyzing trace with hash 468857897, now seen corresponding path program 6 times [2022-04-28 07:57:30,523 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 07:57:30,523 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [190158415] [2022-04-28 07:57:30,523 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 07:57:30,524 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 07:57:30,552 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 07:57:30,552 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [226739620] [2022-04-28 07:57:30,552 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-28 07:57:30,552 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 07:57:30,552 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 07:57:30,563 INFO L229 MonitoredProcess]: Starting monitored process 10 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:57:30,564 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-04-28 07:58:06,387 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2022-04-28 07:58:06,388 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 07:58:06,428 INFO L263 TraceCheckSpWp]: Trace formula consists of 162 conjuncts, 20 conjunts are in the unsatisfiable core [2022-04-28 07:58:06,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 07:58:06,443 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 07:58:06,763 INFO L272 TraceCheckUtils]: 0: Hoare triple {3577#true} call ULTIMATE.init(); {3577#true} is VALID [2022-04-28 07:58:06,764 INFO L290 TraceCheckUtils]: 1: Hoare triple {3577#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);~counter~0 := 0; {3577#true} is VALID [2022-04-28 07:58:06,764 INFO L290 TraceCheckUtils]: 2: Hoare triple {3577#true} assume true; {3577#true} is VALID [2022-04-28 07:58:06,764 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3577#true} {3577#true} #61#return; {3577#true} is VALID [2022-04-28 07:58:06,764 INFO L272 TraceCheckUtils]: 4: Hoare triple {3577#true} call #t~ret6 := main(); {3577#true} is VALID [2022-04-28 07:58:06,764 INFO L290 TraceCheckUtils]: 5: Hoare triple {3577#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; {3577#true} is VALID [2022-04-28 07:58:06,764 INFO L272 TraceCheckUtils]: 6: Hoare triple {3577#true} call assume_abort_if_not((if ~k~0 <= 256 then 1 else 0)); {3577#true} is VALID [2022-04-28 07:58:06,764 INFO L290 TraceCheckUtils]: 7: Hoare triple {3577#true} ~cond := #in~cond; {3577#true} is VALID [2022-04-28 07:58:06,764 INFO L290 TraceCheckUtils]: 8: Hoare triple {3577#true} assume !(0 == ~cond); {3577#true} is VALID [2022-04-28 07:58:06,764 INFO L290 TraceCheckUtils]: 9: Hoare triple {3577#true} assume true; {3577#true} is VALID [2022-04-28 07:58:06,764 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {3577#true} {3577#true} #53#return; {3577#true} is VALID [2022-04-28 07:58:06,765 INFO L290 TraceCheckUtils]: 11: Hoare triple {3577#true} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {3615#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-28 07:58:06,765 INFO L290 TraceCheckUtils]: 12: Hoare triple {3615#(and (= main_~c~0 0) (= main_~y~0 0))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {3615#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-28 07:58:06,765 INFO L290 TraceCheckUtils]: 13: Hoare triple {3615#(and (= main_~c~0 0) (= main_~y~0 0))} assume !!(#t~post5 < 5);havoc #t~post5; {3615#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-28 07:58:06,765 INFO L272 TraceCheckUtils]: 14: Hoare triple {3615#(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)); {3577#true} is VALID [2022-04-28 07:58:06,765 INFO L290 TraceCheckUtils]: 15: Hoare triple {3577#true} ~cond := #in~cond; {3577#true} is VALID [2022-04-28 07:58:06,766 INFO L290 TraceCheckUtils]: 16: Hoare triple {3577#true} assume !(0 == ~cond); {3577#true} is VALID [2022-04-28 07:58:06,766 INFO L290 TraceCheckUtils]: 17: Hoare triple {3577#true} assume true; {3577#true} is VALID [2022-04-28 07:58:06,766 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {3577#true} {3615#(and (= main_~c~0 0) (= main_~y~0 0))} #55#return; {3615#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-28 07:58:06,766 INFO L290 TraceCheckUtils]: 19: Hoare triple {3615#(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; {3640#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} is VALID [2022-04-28 07:58:06,779 INFO L290 TraceCheckUtils]: 20: Hoare triple {3640#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {3640#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} is VALID [2022-04-28 07:58:06,779 INFO L290 TraceCheckUtils]: 21: Hoare triple {3640#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} assume !!(#t~post5 < 5);havoc #t~post5; {3640#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} is VALID [2022-04-28 07:58:06,779 INFO L272 TraceCheckUtils]: 22: Hoare triple {3640#(and (= (+ (- 1) main_~y~0) 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)); {3577#true} is VALID [2022-04-28 07:58:06,779 INFO L290 TraceCheckUtils]: 23: Hoare triple {3577#true} ~cond := #in~cond; {3577#true} is VALID [2022-04-28 07:58:06,780 INFO L290 TraceCheckUtils]: 24: Hoare triple {3577#true} assume !(0 == ~cond); {3577#true} is VALID [2022-04-28 07:58:06,780 INFO L290 TraceCheckUtils]: 25: Hoare triple {3577#true} assume true; {3577#true} is VALID [2022-04-28 07:58:06,780 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {3577#true} {3640#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} #55#return; {3640#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} is VALID [2022-04-28 07:58:06,780 INFO L290 TraceCheckUtils]: 27: Hoare triple {3640#(and (= (+ (- 1) main_~y~0) 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; {3665#(and (= (+ (- 2) main_~y~0) 0) (= main_~c~0 2))} is VALID [2022-04-28 07:58:06,781 INFO L290 TraceCheckUtils]: 28: Hoare triple {3665#(and (= (+ (- 2) main_~y~0) 0) (= main_~c~0 2))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {3665#(and (= (+ (- 2) main_~y~0) 0) (= main_~c~0 2))} is VALID [2022-04-28 07:58:06,781 INFO L290 TraceCheckUtils]: 29: Hoare triple {3665#(and (= (+ (- 2) main_~y~0) 0) (= main_~c~0 2))} assume !!(#t~post5 < 5);havoc #t~post5; {3665#(and (= (+ (- 2) main_~y~0) 0) (= main_~c~0 2))} is VALID [2022-04-28 07:58:06,781 INFO L272 TraceCheckUtils]: 30: Hoare triple {3665#(and (= (+ (- 2) main_~y~0) 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)); {3577#true} is VALID [2022-04-28 07:58:06,781 INFO L290 TraceCheckUtils]: 31: Hoare triple {3577#true} ~cond := #in~cond; {3577#true} is VALID [2022-04-28 07:58:06,781 INFO L290 TraceCheckUtils]: 32: Hoare triple {3577#true} assume !(0 == ~cond); {3577#true} is VALID [2022-04-28 07:58:06,781 INFO L290 TraceCheckUtils]: 33: Hoare triple {3577#true} assume true; {3577#true} is VALID [2022-04-28 07:58:06,782 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {3577#true} {3665#(and (= (+ (- 2) main_~y~0) 0) (= main_~c~0 2))} #55#return; {3665#(and (= (+ (- 2) main_~y~0) 0) (= main_~c~0 2))} is VALID [2022-04-28 07:58:06,782 INFO L290 TraceCheckUtils]: 35: Hoare triple {3665#(and (= (+ (- 2) main_~y~0) 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; {3690#(and (<= main_~c~0 3) (= (+ main_~y~0 (- 3)) 0) (< 2 main_~k~0))} is VALID [2022-04-28 07:58:06,782 INFO L290 TraceCheckUtils]: 36: Hoare triple {3690#(and (<= main_~c~0 3) (= (+ main_~y~0 (- 3)) 0) (< 2 main_~k~0))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {3690#(and (<= main_~c~0 3) (= (+ main_~y~0 (- 3)) 0) (< 2 main_~k~0))} is VALID [2022-04-28 07:58:06,783 INFO L290 TraceCheckUtils]: 37: Hoare triple {3690#(and (<= main_~c~0 3) (= (+ main_~y~0 (- 3)) 0) (< 2 main_~k~0))} assume !!(#t~post5 < 5);havoc #t~post5; {3690#(and (<= main_~c~0 3) (= (+ main_~y~0 (- 3)) 0) (< 2 main_~k~0))} is VALID [2022-04-28 07:58:06,783 INFO L272 TraceCheckUtils]: 38: Hoare triple {3690#(and (<= main_~c~0 3) (= (+ main_~y~0 (- 3)) 0) (< 2 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)); {3577#true} is VALID [2022-04-28 07:58:06,783 INFO L290 TraceCheckUtils]: 39: Hoare triple {3577#true} ~cond := #in~cond; {3577#true} is VALID [2022-04-28 07:58:06,783 INFO L290 TraceCheckUtils]: 40: Hoare triple {3577#true} assume !(0 == ~cond); {3577#true} is VALID [2022-04-28 07:58:06,783 INFO L290 TraceCheckUtils]: 41: Hoare triple {3577#true} assume true; {3577#true} is VALID [2022-04-28 07:58:06,783 INFO L284 TraceCheckUtils]: 42: Hoare quadruple {3577#true} {3690#(and (<= main_~c~0 3) (= (+ main_~y~0 (- 3)) 0) (< 2 main_~k~0))} #55#return; {3690#(and (<= main_~c~0 3) (= (+ main_~y~0 (- 3)) 0) (< 2 main_~k~0))} is VALID [2022-04-28 07:58:06,784 INFO L290 TraceCheckUtils]: 43: Hoare triple {3690#(and (<= main_~c~0 3) (= (+ main_~y~0 (- 3)) 0) (< 2 main_~k~0))} assume !(~c~0 < ~k~0); {3715#(and (<= main_~k~0 3) (= (+ main_~y~0 (- 3)) 0) (< 2 main_~k~0))} is VALID [2022-04-28 07:58:06,784 INFO L272 TraceCheckUtils]: 44: Hoare triple {3715#(and (<= main_~k~0 3) (= (+ main_~y~0 (- 3)) 0) (< 2 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)); {3577#true} is VALID [2022-04-28 07:58:06,784 INFO L290 TraceCheckUtils]: 45: Hoare triple {3577#true} ~cond := #in~cond; {3577#true} is VALID [2022-04-28 07:58:06,784 INFO L290 TraceCheckUtils]: 46: Hoare triple {3577#true} assume !(0 == ~cond); {3577#true} is VALID [2022-04-28 07:58:06,784 INFO L290 TraceCheckUtils]: 47: Hoare triple {3577#true} assume true; {3577#true} is VALID [2022-04-28 07:58:06,784 INFO L284 TraceCheckUtils]: 48: Hoare quadruple {3577#true} {3715#(and (<= main_~k~0 3) (= (+ main_~y~0 (- 3)) 0) (< 2 main_~k~0))} #57#return; {3715#(and (<= main_~k~0 3) (= (+ main_~y~0 (- 3)) 0) (< 2 main_~k~0))} is VALID [2022-04-28 07:58:06,785 INFO L272 TraceCheckUtils]: 49: Hoare triple {3715#(and (<= main_~k~0 3) (= (+ main_~y~0 (- 3)) 0) (< 2 main_~k~0))} call __VERIFIER_assert((if ~k~0 * ~y~0 == ~y~0 * ~y~0 then 1 else 0)); {3734#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 07:58:06,785 INFO L290 TraceCheckUtils]: 50: Hoare triple {3734#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {3738#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 07:58:06,785 INFO L290 TraceCheckUtils]: 51: Hoare triple {3738#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {3578#false} is VALID [2022-04-28 07:58:06,786 INFO L290 TraceCheckUtils]: 52: Hoare triple {3578#false} assume !false; {3578#false} is VALID [2022-04-28 07:58:06,786 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 10 proven. 24 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2022-04-28 07:58:06,786 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 07:58:07,061 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 07:58:07,061 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [190158415] [2022-04-28 07:58:07,061 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 07:58:07,061 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [226739620] [2022-04-28 07:58:07,061 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [226739620] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 07:58:07,061 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-28 07:58:07,062 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2022-04-28 07:58:07,062 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 07:58:07,062 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1260352488] [2022-04-28 07:58:07,062 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1260352488] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 07:58:07,063 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 07:58:07,063 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-04-28 07:58:07,063 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [786041170] [2022-04-28 07:58:07,063 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 07:58:07,063 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 3.125) internal successors, (25), 8 states have internal predecessors, (25), 6 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 6 states have call predecessors, (7), 6 states have call successors, (7) Word has length 53 [2022-04-28 07:58:07,064 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 07:58:07,065 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 9 states, 8 states have (on average 3.125) internal successors, (25), 8 states have internal predecessors, (25), 6 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 6 states have call predecessors, (7), 6 states have call successors, (7) [2022-04-28 07:58:07,095 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 41 edges. 41 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 07:58:07,095 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-04-28 07:58:07,095 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 07:58:07,095 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-04-28 07:58:07,095 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2022-04-28 07:58:07,096 INFO L87 Difference]: Start difference. First operand 52 states and 54 transitions. Second operand has 9 states, 8 states have (on average 3.125) internal successors, (25), 8 states have internal predecessors, (25), 6 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 6 states have call predecessors, (7), 6 states have call successors, (7) [2022-04-28 07:58:07,433 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 07:58:07,433 INFO L93 Difference]: Finished difference Result 60 states and 64 transitions. [2022-04-28 07:58:07,433 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-28 07:58:07,433 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 3.125) internal successors, (25), 8 states have internal predecessors, (25), 6 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 6 states have call predecessors, (7), 6 states have call successors, (7) Word has length 53 [2022-04-28 07:58:07,433 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 07:58:07,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 8 states have (on average 3.125) internal successors, (25), 8 states have internal predecessors, (25), 6 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 6 states have call predecessors, (7), 6 states have call successors, (7) [2022-04-28 07:58:07,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 54 transitions. [2022-04-28 07:58:07,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 8 states have (on average 3.125) internal successors, (25), 8 states have internal predecessors, (25), 6 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 6 states have call predecessors, (7), 6 states have call successors, (7) [2022-04-28 07:58:07,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 54 transitions. [2022-04-28 07:58:07,435 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 9 states and 54 transitions. [2022-04-28 07:58:07,490 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 54 edges. 54 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 07:58:07,491 INFO L225 Difference]: With dead ends: 60 [2022-04-28 07:58:07,491 INFO L226 Difference]: Without dead ends: 54 [2022-04-28 07:58:07,492 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 60 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=142, Unknown=0, NotChecked=0, Total=182 [2022-04-28 07:58:07,492 INFO L413 NwaCegarLoop]: 39 mSDtfsCounter, 2 mSDsluCounter, 182 mSDsCounter, 0 mSdLazyCounter, 119 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 221 SdHoareTripleChecker+Invalid, 120 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 119 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 07:58:07,492 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 221 Invalid, 120 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 119 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 07:58:07,493 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2022-04-28 07:58:07,555 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2022-04-28 07:58:07,555 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 07:58:07,556 INFO L82 GeneralOperation]: Start isEquivalent. First operand 54 states. Second operand has 54 states, 37 states have (on average 1.054054054054054) internal successors, (39), 37 states have internal predecessors, (39), 10 states have call successors, (10), 8 states have call predecessors, (10), 6 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-28 07:58:07,556 INFO L74 IsIncluded]: Start isIncluded. First operand 54 states. Second operand has 54 states, 37 states have (on average 1.054054054054054) internal successors, (39), 37 states have internal predecessors, (39), 10 states have call successors, (10), 8 states have call predecessors, (10), 6 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-28 07:58:07,556 INFO L87 Difference]: Start difference. First operand 54 states. Second operand has 54 states, 37 states have (on average 1.054054054054054) internal successors, (39), 37 states have internal predecessors, (39), 10 states have call successors, (10), 8 states have call predecessors, (10), 6 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-28 07:58:07,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 07:58:07,557 INFO L93 Difference]: Finished difference Result 54 states and 57 transitions. [2022-04-28 07:58:07,557 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 57 transitions. [2022-04-28 07:58:07,557 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 07:58:07,557 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 07:58:07,558 INFO L74 IsIncluded]: Start isIncluded. First operand has 54 states, 37 states have (on average 1.054054054054054) internal successors, (39), 37 states have internal predecessors, (39), 10 states have call successors, (10), 8 states have call predecessors, (10), 6 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Second operand 54 states. [2022-04-28 07:58:07,558 INFO L87 Difference]: Start difference. First operand has 54 states, 37 states have (on average 1.054054054054054) internal successors, (39), 37 states have internal predecessors, (39), 10 states have call successors, (10), 8 states have call predecessors, (10), 6 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Second operand 54 states. [2022-04-28 07:58:07,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 07:58:07,562 INFO L93 Difference]: Finished difference Result 54 states and 57 transitions. [2022-04-28 07:58:07,562 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 57 transitions. [2022-04-28 07:58:07,562 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 07:58:07,562 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 07:58:07,562 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 07:58:07,563 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 07:58:07,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 37 states have (on average 1.054054054054054) internal successors, (39), 37 states have internal predecessors, (39), 10 states have call successors, (10), 8 states have call predecessors, (10), 6 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-28 07:58:07,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 57 transitions. [2022-04-28 07:58:07,564 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 57 transitions. Word has length 53 [2022-04-28 07:58:07,564 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 07:58:07,564 INFO L495 AbstractCegarLoop]: Abstraction has 54 states and 57 transitions. [2022-04-28 07:58:07,564 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 3.125) internal successors, (25), 8 states have internal predecessors, (25), 6 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 6 states have call predecessors, (7), 6 states have call successors, (7) [2022-04-28 07:58:07,564 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 54 states and 57 transitions. [2022-04-28 07:58:07,699 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 57 edges. 57 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 07:58:07,700 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 57 transitions. [2022-04-28 07:58:07,700 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2022-04-28 07:58:07,700 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 07:58:07,700 INFO L195 NwaCegarLoop]: trace histogram [6, 5, 5, 5, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 07:58:07,728 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-04-28 07:58:07,925 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2022-04-28 07:58:07,925 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 07:58:07,925 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 07:58:07,925 INFO L85 PathProgramCache]: Analyzing trace with hash -1953308764, now seen corresponding path program 5 times [2022-04-28 07:58:07,925 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 07:58:07,926 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [598600604] [2022-04-28 07:58:08,023 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 4 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-28 07:58:08,024 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONLINEAR_UPDATE [2022-04-28 07:58:08,024 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 07:58:08,024 INFO L85 PathProgramCache]: Analyzing trace with hash -1953308764, now seen corresponding path program 6 times [2022-04-28 07:58:08,024 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 07:58:08,024 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1442078394] [2022-04-28 07:58:08,024 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 07:58:08,024 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 07:58:08,046 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 07:58:08,047 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [958102223] [2022-04-28 07:58:08,047 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-28 07:58:08,047 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 07:58:08,047 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 07:58:08,063 INFO L229 MonitoredProcess]: Starting monitored process 11 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:08,065 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-04-28 07:58:08,203 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2022-04-28 07:58:08,203 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 07:58:08,204 INFO L263 TraceCheckSpWp]: Trace formula consists of 173 conjuncts, 13 conjunts are in the unsatisfiable core [2022-04-28 07:58:08,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 07:58:08,228 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 07:58:08,476 INFO L272 TraceCheckUtils]: 0: Hoare triple {4144#true} call ULTIMATE.init(); {4144#true} is VALID [2022-04-28 07:58:08,477 INFO L290 TraceCheckUtils]: 1: Hoare triple {4144#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);~counter~0 := 0; {4152#(<= ~counter~0 0)} is VALID [2022-04-28 07:58:08,477 INFO L290 TraceCheckUtils]: 2: Hoare triple {4152#(<= ~counter~0 0)} assume true; {4152#(<= ~counter~0 0)} is VALID [2022-04-28 07:58:08,477 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4152#(<= ~counter~0 0)} {4144#true} #61#return; {4152#(<= ~counter~0 0)} is VALID [2022-04-28 07:58:08,478 INFO L272 TraceCheckUtils]: 4: Hoare triple {4152#(<= ~counter~0 0)} call #t~ret6 := main(); {4152#(<= ~counter~0 0)} is VALID [2022-04-28 07:58:08,478 INFO L290 TraceCheckUtils]: 5: Hoare triple {4152#(<= ~counter~0 0)} 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; {4152#(<= ~counter~0 0)} is VALID [2022-04-28 07:58:08,478 INFO L272 TraceCheckUtils]: 6: Hoare triple {4152#(<= ~counter~0 0)} call assume_abort_if_not((if ~k~0 <= 256 then 1 else 0)); {4152#(<= ~counter~0 0)} is VALID [2022-04-28 07:58:08,478 INFO L290 TraceCheckUtils]: 7: Hoare triple {4152#(<= ~counter~0 0)} ~cond := #in~cond; {4152#(<= ~counter~0 0)} is VALID [2022-04-28 07:58:08,479 INFO L290 TraceCheckUtils]: 8: Hoare triple {4152#(<= ~counter~0 0)} assume !(0 == ~cond); {4152#(<= ~counter~0 0)} is VALID [2022-04-28 07:58:08,479 INFO L290 TraceCheckUtils]: 9: Hoare triple {4152#(<= ~counter~0 0)} assume true; {4152#(<= ~counter~0 0)} is VALID [2022-04-28 07:58:08,479 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {4152#(<= ~counter~0 0)} {4152#(<= ~counter~0 0)} #53#return; {4152#(<= ~counter~0 0)} is VALID [2022-04-28 07:58:08,479 INFO L290 TraceCheckUtils]: 11: Hoare triple {4152#(<= ~counter~0 0)} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {4152#(<= ~counter~0 0)} is VALID [2022-04-28 07:58:08,480 INFO L290 TraceCheckUtils]: 12: Hoare triple {4152#(<= ~counter~0 0)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {4186#(<= ~counter~0 1)} is VALID [2022-04-28 07:58:08,480 INFO L290 TraceCheckUtils]: 13: Hoare triple {4186#(<= ~counter~0 1)} assume !!(#t~post5 < 5);havoc #t~post5; {4186#(<= ~counter~0 1)} is VALID [2022-04-28 07:58:08,481 INFO L272 TraceCheckUtils]: 14: Hoare triple {4186#(<= ~counter~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)); {4186#(<= ~counter~0 1)} is VALID [2022-04-28 07:58:08,481 INFO L290 TraceCheckUtils]: 15: Hoare triple {4186#(<= ~counter~0 1)} ~cond := #in~cond; {4186#(<= ~counter~0 1)} is VALID [2022-04-28 07:58:08,481 INFO L290 TraceCheckUtils]: 16: Hoare triple {4186#(<= ~counter~0 1)} assume !(0 == ~cond); {4186#(<= ~counter~0 1)} is VALID [2022-04-28 07:58:08,481 INFO L290 TraceCheckUtils]: 17: Hoare triple {4186#(<= ~counter~0 1)} assume true; {4186#(<= ~counter~0 1)} is VALID [2022-04-28 07:58:08,483 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {4186#(<= ~counter~0 1)} {4186#(<= ~counter~0 1)} #55#return; {4186#(<= ~counter~0 1)} is VALID [2022-04-28 07:58:08,483 INFO L290 TraceCheckUtils]: 19: Hoare triple {4186#(<= ~counter~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; {4186#(<= ~counter~0 1)} is VALID [2022-04-28 07:58:08,484 INFO L290 TraceCheckUtils]: 20: Hoare triple {4186#(<= ~counter~0 1)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {4211#(<= ~counter~0 2)} is VALID [2022-04-28 07:58:08,484 INFO L290 TraceCheckUtils]: 21: Hoare triple {4211#(<= ~counter~0 2)} assume !!(#t~post5 < 5);havoc #t~post5; {4211#(<= ~counter~0 2)} is VALID [2022-04-28 07:58:08,484 INFO L272 TraceCheckUtils]: 22: Hoare triple {4211#(<= ~counter~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)); {4211#(<= ~counter~0 2)} is VALID [2022-04-28 07:58:08,485 INFO L290 TraceCheckUtils]: 23: Hoare triple {4211#(<= ~counter~0 2)} ~cond := #in~cond; {4211#(<= ~counter~0 2)} is VALID [2022-04-28 07:58:08,485 INFO L290 TraceCheckUtils]: 24: Hoare triple {4211#(<= ~counter~0 2)} assume !(0 == ~cond); {4211#(<= ~counter~0 2)} is VALID [2022-04-28 07:58:08,485 INFO L290 TraceCheckUtils]: 25: Hoare triple {4211#(<= ~counter~0 2)} assume true; {4211#(<= ~counter~0 2)} is VALID [2022-04-28 07:58:08,485 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {4211#(<= ~counter~0 2)} {4211#(<= ~counter~0 2)} #55#return; {4211#(<= ~counter~0 2)} is VALID [2022-04-28 07:58:08,488 INFO L290 TraceCheckUtils]: 27: Hoare triple {4211#(<= ~counter~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; {4211#(<= ~counter~0 2)} is VALID [2022-04-28 07:58:08,489 INFO L290 TraceCheckUtils]: 28: Hoare triple {4211#(<= ~counter~0 2)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {4236#(<= ~counter~0 3)} is VALID [2022-04-28 07:58:08,489 INFO L290 TraceCheckUtils]: 29: Hoare triple {4236#(<= ~counter~0 3)} assume !!(#t~post5 < 5);havoc #t~post5; {4236#(<= ~counter~0 3)} is VALID [2022-04-28 07:58:08,489 INFO L272 TraceCheckUtils]: 30: Hoare triple {4236#(<= ~counter~0 3)} 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)); {4236#(<= ~counter~0 3)} is VALID [2022-04-28 07:58:08,489 INFO L290 TraceCheckUtils]: 31: Hoare triple {4236#(<= ~counter~0 3)} ~cond := #in~cond; {4236#(<= ~counter~0 3)} is VALID [2022-04-28 07:58:08,490 INFO L290 TraceCheckUtils]: 32: Hoare triple {4236#(<= ~counter~0 3)} assume !(0 == ~cond); {4236#(<= ~counter~0 3)} is VALID [2022-04-28 07:58:08,490 INFO L290 TraceCheckUtils]: 33: Hoare triple {4236#(<= ~counter~0 3)} assume true; {4236#(<= ~counter~0 3)} is VALID [2022-04-28 07:58:08,490 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {4236#(<= ~counter~0 3)} {4236#(<= ~counter~0 3)} #55#return; {4236#(<= ~counter~0 3)} is VALID [2022-04-28 07:58:08,490 INFO L290 TraceCheckUtils]: 35: Hoare triple {4236#(<= ~counter~0 3)} 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; {4236#(<= ~counter~0 3)} is VALID [2022-04-28 07:58:08,491 INFO L290 TraceCheckUtils]: 36: Hoare triple {4236#(<= ~counter~0 3)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {4261#(<= ~counter~0 4)} is VALID [2022-04-28 07:58:08,492 INFO L290 TraceCheckUtils]: 37: Hoare triple {4261#(<= ~counter~0 4)} assume !!(#t~post5 < 5);havoc #t~post5; {4261#(<= ~counter~0 4)} is VALID [2022-04-28 07:58:08,492 INFO L272 TraceCheckUtils]: 38: Hoare triple {4261#(<= ~counter~0 4)} 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)); {4261#(<= ~counter~0 4)} is VALID [2022-04-28 07:58:08,492 INFO L290 TraceCheckUtils]: 39: Hoare triple {4261#(<= ~counter~0 4)} ~cond := #in~cond; {4261#(<= ~counter~0 4)} is VALID [2022-04-28 07:58:08,492 INFO L290 TraceCheckUtils]: 40: Hoare triple {4261#(<= ~counter~0 4)} assume !(0 == ~cond); {4261#(<= ~counter~0 4)} is VALID [2022-04-28 07:58:08,493 INFO L290 TraceCheckUtils]: 41: Hoare triple {4261#(<= ~counter~0 4)} assume true; {4261#(<= ~counter~0 4)} is VALID [2022-04-28 07:58:08,493 INFO L284 TraceCheckUtils]: 42: Hoare quadruple {4261#(<= ~counter~0 4)} {4261#(<= ~counter~0 4)} #55#return; {4261#(<= ~counter~0 4)} is VALID [2022-04-28 07:58:08,494 INFO L290 TraceCheckUtils]: 43: Hoare triple {4261#(<= ~counter~0 4)} 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; {4261#(<= ~counter~0 4)} is VALID [2022-04-28 07:58:08,494 INFO L290 TraceCheckUtils]: 44: Hoare triple {4261#(<= ~counter~0 4)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {4286#(<= |main_#t~post5| 4)} is VALID [2022-04-28 07:58:08,494 INFO L290 TraceCheckUtils]: 45: Hoare triple {4286#(<= |main_#t~post5| 4)} assume !(#t~post5 < 5);havoc #t~post5; {4145#false} is VALID [2022-04-28 07:58:08,494 INFO L272 TraceCheckUtils]: 46: Hoare triple {4145#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)); {4145#false} is VALID [2022-04-28 07:58:08,494 INFO L290 TraceCheckUtils]: 47: Hoare triple {4145#false} ~cond := #in~cond; {4145#false} is VALID [2022-04-28 07:58:08,494 INFO L290 TraceCheckUtils]: 48: Hoare triple {4145#false} assume !(0 == ~cond); {4145#false} is VALID [2022-04-28 07:58:08,494 INFO L290 TraceCheckUtils]: 49: Hoare triple {4145#false} assume true; {4145#false} is VALID [2022-04-28 07:58:08,494 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {4145#false} {4145#false} #57#return; {4145#false} is VALID [2022-04-28 07:58:08,495 INFO L272 TraceCheckUtils]: 51: Hoare triple {4145#false} call __VERIFIER_assert((if ~k~0 * ~y~0 == ~y~0 * ~y~0 then 1 else 0)); {4145#false} is VALID [2022-04-28 07:58:08,495 INFO L290 TraceCheckUtils]: 52: Hoare triple {4145#false} ~cond := #in~cond; {4145#false} is VALID [2022-04-28 07:58:08,495 INFO L290 TraceCheckUtils]: 53: Hoare triple {4145#false} assume 0 == ~cond; {4145#false} is VALID [2022-04-28 07:58:08,495 INFO L290 TraceCheckUtils]: 54: Hoare triple {4145#false} assume !false; {4145#false} is VALID [2022-04-28 07:58:08,495 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 24 proven. 56 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-28 07:58:08,496 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 07:58:08,738 INFO L290 TraceCheckUtils]: 54: Hoare triple {4145#false} assume !false; {4145#false} is VALID [2022-04-28 07:58:08,739 INFO L290 TraceCheckUtils]: 53: Hoare triple {4145#false} assume 0 == ~cond; {4145#false} is VALID [2022-04-28 07:58:08,739 INFO L290 TraceCheckUtils]: 52: Hoare triple {4145#false} ~cond := #in~cond; {4145#false} is VALID [2022-04-28 07:58:08,739 INFO L272 TraceCheckUtils]: 51: Hoare triple {4145#false} call __VERIFIER_assert((if ~k~0 * ~y~0 == ~y~0 * ~y~0 then 1 else 0)); {4145#false} is VALID [2022-04-28 07:58:08,739 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {4144#true} {4145#false} #57#return; {4145#false} is VALID [2022-04-28 07:58:08,739 INFO L290 TraceCheckUtils]: 49: Hoare triple {4144#true} assume true; {4144#true} is VALID [2022-04-28 07:58:08,740 INFO L290 TraceCheckUtils]: 48: Hoare triple {4144#true} assume !(0 == ~cond); {4144#true} is VALID [2022-04-28 07:58:08,740 INFO L290 TraceCheckUtils]: 47: Hoare triple {4144#true} ~cond := #in~cond; {4144#true} is VALID [2022-04-28 07:58:08,740 INFO L272 TraceCheckUtils]: 46: Hoare triple {4145#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)); {4144#true} is VALID [2022-04-28 07:58:08,740 INFO L290 TraceCheckUtils]: 45: Hoare triple {4286#(<= |main_#t~post5| 4)} assume !(#t~post5 < 5);havoc #t~post5; {4145#false} is VALID [2022-04-28 07:58:08,740 INFO L290 TraceCheckUtils]: 44: Hoare triple {4261#(<= ~counter~0 4)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {4286#(<= |main_#t~post5| 4)} is VALID [2022-04-28 07:58:08,741 INFO L290 TraceCheckUtils]: 43: Hoare triple {4261#(<= ~counter~0 4)} 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; {4261#(<= ~counter~0 4)} is VALID [2022-04-28 07:58:08,741 INFO L284 TraceCheckUtils]: 42: Hoare quadruple {4144#true} {4261#(<= ~counter~0 4)} #55#return; {4261#(<= ~counter~0 4)} is VALID [2022-04-28 07:58:08,741 INFO L290 TraceCheckUtils]: 41: Hoare triple {4144#true} assume true; {4144#true} is VALID [2022-04-28 07:58:08,741 INFO L290 TraceCheckUtils]: 40: Hoare triple {4144#true} assume !(0 == ~cond); {4144#true} is VALID [2022-04-28 07:58:08,741 INFO L290 TraceCheckUtils]: 39: Hoare triple {4144#true} ~cond := #in~cond; {4144#true} is VALID [2022-04-28 07:58:08,741 INFO L272 TraceCheckUtils]: 38: Hoare triple {4261#(<= ~counter~0 4)} 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)); {4144#true} is VALID [2022-04-28 07:58:08,742 INFO L290 TraceCheckUtils]: 37: Hoare triple {4261#(<= ~counter~0 4)} assume !!(#t~post5 < 5);havoc #t~post5; {4261#(<= ~counter~0 4)} is VALID [2022-04-28 07:58:08,742 INFO L290 TraceCheckUtils]: 36: Hoare triple {4236#(<= ~counter~0 3)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {4261#(<= ~counter~0 4)} is VALID [2022-04-28 07:58:08,742 INFO L290 TraceCheckUtils]: 35: Hoare triple {4236#(<= ~counter~0 3)} 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; {4236#(<= ~counter~0 3)} is VALID [2022-04-28 07:58:08,743 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {4144#true} {4236#(<= ~counter~0 3)} #55#return; {4236#(<= ~counter~0 3)} is VALID [2022-04-28 07:58:08,743 INFO L290 TraceCheckUtils]: 33: Hoare triple {4144#true} assume true; {4144#true} is VALID [2022-04-28 07:58:08,743 INFO L290 TraceCheckUtils]: 32: Hoare triple {4144#true} assume !(0 == ~cond); {4144#true} is VALID [2022-04-28 07:58:08,743 INFO L290 TraceCheckUtils]: 31: Hoare triple {4144#true} ~cond := #in~cond; {4144#true} is VALID [2022-04-28 07:58:08,743 INFO L272 TraceCheckUtils]: 30: Hoare triple {4236#(<= ~counter~0 3)} 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)); {4144#true} is VALID [2022-04-28 07:58:08,743 INFO L290 TraceCheckUtils]: 29: Hoare triple {4236#(<= ~counter~0 3)} assume !!(#t~post5 < 5);havoc #t~post5; {4236#(<= ~counter~0 3)} is VALID [2022-04-28 07:58:08,745 INFO L290 TraceCheckUtils]: 28: Hoare triple {4211#(<= ~counter~0 2)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {4236#(<= ~counter~0 3)} is VALID [2022-04-28 07:58:08,745 INFO L290 TraceCheckUtils]: 27: Hoare triple {4211#(<= ~counter~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; {4211#(<= ~counter~0 2)} is VALID [2022-04-28 07:58:08,745 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {4144#true} {4211#(<= ~counter~0 2)} #55#return; {4211#(<= ~counter~0 2)} is VALID [2022-04-28 07:58:08,745 INFO L290 TraceCheckUtils]: 25: Hoare triple {4144#true} assume true; {4144#true} is VALID [2022-04-28 07:58:08,745 INFO L290 TraceCheckUtils]: 24: Hoare triple {4144#true} assume !(0 == ~cond); {4144#true} is VALID [2022-04-28 07:58:08,745 INFO L290 TraceCheckUtils]: 23: Hoare triple {4144#true} ~cond := #in~cond; {4144#true} is VALID [2022-04-28 07:58:08,746 INFO L272 TraceCheckUtils]: 22: Hoare triple {4211#(<= ~counter~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)); {4144#true} is VALID [2022-04-28 07:58:08,746 INFO L290 TraceCheckUtils]: 21: Hoare triple {4211#(<= ~counter~0 2)} assume !!(#t~post5 < 5);havoc #t~post5; {4211#(<= ~counter~0 2)} is VALID [2022-04-28 07:58:08,746 INFO L290 TraceCheckUtils]: 20: Hoare triple {4186#(<= ~counter~0 1)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {4211#(<= ~counter~0 2)} is VALID [2022-04-28 07:58:08,746 INFO L290 TraceCheckUtils]: 19: Hoare triple {4186#(<= ~counter~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; {4186#(<= ~counter~0 1)} is VALID [2022-04-28 07:58:08,747 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {4144#true} {4186#(<= ~counter~0 1)} #55#return; {4186#(<= ~counter~0 1)} is VALID [2022-04-28 07:58:08,747 INFO L290 TraceCheckUtils]: 17: Hoare triple {4144#true} assume true; {4144#true} is VALID [2022-04-28 07:58:08,747 INFO L290 TraceCheckUtils]: 16: Hoare triple {4144#true} assume !(0 == ~cond); {4144#true} is VALID [2022-04-28 07:58:08,747 INFO L290 TraceCheckUtils]: 15: Hoare triple {4144#true} ~cond := #in~cond; {4144#true} is VALID [2022-04-28 07:58:08,747 INFO L272 TraceCheckUtils]: 14: Hoare triple {4186#(<= ~counter~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)); {4144#true} is VALID [2022-04-28 07:58:08,747 INFO L290 TraceCheckUtils]: 13: Hoare triple {4186#(<= ~counter~0 1)} assume !!(#t~post5 < 5);havoc #t~post5; {4186#(<= ~counter~0 1)} is VALID [2022-04-28 07:58:08,748 INFO L290 TraceCheckUtils]: 12: Hoare triple {4152#(<= ~counter~0 0)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {4186#(<= ~counter~0 1)} is VALID [2022-04-28 07:58:08,748 INFO L290 TraceCheckUtils]: 11: Hoare triple {4152#(<= ~counter~0 0)} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {4152#(<= ~counter~0 0)} is VALID [2022-04-28 07:58:08,748 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {4144#true} {4152#(<= ~counter~0 0)} #53#return; {4152#(<= ~counter~0 0)} is VALID [2022-04-28 07:58:08,749 INFO L290 TraceCheckUtils]: 9: Hoare triple {4144#true} assume true; {4144#true} is VALID [2022-04-28 07:58:08,749 INFO L290 TraceCheckUtils]: 8: Hoare triple {4144#true} assume !(0 == ~cond); {4144#true} is VALID [2022-04-28 07:58:08,749 INFO L290 TraceCheckUtils]: 7: Hoare triple {4144#true} ~cond := #in~cond; {4144#true} is VALID [2022-04-28 07:58:08,749 INFO L272 TraceCheckUtils]: 6: Hoare triple {4152#(<= ~counter~0 0)} call assume_abort_if_not((if ~k~0 <= 256 then 1 else 0)); {4144#true} is VALID [2022-04-28 07:58:08,749 INFO L290 TraceCheckUtils]: 5: Hoare triple {4152#(<= ~counter~0 0)} 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; {4152#(<= ~counter~0 0)} is VALID [2022-04-28 07:58:08,749 INFO L272 TraceCheckUtils]: 4: Hoare triple {4152#(<= ~counter~0 0)} call #t~ret6 := main(); {4152#(<= ~counter~0 0)} is VALID [2022-04-28 07:58:08,750 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4152#(<= ~counter~0 0)} {4144#true} #61#return; {4152#(<= ~counter~0 0)} is VALID [2022-04-28 07:58:08,750 INFO L290 TraceCheckUtils]: 2: Hoare triple {4152#(<= ~counter~0 0)} assume true; {4152#(<= ~counter~0 0)} is VALID [2022-04-28 07:58:08,750 INFO L290 TraceCheckUtils]: 1: Hoare triple {4144#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);~counter~0 := 0; {4152#(<= ~counter~0 0)} is VALID [2022-04-28 07:58:08,750 INFO L272 TraceCheckUtils]: 0: Hoare triple {4144#true} call ULTIMATE.init(); {4144#true} is VALID [2022-04-28 07:58:08,751 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 10 proven. 32 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2022-04-28 07:58:08,751 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 07:58:08,751 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1442078394] [2022-04-28 07:58:08,751 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 07:58:08,751 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [958102223] [2022-04-28 07:58:08,751 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [958102223] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 07:58:08,751 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 07:58:08,751 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 8 [2022-04-28 07:58:08,751 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 07:58:08,751 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [598600604] [2022-04-28 07:58:08,751 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [598600604] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 07:58:08,752 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 07:58:08,752 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-28 07:58:08,752 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [200257360] [2022-04-28 07:58:08,752 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 07:58:08,752 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.75) internal successors, (38), 7 states have internal predecessors, (38), 7 states have call successors, (9), 7 states have call predecessors, (9), 6 states have return successors, (7), 6 states have call predecessors, (7), 7 states have call successors, (7) Word has length 55 [2022-04-28 07:58:08,752 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 07:58:08,752 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 8 states, 8 states have (on average 4.75) internal successors, (38), 7 states have internal predecessors, (38), 7 states have call successors, (9), 7 states have call predecessors, (9), 6 states have return successors, (7), 6 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-28 07:58:08,796 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 54 edges. 54 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 07:58:08,796 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-28 07:58:08,796 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 07:58:08,796 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-28 07:58:08,796 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2022-04-28 07:58:08,797 INFO L87 Difference]: Start difference. First operand 54 states and 57 transitions. Second operand has 8 states, 8 states have (on average 4.75) internal successors, (38), 7 states have internal predecessors, (38), 7 states have call successors, (9), 7 states have call predecessors, (9), 6 states have return successors, (7), 6 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-28 07:58:08,987 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 07:58:08,987 INFO L93 Difference]: Finished difference Result 70 states and 72 transitions. [2022-04-28 07:58:08,988 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-04-28 07:58:08,988 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.75) internal successors, (38), 7 states have internal predecessors, (38), 7 states have call successors, (9), 7 states have call predecessors, (9), 6 states have return successors, (7), 6 states have call predecessors, (7), 7 states have call successors, (7) Word has length 55 [2022-04-28 07:58:08,988 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 07:58:08,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 4.75) internal successors, (38), 7 states have internal predecessors, (38), 7 states have call successors, (9), 7 states have call predecessors, (9), 6 states have return successors, (7), 6 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-28 07:58:08,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 70 transitions. [2022-04-28 07:58:08,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 4.75) internal successors, (38), 7 states have internal predecessors, (38), 7 states have call successors, (9), 7 states have call predecessors, (9), 6 states have return successors, (7), 6 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-28 07:58:08,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 70 transitions. [2022-04-28 07:58:08,990 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 12 states and 70 transitions. [2022-04-28 07:58:09,034 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 70 edges. 70 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 07:58:09,036 INFO L225 Difference]: With dead ends: 70 [2022-04-28 07:58:09,036 INFO L226 Difference]: Without dead ends: 60 [2022-04-28 07:58:09,036 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 102 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=51, Invalid=81, Unknown=0, NotChecked=0, Total=132 [2022-04-28 07:58:09,037 INFO L413 NwaCegarLoop]: 29 mSDtfsCounter, 6 mSDsluCounter, 85 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 114 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 07:58:09,037 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 114 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 07:58:09,037 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2022-04-28 07:58:09,085 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 60. [2022-04-28 07:58:09,085 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 07:58:09,086 INFO L82 GeneralOperation]: Start isEquivalent. First operand 60 states. Second operand has 60 states, 42 states have (on average 1.0476190476190477) internal successors, (44), 42 states have internal predecessors, (44), 10 states have call successors, (10), 9 states have call predecessors, (10), 7 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-28 07:58:09,086 INFO L74 IsIncluded]: Start isIncluded. First operand 60 states. Second operand has 60 states, 42 states have (on average 1.0476190476190477) internal successors, (44), 42 states have internal predecessors, (44), 10 states have call successors, (10), 9 states have call predecessors, (10), 7 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-28 07:58:09,086 INFO L87 Difference]: Start difference. First operand 60 states. Second operand has 60 states, 42 states have (on average 1.0476190476190477) internal successors, (44), 42 states have internal predecessors, (44), 10 states have call successors, (10), 9 states have call predecessors, (10), 7 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-28 07:58:09,087 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 07:58:09,087 INFO L93 Difference]: Finished difference Result 60 states and 62 transitions. [2022-04-28 07:58:09,087 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 62 transitions. [2022-04-28 07:58:09,087 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 07:58:09,087 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 07:58:09,088 INFO L74 IsIncluded]: Start isIncluded. First operand has 60 states, 42 states have (on average 1.0476190476190477) internal successors, (44), 42 states have internal predecessors, (44), 10 states have call successors, (10), 9 states have call predecessors, (10), 7 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Second operand 60 states. [2022-04-28 07:58:09,088 INFO L87 Difference]: Start difference. First operand has 60 states, 42 states have (on average 1.0476190476190477) internal successors, (44), 42 states have internal predecessors, (44), 10 states have call successors, (10), 9 states have call predecessors, (10), 7 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Second operand 60 states. [2022-04-28 07:58:09,089 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 07:58:09,089 INFO L93 Difference]: Finished difference Result 60 states and 62 transitions. [2022-04-28 07:58:09,089 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 62 transitions. [2022-04-28 07:58:09,089 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 07:58:09,089 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 07:58:09,089 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 07:58:09,089 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 07:58:09,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 42 states have (on average 1.0476190476190477) internal successors, (44), 42 states have internal predecessors, (44), 10 states have call successors, (10), 9 states have call predecessors, (10), 7 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-28 07:58:09,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 62 transitions. [2022-04-28 07:58:09,090 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 62 transitions. Word has length 55 [2022-04-28 07:58:09,090 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 07:58:09,090 INFO L495 AbstractCegarLoop]: Abstraction has 60 states and 62 transitions. [2022-04-28 07:58:09,090 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.75) internal successors, (38), 7 states have internal predecessors, (38), 7 states have call successors, (9), 7 states have call predecessors, (9), 6 states have return successors, (7), 6 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-28 07:58:09,090 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 60 states and 62 transitions. [2022-04-28 07:58:09,196 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 62 edges. 62 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 07:58:09,196 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 62 transitions. [2022-04-28 07:58:09,197 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2022-04-28 07:58:09,197 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 07:58:09,197 INFO L195 NwaCegarLoop]: trace histogram [7, 6, 6, 5, 5, 5, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 07:58:09,202 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-04-28 07:58:09,397 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2022-04-28 07:58:09,398 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 07:58:09,398 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 07:58:09,398 INFO L85 PathProgramCache]: Analyzing trace with hash 1425669898, now seen corresponding path program 7 times [2022-04-28 07:58:09,398 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 07:58:09,398 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1736170579] [2022-04-28 07:58:09,498 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 4 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-28 07:58:09,498 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONLINEAR_UPDATE [2022-04-28 07:58:09,498 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 07:58:09,498 INFO L85 PathProgramCache]: Analyzing trace with hash 1425669898, now seen corresponding path program 8 times [2022-04-28 07:58:09,498 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 07:58:09,498 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2021113610] [2022-04-28 07:58:09,498 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 07:58:09,498 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 07:58:09,508 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 07:58:09,508 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [772870194] [2022-04-28 07:58:09,508 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 07:58:09,509 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 07:58:09,509 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 07:58:09,510 INFO L229 MonitoredProcess]: Starting monitored process 12 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:09,532 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-04-28 07:58:10,031 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 07:58:10,031 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 07:58:10,033 INFO L263 TraceCheckSpWp]: Trace formula consists of 183 conjuncts, 25 conjunts are in the unsatisfiable core [2022-04-28 07:58:10,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 07:58:10,044 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 07:58:10,472 INFO L272 TraceCheckUtils]: 0: Hoare triple {4869#true} call ULTIMATE.init(); {4869#true} is VALID [2022-04-28 07:58:10,473 INFO L290 TraceCheckUtils]: 1: Hoare triple {4869#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);~counter~0 := 0; {4869#true} is VALID [2022-04-28 07:58:10,473 INFO L290 TraceCheckUtils]: 2: Hoare triple {4869#true} assume true; {4869#true} is VALID [2022-04-28 07:58:10,473 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4869#true} {4869#true} #61#return; {4869#true} is VALID [2022-04-28 07:58:10,473 INFO L272 TraceCheckUtils]: 4: Hoare triple {4869#true} call #t~ret6 := main(); {4869#true} is VALID [2022-04-28 07:58:10,473 INFO L290 TraceCheckUtils]: 5: Hoare triple {4869#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; {4869#true} is VALID [2022-04-28 07:58:10,473 INFO L272 TraceCheckUtils]: 6: Hoare triple {4869#true} call assume_abort_if_not((if ~k~0 <= 256 then 1 else 0)); {4869#true} is VALID [2022-04-28 07:58:10,473 INFO L290 TraceCheckUtils]: 7: Hoare triple {4869#true} ~cond := #in~cond; {4869#true} is VALID [2022-04-28 07:58:10,473 INFO L290 TraceCheckUtils]: 8: Hoare triple {4869#true} assume !(0 == ~cond); {4869#true} is VALID [2022-04-28 07:58:10,473 INFO L290 TraceCheckUtils]: 9: Hoare triple {4869#true} assume true; {4869#true} is VALID [2022-04-28 07:58:10,473 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {4869#true} {4869#true} #53#return; {4869#true} is VALID [2022-04-28 07:58:10,474 INFO L290 TraceCheckUtils]: 11: Hoare triple {4869#true} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {4907#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-28 07:58:10,474 INFO L290 TraceCheckUtils]: 12: Hoare triple {4907#(and (= main_~c~0 0) (= main_~y~0 0))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {4907#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-28 07:58:10,474 INFO L290 TraceCheckUtils]: 13: Hoare triple {4907#(and (= main_~c~0 0) (= main_~y~0 0))} assume !!(#t~post5 < 5);havoc #t~post5; {4907#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-28 07:58:10,474 INFO L272 TraceCheckUtils]: 14: Hoare triple {4907#(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)); {4869#true} is VALID [2022-04-28 07:58:10,474 INFO L290 TraceCheckUtils]: 15: Hoare triple {4869#true} ~cond := #in~cond; {4869#true} is VALID [2022-04-28 07:58:10,475 INFO L290 TraceCheckUtils]: 16: Hoare triple {4869#true} assume !(0 == ~cond); {4869#true} is VALID [2022-04-28 07:58:10,475 INFO L290 TraceCheckUtils]: 17: Hoare triple {4869#true} assume true; {4869#true} is VALID [2022-04-28 07:58:10,475 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {4869#true} {4907#(and (= main_~c~0 0) (= main_~y~0 0))} #55#return; {4907#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-28 07:58:10,475 INFO L290 TraceCheckUtils]: 19: Hoare triple {4907#(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; {4932#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0) (< main_~c~0 (+ main_~k~0 1)))} is VALID [2022-04-28 07:58:10,476 INFO L290 TraceCheckUtils]: 20: Hoare triple {4932#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0) (< main_~c~0 (+ main_~k~0 1)))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {4932#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0) (< main_~c~0 (+ main_~k~0 1)))} is VALID [2022-04-28 07:58:10,476 INFO L290 TraceCheckUtils]: 21: Hoare triple {4932#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0) (< main_~c~0 (+ main_~k~0 1)))} assume !!(#t~post5 < 5);havoc #t~post5; {4932#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0) (< main_~c~0 (+ main_~k~0 1)))} is VALID [2022-04-28 07:58:10,476 INFO L272 TraceCheckUtils]: 22: Hoare triple {4932#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0) (< main_~c~0 (+ main_~k~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)); {4869#true} is VALID [2022-04-28 07:58:10,476 INFO L290 TraceCheckUtils]: 23: Hoare triple {4869#true} ~cond := #in~cond; {4869#true} is VALID [2022-04-28 07:58:10,476 INFO L290 TraceCheckUtils]: 24: Hoare triple {4869#true} assume !(0 == ~cond); {4869#true} is VALID [2022-04-28 07:58:10,476 INFO L290 TraceCheckUtils]: 25: Hoare triple {4869#true} assume true; {4869#true} is VALID [2022-04-28 07:58:10,477 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {4869#true} {4932#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0) (< main_~c~0 (+ main_~k~0 1)))} #55#return; {4932#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0) (< main_~c~0 (+ main_~k~0 1)))} is VALID [2022-04-28 07:58:10,477 INFO L290 TraceCheckUtils]: 27: Hoare triple {4932#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0) (< main_~c~0 (+ main_~k~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; {4957#(and (= (+ (- 2) main_~y~0) 0) (= main_~c~0 2) (< 0 main_~k~0))} is VALID [2022-04-28 07:58:10,478 INFO L290 TraceCheckUtils]: 28: Hoare triple {4957#(and (= (+ (- 2) main_~y~0) 0) (= main_~c~0 2) (< 0 main_~k~0))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {4957#(and (= (+ (- 2) main_~y~0) 0) (= main_~c~0 2) (< 0 main_~k~0))} is VALID [2022-04-28 07:58:10,478 INFO L290 TraceCheckUtils]: 29: Hoare triple {4957#(and (= (+ (- 2) main_~y~0) 0) (= main_~c~0 2) (< 0 main_~k~0))} assume !!(#t~post5 < 5);havoc #t~post5; {4957#(and (= (+ (- 2) main_~y~0) 0) (= main_~c~0 2) (< 0 main_~k~0))} is VALID [2022-04-28 07:58:10,478 INFO L272 TraceCheckUtils]: 30: Hoare triple {4957#(and (= (+ (- 2) main_~y~0) 0) (= main_~c~0 2) (< 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)); {4869#true} is VALID [2022-04-28 07:58:10,478 INFO L290 TraceCheckUtils]: 31: Hoare triple {4869#true} ~cond := #in~cond; {4869#true} is VALID [2022-04-28 07:58:10,478 INFO L290 TraceCheckUtils]: 32: Hoare triple {4869#true} assume !(0 == ~cond); {4869#true} is VALID [2022-04-28 07:58:10,478 INFO L290 TraceCheckUtils]: 33: Hoare triple {4869#true} assume true; {4869#true} is VALID [2022-04-28 07:58:10,479 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {4869#true} {4957#(and (= (+ (- 2) main_~y~0) 0) (= main_~c~0 2) (< 0 main_~k~0))} #55#return; {4957#(and (= (+ (- 2) main_~y~0) 0) (= main_~c~0 2) (< 0 main_~k~0))} is VALID [2022-04-28 07:58:10,479 INFO L290 TraceCheckUtils]: 35: Hoare triple {4957#(and (= (+ (- 2) main_~y~0) 0) (= main_~c~0 2) (< 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; {4982#(and (= (+ main_~y~0 (- 3)) 0) (= (+ (- 1) main_~c~0) 2) (< 0 main_~k~0))} is VALID [2022-04-28 07:58:10,479 INFO L290 TraceCheckUtils]: 36: Hoare triple {4982#(and (= (+ main_~y~0 (- 3)) 0) (= (+ (- 1) main_~c~0) 2) (< 0 main_~k~0))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {4982#(and (= (+ main_~y~0 (- 3)) 0) (= (+ (- 1) main_~c~0) 2) (< 0 main_~k~0))} is VALID [2022-04-28 07:58:10,480 INFO L290 TraceCheckUtils]: 37: Hoare triple {4982#(and (= (+ main_~y~0 (- 3)) 0) (= (+ (- 1) main_~c~0) 2) (< 0 main_~k~0))} assume !!(#t~post5 < 5);havoc #t~post5; {4982#(and (= (+ main_~y~0 (- 3)) 0) (= (+ (- 1) main_~c~0) 2) (< 0 main_~k~0))} is VALID [2022-04-28 07:58:10,480 INFO L272 TraceCheckUtils]: 38: Hoare triple {4982#(and (= (+ main_~y~0 (- 3)) 0) (= (+ (- 1) main_~c~0) 2) (< 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)); {4869#true} is VALID [2022-04-28 07:58:10,480 INFO L290 TraceCheckUtils]: 39: Hoare triple {4869#true} ~cond := #in~cond; {4869#true} is VALID [2022-04-28 07:58:10,480 INFO L290 TraceCheckUtils]: 40: Hoare triple {4869#true} assume !(0 == ~cond); {4869#true} is VALID [2022-04-28 07:58:10,480 INFO L290 TraceCheckUtils]: 41: Hoare triple {4869#true} assume true; {4869#true} is VALID [2022-04-28 07:58:10,480 INFO L284 TraceCheckUtils]: 42: Hoare quadruple {4869#true} {4982#(and (= (+ main_~y~0 (- 3)) 0) (= (+ (- 1) main_~c~0) 2) (< 0 main_~k~0))} #55#return; {4982#(and (= (+ main_~y~0 (- 3)) 0) (= (+ (- 1) main_~c~0) 2) (< 0 main_~k~0))} is VALID [2022-04-28 07:58:10,481 INFO L290 TraceCheckUtils]: 43: Hoare triple {4982#(and (= (+ main_~y~0 (- 3)) 0) (= (+ (- 1) main_~c~0) 2) (< 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; {5007#(and (= main_~y~0 4) (< 3 main_~k~0) (<= main_~c~0 4))} is VALID [2022-04-28 07:58:10,481 INFO L290 TraceCheckUtils]: 44: Hoare triple {5007#(and (= main_~y~0 4) (< 3 main_~k~0) (<= main_~c~0 4))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {5007#(and (= main_~y~0 4) (< 3 main_~k~0) (<= main_~c~0 4))} is VALID [2022-04-28 07:58:10,481 INFO L290 TraceCheckUtils]: 45: Hoare triple {5007#(and (= main_~y~0 4) (< 3 main_~k~0) (<= main_~c~0 4))} assume !!(#t~post5 < 5);havoc #t~post5; {5007#(and (= main_~y~0 4) (< 3 main_~k~0) (<= main_~c~0 4))} is VALID [2022-04-28 07:58:10,481 INFO L272 TraceCheckUtils]: 46: Hoare triple {5007#(and (= main_~y~0 4) (< 3 main_~k~0) (<= main_~c~0 4))} 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)); {4869#true} is VALID [2022-04-28 07:58:10,482 INFO L290 TraceCheckUtils]: 47: Hoare triple {4869#true} ~cond := #in~cond; {4869#true} is VALID [2022-04-28 07:58:10,482 INFO L290 TraceCheckUtils]: 48: Hoare triple {4869#true} assume !(0 == ~cond); {4869#true} is VALID [2022-04-28 07:58:10,482 INFO L290 TraceCheckUtils]: 49: Hoare triple {4869#true} assume true; {4869#true} is VALID [2022-04-28 07:58:10,482 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {4869#true} {5007#(and (= main_~y~0 4) (< 3 main_~k~0) (<= main_~c~0 4))} #55#return; {5007#(and (= main_~y~0 4) (< 3 main_~k~0) (<= main_~c~0 4))} is VALID [2022-04-28 07:58:10,482 INFO L290 TraceCheckUtils]: 51: Hoare triple {5007#(and (= main_~y~0 4) (< 3 main_~k~0) (<= main_~c~0 4))} assume !(~c~0 < ~k~0); {5032#(and (= main_~y~0 4) (< 3 main_~k~0) (<= main_~k~0 4))} is VALID [2022-04-28 07:58:10,483 INFO L272 TraceCheckUtils]: 52: Hoare triple {5032#(and (= main_~y~0 4) (< 3 main_~k~0) (<= main_~k~0 4))} 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)); {4869#true} is VALID [2022-04-28 07:58:10,483 INFO L290 TraceCheckUtils]: 53: Hoare triple {4869#true} ~cond := #in~cond; {4869#true} is VALID [2022-04-28 07:58:10,483 INFO L290 TraceCheckUtils]: 54: Hoare triple {4869#true} assume !(0 == ~cond); {4869#true} is VALID [2022-04-28 07:58:10,483 INFO L290 TraceCheckUtils]: 55: Hoare triple {4869#true} assume true; {4869#true} is VALID [2022-04-28 07:58:10,483 INFO L284 TraceCheckUtils]: 56: Hoare quadruple {4869#true} {5032#(and (= main_~y~0 4) (< 3 main_~k~0) (<= main_~k~0 4))} #57#return; {5032#(and (= main_~y~0 4) (< 3 main_~k~0) (<= main_~k~0 4))} is VALID [2022-04-28 07:58:10,484 INFO L272 TraceCheckUtils]: 57: Hoare triple {5032#(and (= main_~y~0 4) (< 3 main_~k~0) (<= main_~k~0 4))} call __VERIFIER_assert((if ~k~0 * ~y~0 == ~y~0 * ~y~0 then 1 else 0)); {5051#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 07:58:10,484 INFO L290 TraceCheckUtils]: 58: Hoare triple {5051#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {5055#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 07:58:10,484 INFO L290 TraceCheckUtils]: 59: Hoare triple {5055#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {4870#false} is VALID [2022-04-28 07:58:10,484 INFO L290 TraceCheckUtils]: 60: Hoare triple {4870#false} assume !false; {4870#false} is VALID [2022-04-28 07:58:10,485 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 12 proven. 40 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2022-04-28 07:58:10,485 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 07:58:11,064 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 07:58:11,065 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2021113610] [2022-04-28 07:58:11,065 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 07:58:11,065 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [772870194] [2022-04-28 07:58:11,065 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [772870194] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 07:58:11,065 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-28 07:58:11,065 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2022-04-28 07:58:11,065 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 07:58:11,065 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1736170579] [2022-04-28 07:58:11,065 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1736170579] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 07:58:11,065 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 07:58:11,065 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-04-28 07:58:11,066 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [943659732] [2022-04-28 07:58:11,066 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 07:58:11,066 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 9 states have internal predecessors, (28), 7 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (8), 7 states have call predecessors, (8), 7 states have call successors, (8) Word has length 61 [2022-04-28 07:58:11,066 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 07:58:11,066 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 9 states have internal predecessors, (28), 7 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (8), 7 states have call predecessors, (8), 7 states have call successors, (8) [2022-04-28 07:58:11,103 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:11,103 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-04-28 07:58:11,103 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 07:58:11,103 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-04-28 07:58:11,104 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=188, Unknown=0, NotChecked=0, Total=240 [2022-04-28 07:58:11,104 INFO L87 Difference]: Start difference. First operand 60 states and 62 transitions. Second operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 9 states have internal predecessors, (28), 7 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (8), 7 states have call predecessors, (8), 7 states have call successors, (8) [2022-04-28 07:58:11,566 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 07:58:11,566 INFO L93 Difference]: Finished difference Result 68 states and 72 transitions. [2022-04-28 07:58:11,566 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-04-28 07:58:11,566 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 9 states have internal predecessors, (28), 7 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (8), 7 states have call predecessors, (8), 7 states have call successors, (8) Word has length 61 [2022-04-28 07:58:11,567 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 07:58:11,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 9 states have internal predecessors, (28), 7 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (8), 7 states have call predecessors, (8), 7 states have call successors, (8) [2022-04-28 07:58:11,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 59 transitions. [2022-04-28 07:58:11,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 9 states have internal predecessors, (28), 7 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (8), 7 states have call predecessors, (8), 7 states have call successors, (8) [2022-04-28 07:58:11,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 59 transitions. [2022-04-28 07:58:11,569 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 10 states and 59 transitions. [2022-04-28 07:58:11,613 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 59 edges. 59 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 07:58:11,614 INFO L225 Difference]: With dead ends: 68 [2022-04-28 07:58:11,614 INFO L226 Difference]: Without dead ends: 62 [2022-04-28 07:58:11,614 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 88 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=62, Invalid=244, Unknown=0, NotChecked=0, Total=306 [2022-04-28 07:58:11,614 INFO L413 NwaCegarLoop]: 44 mSDtfsCounter, 2 mSDsluCounter, 222 mSDsCounter, 0 mSdLazyCounter, 168 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 266 SdHoareTripleChecker+Invalid, 169 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 168 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 07:58:11,615 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 266 Invalid, 169 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 168 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 07:58:11,615 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2022-04-28 07:58:11,674 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 62. [2022-04-28 07:58:11,674 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 07:58:11,674 INFO L82 GeneralOperation]: Start isEquivalent. First operand 62 states. Second operand has 62 states, 43 states have (on average 1.0465116279069768) internal successors, (45), 43 states have internal predecessors, (45), 11 states have call successors, (11), 9 states have call predecessors, (11), 7 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-28 07:58:11,674 INFO L74 IsIncluded]: Start isIncluded. First operand 62 states. Second operand has 62 states, 43 states have (on average 1.0465116279069768) internal successors, (45), 43 states have internal predecessors, (45), 11 states have call successors, (11), 9 states have call predecessors, (11), 7 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-28 07:58:11,674 INFO L87 Difference]: Start difference. First operand 62 states. Second operand has 62 states, 43 states have (on average 1.0465116279069768) internal successors, (45), 43 states have internal predecessors, (45), 11 states have call successors, (11), 9 states have call predecessors, (11), 7 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-28 07:58:11,676 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 07:58:11,676 INFO L93 Difference]: Finished difference Result 62 states and 65 transitions. [2022-04-28 07:58:11,676 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 65 transitions. [2022-04-28 07:58:11,676 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 07:58:11,676 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 07:58:11,676 INFO L74 IsIncluded]: Start isIncluded. First operand has 62 states, 43 states have (on average 1.0465116279069768) internal successors, (45), 43 states have internal predecessors, (45), 11 states have call successors, (11), 9 states have call predecessors, (11), 7 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) Second operand 62 states. [2022-04-28 07:58:11,676 INFO L87 Difference]: Start difference. First operand has 62 states, 43 states have (on average 1.0465116279069768) internal successors, (45), 43 states have internal predecessors, (45), 11 states have call successors, (11), 9 states have call predecessors, (11), 7 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) Second operand 62 states. [2022-04-28 07:58:11,677 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 07:58:11,677 INFO L93 Difference]: Finished difference Result 62 states and 65 transitions. [2022-04-28 07:58:11,677 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 65 transitions. [2022-04-28 07:58:11,678 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 07:58:11,678 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 07:58:11,678 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 07:58:11,678 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 07:58:11,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 43 states have (on average 1.0465116279069768) internal successors, (45), 43 states have internal predecessors, (45), 11 states have call successors, (11), 9 states have call predecessors, (11), 7 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-28 07:58:11,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 65 transitions. [2022-04-28 07:58:11,679 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 65 transitions. Word has length 61 [2022-04-28 07:58:11,679 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 07:58:11,679 INFO L495 AbstractCegarLoop]: Abstraction has 62 states and 65 transitions. [2022-04-28 07:58:11,679 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 9 states have internal predecessors, (28), 7 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (8), 7 states have call predecessors, (8), 7 states have call successors, (8) [2022-04-28 07:58:11,679 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 62 states and 65 transitions. [2022-04-28 07:58:11,820 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 65 edges. 65 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 07:58:11,820 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 65 transitions. [2022-04-28 07:58:11,821 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2022-04-28 07:58:11,821 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 07:58:11,821 INFO L195 NwaCegarLoop]: trace histogram [7, 6, 6, 6, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 07:58:11,826 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2022-04-28 07:58:12,026 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2022-04-28 07:58:12,026 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 07:58:12,027 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 07:58:12,027 INFO L85 PathProgramCache]: Analyzing trace with hash -1579977147, now seen corresponding path program 7 times [2022-04-28 07:58:12,027 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 07:58:12,027 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1733060933] [2022-04-28 07:58:12,138 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 4 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-28 07:58:12,138 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONLINEAR_UPDATE [2022-04-28 07:58:12,138 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 07:58:12,138 INFO L85 PathProgramCache]: Analyzing trace with hash -1579977147, now seen corresponding path program 8 times [2022-04-28 07:58:12,138 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 07:58:12,138 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [115227546] [2022-04-28 07:58:12,139 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 07:58:12,139 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 07:58:12,148 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 07:58:12,148 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1555972516] [2022-04-28 07:58:12,148 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 07:58:12,148 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 07:58:12,148 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 07:58:12,149 INFO L229 MonitoredProcess]: Starting monitored process 13 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:12,150 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2022-04-28 07:58:12,539 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 07:58:12,539 INFO L229 tOrderPrioritization]: Conjunction of SSA is sat [2022-04-28 07:58:12,539 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-04-28 07:58:12,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-28 07:58:12,635 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-04-28 07:58:12,636 INFO L130 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found a feasible trace [2022-04-28 07:58:12,636 INFO L271 BasicCegarLoop]: Counterexample is feasible [2022-04-28 07:58:12,637 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-04-28 07:58:12,659 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2022-04-28 07:58:12,839 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2022-04-28 07:58:12,841 INFO L356 BasicCegarLoop]: Path program histogram: [8, 8, 2, 2, 2, 2, 2] [2022-04-28 07:58:12,844 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-04-28 07:58:12,856 WARN L170 areAnnotationChecker]: reach_errorENTRY has no Hoare annotation [2022-04-28 07:58:12,856 WARN L170 areAnnotationChecker]: ULTIMATE.initENTRY has no Hoare annotation [2022-04-28 07:58:12,856 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2022-04-28 07:58:12,856 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2022-04-28 07:58:12,856 WARN L170 areAnnotationChecker]: assume_abort_if_notENTRY has no Hoare annotation [2022-04-28 07:58:12,857 WARN L170 areAnnotationChecker]: mainENTRY has no Hoare annotation [2022-04-28 07:58:12,857 WARN L170 areAnnotationChecker]: __VERIFIER_assertENTRY has no Hoare annotation [2022-04-28 07:58:12,857 WARN L170 areAnnotationChecker]: reach_errorFINAL has no Hoare annotation [2022-04-28 07:58:12,857 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2022-04-28 07:58:12,857 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2022-04-28 07:58:12,857 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2022-04-28 07:58:12,857 WARN L170 areAnnotationChecker]: L7 has no Hoare annotation [2022-04-28 07:58:12,857 WARN L170 areAnnotationChecker]: L7 has no Hoare annotation [2022-04-28 07:58:12,857 WARN L170 areAnnotationChecker]: L22 has no Hoare annotation [2022-04-28 07:58:12,857 WARN L170 areAnnotationChecker]: L22 has no Hoare annotation [2022-04-28 07:58:12,857 WARN L170 areAnnotationChecker]: L10 has no Hoare annotation [2022-04-28 07:58:12,857 WARN L170 areAnnotationChecker]: L10 has no Hoare annotation [2022-04-28 07:58:12,857 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2022-04-28 07:58:12,857 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2022-04-28 07:58:12,857 WARN L170 areAnnotationChecker]: L7-2 has no Hoare annotation [2022-04-28 07:58:12,857 WARN L170 areAnnotationChecker]: L22-1 has no Hoare annotation [2022-04-28 07:58:12,857 WARN L170 areAnnotationChecker]: L11 has no Hoare annotation [2022-04-28 07:58:12,857 WARN L170 areAnnotationChecker]: L11 has no Hoare annotation [2022-04-28 07:58:12,857 WARN L170 areAnnotationChecker]: L10-2 has no Hoare annotation [2022-04-28 07:58:12,857 WARN L170 areAnnotationChecker]: assume_abort_if_notEXIT has no Hoare annotation [2022-04-28 07:58:12,857 WARN L170 areAnnotationChecker]: L28-3 has no Hoare annotation [2022-04-28 07:58:12,857 WARN L170 areAnnotationChecker]: L28-3 has no Hoare annotation [2022-04-28 07:58:12,857 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-28 07:58:12,857 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-28 07:58:12,857 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-28 07:58:12,857 WARN L170 areAnnotationChecker]: L28-4 has no Hoare annotation [2022-04-28 07:58:12,858 WARN L170 areAnnotationChecker]: L28-4 has no Hoare annotation [2022-04-28 07:58:12,858 WARN L170 areAnnotationChecker]: L28-1 has no Hoare annotation [2022-04-28 07:58:12,858 WARN L170 areAnnotationChecker]: L28-1 has no Hoare annotation [2022-04-28 07:58:12,858 WARN L170 areAnnotationChecker]: L29-1 has no Hoare annotation [2022-04-28 07:58:12,858 WARN L170 areAnnotationChecker]: L29-1 has no Hoare annotation [2022-04-28 07:58:12,858 WARN L170 areAnnotationChecker]: L39 has no Hoare annotation [2022-04-28 07:58:12,858 WARN L170 areAnnotationChecker]: L39 has no Hoare annotation [2022-04-28 07:58:12,858 WARN L170 areAnnotationChecker]: L40 has no Hoare annotation [2022-04-28 07:58:12,858 WARN L170 areAnnotationChecker]: L29 has no Hoare annotation [2022-04-28 07:58:12,858 WARN L170 areAnnotationChecker]: L29 has no Hoare annotation [2022-04-28 07:58:12,858 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2022-04-28 07:58:12,858 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2022-04-28 07:58:12,858 INFO L163 areAnnotationChecker]: CFG has 0 edges. 0 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2022-04-28 07:58:12,859 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.04 07:58:12 BoogieIcfgContainer [2022-04-28 07:58:12,859 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-04-28 07:58:12,860 INFO L158 Benchmark]: Toolchain (without parser) took 52738.34ms. Allocated memory was 240.1MB in the beginning and 448.8MB in the end (delta: 208.7MB). Free memory was 185.6MB in the beginning and 248.4MB in the end (delta: -62.7MB). Peak memory consumption was 146.7MB. Max. memory is 8.0GB. [2022-04-28 07:58:12,860 INFO L158 Benchmark]: CDTParser took 0.09ms. Allocated memory is still 240.1MB. Free memory is still 201.7MB. There was no memory consumed. Max. memory is 8.0GB. [2022-04-28 07:58:12,860 INFO L158 Benchmark]: CACSL2BoogieTranslator took 209.90ms. Allocated memory was 240.1MB in the beginning and 373.3MB in the end (delta: 133.2MB). Free memory was 185.4MB in the beginning and 343.0MB in the end (delta: -157.6MB). Peak memory consumption was 10.9MB. Max. memory is 8.0GB. [2022-04-28 07:58:12,860 INFO L158 Benchmark]: Boogie Preprocessor took 29.01ms. Allocated memory is still 373.3MB. Free memory was 343.0MB in the beginning and 341.5MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-04-28 07:58:12,860 INFO L158 Benchmark]: RCFGBuilder took 297.89ms. Allocated memory is still 373.3MB. Free memory was 341.5MB in the beginning and 329.9MB in the end (delta: 11.5MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2022-04-28 07:58:12,860 INFO L158 Benchmark]: TraceAbstraction took 52183.23ms. Allocated memory was 373.3MB in the beginning and 448.8MB in the end (delta: 75.5MB). Free memory was 329.4MB in the beginning and 248.4MB in the end (delta: 81.0MB). Peak memory consumption was 157.1MB. Max. memory is 8.0GB. [2022-04-28 07:58:12,861 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 240.1MB. Free memory is still 201.7MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 209.90ms. Allocated memory was 240.1MB in the beginning and 373.3MB in the end (delta: 133.2MB). Free memory was 185.4MB in the beginning and 343.0MB in the end (delta: -157.6MB). Peak memory consumption was 10.9MB. Max. memory is 8.0GB. * Boogie Preprocessor took 29.01ms. Allocated memory is still 373.3MB. Free memory was 343.0MB in the beginning and 341.5MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 297.89ms. Allocated memory is still 373.3MB. Free memory was 341.5MB in the beginning and 329.9MB in the end (delta: 11.5MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * TraceAbstraction took 52183.23ms. Allocated memory was 373.3MB in the beginning and 448.8MB in the end (delta: 75.5MB). Free memory was 329.4MB in the beginning and 248.4MB in the end (delta: 81.0MB). Peak memory consumption was 157.1MB. 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 - CounterExampleResult [Line: 12]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L17] int counter = 0; [L19] short k; [L20] long long y, x, c; [L21] k = __VERIFIER_nondet_short() [L22] CALL assume_abort_if_not(k <= 256) [L7] COND FALSE !(!cond) [L22] RET assume_abort_if_not(k <= 256) [L24] y = 0 [L25] x = 0 [L26] c = 0 [L28] EXPR counter++ [L28] COND TRUE counter++<5 [L29] CALL __VERIFIER_assert(-2*y*y*y*y*y*y - 6 * y*y*y*y*y - 5 * y*y*y*y + y*y + 12*x == 0) [L10] COND FALSE !(!(cond)) [L29] RET __VERIFIER_assert(-2*y*y*y*y*y*y - 6 * y*y*y*y*y - 5 * y*y*y*y + y*y + 12*x == 0) [L31] COND FALSE !(!(c < k)) [L34] c = c + 1 [L35] y = y + 1 [L36] x = y * y * y * y * y + x [L28] EXPR counter++ [L28] COND TRUE counter++<5 [L29] CALL __VERIFIER_assert(-2*y*y*y*y*y*y - 6 * y*y*y*y*y - 5 * y*y*y*y + y*y + 12*x == 0) [L10] COND FALSE !(!(cond)) [L29] RET __VERIFIER_assert(-2*y*y*y*y*y*y - 6 * y*y*y*y*y - 5 * y*y*y*y + y*y + 12*x == 0) [L31] COND FALSE !(!(c < k)) [L34] c = c + 1 [L35] y = y + 1 [L36] x = y * y * y * y * y + x [L28] EXPR counter++ [L28] COND TRUE counter++<5 [L29] CALL __VERIFIER_assert(-2*y*y*y*y*y*y - 6 * y*y*y*y*y - 5 * y*y*y*y + y*y + 12*x == 0) [L10] COND FALSE !(!(cond)) [L29] RET __VERIFIER_assert(-2*y*y*y*y*y*y - 6 * y*y*y*y*y - 5 * y*y*y*y + y*y + 12*x == 0) [L31] COND FALSE !(!(c < k)) [L34] c = c + 1 [L35] y = y + 1 [L36] x = y * y * y * y * y + x [L28] EXPR counter++ [L28] COND TRUE counter++<5 [L29] CALL __VERIFIER_assert(-2*y*y*y*y*y*y - 6 * y*y*y*y*y - 5 * y*y*y*y + y*y + 12*x == 0) [L10] COND FALSE !(!(cond)) [L29] RET __VERIFIER_assert(-2*y*y*y*y*y*y - 6 * y*y*y*y*y - 5 * y*y*y*y + y*y + 12*x == 0) [L31] COND FALSE !(!(c < k)) [L34] c = c + 1 [L35] y = y + 1 [L36] x = y * y * y * y * y + x [L28] EXPR counter++ [L28] COND TRUE counter++<5 [L29] CALL __VERIFIER_assert(-2*y*y*y*y*y*y - 6 * y*y*y*y*y - 5 * y*y*y*y + y*y + 12*x == 0) [L10] COND FALSE !(!(cond)) [L29] RET __VERIFIER_assert(-2*y*y*y*y*y*y - 6 * y*y*y*y*y - 5 * y*y*y*y + y*y + 12*x == 0) [L31] COND FALSE !(!(c < k)) [L34] c = c + 1 [L35] y = y + 1 [L36] x = y * y * y * y * y + x [L28] EXPR counter++ [L28] COND FALSE !(counter++<5) [L39] CALL __VERIFIER_assert(-2*y*y*y*y*y*y - 6 * y*y*y*y*y - 5 * y*y*y*y + y*y + 12*x == 0) [L10] COND FALSE !(!(cond)) [L39] RET __VERIFIER_assert(-2*y*y*y*y*y*y - 6 * y*y*y*y*y - 5 * y*y*y*y + y*y + 12*x == 0) [L40] CALL __VERIFIER_assert(k*y == y*y) [L10] COND TRUE !(cond) [L12] reach_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 6 procedures, 32 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 52.1s, OverallIterations: 13, TraceHistogramMax: 7, PathProgramHistogramMax: 8, EmptinessCheckTime: 0.0s, AutomataDifference: 3.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 71 SdHoareTripleChecker+Valid, 0.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 67 mSDsluCounter, 1439 SdHoareTripleChecker+Invalid, 0.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1078 mSDsCounter, 42 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 579 IncrementalHoareTripleChecker+Invalid, 621 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 42 mSolverCounterUnsat, 361 mSDtfsCounter, 579 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 734 GetRequests, 627 SyntacticMatches, 9 SemanticMatches, 98 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=62occurred in iteration=12, InterpolantAutomatonStates: 87, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.5s AutomataMinimizationTime, 12 MinimizatonAttempts, 1 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, 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 RESULT: Ultimate proved your program to be incorrect! [2022-04-28 07:58:12,874 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...