/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/acceleratedInterpolationQvasr_64.epf -i ../../../trunk/examples/svcomp/nla-digbench-scaling/ps6-ll_unwindbound10.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-34549b5 [2022-04-08 14:31:13,415 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-08 14:31:13,417 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-08 14:31:13,440 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-08 14:31:13,440 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-08 14:31:13,441 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-08 14:31:13,442 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-08 14:31:13,444 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-08 14:31:13,445 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-08 14:31:13,446 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-08 14:31:13,446 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-08 14:31:13,447 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-08 14:31:13,448 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-08 14:31:13,448 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-08 14:31:13,449 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-08 14:31:13,450 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-08 14:31:13,451 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-08 14:31:13,452 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-08 14:31:13,453 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-08 14:31:13,456 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-08 14:31:13,458 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-08 14:31:13,459 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-08 14:31:13,460 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-08 14:31:13,461 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-08 14:31:13,461 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-08 14:31:13,464 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-08 14:31:13,464 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-08 14:31:13,465 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-08 14:31:13,465 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-08 14:31:13,466 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-08 14:31:13,466 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-08 14:31:13,467 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-08 14:31:13,467 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-08 14:31:13,468 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-08 14:31:13,468 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-08 14:31:13,469 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-08 14:31:13,469 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-08 14:31:13,470 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-08 14:31:13,470 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-08 14:31:13,470 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-08 14:31:13,475 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-08 14:31:13,476 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-08 14:31:13,477 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationQvasr_64.epf [2022-04-08 14:31:13,487 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-08 14:31:13,487 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-08 14:31:13,488 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-08 14:31:13,489 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-08 14:31:13,489 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-08 14:31:13,489 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-08 14:31:13,489 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-08 14:31:13,489 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-08 14:31:13,489 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-08 14:31:13,489 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-08 14:31:13,489 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-08 14:31:13,490 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-08 14:31:13,490 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-08 14:31:13,490 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-08 14:31:13,490 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-08 14:31:13,490 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-08 14:31:13,490 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-08 14:31:13,490 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-04-08 14:31:13,490 INFO L138 SettingsManager]: * Trace refinement strategy=ACCELERATED_INTERPOLATION [2022-04-08 14:31:13,491 INFO L138 SettingsManager]: * Trace refinement strategy used in Accelerated Interpolation=CAMEL [2022-04-08 14:31:13,491 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-08 14:31:13,491 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=QVASR [2022-04-08 14:31:13,491 INFO L138 SettingsManager]: * Use separate solver for trace checks=false WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.core: Log level for class -> de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN; [2022-04-08 14:31:13,726 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-08 14:31:13,749 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-08 14:31:13,751 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-08 14:31:13,752 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-08 14:31:13,752 INFO L275 PluginConnector]: CDTParser initialized [2022-04-08 14:31:13,754 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/nla-digbench-scaling/ps6-ll_unwindbound10.c [2022-04-08 14:31:13,814 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e7a123de1/b0833c45649244c58780ea31ad17cdde/FLAGe5433c9e3 [2022-04-08 14:31:14,163 INFO L306 CDTParser]: Found 1 translation units. [2022-04-08 14:31:14,164 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/ps6-ll_unwindbound10.c [2022-04-08 14:31:14,174 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e7a123de1/b0833c45649244c58780ea31ad17cdde/FLAGe5433c9e3 [2022-04-08 14:31:14,584 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e7a123de1/b0833c45649244c58780ea31ad17cdde [2022-04-08 14:31:14,586 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-08 14:31:14,587 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-08 14:31:14,589 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-08 14:31:14,589 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-08 14:31:14,591 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-08 14:31:14,592 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.04 02:31:14" (1/1) ... [2022-04-08 14:31:14,593 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@771ac581 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 02:31:14, skipping insertion in model container [2022-04-08 14:31:14,594 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.04 02:31:14" (1/1) ... [2022-04-08 14:31:14,599 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-08 14:31:14,614 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-08 14:31:14,763 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_unwindbound10.c[458,471] [2022-04-08 14:31:14,782 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-08 14:31:14,789 INFO L203 MainTranslator]: Completed pre-run [2022-04-08 14:31:14,800 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_unwindbound10.c[458,471] [2022-04-08 14:31:14,809 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-08 14:31:14,820 INFO L208 MainTranslator]: Completed translation [2022-04-08 14:31:14,821 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 02:31:14 WrapperNode [2022-04-08 14:31:14,821 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-08 14:31:14,822 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-08 14:31:14,822 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-08 14:31:14,822 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-08 14:31:14,835 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 02:31:14" (1/1) ... [2022-04-08 14:31:14,835 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 02:31:14" (1/1) ... [2022-04-08 14:31:14,844 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 02:31:14" (1/1) ... [2022-04-08 14:31:14,844 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 02:31:14" (1/1) ... [2022-04-08 14:31:14,860 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 02:31:14" (1/1) ... [2022-04-08 14:31:14,867 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 02:31:14" (1/1) ... [2022-04-08 14:31:14,869 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 02:31:14" (1/1) ... [2022-04-08 14:31:14,875 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-08 14:31:14,876 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-08 14:31:14,876 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-08 14:31:14,876 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-08 14:31:14,877 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 02:31:14" (1/1) ... [2022-04-08 14:31:14,888 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-08 14:31:14,899 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 14:31:14,912 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-04-08 14:31:14,920 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-04-08 14:31:14,946 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-08 14:31:14,946 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-08 14:31:14,946 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-08 14:31:14,946 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-08 14:31:14,946 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-08 14:31:14,947 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-08 14:31:14,947 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-08 14:31:14,947 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-08 14:31:14,947 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-08 14:31:14,947 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-08 14:31:14,948 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_short [2022-04-08 14:31:14,948 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-08 14:31:14,949 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-08 14:31:14,949 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-08 14:31:14,949 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-08 14:31:14,950 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-08 14:31:14,950 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-08 14:31:14,950 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-08 14:31:14,950 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-08 14:31:14,951 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-08 14:31:15,007 INFO L234 CfgBuilder]: Building ICFG [2022-04-08 14:31:15,009 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-08 14:31:15,193 INFO L275 CfgBuilder]: Performing block encoding [2022-04-08 14:31:15,199 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-08 14:31:15,199 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-08 14:31:15,201 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.04 02:31:15 BoogieIcfgContainer [2022-04-08 14:31:15,201 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-08 14:31:15,202 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-08 14:31:15,203 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-08 14:31:15,221 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-08 14:31:15,222 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.04 02:31:14" (1/3) ... [2022-04-08 14:31:15,222 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1d2fbab1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.04 02:31:15, skipping insertion in model container [2022-04-08 14:31:15,222 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 02:31:14" (2/3) ... [2022-04-08 14:31:15,223 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1d2fbab1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.04 02:31:15, skipping insertion in model container [2022-04-08 14:31:15,223 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.04 02:31:15" (3/3) ... [2022-04-08 14:31:15,224 INFO L111 eAbstractionObserver]: Analyzing ICFG ps6-ll_unwindbound10.c [2022-04-08 14:31:15,228 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-04-08 14:31:15,228 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-08 14:31:15,281 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-08 14:31:15,287 INFO L340 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=Craig_NestedInterpolation, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP [2022-04-08 14:31:15,287 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-08 14:31:15,318 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-08 14:31:15,324 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-04-08 14:31:15,325 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 14:31:15,325 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 14:31:15,326 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 14:31:15,337 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 14:31:15,337 INFO L85 PathProgramCache]: Analyzing trace with hash 21872251, now seen corresponding path program 1 times [2022-04-08 14:31:15,345 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 14:31:15,346 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1913119858] [2022-04-08 14:31:15,357 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 14:31:15,357 INFO L85 PathProgramCache]: Analyzing trace with hash 21872251, now seen corresponding path program 2 times [2022-04-08 14:31:15,360 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 14:31:15,361 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1832241242] [2022-04-08 14:31:15,361 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 14:31:15,363 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 14:31:15,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 14:31:15,549 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 14:31:15,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 14:31:15,574 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-08 14:31:15,575 INFO L290 TraceCheckUtils]: 1: Hoare triple {32#true} assume true; {32#true} is VALID [2022-04-08 14:31:15,575 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {32#true} {32#true} #61#return; {32#true} is VALID [2022-04-08 14:31:15,576 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-08 14:31:15,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 14:31:15,588 INFO L290 TraceCheckUtils]: 0: Hoare triple {32#true} ~cond := #in~cond; {32#true} is VALID [2022-04-08 14:31:15,590 INFO L290 TraceCheckUtils]: 1: Hoare triple {32#true} assume 0 == ~cond;assume false; {33#false} is VALID [2022-04-08 14:31:15,590 INFO L290 TraceCheckUtils]: 2: Hoare triple {33#false} assume true; {33#false} is VALID [2022-04-08 14:31:15,590 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {33#false} {32#true} #53#return; {33#false} is VALID [2022-04-08 14:31:15,593 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-08 14:31:15,593 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-08 14:31:15,594 INFO L290 TraceCheckUtils]: 2: Hoare triple {32#true} assume true; {32#true} is VALID [2022-04-08 14:31:15,594 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {32#true} {32#true} #61#return; {32#true} is VALID [2022-04-08 14:31:15,594 INFO L272 TraceCheckUtils]: 4: Hoare triple {32#true} call #t~ret6 := main(); {32#true} is VALID [2022-04-08 14:31:15,597 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-08 14:31:15,598 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-08 14:31:15,598 INFO L290 TraceCheckUtils]: 7: Hoare triple {32#true} ~cond := #in~cond; {32#true} is VALID [2022-04-08 14:31:15,598 INFO L290 TraceCheckUtils]: 8: Hoare triple {32#true} assume 0 == ~cond;assume false; {33#false} is VALID [2022-04-08 14:31:15,599 INFO L290 TraceCheckUtils]: 9: Hoare triple {33#false} assume true; {33#false} is VALID [2022-04-08 14:31:15,599 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {33#false} {32#true} #53#return; {33#false} is VALID [2022-04-08 14:31:15,599 INFO L290 TraceCheckUtils]: 11: Hoare triple {33#false} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {33#false} is VALID [2022-04-08 14:31:15,600 INFO L290 TraceCheckUtils]: 12: Hoare triple {33#false} assume !true; {33#false} is VALID [2022-04-08 14:31:15,600 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-08 14:31:15,600 INFO L290 TraceCheckUtils]: 14: Hoare triple {33#false} ~cond := #in~cond; {33#false} is VALID [2022-04-08 14:31:15,602 INFO L290 TraceCheckUtils]: 15: Hoare triple {33#false} assume 0 == ~cond; {33#false} is VALID [2022-04-08 14:31:15,602 INFO L290 TraceCheckUtils]: 16: Hoare triple {33#false} assume !false; {33#false} is VALID [2022-04-08 14:31:15,603 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 14:31:15,603 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 14:31:15,604 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1832241242] [2022-04-08 14:31:15,604 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1832241242] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 14:31:15,604 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 14:31:15,604 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-08 14:31:15,608 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 14:31:15,609 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1913119858] [2022-04-08 14:31:15,609 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1913119858] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 14:31:15,609 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 14:31:15,609 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-08 14:31:15,610 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1155019361] [2022-04-08 14:31:15,610 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 14:31:15,616 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-08 14:31:15,617 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 14:31:15,620 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-08 14:31:15,654 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 17 edges. 17 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 14:31:15,654 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-08 14:31:15,654 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 14:31:15,676 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-08 14:31:15,677 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-08 14:31:15,680 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-08 14:32:32,952 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.28m for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-08 14:32:33,012 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:32:33,013 INFO L93 Difference]: Finished difference Result 50 states and 65 transitions. [2022-04-08 14:32:33,013 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-08 14:32:33,013 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-08 14:32:33,014 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 14:32:33,015 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-08 14:32:33,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 65 transitions. [2022-04-08 14:32:33,024 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-08 14:32:33,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 65 transitions. [2022-04-08 14:32:33,032 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 65 transitions. [2022-04-08 14:32:33,152 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-08 14:32:33,160 INFO L225 Difference]: With dead ends: 50 [2022-04-08 14:32:33,160 INFO L226 Difference]: Without dead ends: 25 [2022-04-08 14:32:33,162 INFO L912 BasicCegarLoop]: 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-08 14:32:33,164 INFO L913 BasicCegarLoop]: 30 mSDtfsCounter, 10 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 5 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 77.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, 12 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 77.1s IncrementalHoareTripleChecker+Time [2022-04-08 14:32:33,165 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [11 Valid, 34 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 12 Invalid, 1 Unknown, 0 Unchecked, 77.1s Time] [2022-04-08 14:32:33,198 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2022-04-08 14:32:33,230 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 24. [2022-04-08 14:32:33,230 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 14:32:33,231 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-08 14:32:33,231 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-08 14:32:33,232 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-08 14:32:33,238 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:32:33,239 INFO L93 Difference]: Finished difference Result 25 states and 28 transitions. [2022-04-08 14:32:33,239 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 28 transitions. [2022-04-08 14:32:33,240 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 14:32:33,240 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 14:32:33,240 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-08 14:32:33,241 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-08 14:32:33,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:32:33,245 INFO L93 Difference]: Finished difference Result 25 states and 28 transitions. [2022-04-08 14:32:33,245 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 28 transitions. [2022-04-08 14:32:33,246 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 14:32:33,246 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 14:32:33,249 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 14:32:33,249 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 14:32:33,250 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-08 14:32:33,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 27 transitions. [2022-04-08 14:32:33,254 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 27 transitions. Word has length 17 [2022-04-08 14:32:33,254 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 14:32:33,254 INFO L478 AbstractCegarLoop]: Abstraction has 24 states and 27 transitions. [2022-04-08 14:32:33,254 INFO L479 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-08 14:32:33,255 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 24 states and 27 transitions. [2022-04-08 14:32:33,296 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-08 14:32:33,296 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 27 transitions. [2022-04-08 14:32:33,297 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-04-08 14:32:33,297 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 14:32:33,297 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 14:32:33,298 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-08 14:32:33,298 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 14:32:33,299 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 14:32:33,299 INFO L85 PathProgramCache]: Analyzing trace with hash -119968982, now seen corresponding path program 1 times [2022-04-08 14:32:33,299 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 14:32:33,299 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [28250714] [2022-04-08 14:32:33,300 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 14:32:33,300 INFO L85 PathProgramCache]: Analyzing trace with hash -119968982, now seen corresponding path program 2 times [2022-04-08 14:32:33,300 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 14:32:33,300 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [338407976] [2022-04-08 14:32:33,300 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 14:32:33,301 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 14:32:33,319 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 14:32:33,320 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1319049101] [2022-04-08 14:32:33,320 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 14:32:33,320 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 14:32:33,320 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 14:32:33,322 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 14:32:33,323 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-04-08 14:32:33,379 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-04-08 14:32:33,379 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 14:32:33,396 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 5 conjunts are in the unsatisfiable core [2022-04-08 14:32:33,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 14:32:33,417 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 14:32:33,595 INFO L272 TraceCheckUtils]: 0: Hoare triple {242#true} call ULTIMATE.init(); {242#true} is VALID [2022-04-08 14:32:33,596 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-08 14:32:33,597 INFO L290 TraceCheckUtils]: 2: Hoare triple {250#(<= ~counter~0 0)} assume true; {250#(<= ~counter~0 0)} is VALID [2022-04-08 14:32:33,597 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {250#(<= ~counter~0 0)} {242#true} #61#return; {250#(<= ~counter~0 0)} is VALID [2022-04-08 14:32:33,598 INFO L272 TraceCheckUtils]: 4: Hoare triple {250#(<= ~counter~0 0)} call #t~ret6 := main(); {250#(<= ~counter~0 0)} is VALID [2022-04-08 14:32:33,598 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-08 14:32:33,599 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-08 14:32:33,600 INFO L290 TraceCheckUtils]: 7: Hoare triple {250#(<= ~counter~0 0)} ~cond := #in~cond; {250#(<= ~counter~0 0)} is VALID [2022-04-08 14:32:33,600 INFO L290 TraceCheckUtils]: 8: Hoare triple {250#(<= ~counter~0 0)} assume !(0 == ~cond); {250#(<= ~counter~0 0)} is VALID [2022-04-08 14:32:33,601 INFO L290 TraceCheckUtils]: 9: Hoare triple {250#(<= ~counter~0 0)} assume true; {250#(<= ~counter~0 0)} is VALID [2022-04-08 14:32:33,601 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {250#(<= ~counter~0 0)} {250#(<= ~counter~0 0)} #53#return; {250#(<= ~counter~0 0)} is VALID [2022-04-08 14:32:33,602 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-08 14:32:33,603 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-08 14:32:33,603 INFO L290 TraceCheckUtils]: 13: Hoare triple {284#(<= |main_#t~post5| 0)} assume !(#t~post5 < 10);havoc #t~post5; {243#false} is VALID [2022-04-08 14:32:33,604 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-08 14:32:33,604 INFO L290 TraceCheckUtils]: 15: Hoare triple {243#false} ~cond := #in~cond; {243#false} is VALID [2022-04-08 14:32:33,604 INFO L290 TraceCheckUtils]: 16: Hoare triple {243#false} assume 0 == ~cond; {243#false} is VALID [2022-04-08 14:32:33,604 INFO L290 TraceCheckUtils]: 17: Hoare triple {243#false} assume !false; {243#false} is VALID [2022-04-08 14:32:33,605 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 14:32:33,605 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-08 14:32:33,605 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 14:32:33,606 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [338407976] [2022-04-08 14:32:33,606 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 14:32:33,606 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1319049101] [2022-04-08 14:32:33,606 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1319049101] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 14:32:33,606 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 14:32:33,607 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 14:32:33,608 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 14:32:33,608 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [28250714] [2022-04-08 14:32:33,608 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [28250714] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 14:32:33,608 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 14:32:33,609 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 14:32:33,609 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2014112400] [2022-04-08 14:32:33,609 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 14:32:33,610 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-08 14:32:33,611 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 14:32:33,612 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-08 14:32:33,632 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-08 14:32:33,633 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-08 14:32:33,633 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 14:32:33,634 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-08 14:32:33,636 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-08 14:32:33,637 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-08 14:32:33,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:32:33,738 INFO L93 Difference]: Finished difference Result 34 states and 38 transitions. [2022-04-08 14:32:33,738 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-08 14:32:33,739 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-08 14:32:33,739 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 14:32:33,739 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-08 14:32:33,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 38 transitions. [2022-04-08 14:32:33,742 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-08 14:32:33,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 38 transitions. [2022-04-08 14:32:33,744 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 38 transitions. [2022-04-08 14:32:33,782 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-08 14:32:33,786 INFO L225 Difference]: With dead ends: 34 [2022-04-08 14:32:33,786 INFO L226 Difference]: Without dead ends: 26 [2022-04-08 14:32:33,786 INFO L912 BasicCegarLoop]: 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-08 14:32:33,789 INFO L913 BasicCegarLoop]: 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-08 14:32:33,794 INFO L914 BasicCegarLoop]: 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-08 14:32:33,797 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2022-04-08 14:32:33,814 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2022-04-08 14:32:33,814 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 14:32:33,814 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-08 14:32:33,815 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-08 14:32:33,815 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-08 14:32:33,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:32:33,822 INFO L93 Difference]: Finished difference Result 26 states and 29 transitions. [2022-04-08 14:32:33,822 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 29 transitions. [2022-04-08 14:32:33,823 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 14:32:33,823 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 14:32:33,823 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-08 14:32:33,824 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-08 14:32:33,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:32:33,828 INFO L93 Difference]: Finished difference Result 26 states and 29 transitions. [2022-04-08 14:32:33,829 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 29 transitions. [2022-04-08 14:32:33,830 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 14:32:33,830 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 14:32:33,830 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 14:32:33,830 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 14:32:33,832 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-08 14:32:33,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 29 transitions. [2022-04-08 14:32:33,835 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 29 transitions. Word has length 18 [2022-04-08 14:32:33,836 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 14:32:33,836 INFO L478 AbstractCegarLoop]: Abstraction has 26 states and 29 transitions. [2022-04-08 14:32:33,836 INFO L479 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-08 14:32:33,836 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 26 states and 29 transitions. [2022-04-08 14:32:33,864 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-08 14:32:33,866 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 29 transitions. [2022-04-08 14:32:33,867 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-04-08 14:32:33,870 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 14:32:33,870 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 14:32:33,898 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-04-08 14:32:34,092 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 14:32:34,092 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 14:32:34,093 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 14:32:34,093 INFO L85 PathProgramCache]: Analyzing trace with hash -118181522, now seen corresponding path program 1 times [2022-04-08 14:32:34,093 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 14:32:34,094 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1226856812] [2022-04-08 14:32:34,094 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 14:32:34,094 INFO L85 PathProgramCache]: Analyzing trace with hash -118181522, now seen corresponding path program 2 times [2022-04-08 14:32:34,094 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 14:32:34,095 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1235298011] [2022-04-08 14:32:34,095 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 14:32:34,095 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 14:32:34,120 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 14:32:34,120 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [189341105] [2022-04-08 14:32:34,120 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 14:32:34,121 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 14:32:34,121 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 14:32:34,125 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 14:32:34,126 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-04-08 14:32:34,169 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-04-08 14:32:34,170 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 14:32:34,171 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-08 14:32:34,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 14:32:34,182 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 14:32:34,320 INFO L272 TraceCheckUtils]: 0: Hoare triple {471#true} call ULTIMATE.init(); {471#true} is VALID [2022-04-08 14:32:34,321 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-08 14:32:34,321 INFO L290 TraceCheckUtils]: 2: Hoare triple {471#true} assume true; {471#true} is VALID [2022-04-08 14:32:34,321 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {471#true} {471#true} #61#return; {471#true} is VALID [2022-04-08 14:32:34,321 INFO L272 TraceCheckUtils]: 4: Hoare triple {471#true} call #t~ret6 := main(); {471#true} is VALID [2022-04-08 14:32:34,322 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-08 14:32:34,323 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-08 14:32:34,327 INFO L290 TraceCheckUtils]: 7: Hoare triple {471#true} ~cond := #in~cond; {471#true} is VALID [2022-04-08 14:32:34,327 INFO L290 TraceCheckUtils]: 8: Hoare triple {471#true} assume !(0 == ~cond); {471#true} is VALID [2022-04-08 14:32:34,327 INFO L290 TraceCheckUtils]: 9: Hoare triple {471#true} assume true; {471#true} is VALID [2022-04-08 14:32:34,328 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {471#true} {471#true} #53#return; {471#true} is VALID [2022-04-08 14:32:34,328 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-08 14:32:34,329 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-08 14:32:34,330 INFO L290 TraceCheckUtils]: 13: Hoare triple {509#(and (= main_~x~0 0) (= main_~y~0 0))} assume !!(#t~post5 < 10);havoc #t~post5; {509#(and (= main_~x~0 0) (= main_~y~0 0))} is VALID [2022-04-08 14:32:34,331 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-08 14:32:34,331 INFO L290 TraceCheckUtils]: 15: Hoare triple {519#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {523#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 14:32:34,334 INFO L290 TraceCheckUtils]: 16: Hoare triple {523#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {472#false} is VALID [2022-04-08 14:32:34,334 INFO L290 TraceCheckUtils]: 17: Hoare triple {472#false} assume !false; {472#false} is VALID [2022-04-08 14:32:34,335 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 14:32:34,335 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-08 14:32:34,335 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 14:32:34,335 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1235298011] [2022-04-08 14:32:34,335 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 14:32:34,336 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [189341105] [2022-04-08 14:32:34,336 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [189341105] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 14:32:34,336 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 14:32:34,336 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 14:32:34,336 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 14:32:34,336 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1226856812] [2022-04-08 14:32:34,337 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1226856812] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 14:32:34,337 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 14:32:34,337 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 14:32:34,337 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1386694816] [2022-04-08 14:32:34,337 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 14:32:34,337 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-08 14:32:34,338 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 14:32:34,338 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-08 14:32:34,354 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-08 14:32:34,354 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-08 14:32:34,354 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 14:32:34,355 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-08 14:32:34,355 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-08 14:32:34,355 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-08 14:32:34,589 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:32:34,589 INFO L93 Difference]: Finished difference Result 36 states and 41 transitions. [2022-04-08 14:32:34,589 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-08 14:32:34,589 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-08 14:32:34,590 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 14:32:34,590 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-08 14:32:34,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 41 transitions. [2022-04-08 14:32:34,594 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-08 14:32:34,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 41 transitions. [2022-04-08 14:32:34,596 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 41 transitions. [2022-04-08 14:32:34,637 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-08 14:32:34,640 INFO L225 Difference]: With dead ends: 36 [2022-04-08 14:32:34,640 INFO L226 Difference]: Without dead ends: 32 [2022-04-08 14:32:34,641 INFO L912 BasicCegarLoop]: 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-08 14:32:34,642 INFO L913 BasicCegarLoop]: 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-08 14:32:34,642 INFO L914 BasicCegarLoop]: 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-08 14:32:34,643 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2022-04-08 14:32:34,661 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2022-04-08 14:32:34,662 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 14:32:34,662 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-08 14:32:34,662 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-08 14:32:34,662 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-08 14:32:34,668 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:32:34,668 INFO L93 Difference]: Finished difference Result 32 states and 35 transitions. [2022-04-08 14:32:34,668 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 35 transitions. [2022-04-08 14:32:34,674 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 14:32:34,674 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 14:32:34,674 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-08 14:32:34,676 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-08 14:32:34,680 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:32:34,681 INFO L93 Difference]: Finished difference Result 32 states and 35 transitions. [2022-04-08 14:32:34,681 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 35 transitions. [2022-04-08 14:32:34,681 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 14:32:34,681 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 14:32:34,681 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 14:32:34,681 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 14:32:34,682 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-08 14:32:34,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 35 transitions. [2022-04-08 14:32:34,683 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 35 transitions. Word has length 18 [2022-04-08 14:32:34,683 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 14:32:34,684 INFO L478 AbstractCegarLoop]: Abstraction has 32 states and 35 transitions. [2022-04-08 14:32:34,684 INFO L479 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-08 14:32:34,684 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 32 states and 35 transitions. [2022-04-08 14:32:34,721 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-08 14:32:34,722 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 35 transitions. [2022-04-08 14:32:34,722 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-04-08 14:32:34,723 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 14:32:34,723 INFO L499 BasicCegarLoop]: 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-08 14:32:34,747 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-08 14:32:34,941 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2022-04-08 14:32:34,942 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 14:32:34,942 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 14:32:34,942 INFO L85 PathProgramCache]: Analyzing trace with hash -1364840471, now seen corresponding path program 1 times [2022-04-08 14:32:34,942 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 14:32:34,942 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [347482039] [2022-04-08 14:32:35,161 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 14:32:35,162 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 14:32:35,165 INFO L85 PathProgramCache]: Analyzing trace with hash -1364840471, now seen corresponding path program 2 times [2022-04-08 14:32:35,165 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 14:32:35,167 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2002443920] [2022-04-08 14:32:35,167 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 14:32:35,168 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 14:32:35,191 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 14:32:35,191 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1245829664] [2022-04-08 14:32:35,191 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 14:32:35,191 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 14:32:35,192 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 14:32:35,193 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 14:32:35,194 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-04-08 14:32:35,406 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 14:32:35,406 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 14:32:35,407 INFO L263 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-08 14:32:35,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 14:32:35,418 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 14:32:35,588 INFO L272 TraceCheckUtils]: 0: Hoare triple {731#true} call ULTIMATE.init(); {731#true} is VALID [2022-04-08 14:32:35,589 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-08 14:32:35,590 INFO L290 TraceCheckUtils]: 2: Hoare triple {739#(<= ~counter~0 0)} assume true; {739#(<= ~counter~0 0)} is VALID [2022-04-08 14:32:35,590 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {739#(<= ~counter~0 0)} {731#true} #61#return; {739#(<= ~counter~0 0)} is VALID [2022-04-08 14:32:35,591 INFO L272 TraceCheckUtils]: 4: Hoare triple {739#(<= ~counter~0 0)} call #t~ret6 := main(); {739#(<= ~counter~0 0)} is VALID [2022-04-08 14:32:35,591 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-08 14:32:35,592 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-08 14:32:35,592 INFO L290 TraceCheckUtils]: 7: Hoare triple {739#(<= ~counter~0 0)} ~cond := #in~cond; {739#(<= ~counter~0 0)} is VALID [2022-04-08 14:32:35,593 INFO L290 TraceCheckUtils]: 8: Hoare triple {739#(<= ~counter~0 0)} assume !(0 == ~cond); {739#(<= ~counter~0 0)} is VALID [2022-04-08 14:32:35,593 INFO L290 TraceCheckUtils]: 9: Hoare triple {739#(<= ~counter~0 0)} assume true; {739#(<= ~counter~0 0)} is VALID [2022-04-08 14:32:35,594 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {739#(<= ~counter~0 0)} {739#(<= ~counter~0 0)} #53#return; {739#(<= ~counter~0 0)} is VALID [2022-04-08 14:32:35,594 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-08 14:32:35,595 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-08 14:32:35,595 INFO L290 TraceCheckUtils]: 13: Hoare triple {773#(<= ~counter~0 1)} assume !!(#t~post5 < 10);havoc #t~post5; {773#(<= ~counter~0 1)} is VALID [2022-04-08 14:32:35,596 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-08 14:32:35,596 INFO L290 TraceCheckUtils]: 15: Hoare triple {773#(<= ~counter~0 1)} ~cond := #in~cond; {773#(<= ~counter~0 1)} is VALID [2022-04-08 14:32:35,596 INFO L290 TraceCheckUtils]: 16: Hoare triple {773#(<= ~counter~0 1)} assume !(0 == ~cond); {773#(<= ~counter~0 1)} is VALID [2022-04-08 14:32:35,597 INFO L290 TraceCheckUtils]: 17: Hoare triple {773#(<= ~counter~0 1)} assume true; {773#(<= ~counter~0 1)} is VALID [2022-04-08 14:32:35,597 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {773#(<= ~counter~0 1)} {773#(<= ~counter~0 1)} #55#return; {773#(<= ~counter~0 1)} is VALID [2022-04-08 14:32:35,598 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-08 14:32:35,598 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-08 14:32:35,599 INFO L290 TraceCheckUtils]: 21: Hoare triple {798#(<= |main_#t~post5| 1)} assume !(#t~post5 < 10);havoc #t~post5; {732#false} is VALID [2022-04-08 14:32:35,599 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-08 14:32:35,599 INFO L290 TraceCheckUtils]: 23: Hoare triple {732#false} ~cond := #in~cond; {732#false} is VALID [2022-04-08 14:32:35,599 INFO L290 TraceCheckUtils]: 24: Hoare triple {732#false} assume 0 == ~cond; {732#false} is VALID [2022-04-08 14:32:35,600 INFO L290 TraceCheckUtils]: 25: Hoare triple {732#false} assume !false; {732#false} is VALID [2022-04-08 14:32:35,600 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-08 14:32:35,600 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 14:32:35,775 INFO L290 TraceCheckUtils]: 25: Hoare triple {732#false} assume !false; {732#false} is VALID [2022-04-08 14:32:35,776 INFO L290 TraceCheckUtils]: 24: Hoare triple {732#false} assume 0 == ~cond; {732#false} is VALID [2022-04-08 14:32:35,776 INFO L290 TraceCheckUtils]: 23: Hoare triple {732#false} ~cond := #in~cond; {732#false} is VALID [2022-04-08 14:32:35,776 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-08 14:32:35,776 INFO L290 TraceCheckUtils]: 21: Hoare triple {826#(< |main_#t~post5| 10)} assume !(#t~post5 < 10);havoc #t~post5; {732#false} is VALID [2022-04-08 14:32:35,777 INFO L290 TraceCheckUtils]: 20: Hoare triple {830#(< ~counter~0 10)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {826#(< |main_#t~post5| 10)} is VALID [2022-04-08 14:32:35,777 INFO L290 TraceCheckUtils]: 19: Hoare triple {830#(< ~counter~0 10)} 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 10)} is VALID [2022-04-08 14:32:35,778 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {731#true} {830#(< ~counter~0 10)} #55#return; {830#(< ~counter~0 10)} is VALID [2022-04-08 14:32:35,778 INFO L290 TraceCheckUtils]: 17: Hoare triple {731#true} assume true; {731#true} is VALID [2022-04-08 14:32:35,778 INFO L290 TraceCheckUtils]: 16: Hoare triple {731#true} assume !(0 == ~cond); {731#true} is VALID [2022-04-08 14:32:35,778 INFO L290 TraceCheckUtils]: 15: Hoare triple {731#true} ~cond := #in~cond; {731#true} is VALID [2022-04-08 14:32:35,779 INFO L272 TraceCheckUtils]: 14: Hoare triple {830#(< ~counter~0 10)} 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-08 14:32:35,779 INFO L290 TraceCheckUtils]: 13: Hoare triple {830#(< ~counter~0 10)} assume !!(#t~post5 < 10);havoc #t~post5; {830#(< ~counter~0 10)} is VALID [2022-04-08 14:32:35,780 INFO L290 TraceCheckUtils]: 12: Hoare triple {855#(< ~counter~0 9)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {830#(< ~counter~0 10)} is VALID [2022-04-08 14:32:35,780 INFO L290 TraceCheckUtils]: 11: Hoare triple {855#(< ~counter~0 9)} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {855#(< ~counter~0 9)} is VALID [2022-04-08 14:32:35,781 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {731#true} {855#(< ~counter~0 9)} #53#return; {855#(< ~counter~0 9)} is VALID [2022-04-08 14:32:35,781 INFO L290 TraceCheckUtils]: 9: Hoare triple {731#true} assume true; {731#true} is VALID [2022-04-08 14:32:35,781 INFO L290 TraceCheckUtils]: 8: Hoare triple {731#true} assume !(0 == ~cond); {731#true} is VALID [2022-04-08 14:32:35,782 INFO L290 TraceCheckUtils]: 7: Hoare triple {731#true} ~cond := #in~cond; {731#true} is VALID [2022-04-08 14:32:35,782 INFO L272 TraceCheckUtils]: 6: Hoare triple {855#(< ~counter~0 9)} call assume_abort_if_not((if ~k~0 <= 256 then 1 else 0)); {731#true} is VALID [2022-04-08 14:32:35,784 INFO L290 TraceCheckUtils]: 5: Hoare triple {855#(< ~counter~0 9)} 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 9)} is VALID [2022-04-08 14:32:35,784 INFO L272 TraceCheckUtils]: 4: Hoare triple {855#(< ~counter~0 9)} call #t~ret6 := main(); {855#(< ~counter~0 9)} is VALID [2022-04-08 14:32:35,785 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {855#(< ~counter~0 9)} {731#true} #61#return; {855#(< ~counter~0 9)} is VALID [2022-04-08 14:32:35,785 INFO L290 TraceCheckUtils]: 2: Hoare triple {855#(< ~counter~0 9)} assume true; {855#(< ~counter~0 9)} is VALID [2022-04-08 14:32:35,786 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 9)} is VALID [2022-04-08 14:32:35,786 INFO L272 TraceCheckUtils]: 0: Hoare triple {731#true} call ULTIMATE.init(); {731#true} is VALID [2022-04-08 14:32:35,786 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-08 14:32:35,786 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 14:32:35,787 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2002443920] [2022-04-08 14:32:35,787 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 14:32:35,787 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1245829664] [2022-04-08 14:32:35,787 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1245829664] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 14:32:35,787 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-08 14:32:35,787 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2022-04-08 14:32:35,787 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 14:32:35,788 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [347482039] [2022-04-08 14:32:35,789 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [347482039] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 14:32:35,789 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 14:32:35,789 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 14:32:35,789 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1205418357] [2022-04-08 14:32:35,789 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 14:32:35,789 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-08 14:32:35,790 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 14:32:35,790 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-08 14:32:35,810 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-08 14:32:35,810 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-08 14:32:35,810 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 14:32:35,812 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-08 14:32:35,812 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2022-04-08 14:32:35,812 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-08 14:32:35,942 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:32:35,942 INFO L93 Difference]: Finished difference Result 42 states and 46 transitions. [2022-04-08 14:32:35,942 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-08 14:32:35,943 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-08 14:32:35,943 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 14:32:35,943 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-08 14:32:35,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 46 transitions. [2022-04-08 14:32:35,950 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-08 14:32:35,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 46 transitions. [2022-04-08 14:32:35,956 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 46 transitions. [2022-04-08 14:32:35,994 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-08 14:32:35,995 INFO L225 Difference]: With dead ends: 42 [2022-04-08 14:32:35,995 INFO L226 Difference]: Without dead ends: 34 [2022-04-08 14:32:35,996 INFO L912 BasicCegarLoop]: 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-08 14:32:35,997 INFO L913 BasicCegarLoop]: 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-08 14:32:35,997 INFO L914 BasicCegarLoop]: 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-08 14:32:35,998 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2022-04-08 14:32:36,016 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2022-04-08 14:32:36,017 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 14:32:36,017 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-08 14:32:36,017 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-08 14:32:36,017 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-08 14:32:36,019 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:32:36,019 INFO L93 Difference]: Finished difference Result 34 states and 37 transitions. [2022-04-08 14:32:36,019 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 37 transitions. [2022-04-08 14:32:36,020 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 14:32:36,020 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 14:32:36,020 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-08 14:32:36,020 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-08 14:32:36,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:32:36,022 INFO L93 Difference]: Finished difference Result 34 states and 37 transitions. [2022-04-08 14:32:36,022 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 37 transitions. [2022-04-08 14:32:36,022 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 14:32:36,022 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 14:32:36,022 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 14:32:36,023 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 14:32:36,023 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-08 14:32:36,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 37 transitions. [2022-04-08 14:32:36,024 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 37 transitions. Word has length 26 [2022-04-08 14:32:36,024 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 14:32:36,024 INFO L478 AbstractCegarLoop]: Abstraction has 34 states and 37 transitions. [2022-04-08 14:32:36,025 INFO L479 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-08 14:32:36,025 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 34 states and 37 transitions. [2022-04-08 14:32:36,058 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-08 14:32:36,059 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 37 transitions. [2022-04-08 14:32:36,059 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-04-08 14:32:36,059 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 14:32:36,059 INFO L499 BasicCegarLoop]: 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-08 14:32:36,073 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-08 14:32:36,265 WARN L460 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-08 14:32:36,265 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 14:32:36,266 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 14:32:36,266 INFO L85 PathProgramCache]: Analyzing trace with hash -1363053011, now seen corresponding path program 1 times [2022-04-08 14:32:36,266 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 14:32:36,266 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2023097461] [2022-04-08 14:32:36,422 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 14:32:36,422 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 14:32:36,422 INFO L85 PathProgramCache]: Analyzing trace with hash -1363053011, now seen corresponding path program 2 times [2022-04-08 14:32:36,422 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 14:32:36,422 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [616808443] [2022-04-08 14:32:36,422 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 14:32:36,422 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 14:32:36,435 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 14:32:36,435 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1089763860] [2022-04-08 14:32:36,435 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 14:32:36,436 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 14:32:36,436 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 14:32:36,437 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-08 14:32:36,463 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-08 14:32:36,494 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 14:32:36,495 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 14:32:36,496 INFO L263 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 11 conjunts are in the unsatisfiable core [2022-04-08 14:32:36,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 14:32:36,512 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 14:32:36,631 INFO L272 TraceCheckUtils]: 0: Hoare triple {1116#true} call ULTIMATE.init(); {1116#true} is VALID [2022-04-08 14:32:36,631 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-08 14:32:36,631 INFO L290 TraceCheckUtils]: 2: Hoare triple {1116#true} assume true; {1116#true} is VALID [2022-04-08 14:32:36,632 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1116#true} {1116#true} #61#return; {1116#true} is VALID [2022-04-08 14:32:36,632 INFO L272 TraceCheckUtils]: 4: Hoare triple {1116#true} call #t~ret6 := main(); {1116#true} is VALID [2022-04-08 14:32:36,632 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-08 14:32:36,632 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-08 14:32:36,632 INFO L290 TraceCheckUtils]: 7: Hoare triple {1116#true} ~cond := #in~cond; {1116#true} is VALID [2022-04-08 14:32:36,632 INFO L290 TraceCheckUtils]: 8: Hoare triple {1116#true} assume !(0 == ~cond); {1116#true} is VALID [2022-04-08 14:32:36,633 INFO L290 TraceCheckUtils]: 9: Hoare triple {1116#true} assume true; {1116#true} is VALID [2022-04-08 14:32:36,633 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1116#true} {1116#true} #53#return; {1116#true} is VALID [2022-04-08 14:32:36,635 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-08 14:32:36,635 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-08 14:32:36,638 INFO L290 TraceCheckUtils]: 13: Hoare triple {1154#(and (= main_~x~0 0) (= main_~y~0 0))} assume !!(#t~post5 < 10);havoc #t~post5; {1154#(and (= main_~x~0 0) (= main_~y~0 0))} is VALID [2022-04-08 14:32:36,638 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-08 14:32:36,638 INFO L290 TraceCheckUtils]: 15: Hoare triple {1116#true} ~cond := #in~cond; {1116#true} is VALID [2022-04-08 14:32:36,638 INFO L290 TraceCheckUtils]: 16: Hoare triple {1116#true} assume !(0 == ~cond); {1116#true} is VALID [2022-04-08 14:32:36,639 INFO L290 TraceCheckUtils]: 17: Hoare triple {1116#true} assume true; {1116#true} is VALID [2022-04-08 14:32:36,645 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-08 14:32:36,646 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-08 14:32:36,647 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-08 14:32:36,647 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 < 10);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-08 14:32:36,655 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-08 14:32:36,656 INFO L290 TraceCheckUtils]: 23: Hoare triple {1189#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1193#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 14:32:36,657 INFO L290 TraceCheckUtils]: 24: Hoare triple {1193#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1117#false} is VALID [2022-04-08 14:32:36,657 INFO L290 TraceCheckUtils]: 25: Hoare triple {1117#false} assume !false; {1117#false} is VALID [2022-04-08 14:32:36,657 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-08 14:32:36,657 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 14:32:36,807 INFO L290 TraceCheckUtils]: 25: Hoare triple {1117#false} assume !false; {1117#false} is VALID [2022-04-08 14:32:36,808 INFO L290 TraceCheckUtils]: 24: Hoare triple {1193#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1117#false} is VALID [2022-04-08 14:32:36,808 INFO L290 TraceCheckUtils]: 23: Hoare triple {1189#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1193#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 14:32:36,809 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-08 14:32:36,810 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 < 10);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-08 14:32:36,810 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-08 14:32:41,073 WARN 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 UNKNOWN [2022-04-08 14:32:41,074 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-08 14:32:41,075 INFO L290 TraceCheckUtils]: 17: Hoare triple {1116#true} assume true; {1116#true} is VALID [2022-04-08 14:32:41,075 INFO L290 TraceCheckUtils]: 16: Hoare triple {1116#true} assume !(0 == ~cond); {1116#true} is VALID [2022-04-08 14:32:41,075 INFO L290 TraceCheckUtils]: 15: Hoare triple {1116#true} ~cond := #in~cond; {1116#true} is VALID [2022-04-08 14:32:41,075 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-08 14:32:41,076 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 < 10);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-08 14:32:41,077 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-08 14:32:41,077 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-08 14:32:41,077 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1116#true} {1116#true} #53#return; {1116#true} is VALID [2022-04-08 14:32:41,077 INFO L290 TraceCheckUtils]: 9: Hoare triple {1116#true} assume true; {1116#true} is VALID [2022-04-08 14:32:41,078 INFO L290 TraceCheckUtils]: 8: Hoare triple {1116#true} assume !(0 == ~cond); {1116#true} is VALID [2022-04-08 14:32:41,078 INFO L290 TraceCheckUtils]: 7: Hoare triple {1116#true} ~cond := #in~cond; {1116#true} is VALID [2022-04-08 14:32:41,078 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-08 14:32:41,078 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-08 14:32:41,078 INFO L272 TraceCheckUtils]: 4: Hoare triple {1116#true} call #t~ret6 := main(); {1116#true} is VALID [2022-04-08 14:32:41,078 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1116#true} {1116#true} #61#return; {1116#true} is VALID [2022-04-08 14:32:41,078 INFO L290 TraceCheckUtils]: 2: Hoare triple {1116#true} assume true; {1116#true} is VALID [2022-04-08 14:32:41,078 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-08 14:32:41,079 INFO L272 TraceCheckUtils]: 0: Hoare triple {1116#true} call ULTIMATE.init(); {1116#true} is VALID [2022-04-08 14:32:41,079 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-08 14:32:41,079 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 14:32:41,079 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [616808443] [2022-04-08 14:32:41,079 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 14:32:41,079 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1089763860] [2022-04-08 14:32:41,080 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1089763860] provided 1 perfect and 1 imperfect interpolant sequences [2022-04-08 14:32:41,080 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-04-08 14:32:41,080 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 7 [2022-04-08 14:32:41,080 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 14:32:41,080 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2023097461] [2022-04-08 14:32:41,080 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2023097461] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 14:32:41,080 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 14:32:41,081 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 14:32:41,081 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1778531141] [2022-04-08 14:32:41,081 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 14:32:41,081 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-08 14:32:41,081 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 14:32:41,082 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-08 14:32:45,540 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 23 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-08 14:32:45,541 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-08 14:32:45,541 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 14:32:45,541 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-08 14:32:45,541 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-04-08 14:32:45,542 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-08 14:32:45,675 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:32:45,676 INFO L93 Difference]: Finished difference Result 40 states and 42 transitions. [2022-04-08 14:32:45,676 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-08 14:32:45,676 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-08 14:32:45,676 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 14:32:45,676 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-08 14:32:45,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 32 transitions. [2022-04-08 14:32:45,678 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-08 14:32:45,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 32 transitions. [2022-04-08 14:32:45,678 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 32 transitions. [2022-04-08 14:32:50,231 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 32 edges. 31 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-08 14:32:50,233 INFO L225 Difference]: With dead ends: 40 [2022-04-08 14:32:50,233 INFO L226 Difference]: Without dead ends: 36 [2022-04-08 14:32:50,233 INFO L912 BasicCegarLoop]: 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-08 14:32:50,234 INFO L913 BasicCegarLoop]: 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-08 14:32:50,234 INFO L914 BasicCegarLoop]: 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-08 14:32:50,234 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2022-04-08 14:32:50,261 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2022-04-08 14:32:50,261 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 14:32:50,261 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-08 14:32:50,261 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-08 14:32:50,262 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-08 14:32:50,263 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:32:50,263 INFO L93 Difference]: Finished difference Result 36 states and 38 transitions. [2022-04-08 14:32:50,263 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 38 transitions. [2022-04-08 14:32:50,264 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 14:32:50,264 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 14:32:50,264 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-08 14:32:50,264 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-08 14:32:50,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:32:50,266 INFO L93 Difference]: Finished difference Result 36 states and 38 transitions. [2022-04-08 14:32:50,266 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 38 transitions. [2022-04-08 14:32:50,266 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 14:32:50,266 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 14:32:50,266 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 14:32:50,266 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 14:32:50,266 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-08 14:32:50,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 38 transitions. [2022-04-08 14:32:50,268 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 38 transitions. Word has length 26 [2022-04-08 14:32:50,268 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 14:32:50,268 INFO L478 AbstractCegarLoop]: Abstraction has 36 states and 38 transitions. [2022-04-08 14:32:50,268 INFO L479 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-08 14:32:50,268 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 36 states and 38 transitions. [2022-04-08 14:32:54,821 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 38 edges. 37 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-08 14:32:54,821 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 38 transitions. [2022-04-08 14:32:54,821 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-04-08 14:32:54,822 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 14:32:54,822 INFO L499 BasicCegarLoop]: 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-08 14:32:54,839 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-08 14:32:55,022 WARN L460 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-08 14:32:55,022 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 14:32:55,023 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 14:32:55,023 INFO L85 PathProgramCache]: Analyzing trace with hash -1559147673, now seen corresponding path program 1 times [2022-04-08 14:32:55,023 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 14:32:55,023 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [948357933] [2022-04-08 14:32:55,177 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 14:32:55,177 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 14:32:55,177 INFO L85 PathProgramCache]: Analyzing trace with hash -1559147673, now seen corresponding path program 2 times [2022-04-08 14:32:55,177 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 14:32:55,177 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [155977999] [2022-04-08 14:32:55,177 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 14:32:55,177 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 14:32:55,190 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 14:32:55,191 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1959089355] [2022-04-08 14:32:55,191 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 14:32:55,191 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 14:32:55,191 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 14:32:55,192 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-08 14:32:55,222 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-08 14:32:55,259 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 14:32:55,259 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 14:32:55,260 INFO L263 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 12 conjunts are in the unsatisfiable core [2022-04-08 14:32:55,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 14:32:55,280 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 14:32:55,598 INFO L272 TraceCheckUtils]: 0: Hoare triple {1504#true} call ULTIMATE.init(); {1504#true} is VALID [2022-04-08 14:32:55,598 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-08 14:32:55,598 INFO L290 TraceCheckUtils]: 2: Hoare triple {1504#true} assume true; {1504#true} is VALID [2022-04-08 14:32:55,598 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1504#true} {1504#true} #61#return; {1504#true} is VALID [2022-04-08 14:32:55,599 INFO L272 TraceCheckUtils]: 4: Hoare triple {1504#true} call #t~ret6 := main(); {1504#true} is VALID [2022-04-08 14:32:55,599 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-08 14:32:55,599 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-08 14:32:55,599 INFO L290 TraceCheckUtils]: 7: Hoare triple {1504#true} ~cond := #in~cond; {1504#true} is VALID [2022-04-08 14:32:55,599 INFO L290 TraceCheckUtils]: 8: Hoare triple {1504#true} assume !(0 == ~cond); {1504#true} is VALID [2022-04-08 14:32:55,599 INFO L290 TraceCheckUtils]: 9: Hoare triple {1504#true} assume true; {1504#true} is VALID [2022-04-08 14:32:55,600 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1504#true} {1504#true} #53#return; {1504#true} is VALID [2022-04-08 14:32:55,601 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-08 14:32:55,601 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-08 14:32:55,602 INFO L290 TraceCheckUtils]: 13: Hoare triple {1542#(and (= main_~c~0 0) (= main_~y~0 0))} assume !!(#t~post5 < 10);havoc #t~post5; {1542#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-08 14:32:55,602 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-08 14:32:55,602 INFO L290 TraceCheckUtils]: 15: Hoare triple {1504#true} ~cond := #in~cond; {1504#true} is VALID [2022-04-08 14:32:55,602 INFO L290 TraceCheckUtils]: 16: Hoare triple {1504#true} assume !(0 == ~cond); {1504#true} is VALID [2022-04-08 14:32:55,603 INFO L290 TraceCheckUtils]: 17: Hoare triple {1504#true} assume true; {1504#true} is VALID [2022-04-08 14:32:55,604 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-08 14:32:55,604 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-08 14:32:55,605 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-08 14:32:55,605 INFO L290 TraceCheckUtils]: 21: Hoare triple {1567#(and (= (+ (- 1) main_~y~0) 0) (< 0 main_~k~0) (<= main_~c~0 1))} assume !!(#t~post5 < 10);havoc #t~post5; {1567#(and (= (+ (- 1) main_~y~0) 0) (< 0 main_~k~0) (<= main_~c~0 1))} is VALID [2022-04-08 14:32:55,605 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-08 14:32:55,605 INFO L290 TraceCheckUtils]: 23: Hoare triple {1504#true} ~cond := #in~cond; {1504#true} is VALID [2022-04-08 14:32:55,606 INFO L290 TraceCheckUtils]: 24: Hoare triple {1504#true} assume !(0 == ~cond); {1504#true} is VALID [2022-04-08 14:32:55,606 INFO L290 TraceCheckUtils]: 25: Hoare triple {1504#true} assume true; {1504#true} is VALID [2022-04-08 14:32:55,607 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-08 14:32:55,608 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-08 14:32:55,608 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-08 14:32:55,608 INFO L290 TraceCheckUtils]: 29: Hoare triple {1504#true} ~cond := #in~cond; {1504#true} is VALID [2022-04-08 14:32:55,608 INFO L290 TraceCheckUtils]: 30: Hoare triple {1504#true} assume !(0 == ~cond); {1504#true} is VALID [2022-04-08 14:32:55,608 INFO L290 TraceCheckUtils]: 31: Hoare triple {1504#true} assume true; {1504#true} is VALID [2022-04-08 14:32:55,609 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-08 14:32:55,610 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-08 14:32:55,610 INFO L290 TraceCheckUtils]: 34: Hoare triple {1611#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1615#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 14:32:55,615 INFO L290 TraceCheckUtils]: 35: Hoare triple {1615#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1505#false} is VALID [2022-04-08 14:32:55,615 INFO L290 TraceCheckUtils]: 36: Hoare triple {1505#false} assume !false; {1505#false} is VALID [2022-04-08 14:32:55,615 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-08 14:32:55,616 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 14:32:55,939 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 14:32:55,939 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [155977999] [2022-04-08 14:32:55,939 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 14:32:55,939 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1959089355] [2022-04-08 14:32:55,939 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1959089355] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 14:32:55,939 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-08 14:32:55,940 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2022-04-08 14:32:55,940 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 14:32:55,940 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [948357933] [2022-04-08 14:32:55,940 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [948357933] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 14:32:55,940 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 14:32:55,940 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-08 14:32:55,940 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1962492019] [2022-04-08 14:32:55,940 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 14:32:55,941 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-08 14:32:55,941 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 14:32:55,941 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-08 14:32:55,973 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-08 14:32:55,973 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-08 14:32:55,973 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 14:32:55,974 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-08 14:32:55,974 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2022-04-08 14:32:55,974 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-08 14:32:56,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:32:56,240 INFO L93 Difference]: Finished difference Result 44 states and 48 transitions. [2022-04-08 14:32:56,240 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-08 14:32:56,240 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-08 14:32:56,240 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 14:32:56,241 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-08 14:32:56,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 44 transitions. [2022-04-08 14:32:56,242 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-08 14:32:56,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 44 transitions. [2022-04-08 14:32:56,243 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 44 transitions. [2022-04-08 14:32:56,285 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-08 14:32:56,286 INFO L225 Difference]: With dead ends: 44 [2022-04-08 14:32:56,286 INFO L226 Difference]: Without dead ends: 38 [2022-04-08 14:32:56,286 INFO L912 BasicCegarLoop]: 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-08 14:32:56,287 INFO L913 BasicCegarLoop]: 31 mSDtfsCounter, 2 mSDsluCounter, 110 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s 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.1s IncrementalHoareTripleChecker+Time [2022-04-08 14:32:56,287 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [2 Valid, 141 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-08 14:32:56,288 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2022-04-08 14:32:56,317 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2022-04-08 14:32:56,317 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 14:32:56,317 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-08 14:32:56,317 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-08 14:32:56,318 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-08 14:32:56,322 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:32:56,322 INFO L93 Difference]: Finished difference Result 38 states and 41 transitions. [2022-04-08 14:32:56,322 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 41 transitions. [2022-04-08 14:32:56,323 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 14:32:56,323 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 14:32:56,323 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-08 14:32:56,324 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-08 14:32:56,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:32:56,326 INFO L93 Difference]: Finished difference Result 38 states and 41 transitions. [2022-04-08 14:32:56,326 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 41 transitions. [2022-04-08 14:32:56,326 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 14:32:56,326 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 14:32:56,326 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 14:32:56,326 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 14:32:56,326 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-08 14:32:56,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 41 transitions. [2022-04-08 14:32:56,329 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 41 transitions. Word has length 37 [2022-04-08 14:32:56,330 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 14:32:56,330 INFO L478 AbstractCegarLoop]: Abstraction has 38 states and 41 transitions. [2022-04-08 14:32:56,330 INFO L479 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-08 14:32:56,330 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 38 states and 41 transitions. [2022-04-08 14:33:00,832 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 41 edges. 40 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-08 14:33:00,833 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 41 transitions. [2022-04-08 14:33:00,833 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-04-08 14:33:00,833 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 14:33:00,833 INFO L499 BasicCegarLoop]: 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-08 14:33:00,855 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2022-04-08 14:33:01,034 WARN L460 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-08 14:33:01,034 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 14:33:01,034 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 14:33:01,035 INFO L85 PathProgramCache]: Analyzing trace with hash -951509150, now seen corresponding path program 1 times [2022-04-08 14:33:01,035 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 14:33:01,035 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [676055331] [2022-04-08 14:33:01,204 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 14:33:01,204 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 14:33:01,204 INFO L85 PathProgramCache]: Analyzing trace with hash -951509150, now seen corresponding path program 2 times [2022-04-08 14:33:01,204 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 14:33:01,205 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1986673119] [2022-04-08 14:33:01,205 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 14:33:01,205 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 14:33:01,216 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 14:33:01,216 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1151309036] [2022-04-08 14:33:01,216 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 14:33:01,217 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 14:33:01,217 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 14:33:01,218 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-08 14:33:01,221 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-08 14:33:01,272 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 14:33:01,272 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 14:33:01,273 INFO L263 TraceCheckSpWp]: Trace formula consists of 131 conjuncts, 9 conjunts are in the unsatisfiable core [2022-04-08 14:33:01,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 14:33:01,288 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 14:33:01,501 INFO L272 TraceCheckUtils]: 0: Hoare triple {1925#true} call ULTIMATE.init(); {1925#true} is VALID [2022-04-08 14:33:01,501 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-08 14:33:01,502 INFO L290 TraceCheckUtils]: 2: Hoare triple {1933#(<= ~counter~0 0)} assume true; {1933#(<= ~counter~0 0)} is VALID [2022-04-08 14:33:01,502 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1933#(<= ~counter~0 0)} {1925#true} #61#return; {1933#(<= ~counter~0 0)} is VALID [2022-04-08 14:33:01,503 INFO L272 TraceCheckUtils]: 4: Hoare triple {1933#(<= ~counter~0 0)} call #t~ret6 := main(); {1933#(<= ~counter~0 0)} is VALID [2022-04-08 14:33:01,503 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-08 14:33:01,503 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-08 14:33:01,504 INFO L290 TraceCheckUtils]: 7: Hoare triple {1933#(<= ~counter~0 0)} ~cond := #in~cond; {1933#(<= ~counter~0 0)} is VALID [2022-04-08 14:33:01,504 INFO L290 TraceCheckUtils]: 8: Hoare triple {1933#(<= ~counter~0 0)} assume !(0 == ~cond); {1933#(<= ~counter~0 0)} is VALID [2022-04-08 14:33:01,504 INFO L290 TraceCheckUtils]: 9: Hoare triple {1933#(<= ~counter~0 0)} assume true; {1933#(<= ~counter~0 0)} is VALID [2022-04-08 14:33:01,505 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1933#(<= ~counter~0 0)} {1933#(<= ~counter~0 0)} #53#return; {1933#(<= ~counter~0 0)} is VALID [2022-04-08 14:33:01,505 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-08 14:33:01,505 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-08 14:33:01,506 INFO L290 TraceCheckUtils]: 13: Hoare triple {1967#(<= ~counter~0 1)} assume !!(#t~post5 < 10);havoc #t~post5; {1967#(<= ~counter~0 1)} is VALID [2022-04-08 14:33:01,506 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-08 14:33:01,507 INFO L290 TraceCheckUtils]: 15: Hoare triple {1967#(<= ~counter~0 1)} ~cond := #in~cond; {1967#(<= ~counter~0 1)} is VALID [2022-04-08 14:33:01,507 INFO L290 TraceCheckUtils]: 16: Hoare triple {1967#(<= ~counter~0 1)} assume !(0 == ~cond); {1967#(<= ~counter~0 1)} is VALID [2022-04-08 14:33:01,507 INFO L290 TraceCheckUtils]: 17: Hoare triple {1967#(<= ~counter~0 1)} assume true; {1967#(<= ~counter~0 1)} is VALID [2022-04-08 14:33:01,508 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {1967#(<= ~counter~0 1)} {1967#(<= ~counter~0 1)} #55#return; {1967#(<= ~counter~0 1)} is VALID [2022-04-08 14:33:01,508 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-08 14:33:01,508 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-08 14:33:01,509 INFO L290 TraceCheckUtils]: 21: Hoare triple {1992#(<= ~counter~0 2)} assume !!(#t~post5 < 10);havoc #t~post5; {1992#(<= ~counter~0 2)} is VALID [2022-04-08 14:33:01,511 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-08 14:33:01,511 INFO L290 TraceCheckUtils]: 23: Hoare triple {1992#(<= ~counter~0 2)} ~cond := #in~cond; {1992#(<= ~counter~0 2)} is VALID [2022-04-08 14:33:01,512 INFO L290 TraceCheckUtils]: 24: Hoare triple {1992#(<= ~counter~0 2)} assume !(0 == ~cond); {1992#(<= ~counter~0 2)} is VALID [2022-04-08 14:33:01,512 INFO L290 TraceCheckUtils]: 25: Hoare triple {1992#(<= ~counter~0 2)} assume true; {1992#(<= ~counter~0 2)} is VALID [2022-04-08 14:33:01,512 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {1992#(<= ~counter~0 2)} {1992#(<= ~counter~0 2)} #55#return; {1992#(<= ~counter~0 2)} is VALID [2022-04-08 14:33:01,513 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-08 14:33:01,513 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-08 14:33:01,514 INFO L290 TraceCheckUtils]: 29: Hoare triple {2017#(<= |main_#t~post5| 2)} assume !(#t~post5 < 10);havoc #t~post5; {1926#false} is VALID [2022-04-08 14:33:01,514 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-08 14:33:01,514 INFO L290 TraceCheckUtils]: 31: Hoare triple {1926#false} ~cond := #in~cond; {1926#false} is VALID [2022-04-08 14:33:01,514 INFO L290 TraceCheckUtils]: 32: Hoare triple {1926#false} assume !(0 == ~cond); {1926#false} is VALID [2022-04-08 14:33:01,514 INFO L290 TraceCheckUtils]: 33: Hoare triple {1926#false} assume true; {1926#false} is VALID [2022-04-08 14:33:01,514 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {1926#false} {1926#false} #57#return; {1926#false} is VALID [2022-04-08 14:33:01,514 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-08 14:33:01,514 INFO L290 TraceCheckUtils]: 36: Hoare triple {1926#false} ~cond := #in~cond; {1926#false} is VALID [2022-04-08 14:33:01,514 INFO L290 TraceCheckUtils]: 37: Hoare triple {1926#false} assume 0 == ~cond; {1926#false} is VALID [2022-04-08 14:33:01,515 INFO L290 TraceCheckUtils]: 38: Hoare triple {1926#false} assume !false; {1926#false} is VALID [2022-04-08 14:33:01,515 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-08 14:33:01,515 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 14:33:01,753 INFO L290 TraceCheckUtils]: 38: Hoare triple {1926#false} assume !false; {1926#false} is VALID [2022-04-08 14:33:01,754 INFO L290 TraceCheckUtils]: 37: Hoare triple {1926#false} assume 0 == ~cond; {1926#false} is VALID [2022-04-08 14:33:01,754 INFO L290 TraceCheckUtils]: 36: Hoare triple {1926#false} ~cond := #in~cond; {1926#false} is VALID [2022-04-08 14:33:01,754 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-08 14:33:01,754 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {1925#true} {1926#false} #57#return; {1926#false} is VALID [2022-04-08 14:33:01,754 INFO L290 TraceCheckUtils]: 33: Hoare triple {1925#true} assume true; {1925#true} is VALID [2022-04-08 14:33:01,754 INFO L290 TraceCheckUtils]: 32: Hoare triple {1925#true} assume !(0 == ~cond); {1925#true} is VALID [2022-04-08 14:33:01,754 INFO L290 TraceCheckUtils]: 31: Hoare triple {1925#true} ~cond := #in~cond; {1925#true} is VALID [2022-04-08 14:33:01,754 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-08 14:33:01,755 INFO L290 TraceCheckUtils]: 29: Hoare triple {2075#(< |main_#t~post5| 10)} assume !(#t~post5 < 10);havoc #t~post5; {1926#false} is VALID [2022-04-08 14:33:01,756 INFO L290 TraceCheckUtils]: 28: Hoare triple {2079#(< ~counter~0 10)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {2075#(< |main_#t~post5| 10)} is VALID [2022-04-08 14:33:01,758 INFO L290 TraceCheckUtils]: 27: Hoare triple {2079#(< ~counter~0 10)} 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 10)} is VALID [2022-04-08 14:33:01,758 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {1925#true} {2079#(< ~counter~0 10)} #55#return; {2079#(< ~counter~0 10)} is VALID [2022-04-08 14:33:01,758 INFO L290 TraceCheckUtils]: 25: Hoare triple {1925#true} assume true; {1925#true} is VALID [2022-04-08 14:33:01,758 INFO L290 TraceCheckUtils]: 24: Hoare triple {1925#true} assume !(0 == ~cond); {1925#true} is VALID [2022-04-08 14:33:01,759 INFO L290 TraceCheckUtils]: 23: Hoare triple {1925#true} ~cond := #in~cond; {1925#true} is VALID [2022-04-08 14:33:01,759 INFO L272 TraceCheckUtils]: 22: Hoare triple {2079#(< ~counter~0 10)} 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-08 14:33:01,760 INFO L290 TraceCheckUtils]: 21: Hoare triple {2079#(< ~counter~0 10)} assume !!(#t~post5 < 10);havoc #t~post5; {2079#(< ~counter~0 10)} is VALID [2022-04-08 14:33:01,761 INFO L290 TraceCheckUtils]: 20: Hoare triple {2104#(< ~counter~0 9)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {2079#(< ~counter~0 10)} is VALID [2022-04-08 14:33:01,761 INFO L290 TraceCheckUtils]: 19: Hoare triple {2104#(< ~counter~0 9)} 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 9)} is VALID [2022-04-08 14:33:01,762 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {1925#true} {2104#(< ~counter~0 9)} #55#return; {2104#(< ~counter~0 9)} is VALID [2022-04-08 14:33:01,762 INFO L290 TraceCheckUtils]: 17: Hoare triple {1925#true} assume true; {1925#true} is VALID [2022-04-08 14:33:01,762 INFO L290 TraceCheckUtils]: 16: Hoare triple {1925#true} assume !(0 == ~cond); {1925#true} is VALID [2022-04-08 14:33:01,762 INFO L290 TraceCheckUtils]: 15: Hoare triple {1925#true} ~cond := #in~cond; {1925#true} is VALID [2022-04-08 14:33:01,762 INFO L272 TraceCheckUtils]: 14: Hoare triple {2104#(< ~counter~0 9)} 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-08 14:33:01,762 INFO L290 TraceCheckUtils]: 13: Hoare triple {2104#(< ~counter~0 9)} assume !!(#t~post5 < 10);havoc #t~post5; {2104#(< ~counter~0 9)} is VALID [2022-04-08 14:33:01,763 INFO L290 TraceCheckUtils]: 12: Hoare triple {2129#(< ~counter~0 8)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {2104#(< ~counter~0 9)} is VALID [2022-04-08 14:33:01,763 INFO L290 TraceCheckUtils]: 11: Hoare triple {2129#(< ~counter~0 8)} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {2129#(< ~counter~0 8)} is VALID [2022-04-08 14:33:01,764 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1925#true} {2129#(< ~counter~0 8)} #53#return; {2129#(< ~counter~0 8)} is VALID [2022-04-08 14:33:01,764 INFO L290 TraceCheckUtils]: 9: Hoare triple {1925#true} assume true; {1925#true} is VALID [2022-04-08 14:33:01,764 INFO L290 TraceCheckUtils]: 8: Hoare triple {1925#true} assume !(0 == ~cond); {1925#true} is VALID [2022-04-08 14:33:01,764 INFO L290 TraceCheckUtils]: 7: Hoare triple {1925#true} ~cond := #in~cond; {1925#true} is VALID [2022-04-08 14:33:01,764 INFO L272 TraceCheckUtils]: 6: Hoare triple {2129#(< ~counter~0 8)} call assume_abort_if_not((if ~k~0 <= 256 then 1 else 0)); {1925#true} is VALID [2022-04-08 14:33:01,764 INFO L290 TraceCheckUtils]: 5: Hoare triple {2129#(< ~counter~0 8)} 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; {2129#(< ~counter~0 8)} is VALID [2022-04-08 14:33:01,765 INFO L272 TraceCheckUtils]: 4: Hoare triple {2129#(< ~counter~0 8)} call #t~ret6 := main(); {2129#(< ~counter~0 8)} is VALID [2022-04-08 14:33:01,765 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2129#(< ~counter~0 8)} {1925#true} #61#return; {2129#(< ~counter~0 8)} is VALID [2022-04-08 14:33:01,765 INFO L290 TraceCheckUtils]: 2: Hoare triple {2129#(< ~counter~0 8)} assume true; {2129#(< ~counter~0 8)} is VALID [2022-04-08 14:33:01,766 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; {2129#(< ~counter~0 8)} is VALID [2022-04-08 14:33:01,766 INFO L272 TraceCheckUtils]: 0: Hoare triple {1925#true} call ULTIMATE.init(); {1925#true} is VALID [2022-04-08 14:33:01,766 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-08 14:33:01,766 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 14:33:01,766 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1986673119] [2022-04-08 14:33:01,766 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 14:33:01,766 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1151309036] [2022-04-08 14:33:01,767 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1151309036] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 14:33:01,767 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-08 14:33:01,767 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2022-04-08 14:33:01,767 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 14:33:01,767 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [676055331] [2022-04-08 14:33:01,767 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [676055331] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 14:33:01,767 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 14:33:01,767 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-08 14:33:01,767 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1451796024] [2022-04-08 14:33:01,768 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 14:33:01,768 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-08 14:33:01,768 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 14:33:01,768 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-08 14:33:01,794 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-08 14:33:01,794 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-08 14:33:01,794 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 14:33:01,795 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-08 14:33:01,795 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-04-08 14:33:01,795 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-08 14:33:01,964 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:33:01,964 INFO L93 Difference]: Finished difference Result 54 states and 56 transitions. [2022-04-08 14:33:01,965 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-08 14:33:01,965 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-08 14:33:01,965 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 14:33:01,965 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-08 14:33:01,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 54 transitions. [2022-04-08 14:33:01,968 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-08 14:33:01,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 54 transitions. [2022-04-08 14:33:01,971 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 54 transitions. [2022-04-08 14:33:02,021 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-08 14:33:02,022 INFO L225 Difference]: With dead ends: 54 [2022-04-08 14:33:02,022 INFO L226 Difference]: Without dead ends: 44 [2022-04-08 14:33:02,022 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 69 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=81, Unknown=0, NotChecked=0, Total=132 [2022-04-08 14:33:02,023 INFO L913 BasicCegarLoop]: 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-08 14:33:02,023 INFO L914 BasicCegarLoop]: 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-08 14:33:02,023 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2022-04-08 14:33:02,073 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2022-04-08 14:33:02,073 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 14:33:02,073 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-08 14:33:02,074 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-08 14:33:02,074 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-08 14:33:02,076 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:33:02,077 INFO L93 Difference]: Finished difference Result 44 states and 46 transitions. [2022-04-08 14:33:02,077 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 46 transitions. [2022-04-08 14:33:02,077 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 14:33:02,077 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 14:33:02,077 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-08 14:33:02,077 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-08 14:33:02,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:33:02,079 INFO L93 Difference]: Finished difference Result 44 states and 46 transitions. [2022-04-08 14:33:02,079 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 46 transitions. [2022-04-08 14:33:02,079 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 14:33:02,080 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 14:33:02,080 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 14:33:02,080 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 14:33:02,080 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-08 14:33:02,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 46 transitions. [2022-04-08 14:33:02,081 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 46 transitions. Word has length 39 [2022-04-08 14:33:02,082 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 14:33:02,082 INFO L478 AbstractCegarLoop]: Abstraction has 44 states and 46 transitions. [2022-04-08 14:33:02,082 INFO L479 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-08 14:33:02,082 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 44 states and 46 transitions. [2022-04-08 14:33:06,384 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 46 edges. 45 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-08 14:33:06,384 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 46 transitions. [2022-04-08 14:33:06,385 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-04-08 14:33:06,385 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 14:33:06,385 INFO L499 BasicCegarLoop]: 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-08 14:33:06,404 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-08 14:33:06,585 WARN L460 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-08 14:33:06,586 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 14:33:06,586 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 14:33:06,586 INFO L85 PathProgramCache]: Analyzing trace with hash 1537538120, now seen corresponding path program 3 times [2022-04-08 14:33:06,586 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 14:33:06,586 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1107901208] [2022-04-08 14:33:06,786 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 14:33:06,786 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 14:33:06,786 INFO L85 PathProgramCache]: Analyzing trace with hash 1537538120, now seen corresponding path program 4 times [2022-04-08 14:33:06,786 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 14:33:06,786 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [347405430] [2022-04-08 14:33:06,786 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 14:33:06,787 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 14:33:06,811 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 14:33:06,812 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [282826289] [2022-04-08 14:33:06,812 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-08 14:33:06,812 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 14:33:06,812 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 14:33:06,827 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-08 14:33:06,828 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-08 14:33:06,907 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-08 14:33:06,907 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 14:33:06,908 INFO L263 TraceCheckSpWp]: Trace formula consists of 92 conjuncts, 16 conjunts are in the unsatisfiable core [2022-04-08 14:33:06,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 14:33:06,932 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 14:33:07,375 INFO L272 TraceCheckUtils]: 0: Hoare triple {2456#true} call ULTIMATE.init(); {2456#true} is VALID [2022-04-08 14:33:07,376 INFO L290 TraceCheckUtils]: 1: Hoare triple {2456#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; {2456#true} is VALID [2022-04-08 14:33:07,376 INFO L290 TraceCheckUtils]: 2: Hoare triple {2456#true} assume true; {2456#true} is VALID [2022-04-08 14:33:07,376 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2456#true} {2456#true} #61#return; {2456#true} is VALID [2022-04-08 14:33:07,376 INFO L272 TraceCheckUtils]: 4: Hoare triple {2456#true} call #t~ret6 := main(); {2456#true} is VALID [2022-04-08 14:33:07,376 INFO L290 TraceCheckUtils]: 5: Hoare triple {2456#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; {2456#true} is VALID [2022-04-08 14:33:07,376 INFO L272 TraceCheckUtils]: 6: Hoare triple {2456#true} call assume_abort_if_not((if ~k~0 <= 256 then 1 else 0)); {2456#true} is VALID [2022-04-08 14:33:07,377 INFO L290 TraceCheckUtils]: 7: Hoare triple {2456#true} ~cond := #in~cond; {2456#true} is VALID [2022-04-08 14:33:07,377 INFO L290 TraceCheckUtils]: 8: Hoare triple {2456#true} assume !(0 == ~cond); {2456#true} is VALID [2022-04-08 14:33:07,377 INFO L290 TraceCheckUtils]: 9: Hoare triple {2456#true} assume true; {2456#true} is VALID [2022-04-08 14:33:07,377 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {2456#true} {2456#true} #53#return; {2456#true} is VALID [2022-04-08 14:33:07,377 INFO L290 TraceCheckUtils]: 11: Hoare triple {2456#true} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {2494#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-08 14:33:07,378 INFO L290 TraceCheckUtils]: 12: Hoare triple {2494#(and (= main_~c~0 0) (= main_~y~0 0))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {2494#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-08 14:33:07,378 INFO L290 TraceCheckUtils]: 13: Hoare triple {2494#(and (= main_~c~0 0) (= main_~y~0 0))} assume !!(#t~post5 < 10);havoc #t~post5; {2494#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-08 14:33:07,378 INFO L272 TraceCheckUtils]: 14: Hoare triple {2494#(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)); {2456#true} is VALID [2022-04-08 14:33:07,379 INFO L290 TraceCheckUtils]: 15: Hoare triple {2456#true} ~cond := #in~cond; {2456#true} is VALID [2022-04-08 14:33:07,379 INFO L290 TraceCheckUtils]: 16: Hoare triple {2456#true} assume !(0 == ~cond); {2456#true} is VALID [2022-04-08 14:33:07,379 INFO L290 TraceCheckUtils]: 17: Hoare triple {2456#true} assume true; {2456#true} is VALID [2022-04-08 14:33:07,379 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {2456#true} {2494#(and (= main_~c~0 0) (= main_~y~0 0))} #55#return; {2494#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-08 14:33:07,380 INFO L290 TraceCheckUtils]: 19: Hoare triple {2494#(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; {2519#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} is VALID [2022-04-08 14:33:07,381 INFO L290 TraceCheckUtils]: 20: Hoare triple {2519#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {2519#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} is VALID [2022-04-08 14:33:07,381 INFO L290 TraceCheckUtils]: 21: Hoare triple {2519#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} assume !!(#t~post5 < 10);havoc #t~post5; {2519#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} is VALID [2022-04-08 14:33:07,381 INFO L272 TraceCheckUtils]: 22: Hoare triple {2519#(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)); {2456#true} is VALID [2022-04-08 14:33:07,381 INFO L290 TraceCheckUtils]: 23: Hoare triple {2456#true} ~cond := #in~cond; {2456#true} is VALID [2022-04-08 14:33:07,381 INFO L290 TraceCheckUtils]: 24: Hoare triple {2456#true} assume !(0 == ~cond); {2456#true} is VALID [2022-04-08 14:33:07,381 INFO L290 TraceCheckUtils]: 25: Hoare triple {2456#true} assume true; {2456#true} is VALID [2022-04-08 14:33:07,383 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {2456#true} {2519#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} #55#return; {2519#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} is VALID [2022-04-08 14:33:07,383 INFO L290 TraceCheckUtils]: 27: Hoare triple {2519#(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; {2544#(and (= main_~y~0 2) (< 1 main_~k~0) (<= main_~c~0 2))} is VALID [2022-04-08 14:33:07,384 INFO L290 TraceCheckUtils]: 28: Hoare triple {2544#(and (= main_~y~0 2) (< 1 main_~k~0) (<= main_~c~0 2))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {2544#(and (= main_~y~0 2) (< 1 main_~k~0) (<= main_~c~0 2))} is VALID [2022-04-08 14:33:07,384 INFO L290 TraceCheckUtils]: 29: Hoare triple {2544#(and (= main_~y~0 2) (< 1 main_~k~0) (<= main_~c~0 2))} assume !!(#t~post5 < 10);havoc #t~post5; {2544#(and (= main_~y~0 2) (< 1 main_~k~0) (<= main_~c~0 2))} is VALID [2022-04-08 14:33:07,384 INFO L272 TraceCheckUtils]: 30: Hoare triple {2544#(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)); {2456#true} is VALID [2022-04-08 14:33:07,385 INFO L290 TraceCheckUtils]: 31: Hoare triple {2456#true} ~cond := #in~cond; {2456#true} is VALID [2022-04-08 14:33:07,385 INFO L290 TraceCheckUtils]: 32: Hoare triple {2456#true} assume !(0 == ~cond); {2456#true} is VALID [2022-04-08 14:33:07,385 INFO L290 TraceCheckUtils]: 33: Hoare triple {2456#true} assume true; {2456#true} is VALID [2022-04-08 14:33:07,385 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {2456#true} {2544#(and (= main_~y~0 2) (< 1 main_~k~0) (<= main_~c~0 2))} #55#return; {2544#(and (= main_~y~0 2) (< 1 main_~k~0) (<= main_~c~0 2))} is VALID [2022-04-08 14:33:07,386 INFO L290 TraceCheckUtils]: 35: Hoare triple {2544#(and (= main_~y~0 2) (< 1 main_~k~0) (<= main_~c~0 2))} assume !(~c~0 < ~k~0); {2569#(and (= main_~y~0 2) (< 1 main_~k~0) (<= main_~k~0 2))} is VALID [2022-04-08 14:33:07,386 INFO L272 TraceCheckUtils]: 36: Hoare triple {2569#(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)); {2456#true} is VALID [2022-04-08 14:33:07,386 INFO L290 TraceCheckUtils]: 37: Hoare triple {2456#true} ~cond := #in~cond; {2456#true} is VALID [2022-04-08 14:33:07,386 INFO L290 TraceCheckUtils]: 38: Hoare triple {2456#true} assume !(0 == ~cond); {2456#true} is VALID [2022-04-08 14:33:07,386 INFO L290 TraceCheckUtils]: 39: Hoare triple {2456#true} assume true; {2456#true} is VALID [2022-04-08 14:33:07,387 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {2456#true} {2569#(and (= main_~y~0 2) (< 1 main_~k~0) (<= main_~k~0 2))} #57#return; {2569#(and (= main_~y~0 2) (< 1 main_~k~0) (<= main_~k~0 2))} is VALID [2022-04-08 14:33:07,387 INFO L272 TraceCheckUtils]: 41: Hoare triple {2569#(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)); {2588#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 14:33:07,388 INFO L290 TraceCheckUtils]: 42: Hoare triple {2588#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {2592#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 14:33:07,388 INFO L290 TraceCheckUtils]: 43: Hoare triple {2592#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {2457#false} is VALID [2022-04-08 14:33:07,388 INFO L290 TraceCheckUtils]: 44: Hoare triple {2457#false} assume !false; {2457#false} is VALID [2022-04-08 14:33:07,388 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-08 14:33:07,388 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 14:33:07,689 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 14:33:07,689 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [347405430] [2022-04-08 14:33:07,689 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 14:33:07,689 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [282826289] [2022-04-08 14:33:07,689 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [282826289] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 14:33:07,689 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-08 14:33:07,689 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2022-04-08 14:33:07,689 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 14:33:07,690 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1107901208] [2022-04-08 14:33:07,690 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1107901208] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 14:33:07,690 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 14:33:07,690 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-08 14:33:07,690 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1995253674] [2022-04-08 14:33:07,690 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 14:33:07,690 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-08 14:33:07,691 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 14:33:07,691 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-08 14:33:07,724 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-08 14:33:07,725 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-08 14:33:07,725 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 14:33:07,726 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-08 14:33:07,726 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2022-04-08 14:33:07,726 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-08 14:33:08,060 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:33:08,060 INFO L93 Difference]: Finished difference Result 52 states and 56 transitions. [2022-04-08 14:33:08,061 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-08 14:33:08,061 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-08 14:33:08,061 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 14:33:08,061 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-08 14:33:08,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 49 transitions. [2022-04-08 14:33:08,063 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-08 14:33:08,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 49 transitions. [2022-04-08 14:33:08,064 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 49 transitions. [2022-04-08 14:33:08,110 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-08 14:33:08,111 INFO L225 Difference]: With dead ends: 52 [2022-04-08 14:33:08,112 INFO L226 Difference]: Without dead ends: 46 [2022-04-08 14:33:08,112 INFO L912 BasicCegarLoop]: 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-08 14:33:08,112 INFO L913 BasicCegarLoop]: 36 mSDtfsCounter, 2 mSDsluCounter, 145 mSDsCounter, 0 mSdLazyCounter, 89 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 181 SdHoareTripleChecker+Invalid, 90 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 89 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-08 14:33:08,113 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [2 Valid, 181 Invalid, 90 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 89 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-08 14:33:08,113 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2022-04-08 14:33:08,163 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2022-04-08 14:33:08,163 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 14:33:08,163 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-08 14:33:08,163 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-08 14:33:08,166 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-08 14:33:08,167 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:33:08,167 INFO L93 Difference]: Finished difference Result 46 states and 49 transitions. [2022-04-08 14:33:08,167 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 49 transitions. [2022-04-08 14:33:08,168 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 14:33:08,168 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 14:33:08,168 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-08 14:33:08,168 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-08 14:33:08,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:33:08,170 INFO L93 Difference]: Finished difference Result 46 states and 49 transitions. [2022-04-08 14:33:08,170 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 49 transitions. [2022-04-08 14:33:08,170 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 14:33:08,170 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 14:33:08,170 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 14:33:08,170 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 14:33:08,177 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-08 14:33:08,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 49 transitions. [2022-04-08 14:33:08,179 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 49 transitions. Word has length 45 [2022-04-08 14:33:08,179 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 14:33:08,180 INFO L478 AbstractCegarLoop]: Abstraction has 46 states and 49 transitions. [2022-04-08 14:33:08,180 INFO L479 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-08 14:33:08,181 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 46 states and 49 transitions. [2022-04-08 14:33:12,639 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 49 edges. 48 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-08 14:33:12,640 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 49 transitions. [2022-04-08 14:33:12,640 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2022-04-08 14:33:12,640 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 14:33:12,640 INFO L499 BasicCegarLoop]: 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-08 14:33:12,657 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-04-08 14:33:12,843 WARN L460 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-08 14:33:12,843 INFO L403 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 14:33:12,844 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 14:33:12,844 INFO L85 PathProgramCache]: Analyzing trace with hash -1448798205, now seen corresponding path program 3 times [2022-04-08 14:33:12,844 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 14:33:12,844 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [980656225] [2022-04-08 14:33:12,970 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 14:33:12,970 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 14:33:12,970 INFO L85 PathProgramCache]: Analyzing trace with hash -1448798205, now seen corresponding path program 4 times [2022-04-08 14:33:12,970 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 14:33:12,970 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [396497419] [2022-04-08 14:33:12,970 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 14:33:12,971 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 14:33:12,981 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 14:33:12,981 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [824284521] [2022-04-08 14:33:12,981 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-08 14:33:12,982 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 14:33:12,982 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 14:33:12,995 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-08 14:33:13,020 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-08 14:33:13,051 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-08 14:33:13,051 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 14:33:13,052 INFO L263 TraceCheckSpWp]: Trace formula consists of 152 conjuncts, 11 conjunts are in the unsatisfiable core [2022-04-08 14:33:13,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 14:33:13,071 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 14:33:13,301 INFO L272 TraceCheckUtils]: 0: Hoare triple {2950#true} call ULTIMATE.init(); {2950#true} is VALID [2022-04-08 14:33:13,302 INFO L290 TraceCheckUtils]: 1: Hoare triple {2950#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; {2958#(<= ~counter~0 0)} is VALID [2022-04-08 14:33:13,302 INFO L290 TraceCheckUtils]: 2: Hoare triple {2958#(<= ~counter~0 0)} assume true; {2958#(<= ~counter~0 0)} is VALID [2022-04-08 14:33:13,302 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2958#(<= ~counter~0 0)} {2950#true} #61#return; {2958#(<= ~counter~0 0)} is VALID [2022-04-08 14:33:13,303 INFO L272 TraceCheckUtils]: 4: Hoare triple {2958#(<= ~counter~0 0)} call #t~ret6 := main(); {2958#(<= ~counter~0 0)} is VALID [2022-04-08 14:33:13,303 INFO L290 TraceCheckUtils]: 5: Hoare triple {2958#(<= ~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; {2958#(<= ~counter~0 0)} is VALID [2022-04-08 14:33:13,304 INFO L272 TraceCheckUtils]: 6: Hoare triple {2958#(<= ~counter~0 0)} call assume_abort_if_not((if ~k~0 <= 256 then 1 else 0)); {2958#(<= ~counter~0 0)} is VALID [2022-04-08 14:33:13,304 INFO L290 TraceCheckUtils]: 7: Hoare triple {2958#(<= ~counter~0 0)} ~cond := #in~cond; {2958#(<= ~counter~0 0)} is VALID [2022-04-08 14:33:13,305 INFO L290 TraceCheckUtils]: 8: Hoare triple {2958#(<= ~counter~0 0)} assume !(0 == ~cond); {2958#(<= ~counter~0 0)} is VALID [2022-04-08 14:33:13,305 INFO L290 TraceCheckUtils]: 9: Hoare triple {2958#(<= ~counter~0 0)} assume true; {2958#(<= ~counter~0 0)} is VALID [2022-04-08 14:33:13,305 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {2958#(<= ~counter~0 0)} {2958#(<= ~counter~0 0)} #53#return; {2958#(<= ~counter~0 0)} is VALID [2022-04-08 14:33:13,306 INFO L290 TraceCheckUtils]: 11: Hoare triple {2958#(<= ~counter~0 0)} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {2958#(<= ~counter~0 0)} is VALID [2022-04-08 14:33:13,306 INFO L290 TraceCheckUtils]: 12: Hoare triple {2958#(<= ~counter~0 0)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {2992#(<= ~counter~0 1)} is VALID [2022-04-08 14:33:13,307 INFO L290 TraceCheckUtils]: 13: Hoare triple {2992#(<= ~counter~0 1)} assume !!(#t~post5 < 10);havoc #t~post5; {2992#(<= ~counter~0 1)} is VALID [2022-04-08 14:33:13,308 INFO L272 TraceCheckUtils]: 14: Hoare triple {2992#(<= ~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)); {2992#(<= ~counter~0 1)} is VALID [2022-04-08 14:33:13,308 INFO L290 TraceCheckUtils]: 15: Hoare triple {2992#(<= ~counter~0 1)} ~cond := #in~cond; {2992#(<= ~counter~0 1)} is VALID [2022-04-08 14:33:13,308 INFO L290 TraceCheckUtils]: 16: Hoare triple {2992#(<= ~counter~0 1)} assume !(0 == ~cond); {2992#(<= ~counter~0 1)} is VALID [2022-04-08 14:33:13,309 INFO L290 TraceCheckUtils]: 17: Hoare triple {2992#(<= ~counter~0 1)} assume true; {2992#(<= ~counter~0 1)} is VALID [2022-04-08 14:33:13,309 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {2992#(<= ~counter~0 1)} {2992#(<= ~counter~0 1)} #55#return; {2992#(<= ~counter~0 1)} is VALID [2022-04-08 14:33:13,310 INFO L290 TraceCheckUtils]: 19: Hoare triple {2992#(<= ~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; {2992#(<= ~counter~0 1)} is VALID [2022-04-08 14:33:13,310 INFO L290 TraceCheckUtils]: 20: Hoare triple {2992#(<= ~counter~0 1)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {3017#(<= ~counter~0 2)} is VALID [2022-04-08 14:33:13,311 INFO L290 TraceCheckUtils]: 21: Hoare triple {3017#(<= ~counter~0 2)} assume !!(#t~post5 < 10);havoc #t~post5; {3017#(<= ~counter~0 2)} is VALID [2022-04-08 14:33:13,311 INFO L272 TraceCheckUtils]: 22: Hoare triple {3017#(<= ~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)); {3017#(<= ~counter~0 2)} is VALID [2022-04-08 14:33:13,312 INFO L290 TraceCheckUtils]: 23: Hoare triple {3017#(<= ~counter~0 2)} ~cond := #in~cond; {3017#(<= ~counter~0 2)} is VALID [2022-04-08 14:33:13,312 INFO L290 TraceCheckUtils]: 24: Hoare triple {3017#(<= ~counter~0 2)} assume !(0 == ~cond); {3017#(<= ~counter~0 2)} is VALID [2022-04-08 14:33:13,312 INFO L290 TraceCheckUtils]: 25: Hoare triple {3017#(<= ~counter~0 2)} assume true; {3017#(<= ~counter~0 2)} is VALID [2022-04-08 14:33:13,313 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {3017#(<= ~counter~0 2)} {3017#(<= ~counter~0 2)} #55#return; {3017#(<= ~counter~0 2)} is VALID [2022-04-08 14:33:13,313 INFO L290 TraceCheckUtils]: 27: Hoare triple {3017#(<= ~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; {3017#(<= ~counter~0 2)} is VALID [2022-04-08 14:33:13,314 INFO L290 TraceCheckUtils]: 28: Hoare triple {3017#(<= ~counter~0 2)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {3042#(<= ~counter~0 3)} is VALID [2022-04-08 14:33:13,314 INFO L290 TraceCheckUtils]: 29: Hoare triple {3042#(<= ~counter~0 3)} assume !!(#t~post5 < 10);havoc #t~post5; {3042#(<= ~counter~0 3)} is VALID [2022-04-08 14:33:13,315 INFO L272 TraceCheckUtils]: 30: Hoare triple {3042#(<= ~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)); {3042#(<= ~counter~0 3)} is VALID [2022-04-08 14:33:13,315 INFO L290 TraceCheckUtils]: 31: Hoare triple {3042#(<= ~counter~0 3)} ~cond := #in~cond; {3042#(<= ~counter~0 3)} is VALID [2022-04-08 14:33:13,315 INFO L290 TraceCheckUtils]: 32: Hoare triple {3042#(<= ~counter~0 3)} assume !(0 == ~cond); {3042#(<= ~counter~0 3)} is VALID [2022-04-08 14:33:13,316 INFO L290 TraceCheckUtils]: 33: Hoare triple {3042#(<= ~counter~0 3)} assume true; {3042#(<= ~counter~0 3)} is VALID [2022-04-08 14:33:13,316 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {3042#(<= ~counter~0 3)} {3042#(<= ~counter~0 3)} #55#return; {3042#(<= ~counter~0 3)} is VALID [2022-04-08 14:33:13,317 INFO L290 TraceCheckUtils]: 35: Hoare triple {3042#(<= ~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; {3042#(<= ~counter~0 3)} is VALID [2022-04-08 14:33:13,317 INFO L290 TraceCheckUtils]: 36: Hoare triple {3042#(<= ~counter~0 3)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {3067#(<= |main_#t~post5| 3)} is VALID [2022-04-08 14:33:13,318 INFO L290 TraceCheckUtils]: 37: Hoare triple {3067#(<= |main_#t~post5| 3)} assume !(#t~post5 < 10);havoc #t~post5; {2951#false} is VALID [2022-04-08 14:33:13,318 INFO L272 TraceCheckUtils]: 38: Hoare triple {2951#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)); {2951#false} is VALID [2022-04-08 14:33:13,318 INFO L290 TraceCheckUtils]: 39: Hoare triple {2951#false} ~cond := #in~cond; {2951#false} is VALID [2022-04-08 14:33:13,318 INFO L290 TraceCheckUtils]: 40: Hoare triple {2951#false} assume !(0 == ~cond); {2951#false} is VALID [2022-04-08 14:33:13,318 INFO L290 TraceCheckUtils]: 41: Hoare triple {2951#false} assume true; {2951#false} is VALID [2022-04-08 14:33:13,318 INFO L284 TraceCheckUtils]: 42: Hoare quadruple {2951#false} {2951#false} #57#return; {2951#false} is VALID [2022-04-08 14:33:13,318 INFO L272 TraceCheckUtils]: 43: Hoare triple {2951#false} call __VERIFIER_assert((if ~k~0 * ~y~0 == ~y~0 * ~y~0 then 1 else 0)); {2951#false} is VALID [2022-04-08 14:33:13,318 INFO L290 TraceCheckUtils]: 44: Hoare triple {2951#false} ~cond := #in~cond; {2951#false} is VALID [2022-04-08 14:33:13,318 INFO L290 TraceCheckUtils]: 45: Hoare triple {2951#false} assume 0 == ~cond; {2951#false} is VALID [2022-04-08 14:33:13,319 INFO L290 TraceCheckUtils]: 46: Hoare triple {2951#false} assume !false; {2951#false} is VALID [2022-04-08 14:33:13,319 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-08 14:33:13,319 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 14:33:13,593 INFO L290 TraceCheckUtils]: 46: Hoare triple {2951#false} assume !false; {2951#false} is VALID [2022-04-08 14:33:13,594 INFO L290 TraceCheckUtils]: 45: Hoare triple {2951#false} assume 0 == ~cond; {2951#false} is VALID [2022-04-08 14:33:13,594 INFO L290 TraceCheckUtils]: 44: Hoare triple {2951#false} ~cond := #in~cond; {2951#false} is VALID [2022-04-08 14:33:13,594 INFO L272 TraceCheckUtils]: 43: Hoare triple {2951#false} call __VERIFIER_assert((if ~k~0 * ~y~0 == ~y~0 * ~y~0 then 1 else 0)); {2951#false} is VALID [2022-04-08 14:33:13,594 INFO L284 TraceCheckUtils]: 42: Hoare quadruple {2950#true} {2951#false} #57#return; {2951#false} is VALID [2022-04-08 14:33:13,594 INFO L290 TraceCheckUtils]: 41: Hoare triple {2950#true} assume true; {2950#true} is VALID [2022-04-08 14:33:13,597 INFO L290 TraceCheckUtils]: 40: Hoare triple {2950#true} assume !(0 == ~cond); {2950#true} is VALID [2022-04-08 14:33:13,597 INFO L290 TraceCheckUtils]: 39: Hoare triple {2950#true} ~cond := #in~cond; {2950#true} is VALID [2022-04-08 14:33:13,598 INFO L272 TraceCheckUtils]: 38: Hoare triple {2951#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#true} is VALID [2022-04-08 14:33:13,604 INFO L290 TraceCheckUtils]: 37: Hoare triple {3125#(< |main_#t~post5| 10)} assume !(#t~post5 < 10);havoc #t~post5; {2951#false} is VALID [2022-04-08 14:33:13,605 INFO L290 TraceCheckUtils]: 36: Hoare triple {3129#(< ~counter~0 10)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {3125#(< |main_#t~post5| 10)} is VALID [2022-04-08 14:33:13,606 INFO L290 TraceCheckUtils]: 35: Hoare triple {3129#(< ~counter~0 10)} 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; {3129#(< ~counter~0 10)} is VALID [2022-04-08 14:33:13,610 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {2950#true} {3129#(< ~counter~0 10)} #55#return; {3129#(< ~counter~0 10)} is VALID [2022-04-08 14:33:13,610 INFO L290 TraceCheckUtils]: 33: Hoare triple {2950#true} assume true; {2950#true} is VALID [2022-04-08 14:33:13,610 INFO L290 TraceCheckUtils]: 32: Hoare triple {2950#true} assume !(0 == ~cond); {2950#true} is VALID [2022-04-08 14:33:13,610 INFO L290 TraceCheckUtils]: 31: Hoare triple {2950#true} ~cond := #in~cond; {2950#true} is VALID [2022-04-08 14:33:13,610 INFO L272 TraceCheckUtils]: 30: Hoare triple {3129#(< ~counter~0 10)} 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#true} is VALID [2022-04-08 14:33:13,611 INFO L290 TraceCheckUtils]: 29: Hoare triple {3129#(< ~counter~0 10)} assume !!(#t~post5 < 10);havoc #t~post5; {3129#(< ~counter~0 10)} is VALID [2022-04-08 14:33:13,612 INFO L290 TraceCheckUtils]: 28: Hoare triple {3154#(< ~counter~0 9)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {3129#(< ~counter~0 10)} is VALID [2022-04-08 14:33:13,613 INFO L290 TraceCheckUtils]: 27: Hoare triple {3154#(< ~counter~0 9)} 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; {3154#(< ~counter~0 9)} is VALID [2022-04-08 14:33:13,613 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {2950#true} {3154#(< ~counter~0 9)} #55#return; {3154#(< ~counter~0 9)} is VALID [2022-04-08 14:33:13,613 INFO L290 TraceCheckUtils]: 25: Hoare triple {2950#true} assume true; {2950#true} is VALID [2022-04-08 14:33:13,614 INFO L290 TraceCheckUtils]: 24: Hoare triple {2950#true} assume !(0 == ~cond); {2950#true} is VALID [2022-04-08 14:33:13,614 INFO L290 TraceCheckUtils]: 23: Hoare triple {2950#true} ~cond := #in~cond; {2950#true} is VALID [2022-04-08 14:33:13,614 INFO L272 TraceCheckUtils]: 22: Hoare triple {3154#(< ~counter~0 9)} 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#true} is VALID [2022-04-08 14:33:13,614 INFO L290 TraceCheckUtils]: 21: Hoare triple {3154#(< ~counter~0 9)} assume !!(#t~post5 < 10);havoc #t~post5; {3154#(< ~counter~0 9)} is VALID [2022-04-08 14:33:13,615 INFO L290 TraceCheckUtils]: 20: Hoare triple {3179#(< ~counter~0 8)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {3154#(< ~counter~0 9)} is VALID [2022-04-08 14:33:13,615 INFO L290 TraceCheckUtils]: 19: Hoare triple {3179#(< ~counter~0 8)} 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; {3179#(< ~counter~0 8)} is VALID [2022-04-08 14:33:13,616 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {2950#true} {3179#(< ~counter~0 8)} #55#return; {3179#(< ~counter~0 8)} is VALID [2022-04-08 14:33:13,616 INFO L290 TraceCheckUtils]: 17: Hoare triple {2950#true} assume true; {2950#true} is VALID [2022-04-08 14:33:13,616 INFO L290 TraceCheckUtils]: 16: Hoare triple {2950#true} assume !(0 == ~cond); {2950#true} is VALID [2022-04-08 14:33:13,616 INFO L290 TraceCheckUtils]: 15: Hoare triple {2950#true} ~cond := #in~cond; {2950#true} is VALID [2022-04-08 14:33:13,616 INFO L272 TraceCheckUtils]: 14: Hoare triple {3179#(< ~counter~0 8)} 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#true} is VALID [2022-04-08 14:33:13,616 INFO L290 TraceCheckUtils]: 13: Hoare triple {3179#(< ~counter~0 8)} assume !!(#t~post5 < 10);havoc #t~post5; {3179#(< ~counter~0 8)} is VALID [2022-04-08 14:33:13,617 INFO L290 TraceCheckUtils]: 12: Hoare triple {3204#(< ~counter~0 7)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {3179#(< ~counter~0 8)} is VALID [2022-04-08 14:33:13,617 INFO L290 TraceCheckUtils]: 11: Hoare triple {3204#(< ~counter~0 7)} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {3204#(< ~counter~0 7)} is VALID [2022-04-08 14:33:13,618 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {2950#true} {3204#(< ~counter~0 7)} #53#return; {3204#(< ~counter~0 7)} is VALID [2022-04-08 14:33:13,618 INFO L290 TraceCheckUtils]: 9: Hoare triple {2950#true} assume true; {2950#true} is VALID [2022-04-08 14:33:13,618 INFO L290 TraceCheckUtils]: 8: Hoare triple {2950#true} assume !(0 == ~cond); {2950#true} is VALID [2022-04-08 14:33:13,618 INFO L290 TraceCheckUtils]: 7: Hoare triple {2950#true} ~cond := #in~cond; {2950#true} is VALID [2022-04-08 14:33:13,618 INFO L272 TraceCheckUtils]: 6: Hoare triple {3204#(< ~counter~0 7)} call assume_abort_if_not((if ~k~0 <= 256 then 1 else 0)); {2950#true} is VALID [2022-04-08 14:33:13,619 INFO L290 TraceCheckUtils]: 5: Hoare triple {3204#(< ~counter~0 7)} 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; {3204#(< ~counter~0 7)} is VALID [2022-04-08 14:33:13,619 INFO L272 TraceCheckUtils]: 4: Hoare triple {3204#(< ~counter~0 7)} call #t~ret6 := main(); {3204#(< ~counter~0 7)} is VALID [2022-04-08 14:33:13,620 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3204#(< ~counter~0 7)} {2950#true} #61#return; {3204#(< ~counter~0 7)} is VALID [2022-04-08 14:33:13,620 INFO L290 TraceCheckUtils]: 2: Hoare triple {3204#(< ~counter~0 7)} assume true; {3204#(< ~counter~0 7)} is VALID [2022-04-08 14:33:13,621 INFO L290 TraceCheckUtils]: 1: Hoare triple {2950#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; {3204#(< ~counter~0 7)} is VALID [2022-04-08 14:33:13,621 INFO L272 TraceCheckUtils]: 0: Hoare triple {2950#true} call ULTIMATE.init(); {2950#true} is VALID [2022-04-08 14:33:13,621 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-08 14:33:13,621 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 14:33:13,621 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [396497419] [2022-04-08 14:33:13,621 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 14:33:13,621 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [824284521] [2022-04-08 14:33:13,622 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [824284521] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 14:33:13,622 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-08 14:33:13,622 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2022-04-08 14:33:13,624 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 14:33:13,625 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [980656225] [2022-04-08 14:33:13,625 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [980656225] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 14:33:13,625 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 14:33:13,625 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-08 14:33:13,625 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1304458497] [2022-04-08 14:33:13,625 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 14:33:13,626 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-08 14:33:13,627 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 14:33:13,627 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-08 14:33:13,668 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-08 14:33:13,668 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-08 14:33:13,668 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 14:33:13,668 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-08 14:33:13,668 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=82, Unknown=0, NotChecked=0, Total=132 [2022-04-08 14:33:13,669 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-08 14:33:13,852 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:33:13,852 INFO L93 Difference]: Finished difference Result 62 states and 64 transitions. [2022-04-08 14:33:13,853 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-04-08 14:33:13,853 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-08 14:33:13,853 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 14:33:13,853 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-08 14:33:13,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 62 transitions. [2022-04-08 14:33:13,855 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-08 14:33:13,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 62 transitions. [2022-04-08 14:33:13,857 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 10 states and 62 transitions. [2022-04-08 14:33:13,908 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-08 14:33:13,909 INFO L225 Difference]: With dead ends: 62 [2022-04-08 14:33:13,909 INFO L226 Difference]: Without dead ends: 52 [2022-04-08 14:33:13,910 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 83 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=83, Invalid=127, Unknown=0, NotChecked=0, Total=210 [2022-04-08 14:33:13,910 INFO L913 BasicCegarLoop]: 28 mSDtfsCounter, 6 mSDsluCounter, 71 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 99 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-08 14:33:13,911 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [6 Valid, 99 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-08 14:33:13,911 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2022-04-08 14:33:13,958 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2022-04-08 14:33:13,958 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 14:33:13,959 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-08 14:33:13,959 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-08 14:33:13,959 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-08 14:33:13,961 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:33:13,961 INFO L93 Difference]: Finished difference Result 52 states and 54 transitions. [2022-04-08 14:33:13,961 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 54 transitions. [2022-04-08 14:33:13,962 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 14:33:13,962 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 14:33:13,962 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-08 14:33:13,962 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-08 14:33:13,964 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:33:13,964 INFO L93 Difference]: Finished difference Result 52 states and 54 transitions. [2022-04-08 14:33:13,964 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 54 transitions. [2022-04-08 14:33:13,964 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 14:33:13,964 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 14:33:13,964 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 14:33:13,964 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 14:33:13,965 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-08 14:33:13,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 54 transitions. [2022-04-08 14:33:13,966 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 54 transitions. Word has length 47 [2022-04-08 14:33:13,966 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 14:33:13,966 INFO L478 AbstractCegarLoop]: Abstraction has 52 states and 54 transitions. [2022-04-08 14:33:13,967 INFO L479 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-08 14:33:13,967 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 52 states and 54 transitions. [2022-04-08 14:33:18,502 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 54 edges. 53 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-08 14:33:18,503 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 54 transitions. [2022-04-08 14:33:18,503 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2022-04-08 14:33:18,503 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 14:33:18,503 INFO L499 BasicCegarLoop]: 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-08 14:33:18,523 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-08 14:33:18,711 WARN L460 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-08 14:33:18,711 INFO L403 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 14:33:18,712 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 14:33:18,712 INFO L85 PathProgramCache]: Analyzing trace with hash 468857897, now seen corresponding path program 5 times [2022-04-08 14:33:18,712 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 14:33:18,712 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [319934446] [2022-04-08 14:33:18,817 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 14:33:18,817 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 14:33:18,818 INFO L85 PathProgramCache]: Analyzing trace with hash 468857897, now seen corresponding path program 6 times [2022-04-08 14:33:18,818 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 14:33:18,818 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [907800045] [2022-04-08 14:33:18,818 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 14:33:18,818 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 14:33:18,829 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 14:33:18,829 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1034561218] [2022-04-08 14:33:18,830 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-08 14:33:18,830 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 14:33:18,830 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 14:33:18,831 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-08 14:33:18,856 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-08 14:33:25,829 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2022-04-08 14:33:25,829 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 14:33:25,832 INFO L263 TraceCheckSpWp]: Trace formula consists of 162 conjuncts, 20 conjunts are in the unsatisfiable core [2022-04-08 14:33:25,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 14:33:25,853 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 14:33:26,240 INFO L272 TraceCheckUtils]: 0: Hoare triple {3581#true} call ULTIMATE.init(); {3581#true} is VALID [2022-04-08 14:33:26,240 INFO L290 TraceCheckUtils]: 1: Hoare triple {3581#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; {3581#true} is VALID [2022-04-08 14:33:26,240 INFO L290 TraceCheckUtils]: 2: Hoare triple {3581#true} assume true; {3581#true} is VALID [2022-04-08 14:33:26,240 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3581#true} {3581#true} #61#return; {3581#true} is VALID [2022-04-08 14:33:26,240 INFO L272 TraceCheckUtils]: 4: Hoare triple {3581#true} call #t~ret6 := main(); {3581#true} is VALID [2022-04-08 14:33:26,241 INFO L290 TraceCheckUtils]: 5: Hoare triple {3581#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; {3581#true} is VALID [2022-04-08 14:33:26,241 INFO L272 TraceCheckUtils]: 6: Hoare triple {3581#true} call assume_abort_if_not((if ~k~0 <= 256 then 1 else 0)); {3581#true} is VALID [2022-04-08 14:33:26,241 INFO L290 TraceCheckUtils]: 7: Hoare triple {3581#true} ~cond := #in~cond; {3581#true} is VALID [2022-04-08 14:33:26,241 INFO L290 TraceCheckUtils]: 8: Hoare triple {3581#true} assume !(0 == ~cond); {3581#true} is VALID [2022-04-08 14:33:26,241 INFO L290 TraceCheckUtils]: 9: Hoare triple {3581#true} assume true; {3581#true} is VALID [2022-04-08 14:33:26,241 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {3581#true} {3581#true} #53#return; {3581#true} is VALID [2022-04-08 14:33:26,241 INFO L290 TraceCheckUtils]: 11: Hoare triple {3581#true} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {3619#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-08 14:33:26,242 INFO L290 TraceCheckUtils]: 12: Hoare triple {3619#(and (= main_~c~0 0) (= main_~y~0 0))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {3619#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-08 14:33:26,242 INFO L290 TraceCheckUtils]: 13: Hoare triple {3619#(and (= main_~c~0 0) (= main_~y~0 0))} assume !!(#t~post5 < 10);havoc #t~post5; {3619#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-08 14:33:26,242 INFO L272 TraceCheckUtils]: 14: Hoare triple {3619#(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)); {3581#true} is VALID [2022-04-08 14:33:26,242 INFO L290 TraceCheckUtils]: 15: Hoare triple {3581#true} ~cond := #in~cond; {3581#true} is VALID [2022-04-08 14:33:26,242 INFO L290 TraceCheckUtils]: 16: Hoare triple {3581#true} assume !(0 == ~cond); {3581#true} is VALID [2022-04-08 14:33:26,243 INFO L290 TraceCheckUtils]: 17: Hoare triple {3581#true} assume true; {3581#true} is VALID [2022-04-08 14:33:26,243 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {3581#true} {3619#(and (= main_~c~0 0) (= main_~y~0 0))} #55#return; {3619#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-08 14:33:26,243 INFO L290 TraceCheckUtils]: 19: Hoare triple {3619#(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; {3644#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} is VALID [2022-04-08 14:33:26,244 INFO L290 TraceCheckUtils]: 20: Hoare triple {3644#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {3644#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} is VALID [2022-04-08 14:33:26,244 INFO L290 TraceCheckUtils]: 21: Hoare triple {3644#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} assume !!(#t~post5 < 10);havoc #t~post5; {3644#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} is VALID [2022-04-08 14:33:26,244 INFO L272 TraceCheckUtils]: 22: Hoare triple {3644#(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)); {3581#true} is VALID [2022-04-08 14:33:26,244 INFO L290 TraceCheckUtils]: 23: Hoare triple {3581#true} ~cond := #in~cond; {3581#true} is VALID [2022-04-08 14:33:26,244 INFO L290 TraceCheckUtils]: 24: Hoare triple {3581#true} assume !(0 == ~cond); {3581#true} is VALID [2022-04-08 14:33:26,245 INFO L290 TraceCheckUtils]: 25: Hoare triple {3581#true} assume true; {3581#true} is VALID [2022-04-08 14:33:26,245 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {3581#true} {3644#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} #55#return; {3644#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} is VALID [2022-04-08 14:33:26,246 INFO L290 TraceCheckUtils]: 27: Hoare triple {3644#(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; {3669#(and (= (+ (- 2) main_~y~0) 0) (= main_~c~0 2))} is VALID [2022-04-08 14:33:26,246 INFO L290 TraceCheckUtils]: 28: Hoare triple {3669#(and (= (+ (- 2) main_~y~0) 0) (= main_~c~0 2))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {3669#(and (= (+ (- 2) main_~y~0) 0) (= main_~c~0 2))} is VALID [2022-04-08 14:33:26,246 INFO L290 TraceCheckUtils]: 29: Hoare triple {3669#(and (= (+ (- 2) main_~y~0) 0) (= main_~c~0 2))} assume !!(#t~post5 < 10);havoc #t~post5; {3669#(and (= (+ (- 2) main_~y~0) 0) (= main_~c~0 2))} is VALID [2022-04-08 14:33:26,246 INFO L272 TraceCheckUtils]: 30: Hoare triple {3669#(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)); {3581#true} is VALID [2022-04-08 14:33:26,247 INFO L290 TraceCheckUtils]: 31: Hoare triple {3581#true} ~cond := #in~cond; {3581#true} is VALID [2022-04-08 14:33:26,247 INFO L290 TraceCheckUtils]: 32: Hoare triple {3581#true} assume !(0 == ~cond); {3581#true} is VALID [2022-04-08 14:33:26,247 INFO L290 TraceCheckUtils]: 33: Hoare triple {3581#true} assume true; {3581#true} is VALID [2022-04-08 14:33:26,247 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {3581#true} {3669#(and (= (+ (- 2) main_~y~0) 0) (= main_~c~0 2))} #55#return; {3669#(and (= (+ (- 2) main_~y~0) 0) (= main_~c~0 2))} is VALID [2022-04-08 14:33:26,248 INFO L290 TraceCheckUtils]: 35: Hoare triple {3669#(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; {3694#(and (<= main_~c~0 3) (= (+ main_~y~0 (- 3)) 0) (< 2 main_~k~0))} is VALID [2022-04-08 14:33:26,248 INFO L290 TraceCheckUtils]: 36: Hoare triple {3694#(and (<= main_~c~0 3) (= (+ main_~y~0 (- 3)) 0) (< 2 main_~k~0))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {3694#(and (<= main_~c~0 3) (= (+ main_~y~0 (- 3)) 0) (< 2 main_~k~0))} is VALID [2022-04-08 14:33:26,248 INFO L290 TraceCheckUtils]: 37: Hoare triple {3694#(and (<= main_~c~0 3) (= (+ main_~y~0 (- 3)) 0) (< 2 main_~k~0))} assume !!(#t~post5 < 10);havoc #t~post5; {3694#(and (<= main_~c~0 3) (= (+ main_~y~0 (- 3)) 0) (< 2 main_~k~0))} is VALID [2022-04-08 14:33:26,248 INFO L272 TraceCheckUtils]: 38: Hoare triple {3694#(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)); {3581#true} is VALID [2022-04-08 14:33:26,249 INFO L290 TraceCheckUtils]: 39: Hoare triple {3581#true} ~cond := #in~cond; {3581#true} is VALID [2022-04-08 14:33:26,249 INFO L290 TraceCheckUtils]: 40: Hoare triple {3581#true} assume !(0 == ~cond); {3581#true} is VALID [2022-04-08 14:33:26,249 INFO L290 TraceCheckUtils]: 41: Hoare triple {3581#true} assume true; {3581#true} is VALID [2022-04-08 14:33:26,250 INFO L284 TraceCheckUtils]: 42: Hoare quadruple {3581#true} {3694#(and (<= main_~c~0 3) (= (+ main_~y~0 (- 3)) 0) (< 2 main_~k~0))} #55#return; {3694#(and (<= main_~c~0 3) (= (+ main_~y~0 (- 3)) 0) (< 2 main_~k~0))} is VALID [2022-04-08 14:33:26,250 INFO L290 TraceCheckUtils]: 43: Hoare triple {3694#(and (<= main_~c~0 3) (= (+ main_~y~0 (- 3)) 0) (< 2 main_~k~0))} assume !(~c~0 < ~k~0); {3719#(and (<= main_~k~0 3) (= (+ main_~y~0 (- 3)) 0) (< 2 main_~k~0))} is VALID [2022-04-08 14:33:26,250 INFO L272 TraceCheckUtils]: 44: Hoare triple {3719#(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)); {3581#true} is VALID [2022-04-08 14:33:26,250 INFO L290 TraceCheckUtils]: 45: Hoare triple {3581#true} ~cond := #in~cond; {3581#true} is VALID [2022-04-08 14:33:26,251 INFO L290 TraceCheckUtils]: 46: Hoare triple {3581#true} assume !(0 == ~cond); {3581#true} is VALID [2022-04-08 14:33:26,251 INFO L290 TraceCheckUtils]: 47: Hoare triple {3581#true} assume true; {3581#true} is VALID [2022-04-08 14:33:26,251 INFO L284 TraceCheckUtils]: 48: Hoare quadruple {3581#true} {3719#(and (<= main_~k~0 3) (= (+ main_~y~0 (- 3)) 0) (< 2 main_~k~0))} #57#return; {3719#(and (<= main_~k~0 3) (= (+ main_~y~0 (- 3)) 0) (< 2 main_~k~0))} is VALID [2022-04-08 14:33:26,252 INFO L272 TraceCheckUtils]: 49: Hoare triple {3719#(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)); {3738#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 14:33:26,253 INFO L290 TraceCheckUtils]: 50: Hoare triple {3738#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {3742#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 14:33:26,253 INFO L290 TraceCheckUtils]: 51: Hoare triple {3742#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {3582#false} is VALID [2022-04-08 14:33:26,253 INFO L290 TraceCheckUtils]: 52: Hoare triple {3582#false} assume !false; {3582#false} is VALID [2022-04-08 14:33:26,253 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-08 14:33:26,254 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 14:33:26,639 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 14:33:26,639 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [907800045] [2022-04-08 14:33:26,639 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 14:33:26,639 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1034561218] [2022-04-08 14:33:26,639 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1034561218] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 14:33:26,640 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-08 14:33:26,640 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2022-04-08 14:33:26,640 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 14:33:26,640 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [319934446] [2022-04-08 14:33:26,640 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [319934446] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 14:33:26,640 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 14:33:26,640 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-04-08 14:33:26,640 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1570958815] [2022-04-08 14:33:26,640 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 14:33:26,641 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-08 14:33:26,641 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 14:33:26,641 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-08 14:33:26,681 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-08 14:33:26,681 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-04-08 14:33:26,681 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 14:33:26,682 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-04-08 14:33:26,682 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2022-04-08 14:33:26,682 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-08 14:33:27,130 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:33:27,130 INFO L93 Difference]: Finished difference Result 60 states and 64 transitions. [2022-04-08 14:33:27,130 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-08 14:33:27,130 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-08 14:33:27,130 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 14:33:27,131 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-08 14:33:27,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 54 transitions. [2022-04-08 14:33:27,132 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-08 14:33:27,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 54 transitions. [2022-04-08 14:33:27,133 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 9 states and 54 transitions. [2022-04-08 14:33:27,186 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-08 14:33:27,187 INFO L225 Difference]: With dead ends: 60 [2022-04-08 14:33:27,187 INFO L226 Difference]: Without dead ends: 54 [2022-04-08 14:33:27,188 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 60 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=40, Invalid=142, Unknown=0, NotChecked=0, Total=182 [2022-04-08 14:33:27,188 INFO L913 BasicCegarLoop]: 40 mSDtfsCounter, 2 mSDsluCounter, 183 mSDsCounter, 0 mSdLazyCounter, 124 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 223 SdHoareTripleChecker+Invalid, 125 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 124 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-08 14:33:27,188 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [2 Valid, 223 Invalid, 125 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 124 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-08 14:33:27,189 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2022-04-08 14:33:27,255 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2022-04-08 14:33:27,256 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 14:33:27,256 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-08 14:33:27,256 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-08 14:33:27,256 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-08 14:33:27,258 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:33:27,258 INFO L93 Difference]: Finished difference Result 54 states and 57 transitions. [2022-04-08 14:33:27,258 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 57 transitions. [2022-04-08 14:33:27,258 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 14:33:27,258 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 14:33:27,258 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-08 14:33:27,259 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-08 14:33:27,260 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:33:27,260 INFO L93 Difference]: Finished difference Result 54 states and 57 transitions. [2022-04-08 14:33:27,260 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 57 transitions. [2022-04-08 14:33:27,260 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 14:33:27,260 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 14:33:27,260 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 14:33:27,260 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 14:33:27,261 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-08 14:33:27,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 57 transitions. [2022-04-08 14:33:27,262 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 57 transitions. Word has length 53 [2022-04-08 14:33:27,262 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 14:33:27,262 INFO L478 AbstractCegarLoop]: Abstraction has 54 states and 57 transitions. [2022-04-08 14:33:27,262 INFO L479 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-08 14:33:27,262 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 54 states and 57 transitions. [2022-04-08 14:33:31,653 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 57 edges. 56 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-08 14:33:31,654 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 57 transitions. [2022-04-08 14:33:31,655 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2022-04-08 14:33:31,655 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 14:33:31,655 INFO L499 BasicCegarLoop]: 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-08 14:33:31,661 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-08 14:33:31,856 WARN L460 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-08 14:33:31,856 INFO L403 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 14:33:31,856 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 14:33:31,856 INFO L85 PathProgramCache]: Analyzing trace with hash -1953308764, now seen corresponding path program 5 times [2022-04-08 14:33:31,856 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 14:33:31,856 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [238736632] [2022-04-08 14:33:31,980 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 14:33:31,981 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 14:33:31,981 INFO L85 PathProgramCache]: Analyzing trace with hash -1953308764, now seen corresponding path program 6 times [2022-04-08 14:33:31,981 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 14:33:31,981 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1652128502] [2022-04-08 14:33:31,981 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 14:33:31,981 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 14:33:31,994 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 14:33:31,994 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2123639670] [2022-04-08 14:33:31,994 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-08 14:33:31,994 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 14:33:31,995 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 14:33:32,004 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-08 14:33:32,005 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-08 14:33:32,422 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2022-04-08 14:33:32,422 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 14:33:32,423 INFO L263 TraceCheckSpWp]: Trace formula consists of 173 conjuncts, 13 conjunts are in the unsatisfiable core [2022-04-08 14:33:32,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 14:33:32,441 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 14:33:32,733 INFO L272 TraceCheckUtils]: 0: Hoare triple {4148#true} call ULTIMATE.init(); {4148#true} is VALID [2022-04-08 14:33:32,734 INFO L290 TraceCheckUtils]: 1: Hoare triple {4148#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; {4156#(<= ~counter~0 0)} is VALID [2022-04-08 14:33:32,734 INFO L290 TraceCheckUtils]: 2: Hoare triple {4156#(<= ~counter~0 0)} assume true; {4156#(<= ~counter~0 0)} is VALID [2022-04-08 14:33:32,735 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4156#(<= ~counter~0 0)} {4148#true} #61#return; {4156#(<= ~counter~0 0)} is VALID [2022-04-08 14:33:32,735 INFO L272 TraceCheckUtils]: 4: Hoare triple {4156#(<= ~counter~0 0)} call #t~ret6 := main(); {4156#(<= ~counter~0 0)} is VALID [2022-04-08 14:33:32,736 INFO L290 TraceCheckUtils]: 5: Hoare triple {4156#(<= ~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; {4156#(<= ~counter~0 0)} is VALID [2022-04-08 14:33:32,736 INFO L272 TraceCheckUtils]: 6: Hoare triple {4156#(<= ~counter~0 0)} call assume_abort_if_not((if ~k~0 <= 256 then 1 else 0)); {4156#(<= ~counter~0 0)} is VALID [2022-04-08 14:33:32,736 INFO L290 TraceCheckUtils]: 7: Hoare triple {4156#(<= ~counter~0 0)} ~cond := #in~cond; {4156#(<= ~counter~0 0)} is VALID [2022-04-08 14:33:32,737 INFO L290 TraceCheckUtils]: 8: Hoare triple {4156#(<= ~counter~0 0)} assume !(0 == ~cond); {4156#(<= ~counter~0 0)} is VALID [2022-04-08 14:33:32,737 INFO L290 TraceCheckUtils]: 9: Hoare triple {4156#(<= ~counter~0 0)} assume true; {4156#(<= ~counter~0 0)} is VALID [2022-04-08 14:33:32,738 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {4156#(<= ~counter~0 0)} {4156#(<= ~counter~0 0)} #53#return; {4156#(<= ~counter~0 0)} is VALID [2022-04-08 14:33:32,738 INFO L290 TraceCheckUtils]: 11: Hoare triple {4156#(<= ~counter~0 0)} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {4156#(<= ~counter~0 0)} is VALID [2022-04-08 14:33:32,739 INFO L290 TraceCheckUtils]: 12: Hoare triple {4156#(<= ~counter~0 0)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {4190#(<= ~counter~0 1)} is VALID [2022-04-08 14:33:32,739 INFO L290 TraceCheckUtils]: 13: Hoare triple {4190#(<= ~counter~0 1)} assume !!(#t~post5 < 10);havoc #t~post5; {4190#(<= ~counter~0 1)} is VALID [2022-04-08 14:33:32,740 INFO L272 TraceCheckUtils]: 14: Hoare triple {4190#(<= ~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)); {4190#(<= ~counter~0 1)} is VALID [2022-04-08 14:33:32,740 INFO L290 TraceCheckUtils]: 15: Hoare triple {4190#(<= ~counter~0 1)} ~cond := #in~cond; {4190#(<= ~counter~0 1)} is VALID [2022-04-08 14:33:32,740 INFO L290 TraceCheckUtils]: 16: Hoare triple {4190#(<= ~counter~0 1)} assume !(0 == ~cond); {4190#(<= ~counter~0 1)} is VALID [2022-04-08 14:33:32,741 INFO L290 TraceCheckUtils]: 17: Hoare triple {4190#(<= ~counter~0 1)} assume true; {4190#(<= ~counter~0 1)} is VALID [2022-04-08 14:33:32,741 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {4190#(<= ~counter~0 1)} {4190#(<= ~counter~0 1)} #55#return; {4190#(<= ~counter~0 1)} is VALID [2022-04-08 14:33:32,742 INFO L290 TraceCheckUtils]: 19: Hoare triple {4190#(<= ~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; {4190#(<= ~counter~0 1)} is VALID [2022-04-08 14:33:32,742 INFO L290 TraceCheckUtils]: 20: Hoare triple {4190#(<= ~counter~0 1)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {4215#(<= ~counter~0 2)} is VALID [2022-04-08 14:33:32,743 INFO L290 TraceCheckUtils]: 21: Hoare triple {4215#(<= ~counter~0 2)} assume !!(#t~post5 < 10);havoc #t~post5; {4215#(<= ~counter~0 2)} is VALID [2022-04-08 14:33:32,743 INFO L272 TraceCheckUtils]: 22: Hoare triple {4215#(<= ~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)); {4215#(<= ~counter~0 2)} is VALID [2022-04-08 14:33:32,744 INFO L290 TraceCheckUtils]: 23: Hoare triple {4215#(<= ~counter~0 2)} ~cond := #in~cond; {4215#(<= ~counter~0 2)} is VALID [2022-04-08 14:33:32,744 INFO L290 TraceCheckUtils]: 24: Hoare triple {4215#(<= ~counter~0 2)} assume !(0 == ~cond); {4215#(<= ~counter~0 2)} is VALID [2022-04-08 14:33:32,744 INFO L290 TraceCheckUtils]: 25: Hoare triple {4215#(<= ~counter~0 2)} assume true; {4215#(<= ~counter~0 2)} is VALID [2022-04-08 14:33:32,745 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {4215#(<= ~counter~0 2)} {4215#(<= ~counter~0 2)} #55#return; {4215#(<= ~counter~0 2)} is VALID [2022-04-08 14:33:32,745 INFO L290 TraceCheckUtils]: 27: Hoare triple {4215#(<= ~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; {4215#(<= ~counter~0 2)} is VALID [2022-04-08 14:33:32,746 INFO L290 TraceCheckUtils]: 28: Hoare triple {4215#(<= ~counter~0 2)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {4240#(<= ~counter~0 3)} is VALID [2022-04-08 14:33:32,746 INFO L290 TraceCheckUtils]: 29: Hoare triple {4240#(<= ~counter~0 3)} assume !!(#t~post5 < 10);havoc #t~post5; {4240#(<= ~counter~0 3)} is VALID [2022-04-08 14:33:32,747 INFO L272 TraceCheckUtils]: 30: Hoare triple {4240#(<= ~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)); {4240#(<= ~counter~0 3)} is VALID [2022-04-08 14:33:32,747 INFO L290 TraceCheckUtils]: 31: Hoare triple {4240#(<= ~counter~0 3)} ~cond := #in~cond; {4240#(<= ~counter~0 3)} is VALID [2022-04-08 14:33:32,747 INFO L290 TraceCheckUtils]: 32: Hoare triple {4240#(<= ~counter~0 3)} assume !(0 == ~cond); {4240#(<= ~counter~0 3)} is VALID [2022-04-08 14:33:32,748 INFO L290 TraceCheckUtils]: 33: Hoare triple {4240#(<= ~counter~0 3)} assume true; {4240#(<= ~counter~0 3)} is VALID [2022-04-08 14:33:32,748 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {4240#(<= ~counter~0 3)} {4240#(<= ~counter~0 3)} #55#return; {4240#(<= ~counter~0 3)} is VALID [2022-04-08 14:33:32,749 INFO L290 TraceCheckUtils]: 35: Hoare triple {4240#(<= ~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; {4240#(<= ~counter~0 3)} is VALID [2022-04-08 14:33:32,749 INFO L290 TraceCheckUtils]: 36: Hoare triple {4240#(<= ~counter~0 3)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {4265#(<= ~counter~0 4)} is VALID [2022-04-08 14:33:32,750 INFO L290 TraceCheckUtils]: 37: Hoare triple {4265#(<= ~counter~0 4)} assume !!(#t~post5 < 10);havoc #t~post5; {4265#(<= ~counter~0 4)} is VALID [2022-04-08 14:33:32,750 INFO L272 TraceCheckUtils]: 38: Hoare triple {4265#(<= ~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)); {4265#(<= ~counter~0 4)} is VALID [2022-04-08 14:33:32,751 INFO L290 TraceCheckUtils]: 39: Hoare triple {4265#(<= ~counter~0 4)} ~cond := #in~cond; {4265#(<= ~counter~0 4)} is VALID [2022-04-08 14:33:32,751 INFO L290 TraceCheckUtils]: 40: Hoare triple {4265#(<= ~counter~0 4)} assume !(0 == ~cond); {4265#(<= ~counter~0 4)} is VALID [2022-04-08 14:33:32,751 INFO L290 TraceCheckUtils]: 41: Hoare triple {4265#(<= ~counter~0 4)} assume true; {4265#(<= ~counter~0 4)} is VALID [2022-04-08 14:33:32,752 INFO L284 TraceCheckUtils]: 42: Hoare quadruple {4265#(<= ~counter~0 4)} {4265#(<= ~counter~0 4)} #55#return; {4265#(<= ~counter~0 4)} is VALID [2022-04-08 14:33:32,752 INFO L290 TraceCheckUtils]: 43: Hoare triple {4265#(<= ~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; {4265#(<= ~counter~0 4)} is VALID [2022-04-08 14:33:32,753 INFO L290 TraceCheckUtils]: 44: Hoare triple {4265#(<= ~counter~0 4)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {4290#(<= |main_#t~post5| 4)} is VALID [2022-04-08 14:33:32,753 INFO L290 TraceCheckUtils]: 45: Hoare triple {4290#(<= |main_#t~post5| 4)} assume !(#t~post5 < 10);havoc #t~post5; {4149#false} is VALID [2022-04-08 14:33:32,753 INFO L272 TraceCheckUtils]: 46: Hoare triple {4149#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)); {4149#false} is VALID [2022-04-08 14:33:32,753 INFO L290 TraceCheckUtils]: 47: Hoare triple {4149#false} ~cond := #in~cond; {4149#false} is VALID [2022-04-08 14:33:32,754 INFO L290 TraceCheckUtils]: 48: Hoare triple {4149#false} assume !(0 == ~cond); {4149#false} is VALID [2022-04-08 14:33:32,754 INFO L290 TraceCheckUtils]: 49: Hoare triple {4149#false} assume true; {4149#false} is VALID [2022-04-08 14:33:32,754 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {4149#false} {4149#false} #57#return; {4149#false} is VALID [2022-04-08 14:33:32,754 INFO L272 TraceCheckUtils]: 51: Hoare triple {4149#false} call __VERIFIER_assert((if ~k~0 * ~y~0 == ~y~0 * ~y~0 then 1 else 0)); {4149#false} is VALID [2022-04-08 14:33:32,754 INFO L290 TraceCheckUtils]: 52: Hoare triple {4149#false} ~cond := #in~cond; {4149#false} is VALID [2022-04-08 14:33:32,754 INFO L290 TraceCheckUtils]: 53: Hoare triple {4149#false} assume 0 == ~cond; {4149#false} is VALID [2022-04-08 14:33:32,754 INFO L290 TraceCheckUtils]: 54: Hoare triple {4149#false} assume !false; {4149#false} is VALID [2022-04-08 14:33:32,754 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-08 14:33:32,755 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 14:33:33,057 INFO L290 TraceCheckUtils]: 54: Hoare triple {4149#false} assume !false; {4149#false} is VALID [2022-04-08 14:33:33,057 INFO L290 TraceCheckUtils]: 53: Hoare triple {4149#false} assume 0 == ~cond; {4149#false} is VALID [2022-04-08 14:33:33,057 INFO L290 TraceCheckUtils]: 52: Hoare triple {4149#false} ~cond := #in~cond; {4149#false} is VALID [2022-04-08 14:33:33,057 INFO L272 TraceCheckUtils]: 51: Hoare triple {4149#false} call __VERIFIER_assert((if ~k~0 * ~y~0 == ~y~0 * ~y~0 then 1 else 0)); {4149#false} is VALID [2022-04-08 14:33:33,057 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {4148#true} {4149#false} #57#return; {4149#false} is VALID [2022-04-08 14:33:33,057 INFO L290 TraceCheckUtils]: 49: Hoare triple {4148#true} assume true; {4148#true} is VALID [2022-04-08 14:33:33,057 INFO L290 TraceCheckUtils]: 48: Hoare triple {4148#true} assume !(0 == ~cond); {4148#true} is VALID [2022-04-08 14:33:33,057 INFO L290 TraceCheckUtils]: 47: Hoare triple {4148#true} ~cond := #in~cond; {4148#true} is VALID [2022-04-08 14:33:33,058 INFO L272 TraceCheckUtils]: 46: Hoare triple {4149#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)); {4148#true} is VALID [2022-04-08 14:33:33,058 INFO L290 TraceCheckUtils]: 45: Hoare triple {4348#(< |main_#t~post5| 10)} assume !(#t~post5 < 10);havoc #t~post5; {4149#false} is VALID [2022-04-08 14:33:33,058 INFO L290 TraceCheckUtils]: 44: Hoare triple {4352#(< ~counter~0 10)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {4348#(< |main_#t~post5| 10)} is VALID [2022-04-08 14:33:33,058 INFO L290 TraceCheckUtils]: 43: Hoare triple {4352#(< ~counter~0 10)} 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; {4352#(< ~counter~0 10)} is VALID [2022-04-08 14:33:33,059 INFO L284 TraceCheckUtils]: 42: Hoare quadruple {4148#true} {4352#(< ~counter~0 10)} #55#return; {4352#(< ~counter~0 10)} is VALID [2022-04-08 14:33:33,059 INFO L290 TraceCheckUtils]: 41: Hoare triple {4148#true} assume true; {4148#true} is VALID [2022-04-08 14:33:33,059 INFO L290 TraceCheckUtils]: 40: Hoare triple {4148#true} assume !(0 == ~cond); {4148#true} is VALID [2022-04-08 14:33:33,059 INFO L290 TraceCheckUtils]: 39: Hoare triple {4148#true} ~cond := #in~cond; {4148#true} is VALID [2022-04-08 14:33:33,059 INFO L272 TraceCheckUtils]: 38: Hoare triple {4352#(< ~counter~0 10)} 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)); {4148#true} is VALID [2022-04-08 14:33:33,060 INFO L290 TraceCheckUtils]: 37: Hoare triple {4352#(< ~counter~0 10)} assume !!(#t~post5 < 10);havoc #t~post5; {4352#(< ~counter~0 10)} is VALID [2022-04-08 14:33:33,060 INFO L290 TraceCheckUtils]: 36: Hoare triple {4377#(< ~counter~0 9)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {4352#(< ~counter~0 10)} is VALID [2022-04-08 14:33:33,060 INFO L290 TraceCheckUtils]: 35: Hoare triple {4377#(< ~counter~0 9)} 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; {4377#(< ~counter~0 9)} is VALID [2022-04-08 14:33:33,061 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {4148#true} {4377#(< ~counter~0 9)} #55#return; {4377#(< ~counter~0 9)} is VALID [2022-04-08 14:33:33,061 INFO L290 TraceCheckUtils]: 33: Hoare triple {4148#true} assume true; {4148#true} is VALID [2022-04-08 14:33:33,061 INFO L290 TraceCheckUtils]: 32: Hoare triple {4148#true} assume !(0 == ~cond); {4148#true} is VALID [2022-04-08 14:33:33,061 INFO L290 TraceCheckUtils]: 31: Hoare triple {4148#true} ~cond := #in~cond; {4148#true} is VALID [2022-04-08 14:33:33,061 INFO L272 TraceCheckUtils]: 30: Hoare triple {4377#(< ~counter~0 9)} 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)); {4148#true} is VALID [2022-04-08 14:33:33,067 INFO L290 TraceCheckUtils]: 29: Hoare triple {4377#(< ~counter~0 9)} assume !!(#t~post5 < 10);havoc #t~post5; {4377#(< ~counter~0 9)} is VALID [2022-04-08 14:33:33,069 INFO L290 TraceCheckUtils]: 28: Hoare triple {4402#(< ~counter~0 8)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {4377#(< ~counter~0 9)} is VALID [2022-04-08 14:33:33,069 INFO L290 TraceCheckUtils]: 27: Hoare triple {4402#(< ~counter~0 8)} 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; {4402#(< ~counter~0 8)} is VALID [2022-04-08 14:33:33,069 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {4148#true} {4402#(< ~counter~0 8)} #55#return; {4402#(< ~counter~0 8)} is VALID [2022-04-08 14:33:33,069 INFO L290 TraceCheckUtils]: 25: Hoare triple {4148#true} assume true; {4148#true} is VALID [2022-04-08 14:33:33,070 INFO L290 TraceCheckUtils]: 24: Hoare triple {4148#true} assume !(0 == ~cond); {4148#true} is VALID [2022-04-08 14:33:33,070 INFO L290 TraceCheckUtils]: 23: Hoare triple {4148#true} ~cond := #in~cond; {4148#true} is VALID [2022-04-08 14:33:33,070 INFO L272 TraceCheckUtils]: 22: Hoare triple {4402#(< ~counter~0 8)} 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)); {4148#true} is VALID [2022-04-08 14:33:33,070 INFO L290 TraceCheckUtils]: 21: Hoare triple {4402#(< ~counter~0 8)} assume !!(#t~post5 < 10);havoc #t~post5; {4402#(< ~counter~0 8)} is VALID [2022-04-08 14:33:33,070 INFO L290 TraceCheckUtils]: 20: Hoare triple {4427#(< ~counter~0 7)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {4402#(< ~counter~0 8)} is VALID [2022-04-08 14:33:33,071 INFO L290 TraceCheckUtils]: 19: Hoare triple {4427#(< ~counter~0 7)} 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; {4427#(< ~counter~0 7)} is VALID [2022-04-08 14:33:33,071 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {4148#true} {4427#(< ~counter~0 7)} #55#return; {4427#(< ~counter~0 7)} is VALID [2022-04-08 14:33:33,071 INFO L290 TraceCheckUtils]: 17: Hoare triple {4148#true} assume true; {4148#true} is VALID [2022-04-08 14:33:33,071 INFO L290 TraceCheckUtils]: 16: Hoare triple {4148#true} assume !(0 == ~cond); {4148#true} is VALID [2022-04-08 14:33:33,071 INFO L290 TraceCheckUtils]: 15: Hoare triple {4148#true} ~cond := #in~cond; {4148#true} is VALID [2022-04-08 14:33:33,071 INFO L272 TraceCheckUtils]: 14: Hoare triple {4427#(< ~counter~0 7)} 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)); {4148#true} is VALID [2022-04-08 14:33:33,072 INFO L290 TraceCheckUtils]: 13: Hoare triple {4427#(< ~counter~0 7)} assume !!(#t~post5 < 10);havoc #t~post5; {4427#(< ~counter~0 7)} is VALID [2022-04-08 14:33:33,072 INFO L290 TraceCheckUtils]: 12: Hoare triple {4452#(< ~counter~0 6)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {4427#(< ~counter~0 7)} is VALID [2022-04-08 14:33:33,072 INFO L290 TraceCheckUtils]: 11: Hoare triple {4452#(< ~counter~0 6)} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {4452#(< ~counter~0 6)} is VALID [2022-04-08 14:33:33,073 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {4148#true} {4452#(< ~counter~0 6)} #53#return; {4452#(< ~counter~0 6)} is VALID [2022-04-08 14:33:33,073 INFO L290 TraceCheckUtils]: 9: Hoare triple {4148#true} assume true; {4148#true} is VALID [2022-04-08 14:33:33,073 INFO L290 TraceCheckUtils]: 8: Hoare triple {4148#true} assume !(0 == ~cond); {4148#true} is VALID [2022-04-08 14:33:33,073 INFO L290 TraceCheckUtils]: 7: Hoare triple {4148#true} ~cond := #in~cond; {4148#true} is VALID [2022-04-08 14:33:33,073 INFO L272 TraceCheckUtils]: 6: Hoare triple {4452#(< ~counter~0 6)} call assume_abort_if_not((if ~k~0 <= 256 then 1 else 0)); {4148#true} is VALID [2022-04-08 14:33:33,073 INFO L290 TraceCheckUtils]: 5: Hoare triple {4452#(< ~counter~0 6)} 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; {4452#(< ~counter~0 6)} is VALID [2022-04-08 14:33:33,074 INFO L272 TraceCheckUtils]: 4: Hoare triple {4452#(< ~counter~0 6)} call #t~ret6 := main(); {4452#(< ~counter~0 6)} is VALID [2022-04-08 14:33:33,074 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4452#(< ~counter~0 6)} {4148#true} #61#return; {4452#(< ~counter~0 6)} is VALID [2022-04-08 14:33:33,074 INFO L290 TraceCheckUtils]: 2: Hoare triple {4452#(< ~counter~0 6)} assume true; {4452#(< ~counter~0 6)} is VALID [2022-04-08 14:33:33,075 INFO L290 TraceCheckUtils]: 1: Hoare triple {4148#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; {4452#(< ~counter~0 6)} is VALID [2022-04-08 14:33:33,075 INFO L272 TraceCheckUtils]: 0: Hoare triple {4148#true} call ULTIMATE.init(); {4148#true} is VALID [2022-04-08 14:33:33,075 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-08 14:33:33,075 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 14:33:33,075 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1652128502] [2022-04-08 14:33:33,075 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 14:33:33,075 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2123639670] [2022-04-08 14:33:33,076 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2123639670] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 14:33:33,076 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-08 14:33:33,076 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 14 [2022-04-08 14:33:33,076 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 14:33:33,076 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [238736632] [2022-04-08 14:33:33,076 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [238736632] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 14:33:33,076 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 14:33:33,076 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-08 14:33:33,076 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1793730017] [2022-04-08 14:33:33,076 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 14:33:33,077 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-08 14:33:33,077 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 14:33:33,077 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-08 14:33:33,114 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-08 14:33:33,114 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-08 14:33:33,114 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 14:33:33,114 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-08 14:33:33,115 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=111, Unknown=0, NotChecked=0, Total=182 [2022-04-08 14:33:33,115 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-08 14:33:33,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:33:33,308 INFO L93 Difference]: Finished difference Result 70 states and 72 transitions. [2022-04-08 14:33:33,308 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-04-08 14:33:33,308 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-08 14:33:33,308 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 14:33:33,309 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-08 14:33:33,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 70 transitions. [2022-04-08 14:33:33,311 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-08 14:33:33,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 70 transitions. [2022-04-08 14:33:33,312 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 12 states and 70 transitions. [2022-04-08 14:33:33,364 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-08 14:33:33,365 INFO L225 Difference]: With dead ends: 70 [2022-04-08 14:33:33,365 INFO L226 Difference]: Without dead ends: 60 [2022-04-08 14:33:33,365 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 97 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=123, Invalid=183, Unknown=0, NotChecked=0, Total=306 [2022-04-08 14:33:33,366 INFO L913 BasicCegarLoop]: 29 mSDtfsCounter, 6 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 96 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-08 14:33:33,366 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [6 Valid, 96 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-08 14:33:33,366 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2022-04-08 14:33:33,424 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 60. [2022-04-08 14:33:33,425 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 14:33:33,425 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-08 14:33:33,425 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-08 14:33:33,425 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-08 14:33:33,427 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:33:33,427 INFO L93 Difference]: Finished difference Result 60 states and 62 transitions. [2022-04-08 14:33:33,427 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 62 transitions. [2022-04-08 14:33:33,427 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 14:33:33,427 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 14:33:33,427 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-08 14:33:33,427 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-08 14:33:33,428 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:33:33,428 INFO L93 Difference]: Finished difference Result 60 states and 62 transitions. [2022-04-08 14:33:33,428 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 62 transitions. [2022-04-08 14:33:33,429 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 14:33:33,429 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 14:33:33,429 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 14:33:33,429 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 14:33:33,429 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-08 14:33:33,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 62 transitions. [2022-04-08 14:33:33,430 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 62 transitions. Word has length 55 [2022-04-08 14:33:33,430 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 14:33:33,431 INFO L478 AbstractCegarLoop]: Abstraction has 60 states and 62 transitions. [2022-04-08 14:33:33,431 INFO L479 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-08 14:33:33,431 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 60 states and 62 transitions. [2022-04-08 14:33:37,892 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 62 edges. 61 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-08 14:33:37,893 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 62 transitions. [2022-04-08 14:33:37,893 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2022-04-08 14:33:37,893 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 14:33:37,893 INFO L499 BasicCegarLoop]: 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-08 14:33:37,898 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2022-04-08 14:33:38,094 WARN L460 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-08 14:33:38,094 INFO L403 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 14:33:38,095 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 14:33:38,095 INFO L85 PathProgramCache]: Analyzing trace with hash 1425669898, now seen corresponding path program 7 times [2022-04-08 14:33:38,095 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 14:33:38,095 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1532014128] [2022-04-08 14:33:38,217 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 14:33:38,217 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 14:33:38,217 INFO L85 PathProgramCache]: Analyzing trace with hash 1425669898, now seen corresponding path program 8 times [2022-04-08 14:33:38,217 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 14:33:38,217 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1197834536] [2022-04-08 14:33:38,217 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 14:33:38,217 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 14:33:38,231 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 14:33:38,232 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1371331501] [2022-04-08 14:33:38,232 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 14:33:38,232 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 14:33:38,232 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 14:33:38,238 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-08 14:33:38,260 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-08 14:33:38,764 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 14:33:38,765 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 14:33:38,766 INFO L263 TraceCheckSpWp]: Trace formula consists of 183 conjuncts, 25 conjunts are in the unsatisfiable core [2022-04-08 14:33:38,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 14:33:38,778 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 14:33:39,260 INFO L272 TraceCheckUtils]: 0: Hoare triple {4879#true} call ULTIMATE.init(); {4879#true} is VALID [2022-04-08 14:33:39,260 INFO L290 TraceCheckUtils]: 1: Hoare triple {4879#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; {4879#true} is VALID [2022-04-08 14:33:39,260 INFO L290 TraceCheckUtils]: 2: Hoare triple {4879#true} assume true; {4879#true} is VALID [2022-04-08 14:33:39,260 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4879#true} {4879#true} #61#return; {4879#true} is VALID [2022-04-08 14:33:39,261 INFO L272 TraceCheckUtils]: 4: Hoare triple {4879#true} call #t~ret6 := main(); {4879#true} is VALID [2022-04-08 14:33:39,261 INFO L290 TraceCheckUtils]: 5: Hoare triple {4879#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; {4879#true} is VALID [2022-04-08 14:33:39,261 INFO L272 TraceCheckUtils]: 6: Hoare triple {4879#true} call assume_abort_if_not((if ~k~0 <= 256 then 1 else 0)); {4879#true} is VALID [2022-04-08 14:33:39,261 INFO L290 TraceCheckUtils]: 7: Hoare triple {4879#true} ~cond := #in~cond; {4879#true} is VALID [2022-04-08 14:33:39,261 INFO L290 TraceCheckUtils]: 8: Hoare triple {4879#true} assume !(0 == ~cond); {4879#true} is VALID [2022-04-08 14:33:39,261 INFO L290 TraceCheckUtils]: 9: Hoare triple {4879#true} assume true; {4879#true} is VALID [2022-04-08 14:33:39,261 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {4879#true} {4879#true} #53#return; {4879#true} is VALID [2022-04-08 14:33:39,261 INFO L290 TraceCheckUtils]: 11: Hoare triple {4879#true} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {4917#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-08 14:33:39,262 INFO L290 TraceCheckUtils]: 12: Hoare triple {4917#(and (= main_~c~0 0) (= main_~y~0 0))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {4917#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-08 14:33:39,262 INFO L290 TraceCheckUtils]: 13: Hoare triple {4917#(and (= main_~c~0 0) (= main_~y~0 0))} assume !!(#t~post5 < 10);havoc #t~post5; {4917#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-08 14:33:39,262 INFO L272 TraceCheckUtils]: 14: Hoare triple {4917#(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)); {4879#true} is VALID [2022-04-08 14:33:39,262 INFO L290 TraceCheckUtils]: 15: Hoare triple {4879#true} ~cond := #in~cond; {4879#true} is VALID [2022-04-08 14:33:39,262 INFO L290 TraceCheckUtils]: 16: Hoare triple {4879#true} assume !(0 == ~cond); {4879#true} is VALID [2022-04-08 14:33:39,262 INFO L290 TraceCheckUtils]: 17: Hoare triple {4879#true} assume true; {4879#true} is VALID [2022-04-08 14:33:39,263 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {4879#true} {4917#(and (= main_~c~0 0) (= main_~y~0 0))} #55#return; {4917#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-08 14:33:39,263 INFO L290 TraceCheckUtils]: 19: Hoare triple {4917#(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; {4942#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0) (< main_~c~0 (+ main_~k~0 1)))} is VALID [2022-04-08 14:33:39,264 INFO L290 TraceCheckUtils]: 20: Hoare triple {4942#(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; {4942#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0) (< main_~c~0 (+ main_~k~0 1)))} is VALID [2022-04-08 14:33:39,264 INFO L290 TraceCheckUtils]: 21: Hoare triple {4942#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0) (< main_~c~0 (+ main_~k~0 1)))} assume !!(#t~post5 < 10);havoc #t~post5; {4942#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0) (< main_~c~0 (+ main_~k~0 1)))} is VALID [2022-04-08 14:33:39,264 INFO L272 TraceCheckUtils]: 22: Hoare triple {4942#(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)); {4879#true} is VALID [2022-04-08 14:33:39,264 INFO L290 TraceCheckUtils]: 23: Hoare triple {4879#true} ~cond := #in~cond; {4879#true} is VALID [2022-04-08 14:33:39,264 INFO L290 TraceCheckUtils]: 24: Hoare triple {4879#true} assume !(0 == ~cond); {4879#true} is VALID [2022-04-08 14:33:39,264 INFO L290 TraceCheckUtils]: 25: Hoare triple {4879#true} assume true; {4879#true} is VALID [2022-04-08 14:33:39,267 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {4879#true} {4942#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0) (< main_~c~0 (+ main_~k~0 1)))} #55#return; {4942#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0) (< main_~c~0 (+ main_~k~0 1)))} is VALID [2022-04-08 14:33:39,268 INFO L290 TraceCheckUtils]: 27: Hoare triple {4942#(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; {4967#(and (= (+ (- 2) main_~y~0) 0) (= main_~c~0 2) (< 0 main_~k~0))} is VALID [2022-04-08 14:33:39,269 INFO L290 TraceCheckUtils]: 28: Hoare triple {4967#(and (= (+ (- 2) main_~y~0) 0) (= main_~c~0 2) (< 0 main_~k~0))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {4967#(and (= (+ (- 2) main_~y~0) 0) (= main_~c~0 2) (< 0 main_~k~0))} is VALID [2022-04-08 14:33:39,269 INFO L290 TraceCheckUtils]: 29: Hoare triple {4967#(and (= (+ (- 2) main_~y~0) 0) (= main_~c~0 2) (< 0 main_~k~0))} assume !!(#t~post5 < 10);havoc #t~post5; {4967#(and (= (+ (- 2) main_~y~0) 0) (= main_~c~0 2) (< 0 main_~k~0))} is VALID [2022-04-08 14:33:39,269 INFO L272 TraceCheckUtils]: 30: Hoare triple {4967#(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)); {4879#true} is VALID [2022-04-08 14:33:39,269 INFO L290 TraceCheckUtils]: 31: Hoare triple {4879#true} ~cond := #in~cond; {4879#true} is VALID [2022-04-08 14:33:39,269 INFO L290 TraceCheckUtils]: 32: Hoare triple {4879#true} assume !(0 == ~cond); {4879#true} is VALID [2022-04-08 14:33:39,270 INFO L290 TraceCheckUtils]: 33: Hoare triple {4879#true} assume true; {4879#true} is VALID [2022-04-08 14:33:39,270 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {4879#true} {4967#(and (= (+ (- 2) main_~y~0) 0) (= main_~c~0 2) (< 0 main_~k~0))} #55#return; {4967#(and (= (+ (- 2) main_~y~0) 0) (= main_~c~0 2) (< 0 main_~k~0))} is VALID [2022-04-08 14:33:39,271 INFO L290 TraceCheckUtils]: 35: Hoare triple {4967#(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; {4992#(and (= (+ main_~y~0 (- 3)) 0) (= (+ (- 1) main_~c~0) 2) (< 0 main_~k~0))} is VALID [2022-04-08 14:33:39,271 INFO L290 TraceCheckUtils]: 36: Hoare triple {4992#(and (= (+ main_~y~0 (- 3)) 0) (= (+ (- 1) main_~c~0) 2) (< 0 main_~k~0))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {4992#(and (= (+ main_~y~0 (- 3)) 0) (= (+ (- 1) main_~c~0) 2) (< 0 main_~k~0))} is VALID [2022-04-08 14:33:39,272 INFO L290 TraceCheckUtils]: 37: Hoare triple {4992#(and (= (+ main_~y~0 (- 3)) 0) (= (+ (- 1) main_~c~0) 2) (< 0 main_~k~0))} assume !!(#t~post5 < 10);havoc #t~post5; {4992#(and (= (+ main_~y~0 (- 3)) 0) (= (+ (- 1) main_~c~0) 2) (< 0 main_~k~0))} is VALID [2022-04-08 14:33:39,272 INFO L272 TraceCheckUtils]: 38: Hoare triple {4992#(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)); {4879#true} is VALID [2022-04-08 14:33:39,272 INFO L290 TraceCheckUtils]: 39: Hoare triple {4879#true} ~cond := #in~cond; {4879#true} is VALID [2022-04-08 14:33:39,272 INFO L290 TraceCheckUtils]: 40: Hoare triple {4879#true} assume !(0 == ~cond); {4879#true} is VALID [2022-04-08 14:33:39,272 INFO L290 TraceCheckUtils]: 41: Hoare triple {4879#true} assume true; {4879#true} is VALID [2022-04-08 14:33:39,273 INFO L284 TraceCheckUtils]: 42: Hoare quadruple {4879#true} {4992#(and (= (+ main_~y~0 (- 3)) 0) (= (+ (- 1) main_~c~0) 2) (< 0 main_~k~0))} #55#return; {4992#(and (= (+ main_~y~0 (- 3)) 0) (= (+ (- 1) main_~c~0) 2) (< 0 main_~k~0))} is VALID [2022-04-08 14:33:39,274 INFO L290 TraceCheckUtils]: 43: Hoare triple {4992#(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; {5017#(and (= main_~y~0 4) (< 3 main_~k~0) (<= main_~c~0 4))} is VALID [2022-04-08 14:33:39,274 INFO L290 TraceCheckUtils]: 44: Hoare triple {5017#(and (= main_~y~0 4) (< 3 main_~k~0) (<= main_~c~0 4))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {5017#(and (= main_~y~0 4) (< 3 main_~k~0) (<= main_~c~0 4))} is VALID [2022-04-08 14:33:39,275 INFO L290 TraceCheckUtils]: 45: Hoare triple {5017#(and (= main_~y~0 4) (< 3 main_~k~0) (<= main_~c~0 4))} assume !!(#t~post5 < 10);havoc #t~post5; {5017#(and (= main_~y~0 4) (< 3 main_~k~0) (<= main_~c~0 4))} is VALID [2022-04-08 14:33:39,275 INFO L272 TraceCheckUtils]: 46: Hoare triple {5017#(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)); {4879#true} is VALID [2022-04-08 14:33:39,275 INFO L290 TraceCheckUtils]: 47: Hoare triple {4879#true} ~cond := #in~cond; {4879#true} is VALID [2022-04-08 14:33:39,275 INFO L290 TraceCheckUtils]: 48: Hoare triple {4879#true} assume !(0 == ~cond); {4879#true} is VALID [2022-04-08 14:33:39,275 INFO L290 TraceCheckUtils]: 49: Hoare triple {4879#true} assume true; {4879#true} is VALID [2022-04-08 14:33:39,276 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {4879#true} {5017#(and (= main_~y~0 4) (< 3 main_~k~0) (<= main_~c~0 4))} #55#return; {5017#(and (= main_~y~0 4) (< 3 main_~k~0) (<= main_~c~0 4))} is VALID [2022-04-08 14:33:39,277 INFO L290 TraceCheckUtils]: 51: Hoare triple {5017#(and (= main_~y~0 4) (< 3 main_~k~0) (<= main_~c~0 4))} assume !(~c~0 < ~k~0); {5042#(and (= main_~y~0 4) (< 3 main_~k~0) (<= main_~k~0 4))} is VALID [2022-04-08 14:33:39,293 INFO L272 TraceCheckUtils]: 52: Hoare triple {5042#(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)); {4879#true} is VALID [2022-04-08 14:33:39,293 INFO L290 TraceCheckUtils]: 53: Hoare triple {4879#true} ~cond := #in~cond; {4879#true} is VALID [2022-04-08 14:33:39,294 INFO L290 TraceCheckUtils]: 54: Hoare triple {4879#true} assume !(0 == ~cond); {4879#true} is VALID [2022-04-08 14:33:39,294 INFO L290 TraceCheckUtils]: 55: Hoare triple {4879#true} assume true; {4879#true} is VALID [2022-04-08 14:33:39,295 INFO L284 TraceCheckUtils]: 56: Hoare quadruple {4879#true} {5042#(and (= main_~y~0 4) (< 3 main_~k~0) (<= main_~k~0 4))} #57#return; {5042#(and (= main_~y~0 4) (< 3 main_~k~0) (<= main_~k~0 4))} is VALID [2022-04-08 14:33:39,296 INFO L272 TraceCheckUtils]: 57: Hoare triple {5042#(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)); {5061#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 14:33:39,296 INFO L290 TraceCheckUtils]: 58: Hoare triple {5061#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {5065#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 14:33:39,296 INFO L290 TraceCheckUtils]: 59: Hoare triple {5065#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {4880#false} is VALID [2022-04-08 14:33:39,297 INFO L290 TraceCheckUtils]: 60: Hoare triple {4880#false} assume !false; {4880#false} is VALID [2022-04-08 14:33:39,297 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-08 14:33:39,297 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 14:33:39,871 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 14:33:39,871 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1197834536] [2022-04-08 14:33:39,871 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 14:33:39,871 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1371331501] [2022-04-08 14:33:39,871 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1371331501] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 14:33:39,871 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-08 14:33:39,871 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2022-04-08 14:33:39,872 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 14:33:39,872 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1532014128] [2022-04-08 14:33:39,872 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1532014128] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 14:33:39,872 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 14:33:39,872 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-04-08 14:33:39,872 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1020366649] [2022-04-08 14:33:39,872 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 14:33:39,872 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-08 14:33:39,872 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 14:33:39,873 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-08 14:33:39,908 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-08 14:33:39,908 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-04-08 14:33:39,908 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 14:33:39,909 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-04-08 14:33:39,909 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=188, Unknown=0, NotChecked=0, Total=240 [2022-04-08 14:33:39,909 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-08 14:33:40,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:33:40,447 INFO L93 Difference]: Finished difference Result 68 states and 72 transitions. [2022-04-08 14:33:40,447 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-04-08 14:33:40,447 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-08 14:33:40,447 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 14:33:40,447 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-08 14:33:40,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 59 transitions. [2022-04-08 14:33:40,449 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-08 14:33:40,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 59 transitions. [2022-04-08 14:33:40,450 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 10 states and 59 transitions. [2022-04-08 14:33:40,497 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-08 14:33:40,498 INFO L225 Difference]: With dead ends: 68 [2022-04-08 14:33:40,498 INFO L226 Difference]: Without dead ends: 62 [2022-04-08 14:33:40,499 INFO L912 BasicCegarLoop]: 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-08 14:33:40,499 INFO L913 BasicCegarLoop]: 43 mSDtfsCounter, 2 mSDsluCounter, 221 mSDsCounter, 0 mSdLazyCounter, 162 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 264 SdHoareTripleChecker+Invalid, 163 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 162 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-08 14:33:40,499 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [2 Valid, 264 Invalid, 163 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 162 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-08 14:33:40,500 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2022-04-08 14:33:40,568 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 62. [2022-04-08 14:33:40,568 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 14:33:40,568 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-08 14:33:40,568 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-08 14:33:40,569 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-08 14:33:40,570 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:33:40,570 INFO L93 Difference]: Finished difference Result 62 states and 65 transitions. [2022-04-08 14:33:40,570 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 65 transitions. [2022-04-08 14:33:40,571 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 14:33:40,571 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 14:33:40,571 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-08 14:33:40,571 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-08 14:33:40,572 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:33:40,572 INFO L93 Difference]: Finished difference Result 62 states and 65 transitions. [2022-04-08 14:33:40,572 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 65 transitions. [2022-04-08 14:33:40,572 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 14:33:40,573 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 14:33:40,573 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 14:33:40,573 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 14:33:40,573 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-08 14:33:40,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 65 transitions. [2022-04-08 14:33:40,574 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 65 transitions. Word has length 61 [2022-04-08 14:33:40,574 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 14:33:40,574 INFO L478 AbstractCegarLoop]: Abstraction has 62 states and 65 transitions. [2022-04-08 14:33:40,575 INFO L479 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-08 14:33:40,575 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 62 states and 65 transitions. [2022-04-08 14:33:45,059 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 65 edges. 64 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-08 14:33:45,060 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 65 transitions. [2022-04-08 14:33:45,060 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2022-04-08 14:33:45,061 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 14:33:45,061 INFO L499 BasicCegarLoop]: 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-08 14:33:45,067 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2022-04-08 14:33:45,261 WARN L460 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-08 14:33:45,261 INFO L403 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 14:33:45,262 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 14:33:45,262 INFO L85 PathProgramCache]: Analyzing trace with hash -1579977147, now seen corresponding path program 7 times [2022-04-08 14:33:45,262 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 14:33:45,262 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1794100605] [2022-04-08 14:33:45,391 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 14:33:45,391 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 14:33:45,391 INFO L85 PathProgramCache]: Analyzing trace with hash -1579977147, now seen corresponding path program 8 times [2022-04-08 14:33:45,391 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 14:33:45,391 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1406797318] [2022-04-08 14:33:45,392 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 14:33:45,392 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 14:33:45,404 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 14:33:45,404 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [41936513] [2022-04-08 14:33:45,405 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 14:33:45,405 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 14:33:45,405 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 14:33:45,406 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-08 14:33:45,422 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-08 14:33:45,467 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 14:33:45,467 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 14:33:45,468 INFO L263 TraceCheckSpWp]: Trace formula consists of 194 conjuncts, 15 conjunts are in the unsatisfiable core [2022-04-08 14:33:45,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 14:33:45,484 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 14:33:45,777 INFO L272 TraceCheckUtils]: 0: Hoare triple {5594#true} call ULTIMATE.init(); {5594#true} is VALID [2022-04-08 14:33:45,778 INFO L290 TraceCheckUtils]: 1: Hoare triple {5594#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; {5602#(<= ~counter~0 0)} is VALID [2022-04-08 14:33:45,778 INFO L290 TraceCheckUtils]: 2: Hoare triple {5602#(<= ~counter~0 0)} assume true; {5602#(<= ~counter~0 0)} is VALID [2022-04-08 14:33:45,778 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5602#(<= ~counter~0 0)} {5594#true} #61#return; {5602#(<= ~counter~0 0)} is VALID [2022-04-08 14:33:45,779 INFO L272 TraceCheckUtils]: 4: Hoare triple {5602#(<= ~counter~0 0)} call #t~ret6 := main(); {5602#(<= ~counter~0 0)} is VALID [2022-04-08 14:33:45,779 INFO L290 TraceCheckUtils]: 5: Hoare triple {5602#(<= ~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; {5602#(<= ~counter~0 0)} is VALID [2022-04-08 14:33:45,780 INFO L272 TraceCheckUtils]: 6: Hoare triple {5602#(<= ~counter~0 0)} call assume_abort_if_not((if ~k~0 <= 256 then 1 else 0)); {5602#(<= ~counter~0 0)} is VALID [2022-04-08 14:33:45,783 INFO L290 TraceCheckUtils]: 7: Hoare triple {5602#(<= ~counter~0 0)} ~cond := #in~cond; {5602#(<= ~counter~0 0)} is VALID [2022-04-08 14:33:45,784 INFO L290 TraceCheckUtils]: 8: Hoare triple {5602#(<= ~counter~0 0)} assume !(0 == ~cond); {5602#(<= ~counter~0 0)} is VALID [2022-04-08 14:33:45,784 INFO L290 TraceCheckUtils]: 9: Hoare triple {5602#(<= ~counter~0 0)} assume true; {5602#(<= ~counter~0 0)} is VALID [2022-04-08 14:33:45,785 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {5602#(<= ~counter~0 0)} {5602#(<= ~counter~0 0)} #53#return; {5602#(<= ~counter~0 0)} is VALID [2022-04-08 14:33:45,785 INFO L290 TraceCheckUtils]: 11: Hoare triple {5602#(<= ~counter~0 0)} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {5602#(<= ~counter~0 0)} is VALID [2022-04-08 14:33:45,786 INFO L290 TraceCheckUtils]: 12: Hoare triple {5602#(<= ~counter~0 0)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {5636#(<= ~counter~0 1)} is VALID [2022-04-08 14:33:45,786 INFO L290 TraceCheckUtils]: 13: Hoare triple {5636#(<= ~counter~0 1)} assume !!(#t~post5 < 10);havoc #t~post5; {5636#(<= ~counter~0 1)} is VALID [2022-04-08 14:33:45,787 INFO L272 TraceCheckUtils]: 14: Hoare triple {5636#(<= ~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)); {5636#(<= ~counter~0 1)} is VALID [2022-04-08 14:33:45,787 INFO L290 TraceCheckUtils]: 15: Hoare triple {5636#(<= ~counter~0 1)} ~cond := #in~cond; {5636#(<= ~counter~0 1)} is VALID [2022-04-08 14:33:45,787 INFO L290 TraceCheckUtils]: 16: Hoare triple {5636#(<= ~counter~0 1)} assume !(0 == ~cond); {5636#(<= ~counter~0 1)} is VALID [2022-04-08 14:33:45,788 INFO L290 TraceCheckUtils]: 17: Hoare triple {5636#(<= ~counter~0 1)} assume true; {5636#(<= ~counter~0 1)} is VALID [2022-04-08 14:33:45,788 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {5636#(<= ~counter~0 1)} {5636#(<= ~counter~0 1)} #55#return; {5636#(<= ~counter~0 1)} is VALID [2022-04-08 14:33:45,789 INFO L290 TraceCheckUtils]: 19: Hoare triple {5636#(<= ~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; {5636#(<= ~counter~0 1)} is VALID [2022-04-08 14:33:45,789 INFO L290 TraceCheckUtils]: 20: Hoare triple {5636#(<= ~counter~0 1)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {5661#(<= ~counter~0 2)} is VALID [2022-04-08 14:33:45,790 INFO L290 TraceCheckUtils]: 21: Hoare triple {5661#(<= ~counter~0 2)} assume !!(#t~post5 < 10);havoc #t~post5; {5661#(<= ~counter~0 2)} is VALID [2022-04-08 14:33:45,790 INFO L272 TraceCheckUtils]: 22: Hoare triple {5661#(<= ~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)); {5661#(<= ~counter~0 2)} is VALID [2022-04-08 14:33:45,791 INFO L290 TraceCheckUtils]: 23: Hoare triple {5661#(<= ~counter~0 2)} ~cond := #in~cond; {5661#(<= ~counter~0 2)} is VALID [2022-04-08 14:33:45,791 INFO L290 TraceCheckUtils]: 24: Hoare triple {5661#(<= ~counter~0 2)} assume !(0 == ~cond); {5661#(<= ~counter~0 2)} is VALID [2022-04-08 14:33:45,791 INFO L290 TraceCheckUtils]: 25: Hoare triple {5661#(<= ~counter~0 2)} assume true; {5661#(<= ~counter~0 2)} is VALID [2022-04-08 14:33:45,792 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {5661#(<= ~counter~0 2)} {5661#(<= ~counter~0 2)} #55#return; {5661#(<= ~counter~0 2)} is VALID [2022-04-08 14:33:45,792 INFO L290 TraceCheckUtils]: 27: Hoare triple {5661#(<= ~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; {5661#(<= ~counter~0 2)} is VALID [2022-04-08 14:33:45,793 INFO L290 TraceCheckUtils]: 28: Hoare triple {5661#(<= ~counter~0 2)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {5686#(<= ~counter~0 3)} is VALID [2022-04-08 14:33:45,793 INFO L290 TraceCheckUtils]: 29: Hoare triple {5686#(<= ~counter~0 3)} assume !!(#t~post5 < 10);havoc #t~post5; {5686#(<= ~counter~0 3)} is VALID [2022-04-08 14:33:45,794 INFO L272 TraceCheckUtils]: 30: Hoare triple {5686#(<= ~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)); {5686#(<= ~counter~0 3)} is VALID [2022-04-08 14:33:45,794 INFO L290 TraceCheckUtils]: 31: Hoare triple {5686#(<= ~counter~0 3)} ~cond := #in~cond; {5686#(<= ~counter~0 3)} is VALID [2022-04-08 14:33:45,795 INFO L290 TraceCheckUtils]: 32: Hoare triple {5686#(<= ~counter~0 3)} assume !(0 == ~cond); {5686#(<= ~counter~0 3)} is VALID [2022-04-08 14:33:45,795 INFO L290 TraceCheckUtils]: 33: Hoare triple {5686#(<= ~counter~0 3)} assume true; {5686#(<= ~counter~0 3)} is VALID [2022-04-08 14:33:45,796 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {5686#(<= ~counter~0 3)} {5686#(<= ~counter~0 3)} #55#return; {5686#(<= ~counter~0 3)} is VALID [2022-04-08 14:33:45,796 INFO L290 TraceCheckUtils]: 35: Hoare triple {5686#(<= ~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; {5686#(<= ~counter~0 3)} is VALID [2022-04-08 14:33:45,797 INFO L290 TraceCheckUtils]: 36: Hoare triple {5686#(<= ~counter~0 3)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {5711#(<= ~counter~0 4)} is VALID [2022-04-08 14:33:45,797 INFO L290 TraceCheckUtils]: 37: Hoare triple {5711#(<= ~counter~0 4)} assume !!(#t~post5 < 10);havoc #t~post5; {5711#(<= ~counter~0 4)} is VALID [2022-04-08 14:33:45,798 INFO L272 TraceCheckUtils]: 38: Hoare triple {5711#(<= ~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)); {5711#(<= ~counter~0 4)} is VALID [2022-04-08 14:33:45,798 INFO L290 TraceCheckUtils]: 39: Hoare triple {5711#(<= ~counter~0 4)} ~cond := #in~cond; {5711#(<= ~counter~0 4)} is VALID [2022-04-08 14:33:45,798 INFO L290 TraceCheckUtils]: 40: Hoare triple {5711#(<= ~counter~0 4)} assume !(0 == ~cond); {5711#(<= ~counter~0 4)} is VALID [2022-04-08 14:33:45,799 INFO L290 TraceCheckUtils]: 41: Hoare triple {5711#(<= ~counter~0 4)} assume true; {5711#(<= ~counter~0 4)} is VALID [2022-04-08 14:33:45,799 INFO L284 TraceCheckUtils]: 42: Hoare quadruple {5711#(<= ~counter~0 4)} {5711#(<= ~counter~0 4)} #55#return; {5711#(<= ~counter~0 4)} is VALID [2022-04-08 14:33:45,800 INFO L290 TraceCheckUtils]: 43: Hoare triple {5711#(<= ~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; {5711#(<= ~counter~0 4)} is VALID [2022-04-08 14:33:45,800 INFO L290 TraceCheckUtils]: 44: Hoare triple {5711#(<= ~counter~0 4)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {5736#(<= ~counter~0 5)} is VALID [2022-04-08 14:33:45,801 INFO L290 TraceCheckUtils]: 45: Hoare triple {5736#(<= ~counter~0 5)} assume !!(#t~post5 < 10);havoc #t~post5; {5736#(<= ~counter~0 5)} is VALID [2022-04-08 14:33:45,801 INFO L272 TraceCheckUtils]: 46: Hoare triple {5736#(<= ~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)); {5736#(<= ~counter~0 5)} is VALID [2022-04-08 14:33:45,802 INFO L290 TraceCheckUtils]: 47: Hoare triple {5736#(<= ~counter~0 5)} ~cond := #in~cond; {5736#(<= ~counter~0 5)} is VALID [2022-04-08 14:33:45,802 INFO L290 TraceCheckUtils]: 48: Hoare triple {5736#(<= ~counter~0 5)} assume !(0 == ~cond); {5736#(<= ~counter~0 5)} is VALID [2022-04-08 14:33:45,802 INFO L290 TraceCheckUtils]: 49: Hoare triple {5736#(<= ~counter~0 5)} assume true; {5736#(<= ~counter~0 5)} is VALID [2022-04-08 14:33:45,803 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {5736#(<= ~counter~0 5)} {5736#(<= ~counter~0 5)} #55#return; {5736#(<= ~counter~0 5)} is VALID [2022-04-08 14:33:45,803 INFO L290 TraceCheckUtils]: 51: Hoare triple {5736#(<= ~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; {5736#(<= ~counter~0 5)} is VALID [2022-04-08 14:33:45,804 INFO L290 TraceCheckUtils]: 52: Hoare triple {5736#(<= ~counter~0 5)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {5761#(<= |main_#t~post5| 5)} is VALID [2022-04-08 14:33:45,804 INFO L290 TraceCheckUtils]: 53: Hoare triple {5761#(<= |main_#t~post5| 5)} assume !(#t~post5 < 10);havoc #t~post5; {5595#false} is VALID [2022-04-08 14:33:45,804 INFO L272 TraceCheckUtils]: 54: Hoare triple {5595#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)); {5595#false} is VALID [2022-04-08 14:33:45,804 INFO L290 TraceCheckUtils]: 55: Hoare triple {5595#false} ~cond := #in~cond; {5595#false} is VALID [2022-04-08 14:33:45,805 INFO L290 TraceCheckUtils]: 56: Hoare triple {5595#false} assume !(0 == ~cond); {5595#false} is VALID [2022-04-08 14:33:45,805 INFO L290 TraceCheckUtils]: 57: Hoare triple {5595#false} assume true; {5595#false} is VALID [2022-04-08 14:33:45,805 INFO L284 TraceCheckUtils]: 58: Hoare quadruple {5595#false} {5595#false} #57#return; {5595#false} is VALID [2022-04-08 14:33:45,805 INFO L272 TraceCheckUtils]: 59: Hoare triple {5595#false} call __VERIFIER_assert((if ~k~0 * ~y~0 == ~y~0 * ~y~0 then 1 else 0)); {5595#false} is VALID [2022-04-08 14:33:45,805 INFO L290 TraceCheckUtils]: 60: Hoare triple {5595#false} ~cond := #in~cond; {5595#false} is VALID [2022-04-08 14:33:45,805 INFO L290 TraceCheckUtils]: 61: Hoare triple {5595#false} assume 0 == ~cond; {5595#false} is VALID [2022-04-08 14:33:45,805 INFO L290 TraceCheckUtils]: 62: Hoare triple {5595#false} assume !false; {5595#false} is VALID [2022-04-08 14:33:45,805 INFO L134 CoverageAnalysis]: Checked inductivity of 122 backedges. 30 proven. 90 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-08 14:33:45,806 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 14:33:46,113 INFO L290 TraceCheckUtils]: 62: Hoare triple {5595#false} assume !false; {5595#false} is VALID [2022-04-08 14:33:46,113 INFO L290 TraceCheckUtils]: 61: Hoare triple {5595#false} assume 0 == ~cond; {5595#false} is VALID [2022-04-08 14:33:46,113 INFO L290 TraceCheckUtils]: 60: Hoare triple {5595#false} ~cond := #in~cond; {5595#false} is VALID [2022-04-08 14:33:46,113 INFO L272 TraceCheckUtils]: 59: Hoare triple {5595#false} call __VERIFIER_assert((if ~k~0 * ~y~0 == ~y~0 * ~y~0 then 1 else 0)); {5595#false} is VALID [2022-04-08 14:33:46,113 INFO L284 TraceCheckUtils]: 58: Hoare quadruple {5594#true} {5595#false} #57#return; {5595#false} is VALID [2022-04-08 14:33:46,113 INFO L290 TraceCheckUtils]: 57: Hoare triple {5594#true} assume true; {5594#true} is VALID [2022-04-08 14:33:46,113 INFO L290 TraceCheckUtils]: 56: Hoare triple {5594#true} assume !(0 == ~cond); {5594#true} is VALID [2022-04-08 14:33:46,114 INFO L290 TraceCheckUtils]: 55: Hoare triple {5594#true} ~cond := #in~cond; {5594#true} is VALID [2022-04-08 14:33:46,114 INFO L272 TraceCheckUtils]: 54: Hoare triple {5595#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)); {5594#true} is VALID [2022-04-08 14:33:46,114 INFO L290 TraceCheckUtils]: 53: Hoare triple {5819#(< |main_#t~post5| 10)} assume !(#t~post5 < 10);havoc #t~post5; {5595#false} is VALID [2022-04-08 14:33:46,114 INFO L290 TraceCheckUtils]: 52: Hoare triple {5823#(< ~counter~0 10)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {5819#(< |main_#t~post5| 10)} is VALID [2022-04-08 14:33:46,115 INFO L290 TraceCheckUtils]: 51: Hoare triple {5823#(< ~counter~0 10)} 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; {5823#(< ~counter~0 10)} is VALID [2022-04-08 14:33:46,115 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {5594#true} {5823#(< ~counter~0 10)} #55#return; {5823#(< ~counter~0 10)} is VALID [2022-04-08 14:33:46,115 INFO L290 TraceCheckUtils]: 49: Hoare triple {5594#true} assume true; {5594#true} is VALID [2022-04-08 14:33:46,115 INFO L290 TraceCheckUtils]: 48: Hoare triple {5594#true} assume !(0 == ~cond); {5594#true} is VALID [2022-04-08 14:33:46,115 INFO L290 TraceCheckUtils]: 47: Hoare triple {5594#true} ~cond := #in~cond; {5594#true} is VALID [2022-04-08 14:33:46,115 INFO L272 TraceCheckUtils]: 46: Hoare triple {5823#(< ~counter~0 10)} 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)); {5594#true} is VALID [2022-04-08 14:33:46,116 INFO L290 TraceCheckUtils]: 45: Hoare triple {5823#(< ~counter~0 10)} assume !!(#t~post5 < 10);havoc #t~post5; {5823#(< ~counter~0 10)} is VALID [2022-04-08 14:33:46,116 INFO L290 TraceCheckUtils]: 44: Hoare triple {5848#(< ~counter~0 9)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {5823#(< ~counter~0 10)} is VALID [2022-04-08 14:33:46,116 INFO L290 TraceCheckUtils]: 43: Hoare triple {5848#(< ~counter~0 9)} 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; {5848#(< ~counter~0 9)} is VALID [2022-04-08 14:33:46,117 INFO L284 TraceCheckUtils]: 42: Hoare quadruple {5594#true} {5848#(< ~counter~0 9)} #55#return; {5848#(< ~counter~0 9)} is VALID [2022-04-08 14:33:46,117 INFO L290 TraceCheckUtils]: 41: Hoare triple {5594#true} assume true; {5594#true} is VALID [2022-04-08 14:33:46,117 INFO L290 TraceCheckUtils]: 40: Hoare triple {5594#true} assume !(0 == ~cond); {5594#true} is VALID [2022-04-08 14:33:46,117 INFO L290 TraceCheckUtils]: 39: Hoare triple {5594#true} ~cond := #in~cond; {5594#true} is VALID [2022-04-08 14:33:46,117 INFO L272 TraceCheckUtils]: 38: Hoare triple {5848#(< ~counter~0 9)} 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)); {5594#true} is VALID [2022-04-08 14:33:46,117 INFO L290 TraceCheckUtils]: 37: Hoare triple {5848#(< ~counter~0 9)} assume !!(#t~post5 < 10);havoc #t~post5; {5848#(< ~counter~0 9)} is VALID [2022-04-08 14:33:46,118 INFO L290 TraceCheckUtils]: 36: Hoare triple {5873#(< ~counter~0 8)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {5848#(< ~counter~0 9)} is VALID [2022-04-08 14:33:46,118 INFO L290 TraceCheckUtils]: 35: Hoare triple {5873#(< ~counter~0 8)} 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; {5873#(< ~counter~0 8)} is VALID [2022-04-08 14:33:46,119 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {5594#true} {5873#(< ~counter~0 8)} #55#return; {5873#(< ~counter~0 8)} is VALID [2022-04-08 14:33:46,119 INFO L290 TraceCheckUtils]: 33: Hoare triple {5594#true} assume true; {5594#true} is VALID [2022-04-08 14:33:46,119 INFO L290 TraceCheckUtils]: 32: Hoare triple {5594#true} assume !(0 == ~cond); {5594#true} is VALID [2022-04-08 14:33:46,119 INFO L290 TraceCheckUtils]: 31: Hoare triple {5594#true} ~cond := #in~cond; {5594#true} is VALID [2022-04-08 14:33:46,119 INFO L272 TraceCheckUtils]: 30: Hoare triple {5873#(< ~counter~0 8)} 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)); {5594#true} is VALID [2022-04-08 14:33:46,119 INFO L290 TraceCheckUtils]: 29: Hoare triple {5873#(< ~counter~0 8)} assume !!(#t~post5 < 10);havoc #t~post5; {5873#(< ~counter~0 8)} is VALID [2022-04-08 14:33:46,120 INFO L290 TraceCheckUtils]: 28: Hoare triple {5898#(< ~counter~0 7)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {5873#(< ~counter~0 8)} is VALID [2022-04-08 14:33:46,120 INFO L290 TraceCheckUtils]: 27: Hoare triple {5898#(< ~counter~0 7)} 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; {5898#(< ~counter~0 7)} is VALID [2022-04-08 14:33:46,120 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {5594#true} {5898#(< ~counter~0 7)} #55#return; {5898#(< ~counter~0 7)} is VALID [2022-04-08 14:33:46,120 INFO L290 TraceCheckUtils]: 25: Hoare triple {5594#true} assume true; {5594#true} is VALID [2022-04-08 14:33:46,121 INFO L290 TraceCheckUtils]: 24: Hoare triple {5594#true} assume !(0 == ~cond); {5594#true} is VALID [2022-04-08 14:33:46,121 INFO L290 TraceCheckUtils]: 23: Hoare triple {5594#true} ~cond := #in~cond; {5594#true} is VALID [2022-04-08 14:33:46,121 INFO L272 TraceCheckUtils]: 22: Hoare triple {5898#(< ~counter~0 7)} 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)); {5594#true} is VALID [2022-04-08 14:33:46,121 INFO L290 TraceCheckUtils]: 21: Hoare triple {5898#(< ~counter~0 7)} assume !!(#t~post5 < 10);havoc #t~post5; {5898#(< ~counter~0 7)} is VALID [2022-04-08 14:33:46,121 INFO L290 TraceCheckUtils]: 20: Hoare triple {5736#(<= ~counter~0 5)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {5898#(< ~counter~0 7)} is VALID [2022-04-08 14:33:46,122 INFO L290 TraceCheckUtils]: 19: Hoare triple {5736#(<= ~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; {5736#(<= ~counter~0 5)} is VALID [2022-04-08 14:33:46,122 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {5594#true} {5736#(<= ~counter~0 5)} #55#return; {5736#(<= ~counter~0 5)} is VALID [2022-04-08 14:33:46,122 INFO L290 TraceCheckUtils]: 17: Hoare triple {5594#true} assume true; {5594#true} is VALID [2022-04-08 14:33:46,122 INFO L290 TraceCheckUtils]: 16: Hoare triple {5594#true} assume !(0 == ~cond); {5594#true} is VALID [2022-04-08 14:33:46,122 INFO L290 TraceCheckUtils]: 15: Hoare triple {5594#true} ~cond := #in~cond; {5594#true} is VALID [2022-04-08 14:33:46,122 INFO L272 TraceCheckUtils]: 14: Hoare triple {5736#(<= ~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)); {5594#true} is VALID [2022-04-08 14:33:46,123 INFO L290 TraceCheckUtils]: 13: Hoare triple {5736#(<= ~counter~0 5)} assume !!(#t~post5 < 10);havoc #t~post5; {5736#(<= ~counter~0 5)} is VALID [2022-04-08 14:33:46,123 INFO L290 TraceCheckUtils]: 12: Hoare triple {5711#(<= ~counter~0 4)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {5736#(<= ~counter~0 5)} is VALID [2022-04-08 14:33:46,123 INFO L290 TraceCheckUtils]: 11: Hoare triple {5711#(<= ~counter~0 4)} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {5711#(<= ~counter~0 4)} is VALID [2022-04-08 14:33:46,124 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {5594#true} {5711#(<= ~counter~0 4)} #53#return; {5711#(<= ~counter~0 4)} is VALID [2022-04-08 14:33:46,124 INFO L290 TraceCheckUtils]: 9: Hoare triple {5594#true} assume true; {5594#true} is VALID [2022-04-08 14:33:46,124 INFO L290 TraceCheckUtils]: 8: Hoare triple {5594#true} assume !(0 == ~cond); {5594#true} is VALID [2022-04-08 14:33:46,124 INFO L290 TraceCheckUtils]: 7: Hoare triple {5594#true} ~cond := #in~cond; {5594#true} is VALID [2022-04-08 14:33:46,124 INFO L272 TraceCheckUtils]: 6: Hoare triple {5711#(<= ~counter~0 4)} call assume_abort_if_not((if ~k~0 <= 256 then 1 else 0)); {5594#true} is VALID [2022-04-08 14:33:46,124 INFO L290 TraceCheckUtils]: 5: Hoare triple {5711#(<= ~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; {5711#(<= ~counter~0 4)} is VALID [2022-04-08 14:33:46,130 INFO L272 TraceCheckUtils]: 4: Hoare triple {5711#(<= ~counter~0 4)} call #t~ret6 := main(); {5711#(<= ~counter~0 4)} is VALID [2022-04-08 14:33:46,130 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5711#(<= ~counter~0 4)} {5594#true} #61#return; {5711#(<= ~counter~0 4)} is VALID [2022-04-08 14:33:46,131 INFO L290 TraceCheckUtils]: 2: Hoare triple {5711#(<= ~counter~0 4)} assume true; {5711#(<= ~counter~0 4)} is VALID [2022-04-08 14:33:46,131 INFO L290 TraceCheckUtils]: 1: Hoare triple {5594#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; {5711#(<= ~counter~0 4)} is VALID [2022-04-08 14:33:46,131 INFO L272 TraceCheckUtils]: 0: Hoare triple {5594#true} call ULTIMATE.init(); {5594#true} is VALID [2022-04-08 14:33:46,132 INFO L134 CoverageAnalysis]: Checked inductivity of 122 backedges. 12 proven. 50 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2022-04-08 14:33:46,132 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 14:33:46,132 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1406797318] [2022-04-08 14:33:46,132 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 14:33:46,132 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [41936513] [2022-04-08 14:33:46,132 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [41936513] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 14:33:46,132 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-08 14:33:46,133 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 14 [2022-04-08 14:33:46,133 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 14:33:46,133 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1794100605] [2022-04-08 14:33:46,133 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1794100605] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 14:33:46,133 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 14:33:46,133 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-04-08 14:33:46,133 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1141947042] [2022-04-08 14:33:46,133 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 14:33:46,134 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.888888888888889) internal successors, (44), 8 states have internal predecessors, (44), 8 states have call successors, (10), 8 states have call predecessors, (10), 7 states have return successors, (8), 7 states have call predecessors, (8), 8 states have call successors, (8) Word has length 63 [2022-04-08 14:33:46,134 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 14:33:46,134 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 9 states, 9 states have (on average 4.888888888888889) internal successors, (44), 8 states have internal predecessors, (44), 8 states have call successors, (10), 8 states have call predecessors, (10), 7 states have return successors, (8), 7 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-08 14:33:46,185 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-08 14:33:46,185 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-04-08 14:33:46,185 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 14:33:46,185 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-04-08 14:33:46,185 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=111, Unknown=0, NotChecked=0, Total=182 [2022-04-08 14:33:46,186 INFO L87 Difference]: Start difference. First operand 62 states and 65 transitions. Second operand has 9 states, 9 states have (on average 4.888888888888889) internal successors, (44), 8 states have internal predecessors, (44), 8 states have call successors, (10), 8 states have call predecessors, (10), 7 states have return successors, (8), 7 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-08 14:33:46,414 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:33:46,414 INFO L93 Difference]: Finished difference Result 78 states and 80 transitions. [2022-04-08 14:33:46,415 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-04-08 14:33:46,415 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.888888888888889) internal successors, (44), 8 states have internal predecessors, (44), 8 states have call successors, (10), 8 states have call predecessors, (10), 7 states have return successors, (8), 7 states have call predecessors, (8), 8 states have call successors, (8) Word has length 63 [2022-04-08 14:33:46,415 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 14:33:46,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 4.888888888888889) internal successors, (44), 8 states have internal predecessors, (44), 8 states have call successors, (10), 8 states have call predecessors, (10), 7 states have return successors, (8), 7 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-08 14:33:46,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 78 transitions. [2022-04-08 14:33:46,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 4.888888888888889) internal successors, (44), 8 states have internal predecessors, (44), 8 states have call successors, (10), 8 states have call predecessors, (10), 7 states have return successors, (8), 7 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-08 14:33:46,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 78 transitions. [2022-04-08 14:33:46,418 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 14 states and 78 transitions. [2022-04-08 14:33:46,472 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 78 edges. 78 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 14:33:46,473 INFO L225 Difference]: With dead ends: 78 [2022-04-08 14:33:46,473 INFO L226 Difference]: Without dead ends: 68 [2022-04-08 14:33:46,473 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 112 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=136, Invalid=206, Unknown=0, NotChecked=0, Total=342 [2022-04-08 14:33:46,474 INFO L913 BasicCegarLoop]: 30 mSDtfsCounter, 12 mSDsluCounter, 81 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 111 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-08 14:33:46,474 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [12 Valid, 111 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-08 14:33:46,475 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2022-04-08 14:33:46,548 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2022-04-08 14:33:46,549 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 14:33:46,549 INFO L82 GeneralOperation]: Start isEquivalent. First operand 68 states. Second operand has 68 states, 48 states have (on average 1.0416666666666667) internal successors, (50), 48 states have internal predecessors, (50), 11 states have call successors, (11), 10 states have call predecessors, (11), 8 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-08 14:33:46,549 INFO L74 IsIncluded]: Start isIncluded. First operand 68 states. Second operand has 68 states, 48 states have (on average 1.0416666666666667) internal successors, (50), 48 states have internal predecessors, (50), 11 states have call successors, (11), 10 states have call predecessors, (11), 8 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-08 14:33:46,550 INFO L87 Difference]: Start difference. First operand 68 states. Second operand has 68 states, 48 states have (on average 1.0416666666666667) internal successors, (50), 48 states have internal predecessors, (50), 11 states have call successors, (11), 10 states have call predecessors, (11), 8 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-08 14:33:46,551 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:33:46,551 INFO L93 Difference]: Finished difference Result 68 states and 70 transitions. [2022-04-08 14:33:46,551 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 70 transitions. [2022-04-08 14:33:46,552 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 14:33:46,553 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 14:33:46,553 INFO L74 IsIncluded]: Start isIncluded. First operand has 68 states, 48 states have (on average 1.0416666666666667) internal successors, (50), 48 states have internal predecessors, (50), 11 states have call successors, (11), 10 states have call predecessors, (11), 8 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) Second operand 68 states. [2022-04-08 14:33:46,553 INFO L87 Difference]: Start difference. First operand has 68 states, 48 states have (on average 1.0416666666666667) internal successors, (50), 48 states have internal predecessors, (50), 11 states have call successors, (11), 10 states have call predecessors, (11), 8 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) Second operand 68 states. [2022-04-08 14:33:46,556 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:33:46,557 INFO L93 Difference]: Finished difference Result 68 states and 70 transitions. [2022-04-08 14:33:46,557 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 70 transitions. [2022-04-08 14:33:46,557 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 14:33:46,557 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 14:33:46,557 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 14:33:46,557 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 14:33:46,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 48 states have (on average 1.0416666666666667) internal successors, (50), 48 states have internal predecessors, (50), 11 states have call successors, (11), 10 states have call predecessors, (11), 8 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-08 14:33:46,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 70 transitions. [2022-04-08 14:33:46,559 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 70 transitions. Word has length 63 [2022-04-08 14:33:46,559 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 14:33:46,559 INFO L478 AbstractCegarLoop]: Abstraction has 68 states and 70 transitions. [2022-04-08 14:33:46,560 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.888888888888889) internal successors, (44), 8 states have internal predecessors, (44), 8 states have call successors, (10), 8 states have call predecessors, (10), 7 states have return successors, (8), 7 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-08 14:33:46,560 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 68 states and 70 transitions. [2022-04-08 14:33:50,833 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 70 edges. 69 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-08 14:33:50,834 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 70 transitions. [2022-04-08 14:33:50,834 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2022-04-08 14:33:50,834 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 14:33:50,834 INFO L499 BasicCegarLoop]: trace histogram [8, 7, 7, 6, 6, 6, 6, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 14:33:50,855 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-08 14:33:51,035 WARN L460 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-08 14:33:51,035 INFO L403 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 14:33:51,035 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 14:33:51,035 INFO L85 PathProgramCache]: Analyzing trace with hash -423798549, now seen corresponding path program 9 times [2022-04-08 14:33:51,036 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 14:33:51,036 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1693952611] [2022-04-08 14:33:51,155 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 14:33:51,155 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 14:33:51,156 INFO L85 PathProgramCache]: Analyzing trace with hash -423798549, now seen corresponding path program 10 times [2022-04-08 14:33:51,156 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 14:33:51,156 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [164615906] [2022-04-08 14:33:51,156 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 14:33:51,156 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 14:33:51,169 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 14:33:51,169 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2139774725] [2022-04-08 14:33:51,169 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-08 14:33:51,169 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 14:33:51,170 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 14:33:51,172 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 14:33:51,176 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2022-04-08 14:33:51,214 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-08 14:33:51,214 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 14:33:51,215 INFO L263 TraceCheckSpWp]: Trace formula consists of 143 conjuncts, 28 conjunts are in the unsatisfiable core [2022-04-08 14:33:51,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 14:33:51,228 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 14:33:51,615 INFO L272 TraceCheckUtils]: 0: Hoare triple {6423#true} call ULTIMATE.init(); {6423#true} is VALID [2022-04-08 14:33:51,615 INFO L290 TraceCheckUtils]: 1: Hoare triple {6423#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; {6423#true} is VALID [2022-04-08 14:33:51,615 INFO L290 TraceCheckUtils]: 2: Hoare triple {6423#true} assume true; {6423#true} is VALID [2022-04-08 14:33:51,615 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6423#true} {6423#true} #61#return; {6423#true} is VALID [2022-04-08 14:33:51,615 INFO L272 TraceCheckUtils]: 4: Hoare triple {6423#true} call #t~ret6 := main(); {6423#true} is VALID [2022-04-08 14:33:51,616 INFO L290 TraceCheckUtils]: 5: Hoare triple {6423#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; {6423#true} is VALID [2022-04-08 14:33:51,616 INFO L272 TraceCheckUtils]: 6: Hoare triple {6423#true} call assume_abort_if_not((if ~k~0 <= 256 then 1 else 0)); {6423#true} is VALID [2022-04-08 14:33:51,616 INFO L290 TraceCheckUtils]: 7: Hoare triple {6423#true} ~cond := #in~cond; {6423#true} is VALID [2022-04-08 14:33:51,616 INFO L290 TraceCheckUtils]: 8: Hoare triple {6423#true} assume !(0 == ~cond); {6423#true} is VALID [2022-04-08 14:33:51,616 INFO L290 TraceCheckUtils]: 9: Hoare triple {6423#true} assume true; {6423#true} is VALID [2022-04-08 14:33:51,616 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {6423#true} {6423#true} #53#return; {6423#true} is VALID [2022-04-08 14:33:51,619 INFO L290 TraceCheckUtils]: 11: Hoare triple {6423#true} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {6461#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-08 14:33:51,620 INFO L290 TraceCheckUtils]: 12: Hoare triple {6461#(and (= main_~c~0 0) (= main_~y~0 0))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {6461#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-08 14:33:51,620 INFO L290 TraceCheckUtils]: 13: Hoare triple {6461#(and (= main_~c~0 0) (= main_~y~0 0))} assume !!(#t~post5 < 10);havoc #t~post5; {6461#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-08 14:33:51,620 INFO L272 TraceCheckUtils]: 14: Hoare triple {6461#(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)); {6423#true} is VALID [2022-04-08 14:33:51,620 INFO L290 TraceCheckUtils]: 15: Hoare triple {6423#true} ~cond := #in~cond; {6423#true} is VALID [2022-04-08 14:33:51,621 INFO L290 TraceCheckUtils]: 16: Hoare triple {6423#true} assume !(0 == ~cond); {6423#true} is VALID [2022-04-08 14:33:51,621 INFO L290 TraceCheckUtils]: 17: Hoare triple {6423#true} assume true; {6423#true} is VALID [2022-04-08 14:33:51,621 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {6423#true} {6461#(and (= main_~c~0 0) (= main_~y~0 0))} #55#return; {6461#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-08 14:33:51,622 INFO L290 TraceCheckUtils]: 19: Hoare triple {6461#(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; {6486#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} is VALID [2022-04-08 14:33:51,622 INFO L290 TraceCheckUtils]: 20: Hoare triple {6486#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {6486#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} is VALID [2022-04-08 14:33:51,623 INFO L290 TraceCheckUtils]: 21: Hoare triple {6486#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} assume !!(#t~post5 < 10);havoc #t~post5; {6486#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} is VALID [2022-04-08 14:33:51,623 INFO L272 TraceCheckUtils]: 22: Hoare triple {6486#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~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)); {6423#true} is VALID [2022-04-08 14:33:51,623 INFO L290 TraceCheckUtils]: 23: Hoare triple {6423#true} ~cond := #in~cond; {6423#true} is VALID [2022-04-08 14:33:51,623 INFO L290 TraceCheckUtils]: 24: Hoare triple {6423#true} assume !(0 == ~cond); {6423#true} is VALID [2022-04-08 14:33:51,623 INFO L290 TraceCheckUtils]: 25: Hoare triple {6423#true} assume true; {6423#true} is VALID [2022-04-08 14:33:51,624 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {6423#true} {6486#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} #55#return; {6486#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} is VALID [2022-04-08 14:33:51,624 INFO L290 TraceCheckUtils]: 27: Hoare triple {6486#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~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; {6511#(and (= (+ (- 2) main_~y~0) 0) (= main_~c~0 2))} is VALID [2022-04-08 14:33:51,625 INFO L290 TraceCheckUtils]: 28: Hoare triple {6511#(and (= (+ (- 2) main_~y~0) 0) (= main_~c~0 2))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {6511#(and (= (+ (- 2) main_~y~0) 0) (= main_~c~0 2))} is VALID [2022-04-08 14:33:51,625 INFO L290 TraceCheckUtils]: 29: Hoare triple {6511#(and (= (+ (- 2) main_~y~0) 0) (= main_~c~0 2))} assume !!(#t~post5 < 10);havoc #t~post5; {6511#(and (= (+ (- 2) main_~y~0) 0) (= main_~c~0 2))} is VALID [2022-04-08 14:33:51,625 INFO L272 TraceCheckUtils]: 30: Hoare triple {6511#(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)); {6423#true} is VALID [2022-04-08 14:33:51,625 INFO L290 TraceCheckUtils]: 31: Hoare triple {6423#true} ~cond := #in~cond; {6423#true} is VALID [2022-04-08 14:33:51,625 INFO L290 TraceCheckUtils]: 32: Hoare triple {6423#true} assume !(0 == ~cond); {6423#true} is VALID [2022-04-08 14:33:51,626 INFO L290 TraceCheckUtils]: 33: Hoare triple {6423#true} assume true; {6423#true} is VALID [2022-04-08 14:33:51,626 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {6423#true} {6511#(and (= (+ (- 2) main_~y~0) 0) (= main_~c~0 2))} #55#return; {6511#(and (= (+ (- 2) main_~y~0) 0) (= main_~c~0 2))} is VALID [2022-04-08 14:33:51,627 INFO L290 TraceCheckUtils]: 35: Hoare triple {6511#(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; {6536#(and (= main_~y~0 3) (= (+ (- 1) main_~c~0) 2))} is VALID [2022-04-08 14:33:51,627 INFO L290 TraceCheckUtils]: 36: Hoare triple {6536#(and (= main_~y~0 3) (= (+ (- 1) main_~c~0) 2))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {6536#(and (= main_~y~0 3) (= (+ (- 1) main_~c~0) 2))} is VALID [2022-04-08 14:33:51,627 INFO L290 TraceCheckUtils]: 37: Hoare triple {6536#(and (= main_~y~0 3) (= (+ (- 1) main_~c~0) 2))} assume !!(#t~post5 < 10);havoc #t~post5; {6536#(and (= main_~y~0 3) (= (+ (- 1) main_~c~0) 2))} is VALID [2022-04-08 14:33:51,628 INFO L272 TraceCheckUtils]: 38: Hoare triple {6536#(and (= main_~y~0 3) (= (+ (- 1) main_~c~0) 2))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {6423#true} is VALID [2022-04-08 14:33:51,628 INFO L290 TraceCheckUtils]: 39: Hoare triple {6423#true} ~cond := #in~cond; {6423#true} is VALID [2022-04-08 14:33:51,628 INFO L290 TraceCheckUtils]: 40: Hoare triple {6423#true} assume !(0 == ~cond); {6423#true} is VALID [2022-04-08 14:33:51,628 INFO L290 TraceCheckUtils]: 41: Hoare triple {6423#true} assume true; {6423#true} is VALID [2022-04-08 14:33:51,628 INFO L284 TraceCheckUtils]: 42: Hoare quadruple {6423#true} {6536#(and (= main_~y~0 3) (= (+ (- 1) main_~c~0) 2))} #55#return; {6536#(and (= main_~y~0 3) (= (+ (- 1) main_~c~0) 2))} is VALID [2022-04-08 14:33:51,629 INFO L290 TraceCheckUtils]: 43: Hoare triple {6536#(and (= main_~y~0 3) (= (+ (- 1) 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; {6561#(and (= 3 (+ (- 1) main_~y~0)) (= main_~c~0 4))} is VALID [2022-04-08 14:33:51,629 INFO L290 TraceCheckUtils]: 44: Hoare triple {6561#(and (= 3 (+ (- 1) main_~y~0)) (= main_~c~0 4))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {6561#(and (= 3 (+ (- 1) main_~y~0)) (= main_~c~0 4))} is VALID [2022-04-08 14:33:51,629 INFO L290 TraceCheckUtils]: 45: Hoare triple {6561#(and (= 3 (+ (- 1) main_~y~0)) (= main_~c~0 4))} assume !!(#t~post5 < 10);havoc #t~post5; {6561#(and (= 3 (+ (- 1) main_~y~0)) (= main_~c~0 4))} is VALID [2022-04-08 14:33:51,630 INFO L272 TraceCheckUtils]: 46: Hoare triple {6561#(and (= 3 (+ (- 1) main_~y~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)); {6423#true} is VALID [2022-04-08 14:33:51,630 INFO L290 TraceCheckUtils]: 47: Hoare triple {6423#true} ~cond := #in~cond; {6423#true} is VALID [2022-04-08 14:33:51,630 INFO L290 TraceCheckUtils]: 48: Hoare triple {6423#true} assume !(0 == ~cond); {6423#true} is VALID [2022-04-08 14:33:51,630 INFO L290 TraceCheckUtils]: 49: Hoare triple {6423#true} assume true; {6423#true} is VALID [2022-04-08 14:33:51,630 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {6423#true} {6561#(and (= 3 (+ (- 1) main_~y~0)) (= main_~c~0 4))} #55#return; {6561#(and (= 3 (+ (- 1) main_~y~0)) (= main_~c~0 4))} is VALID [2022-04-08 14:33:51,631 INFO L290 TraceCheckUtils]: 51: Hoare triple {6561#(and (= 3 (+ (- 1) main_~y~0)) (= main_~c~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; {6586#(and (<= main_~c~0 5) (= (+ (- 2) main_~y~0) 3) (< 4 main_~k~0))} is VALID [2022-04-08 14:33:51,631 INFO L290 TraceCheckUtils]: 52: Hoare triple {6586#(and (<= main_~c~0 5) (= (+ (- 2) main_~y~0) 3) (< 4 main_~k~0))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {6586#(and (<= main_~c~0 5) (= (+ (- 2) main_~y~0) 3) (< 4 main_~k~0))} is VALID [2022-04-08 14:33:51,631 INFO L290 TraceCheckUtils]: 53: Hoare triple {6586#(and (<= main_~c~0 5) (= (+ (- 2) main_~y~0) 3) (< 4 main_~k~0))} assume !!(#t~post5 < 10);havoc #t~post5; {6586#(and (<= main_~c~0 5) (= (+ (- 2) main_~y~0) 3) (< 4 main_~k~0))} is VALID [2022-04-08 14:33:51,631 INFO L272 TraceCheckUtils]: 54: Hoare triple {6586#(and (<= main_~c~0 5) (= (+ (- 2) main_~y~0) 3) (< 4 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)); {6423#true} is VALID [2022-04-08 14:33:51,631 INFO L290 TraceCheckUtils]: 55: Hoare triple {6423#true} ~cond := #in~cond; {6423#true} is VALID [2022-04-08 14:33:51,632 INFO L290 TraceCheckUtils]: 56: Hoare triple {6423#true} assume !(0 == ~cond); {6423#true} is VALID [2022-04-08 14:33:51,632 INFO L290 TraceCheckUtils]: 57: Hoare triple {6423#true} assume true; {6423#true} is VALID [2022-04-08 14:33:51,632 INFO L284 TraceCheckUtils]: 58: Hoare quadruple {6423#true} {6586#(and (<= main_~c~0 5) (= (+ (- 2) main_~y~0) 3) (< 4 main_~k~0))} #55#return; {6586#(and (<= main_~c~0 5) (= (+ (- 2) main_~y~0) 3) (< 4 main_~k~0))} is VALID [2022-04-08 14:33:51,633 INFO L290 TraceCheckUtils]: 59: Hoare triple {6586#(and (<= main_~c~0 5) (= (+ (- 2) main_~y~0) 3) (< 4 main_~k~0))} assume !(~c~0 < ~k~0); {6611#(and (<= main_~k~0 5) (= (+ (- 2) main_~y~0) 3) (< 4 main_~k~0))} is VALID [2022-04-08 14:33:51,633 INFO L272 TraceCheckUtils]: 60: Hoare triple {6611#(and (<= main_~k~0 5) (= (+ (- 2) main_~y~0) 3) (< 4 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)); {6423#true} is VALID [2022-04-08 14:33:51,633 INFO L290 TraceCheckUtils]: 61: Hoare triple {6423#true} ~cond := #in~cond; {6423#true} is VALID [2022-04-08 14:33:51,633 INFO L290 TraceCheckUtils]: 62: Hoare triple {6423#true} assume !(0 == ~cond); {6423#true} is VALID [2022-04-08 14:33:51,633 INFO L290 TraceCheckUtils]: 63: Hoare triple {6423#true} assume true; {6423#true} is VALID [2022-04-08 14:33:51,633 INFO L284 TraceCheckUtils]: 64: Hoare quadruple {6423#true} {6611#(and (<= main_~k~0 5) (= (+ (- 2) main_~y~0) 3) (< 4 main_~k~0))} #57#return; {6611#(and (<= main_~k~0 5) (= (+ (- 2) main_~y~0) 3) (< 4 main_~k~0))} is VALID [2022-04-08 14:33:51,634 INFO L272 TraceCheckUtils]: 65: Hoare triple {6611#(and (<= main_~k~0 5) (= (+ (- 2) main_~y~0) 3) (< 4 main_~k~0))} call __VERIFIER_assert((if ~k~0 * ~y~0 == ~y~0 * ~y~0 then 1 else 0)); {6630#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 14:33:51,634 INFO L290 TraceCheckUtils]: 66: Hoare triple {6630#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {6634#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 14:33:51,635 INFO L290 TraceCheckUtils]: 67: Hoare triple {6634#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {6424#false} is VALID [2022-04-08 14:33:51,635 INFO L290 TraceCheckUtils]: 68: Hoare triple {6424#false} assume !false; {6424#false} is VALID [2022-04-08 14:33:51,635 INFO L134 CoverageAnalysis]: Checked inductivity of 158 backedges. 14 proven. 60 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2022-04-08 14:33:51,635 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 14:33:51,933 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 14:33:51,933 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [164615906] [2022-04-08 14:33:51,933 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 14:33:51,933 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2139774725] [2022-04-08 14:33:51,933 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2139774725] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 14:33:51,933 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-08 14:33:51,933 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2022-04-08 14:33:51,934 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 14:33:51,934 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1693952611] [2022-04-08 14:33:51,934 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1693952611] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 14:33:51,934 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 14:33:51,934 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-04-08 14:33:51,934 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2063376835] [2022-04-08 14:33:51,934 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 14:33:51,935 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 3.1) internal successors, (31), 10 states have internal predecessors, (31), 8 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (9), 8 states have call predecessors, (9), 8 states have call successors, (9) Word has length 69 [2022-04-08 14:33:51,935 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 14:33:51,935 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 11 states, 10 states have (on average 3.1) internal successors, (31), 10 states have internal predecessors, (31), 8 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (9), 8 states have call predecessors, (9), 8 states have call successors, (9) [2022-04-08 14:33:51,973 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 51 edges. 51 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 14:33:51,974 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-04-08 14:33:51,974 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 14:33:51,974 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-04-08 14:33:51,974 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=146, Unknown=0, NotChecked=0, Total=182 [2022-04-08 14:33:51,974 INFO L87 Difference]: Start difference. First operand 68 states and 70 transitions. Second operand has 11 states, 10 states have (on average 3.1) internal successors, (31), 10 states have internal predecessors, (31), 8 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (9), 8 states have call predecessors, (9), 8 states have call successors, (9) [2022-04-08 14:33:52,570 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:33:52,570 INFO L93 Difference]: Finished difference Result 76 states and 80 transitions. [2022-04-08 14:33:52,570 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-04-08 14:33:52,571 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 3.1) internal successors, (31), 10 states have internal predecessors, (31), 8 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (9), 8 states have call predecessors, (9), 8 states have call successors, (9) Word has length 69 [2022-04-08 14:33:52,571 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 14:33:52,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 10 states have (on average 3.1) internal successors, (31), 10 states have internal predecessors, (31), 8 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (9), 8 states have call predecessors, (9), 8 states have call successors, (9) [2022-04-08 14:33:52,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 64 transitions. [2022-04-08 14:33:52,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 10 states have (on average 3.1) internal successors, (31), 10 states have internal predecessors, (31), 8 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (9), 8 states have call predecessors, (9), 8 states have call successors, (9) [2022-04-08 14:33:52,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 64 transitions. [2022-04-08 14:33:52,573 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 11 states and 64 transitions. [2022-04-08 14:33:52,625 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 64 edges. 64 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 14:33:52,626 INFO L225 Difference]: With dead ends: 76 [2022-04-08 14:33:52,626 INFO L226 Difference]: Without dead ends: 70 [2022-04-08 14:33:52,627 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 74 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=46, Invalid=194, Unknown=0, NotChecked=0, Total=240 [2022-04-08 14:33:52,627 INFO L913 BasicCegarLoop]: 47 mSDtfsCounter, 2 mSDsluCounter, 270 mSDsCounter, 0 mSdLazyCounter, 205 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 317 SdHoareTripleChecker+Invalid, 206 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 205 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-08 14:33:52,627 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [2 Valid, 317 Invalid, 206 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 205 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-08 14:33:52,628 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2022-04-08 14:33:52,703 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 70. [2022-04-08 14:33:52,703 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 14:33:52,703 INFO L82 GeneralOperation]: Start isEquivalent. First operand 70 states. Second operand has 70 states, 49 states have (on average 1.0408163265306123) internal successors, (51), 49 states have internal predecessors, (51), 12 states have call successors, (12), 10 states have call predecessors, (12), 8 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-08 14:33:52,703 INFO L74 IsIncluded]: Start isIncluded. First operand 70 states. Second operand has 70 states, 49 states have (on average 1.0408163265306123) internal successors, (51), 49 states have internal predecessors, (51), 12 states have call successors, (12), 10 states have call predecessors, (12), 8 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-08 14:33:52,704 INFO L87 Difference]: Start difference. First operand 70 states. Second operand has 70 states, 49 states have (on average 1.0408163265306123) internal successors, (51), 49 states have internal predecessors, (51), 12 states have call successors, (12), 10 states have call predecessors, (12), 8 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-08 14:33:52,705 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:33:52,705 INFO L93 Difference]: Finished difference Result 70 states and 73 transitions. [2022-04-08 14:33:52,705 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 73 transitions. [2022-04-08 14:33:52,705 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 14:33:52,705 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 14:33:52,706 INFO L74 IsIncluded]: Start isIncluded. First operand has 70 states, 49 states have (on average 1.0408163265306123) internal successors, (51), 49 states have internal predecessors, (51), 12 states have call successors, (12), 10 states have call predecessors, (12), 8 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) Second operand 70 states. [2022-04-08 14:33:52,706 INFO L87 Difference]: Start difference. First operand has 70 states, 49 states have (on average 1.0408163265306123) internal successors, (51), 49 states have internal predecessors, (51), 12 states have call successors, (12), 10 states have call predecessors, (12), 8 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) Second operand 70 states. [2022-04-08 14:33:52,708 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:33:52,708 INFO L93 Difference]: Finished difference Result 70 states and 73 transitions. [2022-04-08 14:33:52,708 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 73 transitions. [2022-04-08 14:33:52,708 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 14:33:52,708 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 14:33:52,708 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 14:33:52,708 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 14:33:52,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 49 states have (on average 1.0408163265306123) internal successors, (51), 49 states have internal predecessors, (51), 12 states have call successors, (12), 10 states have call predecessors, (12), 8 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-08 14:33:52,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 73 transitions. [2022-04-08 14:33:52,710 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 73 transitions. Word has length 69 [2022-04-08 14:33:52,710 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 14:33:52,710 INFO L478 AbstractCegarLoop]: Abstraction has 70 states and 73 transitions. [2022-04-08 14:33:52,710 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 3.1) internal successors, (31), 10 states have internal predecessors, (31), 8 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (9), 8 states have call predecessors, (9), 8 states have call successors, (9) [2022-04-08 14:33:52,710 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 70 states and 73 transitions. [2022-04-08 14:33:57,261 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 73 edges. 72 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-08 14:33:57,261 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 73 transitions. [2022-04-08 14:33:57,262 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2022-04-08 14:33:57,262 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 14:33:57,262 INFO L499 BasicCegarLoop]: trace histogram [8, 7, 7, 7, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 14:33:57,278 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2022-04-08 14:33:57,462 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2022-04-08 14:33:57,463 INFO L403 AbstractCegarLoop]: === Iteration 15 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 14:33:57,463 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 14:33:57,463 INFO L85 PathProgramCache]: Analyzing trace with hash -802694170, now seen corresponding path program 9 times [2022-04-08 14:33:57,463 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 14:33:57,463 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [85342046] [2022-04-08 14:33:57,580 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 14:33:57,580 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 14:33:57,580 INFO L85 PathProgramCache]: Analyzing trace with hash -802694170, now seen corresponding path program 10 times [2022-04-08 14:33:57,580 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 14:33:57,580 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1412928199] [2022-04-08 14:33:57,580 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 14:33:57,580 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 14:33:57,593 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 14:33:57,593 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1014066643] [2022-04-08 14:33:57,593 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-08 14:33:57,593 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 14:33:57,593 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 14:33:57,594 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 14:33:57,632 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2022-04-08 14:33:57,666 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-08 14:33:57,666 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 14:33:57,667 INFO L263 TraceCheckSpWp]: Trace formula consists of 215 conjuncts, 17 conjunts are in the unsatisfiable core [2022-04-08 14:33:57,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 14:33:57,687 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 14:33:58,022 INFO L272 TraceCheckUtils]: 0: Hoare triple {7136#true} call ULTIMATE.init(); {7136#true} is VALID [2022-04-08 14:33:58,023 INFO L290 TraceCheckUtils]: 1: Hoare triple {7136#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; {7144#(<= ~counter~0 0)} is VALID [2022-04-08 14:33:58,023 INFO L290 TraceCheckUtils]: 2: Hoare triple {7144#(<= ~counter~0 0)} assume true; {7144#(<= ~counter~0 0)} is VALID [2022-04-08 14:33:58,024 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7144#(<= ~counter~0 0)} {7136#true} #61#return; {7144#(<= ~counter~0 0)} is VALID [2022-04-08 14:33:58,024 INFO L272 TraceCheckUtils]: 4: Hoare triple {7144#(<= ~counter~0 0)} call #t~ret6 := main(); {7144#(<= ~counter~0 0)} is VALID [2022-04-08 14:33:58,024 INFO L290 TraceCheckUtils]: 5: Hoare triple {7144#(<= ~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; {7144#(<= ~counter~0 0)} is VALID [2022-04-08 14:33:58,040 INFO L272 TraceCheckUtils]: 6: Hoare triple {7144#(<= ~counter~0 0)} call assume_abort_if_not((if ~k~0 <= 256 then 1 else 0)); {7144#(<= ~counter~0 0)} is VALID [2022-04-08 14:33:58,040 INFO L290 TraceCheckUtils]: 7: Hoare triple {7144#(<= ~counter~0 0)} ~cond := #in~cond; {7144#(<= ~counter~0 0)} is VALID [2022-04-08 14:33:58,041 INFO L290 TraceCheckUtils]: 8: Hoare triple {7144#(<= ~counter~0 0)} assume !(0 == ~cond); {7144#(<= ~counter~0 0)} is VALID [2022-04-08 14:33:58,041 INFO L290 TraceCheckUtils]: 9: Hoare triple {7144#(<= ~counter~0 0)} assume true; {7144#(<= ~counter~0 0)} is VALID [2022-04-08 14:33:58,042 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {7144#(<= ~counter~0 0)} {7144#(<= ~counter~0 0)} #53#return; {7144#(<= ~counter~0 0)} is VALID [2022-04-08 14:33:58,043 INFO L290 TraceCheckUtils]: 11: Hoare triple {7144#(<= ~counter~0 0)} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {7144#(<= ~counter~0 0)} is VALID [2022-04-08 14:33:58,044 INFO L290 TraceCheckUtils]: 12: Hoare triple {7144#(<= ~counter~0 0)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {7178#(<= ~counter~0 1)} is VALID [2022-04-08 14:33:58,044 INFO L290 TraceCheckUtils]: 13: Hoare triple {7178#(<= ~counter~0 1)} assume !!(#t~post5 < 10);havoc #t~post5; {7178#(<= ~counter~0 1)} is VALID [2022-04-08 14:33:58,045 INFO L272 TraceCheckUtils]: 14: Hoare triple {7178#(<= ~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)); {7178#(<= ~counter~0 1)} is VALID [2022-04-08 14:33:58,046 INFO L290 TraceCheckUtils]: 15: Hoare triple {7178#(<= ~counter~0 1)} ~cond := #in~cond; {7178#(<= ~counter~0 1)} is VALID [2022-04-08 14:33:58,046 INFO L290 TraceCheckUtils]: 16: Hoare triple {7178#(<= ~counter~0 1)} assume !(0 == ~cond); {7178#(<= ~counter~0 1)} is VALID [2022-04-08 14:33:58,047 INFO L290 TraceCheckUtils]: 17: Hoare triple {7178#(<= ~counter~0 1)} assume true; {7178#(<= ~counter~0 1)} is VALID [2022-04-08 14:33:58,047 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {7178#(<= ~counter~0 1)} {7178#(<= ~counter~0 1)} #55#return; {7178#(<= ~counter~0 1)} is VALID [2022-04-08 14:33:58,048 INFO L290 TraceCheckUtils]: 19: Hoare triple {7178#(<= ~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; {7178#(<= ~counter~0 1)} is VALID [2022-04-08 14:33:58,049 INFO L290 TraceCheckUtils]: 20: Hoare triple {7178#(<= ~counter~0 1)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {7203#(<= ~counter~0 2)} is VALID [2022-04-08 14:33:58,049 INFO L290 TraceCheckUtils]: 21: Hoare triple {7203#(<= ~counter~0 2)} assume !!(#t~post5 < 10);havoc #t~post5; {7203#(<= ~counter~0 2)} is VALID [2022-04-08 14:33:58,050 INFO L272 TraceCheckUtils]: 22: Hoare triple {7203#(<= ~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)); {7203#(<= ~counter~0 2)} is VALID [2022-04-08 14:33:58,051 INFO L290 TraceCheckUtils]: 23: Hoare triple {7203#(<= ~counter~0 2)} ~cond := #in~cond; {7203#(<= ~counter~0 2)} is VALID [2022-04-08 14:33:58,051 INFO L290 TraceCheckUtils]: 24: Hoare triple {7203#(<= ~counter~0 2)} assume !(0 == ~cond); {7203#(<= ~counter~0 2)} is VALID [2022-04-08 14:33:58,052 INFO L290 TraceCheckUtils]: 25: Hoare triple {7203#(<= ~counter~0 2)} assume true; {7203#(<= ~counter~0 2)} is VALID [2022-04-08 14:33:58,053 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {7203#(<= ~counter~0 2)} {7203#(<= ~counter~0 2)} #55#return; {7203#(<= ~counter~0 2)} is VALID [2022-04-08 14:33:58,053 INFO L290 TraceCheckUtils]: 27: Hoare triple {7203#(<= ~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; {7203#(<= ~counter~0 2)} is VALID [2022-04-08 14:33:58,054 INFO L290 TraceCheckUtils]: 28: Hoare triple {7203#(<= ~counter~0 2)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {7228#(<= ~counter~0 3)} is VALID [2022-04-08 14:33:58,055 INFO L290 TraceCheckUtils]: 29: Hoare triple {7228#(<= ~counter~0 3)} assume !!(#t~post5 < 10);havoc #t~post5; {7228#(<= ~counter~0 3)} is VALID [2022-04-08 14:33:58,055 INFO L272 TraceCheckUtils]: 30: Hoare triple {7228#(<= ~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)); {7228#(<= ~counter~0 3)} is VALID [2022-04-08 14:33:58,056 INFO L290 TraceCheckUtils]: 31: Hoare triple {7228#(<= ~counter~0 3)} ~cond := #in~cond; {7228#(<= ~counter~0 3)} is VALID [2022-04-08 14:33:58,056 INFO L290 TraceCheckUtils]: 32: Hoare triple {7228#(<= ~counter~0 3)} assume !(0 == ~cond); {7228#(<= ~counter~0 3)} is VALID [2022-04-08 14:33:58,057 INFO L290 TraceCheckUtils]: 33: Hoare triple {7228#(<= ~counter~0 3)} assume true; {7228#(<= ~counter~0 3)} is VALID [2022-04-08 14:33:58,058 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {7228#(<= ~counter~0 3)} {7228#(<= ~counter~0 3)} #55#return; {7228#(<= ~counter~0 3)} is VALID [2022-04-08 14:33:58,058 INFO L290 TraceCheckUtils]: 35: Hoare triple {7228#(<= ~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; {7228#(<= ~counter~0 3)} is VALID [2022-04-08 14:33:58,059 INFO L290 TraceCheckUtils]: 36: Hoare triple {7228#(<= ~counter~0 3)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {7253#(<= ~counter~0 4)} is VALID [2022-04-08 14:33:58,059 INFO L290 TraceCheckUtils]: 37: Hoare triple {7253#(<= ~counter~0 4)} assume !!(#t~post5 < 10);havoc #t~post5; {7253#(<= ~counter~0 4)} is VALID [2022-04-08 14:33:58,060 INFO L272 TraceCheckUtils]: 38: Hoare triple {7253#(<= ~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)); {7253#(<= ~counter~0 4)} is VALID [2022-04-08 14:33:58,060 INFO L290 TraceCheckUtils]: 39: Hoare triple {7253#(<= ~counter~0 4)} ~cond := #in~cond; {7253#(<= ~counter~0 4)} is VALID [2022-04-08 14:33:58,060 INFO L290 TraceCheckUtils]: 40: Hoare triple {7253#(<= ~counter~0 4)} assume !(0 == ~cond); {7253#(<= ~counter~0 4)} is VALID [2022-04-08 14:33:58,061 INFO L290 TraceCheckUtils]: 41: Hoare triple {7253#(<= ~counter~0 4)} assume true; {7253#(<= ~counter~0 4)} is VALID [2022-04-08 14:33:58,061 INFO L284 TraceCheckUtils]: 42: Hoare quadruple {7253#(<= ~counter~0 4)} {7253#(<= ~counter~0 4)} #55#return; {7253#(<= ~counter~0 4)} is VALID [2022-04-08 14:33:58,062 INFO L290 TraceCheckUtils]: 43: Hoare triple {7253#(<= ~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; {7253#(<= ~counter~0 4)} is VALID [2022-04-08 14:33:58,062 INFO L290 TraceCheckUtils]: 44: Hoare triple {7253#(<= ~counter~0 4)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {7278#(<= ~counter~0 5)} is VALID [2022-04-08 14:33:58,063 INFO L290 TraceCheckUtils]: 45: Hoare triple {7278#(<= ~counter~0 5)} assume !!(#t~post5 < 10);havoc #t~post5; {7278#(<= ~counter~0 5)} is VALID [2022-04-08 14:33:58,063 INFO L272 TraceCheckUtils]: 46: Hoare triple {7278#(<= ~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)); {7278#(<= ~counter~0 5)} is VALID [2022-04-08 14:33:58,064 INFO L290 TraceCheckUtils]: 47: Hoare triple {7278#(<= ~counter~0 5)} ~cond := #in~cond; {7278#(<= ~counter~0 5)} is VALID [2022-04-08 14:33:58,064 INFO L290 TraceCheckUtils]: 48: Hoare triple {7278#(<= ~counter~0 5)} assume !(0 == ~cond); {7278#(<= ~counter~0 5)} is VALID [2022-04-08 14:33:58,064 INFO L290 TraceCheckUtils]: 49: Hoare triple {7278#(<= ~counter~0 5)} assume true; {7278#(<= ~counter~0 5)} is VALID [2022-04-08 14:33:58,065 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {7278#(<= ~counter~0 5)} {7278#(<= ~counter~0 5)} #55#return; {7278#(<= ~counter~0 5)} is VALID [2022-04-08 14:33:58,065 INFO L290 TraceCheckUtils]: 51: Hoare triple {7278#(<= ~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; {7278#(<= ~counter~0 5)} is VALID [2022-04-08 14:33:58,066 INFO L290 TraceCheckUtils]: 52: Hoare triple {7278#(<= ~counter~0 5)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {7303#(<= ~counter~0 6)} is VALID [2022-04-08 14:33:58,066 INFO L290 TraceCheckUtils]: 53: Hoare triple {7303#(<= ~counter~0 6)} assume !!(#t~post5 < 10);havoc #t~post5; {7303#(<= ~counter~0 6)} is VALID [2022-04-08 14:33:58,067 INFO L272 TraceCheckUtils]: 54: Hoare triple {7303#(<= ~counter~0 6)} 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)); {7303#(<= ~counter~0 6)} is VALID [2022-04-08 14:33:58,067 INFO L290 TraceCheckUtils]: 55: Hoare triple {7303#(<= ~counter~0 6)} ~cond := #in~cond; {7303#(<= ~counter~0 6)} is VALID [2022-04-08 14:33:58,068 INFO L290 TraceCheckUtils]: 56: Hoare triple {7303#(<= ~counter~0 6)} assume !(0 == ~cond); {7303#(<= ~counter~0 6)} is VALID [2022-04-08 14:33:58,068 INFO L290 TraceCheckUtils]: 57: Hoare triple {7303#(<= ~counter~0 6)} assume true; {7303#(<= ~counter~0 6)} is VALID [2022-04-08 14:33:58,069 INFO L284 TraceCheckUtils]: 58: Hoare quadruple {7303#(<= ~counter~0 6)} {7303#(<= ~counter~0 6)} #55#return; {7303#(<= ~counter~0 6)} is VALID [2022-04-08 14:33:58,069 INFO L290 TraceCheckUtils]: 59: Hoare triple {7303#(<= ~counter~0 6)} 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; {7303#(<= ~counter~0 6)} is VALID [2022-04-08 14:33:58,069 INFO L290 TraceCheckUtils]: 60: Hoare triple {7303#(<= ~counter~0 6)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {7328#(<= |main_#t~post5| 6)} is VALID [2022-04-08 14:33:58,070 INFO L290 TraceCheckUtils]: 61: Hoare triple {7328#(<= |main_#t~post5| 6)} assume !(#t~post5 < 10);havoc #t~post5; {7137#false} is VALID [2022-04-08 14:33:58,070 INFO L272 TraceCheckUtils]: 62: Hoare triple {7137#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)); {7137#false} is VALID [2022-04-08 14:33:58,070 INFO L290 TraceCheckUtils]: 63: Hoare triple {7137#false} ~cond := #in~cond; {7137#false} is VALID [2022-04-08 14:33:58,070 INFO L290 TraceCheckUtils]: 64: Hoare triple {7137#false} assume !(0 == ~cond); {7137#false} is VALID [2022-04-08 14:33:58,070 INFO L290 TraceCheckUtils]: 65: Hoare triple {7137#false} assume true; {7137#false} is VALID [2022-04-08 14:33:58,070 INFO L284 TraceCheckUtils]: 66: Hoare quadruple {7137#false} {7137#false} #57#return; {7137#false} is VALID [2022-04-08 14:33:58,071 INFO L272 TraceCheckUtils]: 67: Hoare triple {7137#false} call __VERIFIER_assert((if ~k~0 * ~y~0 == ~y~0 * ~y~0 then 1 else 0)); {7137#false} is VALID [2022-04-08 14:33:58,071 INFO L290 TraceCheckUtils]: 68: Hoare triple {7137#false} ~cond := #in~cond; {7137#false} is VALID [2022-04-08 14:33:58,071 INFO L290 TraceCheckUtils]: 69: Hoare triple {7137#false} assume 0 == ~cond; {7137#false} is VALID [2022-04-08 14:33:58,071 INFO L290 TraceCheckUtils]: 70: Hoare triple {7137#false} assume !false; {7137#false} is VALID [2022-04-08 14:33:58,071 INFO L134 CoverageAnalysis]: Checked inductivity of 170 backedges. 36 proven. 132 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-08 14:33:58,071 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 14:33:58,425 INFO L290 TraceCheckUtils]: 70: Hoare triple {7137#false} assume !false; {7137#false} is VALID [2022-04-08 14:33:58,425 INFO L290 TraceCheckUtils]: 69: Hoare triple {7137#false} assume 0 == ~cond; {7137#false} is VALID [2022-04-08 14:33:58,425 INFO L290 TraceCheckUtils]: 68: Hoare triple {7137#false} ~cond := #in~cond; {7137#false} is VALID [2022-04-08 14:33:58,425 INFO L272 TraceCheckUtils]: 67: Hoare triple {7137#false} call __VERIFIER_assert((if ~k~0 * ~y~0 == ~y~0 * ~y~0 then 1 else 0)); {7137#false} is VALID [2022-04-08 14:33:58,426 INFO L284 TraceCheckUtils]: 66: Hoare quadruple {7136#true} {7137#false} #57#return; {7137#false} is VALID [2022-04-08 14:33:58,426 INFO L290 TraceCheckUtils]: 65: Hoare triple {7136#true} assume true; {7136#true} is VALID [2022-04-08 14:33:58,426 INFO L290 TraceCheckUtils]: 64: Hoare triple {7136#true} assume !(0 == ~cond); {7136#true} is VALID [2022-04-08 14:33:58,426 INFO L290 TraceCheckUtils]: 63: Hoare triple {7136#true} ~cond := #in~cond; {7136#true} is VALID [2022-04-08 14:33:58,426 INFO L272 TraceCheckUtils]: 62: Hoare triple {7137#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)); {7136#true} is VALID [2022-04-08 14:33:58,426 INFO L290 TraceCheckUtils]: 61: Hoare triple {7386#(< |main_#t~post5| 10)} assume !(#t~post5 < 10);havoc #t~post5; {7137#false} is VALID [2022-04-08 14:33:58,427 INFO L290 TraceCheckUtils]: 60: Hoare triple {7390#(< ~counter~0 10)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {7386#(< |main_#t~post5| 10)} is VALID [2022-04-08 14:33:58,427 INFO L290 TraceCheckUtils]: 59: Hoare triple {7390#(< ~counter~0 10)} 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; {7390#(< ~counter~0 10)} is VALID [2022-04-08 14:33:58,427 INFO L284 TraceCheckUtils]: 58: Hoare quadruple {7136#true} {7390#(< ~counter~0 10)} #55#return; {7390#(< ~counter~0 10)} is VALID [2022-04-08 14:33:58,427 INFO L290 TraceCheckUtils]: 57: Hoare triple {7136#true} assume true; {7136#true} is VALID [2022-04-08 14:33:58,427 INFO L290 TraceCheckUtils]: 56: Hoare triple {7136#true} assume !(0 == ~cond); {7136#true} is VALID [2022-04-08 14:33:58,427 INFO L290 TraceCheckUtils]: 55: Hoare triple {7136#true} ~cond := #in~cond; {7136#true} is VALID [2022-04-08 14:33:58,428 INFO L272 TraceCheckUtils]: 54: Hoare triple {7390#(< ~counter~0 10)} 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)); {7136#true} is VALID [2022-04-08 14:33:58,428 INFO L290 TraceCheckUtils]: 53: Hoare triple {7390#(< ~counter~0 10)} assume !!(#t~post5 < 10);havoc #t~post5; {7390#(< ~counter~0 10)} is VALID [2022-04-08 14:33:58,428 INFO L290 TraceCheckUtils]: 52: Hoare triple {7415#(< ~counter~0 9)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {7390#(< ~counter~0 10)} is VALID [2022-04-08 14:33:58,429 INFO L290 TraceCheckUtils]: 51: Hoare triple {7415#(< ~counter~0 9)} 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; {7415#(< ~counter~0 9)} is VALID [2022-04-08 14:33:58,429 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {7136#true} {7415#(< ~counter~0 9)} #55#return; {7415#(< ~counter~0 9)} is VALID [2022-04-08 14:33:58,429 INFO L290 TraceCheckUtils]: 49: Hoare triple {7136#true} assume true; {7136#true} is VALID [2022-04-08 14:33:58,429 INFO L290 TraceCheckUtils]: 48: Hoare triple {7136#true} assume !(0 == ~cond); {7136#true} is VALID [2022-04-08 14:33:58,429 INFO L290 TraceCheckUtils]: 47: Hoare triple {7136#true} ~cond := #in~cond; {7136#true} is VALID [2022-04-08 14:33:58,429 INFO L272 TraceCheckUtils]: 46: Hoare triple {7415#(< ~counter~0 9)} 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)); {7136#true} is VALID [2022-04-08 14:33:58,430 INFO L290 TraceCheckUtils]: 45: Hoare triple {7415#(< ~counter~0 9)} assume !!(#t~post5 < 10);havoc #t~post5; {7415#(< ~counter~0 9)} is VALID [2022-04-08 14:33:58,430 INFO L290 TraceCheckUtils]: 44: Hoare triple {7440#(< ~counter~0 8)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {7415#(< ~counter~0 9)} is VALID [2022-04-08 14:33:58,430 INFO L290 TraceCheckUtils]: 43: Hoare triple {7440#(< ~counter~0 8)} 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; {7440#(< ~counter~0 8)} is VALID [2022-04-08 14:33:58,431 INFO L284 TraceCheckUtils]: 42: Hoare quadruple {7136#true} {7440#(< ~counter~0 8)} #55#return; {7440#(< ~counter~0 8)} is VALID [2022-04-08 14:33:58,431 INFO L290 TraceCheckUtils]: 41: Hoare triple {7136#true} assume true; {7136#true} is VALID [2022-04-08 14:33:58,431 INFO L290 TraceCheckUtils]: 40: Hoare triple {7136#true} assume !(0 == ~cond); {7136#true} is VALID [2022-04-08 14:33:58,431 INFO L290 TraceCheckUtils]: 39: Hoare triple {7136#true} ~cond := #in~cond; {7136#true} is VALID [2022-04-08 14:33:58,431 INFO L272 TraceCheckUtils]: 38: Hoare triple {7440#(< ~counter~0 8)} 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)); {7136#true} is VALID [2022-04-08 14:33:58,436 INFO L290 TraceCheckUtils]: 37: Hoare triple {7440#(< ~counter~0 8)} assume !!(#t~post5 < 10);havoc #t~post5; {7440#(< ~counter~0 8)} is VALID [2022-04-08 14:33:58,437 INFO L290 TraceCheckUtils]: 36: Hoare triple {7303#(<= ~counter~0 6)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {7440#(< ~counter~0 8)} is VALID [2022-04-08 14:33:58,437 INFO L290 TraceCheckUtils]: 35: Hoare triple {7303#(<= ~counter~0 6)} 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; {7303#(<= ~counter~0 6)} is VALID [2022-04-08 14:33:58,438 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {7136#true} {7303#(<= ~counter~0 6)} #55#return; {7303#(<= ~counter~0 6)} is VALID [2022-04-08 14:33:58,438 INFO L290 TraceCheckUtils]: 33: Hoare triple {7136#true} assume true; {7136#true} is VALID [2022-04-08 14:33:58,438 INFO L290 TraceCheckUtils]: 32: Hoare triple {7136#true} assume !(0 == ~cond); {7136#true} is VALID [2022-04-08 14:33:58,438 INFO L290 TraceCheckUtils]: 31: Hoare triple {7136#true} ~cond := #in~cond; {7136#true} is VALID [2022-04-08 14:33:58,438 INFO L272 TraceCheckUtils]: 30: Hoare triple {7303#(<= ~counter~0 6)} 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)); {7136#true} is VALID [2022-04-08 14:33:58,438 INFO L290 TraceCheckUtils]: 29: Hoare triple {7303#(<= ~counter~0 6)} assume !!(#t~post5 < 10);havoc #t~post5; {7303#(<= ~counter~0 6)} is VALID [2022-04-08 14:33:58,439 INFO L290 TraceCheckUtils]: 28: Hoare triple {7278#(<= ~counter~0 5)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {7303#(<= ~counter~0 6)} is VALID [2022-04-08 14:33:58,439 INFO L290 TraceCheckUtils]: 27: Hoare triple {7278#(<= ~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; {7278#(<= ~counter~0 5)} is VALID [2022-04-08 14:33:58,440 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {7136#true} {7278#(<= ~counter~0 5)} #55#return; {7278#(<= ~counter~0 5)} is VALID [2022-04-08 14:33:58,440 INFO L290 TraceCheckUtils]: 25: Hoare triple {7136#true} assume true; {7136#true} is VALID [2022-04-08 14:33:58,440 INFO L290 TraceCheckUtils]: 24: Hoare triple {7136#true} assume !(0 == ~cond); {7136#true} is VALID [2022-04-08 14:33:58,440 INFO L290 TraceCheckUtils]: 23: Hoare triple {7136#true} ~cond := #in~cond; {7136#true} is VALID [2022-04-08 14:33:58,440 INFO L272 TraceCheckUtils]: 22: Hoare triple {7278#(<= ~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)); {7136#true} is VALID [2022-04-08 14:33:58,440 INFO L290 TraceCheckUtils]: 21: Hoare triple {7278#(<= ~counter~0 5)} assume !!(#t~post5 < 10);havoc #t~post5; {7278#(<= ~counter~0 5)} is VALID [2022-04-08 14:33:58,441 INFO L290 TraceCheckUtils]: 20: Hoare triple {7253#(<= ~counter~0 4)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {7278#(<= ~counter~0 5)} is VALID [2022-04-08 14:33:58,441 INFO L290 TraceCheckUtils]: 19: Hoare triple {7253#(<= ~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; {7253#(<= ~counter~0 4)} is VALID [2022-04-08 14:33:58,441 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {7136#true} {7253#(<= ~counter~0 4)} #55#return; {7253#(<= ~counter~0 4)} is VALID [2022-04-08 14:33:58,442 INFO L290 TraceCheckUtils]: 17: Hoare triple {7136#true} assume true; {7136#true} is VALID [2022-04-08 14:33:58,442 INFO L290 TraceCheckUtils]: 16: Hoare triple {7136#true} assume !(0 == ~cond); {7136#true} is VALID [2022-04-08 14:33:58,442 INFO L290 TraceCheckUtils]: 15: Hoare triple {7136#true} ~cond := #in~cond; {7136#true} is VALID [2022-04-08 14:33:58,442 INFO L272 TraceCheckUtils]: 14: Hoare triple {7253#(<= ~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)); {7136#true} is VALID [2022-04-08 14:33:58,442 INFO L290 TraceCheckUtils]: 13: Hoare triple {7253#(<= ~counter~0 4)} assume !!(#t~post5 < 10);havoc #t~post5; {7253#(<= ~counter~0 4)} is VALID [2022-04-08 14:33:58,442 INFO L290 TraceCheckUtils]: 12: Hoare triple {7228#(<= ~counter~0 3)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {7253#(<= ~counter~0 4)} is VALID [2022-04-08 14:33:58,443 INFO L290 TraceCheckUtils]: 11: Hoare triple {7228#(<= ~counter~0 3)} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {7228#(<= ~counter~0 3)} is VALID [2022-04-08 14:33:58,443 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {7136#true} {7228#(<= ~counter~0 3)} #53#return; {7228#(<= ~counter~0 3)} is VALID [2022-04-08 14:33:58,443 INFO L290 TraceCheckUtils]: 9: Hoare triple {7136#true} assume true; {7136#true} is VALID [2022-04-08 14:33:58,443 INFO L290 TraceCheckUtils]: 8: Hoare triple {7136#true} assume !(0 == ~cond); {7136#true} is VALID [2022-04-08 14:33:58,443 INFO L290 TraceCheckUtils]: 7: Hoare triple {7136#true} ~cond := #in~cond; {7136#true} is VALID [2022-04-08 14:33:58,443 INFO L272 TraceCheckUtils]: 6: Hoare triple {7228#(<= ~counter~0 3)} call assume_abort_if_not((if ~k~0 <= 256 then 1 else 0)); {7136#true} is VALID [2022-04-08 14:33:58,444 INFO L290 TraceCheckUtils]: 5: Hoare triple {7228#(<= ~counter~0 3)} 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; {7228#(<= ~counter~0 3)} is VALID [2022-04-08 14:33:58,444 INFO L272 TraceCheckUtils]: 4: Hoare triple {7228#(<= ~counter~0 3)} call #t~ret6 := main(); {7228#(<= ~counter~0 3)} is VALID [2022-04-08 14:33:58,444 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7228#(<= ~counter~0 3)} {7136#true} #61#return; {7228#(<= ~counter~0 3)} is VALID [2022-04-08 14:33:58,445 INFO L290 TraceCheckUtils]: 2: Hoare triple {7228#(<= ~counter~0 3)} assume true; {7228#(<= ~counter~0 3)} is VALID [2022-04-08 14:33:58,445 INFO L290 TraceCheckUtils]: 1: Hoare triple {7136#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; {7228#(<= ~counter~0 3)} is VALID [2022-04-08 14:33:58,445 INFO L272 TraceCheckUtils]: 0: Hoare triple {7136#true} call ULTIMATE.init(); {7136#true} is VALID [2022-04-08 14:33:58,446 INFO L134 CoverageAnalysis]: Checked inductivity of 170 backedges. 14 proven. 72 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2022-04-08 14:33:58,446 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 14:33:58,446 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1412928199] [2022-04-08 14:33:58,446 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 14:33:58,446 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1014066643] [2022-04-08 14:33:58,446 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1014066643] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 14:33:58,446 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-08 14:33:58,446 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 14 [2022-04-08 14:33:58,446 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 14:33:58,446 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [85342046] [2022-04-08 14:33:58,447 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [85342046] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 14:33:58,447 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 14:33:58,447 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-04-08 14:33:58,447 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1763261253] [2022-04-08 14:33:58,447 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 14:33:58,447 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.0) internal successors, (50), 9 states have internal predecessors, (50), 9 states have call successors, (11), 9 states have call predecessors, (11), 8 states have return successors, (9), 8 states have call predecessors, (9), 9 states have call successors, (9) Word has length 71 [2022-04-08 14:33:58,447 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 14:33:58,447 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 10 states, 10 states have (on average 5.0) internal successors, (50), 9 states have internal predecessors, (50), 9 states have call successors, (11), 9 states have call predecessors, (11), 8 states have return successors, (9), 8 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-08 14:33:58,497 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-08 14:33:58,497 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-04-08 14:33:58,497 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 14:33:58,498 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-04-08 14:33:58,498 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=111, Unknown=0, NotChecked=0, Total=182 [2022-04-08 14:33:58,498 INFO L87 Difference]: Start difference. First operand 70 states and 73 transitions. Second operand has 10 states, 10 states have (on average 5.0) internal successors, (50), 9 states have internal predecessors, (50), 9 states have call successors, (11), 9 states have call predecessors, (11), 8 states have return successors, (9), 8 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-08 14:33:58,758 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:33:58,758 INFO L93 Difference]: Finished difference Result 86 states and 88 transitions. [2022-04-08 14:33:58,758 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-04-08 14:33:58,758 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.0) internal successors, (50), 9 states have internal predecessors, (50), 9 states have call successors, (11), 9 states have call predecessors, (11), 8 states have return successors, (9), 8 states have call predecessors, (9), 9 states have call successors, (9) Word has length 71 [2022-04-08 14:33:58,758 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 14:33:58,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 5.0) internal successors, (50), 9 states have internal predecessors, (50), 9 states have call successors, (11), 9 states have call predecessors, (11), 8 states have return successors, (9), 8 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-08 14:33:58,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 86 transitions. [2022-04-08 14:33:58,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 5.0) internal successors, (50), 9 states have internal predecessors, (50), 9 states have call successors, (11), 9 states have call predecessors, (11), 8 states have return successors, (9), 8 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-08 14:33:58,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 86 transitions. [2022-04-08 14:33:58,762 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 16 states and 86 transitions. [2022-04-08 14:33:58,833 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 86 edges. 86 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 14:33:58,834 INFO L225 Difference]: With dead ends: 86 [2022-04-08 14:33:58,834 INFO L226 Difference]: Without dead ends: 76 [2022-04-08 14:33:58,834 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 128 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=149, Invalid=231, Unknown=0, NotChecked=0, Total=380 [2022-04-08 14:33:58,835 INFO L913 BasicCegarLoop]: 31 mSDtfsCounter, 12 mSDsluCounter, 86 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 117 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-08 14:33:58,835 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [12 Valid, 117 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-08 14:33:58,835 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2022-04-08 14:33:58,920 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 76. [2022-04-08 14:33:58,920 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 14:33:58,920 INFO L82 GeneralOperation]: Start isEquivalent. First operand 76 states. Second operand has 76 states, 54 states have (on average 1.037037037037037) internal successors, (56), 54 states have internal predecessors, (56), 12 states have call successors, (12), 11 states have call predecessors, (12), 9 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-08 14:33:58,921 INFO L74 IsIncluded]: Start isIncluded. First operand 76 states. Second operand has 76 states, 54 states have (on average 1.037037037037037) internal successors, (56), 54 states have internal predecessors, (56), 12 states have call successors, (12), 11 states have call predecessors, (12), 9 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-08 14:33:58,921 INFO L87 Difference]: Start difference. First operand 76 states. Second operand has 76 states, 54 states have (on average 1.037037037037037) internal successors, (56), 54 states have internal predecessors, (56), 12 states have call successors, (12), 11 states have call predecessors, (12), 9 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-08 14:33:58,922 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:33:58,922 INFO L93 Difference]: Finished difference Result 76 states and 78 transitions. [2022-04-08 14:33:58,922 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 78 transitions. [2022-04-08 14:33:58,923 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 14:33:58,923 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 14:33:58,923 INFO L74 IsIncluded]: Start isIncluded. First operand has 76 states, 54 states have (on average 1.037037037037037) internal successors, (56), 54 states have internal predecessors, (56), 12 states have call successors, (12), 11 states have call predecessors, (12), 9 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) Second operand 76 states. [2022-04-08 14:33:58,923 INFO L87 Difference]: Start difference. First operand has 76 states, 54 states have (on average 1.037037037037037) internal successors, (56), 54 states have internal predecessors, (56), 12 states have call successors, (12), 11 states have call predecessors, (12), 9 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) Second operand 76 states. [2022-04-08 14:33:58,925 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:33:58,925 INFO L93 Difference]: Finished difference Result 76 states and 78 transitions. [2022-04-08 14:33:58,925 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 78 transitions. [2022-04-08 14:33:58,925 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 14:33:58,925 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 14:33:58,925 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 14:33:58,925 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 14:33:58,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 54 states have (on average 1.037037037037037) internal successors, (56), 54 states have internal predecessors, (56), 12 states have call successors, (12), 11 states have call predecessors, (12), 9 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-08 14:33:58,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 78 transitions. [2022-04-08 14:33:58,927 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 78 transitions. Word has length 71 [2022-04-08 14:33:58,927 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 14:33:58,927 INFO L478 AbstractCegarLoop]: Abstraction has 76 states and 78 transitions. [2022-04-08 14:33:58,927 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.0) internal successors, (50), 9 states have internal predecessors, (50), 9 states have call successors, (11), 9 states have call predecessors, (11), 8 states have return successors, (9), 8 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-08 14:33:58,927 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 76 states and 78 transitions. [2022-04-08 14:34:03,390 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 78 edges. 77 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-08 14:34:03,391 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 78 transitions. [2022-04-08 14:34:03,392 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2022-04-08 14:34:03,392 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 14:34:03,392 INFO L499 BasicCegarLoop]: trace histogram [9, 8, 8, 7, 7, 7, 7, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 14:34:03,408 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Ended with exit code 0 [2022-04-08 14:34:03,595 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 14:34:03,595 INFO L403 AbstractCegarLoop]: === Iteration 16 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 14:34:03,596 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 14:34:03,596 INFO L85 PathProgramCache]: Analyzing trace with hash 540885452, now seen corresponding path program 11 times [2022-04-08 14:34:03,596 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 14:34:03,596 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1483007650] [2022-04-08 14:34:03,693 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 14:34:03,693 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 14:34:03,693 INFO L85 PathProgramCache]: Analyzing trace with hash 540885452, now seen corresponding path program 12 times [2022-04-08 14:34:03,693 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 14:34:03,694 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [726583315] [2022-04-08 14:34:03,694 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 14:34:03,694 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 14:34:03,707 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 14:34:03,707 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1419910882] [2022-04-08 14:34:03,707 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-08 14:34:03,707 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 14:34:03,707 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 14:34:03,708 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 14:34:03,715 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2022-04-08 14:34:09,340 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2022-04-08 14:34:09,340 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 14:34:09,354 INFO L263 TraceCheckSpWp]: Trace formula consists of 225 conjuncts, 33 conjunts are in the unsatisfiable core [2022-04-08 14:34:09,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 14:34:09,381 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 14:34:09,941 INFO L272 TraceCheckUtils]: 0: Hoare triple {8063#true} call ULTIMATE.init(); {8063#true} is VALID [2022-04-08 14:34:09,942 INFO L290 TraceCheckUtils]: 1: Hoare triple {8063#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; {8063#true} is VALID [2022-04-08 14:34:09,942 INFO L290 TraceCheckUtils]: 2: Hoare triple {8063#true} assume true; {8063#true} is VALID [2022-04-08 14:34:09,942 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {8063#true} {8063#true} #61#return; {8063#true} is VALID [2022-04-08 14:34:09,942 INFO L272 TraceCheckUtils]: 4: Hoare triple {8063#true} call #t~ret6 := main(); {8063#true} is VALID [2022-04-08 14:34:09,942 INFO L290 TraceCheckUtils]: 5: Hoare triple {8063#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; {8063#true} is VALID [2022-04-08 14:34:09,942 INFO L272 TraceCheckUtils]: 6: Hoare triple {8063#true} call assume_abort_if_not((if ~k~0 <= 256 then 1 else 0)); {8063#true} is VALID [2022-04-08 14:34:09,942 INFO L290 TraceCheckUtils]: 7: Hoare triple {8063#true} ~cond := #in~cond; {8063#true} is VALID [2022-04-08 14:34:09,942 INFO L290 TraceCheckUtils]: 8: Hoare triple {8063#true} assume !(0 == ~cond); {8063#true} is VALID [2022-04-08 14:34:09,942 INFO L290 TraceCheckUtils]: 9: Hoare triple {8063#true} assume true; {8063#true} is VALID [2022-04-08 14:34:09,942 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {8063#true} {8063#true} #53#return; {8063#true} is VALID [2022-04-08 14:34:09,943 INFO L290 TraceCheckUtils]: 11: Hoare triple {8063#true} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {8101#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-08 14:34:09,943 INFO L290 TraceCheckUtils]: 12: Hoare triple {8101#(and (= main_~c~0 0) (= main_~y~0 0))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {8101#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-08 14:34:09,943 INFO L290 TraceCheckUtils]: 13: Hoare triple {8101#(and (= main_~c~0 0) (= main_~y~0 0))} assume !!(#t~post5 < 10);havoc #t~post5; {8101#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-08 14:34:09,943 INFO L272 TraceCheckUtils]: 14: Hoare triple {8101#(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)); {8063#true} is VALID [2022-04-08 14:34:09,943 INFO L290 TraceCheckUtils]: 15: Hoare triple {8063#true} ~cond := #in~cond; {8063#true} is VALID [2022-04-08 14:34:09,944 INFO L290 TraceCheckUtils]: 16: Hoare triple {8063#true} assume !(0 == ~cond); {8063#true} is VALID [2022-04-08 14:34:09,944 INFO L290 TraceCheckUtils]: 17: Hoare triple {8063#true} assume true; {8063#true} is VALID [2022-04-08 14:34:09,944 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {8063#true} {8101#(and (= main_~c~0 0) (= main_~y~0 0))} #55#return; {8101#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-08 14:34:09,945 INFO L290 TraceCheckUtils]: 19: Hoare triple {8101#(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; {8126#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} is VALID [2022-04-08 14:34:09,945 INFO L290 TraceCheckUtils]: 20: Hoare triple {8126#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {8126#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} is VALID [2022-04-08 14:34:09,945 INFO L290 TraceCheckUtils]: 21: Hoare triple {8126#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} assume !!(#t~post5 < 10);havoc #t~post5; {8126#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} is VALID [2022-04-08 14:34:09,945 INFO L272 TraceCheckUtils]: 22: Hoare triple {8126#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~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)); {8063#true} is VALID [2022-04-08 14:34:09,945 INFO L290 TraceCheckUtils]: 23: Hoare triple {8063#true} ~cond := #in~cond; {8063#true} is VALID [2022-04-08 14:34:09,945 INFO L290 TraceCheckUtils]: 24: Hoare triple {8063#true} assume !(0 == ~cond); {8063#true} is VALID [2022-04-08 14:34:09,946 INFO L290 TraceCheckUtils]: 25: Hoare triple {8063#true} assume true; {8063#true} is VALID [2022-04-08 14:34:09,946 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {8063#true} {8126#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} #55#return; {8126#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} is VALID [2022-04-08 14:34:09,946 INFO L290 TraceCheckUtils]: 27: Hoare triple {8126#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~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; {8151#(and (= main_~y~0 2) (< 1 main_~k~0) (= main_~c~0 2))} is VALID [2022-04-08 14:34:09,947 INFO L290 TraceCheckUtils]: 28: Hoare triple {8151#(and (= main_~y~0 2) (< 1 main_~k~0) (= main_~c~0 2))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {8151#(and (= main_~y~0 2) (< 1 main_~k~0) (= main_~c~0 2))} is VALID [2022-04-08 14:34:09,947 INFO L290 TraceCheckUtils]: 29: Hoare triple {8151#(and (= main_~y~0 2) (< 1 main_~k~0) (= main_~c~0 2))} assume !!(#t~post5 < 10);havoc #t~post5; {8151#(and (= main_~y~0 2) (< 1 main_~k~0) (= main_~c~0 2))} is VALID [2022-04-08 14:34:09,947 INFO L272 TraceCheckUtils]: 30: Hoare triple {8151#(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)); {8063#true} is VALID [2022-04-08 14:34:09,947 INFO L290 TraceCheckUtils]: 31: Hoare triple {8063#true} ~cond := #in~cond; {8063#true} is VALID [2022-04-08 14:34:09,947 INFO L290 TraceCheckUtils]: 32: Hoare triple {8063#true} assume !(0 == ~cond); {8063#true} is VALID [2022-04-08 14:34:09,948 INFO L290 TraceCheckUtils]: 33: Hoare triple {8063#true} assume true; {8063#true} is VALID [2022-04-08 14:34:09,948 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {8063#true} {8151#(and (= main_~y~0 2) (< 1 main_~k~0) (= main_~c~0 2))} #55#return; {8151#(and (= main_~y~0 2) (< 1 main_~k~0) (= main_~c~0 2))} is VALID [2022-04-08 14:34:09,948 INFO L290 TraceCheckUtils]: 35: Hoare triple {8151#(and (= main_~y~0 2) (< 1 main_~k~0) (= main_~c~0 2))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {8176#(and (< 1 main_~k~0) (= main_~y~0 3) (= (+ (- 1) main_~c~0) 2))} is VALID [2022-04-08 14:34:09,949 INFO L290 TraceCheckUtils]: 36: Hoare triple {8176#(and (< 1 main_~k~0) (= main_~y~0 3) (= (+ (- 1) main_~c~0) 2))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {8176#(and (< 1 main_~k~0) (= main_~y~0 3) (= (+ (- 1) main_~c~0) 2))} is VALID [2022-04-08 14:34:09,949 INFO L290 TraceCheckUtils]: 37: Hoare triple {8176#(and (< 1 main_~k~0) (= main_~y~0 3) (= (+ (- 1) main_~c~0) 2))} assume !!(#t~post5 < 10);havoc #t~post5; {8176#(and (< 1 main_~k~0) (= main_~y~0 3) (= (+ (- 1) main_~c~0) 2))} is VALID [2022-04-08 14:34:09,949 INFO L272 TraceCheckUtils]: 38: Hoare triple {8176#(and (< 1 main_~k~0) (= main_~y~0 3) (= (+ (- 1) main_~c~0) 2))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {8063#true} is VALID [2022-04-08 14:34:09,949 INFO L290 TraceCheckUtils]: 39: Hoare triple {8063#true} ~cond := #in~cond; {8063#true} is VALID [2022-04-08 14:34:09,949 INFO L290 TraceCheckUtils]: 40: Hoare triple {8063#true} assume !(0 == ~cond); {8063#true} is VALID [2022-04-08 14:34:09,949 INFO L290 TraceCheckUtils]: 41: Hoare triple {8063#true} assume true; {8063#true} is VALID [2022-04-08 14:34:09,950 INFO L284 TraceCheckUtils]: 42: Hoare quadruple {8063#true} {8176#(and (< 1 main_~k~0) (= main_~y~0 3) (= (+ (- 1) main_~c~0) 2))} #55#return; {8176#(and (< 1 main_~k~0) (= main_~y~0 3) (= (+ (- 1) main_~c~0) 2))} is VALID [2022-04-08 14:34:09,950 INFO L290 TraceCheckUtils]: 43: Hoare triple {8176#(and (< 1 main_~k~0) (= main_~y~0 3) (= (+ (- 1) 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; {8201#(and (< 1 main_~k~0) (= 2 (+ (- 2) main_~c~0)) (= 3 (+ (- 1) main_~y~0)))} is VALID [2022-04-08 14:34:09,951 INFO L290 TraceCheckUtils]: 44: Hoare triple {8201#(and (< 1 main_~k~0) (= 2 (+ (- 2) main_~c~0)) (= 3 (+ (- 1) main_~y~0)))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {8201#(and (< 1 main_~k~0) (= 2 (+ (- 2) main_~c~0)) (= 3 (+ (- 1) main_~y~0)))} is VALID [2022-04-08 14:34:09,951 INFO L290 TraceCheckUtils]: 45: Hoare triple {8201#(and (< 1 main_~k~0) (= 2 (+ (- 2) main_~c~0)) (= 3 (+ (- 1) main_~y~0)))} assume !!(#t~post5 < 10);havoc #t~post5; {8201#(and (< 1 main_~k~0) (= 2 (+ (- 2) main_~c~0)) (= 3 (+ (- 1) main_~y~0)))} is VALID [2022-04-08 14:34:09,952 INFO L272 TraceCheckUtils]: 46: Hoare triple {8201#(and (< 1 main_~k~0) (= 2 (+ (- 2) main_~c~0)) (= 3 (+ (- 1) 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)); {8063#true} is VALID [2022-04-08 14:34:09,952 INFO L290 TraceCheckUtils]: 47: Hoare triple {8063#true} ~cond := #in~cond; {8063#true} is VALID [2022-04-08 14:34:09,952 INFO L290 TraceCheckUtils]: 48: Hoare triple {8063#true} assume !(0 == ~cond); {8063#true} is VALID [2022-04-08 14:34:09,952 INFO L290 TraceCheckUtils]: 49: Hoare triple {8063#true} assume true; {8063#true} is VALID [2022-04-08 14:34:09,956 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {8063#true} {8201#(and (< 1 main_~k~0) (= 2 (+ (- 2) main_~c~0)) (= 3 (+ (- 1) main_~y~0)))} #55#return; {8201#(and (< 1 main_~k~0) (= 2 (+ (- 2) main_~c~0)) (= 3 (+ (- 1) main_~y~0)))} is VALID [2022-04-08 14:34:09,956 INFO L290 TraceCheckUtils]: 51: Hoare triple {8201#(and (< 1 main_~k~0) (= 2 (+ (- 2) main_~c~0)) (= 3 (+ (- 1) 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; {8226#(and (< 1 main_~k~0) (= 2 (+ main_~c~0 (- 3))) (= (+ (- 2) main_~y~0) 3))} is VALID [2022-04-08 14:34:09,957 INFO L290 TraceCheckUtils]: 52: Hoare triple {8226#(and (< 1 main_~k~0) (= 2 (+ main_~c~0 (- 3))) (= (+ (- 2) main_~y~0) 3))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {8226#(and (< 1 main_~k~0) (= 2 (+ main_~c~0 (- 3))) (= (+ (- 2) main_~y~0) 3))} is VALID [2022-04-08 14:34:09,957 INFO L290 TraceCheckUtils]: 53: Hoare triple {8226#(and (< 1 main_~k~0) (= 2 (+ main_~c~0 (- 3))) (= (+ (- 2) main_~y~0) 3))} assume !!(#t~post5 < 10);havoc #t~post5; {8226#(and (< 1 main_~k~0) (= 2 (+ main_~c~0 (- 3))) (= (+ (- 2) main_~y~0) 3))} is VALID [2022-04-08 14:34:09,957 INFO L272 TraceCheckUtils]: 54: Hoare triple {8226#(and (< 1 main_~k~0) (= 2 (+ main_~c~0 (- 3))) (= (+ (- 2) main_~y~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)); {8063#true} is VALID [2022-04-08 14:34:09,957 INFO L290 TraceCheckUtils]: 55: Hoare triple {8063#true} ~cond := #in~cond; {8063#true} is VALID [2022-04-08 14:34:09,957 INFO L290 TraceCheckUtils]: 56: Hoare triple {8063#true} assume !(0 == ~cond); {8063#true} is VALID [2022-04-08 14:34:09,957 INFO L290 TraceCheckUtils]: 57: Hoare triple {8063#true} assume true; {8063#true} is VALID [2022-04-08 14:34:09,958 INFO L284 TraceCheckUtils]: 58: Hoare quadruple {8063#true} {8226#(and (< 1 main_~k~0) (= 2 (+ main_~c~0 (- 3))) (= (+ (- 2) main_~y~0) 3))} #55#return; {8226#(and (< 1 main_~k~0) (= 2 (+ main_~c~0 (- 3))) (= (+ (- 2) main_~y~0) 3))} is VALID [2022-04-08 14:34:09,958 INFO L290 TraceCheckUtils]: 59: Hoare triple {8226#(and (< 1 main_~k~0) (= 2 (+ main_~c~0 (- 3))) (= (+ (- 2) main_~y~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; {8251#(and (= main_~y~0 6) (< 5 main_~k~0) (<= main_~c~0 6))} is VALID [2022-04-08 14:34:09,959 INFO L290 TraceCheckUtils]: 60: Hoare triple {8251#(and (= main_~y~0 6) (< 5 main_~k~0) (<= main_~c~0 6))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {8251#(and (= main_~y~0 6) (< 5 main_~k~0) (<= main_~c~0 6))} is VALID [2022-04-08 14:34:09,959 INFO L290 TraceCheckUtils]: 61: Hoare triple {8251#(and (= main_~y~0 6) (< 5 main_~k~0) (<= main_~c~0 6))} assume !!(#t~post5 < 10);havoc #t~post5; {8251#(and (= main_~y~0 6) (< 5 main_~k~0) (<= main_~c~0 6))} is VALID [2022-04-08 14:34:09,959 INFO L272 TraceCheckUtils]: 62: Hoare triple {8251#(and (= main_~y~0 6) (< 5 main_~k~0) (<= main_~c~0 6))} 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)); {8063#true} is VALID [2022-04-08 14:34:09,959 INFO L290 TraceCheckUtils]: 63: Hoare triple {8063#true} ~cond := #in~cond; {8063#true} is VALID [2022-04-08 14:34:09,959 INFO L290 TraceCheckUtils]: 64: Hoare triple {8063#true} assume !(0 == ~cond); {8063#true} is VALID [2022-04-08 14:34:09,959 INFO L290 TraceCheckUtils]: 65: Hoare triple {8063#true} assume true; {8063#true} is VALID [2022-04-08 14:34:09,960 INFO L284 TraceCheckUtils]: 66: Hoare quadruple {8063#true} {8251#(and (= main_~y~0 6) (< 5 main_~k~0) (<= main_~c~0 6))} #55#return; {8251#(and (= main_~y~0 6) (< 5 main_~k~0) (<= main_~c~0 6))} is VALID [2022-04-08 14:34:09,961 INFO L290 TraceCheckUtils]: 67: Hoare triple {8251#(and (= main_~y~0 6) (< 5 main_~k~0) (<= main_~c~0 6))} assume !(~c~0 < ~k~0); {8276#(and (= main_~y~0 6) (<= main_~k~0 6) (< 5 main_~k~0))} is VALID [2022-04-08 14:34:09,961 INFO L272 TraceCheckUtils]: 68: Hoare triple {8276#(and (= main_~y~0 6) (<= main_~k~0 6) (< 5 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)); {8063#true} is VALID [2022-04-08 14:34:09,961 INFO L290 TraceCheckUtils]: 69: Hoare triple {8063#true} ~cond := #in~cond; {8063#true} is VALID [2022-04-08 14:34:09,961 INFO L290 TraceCheckUtils]: 70: Hoare triple {8063#true} assume !(0 == ~cond); {8063#true} is VALID [2022-04-08 14:34:09,961 INFO L290 TraceCheckUtils]: 71: Hoare triple {8063#true} assume true; {8063#true} is VALID [2022-04-08 14:34:09,962 INFO L284 TraceCheckUtils]: 72: Hoare quadruple {8063#true} {8276#(and (= main_~y~0 6) (<= main_~k~0 6) (< 5 main_~k~0))} #57#return; {8276#(and (= main_~y~0 6) (<= main_~k~0 6) (< 5 main_~k~0))} is VALID [2022-04-08 14:34:09,962 INFO L272 TraceCheckUtils]: 73: Hoare triple {8276#(and (= main_~y~0 6) (<= main_~k~0 6) (< 5 main_~k~0))} call __VERIFIER_assert((if ~k~0 * ~y~0 == ~y~0 * ~y~0 then 1 else 0)); {8295#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 14:34:09,963 INFO L290 TraceCheckUtils]: 74: Hoare triple {8295#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {8299#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 14:34:09,963 INFO L290 TraceCheckUtils]: 75: Hoare triple {8299#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {8064#false} is VALID [2022-04-08 14:34:09,963 INFO L290 TraceCheckUtils]: 76: Hoare triple {8064#false} assume !false; {8064#false} is VALID [2022-04-08 14:34:09,963 INFO L134 CoverageAnalysis]: Checked inductivity of 212 backedges. 16 proven. 84 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2022-04-08 14:34:09,963 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 14:34:10,654 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 14:34:10,654 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [726583315] [2022-04-08 14:34:10,655 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 14:34:10,655 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1419910882] [2022-04-08 14:34:10,655 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1419910882] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 14:34:10,655 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-08 14:34:10,655 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2022-04-08 14:34:10,655 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 14:34:10,655 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1483007650] [2022-04-08 14:34:10,655 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1483007650] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 14:34:10,655 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 14:34:10,655 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-04-08 14:34:10,655 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1552530607] [2022-04-08 14:34:10,655 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 14:34:10,656 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 3.090909090909091) internal successors, (34), 11 states have internal predecessors, (34), 9 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (10), 9 states have call predecessors, (10), 9 states have call successors, (10) Word has length 77 [2022-04-08 14:34:10,656 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 14:34:10,656 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 12 states, 11 states have (on average 3.090909090909091) internal successors, (34), 11 states have internal predecessors, (34), 9 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (10), 9 states have call predecessors, (10), 9 states have call successors, (10) [2022-04-08 14:34:10,698 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 56 edges. 56 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 14:34:10,698 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-04-08 14:34:10,698 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 14:34:10,699 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-04-08 14:34:10,699 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=270, Unknown=0, NotChecked=0, Total=342 [2022-04-08 14:34:10,699 INFO L87 Difference]: Start difference. First operand 76 states and 78 transitions. Second operand has 12 states, 11 states have (on average 3.090909090909091) internal successors, (34), 11 states have internal predecessors, (34), 9 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (10), 9 states have call predecessors, (10), 9 states have call successors, (10) [2022-04-08 14:34:11,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:34:11,477 INFO L93 Difference]: Finished difference Result 84 states and 88 transitions. [2022-04-08 14:34:11,477 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-04-08 14:34:11,477 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 3.090909090909091) internal successors, (34), 11 states have internal predecessors, (34), 9 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (10), 9 states have call predecessors, (10), 9 states have call successors, (10) Word has length 77 [2022-04-08 14:34:11,477 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 14:34:11,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 11 states have (on average 3.090909090909091) internal successors, (34), 11 states have internal predecessors, (34), 9 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (10), 9 states have call predecessors, (10), 9 states have call successors, (10) [2022-04-08 14:34:11,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 69 transitions. [2022-04-08 14:34:11,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 11 states have (on average 3.090909090909091) internal successors, (34), 11 states have internal predecessors, (34), 9 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (10), 9 states have call predecessors, (10), 9 states have call successors, (10) [2022-04-08 14:34:11,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 69 transitions. [2022-04-08 14:34:11,479 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 12 states and 69 transitions. [2022-04-08 14:34:11,529 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 69 edges. 69 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 14:34:11,530 INFO L225 Difference]: With dead ends: 84 [2022-04-08 14:34:11,530 INFO L226 Difference]: Without dead ends: 78 [2022-04-08 14:34:11,531 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 109 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=82, Invalid=338, Unknown=0, NotChecked=0, Total=420 [2022-04-08 14:34:11,531 INFO L913 BasicCegarLoop]: 52 mSDtfsCounter, 2 mSDsluCounter, 317 mSDsCounter, 0 mSdLazyCounter, 269 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 369 SdHoareTripleChecker+Invalid, 270 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 269 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-04-08 14:34:11,531 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [2 Valid, 369 Invalid, 270 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 269 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-04-08 14:34:11,532 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2022-04-08 14:34:11,623 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 78. [2022-04-08 14:34:11,623 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 14:34:11,623 INFO L82 GeneralOperation]: Start isEquivalent. First operand 78 states. Second operand has 78 states, 55 states have (on average 1.0363636363636364) internal successors, (57), 55 states have internal predecessors, (57), 13 states have call successors, (13), 11 states have call predecessors, (13), 9 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-08 14:34:11,623 INFO L74 IsIncluded]: Start isIncluded. First operand 78 states. Second operand has 78 states, 55 states have (on average 1.0363636363636364) internal successors, (57), 55 states have internal predecessors, (57), 13 states have call successors, (13), 11 states have call predecessors, (13), 9 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-08 14:34:11,624 INFO L87 Difference]: Start difference. First operand 78 states. Second operand has 78 states, 55 states have (on average 1.0363636363636364) internal successors, (57), 55 states have internal predecessors, (57), 13 states have call successors, (13), 11 states have call predecessors, (13), 9 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-08 14:34:11,625 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:34:11,625 INFO L93 Difference]: Finished difference Result 78 states and 81 transitions. [2022-04-08 14:34:11,625 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 81 transitions. [2022-04-08 14:34:11,625 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 14:34:11,625 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 14:34:11,625 INFO L74 IsIncluded]: Start isIncluded. First operand has 78 states, 55 states have (on average 1.0363636363636364) internal successors, (57), 55 states have internal predecessors, (57), 13 states have call successors, (13), 11 states have call predecessors, (13), 9 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) Second operand 78 states. [2022-04-08 14:34:11,625 INFO L87 Difference]: Start difference. First operand has 78 states, 55 states have (on average 1.0363636363636364) internal successors, (57), 55 states have internal predecessors, (57), 13 states have call successors, (13), 11 states have call predecessors, (13), 9 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) Second operand 78 states. [2022-04-08 14:34:11,626 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:34:11,626 INFO L93 Difference]: Finished difference Result 78 states and 81 transitions. [2022-04-08 14:34:11,626 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 81 transitions. [2022-04-08 14:34:11,627 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 14:34:11,627 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 14:34:11,627 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 14:34:11,627 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 14:34:11,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 55 states have (on average 1.0363636363636364) internal successors, (57), 55 states have internal predecessors, (57), 13 states have call successors, (13), 11 states have call predecessors, (13), 9 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-08 14:34:11,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 81 transitions. [2022-04-08 14:34:11,628 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 81 transitions. Word has length 77 [2022-04-08 14:34:11,629 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 14:34:11,629 INFO L478 AbstractCegarLoop]: Abstraction has 78 states and 81 transitions. [2022-04-08 14:34:11,629 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 3.090909090909091) internal successors, (34), 11 states have internal predecessors, (34), 9 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (10), 9 states have call predecessors, (10), 9 states have call successors, (10) [2022-04-08 14:34:11,629 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 78 states and 81 transitions. [2022-04-08 14:34:16,084 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 81 edges. 80 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-08 14:34:16,084 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 81 transitions. [2022-04-08 14:34:16,085 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2022-04-08 14:34:16,085 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 14:34:16,085 INFO L499 BasicCegarLoop]: trace histogram [9, 8, 8, 8, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 14:34:16,094 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2022-04-08 14:34:16,287 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2022-04-08 14:34:16,287 INFO L403 AbstractCegarLoop]: === Iteration 17 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 14:34:16,288 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 14:34:16,288 INFO L85 PathProgramCache]: Analyzing trace with hash -1454305145, now seen corresponding path program 11 times [2022-04-08 14:34:16,288 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 14:34:16,288 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1884033969] [2022-04-08 14:34:16,407 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 14:34:16,407 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 14:34:16,408 INFO L85 PathProgramCache]: Analyzing trace with hash -1454305145, now seen corresponding path program 12 times [2022-04-08 14:34:16,408 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 14:34:16,408 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1293041201] [2022-04-08 14:34:16,408 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 14:34:16,408 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 14:34:16,434 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 14:34:16,435 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [412897019] [2022-04-08 14:34:16,435 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-08 14:34:16,435 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 14:34:16,435 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 14:34:16,438 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 14:34:16,439 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2022-04-08 14:34:16,607 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 8 check-sat command(s) [2022-04-08 14:34:16,607 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 14:34:16,609 INFO L263 TraceCheckSpWp]: Trace formula consists of 236 conjuncts, 19 conjunts are in the unsatisfiable core [2022-04-08 14:34:16,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 14:34:16,630 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 14:34:16,993 INFO L272 TraceCheckUtils]: 0: Hoare triple {8949#true} call ULTIMATE.init(); {8949#true} is VALID [2022-04-08 14:34:16,994 INFO L290 TraceCheckUtils]: 1: Hoare triple {8949#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; {8957#(<= ~counter~0 0)} is VALID [2022-04-08 14:34:16,994 INFO L290 TraceCheckUtils]: 2: Hoare triple {8957#(<= ~counter~0 0)} assume true; {8957#(<= ~counter~0 0)} is VALID [2022-04-08 14:34:16,995 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {8957#(<= ~counter~0 0)} {8949#true} #61#return; {8957#(<= ~counter~0 0)} is VALID [2022-04-08 14:34:16,995 INFO L272 TraceCheckUtils]: 4: Hoare triple {8957#(<= ~counter~0 0)} call #t~ret6 := main(); {8957#(<= ~counter~0 0)} is VALID [2022-04-08 14:34:16,995 INFO L290 TraceCheckUtils]: 5: Hoare triple {8957#(<= ~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; {8957#(<= ~counter~0 0)} is VALID [2022-04-08 14:34:16,996 INFO L272 TraceCheckUtils]: 6: Hoare triple {8957#(<= ~counter~0 0)} call assume_abort_if_not((if ~k~0 <= 256 then 1 else 0)); {8957#(<= ~counter~0 0)} is VALID [2022-04-08 14:34:16,996 INFO L290 TraceCheckUtils]: 7: Hoare triple {8957#(<= ~counter~0 0)} ~cond := #in~cond; {8957#(<= ~counter~0 0)} is VALID [2022-04-08 14:34:16,996 INFO L290 TraceCheckUtils]: 8: Hoare triple {8957#(<= ~counter~0 0)} assume !(0 == ~cond); {8957#(<= ~counter~0 0)} is VALID [2022-04-08 14:34:17,011 INFO L290 TraceCheckUtils]: 9: Hoare triple {8957#(<= ~counter~0 0)} assume true; {8957#(<= ~counter~0 0)} is VALID [2022-04-08 14:34:17,012 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {8957#(<= ~counter~0 0)} {8957#(<= ~counter~0 0)} #53#return; {8957#(<= ~counter~0 0)} is VALID [2022-04-08 14:34:17,012 INFO L290 TraceCheckUtils]: 11: Hoare triple {8957#(<= ~counter~0 0)} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {8957#(<= ~counter~0 0)} is VALID [2022-04-08 14:34:17,013 INFO L290 TraceCheckUtils]: 12: Hoare triple {8957#(<= ~counter~0 0)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {8991#(<= ~counter~0 1)} is VALID [2022-04-08 14:34:17,013 INFO L290 TraceCheckUtils]: 13: Hoare triple {8991#(<= ~counter~0 1)} assume !!(#t~post5 < 10);havoc #t~post5; {8991#(<= ~counter~0 1)} is VALID [2022-04-08 14:34:17,014 INFO L272 TraceCheckUtils]: 14: Hoare triple {8991#(<= ~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)); {8991#(<= ~counter~0 1)} is VALID [2022-04-08 14:34:17,014 INFO L290 TraceCheckUtils]: 15: Hoare triple {8991#(<= ~counter~0 1)} ~cond := #in~cond; {8991#(<= ~counter~0 1)} is VALID [2022-04-08 14:34:17,014 INFO L290 TraceCheckUtils]: 16: Hoare triple {8991#(<= ~counter~0 1)} assume !(0 == ~cond); {8991#(<= ~counter~0 1)} is VALID [2022-04-08 14:34:17,015 INFO L290 TraceCheckUtils]: 17: Hoare triple {8991#(<= ~counter~0 1)} assume true; {8991#(<= ~counter~0 1)} is VALID [2022-04-08 14:34:17,015 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {8991#(<= ~counter~0 1)} {8991#(<= ~counter~0 1)} #55#return; {8991#(<= ~counter~0 1)} is VALID [2022-04-08 14:34:17,015 INFO L290 TraceCheckUtils]: 19: Hoare triple {8991#(<= ~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; {8991#(<= ~counter~0 1)} is VALID [2022-04-08 14:34:17,016 INFO L290 TraceCheckUtils]: 20: Hoare triple {8991#(<= ~counter~0 1)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {9016#(<= ~counter~0 2)} is VALID [2022-04-08 14:34:17,016 INFO L290 TraceCheckUtils]: 21: Hoare triple {9016#(<= ~counter~0 2)} assume !!(#t~post5 < 10);havoc #t~post5; {9016#(<= ~counter~0 2)} is VALID [2022-04-08 14:34:17,017 INFO L272 TraceCheckUtils]: 22: Hoare triple {9016#(<= ~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)); {9016#(<= ~counter~0 2)} is VALID [2022-04-08 14:34:17,017 INFO L290 TraceCheckUtils]: 23: Hoare triple {9016#(<= ~counter~0 2)} ~cond := #in~cond; {9016#(<= ~counter~0 2)} is VALID [2022-04-08 14:34:17,017 INFO L290 TraceCheckUtils]: 24: Hoare triple {9016#(<= ~counter~0 2)} assume !(0 == ~cond); {9016#(<= ~counter~0 2)} is VALID [2022-04-08 14:34:17,017 INFO L290 TraceCheckUtils]: 25: Hoare triple {9016#(<= ~counter~0 2)} assume true; {9016#(<= ~counter~0 2)} is VALID [2022-04-08 14:34:17,018 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {9016#(<= ~counter~0 2)} {9016#(<= ~counter~0 2)} #55#return; {9016#(<= ~counter~0 2)} is VALID [2022-04-08 14:34:17,018 INFO L290 TraceCheckUtils]: 27: Hoare triple {9016#(<= ~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; {9016#(<= ~counter~0 2)} is VALID [2022-04-08 14:34:17,019 INFO L290 TraceCheckUtils]: 28: Hoare triple {9016#(<= ~counter~0 2)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {9041#(<= ~counter~0 3)} is VALID [2022-04-08 14:34:17,019 INFO L290 TraceCheckUtils]: 29: Hoare triple {9041#(<= ~counter~0 3)} assume !!(#t~post5 < 10);havoc #t~post5; {9041#(<= ~counter~0 3)} is VALID [2022-04-08 14:34:17,019 INFO L272 TraceCheckUtils]: 30: Hoare triple {9041#(<= ~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)); {9041#(<= ~counter~0 3)} is VALID [2022-04-08 14:34:17,020 INFO L290 TraceCheckUtils]: 31: Hoare triple {9041#(<= ~counter~0 3)} ~cond := #in~cond; {9041#(<= ~counter~0 3)} is VALID [2022-04-08 14:34:17,020 INFO L290 TraceCheckUtils]: 32: Hoare triple {9041#(<= ~counter~0 3)} assume !(0 == ~cond); {9041#(<= ~counter~0 3)} is VALID [2022-04-08 14:34:17,020 INFO L290 TraceCheckUtils]: 33: Hoare triple {9041#(<= ~counter~0 3)} assume true; {9041#(<= ~counter~0 3)} is VALID [2022-04-08 14:34:17,024 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {9041#(<= ~counter~0 3)} {9041#(<= ~counter~0 3)} #55#return; {9041#(<= ~counter~0 3)} is VALID [2022-04-08 14:34:17,024 INFO L290 TraceCheckUtils]: 35: Hoare triple {9041#(<= ~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; {9041#(<= ~counter~0 3)} is VALID [2022-04-08 14:34:17,025 INFO L290 TraceCheckUtils]: 36: Hoare triple {9041#(<= ~counter~0 3)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {9066#(<= ~counter~0 4)} is VALID [2022-04-08 14:34:17,025 INFO L290 TraceCheckUtils]: 37: Hoare triple {9066#(<= ~counter~0 4)} assume !!(#t~post5 < 10);havoc #t~post5; {9066#(<= ~counter~0 4)} is VALID [2022-04-08 14:34:17,026 INFO L272 TraceCheckUtils]: 38: Hoare triple {9066#(<= ~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)); {9066#(<= ~counter~0 4)} is VALID [2022-04-08 14:34:17,026 INFO L290 TraceCheckUtils]: 39: Hoare triple {9066#(<= ~counter~0 4)} ~cond := #in~cond; {9066#(<= ~counter~0 4)} is VALID [2022-04-08 14:34:17,026 INFO L290 TraceCheckUtils]: 40: Hoare triple {9066#(<= ~counter~0 4)} assume !(0 == ~cond); {9066#(<= ~counter~0 4)} is VALID [2022-04-08 14:34:17,027 INFO L290 TraceCheckUtils]: 41: Hoare triple {9066#(<= ~counter~0 4)} assume true; {9066#(<= ~counter~0 4)} is VALID [2022-04-08 14:34:17,027 INFO L284 TraceCheckUtils]: 42: Hoare quadruple {9066#(<= ~counter~0 4)} {9066#(<= ~counter~0 4)} #55#return; {9066#(<= ~counter~0 4)} is VALID [2022-04-08 14:34:17,027 INFO L290 TraceCheckUtils]: 43: Hoare triple {9066#(<= ~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; {9066#(<= ~counter~0 4)} is VALID [2022-04-08 14:34:17,028 INFO L290 TraceCheckUtils]: 44: Hoare triple {9066#(<= ~counter~0 4)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {9091#(<= ~counter~0 5)} is VALID [2022-04-08 14:34:17,028 INFO L290 TraceCheckUtils]: 45: Hoare triple {9091#(<= ~counter~0 5)} assume !!(#t~post5 < 10);havoc #t~post5; {9091#(<= ~counter~0 5)} is VALID [2022-04-08 14:34:17,028 INFO L272 TraceCheckUtils]: 46: Hoare triple {9091#(<= ~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)); {9091#(<= ~counter~0 5)} is VALID [2022-04-08 14:34:17,029 INFO L290 TraceCheckUtils]: 47: Hoare triple {9091#(<= ~counter~0 5)} ~cond := #in~cond; {9091#(<= ~counter~0 5)} is VALID [2022-04-08 14:34:17,029 INFO L290 TraceCheckUtils]: 48: Hoare triple {9091#(<= ~counter~0 5)} assume !(0 == ~cond); {9091#(<= ~counter~0 5)} is VALID [2022-04-08 14:34:17,029 INFO L290 TraceCheckUtils]: 49: Hoare triple {9091#(<= ~counter~0 5)} assume true; {9091#(<= ~counter~0 5)} is VALID [2022-04-08 14:34:17,030 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {9091#(<= ~counter~0 5)} {9091#(<= ~counter~0 5)} #55#return; {9091#(<= ~counter~0 5)} is VALID [2022-04-08 14:34:17,030 INFO L290 TraceCheckUtils]: 51: Hoare triple {9091#(<= ~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; {9091#(<= ~counter~0 5)} is VALID [2022-04-08 14:34:17,030 INFO L290 TraceCheckUtils]: 52: Hoare triple {9091#(<= ~counter~0 5)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {9116#(<= ~counter~0 6)} is VALID [2022-04-08 14:34:17,031 INFO L290 TraceCheckUtils]: 53: Hoare triple {9116#(<= ~counter~0 6)} assume !!(#t~post5 < 10);havoc #t~post5; {9116#(<= ~counter~0 6)} is VALID [2022-04-08 14:34:17,031 INFO L272 TraceCheckUtils]: 54: Hoare triple {9116#(<= ~counter~0 6)} 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)); {9116#(<= ~counter~0 6)} is VALID [2022-04-08 14:34:17,031 INFO L290 TraceCheckUtils]: 55: Hoare triple {9116#(<= ~counter~0 6)} ~cond := #in~cond; {9116#(<= ~counter~0 6)} is VALID [2022-04-08 14:34:17,032 INFO L290 TraceCheckUtils]: 56: Hoare triple {9116#(<= ~counter~0 6)} assume !(0 == ~cond); {9116#(<= ~counter~0 6)} is VALID [2022-04-08 14:34:17,032 INFO L290 TraceCheckUtils]: 57: Hoare triple {9116#(<= ~counter~0 6)} assume true; {9116#(<= ~counter~0 6)} is VALID [2022-04-08 14:34:17,032 INFO L284 TraceCheckUtils]: 58: Hoare quadruple {9116#(<= ~counter~0 6)} {9116#(<= ~counter~0 6)} #55#return; {9116#(<= ~counter~0 6)} is VALID [2022-04-08 14:34:17,033 INFO L290 TraceCheckUtils]: 59: Hoare triple {9116#(<= ~counter~0 6)} 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; {9116#(<= ~counter~0 6)} is VALID [2022-04-08 14:34:17,033 INFO L290 TraceCheckUtils]: 60: Hoare triple {9116#(<= ~counter~0 6)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {9141#(<= ~counter~0 7)} is VALID [2022-04-08 14:34:17,033 INFO L290 TraceCheckUtils]: 61: Hoare triple {9141#(<= ~counter~0 7)} assume !!(#t~post5 < 10);havoc #t~post5; {9141#(<= ~counter~0 7)} is VALID [2022-04-08 14:34:17,034 INFO L272 TraceCheckUtils]: 62: Hoare triple {9141#(<= ~counter~0 7)} 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)); {9141#(<= ~counter~0 7)} is VALID [2022-04-08 14:34:17,034 INFO L290 TraceCheckUtils]: 63: Hoare triple {9141#(<= ~counter~0 7)} ~cond := #in~cond; {9141#(<= ~counter~0 7)} is VALID [2022-04-08 14:34:17,034 INFO L290 TraceCheckUtils]: 64: Hoare triple {9141#(<= ~counter~0 7)} assume !(0 == ~cond); {9141#(<= ~counter~0 7)} is VALID [2022-04-08 14:34:17,035 INFO L290 TraceCheckUtils]: 65: Hoare triple {9141#(<= ~counter~0 7)} assume true; {9141#(<= ~counter~0 7)} is VALID [2022-04-08 14:34:17,035 INFO L284 TraceCheckUtils]: 66: Hoare quadruple {9141#(<= ~counter~0 7)} {9141#(<= ~counter~0 7)} #55#return; {9141#(<= ~counter~0 7)} is VALID [2022-04-08 14:34:17,035 INFO L290 TraceCheckUtils]: 67: Hoare triple {9141#(<= ~counter~0 7)} 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; {9141#(<= ~counter~0 7)} is VALID [2022-04-08 14:34:17,036 INFO L290 TraceCheckUtils]: 68: Hoare triple {9141#(<= ~counter~0 7)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {9166#(<= |main_#t~post5| 7)} is VALID [2022-04-08 14:34:17,036 INFO L290 TraceCheckUtils]: 69: Hoare triple {9166#(<= |main_#t~post5| 7)} assume !(#t~post5 < 10);havoc #t~post5; {8950#false} is VALID [2022-04-08 14:34:17,036 INFO L272 TraceCheckUtils]: 70: Hoare triple {8950#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)); {8950#false} is VALID [2022-04-08 14:34:17,036 INFO L290 TraceCheckUtils]: 71: Hoare triple {8950#false} ~cond := #in~cond; {8950#false} is VALID [2022-04-08 14:34:17,036 INFO L290 TraceCheckUtils]: 72: Hoare triple {8950#false} assume !(0 == ~cond); {8950#false} is VALID [2022-04-08 14:34:17,036 INFO L290 TraceCheckUtils]: 73: Hoare triple {8950#false} assume true; {8950#false} is VALID [2022-04-08 14:34:17,036 INFO L284 TraceCheckUtils]: 74: Hoare quadruple {8950#false} {8950#false} #57#return; {8950#false} is VALID [2022-04-08 14:34:17,036 INFO L272 TraceCheckUtils]: 75: Hoare triple {8950#false} call __VERIFIER_assert((if ~k~0 * ~y~0 == ~y~0 * ~y~0 then 1 else 0)); {8950#false} is VALID [2022-04-08 14:34:17,037 INFO L290 TraceCheckUtils]: 76: Hoare triple {8950#false} ~cond := #in~cond; {8950#false} is VALID [2022-04-08 14:34:17,037 INFO L290 TraceCheckUtils]: 77: Hoare triple {8950#false} assume 0 == ~cond; {8950#false} is VALID [2022-04-08 14:34:17,037 INFO L290 TraceCheckUtils]: 78: Hoare triple {8950#false} assume !false; {8950#false} is VALID [2022-04-08 14:34:17,037 INFO L134 CoverageAnalysis]: Checked inductivity of 226 backedges. 42 proven. 182 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-08 14:34:17,037 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 14:34:17,399 INFO L290 TraceCheckUtils]: 78: Hoare triple {8950#false} assume !false; {8950#false} is VALID [2022-04-08 14:34:17,399 INFO L290 TraceCheckUtils]: 77: Hoare triple {8950#false} assume 0 == ~cond; {8950#false} is VALID [2022-04-08 14:34:17,399 INFO L290 TraceCheckUtils]: 76: Hoare triple {8950#false} ~cond := #in~cond; {8950#false} is VALID [2022-04-08 14:34:17,400 INFO L272 TraceCheckUtils]: 75: Hoare triple {8950#false} call __VERIFIER_assert((if ~k~0 * ~y~0 == ~y~0 * ~y~0 then 1 else 0)); {8950#false} is VALID [2022-04-08 14:34:17,400 INFO L284 TraceCheckUtils]: 74: Hoare quadruple {8949#true} {8950#false} #57#return; {8950#false} is VALID [2022-04-08 14:34:17,400 INFO L290 TraceCheckUtils]: 73: Hoare triple {8949#true} assume true; {8949#true} is VALID [2022-04-08 14:34:17,400 INFO L290 TraceCheckUtils]: 72: Hoare triple {8949#true} assume !(0 == ~cond); {8949#true} is VALID [2022-04-08 14:34:17,400 INFO L290 TraceCheckUtils]: 71: Hoare triple {8949#true} ~cond := #in~cond; {8949#true} is VALID [2022-04-08 14:34:17,400 INFO L272 TraceCheckUtils]: 70: Hoare triple {8950#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)); {8949#true} is VALID [2022-04-08 14:34:17,400 INFO L290 TraceCheckUtils]: 69: Hoare triple {9224#(< |main_#t~post5| 10)} assume !(#t~post5 < 10);havoc #t~post5; {8950#false} is VALID [2022-04-08 14:34:17,401 INFO L290 TraceCheckUtils]: 68: Hoare triple {9228#(< ~counter~0 10)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {9224#(< |main_#t~post5| 10)} is VALID [2022-04-08 14:34:17,401 INFO L290 TraceCheckUtils]: 67: Hoare triple {9228#(< ~counter~0 10)} 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; {9228#(< ~counter~0 10)} is VALID [2022-04-08 14:34:17,401 INFO L284 TraceCheckUtils]: 66: Hoare quadruple {8949#true} {9228#(< ~counter~0 10)} #55#return; {9228#(< ~counter~0 10)} is VALID [2022-04-08 14:34:17,401 INFO L290 TraceCheckUtils]: 65: Hoare triple {8949#true} assume true; {8949#true} is VALID [2022-04-08 14:34:17,402 INFO L290 TraceCheckUtils]: 64: Hoare triple {8949#true} assume !(0 == ~cond); {8949#true} is VALID [2022-04-08 14:34:17,402 INFO L290 TraceCheckUtils]: 63: Hoare triple {8949#true} ~cond := #in~cond; {8949#true} is VALID [2022-04-08 14:34:17,402 INFO L272 TraceCheckUtils]: 62: Hoare triple {9228#(< ~counter~0 10)} 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)); {8949#true} is VALID [2022-04-08 14:34:17,402 INFO L290 TraceCheckUtils]: 61: Hoare triple {9228#(< ~counter~0 10)} assume !!(#t~post5 < 10);havoc #t~post5; {9228#(< ~counter~0 10)} is VALID [2022-04-08 14:34:17,403 INFO L290 TraceCheckUtils]: 60: Hoare triple {9253#(< ~counter~0 9)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {9228#(< ~counter~0 10)} is VALID [2022-04-08 14:34:17,403 INFO L290 TraceCheckUtils]: 59: Hoare triple {9253#(< ~counter~0 9)} 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; {9253#(< ~counter~0 9)} is VALID [2022-04-08 14:34:17,403 INFO L284 TraceCheckUtils]: 58: Hoare quadruple {8949#true} {9253#(< ~counter~0 9)} #55#return; {9253#(< ~counter~0 9)} is VALID [2022-04-08 14:34:17,403 INFO L290 TraceCheckUtils]: 57: Hoare triple {8949#true} assume true; {8949#true} is VALID [2022-04-08 14:34:17,404 INFO L290 TraceCheckUtils]: 56: Hoare triple {8949#true} assume !(0 == ~cond); {8949#true} is VALID [2022-04-08 14:34:17,404 INFO L290 TraceCheckUtils]: 55: Hoare triple {8949#true} ~cond := #in~cond; {8949#true} is VALID [2022-04-08 14:34:17,404 INFO L272 TraceCheckUtils]: 54: Hoare triple {9253#(< ~counter~0 9)} 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)); {8949#true} is VALID [2022-04-08 14:34:17,404 INFO L290 TraceCheckUtils]: 53: Hoare triple {9253#(< ~counter~0 9)} assume !!(#t~post5 < 10);havoc #t~post5; {9253#(< ~counter~0 9)} is VALID [2022-04-08 14:34:17,404 INFO L290 TraceCheckUtils]: 52: Hoare triple {9141#(<= ~counter~0 7)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {9253#(< ~counter~0 9)} is VALID [2022-04-08 14:34:17,405 INFO L290 TraceCheckUtils]: 51: Hoare triple {9141#(<= ~counter~0 7)} 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; {9141#(<= ~counter~0 7)} is VALID [2022-04-08 14:34:17,405 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {8949#true} {9141#(<= ~counter~0 7)} #55#return; {9141#(<= ~counter~0 7)} is VALID [2022-04-08 14:34:17,405 INFO L290 TraceCheckUtils]: 49: Hoare triple {8949#true} assume true; {8949#true} is VALID [2022-04-08 14:34:17,405 INFO L290 TraceCheckUtils]: 48: Hoare triple {8949#true} assume !(0 == ~cond); {8949#true} is VALID [2022-04-08 14:34:17,405 INFO L290 TraceCheckUtils]: 47: Hoare triple {8949#true} ~cond := #in~cond; {8949#true} is VALID [2022-04-08 14:34:17,405 INFO L272 TraceCheckUtils]: 46: Hoare triple {9141#(<= ~counter~0 7)} 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)); {8949#true} is VALID [2022-04-08 14:34:17,406 INFO L290 TraceCheckUtils]: 45: Hoare triple {9141#(<= ~counter~0 7)} assume !!(#t~post5 < 10);havoc #t~post5; {9141#(<= ~counter~0 7)} is VALID [2022-04-08 14:34:17,406 INFO L290 TraceCheckUtils]: 44: Hoare triple {9116#(<= ~counter~0 6)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {9141#(<= ~counter~0 7)} is VALID [2022-04-08 14:34:17,406 INFO L290 TraceCheckUtils]: 43: Hoare triple {9116#(<= ~counter~0 6)} 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; {9116#(<= ~counter~0 6)} is VALID [2022-04-08 14:34:17,407 INFO L284 TraceCheckUtils]: 42: Hoare quadruple {8949#true} {9116#(<= ~counter~0 6)} #55#return; {9116#(<= ~counter~0 6)} is VALID [2022-04-08 14:34:17,407 INFO L290 TraceCheckUtils]: 41: Hoare triple {8949#true} assume true; {8949#true} is VALID [2022-04-08 14:34:17,407 INFO L290 TraceCheckUtils]: 40: Hoare triple {8949#true} assume !(0 == ~cond); {8949#true} is VALID [2022-04-08 14:34:17,407 INFO L290 TraceCheckUtils]: 39: Hoare triple {8949#true} ~cond := #in~cond; {8949#true} is VALID [2022-04-08 14:34:17,407 INFO L272 TraceCheckUtils]: 38: Hoare triple {9116#(<= ~counter~0 6)} 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)); {8949#true} is VALID [2022-04-08 14:34:17,407 INFO L290 TraceCheckUtils]: 37: Hoare triple {9116#(<= ~counter~0 6)} assume !!(#t~post5 < 10);havoc #t~post5; {9116#(<= ~counter~0 6)} is VALID [2022-04-08 14:34:17,408 INFO L290 TraceCheckUtils]: 36: Hoare triple {9091#(<= ~counter~0 5)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {9116#(<= ~counter~0 6)} is VALID [2022-04-08 14:34:17,408 INFO L290 TraceCheckUtils]: 35: Hoare triple {9091#(<= ~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; {9091#(<= ~counter~0 5)} is VALID [2022-04-08 14:34:17,409 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {8949#true} {9091#(<= ~counter~0 5)} #55#return; {9091#(<= ~counter~0 5)} is VALID [2022-04-08 14:34:17,409 INFO L290 TraceCheckUtils]: 33: Hoare triple {8949#true} assume true; {8949#true} is VALID [2022-04-08 14:34:17,409 INFO L290 TraceCheckUtils]: 32: Hoare triple {8949#true} assume !(0 == ~cond); {8949#true} is VALID [2022-04-08 14:34:17,409 INFO L290 TraceCheckUtils]: 31: Hoare triple {8949#true} ~cond := #in~cond; {8949#true} is VALID [2022-04-08 14:34:17,409 INFO L272 TraceCheckUtils]: 30: Hoare triple {9091#(<= ~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)); {8949#true} is VALID [2022-04-08 14:34:17,409 INFO L290 TraceCheckUtils]: 29: Hoare triple {9091#(<= ~counter~0 5)} assume !!(#t~post5 < 10);havoc #t~post5; {9091#(<= ~counter~0 5)} is VALID [2022-04-08 14:34:17,410 INFO L290 TraceCheckUtils]: 28: Hoare triple {9066#(<= ~counter~0 4)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {9091#(<= ~counter~0 5)} is VALID [2022-04-08 14:34:17,410 INFO L290 TraceCheckUtils]: 27: Hoare triple {9066#(<= ~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; {9066#(<= ~counter~0 4)} is VALID [2022-04-08 14:34:17,410 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {8949#true} {9066#(<= ~counter~0 4)} #55#return; {9066#(<= ~counter~0 4)} is VALID [2022-04-08 14:34:17,410 INFO L290 TraceCheckUtils]: 25: Hoare triple {8949#true} assume true; {8949#true} is VALID [2022-04-08 14:34:17,411 INFO L290 TraceCheckUtils]: 24: Hoare triple {8949#true} assume !(0 == ~cond); {8949#true} is VALID [2022-04-08 14:34:17,411 INFO L290 TraceCheckUtils]: 23: Hoare triple {8949#true} ~cond := #in~cond; {8949#true} is VALID [2022-04-08 14:34:17,411 INFO L272 TraceCheckUtils]: 22: Hoare triple {9066#(<= ~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)); {8949#true} is VALID [2022-04-08 14:34:17,411 INFO L290 TraceCheckUtils]: 21: Hoare triple {9066#(<= ~counter~0 4)} assume !!(#t~post5 < 10);havoc #t~post5; {9066#(<= ~counter~0 4)} is VALID [2022-04-08 14:34:17,411 INFO L290 TraceCheckUtils]: 20: Hoare triple {9041#(<= ~counter~0 3)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {9066#(<= ~counter~0 4)} is VALID [2022-04-08 14:34:17,412 INFO L290 TraceCheckUtils]: 19: Hoare triple {9041#(<= ~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; {9041#(<= ~counter~0 3)} is VALID [2022-04-08 14:34:17,412 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {8949#true} {9041#(<= ~counter~0 3)} #55#return; {9041#(<= ~counter~0 3)} is VALID [2022-04-08 14:34:17,412 INFO L290 TraceCheckUtils]: 17: Hoare triple {8949#true} assume true; {8949#true} is VALID [2022-04-08 14:34:17,412 INFO L290 TraceCheckUtils]: 16: Hoare triple {8949#true} assume !(0 == ~cond); {8949#true} is VALID [2022-04-08 14:34:17,412 INFO L290 TraceCheckUtils]: 15: Hoare triple {8949#true} ~cond := #in~cond; {8949#true} is VALID [2022-04-08 14:34:17,412 INFO L272 TraceCheckUtils]: 14: Hoare triple {9041#(<= ~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)); {8949#true} is VALID [2022-04-08 14:34:17,413 INFO L290 TraceCheckUtils]: 13: Hoare triple {9041#(<= ~counter~0 3)} assume !!(#t~post5 < 10);havoc #t~post5; {9041#(<= ~counter~0 3)} is VALID [2022-04-08 14:34:17,413 INFO L290 TraceCheckUtils]: 12: Hoare triple {9016#(<= ~counter~0 2)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {9041#(<= ~counter~0 3)} is VALID [2022-04-08 14:34:17,413 INFO L290 TraceCheckUtils]: 11: Hoare triple {9016#(<= ~counter~0 2)} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {9016#(<= ~counter~0 2)} is VALID [2022-04-08 14:34:17,414 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {8949#true} {9016#(<= ~counter~0 2)} #53#return; {9016#(<= ~counter~0 2)} is VALID [2022-04-08 14:34:17,414 INFO L290 TraceCheckUtils]: 9: Hoare triple {8949#true} assume true; {8949#true} is VALID [2022-04-08 14:34:17,414 INFO L290 TraceCheckUtils]: 8: Hoare triple {8949#true} assume !(0 == ~cond); {8949#true} is VALID [2022-04-08 14:34:17,414 INFO L290 TraceCheckUtils]: 7: Hoare triple {8949#true} ~cond := #in~cond; {8949#true} is VALID [2022-04-08 14:34:17,414 INFO L272 TraceCheckUtils]: 6: Hoare triple {9016#(<= ~counter~0 2)} call assume_abort_if_not((if ~k~0 <= 256 then 1 else 0)); {8949#true} is VALID [2022-04-08 14:34:17,414 INFO L290 TraceCheckUtils]: 5: Hoare triple {9016#(<= ~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; {9016#(<= ~counter~0 2)} is VALID [2022-04-08 14:34:17,415 INFO L272 TraceCheckUtils]: 4: Hoare triple {9016#(<= ~counter~0 2)} call #t~ret6 := main(); {9016#(<= ~counter~0 2)} is VALID [2022-04-08 14:34:17,415 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {9016#(<= ~counter~0 2)} {8949#true} #61#return; {9016#(<= ~counter~0 2)} is VALID [2022-04-08 14:34:17,415 INFO L290 TraceCheckUtils]: 2: Hoare triple {9016#(<= ~counter~0 2)} assume true; {9016#(<= ~counter~0 2)} is VALID [2022-04-08 14:34:17,416 INFO L290 TraceCheckUtils]: 1: Hoare triple {8949#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; {9016#(<= ~counter~0 2)} is VALID [2022-04-08 14:34:17,416 INFO L272 TraceCheckUtils]: 0: Hoare triple {8949#true} call ULTIMATE.init(); {8949#true} is VALID [2022-04-08 14:34:17,416 INFO L134 CoverageAnalysis]: Checked inductivity of 226 backedges. 16 proven. 98 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2022-04-08 14:34:17,416 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 14:34:17,417 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1293041201] [2022-04-08 14:34:17,417 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 14:34:17,417 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [412897019] [2022-04-08 14:34:17,417 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [412897019] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 14:34:17,417 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-08 14:34:17,417 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 14 [2022-04-08 14:34:17,417 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 14:34:17,417 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1884033969] [2022-04-08 14:34:17,417 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1884033969] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 14:34:17,417 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 14:34:17,417 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-04-08 14:34:17,417 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [413137631] [2022-04-08 14:34:17,417 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 14:34:17,418 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 5.090909090909091) internal successors, (56), 10 states have internal predecessors, (56), 10 states have call successors, (12), 10 states have call predecessors, (12), 9 states have return successors, (10), 9 states have call predecessors, (10), 10 states have call successors, (10) Word has length 79 [2022-04-08 14:34:17,418 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 14:34:17,418 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 11 states, 11 states have (on average 5.090909090909091) internal successors, (56), 10 states have internal predecessors, (56), 10 states have call successors, (12), 10 states have call predecessors, (12), 9 states have return successors, (10), 9 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-08 14:34:17,481 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 78 edges. 78 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 14:34:17,481 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-04-08 14:34:17,482 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 14:34:17,482 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-04-08 14:34:17,482 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=111, Unknown=0, NotChecked=0, Total=182 [2022-04-08 14:34:17,482 INFO L87 Difference]: Start difference. First operand 78 states and 81 transitions. Second operand has 11 states, 11 states have (on average 5.090909090909091) internal successors, (56), 10 states have internal predecessors, (56), 10 states have call successors, (12), 10 states have call predecessors, (12), 9 states have return successors, (10), 9 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-08 14:34:17,811 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:34:17,811 INFO L93 Difference]: Finished difference Result 94 states and 96 transitions. [2022-04-08 14:34:17,811 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-04-08 14:34:17,811 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 5.090909090909091) internal successors, (56), 10 states have internal predecessors, (56), 10 states have call successors, (12), 10 states have call predecessors, (12), 9 states have return successors, (10), 9 states have call predecessors, (10), 10 states have call successors, (10) Word has length 79 [2022-04-08 14:34:17,811 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 14:34:17,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 5.090909090909091) internal successors, (56), 10 states have internal predecessors, (56), 10 states have call successors, (12), 10 states have call predecessors, (12), 9 states have return successors, (10), 9 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-08 14:34:17,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 94 transitions. [2022-04-08 14:34:17,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 5.090909090909091) internal successors, (56), 10 states have internal predecessors, (56), 10 states have call successors, (12), 10 states have call predecessors, (12), 9 states have return successors, (10), 9 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-08 14:34:17,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 94 transitions. [2022-04-08 14:34:17,815 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 18 states and 94 transitions. [2022-04-08 14:34:17,894 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 94 edges. 94 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 14:34:17,895 INFO L225 Difference]: With dead ends: 94 [2022-04-08 14:34:17,896 INFO L226 Difference]: Without dead ends: 84 [2022-04-08 14:34:17,896 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 164 GetRequests, 144 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=162, Invalid=258, Unknown=0, NotChecked=0, Total=420 [2022-04-08 14:34:17,896 INFO L913 BasicCegarLoop]: 32 mSDtfsCounter, 18 mSDsluCounter, 91 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 123 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-08 14:34:17,897 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [18 Valid, 123 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-08 14:34:17,897 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2022-04-08 14:34:18,003 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 84. [2022-04-08 14:34:18,003 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 14:34:18,003 INFO L82 GeneralOperation]: Start isEquivalent. First operand 84 states. Second operand has 84 states, 60 states have (on average 1.0333333333333334) internal successors, (62), 60 states have internal predecessors, (62), 13 states have call successors, (13), 12 states have call predecessors, (13), 10 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-08 14:34:18,004 INFO L74 IsIncluded]: Start isIncluded. First operand 84 states. Second operand has 84 states, 60 states have (on average 1.0333333333333334) internal successors, (62), 60 states have internal predecessors, (62), 13 states have call successors, (13), 12 states have call predecessors, (13), 10 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-08 14:34:18,004 INFO L87 Difference]: Start difference. First operand 84 states. Second operand has 84 states, 60 states have (on average 1.0333333333333334) internal successors, (62), 60 states have internal predecessors, (62), 13 states have call successors, (13), 12 states have call predecessors, (13), 10 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-08 14:34:18,005 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:34:18,006 INFO L93 Difference]: Finished difference Result 84 states and 86 transitions. [2022-04-08 14:34:18,006 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 86 transitions. [2022-04-08 14:34:18,006 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 14:34:18,006 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 14:34:18,006 INFO L74 IsIncluded]: Start isIncluded. First operand has 84 states, 60 states have (on average 1.0333333333333334) internal successors, (62), 60 states have internal predecessors, (62), 13 states have call successors, (13), 12 states have call predecessors, (13), 10 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) Second operand 84 states. [2022-04-08 14:34:18,007 INFO L87 Difference]: Start difference. First operand has 84 states, 60 states have (on average 1.0333333333333334) internal successors, (62), 60 states have internal predecessors, (62), 13 states have call successors, (13), 12 states have call predecessors, (13), 10 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) Second operand 84 states. [2022-04-08 14:34:18,008 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:34:18,008 INFO L93 Difference]: Finished difference Result 84 states and 86 transitions. [2022-04-08 14:34:18,008 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 86 transitions. [2022-04-08 14:34:18,008 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 14:34:18,009 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 14:34:18,009 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 14:34:18,009 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 14:34:18,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 60 states have (on average 1.0333333333333334) internal successors, (62), 60 states have internal predecessors, (62), 13 states have call successors, (13), 12 states have call predecessors, (13), 10 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-08 14:34:18,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 86 transitions. [2022-04-08 14:34:18,010 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 86 transitions. Word has length 79 [2022-04-08 14:34:18,011 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 14:34:18,011 INFO L478 AbstractCegarLoop]: Abstraction has 84 states and 86 transitions. [2022-04-08 14:34:18,011 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 5.090909090909091) internal successors, (56), 10 states have internal predecessors, (56), 10 states have call successors, (12), 10 states have call predecessors, (12), 9 states have return successors, (10), 9 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-08 14:34:18,011 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 84 states and 86 transitions. [2022-04-08 14:34:22,529 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 86 edges. 85 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-08 14:34:22,529 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 86 transitions. [2022-04-08 14:34:22,530 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2022-04-08 14:34:22,530 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 14:34:22,530 INFO L499 BasicCegarLoop]: trace histogram [10, 9, 9, 8, 8, 8, 8, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 14:34:22,538 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2022-04-08 14:34:22,735 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2022-04-08 14:34:22,735 INFO L403 AbstractCegarLoop]: === Iteration 18 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 14:34:22,735 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 14:34:22,736 INFO L85 PathProgramCache]: Analyzing trace with hash -1082476115, now seen corresponding path program 13 times [2022-04-08 14:34:22,736 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 14:34:22,736 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [724376347] [2022-04-08 14:34:22,824 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 14:34:22,824 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 14:34:22,824 INFO L85 PathProgramCache]: Analyzing trace with hash -1082476115, now seen corresponding path program 14 times [2022-04-08 14:34:22,825 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 14:34:22,825 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1557486741] [2022-04-08 14:34:22,825 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 14:34:22,825 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 14:34:22,838 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 14:34:22,838 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1182305899] [2022-04-08 14:34:22,838 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 14:34:22,839 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 14:34:22,839 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 14:34:22,840 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 14:34:22,875 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2022-04-08 14:34:23,956 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 14:34:23,957 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 14:34:23,958 INFO L263 TraceCheckSpWp]: Trace formula consists of 246 conjuncts, 36 conjunts are in the unsatisfiable core [2022-04-08 14:34:23,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 14:34:23,973 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 14:34:24,449 INFO L272 TraceCheckUtils]: 0: Hoare triple {9974#true} call ULTIMATE.init(); {9974#true} is VALID [2022-04-08 14:34:24,449 INFO L290 TraceCheckUtils]: 1: Hoare triple {9974#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; {9974#true} is VALID [2022-04-08 14:34:24,449 INFO L290 TraceCheckUtils]: 2: Hoare triple {9974#true} assume true; {9974#true} is VALID [2022-04-08 14:34:24,449 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {9974#true} {9974#true} #61#return; {9974#true} is VALID [2022-04-08 14:34:24,450 INFO L272 TraceCheckUtils]: 4: Hoare triple {9974#true} call #t~ret6 := main(); {9974#true} is VALID [2022-04-08 14:34:24,450 INFO L290 TraceCheckUtils]: 5: Hoare triple {9974#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; {9974#true} is VALID [2022-04-08 14:34:24,450 INFO L272 TraceCheckUtils]: 6: Hoare triple {9974#true} call assume_abort_if_not((if ~k~0 <= 256 then 1 else 0)); {9974#true} is VALID [2022-04-08 14:34:24,450 INFO L290 TraceCheckUtils]: 7: Hoare triple {9974#true} ~cond := #in~cond; {9974#true} is VALID [2022-04-08 14:34:24,450 INFO L290 TraceCheckUtils]: 8: Hoare triple {9974#true} assume !(0 == ~cond); {9974#true} is VALID [2022-04-08 14:34:24,450 INFO L290 TraceCheckUtils]: 9: Hoare triple {9974#true} assume true; {9974#true} is VALID [2022-04-08 14:34:24,450 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {9974#true} {9974#true} #53#return; {9974#true} is VALID [2022-04-08 14:34:24,450 INFO L290 TraceCheckUtils]: 11: Hoare triple {9974#true} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {10012#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-08 14:34:24,451 INFO L290 TraceCheckUtils]: 12: Hoare triple {10012#(and (= main_~c~0 0) (= main_~y~0 0))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {10012#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-08 14:34:24,451 INFO L290 TraceCheckUtils]: 13: Hoare triple {10012#(and (= main_~c~0 0) (= main_~y~0 0))} assume !!(#t~post5 < 10);havoc #t~post5; {10012#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-08 14:34:24,451 INFO L272 TraceCheckUtils]: 14: Hoare triple {10012#(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)); {9974#true} is VALID [2022-04-08 14:34:24,451 INFO L290 TraceCheckUtils]: 15: Hoare triple {9974#true} ~cond := #in~cond; {9974#true} is VALID [2022-04-08 14:34:24,451 INFO L290 TraceCheckUtils]: 16: Hoare triple {9974#true} assume !(0 == ~cond); {9974#true} is VALID [2022-04-08 14:34:24,451 INFO L290 TraceCheckUtils]: 17: Hoare triple {9974#true} assume true; {9974#true} is VALID [2022-04-08 14:34:24,452 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {9974#true} {10012#(and (= main_~c~0 0) (= main_~y~0 0))} #55#return; {10012#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-08 14:34:24,452 INFO L290 TraceCheckUtils]: 19: Hoare triple {10012#(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; {10037#(and (= main_~y~0 1) (= main_~c~0 1))} is VALID [2022-04-08 14:34:24,453 INFO L290 TraceCheckUtils]: 20: Hoare triple {10037#(and (= main_~y~0 1) (= main_~c~0 1))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {10037#(and (= main_~y~0 1) (= main_~c~0 1))} is VALID [2022-04-08 14:34:24,453 INFO L290 TraceCheckUtils]: 21: Hoare triple {10037#(and (= main_~y~0 1) (= main_~c~0 1))} assume !!(#t~post5 < 10);havoc #t~post5; {10037#(and (= main_~y~0 1) (= main_~c~0 1))} is VALID [2022-04-08 14:34:24,453 INFO L272 TraceCheckUtils]: 22: Hoare triple {10037#(and (= main_~y~0 1) (= main_~c~0 1))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {9974#true} is VALID [2022-04-08 14:34:24,453 INFO L290 TraceCheckUtils]: 23: Hoare triple {9974#true} ~cond := #in~cond; {9974#true} is VALID [2022-04-08 14:34:24,453 INFO L290 TraceCheckUtils]: 24: Hoare triple {9974#true} assume !(0 == ~cond); {9974#true} is VALID [2022-04-08 14:34:24,453 INFO L290 TraceCheckUtils]: 25: Hoare triple {9974#true} assume true; {9974#true} is VALID [2022-04-08 14:34:24,454 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {9974#true} {10037#(and (= main_~y~0 1) (= main_~c~0 1))} #55#return; {10037#(and (= main_~y~0 1) (= main_~c~0 1))} is VALID [2022-04-08 14:34:24,454 INFO L290 TraceCheckUtils]: 27: Hoare triple {10037#(and (= main_~y~0 1) (= main_~c~0 1))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {10062#(and (= (+ (- 1) main_~c~0) 1) (= (+ (- 1) main_~y~0) 1))} is VALID [2022-04-08 14:34:24,454 INFO L290 TraceCheckUtils]: 28: Hoare triple {10062#(and (= (+ (- 1) main_~c~0) 1) (= (+ (- 1) main_~y~0) 1))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {10062#(and (= (+ (- 1) main_~c~0) 1) (= (+ (- 1) main_~y~0) 1))} is VALID [2022-04-08 14:34:24,455 INFO L290 TraceCheckUtils]: 29: Hoare triple {10062#(and (= (+ (- 1) main_~c~0) 1) (= (+ (- 1) main_~y~0) 1))} assume !!(#t~post5 < 10);havoc #t~post5; {10062#(and (= (+ (- 1) main_~c~0) 1) (= (+ (- 1) main_~y~0) 1))} is VALID [2022-04-08 14:34:24,455 INFO L272 TraceCheckUtils]: 30: Hoare triple {10062#(and (= (+ (- 1) main_~c~0) 1) (= (+ (- 1) 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)); {9974#true} is VALID [2022-04-08 14:34:24,455 INFO L290 TraceCheckUtils]: 31: Hoare triple {9974#true} ~cond := #in~cond; {9974#true} is VALID [2022-04-08 14:34:24,455 INFO L290 TraceCheckUtils]: 32: Hoare triple {9974#true} assume !(0 == ~cond); {9974#true} is VALID [2022-04-08 14:34:24,455 INFO L290 TraceCheckUtils]: 33: Hoare triple {9974#true} assume true; {9974#true} is VALID [2022-04-08 14:34:24,456 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {9974#true} {10062#(and (= (+ (- 1) main_~c~0) 1) (= (+ (- 1) main_~y~0) 1))} #55#return; {10062#(and (= (+ (- 1) main_~c~0) 1) (= (+ (- 1) main_~y~0) 1))} is VALID [2022-04-08 14:34:24,456 INFO L290 TraceCheckUtils]: 35: Hoare triple {10062#(and (= (+ (- 1) main_~c~0) 1) (= (+ (- 1) 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; {10087#(and (= (+ (- 2) main_~c~0) 1) (= main_~y~0 3))} is VALID [2022-04-08 14:34:24,456 INFO L290 TraceCheckUtils]: 36: Hoare triple {10087#(and (= (+ (- 2) main_~c~0) 1) (= main_~y~0 3))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {10087#(and (= (+ (- 2) main_~c~0) 1) (= main_~y~0 3))} is VALID [2022-04-08 14:34:24,457 INFO L290 TraceCheckUtils]: 37: Hoare triple {10087#(and (= (+ (- 2) main_~c~0) 1) (= main_~y~0 3))} assume !!(#t~post5 < 10);havoc #t~post5; {10087#(and (= (+ (- 2) main_~c~0) 1) (= main_~y~0 3))} is VALID [2022-04-08 14:34:24,457 INFO L272 TraceCheckUtils]: 38: Hoare triple {10087#(and (= (+ (- 2) main_~c~0) 1) (= main_~y~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)); {9974#true} is VALID [2022-04-08 14:34:24,457 INFO L290 TraceCheckUtils]: 39: Hoare triple {9974#true} ~cond := #in~cond; {9974#true} is VALID [2022-04-08 14:34:24,457 INFO L290 TraceCheckUtils]: 40: Hoare triple {9974#true} assume !(0 == ~cond); {9974#true} is VALID [2022-04-08 14:34:24,457 INFO L290 TraceCheckUtils]: 41: Hoare triple {9974#true} assume true; {9974#true} is VALID [2022-04-08 14:34:24,457 INFO L284 TraceCheckUtils]: 42: Hoare quadruple {9974#true} {10087#(and (= (+ (- 2) main_~c~0) 1) (= main_~y~0 3))} #55#return; {10087#(and (= (+ (- 2) main_~c~0) 1) (= main_~y~0 3))} is VALID [2022-04-08 14:34:24,458 INFO L290 TraceCheckUtils]: 43: Hoare triple {10087#(and (= (+ (- 2) main_~c~0) 1) (= main_~y~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; {10112#(and (= (+ main_~c~0 (- 3)) 1) (= main_~y~0 4))} is VALID [2022-04-08 14:34:24,458 INFO L290 TraceCheckUtils]: 44: Hoare triple {10112#(and (= (+ main_~c~0 (- 3)) 1) (= main_~y~0 4))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {10112#(and (= (+ main_~c~0 (- 3)) 1) (= main_~y~0 4))} is VALID [2022-04-08 14:34:24,459 INFO L290 TraceCheckUtils]: 45: Hoare triple {10112#(and (= (+ main_~c~0 (- 3)) 1) (= main_~y~0 4))} assume !!(#t~post5 < 10);havoc #t~post5; {10112#(and (= (+ main_~c~0 (- 3)) 1) (= main_~y~0 4))} is VALID [2022-04-08 14:34:24,459 INFO L272 TraceCheckUtils]: 46: Hoare triple {10112#(and (= (+ main_~c~0 (- 3)) 1) (= main_~y~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)); {9974#true} is VALID [2022-04-08 14:34:24,459 INFO L290 TraceCheckUtils]: 47: Hoare triple {9974#true} ~cond := #in~cond; {9974#true} is VALID [2022-04-08 14:34:24,459 INFO L290 TraceCheckUtils]: 48: Hoare triple {9974#true} assume !(0 == ~cond); {9974#true} is VALID [2022-04-08 14:34:24,459 INFO L290 TraceCheckUtils]: 49: Hoare triple {9974#true} assume true; {9974#true} is VALID [2022-04-08 14:34:24,459 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {9974#true} {10112#(and (= (+ main_~c~0 (- 3)) 1) (= main_~y~0 4))} #55#return; {10112#(and (= (+ main_~c~0 (- 3)) 1) (= main_~y~0 4))} is VALID [2022-04-08 14:34:24,460 INFO L290 TraceCheckUtils]: 51: Hoare triple {10112#(and (= (+ main_~c~0 (- 3)) 1) (= main_~y~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; {10137#(and (= 5 main_~c~0) (= (+ (- 1) main_~y~0) 4))} is VALID [2022-04-08 14:34:24,460 INFO L290 TraceCheckUtils]: 52: Hoare triple {10137#(and (= 5 main_~c~0) (= (+ (- 1) main_~y~0) 4))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {10137#(and (= 5 main_~c~0) (= (+ (- 1) main_~y~0) 4))} is VALID [2022-04-08 14:34:24,460 INFO L290 TraceCheckUtils]: 53: Hoare triple {10137#(and (= 5 main_~c~0) (= (+ (- 1) main_~y~0) 4))} assume !!(#t~post5 < 10);havoc #t~post5; {10137#(and (= 5 main_~c~0) (= (+ (- 1) main_~y~0) 4))} is VALID [2022-04-08 14:34:24,461 INFO L272 TraceCheckUtils]: 54: Hoare triple {10137#(and (= 5 main_~c~0) (= (+ (- 1) main_~y~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)); {9974#true} is VALID [2022-04-08 14:34:24,461 INFO L290 TraceCheckUtils]: 55: Hoare triple {9974#true} ~cond := #in~cond; {9974#true} is VALID [2022-04-08 14:34:24,461 INFO L290 TraceCheckUtils]: 56: Hoare triple {9974#true} assume !(0 == ~cond); {9974#true} is VALID [2022-04-08 14:34:24,461 INFO L290 TraceCheckUtils]: 57: Hoare triple {9974#true} assume true; {9974#true} is VALID [2022-04-08 14:34:24,461 INFO L284 TraceCheckUtils]: 58: Hoare quadruple {9974#true} {10137#(and (= 5 main_~c~0) (= (+ (- 1) main_~y~0) 4))} #55#return; {10137#(and (= 5 main_~c~0) (= (+ (- 1) main_~y~0) 4))} is VALID [2022-04-08 14:34:24,462 INFO L290 TraceCheckUtils]: 59: Hoare triple {10137#(and (= 5 main_~c~0) (= (+ (- 1) main_~y~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; {10162#(and (= (+ (- 1) main_~c~0) 5) (= (+ (- 2) main_~y~0) 4))} is VALID [2022-04-08 14:34:24,462 INFO L290 TraceCheckUtils]: 60: Hoare triple {10162#(and (= (+ (- 1) main_~c~0) 5) (= (+ (- 2) main_~y~0) 4))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {10162#(and (= (+ (- 1) main_~c~0) 5) (= (+ (- 2) main_~y~0) 4))} is VALID [2022-04-08 14:34:24,462 INFO L290 TraceCheckUtils]: 61: Hoare triple {10162#(and (= (+ (- 1) main_~c~0) 5) (= (+ (- 2) main_~y~0) 4))} assume !!(#t~post5 < 10);havoc #t~post5; {10162#(and (= (+ (- 1) main_~c~0) 5) (= (+ (- 2) main_~y~0) 4))} is VALID [2022-04-08 14:34:24,463 INFO L272 TraceCheckUtils]: 62: Hoare triple {10162#(and (= (+ (- 1) main_~c~0) 5) (= (+ (- 2) main_~y~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)); {9974#true} is VALID [2022-04-08 14:34:24,463 INFO L290 TraceCheckUtils]: 63: Hoare triple {9974#true} ~cond := #in~cond; {9974#true} is VALID [2022-04-08 14:34:24,463 INFO L290 TraceCheckUtils]: 64: Hoare triple {9974#true} assume !(0 == ~cond); {9974#true} is VALID [2022-04-08 14:34:24,463 INFO L290 TraceCheckUtils]: 65: Hoare triple {9974#true} assume true; {9974#true} is VALID [2022-04-08 14:34:24,463 INFO L284 TraceCheckUtils]: 66: Hoare quadruple {9974#true} {10162#(and (= (+ (- 1) main_~c~0) 5) (= (+ (- 2) main_~y~0) 4))} #55#return; {10162#(and (= (+ (- 1) main_~c~0) 5) (= (+ (- 2) main_~y~0) 4))} is VALID [2022-04-08 14:34:24,464 INFO L290 TraceCheckUtils]: 67: Hoare triple {10162#(and (= (+ (- 1) main_~c~0) 5) (= (+ (- 2) main_~y~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; {10187#(and (<= main_~c~0 7) (= (+ main_~y~0 (- 3)) 4) (< 6 main_~k~0))} is VALID [2022-04-08 14:34:24,464 INFO L290 TraceCheckUtils]: 68: Hoare triple {10187#(and (<= main_~c~0 7) (= (+ main_~y~0 (- 3)) 4) (< 6 main_~k~0))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {10187#(and (<= main_~c~0 7) (= (+ main_~y~0 (- 3)) 4) (< 6 main_~k~0))} is VALID [2022-04-08 14:34:24,465 INFO L290 TraceCheckUtils]: 69: Hoare triple {10187#(and (<= main_~c~0 7) (= (+ main_~y~0 (- 3)) 4) (< 6 main_~k~0))} assume !!(#t~post5 < 10);havoc #t~post5; {10187#(and (<= main_~c~0 7) (= (+ main_~y~0 (- 3)) 4) (< 6 main_~k~0))} is VALID [2022-04-08 14:34:24,465 INFO L272 TraceCheckUtils]: 70: Hoare triple {10187#(and (<= main_~c~0 7) (= (+ main_~y~0 (- 3)) 4) (< 6 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)); {9974#true} is VALID [2022-04-08 14:34:24,465 INFO L290 TraceCheckUtils]: 71: Hoare triple {9974#true} ~cond := #in~cond; {9974#true} is VALID [2022-04-08 14:34:24,465 INFO L290 TraceCheckUtils]: 72: Hoare triple {9974#true} assume !(0 == ~cond); {9974#true} is VALID [2022-04-08 14:34:24,465 INFO L290 TraceCheckUtils]: 73: Hoare triple {9974#true} assume true; {9974#true} is VALID [2022-04-08 14:34:24,466 INFO L284 TraceCheckUtils]: 74: Hoare quadruple {9974#true} {10187#(and (<= main_~c~0 7) (= (+ main_~y~0 (- 3)) 4) (< 6 main_~k~0))} #55#return; {10187#(and (<= main_~c~0 7) (= (+ main_~y~0 (- 3)) 4) (< 6 main_~k~0))} is VALID [2022-04-08 14:34:24,466 INFO L290 TraceCheckUtils]: 75: Hoare triple {10187#(and (<= main_~c~0 7) (= (+ main_~y~0 (- 3)) 4) (< 6 main_~k~0))} assume !(~c~0 < ~k~0); {10212#(and (<= main_~k~0 7) (= (+ main_~y~0 (- 3)) 4) (< 6 main_~k~0))} is VALID [2022-04-08 14:34:24,466 INFO L272 TraceCheckUtils]: 76: Hoare triple {10212#(and (<= main_~k~0 7) (= (+ main_~y~0 (- 3)) 4) (< 6 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)); {9974#true} is VALID [2022-04-08 14:34:24,466 INFO L290 TraceCheckUtils]: 77: Hoare triple {9974#true} ~cond := #in~cond; {9974#true} is VALID [2022-04-08 14:34:24,467 INFO L290 TraceCheckUtils]: 78: Hoare triple {9974#true} assume !(0 == ~cond); {9974#true} is VALID [2022-04-08 14:34:24,467 INFO L290 TraceCheckUtils]: 79: Hoare triple {9974#true} assume true; {9974#true} is VALID [2022-04-08 14:34:24,467 INFO L284 TraceCheckUtils]: 80: Hoare quadruple {9974#true} {10212#(and (<= main_~k~0 7) (= (+ main_~y~0 (- 3)) 4) (< 6 main_~k~0))} #57#return; {10212#(and (<= main_~k~0 7) (= (+ main_~y~0 (- 3)) 4) (< 6 main_~k~0))} is VALID [2022-04-08 14:34:24,468 INFO L272 TraceCheckUtils]: 81: Hoare triple {10212#(and (<= main_~k~0 7) (= (+ main_~y~0 (- 3)) 4) (< 6 main_~k~0))} call __VERIFIER_assert((if ~k~0 * ~y~0 == ~y~0 * ~y~0 then 1 else 0)); {10231#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 14:34:24,468 INFO L290 TraceCheckUtils]: 82: Hoare triple {10231#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {10235#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 14:34:24,468 INFO L290 TraceCheckUtils]: 83: Hoare triple {10235#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {9975#false} is VALID [2022-04-08 14:34:24,468 INFO L290 TraceCheckUtils]: 84: Hoare triple {9975#false} assume !false; {9975#false} is VALID [2022-04-08 14:34:24,469 INFO L134 CoverageAnalysis]: Checked inductivity of 274 backedges. 18 proven. 112 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2022-04-08 14:34:24,469 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 14:34:24,753 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 14:34:24,753 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1557486741] [2022-04-08 14:34:24,753 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 14:34:24,753 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1182305899] [2022-04-08 14:34:24,753 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1182305899] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 14:34:24,753 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-08 14:34:24,753 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2022-04-08 14:34:24,753 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 14:34:24,754 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [724376347] [2022-04-08 14:34:24,754 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [724376347] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 14:34:24,754 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 14:34:24,754 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-04-08 14:34:24,754 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [498885541] [2022-04-08 14:34:24,754 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 14:34:24,754 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 3.0833333333333335) internal successors, (37), 12 states have internal predecessors, (37), 10 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (11), 10 states have call predecessors, (11), 10 states have call successors, (11) Word has length 85 [2022-04-08 14:34:24,755 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 14:34:24,755 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 13 states, 12 states have (on average 3.0833333333333335) internal successors, (37), 12 states have internal predecessors, (37), 10 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (11), 10 states have call predecessors, (11), 10 states have call successors, (11) [2022-04-08 14:34:24,802 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 61 edges. 61 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 14:34:24,803 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-04-08 14:34:24,803 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 14:34:24,803 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-04-08 14:34:24,803 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=198, Unknown=0, NotChecked=0, Total=240 [2022-04-08 14:34:24,803 INFO L87 Difference]: Start difference. First operand 84 states and 86 transitions. Second operand has 13 states, 12 states have (on average 3.0833333333333335) internal successors, (37), 12 states have internal predecessors, (37), 10 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (11), 10 states have call predecessors, (11), 10 states have call successors, (11) [2022-04-08 14:34:25,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:34:25,666 INFO L93 Difference]: Finished difference Result 92 states and 96 transitions. [2022-04-08 14:34:25,666 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-04-08 14:34:25,666 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 3.0833333333333335) internal successors, (37), 12 states have internal predecessors, (37), 10 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (11), 10 states have call predecessors, (11), 10 states have call successors, (11) Word has length 85 [2022-04-08 14:34:25,666 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 14:34:25,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 12 states have (on average 3.0833333333333335) internal successors, (37), 12 states have internal predecessors, (37), 10 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (11), 10 states have call predecessors, (11), 10 states have call successors, (11) [2022-04-08 14:34:25,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 74 transitions. [2022-04-08 14:34:25,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 12 states have (on average 3.0833333333333335) internal successors, (37), 12 states have internal predecessors, (37), 10 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (11), 10 states have call predecessors, (11), 10 states have call successors, (11) [2022-04-08 14:34:25,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 74 transitions. [2022-04-08 14:34:25,669 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 13 states and 74 transitions. [2022-04-08 14:34:25,730 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 74 edges. 74 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 14:34:25,731 INFO L225 Difference]: With dead ends: 92 [2022-04-08 14:34:25,731 INFO L226 Difference]: Without dead ends: 86 [2022-04-08 14:34:25,732 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 88 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=52, Invalid=254, Unknown=0, NotChecked=0, Total=306 [2022-04-08 14:34:25,732 INFO L913 BasicCegarLoop]: 55 mSDtfsCounter, 2 mSDsluCounter, 374 mSDsCounter, 0 mSdLazyCounter, 315 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 429 SdHoareTripleChecker+Invalid, 316 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 315 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-04-08 14:34:25,732 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [2 Valid, 429 Invalid, 316 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 315 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-04-08 14:34:25,733 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2022-04-08 14:34:25,842 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 86. [2022-04-08 14:34:25,843 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 14:34:25,843 INFO L82 GeneralOperation]: Start isEquivalent. First operand 86 states. Second operand has 86 states, 61 states have (on average 1.0327868852459017) internal successors, (63), 61 states have internal predecessors, (63), 14 states have call successors, (14), 12 states have call predecessors, (14), 10 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2022-04-08 14:34:25,843 INFO L74 IsIncluded]: Start isIncluded. First operand 86 states. Second operand has 86 states, 61 states have (on average 1.0327868852459017) internal successors, (63), 61 states have internal predecessors, (63), 14 states have call successors, (14), 12 states have call predecessors, (14), 10 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2022-04-08 14:34:25,843 INFO L87 Difference]: Start difference. First operand 86 states. Second operand has 86 states, 61 states have (on average 1.0327868852459017) internal successors, (63), 61 states have internal predecessors, (63), 14 states have call successors, (14), 12 states have call predecessors, (14), 10 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2022-04-08 14:34:25,845 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:34:25,845 INFO L93 Difference]: Finished difference Result 86 states and 89 transitions. [2022-04-08 14:34:25,845 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 89 transitions. [2022-04-08 14:34:25,845 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 14:34:25,845 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 14:34:25,846 INFO L74 IsIncluded]: Start isIncluded. First operand has 86 states, 61 states have (on average 1.0327868852459017) internal successors, (63), 61 states have internal predecessors, (63), 14 states have call successors, (14), 12 states have call predecessors, (14), 10 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) Second operand 86 states. [2022-04-08 14:34:25,846 INFO L87 Difference]: Start difference. First operand has 86 states, 61 states have (on average 1.0327868852459017) internal successors, (63), 61 states have internal predecessors, (63), 14 states have call successors, (14), 12 states have call predecessors, (14), 10 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) Second operand 86 states. [2022-04-08 14:34:25,847 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:34:25,847 INFO L93 Difference]: Finished difference Result 86 states and 89 transitions. [2022-04-08 14:34:25,847 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 89 transitions. [2022-04-08 14:34:25,848 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 14:34:25,848 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 14:34:25,848 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 14:34:25,848 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 14:34:25,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 61 states have (on average 1.0327868852459017) internal successors, (63), 61 states have internal predecessors, (63), 14 states have call successors, (14), 12 states have call predecessors, (14), 10 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2022-04-08 14:34:25,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 89 transitions. [2022-04-08 14:34:25,850 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 89 transitions. Word has length 85 [2022-04-08 14:34:25,850 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 14:34:25,850 INFO L478 AbstractCegarLoop]: Abstraction has 86 states and 89 transitions. [2022-04-08 14:34:25,850 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 3.0833333333333335) internal successors, (37), 12 states have internal predecessors, (37), 10 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (11), 10 states have call predecessors, (11), 10 states have call successors, (11) [2022-04-08 14:34:25,850 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 86 states and 89 transitions. [2022-04-08 14:34:30,202 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 89 edges. 88 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-08 14:34:30,202 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 89 transitions. [2022-04-08 14:34:30,203 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2022-04-08 14:34:30,203 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 14:34:30,203 INFO L499 BasicCegarLoop]: trace histogram [10, 9, 9, 9, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 14:34:30,209 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Forceful destruction successful, exit code 0 [2022-04-08 14:34:30,407 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2022-04-08 14:34:30,408 INFO L403 AbstractCegarLoop]: === Iteration 19 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 14:34:30,408 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 14:34:30,408 INFO L85 PathProgramCache]: Analyzing trace with hash 1863324712, now seen corresponding path program 13 times [2022-04-08 14:34:30,408 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 14:34:30,408 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [59255633] [2022-04-08 14:34:30,508 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 14:34:30,508 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 14:34:30,508 INFO L85 PathProgramCache]: Analyzing trace with hash 1863324712, now seen corresponding path program 14 times [2022-04-08 14:34:30,508 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 14:34:30,508 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [968012896] [2022-04-08 14:34:30,508 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 14:34:30,509 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 14:34:30,523 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 14:34:30,523 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1315221763] [2022-04-08 14:34:30,523 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 14:34:30,524 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 14:34:30,524 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 14:34:30,527 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 14:34:30,528 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2022-04-08 14:34:30,587 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 14:34:30,588 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 14:34:30,589 INFO L263 TraceCheckSpWp]: Trace formula consists of 257 conjuncts, 21 conjunts are in the unsatisfiable core [2022-04-08 14:34:30,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 14:34:30,608 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 14:34:31,098 INFO L272 TraceCheckUtils]: 0: Hoare triple {10833#true} call ULTIMATE.init(); {10833#true} is VALID [2022-04-08 14:34:31,099 INFO L290 TraceCheckUtils]: 1: Hoare triple {10833#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; {10841#(<= ~counter~0 0)} is VALID [2022-04-08 14:34:31,099 INFO L290 TraceCheckUtils]: 2: Hoare triple {10841#(<= ~counter~0 0)} assume true; {10841#(<= ~counter~0 0)} is VALID [2022-04-08 14:34:31,100 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {10841#(<= ~counter~0 0)} {10833#true} #61#return; {10841#(<= ~counter~0 0)} is VALID [2022-04-08 14:34:31,103 INFO L272 TraceCheckUtils]: 4: Hoare triple {10841#(<= ~counter~0 0)} call #t~ret6 := main(); {10841#(<= ~counter~0 0)} is VALID [2022-04-08 14:34:31,103 INFO L290 TraceCheckUtils]: 5: Hoare triple {10841#(<= ~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; {10841#(<= ~counter~0 0)} is VALID [2022-04-08 14:34:31,103 INFO L272 TraceCheckUtils]: 6: Hoare triple {10841#(<= ~counter~0 0)} call assume_abort_if_not((if ~k~0 <= 256 then 1 else 0)); {10841#(<= ~counter~0 0)} is VALID [2022-04-08 14:34:31,104 INFO L290 TraceCheckUtils]: 7: Hoare triple {10841#(<= ~counter~0 0)} ~cond := #in~cond; {10841#(<= ~counter~0 0)} is VALID [2022-04-08 14:34:31,104 INFO L290 TraceCheckUtils]: 8: Hoare triple {10841#(<= ~counter~0 0)} assume !(0 == ~cond); {10841#(<= ~counter~0 0)} is VALID [2022-04-08 14:34:31,104 INFO L290 TraceCheckUtils]: 9: Hoare triple {10841#(<= ~counter~0 0)} assume true; {10841#(<= ~counter~0 0)} is VALID [2022-04-08 14:34:31,105 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {10841#(<= ~counter~0 0)} {10841#(<= ~counter~0 0)} #53#return; {10841#(<= ~counter~0 0)} is VALID [2022-04-08 14:34:31,105 INFO L290 TraceCheckUtils]: 11: Hoare triple {10841#(<= ~counter~0 0)} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {10841#(<= ~counter~0 0)} is VALID [2022-04-08 14:34:31,106 INFO L290 TraceCheckUtils]: 12: Hoare triple {10841#(<= ~counter~0 0)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {10875#(<= ~counter~0 1)} is VALID [2022-04-08 14:34:31,106 INFO L290 TraceCheckUtils]: 13: Hoare triple {10875#(<= ~counter~0 1)} assume !!(#t~post5 < 10);havoc #t~post5; {10875#(<= ~counter~0 1)} is VALID [2022-04-08 14:34:31,107 INFO L272 TraceCheckUtils]: 14: Hoare triple {10875#(<= ~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)); {10875#(<= ~counter~0 1)} is VALID [2022-04-08 14:34:31,107 INFO L290 TraceCheckUtils]: 15: Hoare triple {10875#(<= ~counter~0 1)} ~cond := #in~cond; {10875#(<= ~counter~0 1)} is VALID [2022-04-08 14:34:31,107 INFO L290 TraceCheckUtils]: 16: Hoare triple {10875#(<= ~counter~0 1)} assume !(0 == ~cond); {10875#(<= ~counter~0 1)} is VALID [2022-04-08 14:34:31,107 INFO L290 TraceCheckUtils]: 17: Hoare triple {10875#(<= ~counter~0 1)} assume true; {10875#(<= ~counter~0 1)} is VALID [2022-04-08 14:34:31,108 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {10875#(<= ~counter~0 1)} {10875#(<= ~counter~0 1)} #55#return; {10875#(<= ~counter~0 1)} is VALID [2022-04-08 14:34:31,108 INFO L290 TraceCheckUtils]: 19: Hoare triple {10875#(<= ~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; {10875#(<= ~counter~0 1)} is VALID [2022-04-08 14:34:31,109 INFO L290 TraceCheckUtils]: 20: Hoare triple {10875#(<= ~counter~0 1)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {10900#(<= ~counter~0 2)} is VALID [2022-04-08 14:34:31,109 INFO L290 TraceCheckUtils]: 21: Hoare triple {10900#(<= ~counter~0 2)} assume !!(#t~post5 < 10);havoc #t~post5; {10900#(<= ~counter~0 2)} is VALID [2022-04-08 14:34:31,109 INFO L272 TraceCheckUtils]: 22: Hoare triple {10900#(<= ~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)); {10900#(<= ~counter~0 2)} is VALID [2022-04-08 14:34:31,110 INFO L290 TraceCheckUtils]: 23: Hoare triple {10900#(<= ~counter~0 2)} ~cond := #in~cond; {10900#(<= ~counter~0 2)} is VALID [2022-04-08 14:34:31,110 INFO L290 TraceCheckUtils]: 24: Hoare triple {10900#(<= ~counter~0 2)} assume !(0 == ~cond); {10900#(<= ~counter~0 2)} is VALID [2022-04-08 14:34:31,110 INFO L290 TraceCheckUtils]: 25: Hoare triple {10900#(<= ~counter~0 2)} assume true; {10900#(<= ~counter~0 2)} is VALID [2022-04-08 14:34:31,111 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {10900#(<= ~counter~0 2)} {10900#(<= ~counter~0 2)} #55#return; {10900#(<= ~counter~0 2)} is VALID [2022-04-08 14:34:31,111 INFO L290 TraceCheckUtils]: 27: Hoare triple {10900#(<= ~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; {10900#(<= ~counter~0 2)} is VALID [2022-04-08 14:34:31,111 INFO L290 TraceCheckUtils]: 28: Hoare triple {10900#(<= ~counter~0 2)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {10925#(<= ~counter~0 3)} is VALID [2022-04-08 14:34:31,112 INFO L290 TraceCheckUtils]: 29: Hoare triple {10925#(<= ~counter~0 3)} assume !!(#t~post5 < 10);havoc #t~post5; {10925#(<= ~counter~0 3)} is VALID [2022-04-08 14:34:31,112 INFO L272 TraceCheckUtils]: 30: Hoare triple {10925#(<= ~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)); {10925#(<= ~counter~0 3)} is VALID [2022-04-08 14:34:31,112 INFO L290 TraceCheckUtils]: 31: Hoare triple {10925#(<= ~counter~0 3)} ~cond := #in~cond; {10925#(<= ~counter~0 3)} is VALID [2022-04-08 14:34:31,113 INFO L290 TraceCheckUtils]: 32: Hoare triple {10925#(<= ~counter~0 3)} assume !(0 == ~cond); {10925#(<= ~counter~0 3)} is VALID [2022-04-08 14:34:31,113 INFO L290 TraceCheckUtils]: 33: Hoare triple {10925#(<= ~counter~0 3)} assume true; {10925#(<= ~counter~0 3)} is VALID [2022-04-08 14:34:31,113 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {10925#(<= ~counter~0 3)} {10925#(<= ~counter~0 3)} #55#return; {10925#(<= ~counter~0 3)} is VALID [2022-04-08 14:34:31,114 INFO L290 TraceCheckUtils]: 35: Hoare triple {10925#(<= ~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; {10925#(<= ~counter~0 3)} is VALID [2022-04-08 14:34:31,114 INFO L290 TraceCheckUtils]: 36: Hoare triple {10925#(<= ~counter~0 3)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {10950#(<= ~counter~0 4)} is VALID [2022-04-08 14:34:31,114 INFO L290 TraceCheckUtils]: 37: Hoare triple {10950#(<= ~counter~0 4)} assume !!(#t~post5 < 10);havoc #t~post5; {10950#(<= ~counter~0 4)} is VALID [2022-04-08 14:34:31,115 INFO L272 TraceCheckUtils]: 38: Hoare triple {10950#(<= ~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)); {10950#(<= ~counter~0 4)} is VALID [2022-04-08 14:34:31,115 INFO L290 TraceCheckUtils]: 39: Hoare triple {10950#(<= ~counter~0 4)} ~cond := #in~cond; {10950#(<= ~counter~0 4)} is VALID [2022-04-08 14:34:31,131 INFO L290 TraceCheckUtils]: 40: Hoare triple {10950#(<= ~counter~0 4)} assume !(0 == ~cond); {10950#(<= ~counter~0 4)} is VALID [2022-04-08 14:34:31,132 INFO L290 TraceCheckUtils]: 41: Hoare triple {10950#(<= ~counter~0 4)} assume true; {10950#(<= ~counter~0 4)} is VALID [2022-04-08 14:34:31,132 INFO L284 TraceCheckUtils]: 42: Hoare quadruple {10950#(<= ~counter~0 4)} {10950#(<= ~counter~0 4)} #55#return; {10950#(<= ~counter~0 4)} is VALID [2022-04-08 14:34:31,133 INFO L290 TraceCheckUtils]: 43: Hoare triple {10950#(<= ~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; {10950#(<= ~counter~0 4)} is VALID [2022-04-08 14:34:31,134 INFO L290 TraceCheckUtils]: 44: Hoare triple {10950#(<= ~counter~0 4)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {10975#(<= ~counter~0 5)} is VALID [2022-04-08 14:34:31,134 INFO L290 TraceCheckUtils]: 45: Hoare triple {10975#(<= ~counter~0 5)} assume !!(#t~post5 < 10);havoc #t~post5; {10975#(<= ~counter~0 5)} is VALID [2022-04-08 14:34:31,134 INFO L272 TraceCheckUtils]: 46: Hoare triple {10975#(<= ~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)); {10975#(<= ~counter~0 5)} is VALID [2022-04-08 14:34:31,135 INFO L290 TraceCheckUtils]: 47: Hoare triple {10975#(<= ~counter~0 5)} ~cond := #in~cond; {10975#(<= ~counter~0 5)} is VALID [2022-04-08 14:34:31,135 INFO L290 TraceCheckUtils]: 48: Hoare triple {10975#(<= ~counter~0 5)} assume !(0 == ~cond); {10975#(<= ~counter~0 5)} is VALID [2022-04-08 14:34:31,135 INFO L290 TraceCheckUtils]: 49: Hoare triple {10975#(<= ~counter~0 5)} assume true; {10975#(<= ~counter~0 5)} is VALID [2022-04-08 14:34:31,136 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {10975#(<= ~counter~0 5)} {10975#(<= ~counter~0 5)} #55#return; {10975#(<= ~counter~0 5)} is VALID [2022-04-08 14:34:31,136 INFO L290 TraceCheckUtils]: 51: Hoare triple {10975#(<= ~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; {10975#(<= ~counter~0 5)} is VALID [2022-04-08 14:34:31,137 INFO L290 TraceCheckUtils]: 52: Hoare triple {10975#(<= ~counter~0 5)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {11000#(<= ~counter~0 6)} is VALID [2022-04-08 14:34:31,137 INFO L290 TraceCheckUtils]: 53: Hoare triple {11000#(<= ~counter~0 6)} assume !!(#t~post5 < 10);havoc #t~post5; {11000#(<= ~counter~0 6)} is VALID [2022-04-08 14:34:31,137 INFO L272 TraceCheckUtils]: 54: Hoare triple {11000#(<= ~counter~0 6)} 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)); {11000#(<= ~counter~0 6)} is VALID [2022-04-08 14:34:31,138 INFO L290 TraceCheckUtils]: 55: Hoare triple {11000#(<= ~counter~0 6)} ~cond := #in~cond; {11000#(<= ~counter~0 6)} is VALID [2022-04-08 14:34:31,138 INFO L290 TraceCheckUtils]: 56: Hoare triple {11000#(<= ~counter~0 6)} assume !(0 == ~cond); {11000#(<= ~counter~0 6)} is VALID [2022-04-08 14:34:31,138 INFO L290 TraceCheckUtils]: 57: Hoare triple {11000#(<= ~counter~0 6)} assume true; {11000#(<= ~counter~0 6)} is VALID [2022-04-08 14:34:31,139 INFO L284 TraceCheckUtils]: 58: Hoare quadruple {11000#(<= ~counter~0 6)} {11000#(<= ~counter~0 6)} #55#return; {11000#(<= ~counter~0 6)} is VALID [2022-04-08 14:34:31,139 INFO L290 TraceCheckUtils]: 59: Hoare triple {11000#(<= ~counter~0 6)} 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; {11000#(<= ~counter~0 6)} is VALID [2022-04-08 14:34:31,139 INFO L290 TraceCheckUtils]: 60: Hoare triple {11000#(<= ~counter~0 6)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {11025#(<= ~counter~0 7)} is VALID [2022-04-08 14:34:31,140 INFO L290 TraceCheckUtils]: 61: Hoare triple {11025#(<= ~counter~0 7)} assume !!(#t~post5 < 10);havoc #t~post5; {11025#(<= ~counter~0 7)} is VALID [2022-04-08 14:34:31,140 INFO L272 TraceCheckUtils]: 62: Hoare triple {11025#(<= ~counter~0 7)} 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)); {11025#(<= ~counter~0 7)} is VALID [2022-04-08 14:34:31,140 INFO L290 TraceCheckUtils]: 63: Hoare triple {11025#(<= ~counter~0 7)} ~cond := #in~cond; {11025#(<= ~counter~0 7)} is VALID [2022-04-08 14:34:31,141 INFO L290 TraceCheckUtils]: 64: Hoare triple {11025#(<= ~counter~0 7)} assume !(0 == ~cond); {11025#(<= ~counter~0 7)} is VALID [2022-04-08 14:34:31,141 INFO L290 TraceCheckUtils]: 65: Hoare triple {11025#(<= ~counter~0 7)} assume true; {11025#(<= ~counter~0 7)} is VALID [2022-04-08 14:34:31,141 INFO L284 TraceCheckUtils]: 66: Hoare quadruple {11025#(<= ~counter~0 7)} {11025#(<= ~counter~0 7)} #55#return; {11025#(<= ~counter~0 7)} is VALID [2022-04-08 14:34:31,142 INFO L290 TraceCheckUtils]: 67: Hoare triple {11025#(<= ~counter~0 7)} 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; {11025#(<= ~counter~0 7)} is VALID [2022-04-08 14:34:31,142 INFO L290 TraceCheckUtils]: 68: Hoare triple {11025#(<= ~counter~0 7)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {11050#(<= ~counter~0 8)} is VALID [2022-04-08 14:34:31,142 INFO L290 TraceCheckUtils]: 69: Hoare triple {11050#(<= ~counter~0 8)} assume !!(#t~post5 < 10);havoc #t~post5; {11050#(<= ~counter~0 8)} is VALID [2022-04-08 14:34:31,143 INFO L272 TraceCheckUtils]: 70: Hoare triple {11050#(<= ~counter~0 8)} 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)); {11050#(<= ~counter~0 8)} is VALID [2022-04-08 14:34:31,143 INFO L290 TraceCheckUtils]: 71: Hoare triple {11050#(<= ~counter~0 8)} ~cond := #in~cond; {11050#(<= ~counter~0 8)} is VALID [2022-04-08 14:34:31,143 INFO L290 TraceCheckUtils]: 72: Hoare triple {11050#(<= ~counter~0 8)} assume !(0 == ~cond); {11050#(<= ~counter~0 8)} is VALID [2022-04-08 14:34:31,144 INFO L290 TraceCheckUtils]: 73: Hoare triple {11050#(<= ~counter~0 8)} assume true; {11050#(<= ~counter~0 8)} is VALID [2022-04-08 14:34:31,144 INFO L284 TraceCheckUtils]: 74: Hoare quadruple {11050#(<= ~counter~0 8)} {11050#(<= ~counter~0 8)} #55#return; {11050#(<= ~counter~0 8)} is VALID [2022-04-08 14:34:31,144 INFO L290 TraceCheckUtils]: 75: Hoare triple {11050#(<= ~counter~0 8)} 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; {11050#(<= ~counter~0 8)} is VALID [2022-04-08 14:34:31,145 INFO L290 TraceCheckUtils]: 76: Hoare triple {11050#(<= ~counter~0 8)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {11075#(<= |main_#t~post5| 8)} is VALID [2022-04-08 14:34:31,145 INFO L290 TraceCheckUtils]: 77: Hoare triple {11075#(<= |main_#t~post5| 8)} assume !(#t~post5 < 10);havoc #t~post5; {10834#false} is VALID [2022-04-08 14:34:31,145 INFO L272 TraceCheckUtils]: 78: Hoare triple {10834#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)); {10834#false} is VALID [2022-04-08 14:34:31,145 INFO L290 TraceCheckUtils]: 79: Hoare triple {10834#false} ~cond := #in~cond; {10834#false} is VALID [2022-04-08 14:34:31,145 INFO L290 TraceCheckUtils]: 80: Hoare triple {10834#false} assume !(0 == ~cond); {10834#false} is VALID [2022-04-08 14:34:31,145 INFO L290 TraceCheckUtils]: 81: Hoare triple {10834#false} assume true; {10834#false} is VALID [2022-04-08 14:34:31,145 INFO L284 TraceCheckUtils]: 82: Hoare quadruple {10834#false} {10834#false} #57#return; {10834#false} is VALID [2022-04-08 14:34:31,146 INFO L272 TraceCheckUtils]: 83: Hoare triple {10834#false} call __VERIFIER_assert((if ~k~0 * ~y~0 == ~y~0 * ~y~0 then 1 else 0)); {10834#false} is VALID [2022-04-08 14:34:31,146 INFO L290 TraceCheckUtils]: 84: Hoare triple {10834#false} ~cond := #in~cond; {10834#false} is VALID [2022-04-08 14:34:31,146 INFO L290 TraceCheckUtils]: 85: Hoare triple {10834#false} assume 0 == ~cond; {10834#false} is VALID [2022-04-08 14:34:31,146 INFO L290 TraceCheckUtils]: 86: Hoare triple {10834#false} assume !false; {10834#false} is VALID [2022-04-08 14:34:31,146 INFO L134 CoverageAnalysis]: Checked inductivity of 290 backedges. 48 proven. 240 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-08 14:34:31,146 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 14:34:31,563 INFO L290 TraceCheckUtils]: 86: Hoare triple {10834#false} assume !false; {10834#false} is VALID [2022-04-08 14:34:31,563 INFO L290 TraceCheckUtils]: 85: Hoare triple {10834#false} assume 0 == ~cond; {10834#false} is VALID [2022-04-08 14:34:31,563 INFO L290 TraceCheckUtils]: 84: Hoare triple {10834#false} ~cond := #in~cond; {10834#false} is VALID [2022-04-08 14:34:31,564 INFO L272 TraceCheckUtils]: 83: Hoare triple {10834#false} call __VERIFIER_assert((if ~k~0 * ~y~0 == ~y~0 * ~y~0 then 1 else 0)); {10834#false} is VALID [2022-04-08 14:34:31,564 INFO L284 TraceCheckUtils]: 82: Hoare quadruple {10833#true} {10834#false} #57#return; {10834#false} is VALID [2022-04-08 14:34:31,564 INFO L290 TraceCheckUtils]: 81: Hoare triple {10833#true} assume true; {10833#true} is VALID [2022-04-08 14:34:31,564 INFO L290 TraceCheckUtils]: 80: Hoare triple {10833#true} assume !(0 == ~cond); {10833#true} is VALID [2022-04-08 14:34:31,564 INFO L290 TraceCheckUtils]: 79: Hoare triple {10833#true} ~cond := #in~cond; {10833#true} is VALID [2022-04-08 14:34:31,564 INFO L272 TraceCheckUtils]: 78: Hoare triple {10834#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)); {10833#true} is VALID [2022-04-08 14:34:31,564 INFO L290 TraceCheckUtils]: 77: Hoare triple {11133#(< |main_#t~post5| 10)} assume !(#t~post5 < 10);havoc #t~post5; {10834#false} is VALID [2022-04-08 14:34:31,565 INFO L290 TraceCheckUtils]: 76: Hoare triple {11137#(< ~counter~0 10)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {11133#(< |main_#t~post5| 10)} is VALID [2022-04-08 14:34:31,565 INFO L290 TraceCheckUtils]: 75: Hoare triple {11137#(< ~counter~0 10)} 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; {11137#(< ~counter~0 10)} is VALID [2022-04-08 14:34:31,565 INFO L284 TraceCheckUtils]: 74: Hoare quadruple {10833#true} {11137#(< ~counter~0 10)} #55#return; {11137#(< ~counter~0 10)} is VALID [2022-04-08 14:34:31,565 INFO L290 TraceCheckUtils]: 73: Hoare triple {10833#true} assume true; {10833#true} is VALID [2022-04-08 14:34:31,565 INFO L290 TraceCheckUtils]: 72: Hoare triple {10833#true} assume !(0 == ~cond); {10833#true} is VALID [2022-04-08 14:34:31,566 INFO L290 TraceCheckUtils]: 71: Hoare triple {10833#true} ~cond := #in~cond; {10833#true} is VALID [2022-04-08 14:34:31,566 INFO L272 TraceCheckUtils]: 70: Hoare triple {11137#(< ~counter~0 10)} 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)); {10833#true} is VALID [2022-04-08 14:34:31,566 INFO L290 TraceCheckUtils]: 69: Hoare triple {11137#(< ~counter~0 10)} assume !!(#t~post5 < 10);havoc #t~post5; {11137#(< ~counter~0 10)} is VALID [2022-04-08 14:34:31,567 INFO L290 TraceCheckUtils]: 68: Hoare triple {11050#(<= ~counter~0 8)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {11137#(< ~counter~0 10)} is VALID [2022-04-08 14:34:31,567 INFO L290 TraceCheckUtils]: 67: Hoare triple {11050#(<= ~counter~0 8)} 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; {11050#(<= ~counter~0 8)} is VALID [2022-04-08 14:34:31,567 INFO L284 TraceCheckUtils]: 66: Hoare quadruple {10833#true} {11050#(<= ~counter~0 8)} #55#return; {11050#(<= ~counter~0 8)} is VALID [2022-04-08 14:34:31,567 INFO L290 TraceCheckUtils]: 65: Hoare triple {10833#true} assume true; {10833#true} is VALID [2022-04-08 14:34:31,568 INFO L290 TraceCheckUtils]: 64: Hoare triple {10833#true} assume !(0 == ~cond); {10833#true} is VALID [2022-04-08 14:34:31,568 INFO L290 TraceCheckUtils]: 63: Hoare triple {10833#true} ~cond := #in~cond; {10833#true} is VALID [2022-04-08 14:34:31,568 INFO L272 TraceCheckUtils]: 62: Hoare triple {11050#(<= ~counter~0 8)} 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)); {10833#true} is VALID [2022-04-08 14:34:31,568 INFO L290 TraceCheckUtils]: 61: Hoare triple {11050#(<= ~counter~0 8)} assume !!(#t~post5 < 10);havoc #t~post5; {11050#(<= ~counter~0 8)} is VALID [2022-04-08 14:34:31,568 INFO L290 TraceCheckUtils]: 60: Hoare triple {11025#(<= ~counter~0 7)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {11050#(<= ~counter~0 8)} is VALID [2022-04-08 14:34:31,569 INFO L290 TraceCheckUtils]: 59: Hoare triple {11025#(<= ~counter~0 7)} 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; {11025#(<= ~counter~0 7)} is VALID [2022-04-08 14:34:31,569 INFO L284 TraceCheckUtils]: 58: Hoare quadruple {10833#true} {11025#(<= ~counter~0 7)} #55#return; {11025#(<= ~counter~0 7)} is VALID [2022-04-08 14:34:31,569 INFO L290 TraceCheckUtils]: 57: Hoare triple {10833#true} assume true; {10833#true} is VALID [2022-04-08 14:34:31,569 INFO L290 TraceCheckUtils]: 56: Hoare triple {10833#true} assume !(0 == ~cond); {10833#true} is VALID [2022-04-08 14:34:31,569 INFO L290 TraceCheckUtils]: 55: Hoare triple {10833#true} ~cond := #in~cond; {10833#true} is VALID [2022-04-08 14:34:31,569 INFO L272 TraceCheckUtils]: 54: Hoare triple {11025#(<= ~counter~0 7)} 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)); {10833#true} is VALID [2022-04-08 14:34:31,570 INFO L290 TraceCheckUtils]: 53: Hoare triple {11025#(<= ~counter~0 7)} assume !!(#t~post5 < 10);havoc #t~post5; {11025#(<= ~counter~0 7)} is VALID [2022-04-08 14:34:31,570 INFO L290 TraceCheckUtils]: 52: Hoare triple {11000#(<= ~counter~0 6)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {11025#(<= ~counter~0 7)} is VALID [2022-04-08 14:34:31,570 INFO L290 TraceCheckUtils]: 51: Hoare triple {11000#(<= ~counter~0 6)} 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; {11000#(<= ~counter~0 6)} is VALID [2022-04-08 14:34:31,571 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {10833#true} {11000#(<= ~counter~0 6)} #55#return; {11000#(<= ~counter~0 6)} is VALID [2022-04-08 14:34:31,571 INFO L290 TraceCheckUtils]: 49: Hoare triple {10833#true} assume true; {10833#true} is VALID [2022-04-08 14:34:31,571 INFO L290 TraceCheckUtils]: 48: Hoare triple {10833#true} assume !(0 == ~cond); {10833#true} is VALID [2022-04-08 14:34:31,571 INFO L290 TraceCheckUtils]: 47: Hoare triple {10833#true} ~cond := #in~cond; {10833#true} is VALID [2022-04-08 14:34:31,571 INFO L272 TraceCheckUtils]: 46: Hoare triple {11000#(<= ~counter~0 6)} 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)); {10833#true} is VALID [2022-04-08 14:34:31,571 INFO L290 TraceCheckUtils]: 45: Hoare triple {11000#(<= ~counter~0 6)} assume !!(#t~post5 < 10);havoc #t~post5; {11000#(<= ~counter~0 6)} is VALID [2022-04-08 14:34:31,572 INFO L290 TraceCheckUtils]: 44: Hoare triple {10975#(<= ~counter~0 5)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {11000#(<= ~counter~0 6)} is VALID [2022-04-08 14:34:31,572 INFO L290 TraceCheckUtils]: 43: Hoare triple {10975#(<= ~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; {10975#(<= ~counter~0 5)} is VALID [2022-04-08 14:34:31,573 INFO L284 TraceCheckUtils]: 42: Hoare quadruple {10833#true} {10975#(<= ~counter~0 5)} #55#return; {10975#(<= ~counter~0 5)} is VALID [2022-04-08 14:34:31,573 INFO L290 TraceCheckUtils]: 41: Hoare triple {10833#true} assume true; {10833#true} is VALID [2022-04-08 14:34:31,573 INFO L290 TraceCheckUtils]: 40: Hoare triple {10833#true} assume !(0 == ~cond); {10833#true} is VALID [2022-04-08 14:34:31,573 INFO L290 TraceCheckUtils]: 39: Hoare triple {10833#true} ~cond := #in~cond; {10833#true} is VALID [2022-04-08 14:34:31,573 INFO L272 TraceCheckUtils]: 38: Hoare triple {10975#(<= ~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)); {10833#true} is VALID [2022-04-08 14:34:31,573 INFO L290 TraceCheckUtils]: 37: Hoare triple {10975#(<= ~counter~0 5)} assume !!(#t~post5 < 10);havoc #t~post5; {10975#(<= ~counter~0 5)} is VALID [2022-04-08 14:34:31,574 INFO L290 TraceCheckUtils]: 36: Hoare triple {10950#(<= ~counter~0 4)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {10975#(<= ~counter~0 5)} is VALID [2022-04-08 14:34:31,574 INFO L290 TraceCheckUtils]: 35: Hoare triple {10950#(<= ~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; {10950#(<= ~counter~0 4)} is VALID [2022-04-08 14:34:31,574 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {10833#true} {10950#(<= ~counter~0 4)} #55#return; {10950#(<= ~counter~0 4)} is VALID [2022-04-08 14:34:31,574 INFO L290 TraceCheckUtils]: 33: Hoare triple {10833#true} assume true; {10833#true} is VALID [2022-04-08 14:34:31,575 INFO L290 TraceCheckUtils]: 32: Hoare triple {10833#true} assume !(0 == ~cond); {10833#true} is VALID [2022-04-08 14:34:31,575 INFO L290 TraceCheckUtils]: 31: Hoare triple {10833#true} ~cond := #in~cond; {10833#true} is VALID [2022-04-08 14:34:31,575 INFO L272 TraceCheckUtils]: 30: Hoare triple {10950#(<= ~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)); {10833#true} is VALID [2022-04-08 14:34:31,575 INFO L290 TraceCheckUtils]: 29: Hoare triple {10950#(<= ~counter~0 4)} assume !!(#t~post5 < 10);havoc #t~post5; {10950#(<= ~counter~0 4)} is VALID [2022-04-08 14:34:31,575 INFO L290 TraceCheckUtils]: 28: Hoare triple {10925#(<= ~counter~0 3)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {10950#(<= ~counter~0 4)} is VALID [2022-04-08 14:34:31,576 INFO L290 TraceCheckUtils]: 27: Hoare triple {10925#(<= ~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; {10925#(<= ~counter~0 3)} is VALID [2022-04-08 14:34:31,576 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {10833#true} {10925#(<= ~counter~0 3)} #55#return; {10925#(<= ~counter~0 3)} is VALID [2022-04-08 14:34:31,576 INFO L290 TraceCheckUtils]: 25: Hoare triple {10833#true} assume true; {10833#true} is VALID [2022-04-08 14:34:31,576 INFO L290 TraceCheckUtils]: 24: Hoare triple {10833#true} assume !(0 == ~cond); {10833#true} is VALID [2022-04-08 14:34:31,576 INFO L290 TraceCheckUtils]: 23: Hoare triple {10833#true} ~cond := #in~cond; {10833#true} is VALID [2022-04-08 14:34:31,576 INFO L272 TraceCheckUtils]: 22: Hoare triple {10925#(<= ~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)); {10833#true} is VALID [2022-04-08 14:34:31,577 INFO L290 TraceCheckUtils]: 21: Hoare triple {10925#(<= ~counter~0 3)} assume !!(#t~post5 < 10);havoc #t~post5; {10925#(<= ~counter~0 3)} is VALID [2022-04-08 14:34:31,577 INFO L290 TraceCheckUtils]: 20: Hoare triple {10900#(<= ~counter~0 2)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {10925#(<= ~counter~0 3)} is VALID [2022-04-08 14:34:31,577 INFO L290 TraceCheckUtils]: 19: Hoare triple {10900#(<= ~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; {10900#(<= ~counter~0 2)} is VALID [2022-04-08 14:34:31,578 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {10833#true} {10900#(<= ~counter~0 2)} #55#return; {10900#(<= ~counter~0 2)} is VALID [2022-04-08 14:34:31,578 INFO L290 TraceCheckUtils]: 17: Hoare triple {10833#true} assume true; {10833#true} is VALID [2022-04-08 14:34:31,578 INFO L290 TraceCheckUtils]: 16: Hoare triple {10833#true} assume !(0 == ~cond); {10833#true} is VALID [2022-04-08 14:34:31,578 INFO L290 TraceCheckUtils]: 15: Hoare triple {10833#true} ~cond := #in~cond; {10833#true} is VALID [2022-04-08 14:34:31,578 INFO L272 TraceCheckUtils]: 14: Hoare triple {10900#(<= ~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)); {10833#true} is VALID [2022-04-08 14:34:31,578 INFO L290 TraceCheckUtils]: 13: Hoare triple {10900#(<= ~counter~0 2)} assume !!(#t~post5 < 10);havoc #t~post5; {10900#(<= ~counter~0 2)} is VALID [2022-04-08 14:34:31,579 INFO L290 TraceCheckUtils]: 12: Hoare triple {10875#(<= ~counter~0 1)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {10900#(<= ~counter~0 2)} is VALID [2022-04-08 14:34:31,579 INFO L290 TraceCheckUtils]: 11: Hoare triple {10875#(<= ~counter~0 1)} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {10875#(<= ~counter~0 1)} is VALID [2022-04-08 14:34:31,580 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {10833#true} {10875#(<= ~counter~0 1)} #53#return; {10875#(<= ~counter~0 1)} is VALID [2022-04-08 14:34:31,580 INFO L290 TraceCheckUtils]: 9: Hoare triple {10833#true} assume true; {10833#true} is VALID [2022-04-08 14:34:31,580 INFO L290 TraceCheckUtils]: 8: Hoare triple {10833#true} assume !(0 == ~cond); {10833#true} is VALID [2022-04-08 14:34:31,580 INFO L290 TraceCheckUtils]: 7: Hoare triple {10833#true} ~cond := #in~cond; {10833#true} is VALID [2022-04-08 14:34:31,580 INFO L272 TraceCheckUtils]: 6: Hoare triple {10875#(<= ~counter~0 1)} call assume_abort_if_not((if ~k~0 <= 256 then 1 else 0)); {10833#true} is VALID [2022-04-08 14:34:31,580 INFO L290 TraceCheckUtils]: 5: Hoare triple {10875#(<= ~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; {10875#(<= ~counter~0 1)} is VALID [2022-04-08 14:34:31,580 INFO L272 TraceCheckUtils]: 4: Hoare triple {10875#(<= ~counter~0 1)} call #t~ret6 := main(); {10875#(<= ~counter~0 1)} is VALID [2022-04-08 14:34:31,581 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {10875#(<= ~counter~0 1)} {10833#true} #61#return; {10875#(<= ~counter~0 1)} is VALID [2022-04-08 14:34:31,581 INFO L290 TraceCheckUtils]: 2: Hoare triple {10875#(<= ~counter~0 1)} assume true; {10875#(<= ~counter~0 1)} is VALID [2022-04-08 14:34:31,582 INFO L290 TraceCheckUtils]: 1: Hoare triple {10833#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; {10875#(<= ~counter~0 1)} is VALID [2022-04-08 14:34:31,582 INFO L272 TraceCheckUtils]: 0: Hoare triple {10833#true} call ULTIMATE.init(); {10833#true} is VALID [2022-04-08 14:34:31,582 INFO L134 CoverageAnalysis]: Checked inductivity of 290 backedges. 18 proven. 128 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2022-04-08 14:34:31,582 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 14:34:31,582 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [968012896] [2022-04-08 14:34:31,582 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 14:34:31,582 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1315221763] [2022-04-08 14:34:31,582 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1315221763] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 14:34:31,582 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-08 14:34:31,583 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 14 [2022-04-08 14:34:31,583 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 14:34:31,583 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [59255633] [2022-04-08 14:34:31,583 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [59255633] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 14:34:31,583 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 14:34:31,583 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-04-08 14:34:31,583 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [739040634] [2022-04-08 14:34:31,583 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 14:34:31,584 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 5.166666666666667) internal successors, (62), 11 states have internal predecessors, (62), 11 states have call successors, (13), 11 states have call predecessors, (13), 10 states have return successors, (11), 10 states have call predecessors, (11), 11 states have call successors, (11) Word has length 87 [2022-04-08 14:34:31,584 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 14:34:31,584 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 12 states, 12 states have (on average 5.166666666666667) internal successors, (62), 11 states have internal predecessors, (62), 11 states have call successors, (13), 11 states have call predecessors, (13), 10 states have return successors, (11), 10 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-08 14:34:31,647 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 86 edges. 86 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 14:34:31,647 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-04-08 14:34:31,647 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 14:34:31,647 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-04-08 14:34:31,647 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=111, Unknown=0, NotChecked=0, Total=182 [2022-04-08 14:34:31,648 INFO L87 Difference]: Start difference. First operand 86 states and 89 transitions. Second operand has 12 states, 12 states have (on average 5.166666666666667) internal successors, (62), 11 states have internal predecessors, (62), 11 states have call successors, (13), 11 states have call predecessors, (13), 10 states have return successors, (11), 10 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-08 14:34:31,995 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:34:31,995 INFO L93 Difference]: Finished difference Result 102 states and 104 transitions. [2022-04-08 14:34:31,995 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-04-08 14:34:31,996 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 5.166666666666667) internal successors, (62), 11 states have internal predecessors, (62), 11 states have call successors, (13), 11 states have call predecessors, (13), 10 states have return successors, (11), 10 states have call predecessors, (11), 11 states have call successors, (11) Word has length 87 [2022-04-08 14:34:31,996 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 14:34:31,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 5.166666666666667) internal successors, (62), 11 states have internal predecessors, (62), 11 states have call successors, (13), 11 states have call predecessors, (13), 10 states have return successors, (11), 10 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-08 14:34:31,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 102 transitions. [2022-04-08 14:34:31,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 5.166666666666667) internal successors, (62), 11 states have internal predecessors, (62), 11 states have call successors, (13), 11 states have call predecessors, (13), 10 states have return successors, (11), 10 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-08 14:34:32,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 102 transitions. [2022-04-08 14:34:32,000 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 20 states and 102 transitions. [2022-04-08 14:34:32,092 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 102 edges. 102 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 14:34:32,094 INFO L225 Difference]: With dead ends: 102 [2022-04-08 14:34:32,094 INFO L226 Difference]: Without dead ends: 92 [2022-04-08 14:34:32,094 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 181 GetRequests, 160 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=175, Invalid=287, Unknown=0, NotChecked=0, Total=462 [2022-04-08 14:34:32,095 INFO L913 BasicCegarLoop]: 33 mSDtfsCounter, 18 mSDsluCounter, 87 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 120 SdHoareTripleChecker+Invalid, 60 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-08 14:34:32,095 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [18 Valid, 120 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-08 14:34:32,095 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2022-04-08 14:34:32,243 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 92. [2022-04-08 14:34:32,243 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 14:34:32,243 INFO L82 GeneralOperation]: Start isEquivalent. First operand 92 states. Second operand has 92 states, 66 states have (on average 1.0303030303030303) internal successors, (68), 66 states have internal predecessors, (68), 14 states have call successors, (14), 13 states have call predecessors, (14), 11 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2022-04-08 14:34:32,243 INFO L74 IsIncluded]: Start isIncluded. First operand 92 states. Second operand has 92 states, 66 states have (on average 1.0303030303030303) internal successors, (68), 66 states have internal predecessors, (68), 14 states have call successors, (14), 13 states have call predecessors, (14), 11 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2022-04-08 14:34:32,243 INFO L87 Difference]: Start difference. First operand 92 states. Second operand has 92 states, 66 states have (on average 1.0303030303030303) internal successors, (68), 66 states have internal predecessors, (68), 14 states have call successors, (14), 13 states have call predecessors, (14), 11 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2022-04-08 14:34:32,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:34:32,245 INFO L93 Difference]: Finished difference Result 92 states and 94 transitions. [2022-04-08 14:34:32,245 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 94 transitions. [2022-04-08 14:34:32,245 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 14:34:32,245 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 14:34:32,246 INFO L74 IsIncluded]: Start isIncluded. First operand has 92 states, 66 states have (on average 1.0303030303030303) internal successors, (68), 66 states have internal predecessors, (68), 14 states have call successors, (14), 13 states have call predecessors, (14), 11 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) Second operand 92 states. [2022-04-08 14:34:32,246 INFO L87 Difference]: Start difference. First operand has 92 states, 66 states have (on average 1.0303030303030303) internal successors, (68), 66 states have internal predecessors, (68), 14 states have call successors, (14), 13 states have call predecessors, (14), 11 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) Second operand 92 states. [2022-04-08 14:34:32,248 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:34:32,248 INFO L93 Difference]: Finished difference Result 92 states and 94 transitions. [2022-04-08 14:34:32,248 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 94 transitions. [2022-04-08 14:34:32,248 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 14:34:32,248 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 14:34:32,248 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 14:34:32,248 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 14:34:32,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 66 states have (on average 1.0303030303030303) internal successors, (68), 66 states have internal predecessors, (68), 14 states have call successors, (14), 13 states have call predecessors, (14), 11 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2022-04-08 14:34:32,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 94 transitions. [2022-04-08 14:34:32,250 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 94 transitions. Word has length 87 [2022-04-08 14:34:32,250 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 14:34:32,250 INFO L478 AbstractCegarLoop]: Abstraction has 92 states and 94 transitions. [2022-04-08 14:34:32,250 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 5.166666666666667) internal successors, (62), 11 states have internal predecessors, (62), 11 states have call successors, (13), 11 states have call predecessors, (13), 10 states have return successors, (11), 10 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-08 14:34:32,251 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 92 states and 94 transitions. [2022-04-08 14:34:36,693 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 94 edges. 93 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-08 14:34:36,693 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 94 transitions. [2022-04-08 14:34:36,694 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2022-04-08 14:34:36,694 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 14:34:36,694 INFO L499 BasicCegarLoop]: trace histogram [11, 10, 10, 9, 9, 9, 9, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 14:34:36,711 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Forceful destruction successful, exit code 0 [2022-04-08 14:34:36,894 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 14:34:36,895 INFO L403 AbstractCegarLoop]: === Iteration 20 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 14:34:36,895 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 14:34:36,895 INFO L85 PathProgramCache]: Analyzing trace with hash -243875698, now seen corresponding path program 15 times [2022-04-08 14:34:36,895 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 14:34:36,895 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1665297238] [2022-04-08 14:34:36,987 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 14:34:36,987 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 14:34:36,987 INFO L85 PathProgramCache]: Analyzing trace with hash -243875698, now seen corresponding path program 16 times [2022-04-08 14:34:36,987 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 14:34:36,987 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1360657428] [2022-04-08 14:34:36,987 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 14:34:36,987 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 14:34:36,999 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 14:34:37,000 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1416252062] [2022-04-08 14:34:37,000 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-08 14:34:37,000 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 14:34:37,000 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 14:34:37,001 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 14:34:37,006 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2022-04-08 14:34:37,057 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-08 14:34:37,057 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 14:34:37,058 INFO L263 TraceCheckSpWp]: Trace formula consists of 194 conjuncts, 40 conjunts are in the unsatisfiable core [2022-04-08 14:34:37,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 14:34:37,074 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 14:34:37,574 INFO L272 TraceCheckUtils]: 0: Hoare triple {11956#true} call ULTIMATE.init(); {11956#true} is VALID [2022-04-08 14:34:37,574 INFO L290 TraceCheckUtils]: 1: Hoare triple {11956#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; {11956#true} is VALID [2022-04-08 14:34:37,575 INFO L290 TraceCheckUtils]: 2: Hoare triple {11956#true} assume true; {11956#true} is VALID [2022-04-08 14:34:37,575 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {11956#true} {11956#true} #61#return; {11956#true} is VALID [2022-04-08 14:34:37,575 INFO L272 TraceCheckUtils]: 4: Hoare triple {11956#true} call #t~ret6 := main(); {11956#true} is VALID [2022-04-08 14:34:37,575 INFO L290 TraceCheckUtils]: 5: Hoare triple {11956#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; {11956#true} is VALID [2022-04-08 14:34:37,575 INFO L272 TraceCheckUtils]: 6: Hoare triple {11956#true} call assume_abort_if_not((if ~k~0 <= 256 then 1 else 0)); {11956#true} is VALID [2022-04-08 14:34:37,575 INFO L290 TraceCheckUtils]: 7: Hoare triple {11956#true} ~cond := #in~cond; {11956#true} is VALID [2022-04-08 14:34:37,575 INFO L290 TraceCheckUtils]: 8: Hoare triple {11956#true} assume !(0 == ~cond); {11956#true} is VALID [2022-04-08 14:34:37,575 INFO L290 TraceCheckUtils]: 9: Hoare triple {11956#true} assume true; {11956#true} is VALID [2022-04-08 14:34:37,575 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {11956#true} {11956#true} #53#return; {11956#true} is VALID [2022-04-08 14:34:37,575 INFO L290 TraceCheckUtils]: 11: Hoare triple {11956#true} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {11994#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-08 14:34:37,576 INFO L290 TraceCheckUtils]: 12: Hoare triple {11994#(and (= main_~c~0 0) (= main_~y~0 0))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {11994#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-08 14:34:37,576 INFO L290 TraceCheckUtils]: 13: Hoare triple {11994#(and (= main_~c~0 0) (= main_~y~0 0))} assume !!(#t~post5 < 10);havoc #t~post5; {11994#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-08 14:34:37,576 INFO L272 TraceCheckUtils]: 14: Hoare triple {11994#(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)); {11956#true} is VALID [2022-04-08 14:34:37,576 INFO L290 TraceCheckUtils]: 15: Hoare triple {11956#true} ~cond := #in~cond; {11956#true} is VALID [2022-04-08 14:34:37,576 INFO L290 TraceCheckUtils]: 16: Hoare triple {11956#true} assume !(0 == ~cond); {11956#true} is VALID [2022-04-08 14:34:37,577 INFO L290 TraceCheckUtils]: 17: Hoare triple {11956#true} assume true; {11956#true} is VALID [2022-04-08 14:34:37,577 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {11956#true} {11994#(and (= main_~c~0 0) (= main_~y~0 0))} #55#return; {11994#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-08 14:34:37,577 INFO L290 TraceCheckUtils]: 19: Hoare triple {11994#(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; {12019#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} is VALID [2022-04-08 14:34:37,578 INFO L290 TraceCheckUtils]: 20: Hoare triple {12019#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {12019#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} is VALID [2022-04-08 14:34:37,578 INFO L290 TraceCheckUtils]: 21: Hoare triple {12019#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} assume !!(#t~post5 < 10);havoc #t~post5; {12019#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} is VALID [2022-04-08 14:34:37,578 INFO L272 TraceCheckUtils]: 22: Hoare triple {12019#(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)); {11956#true} is VALID [2022-04-08 14:34:37,578 INFO L290 TraceCheckUtils]: 23: Hoare triple {11956#true} ~cond := #in~cond; {11956#true} is VALID [2022-04-08 14:34:37,578 INFO L290 TraceCheckUtils]: 24: Hoare triple {11956#true} assume !(0 == ~cond); {11956#true} is VALID [2022-04-08 14:34:37,578 INFO L290 TraceCheckUtils]: 25: Hoare triple {11956#true} assume true; {11956#true} is VALID [2022-04-08 14:34:37,579 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {11956#true} {12019#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} #55#return; {12019#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} is VALID [2022-04-08 14:34:37,579 INFO L290 TraceCheckUtils]: 27: Hoare triple {12019#(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; {12044#(and (= main_~y~0 2) (= (+ (- 1) main_~c~0) 1))} is VALID [2022-04-08 14:34:37,583 INFO L290 TraceCheckUtils]: 28: Hoare triple {12044#(and (= main_~y~0 2) (= (+ (- 1) main_~c~0) 1))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {12044#(and (= main_~y~0 2) (= (+ (- 1) main_~c~0) 1))} is VALID [2022-04-08 14:34:37,584 INFO L290 TraceCheckUtils]: 29: Hoare triple {12044#(and (= main_~y~0 2) (= (+ (- 1) main_~c~0) 1))} assume !!(#t~post5 < 10);havoc #t~post5; {12044#(and (= main_~y~0 2) (= (+ (- 1) main_~c~0) 1))} is VALID [2022-04-08 14:34:37,584 INFO L272 TraceCheckUtils]: 30: Hoare triple {12044#(and (= main_~y~0 2) (= (+ (- 1) main_~c~0) 1))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {11956#true} is VALID [2022-04-08 14:34:37,584 INFO L290 TraceCheckUtils]: 31: Hoare triple {11956#true} ~cond := #in~cond; {11956#true} is VALID [2022-04-08 14:34:37,584 INFO L290 TraceCheckUtils]: 32: Hoare triple {11956#true} assume !(0 == ~cond); {11956#true} is VALID [2022-04-08 14:34:37,584 INFO L290 TraceCheckUtils]: 33: Hoare triple {11956#true} assume true; {11956#true} is VALID [2022-04-08 14:34:37,585 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {11956#true} {12044#(and (= main_~y~0 2) (= (+ (- 1) main_~c~0) 1))} #55#return; {12044#(and (= main_~y~0 2) (= (+ (- 1) main_~c~0) 1))} is VALID [2022-04-08 14:34:37,585 INFO L290 TraceCheckUtils]: 35: Hoare triple {12044#(and (= main_~y~0 2) (= (+ (- 1) main_~c~0) 1))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {12069#(and (= (+ (- 2) main_~c~0) 1) (= main_~y~0 3))} is VALID [2022-04-08 14:34:37,585 INFO L290 TraceCheckUtils]: 36: Hoare triple {12069#(and (= (+ (- 2) main_~c~0) 1) (= main_~y~0 3))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {12069#(and (= (+ (- 2) main_~c~0) 1) (= main_~y~0 3))} is VALID [2022-04-08 14:34:37,586 INFO L290 TraceCheckUtils]: 37: Hoare triple {12069#(and (= (+ (- 2) main_~c~0) 1) (= main_~y~0 3))} assume !!(#t~post5 < 10);havoc #t~post5; {12069#(and (= (+ (- 2) main_~c~0) 1) (= main_~y~0 3))} is VALID [2022-04-08 14:34:37,586 INFO L272 TraceCheckUtils]: 38: Hoare triple {12069#(and (= (+ (- 2) main_~c~0) 1) (= main_~y~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)); {11956#true} is VALID [2022-04-08 14:34:37,586 INFO L290 TraceCheckUtils]: 39: Hoare triple {11956#true} ~cond := #in~cond; {11956#true} is VALID [2022-04-08 14:34:37,586 INFO L290 TraceCheckUtils]: 40: Hoare triple {11956#true} assume !(0 == ~cond); {11956#true} is VALID [2022-04-08 14:34:37,586 INFO L290 TraceCheckUtils]: 41: Hoare triple {11956#true} assume true; {11956#true} is VALID [2022-04-08 14:34:37,586 INFO L284 TraceCheckUtils]: 42: Hoare quadruple {11956#true} {12069#(and (= (+ (- 2) main_~c~0) 1) (= main_~y~0 3))} #55#return; {12069#(and (= (+ (- 2) main_~c~0) 1) (= main_~y~0 3))} is VALID [2022-04-08 14:34:37,587 INFO L290 TraceCheckUtils]: 43: Hoare triple {12069#(and (= (+ (- 2) main_~c~0) 1) (= main_~y~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; {12094#(and (= main_~y~0 4) (= main_~c~0 4))} is VALID [2022-04-08 14:34:37,587 INFO L290 TraceCheckUtils]: 44: Hoare triple {12094#(and (= main_~y~0 4) (= main_~c~0 4))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {12094#(and (= main_~y~0 4) (= main_~c~0 4))} is VALID [2022-04-08 14:34:37,588 INFO L290 TraceCheckUtils]: 45: Hoare triple {12094#(and (= main_~y~0 4) (= main_~c~0 4))} assume !!(#t~post5 < 10);havoc #t~post5; {12094#(and (= main_~y~0 4) (= main_~c~0 4))} is VALID [2022-04-08 14:34:37,588 INFO L272 TraceCheckUtils]: 46: Hoare triple {12094#(and (= main_~y~0 4) (= 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)); {11956#true} is VALID [2022-04-08 14:34:37,588 INFO L290 TraceCheckUtils]: 47: Hoare triple {11956#true} ~cond := #in~cond; {11956#true} is VALID [2022-04-08 14:34:37,588 INFO L290 TraceCheckUtils]: 48: Hoare triple {11956#true} assume !(0 == ~cond); {11956#true} is VALID [2022-04-08 14:34:37,588 INFO L290 TraceCheckUtils]: 49: Hoare triple {11956#true} assume true; {11956#true} is VALID [2022-04-08 14:34:37,588 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {11956#true} {12094#(and (= main_~y~0 4) (= main_~c~0 4))} #55#return; {12094#(and (= main_~y~0 4) (= main_~c~0 4))} is VALID [2022-04-08 14:34:37,589 INFO L290 TraceCheckUtils]: 51: Hoare triple {12094#(and (= main_~y~0 4) (= main_~c~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; {12119#(and (= 5 main_~c~0) (= 5 main_~y~0))} is VALID [2022-04-08 14:34:37,589 INFO L290 TraceCheckUtils]: 52: Hoare triple {12119#(and (= 5 main_~c~0) (= 5 main_~y~0))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {12119#(and (= 5 main_~c~0) (= 5 main_~y~0))} is VALID [2022-04-08 14:34:37,590 INFO L290 TraceCheckUtils]: 53: Hoare triple {12119#(and (= 5 main_~c~0) (= 5 main_~y~0))} assume !!(#t~post5 < 10);havoc #t~post5; {12119#(and (= 5 main_~c~0) (= 5 main_~y~0))} is VALID [2022-04-08 14:34:37,590 INFO L272 TraceCheckUtils]: 54: Hoare triple {12119#(and (= 5 main_~c~0) (= 5 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)); {11956#true} is VALID [2022-04-08 14:34:37,590 INFO L290 TraceCheckUtils]: 55: Hoare triple {11956#true} ~cond := #in~cond; {11956#true} is VALID [2022-04-08 14:34:37,590 INFO L290 TraceCheckUtils]: 56: Hoare triple {11956#true} assume !(0 == ~cond); {11956#true} is VALID [2022-04-08 14:34:37,590 INFO L290 TraceCheckUtils]: 57: Hoare triple {11956#true} assume true; {11956#true} is VALID [2022-04-08 14:34:37,590 INFO L284 TraceCheckUtils]: 58: Hoare quadruple {11956#true} {12119#(and (= 5 main_~c~0) (= 5 main_~y~0))} #55#return; {12119#(and (= 5 main_~c~0) (= 5 main_~y~0))} is VALID [2022-04-08 14:34:37,591 INFO L290 TraceCheckUtils]: 59: Hoare triple {12119#(and (= 5 main_~c~0) (= 5 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; {12144#(and (= main_~y~0 6) (= main_~c~0 6))} is VALID [2022-04-08 14:34:37,591 INFO L290 TraceCheckUtils]: 60: Hoare triple {12144#(and (= main_~y~0 6) (= main_~c~0 6))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {12144#(and (= main_~y~0 6) (= main_~c~0 6))} is VALID [2022-04-08 14:34:37,591 INFO L290 TraceCheckUtils]: 61: Hoare triple {12144#(and (= main_~y~0 6) (= main_~c~0 6))} assume !!(#t~post5 < 10);havoc #t~post5; {12144#(and (= main_~y~0 6) (= main_~c~0 6))} is VALID [2022-04-08 14:34:37,591 INFO L272 TraceCheckUtils]: 62: Hoare triple {12144#(and (= main_~y~0 6) (= main_~c~0 6))} 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)); {11956#true} is VALID [2022-04-08 14:34:37,592 INFO L290 TraceCheckUtils]: 63: Hoare triple {11956#true} ~cond := #in~cond; {11956#true} is VALID [2022-04-08 14:34:37,592 INFO L290 TraceCheckUtils]: 64: Hoare triple {11956#true} assume !(0 == ~cond); {11956#true} is VALID [2022-04-08 14:34:37,592 INFO L290 TraceCheckUtils]: 65: Hoare triple {11956#true} assume true; {11956#true} is VALID [2022-04-08 14:34:37,592 INFO L284 TraceCheckUtils]: 66: Hoare quadruple {11956#true} {12144#(and (= main_~y~0 6) (= main_~c~0 6))} #55#return; {12144#(and (= main_~y~0 6) (= main_~c~0 6))} is VALID [2022-04-08 14:34:37,593 INFO L290 TraceCheckUtils]: 67: Hoare triple {12144#(and (= main_~y~0 6) (= main_~c~0 6))} 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; {12169#(and (= 7 main_~c~0) (= 6 (+ (- 1) main_~y~0)))} is VALID [2022-04-08 14:34:37,593 INFO L290 TraceCheckUtils]: 68: Hoare triple {12169#(and (= 7 main_~c~0) (= 6 (+ (- 1) main_~y~0)))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {12169#(and (= 7 main_~c~0) (= 6 (+ (- 1) main_~y~0)))} is VALID [2022-04-08 14:34:37,593 INFO L290 TraceCheckUtils]: 69: Hoare triple {12169#(and (= 7 main_~c~0) (= 6 (+ (- 1) main_~y~0)))} assume !!(#t~post5 < 10);havoc #t~post5; {12169#(and (= 7 main_~c~0) (= 6 (+ (- 1) main_~y~0)))} is VALID [2022-04-08 14:34:37,593 INFO L272 TraceCheckUtils]: 70: Hoare triple {12169#(and (= 7 main_~c~0) (= 6 (+ (- 1) 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)); {11956#true} is VALID [2022-04-08 14:34:37,593 INFO L290 TraceCheckUtils]: 71: Hoare triple {11956#true} ~cond := #in~cond; {11956#true} is VALID [2022-04-08 14:34:37,593 INFO L290 TraceCheckUtils]: 72: Hoare triple {11956#true} assume !(0 == ~cond); {11956#true} is VALID [2022-04-08 14:34:37,594 INFO L290 TraceCheckUtils]: 73: Hoare triple {11956#true} assume true; {11956#true} is VALID [2022-04-08 14:34:37,594 INFO L284 TraceCheckUtils]: 74: Hoare quadruple {11956#true} {12169#(and (= 7 main_~c~0) (= 6 (+ (- 1) main_~y~0)))} #55#return; {12169#(and (= 7 main_~c~0) (= 6 (+ (- 1) main_~y~0)))} is VALID [2022-04-08 14:34:37,594 INFO L290 TraceCheckUtils]: 75: Hoare triple {12169#(and (= 7 main_~c~0) (= 6 (+ (- 1) 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; {12194#(and (< 7 main_~k~0) (= main_~y~0 8) (<= main_~c~0 8))} is VALID [2022-04-08 14:34:37,595 INFO L290 TraceCheckUtils]: 76: Hoare triple {12194#(and (< 7 main_~k~0) (= main_~y~0 8) (<= main_~c~0 8))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {12194#(and (< 7 main_~k~0) (= main_~y~0 8) (<= main_~c~0 8))} is VALID [2022-04-08 14:34:37,595 INFO L290 TraceCheckUtils]: 77: Hoare triple {12194#(and (< 7 main_~k~0) (= main_~y~0 8) (<= main_~c~0 8))} assume !!(#t~post5 < 10);havoc #t~post5; {12194#(and (< 7 main_~k~0) (= main_~y~0 8) (<= main_~c~0 8))} is VALID [2022-04-08 14:34:37,595 INFO L272 TraceCheckUtils]: 78: Hoare triple {12194#(and (< 7 main_~k~0) (= main_~y~0 8) (<= main_~c~0 8))} 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)); {11956#true} is VALID [2022-04-08 14:34:37,595 INFO L290 TraceCheckUtils]: 79: Hoare triple {11956#true} ~cond := #in~cond; {11956#true} is VALID [2022-04-08 14:34:37,595 INFO L290 TraceCheckUtils]: 80: Hoare triple {11956#true} assume !(0 == ~cond); {11956#true} is VALID [2022-04-08 14:34:37,595 INFO L290 TraceCheckUtils]: 81: Hoare triple {11956#true} assume true; {11956#true} is VALID [2022-04-08 14:34:37,596 INFO L284 TraceCheckUtils]: 82: Hoare quadruple {11956#true} {12194#(and (< 7 main_~k~0) (= main_~y~0 8) (<= main_~c~0 8))} #55#return; {12194#(and (< 7 main_~k~0) (= main_~y~0 8) (<= main_~c~0 8))} is VALID [2022-04-08 14:34:37,596 INFO L290 TraceCheckUtils]: 83: Hoare triple {12194#(and (< 7 main_~k~0) (= main_~y~0 8) (<= main_~c~0 8))} assume !(~c~0 < ~k~0); {12219#(and (< 7 main_~k~0) (= main_~y~0 8) (<= main_~k~0 8))} is VALID [2022-04-08 14:34:37,597 INFO L272 TraceCheckUtils]: 84: Hoare triple {12219#(and (< 7 main_~k~0) (= main_~y~0 8) (<= main_~k~0 8))} 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)); {11956#true} is VALID [2022-04-08 14:34:37,597 INFO L290 TraceCheckUtils]: 85: Hoare triple {11956#true} ~cond := #in~cond; {11956#true} is VALID [2022-04-08 14:34:37,597 INFO L290 TraceCheckUtils]: 86: Hoare triple {11956#true} assume !(0 == ~cond); {11956#true} is VALID [2022-04-08 14:34:37,597 INFO L290 TraceCheckUtils]: 87: Hoare triple {11956#true} assume true; {11956#true} is VALID [2022-04-08 14:34:37,599 INFO L284 TraceCheckUtils]: 88: Hoare quadruple {11956#true} {12219#(and (< 7 main_~k~0) (= main_~y~0 8) (<= main_~k~0 8))} #57#return; {12219#(and (< 7 main_~k~0) (= main_~y~0 8) (<= main_~k~0 8))} is VALID [2022-04-08 14:34:37,600 INFO L272 TraceCheckUtils]: 89: Hoare triple {12219#(and (< 7 main_~k~0) (= main_~y~0 8) (<= main_~k~0 8))} call __VERIFIER_assert((if ~k~0 * ~y~0 == ~y~0 * ~y~0 then 1 else 0)); {12238#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 14:34:37,601 INFO L290 TraceCheckUtils]: 90: Hoare triple {12238#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {12242#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 14:34:37,601 INFO L290 TraceCheckUtils]: 91: Hoare triple {12242#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {11957#false} is VALID [2022-04-08 14:34:37,601 INFO L290 TraceCheckUtils]: 92: Hoare triple {11957#false} assume !false; {11957#false} is VALID [2022-04-08 14:34:37,602 INFO L134 CoverageAnalysis]: Checked inductivity of 344 backedges. 20 proven. 144 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2022-04-08 14:34:37,602 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 14:34:37,866 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 14:34:37,867 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1360657428] [2022-04-08 14:34:37,867 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 14:34:37,867 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1416252062] [2022-04-08 14:34:37,867 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1416252062] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 14:34:37,867 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-08 14:34:37,867 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2022-04-08 14:34:37,867 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 14:34:37,867 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1665297238] [2022-04-08 14:34:37,867 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1665297238] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 14:34:37,868 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 14:34:37,868 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-04-08 14:34:37,868 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1019999353] [2022-04-08 14:34:37,868 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 14:34:37,868 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 3.076923076923077) internal successors, (40), 13 states have internal predecessors, (40), 11 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (12), 11 states have call predecessors, (12), 11 states have call successors, (12) Word has length 93 [2022-04-08 14:34:37,868 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 14:34:37,869 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 14 states, 13 states have (on average 3.076923076923077) internal successors, (40), 13 states have internal predecessors, (40), 11 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (12), 11 states have call predecessors, (12), 11 states have call successors, (12) [2022-04-08 14:34:37,916 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 66 edges. 66 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 14:34:37,916 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-04-08 14:34:37,916 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 14:34:37,917 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-04-08 14:34:37,917 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=227, Unknown=0, NotChecked=0, Total=272 [2022-04-08 14:34:37,917 INFO L87 Difference]: Start difference. First operand 92 states and 94 transitions. Second operand has 14 states, 13 states have (on average 3.076923076923077) internal successors, (40), 13 states have internal predecessors, (40), 11 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (12), 11 states have call predecessors, (12), 11 states have call successors, (12) [2022-04-08 14:34:38,960 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:34:38,960 INFO L93 Difference]: Finished difference Result 100 states and 104 transitions. [2022-04-08 14:34:38,960 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-04-08 14:34:38,960 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 3.076923076923077) internal successors, (40), 13 states have internal predecessors, (40), 11 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (12), 11 states have call predecessors, (12), 11 states have call successors, (12) Word has length 93 [2022-04-08 14:34:38,960 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 14:34:38,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 13 states have (on average 3.076923076923077) internal successors, (40), 13 states have internal predecessors, (40), 11 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (12), 11 states have call predecessors, (12), 11 states have call successors, (12) [2022-04-08 14:34:38,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 79 transitions. [2022-04-08 14:34:38,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 13 states have (on average 3.076923076923077) internal successors, (40), 13 states have internal predecessors, (40), 11 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (12), 11 states have call predecessors, (12), 11 states have call successors, (12) [2022-04-08 14:34:38,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 79 transitions. [2022-04-08 14:34:38,966 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 14 states and 79 transitions. [2022-04-08 14:34:39,032 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 79 edges. 79 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 14:34:39,033 INFO L225 Difference]: With dead ends: 100 [2022-04-08 14:34:39,033 INFO L226 Difference]: Without dead ends: 94 [2022-04-08 14:34:39,034 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 95 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=55, Invalid=287, Unknown=0, NotChecked=0, Total=342 [2022-04-08 14:34:39,034 INFO L913 BasicCegarLoop]: 60 mSDtfsCounter, 2 mSDsluCounter, 433 mSDsCounter, 0 mSdLazyCounter, 389 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 493 SdHoareTripleChecker+Invalid, 390 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 389 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-04-08 14:34:39,034 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [2 Valid, 493 Invalid, 390 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 389 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-04-08 14:34:39,035 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2022-04-08 14:34:39,160 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 94. [2022-04-08 14:34:39,160 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 14:34:39,160 INFO L82 GeneralOperation]: Start isEquivalent. First operand 94 states. Second operand has 94 states, 67 states have (on average 1.0298507462686568) internal successors, (69), 67 states have internal predecessors, (69), 15 states have call successors, (15), 13 states have call predecessors, (15), 11 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2022-04-08 14:34:39,161 INFO L74 IsIncluded]: Start isIncluded. First operand 94 states. Second operand has 94 states, 67 states have (on average 1.0298507462686568) internal successors, (69), 67 states have internal predecessors, (69), 15 states have call successors, (15), 13 states have call predecessors, (15), 11 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2022-04-08 14:34:39,161 INFO L87 Difference]: Start difference. First operand 94 states. Second operand has 94 states, 67 states have (on average 1.0298507462686568) internal successors, (69), 67 states have internal predecessors, (69), 15 states have call successors, (15), 13 states have call predecessors, (15), 11 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2022-04-08 14:34:39,162 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:34:39,162 INFO L93 Difference]: Finished difference Result 94 states and 97 transitions. [2022-04-08 14:34:39,162 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 97 transitions. [2022-04-08 14:34:39,162 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 14:34:39,162 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 14:34:39,163 INFO L74 IsIncluded]: Start isIncluded. First operand has 94 states, 67 states have (on average 1.0298507462686568) internal successors, (69), 67 states have internal predecessors, (69), 15 states have call successors, (15), 13 states have call predecessors, (15), 11 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) Second operand 94 states. [2022-04-08 14:34:39,163 INFO L87 Difference]: Start difference. First operand has 94 states, 67 states have (on average 1.0298507462686568) internal successors, (69), 67 states have internal predecessors, (69), 15 states have call successors, (15), 13 states have call predecessors, (15), 11 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) Second operand 94 states. [2022-04-08 14:34:39,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:34:39,164 INFO L93 Difference]: Finished difference Result 94 states and 97 transitions. [2022-04-08 14:34:39,164 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 97 transitions. [2022-04-08 14:34:39,164 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 14:34:39,165 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 14:34:39,165 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 14:34:39,165 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 14:34:39,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 67 states have (on average 1.0298507462686568) internal successors, (69), 67 states have internal predecessors, (69), 15 states have call successors, (15), 13 states have call predecessors, (15), 11 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2022-04-08 14:34:39,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 97 transitions. [2022-04-08 14:34:39,166 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 97 transitions. Word has length 93 [2022-04-08 14:34:39,167 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 14:34:39,167 INFO L478 AbstractCegarLoop]: Abstraction has 94 states and 97 transitions. [2022-04-08 14:34:39,167 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 3.076923076923077) internal successors, (40), 13 states have internal predecessors, (40), 11 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (12), 11 states have call predecessors, (12), 11 states have call successors, (12) [2022-04-08 14:34:39,167 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 94 states and 97 transitions. [2022-04-08 14:34:43,690 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 97 edges. 96 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-08 14:34:43,690 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 97 transitions. [2022-04-08 14:34:43,691 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2022-04-08 14:34:43,691 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 14:34:43,691 INFO L499 BasicCegarLoop]: trace histogram [11, 10, 10, 10, 9, 9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 14:34:43,719 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Forceful destruction successful, exit code 0 [2022-04-08 14:34:43,892 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 14:34:43,892 INFO L403 AbstractCegarLoop]: === Iteration 21 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 14:34:43,892 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 14:34:43,893 INFO L85 PathProgramCache]: Analyzing trace with hash 304473801, now seen corresponding path program 15 times [2022-04-08 14:34:43,893 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 14:34:43,893 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1115780474] [2022-04-08 14:34:44,002 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 14:34:44,003 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 14:34:44,003 INFO L85 PathProgramCache]: Analyzing trace with hash 304473801, now seen corresponding path program 16 times [2022-04-08 14:34:44,003 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 14:34:44,003 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [743401866] [2022-04-08 14:34:44,003 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 14:34:44,003 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 14:34:44,017 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 14:34:44,017 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [117228239] [2022-04-08 14:34:44,017 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-08 14:34:44,017 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 14:34:44,018 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 14:34:44,018 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 14:34:44,021 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2022-04-08 14:34:44,081 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-08 14:34:44,081 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 14:34:44,082 INFO L263 TraceCheckSpWp]: Trace formula consists of 278 conjuncts, 23 conjunts are in the unsatisfiable core [2022-04-08 14:34:44,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 14:34:44,105 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 14:34:44,567 INFO L272 TraceCheckUtils]: 0: Hoare triple {12888#true} call ULTIMATE.init(); {12888#true} is VALID [2022-04-08 14:34:44,568 INFO L290 TraceCheckUtils]: 1: Hoare triple {12888#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; {12896#(<= ~counter~0 0)} is VALID [2022-04-08 14:34:44,568 INFO L290 TraceCheckUtils]: 2: Hoare triple {12896#(<= ~counter~0 0)} assume true; {12896#(<= ~counter~0 0)} is VALID [2022-04-08 14:34:44,568 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {12896#(<= ~counter~0 0)} {12888#true} #61#return; {12896#(<= ~counter~0 0)} is VALID [2022-04-08 14:34:44,569 INFO L272 TraceCheckUtils]: 4: Hoare triple {12896#(<= ~counter~0 0)} call #t~ret6 := main(); {12896#(<= ~counter~0 0)} is VALID [2022-04-08 14:34:44,569 INFO L290 TraceCheckUtils]: 5: Hoare triple {12896#(<= ~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; {12896#(<= ~counter~0 0)} is VALID [2022-04-08 14:34:44,569 INFO L272 TraceCheckUtils]: 6: Hoare triple {12896#(<= ~counter~0 0)} call assume_abort_if_not((if ~k~0 <= 256 then 1 else 0)); {12896#(<= ~counter~0 0)} is VALID [2022-04-08 14:34:44,570 INFO L290 TraceCheckUtils]: 7: Hoare triple {12896#(<= ~counter~0 0)} ~cond := #in~cond; {12896#(<= ~counter~0 0)} is VALID [2022-04-08 14:34:44,570 INFO L290 TraceCheckUtils]: 8: Hoare triple {12896#(<= ~counter~0 0)} assume !(0 == ~cond); {12896#(<= ~counter~0 0)} is VALID [2022-04-08 14:34:44,570 INFO L290 TraceCheckUtils]: 9: Hoare triple {12896#(<= ~counter~0 0)} assume true; {12896#(<= ~counter~0 0)} is VALID [2022-04-08 14:34:44,571 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {12896#(<= ~counter~0 0)} {12896#(<= ~counter~0 0)} #53#return; {12896#(<= ~counter~0 0)} is VALID [2022-04-08 14:34:44,571 INFO L290 TraceCheckUtils]: 11: Hoare triple {12896#(<= ~counter~0 0)} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {12896#(<= ~counter~0 0)} is VALID [2022-04-08 14:34:44,572 INFO L290 TraceCheckUtils]: 12: Hoare triple {12896#(<= ~counter~0 0)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {12930#(<= ~counter~0 1)} is VALID [2022-04-08 14:34:44,572 INFO L290 TraceCheckUtils]: 13: Hoare triple {12930#(<= ~counter~0 1)} assume !!(#t~post5 < 10);havoc #t~post5; {12930#(<= ~counter~0 1)} is VALID [2022-04-08 14:34:44,572 INFO L272 TraceCheckUtils]: 14: Hoare triple {12930#(<= ~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)); {12930#(<= ~counter~0 1)} is VALID [2022-04-08 14:34:44,573 INFO L290 TraceCheckUtils]: 15: Hoare triple {12930#(<= ~counter~0 1)} ~cond := #in~cond; {12930#(<= ~counter~0 1)} is VALID [2022-04-08 14:34:44,573 INFO L290 TraceCheckUtils]: 16: Hoare triple {12930#(<= ~counter~0 1)} assume !(0 == ~cond); {12930#(<= ~counter~0 1)} is VALID [2022-04-08 14:34:44,573 INFO L290 TraceCheckUtils]: 17: Hoare triple {12930#(<= ~counter~0 1)} assume true; {12930#(<= ~counter~0 1)} is VALID [2022-04-08 14:34:44,574 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {12930#(<= ~counter~0 1)} {12930#(<= ~counter~0 1)} #55#return; {12930#(<= ~counter~0 1)} is VALID [2022-04-08 14:34:44,574 INFO L290 TraceCheckUtils]: 19: Hoare triple {12930#(<= ~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; {12930#(<= ~counter~0 1)} is VALID [2022-04-08 14:34:44,574 INFO L290 TraceCheckUtils]: 20: Hoare triple {12930#(<= ~counter~0 1)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {12955#(<= ~counter~0 2)} is VALID [2022-04-08 14:34:44,575 INFO L290 TraceCheckUtils]: 21: Hoare triple {12955#(<= ~counter~0 2)} assume !!(#t~post5 < 10);havoc #t~post5; {12955#(<= ~counter~0 2)} is VALID [2022-04-08 14:34:44,575 INFO L272 TraceCheckUtils]: 22: Hoare triple {12955#(<= ~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)); {12955#(<= ~counter~0 2)} is VALID [2022-04-08 14:34:44,575 INFO L290 TraceCheckUtils]: 23: Hoare triple {12955#(<= ~counter~0 2)} ~cond := #in~cond; {12955#(<= ~counter~0 2)} is VALID [2022-04-08 14:34:44,576 INFO L290 TraceCheckUtils]: 24: Hoare triple {12955#(<= ~counter~0 2)} assume !(0 == ~cond); {12955#(<= ~counter~0 2)} is VALID [2022-04-08 14:34:44,576 INFO L290 TraceCheckUtils]: 25: Hoare triple {12955#(<= ~counter~0 2)} assume true; {12955#(<= ~counter~0 2)} is VALID [2022-04-08 14:34:44,576 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {12955#(<= ~counter~0 2)} {12955#(<= ~counter~0 2)} #55#return; {12955#(<= ~counter~0 2)} is VALID [2022-04-08 14:34:44,577 INFO L290 TraceCheckUtils]: 27: Hoare triple {12955#(<= ~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; {12955#(<= ~counter~0 2)} is VALID [2022-04-08 14:34:44,577 INFO L290 TraceCheckUtils]: 28: Hoare triple {12955#(<= ~counter~0 2)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {12980#(<= ~counter~0 3)} is VALID [2022-04-08 14:34:44,577 INFO L290 TraceCheckUtils]: 29: Hoare triple {12980#(<= ~counter~0 3)} assume !!(#t~post5 < 10);havoc #t~post5; {12980#(<= ~counter~0 3)} is VALID [2022-04-08 14:34:44,578 INFO L272 TraceCheckUtils]: 30: Hoare triple {12980#(<= ~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)); {12980#(<= ~counter~0 3)} is VALID [2022-04-08 14:34:44,578 INFO L290 TraceCheckUtils]: 31: Hoare triple {12980#(<= ~counter~0 3)} ~cond := #in~cond; {12980#(<= ~counter~0 3)} is VALID [2022-04-08 14:34:44,578 INFO L290 TraceCheckUtils]: 32: Hoare triple {12980#(<= ~counter~0 3)} assume !(0 == ~cond); {12980#(<= ~counter~0 3)} is VALID [2022-04-08 14:34:44,579 INFO L290 TraceCheckUtils]: 33: Hoare triple {12980#(<= ~counter~0 3)} assume true; {12980#(<= ~counter~0 3)} is VALID [2022-04-08 14:34:44,579 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {12980#(<= ~counter~0 3)} {12980#(<= ~counter~0 3)} #55#return; {12980#(<= ~counter~0 3)} is VALID [2022-04-08 14:34:44,579 INFO L290 TraceCheckUtils]: 35: Hoare triple {12980#(<= ~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; {12980#(<= ~counter~0 3)} is VALID [2022-04-08 14:34:44,580 INFO L290 TraceCheckUtils]: 36: Hoare triple {12980#(<= ~counter~0 3)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {13005#(<= ~counter~0 4)} is VALID [2022-04-08 14:34:44,580 INFO L290 TraceCheckUtils]: 37: Hoare triple {13005#(<= ~counter~0 4)} assume !!(#t~post5 < 10);havoc #t~post5; {13005#(<= ~counter~0 4)} is VALID [2022-04-08 14:34:44,581 INFO L272 TraceCheckUtils]: 38: Hoare triple {13005#(<= ~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)); {13005#(<= ~counter~0 4)} is VALID [2022-04-08 14:34:44,581 INFO L290 TraceCheckUtils]: 39: Hoare triple {13005#(<= ~counter~0 4)} ~cond := #in~cond; {13005#(<= ~counter~0 4)} is VALID [2022-04-08 14:34:44,581 INFO L290 TraceCheckUtils]: 40: Hoare triple {13005#(<= ~counter~0 4)} assume !(0 == ~cond); {13005#(<= ~counter~0 4)} is VALID [2022-04-08 14:34:44,581 INFO L290 TraceCheckUtils]: 41: Hoare triple {13005#(<= ~counter~0 4)} assume true; {13005#(<= ~counter~0 4)} is VALID [2022-04-08 14:34:44,582 INFO L284 TraceCheckUtils]: 42: Hoare quadruple {13005#(<= ~counter~0 4)} {13005#(<= ~counter~0 4)} #55#return; {13005#(<= ~counter~0 4)} is VALID [2022-04-08 14:34:44,582 INFO L290 TraceCheckUtils]: 43: Hoare triple {13005#(<= ~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; {13005#(<= ~counter~0 4)} is VALID [2022-04-08 14:34:44,583 INFO L290 TraceCheckUtils]: 44: Hoare triple {13005#(<= ~counter~0 4)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {13030#(<= ~counter~0 5)} is VALID [2022-04-08 14:34:44,583 INFO L290 TraceCheckUtils]: 45: Hoare triple {13030#(<= ~counter~0 5)} assume !!(#t~post5 < 10);havoc #t~post5; {13030#(<= ~counter~0 5)} is VALID [2022-04-08 14:34:44,583 INFO L272 TraceCheckUtils]: 46: Hoare triple {13030#(<= ~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)); {13030#(<= ~counter~0 5)} is VALID [2022-04-08 14:34:44,584 INFO L290 TraceCheckUtils]: 47: Hoare triple {13030#(<= ~counter~0 5)} ~cond := #in~cond; {13030#(<= ~counter~0 5)} is VALID [2022-04-08 14:34:44,584 INFO L290 TraceCheckUtils]: 48: Hoare triple {13030#(<= ~counter~0 5)} assume !(0 == ~cond); {13030#(<= ~counter~0 5)} is VALID [2022-04-08 14:34:44,584 INFO L290 TraceCheckUtils]: 49: Hoare triple {13030#(<= ~counter~0 5)} assume true; {13030#(<= ~counter~0 5)} is VALID [2022-04-08 14:34:44,585 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {13030#(<= ~counter~0 5)} {13030#(<= ~counter~0 5)} #55#return; {13030#(<= ~counter~0 5)} is VALID [2022-04-08 14:34:44,585 INFO L290 TraceCheckUtils]: 51: Hoare triple {13030#(<= ~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; {13030#(<= ~counter~0 5)} is VALID [2022-04-08 14:34:44,585 INFO L290 TraceCheckUtils]: 52: Hoare triple {13030#(<= ~counter~0 5)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {13055#(<= ~counter~0 6)} is VALID [2022-04-08 14:34:44,586 INFO L290 TraceCheckUtils]: 53: Hoare triple {13055#(<= ~counter~0 6)} assume !!(#t~post5 < 10);havoc #t~post5; {13055#(<= ~counter~0 6)} is VALID [2022-04-08 14:34:44,586 INFO L272 TraceCheckUtils]: 54: Hoare triple {13055#(<= ~counter~0 6)} 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)); {13055#(<= ~counter~0 6)} is VALID [2022-04-08 14:34:44,586 INFO L290 TraceCheckUtils]: 55: Hoare triple {13055#(<= ~counter~0 6)} ~cond := #in~cond; {13055#(<= ~counter~0 6)} is VALID [2022-04-08 14:34:44,587 INFO L290 TraceCheckUtils]: 56: Hoare triple {13055#(<= ~counter~0 6)} assume !(0 == ~cond); {13055#(<= ~counter~0 6)} is VALID [2022-04-08 14:34:44,587 INFO L290 TraceCheckUtils]: 57: Hoare triple {13055#(<= ~counter~0 6)} assume true; {13055#(<= ~counter~0 6)} is VALID [2022-04-08 14:34:44,587 INFO L284 TraceCheckUtils]: 58: Hoare quadruple {13055#(<= ~counter~0 6)} {13055#(<= ~counter~0 6)} #55#return; {13055#(<= ~counter~0 6)} is VALID [2022-04-08 14:34:44,588 INFO L290 TraceCheckUtils]: 59: Hoare triple {13055#(<= ~counter~0 6)} 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; {13055#(<= ~counter~0 6)} is VALID [2022-04-08 14:34:44,588 INFO L290 TraceCheckUtils]: 60: Hoare triple {13055#(<= ~counter~0 6)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {13080#(<= ~counter~0 7)} is VALID [2022-04-08 14:34:44,588 INFO L290 TraceCheckUtils]: 61: Hoare triple {13080#(<= ~counter~0 7)} assume !!(#t~post5 < 10);havoc #t~post5; {13080#(<= ~counter~0 7)} is VALID [2022-04-08 14:34:44,589 INFO L272 TraceCheckUtils]: 62: Hoare triple {13080#(<= ~counter~0 7)} 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)); {13080#(<= ~counter~0 7)} is VALID [2022-04-08 14:34:44,589 INFO L290 TraceCheckUtils]: 63: Hoare triple {13080#(<= ~counter~0 7)} ~cond := #in~cond; {13080#(<= ~counter~0 7)} is VALID [2022-04-08 14:34:44,589 INFO L290 TraceCheckUtils]: 64: Hoare triple {13080#(<= ~counter~0 7)} assume !(0 == ~cond); {13080#(<= ~counter~0 7)} is VALID [2022-04-08 14:34:44,590 INFO L290 TraceCheckUtils]: 65: Hoare triple {13080#(<= ~counter~0 7)} assume true; {13080#(<= ~counter~0 7)} is VALID [2022-04-08 14:34:44,590 INFO L284 TraceCheckUtils]: 66: Hoare quadruple {13080#(<= ~counter~0 7)} {13080#(<= ~counter~0 7)} #55#return; {13080#(<= ~counter~0 7)} is VALID [2022-04-08 14:34:44,590 INFO L290 TraceCheckUtils]: 67: Hoare triple {13080#(<= ~counter~0 7)} 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; {13080#(<= ~counter~0 7)} is VALID [2022-04-08 14:34:44,591 INFO L290 TraceCheckUtils]: 68: Hoare triple {13080#(<= ~counter~0 7)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {13105#(<= ~counter~0 8)} is VALID [2022-04-08 14:34:44,591 INFO L290 TraceCheckUtils]: 69: Hoare triple {13105#(<= ~counter~0 8)} assume !!(#t~post5 < 10);havoc #t~post5; {13105#(<= ~counter~0 8)} is VALID [2022-04-08 14:34:44,592 INFO L272 TraceCheckUtils]: 70: Hoare triple {13105#(<= ~counter~0 8)} 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)); {13105#(<= ~counter~0 8)} is VALID [2022-04-08 14:34:44,592 INFO L290 TraceCheckUtils]: 71: Hoare triple {13105#(<= ~counter~0 8)} ~cond := #in~cond; {13105#(<= ~counter~0 8)} is VALID [2022-04-08 14:34:44,592 INFO L290 TraceCheckUtils]: 72: Hoare triple {13105#(<= ~counter~0 8)} assume !(0 == ~cond); {13105#(<= ~counter~0 8)} is VALID [2022-04-08 14:34:44,592 INFO L290 TraceCheckUtils]: 73: Hoare triple {13105#(<= ~counter~0 8)} assume true; {13105#(<= ~counter~0 8)} is VALID [2022-04-08 14:34:44,593 INFO L284 TraceCheckUtils]: 74: Hoare quadruple {13105#(<= ~counter~0 8)} {13105#(<= ~counter~0 8)} #55#return; {13105#(<= ~counter~0 8)} is VALID [2022-04-08 14:34:44,593 INFO L290 TraceCheckUtils]: 75: Hoare triple {13105#(<= ~counter~0 8)} 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; {13105#(<= ~counter~0 8)} is VALID [2022-04-08 14:34:44,594 INFO L290 TraceCheckUtils]: 76: Hoare triple {13105#(<= ~counter~0 8)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {13130#(<= ~counter~0 9)} is VALID [2022-04-08 14:34:44,594 INFO L290 TraceCheckUtils]: 77: Hoare triple {13130#(<= ~counter~0 9)} assume !!(#t~post5 < 10);havoc #t~post5; {13130#(<= ~counter~0 9)} is VALID [2022-04-08 14:34:44,594 INFO L272 TraceCheckUtils]: 78: Hoare triple {13130#(<= ~counter~0 9)} 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)); {13130#(<= ~counter~0 9)} is VALID [2022-04-08 14:34:44,595 INFO L290 TraceCheckUtils]: 79: Hoare triple {13130#(<= ~counter~0 9)} ~cond := #in~cond; {13130#(<= ~counter~0 9)} is VALID [2022-04-08 14:34:44,595 INFO L290 TraceCheckUtils]: 80: Hoare triple {13130#(<= ~counter~0 9)} assume !(0 == ~cond); {13130#(<= ~counter~0 9)} is VALID [2022-04-08 14:34:44,595 INFO L290 TraceCheckUtils]: 81: Hoare triple {13130#(<= ~counter~0 9)} assume true; {13130#(<= ~counter~0 9)} is VALID [2022-04-08 14:34:44,596 INFO L284 TraceCheckUtils]: 82: Hoare quadruple {13130#(<= ~counter~0 9)} {13130#(<= ~counter~0 9)} #55#return; {13130#(<= ~counter~0 9)} is VALID [2022-04-08 14:34:44,596 INFO L290 TraceCheckUtils]: 83: Hoare triple {13130#(<= ~counter~0 9)} 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; {13130#(<= ~counter~0 9)} is VALID [2022-04-08 14:34:44,596 INFO L290 TraceCheckUtils]: 84: Hoare triple {13130#(<= ~counter~0 9)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {13155#(<= |main_#t~post5| 9)} is VALID [2022-04-08 14:34:44,597 INFO L290 TraceCheckUtils]: 85: Hoare triple {13155#(<= |main_#t~post5| 9)} assume !(#t~post5 < 10);havoc #t~post5; {12889#false} is VALID [2022-04-08 14:34:44,597 INFO L272 TraceCheckUtils]: 86: Hoare triple {12889#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)); {12889#false} is VALID [2022-04-08 14:34:44,597 INFO L290 TraceCheckUtils]: 87: Hoare triple {12889#false} ~cond := #in~cond; {12889#false} is VALID [2022-04-08 14:34:44,597 INFO L290 TraceCheckUtils]: 88: Hoare triple {12889#false} assume !(0 == ~cond); {12889#false} is VALID [2022-04-08 14:34:44,597 INFO L290 TraceCheckUtils]: 89: Hoare triple {12889#false} assume true; {12889#false} is VALID [2022-04-08 14:34:44,597 INFO L284 TraceCheckUtils]: 90: Hoare quadruple {12889#false} {12889#false} #57#return; {12889#false} is VALID [2022-04-08 14:34:44,597 INFO L272 TraceCheckUtils]: 91: Hoare triple {12889#false} call __VERIFIER_assert((if ~k~0 * ~y~0 == ~y~0 * ~y~0 then 1 else 0)); {12889#false} is VALID [2022-04-08 14:34:44,597 INFO L290 TraceCheckUtils]: 92: Hoare triple {12889#false} ~cond := #in~cond; {12889#false} is VALID [2022-04-08 14:34:44,597 INFO L290 TraceCheckUtils]: 93: Hoare triple {12889#false} assume 0 == ~cond; {12889#false} is VALID [2022-04-08 14:34:44,597 INFO L290 TraceCheckUtils]: 94: Hoare triple {12889#false} assume !false; {12889#false} is VALID [2022-04-08 14:34:44,598 INFO L134 CoverageAnalysis]: Checked inductivity of 362 backedges. 54 proven. 306 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-08 14:34:44,598 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 14:34:44,999 INFO L290 TraceCheckUtils]: 94: Hoare triple {12889#false} assume !false; {12889#false} is VALID [2022-04-08 14:34:44,999 INFO L290 TraceCheckUtils]: 93: Hoare triple {12889#false} assume 0 == ~cond; {12889#false} is VALID [2022-04-08 14:34:44,999 INFO L290 TraceCheckUtils]: 92: Hoare triple {12889#false} ~cond := #in~cond; {12889#false} is VALID [2022-04-08 14:34:44,999 INFO L272 TraceCheckUtils]: 91: Hoare triple {12889#false} call __VERIFIER_assert((if ~k~0 * ~y~0 == ~y~0 * ~y~0 then 1 else 0)); {12889#false} is VALID [2022-04-08 14:34:44,999 INFO L284 TraceCheckUtils]: 90: Hoare quadruple {12888#true} {12889#false} #57#return; {12889#false} is VALID [2022-04-08 14:34:44,999 INFO L290 TraceCheckUtils]: 89: Hoare triple {12888#true} assume true; {12888#true} is VALID [2022-04-08 14:34:44,999 INFO L290 TraceCheckUtils]: 88: Hoare triple {12888#true} assume !(0 == ~cond); {12888#true} is VALID [2022-04-08 14:34:45,000 INFO L290 TraceCheckUtils]: 87: Hoare triple {12888#true} ~cond := #in~cond; {12888#true} is VALID [2022-04-08 14:34:45,000 INFO L272 TraceCheckUtils]: 86: Hoare triple {12889#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)); {12888#true} is VALID [2022-04-08 14:34:45,000 INFO L290 TraceCheckUtils]: 85: Hoare triple {13155#(<= |main_#t~post5| 9)} assume !(#t~post5 < 10);havoc #t~post5; {12889#false} is VALID [2022-04-08 14:34:45,000 INFO L290 TraceCheckUtils]: 84: Hoare triple {13130#(<= ~counter~0 9)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {13155#(<= |main_#t~post5| 9)} is VALID [2022-04-08 14:34:45,001 INFO L290 TraceCheckUtils]: 83: Hoare triple {13130#(<= ~counter~0 9)} 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; {13130#(<= ~counter~0 9)} is VALID [2022-04-08 14:34:45,001 INFO L284 TraceCheckUtils]: 82: Hoare quadruple {12888#true} {13130#(<= ~counter~0 9)} #55#return; {13130#(<= ~counter~0 9)} is VALID [2022-04-08 14:34:45,001 INFO L290 TraceCheckUtils]: 81: Hoare triple {12888#true} assume true; {12888#true} is VALID [2022-04-08 14:34:45,001 INFO L290 TraceCheckUtils]: 80: Hoare triple {12888#true} assume !(0 == ~cond); {12888#true} is VALID [2022-04-08 14:34:45,001 INFO L290 TraceCheckUtils]: 79: Hoare triple {12888#true} ~cond := #in~cond; {12888#true} is VALID [2022-04-08 14:34:45,001 INFO L272 TraceCheckUtils]: 78: Hoare triple {13130#(<= ~counter~0 9)} 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)); {12888#true} is VALID [2022-04-08 14:34:45,002 INFO L290 TraceCheckUtils]: 77: Hoare triple {13130#(<= ~counter~0 9)} assume !!(#t~post5 < 10);havoc #t~post5; {13130#(<= ~counter~0 9)} is VALID [2022-04-08 14:34:45,002 INFO L290 TraceCheckUtils]: 76: Hoare triple {13105#(<= ~counter~0 8)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {13130#(<= ~counter~0 9)} is VALID [2022-04-08 14:34:45,003 INFO L290 TraceCheckUtils]: 75: Hoare triple {13105#(<= ~counter~0 8)} 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; {13105#(<= ~counter~0 8)} is VALID [2022-04-08 14:34:45,003 INFO L284 TraceCheckUtils]: 74: Hoare quadruple {12888#true} {13105#(<= ~counter~0 8)} #55#return; {13105#(<= ~counter~0 8)} is VALID [2022-04-08 14:34:45,003 INFO L290 TraceCheckUtils]: 73: Hoare triple {12888#true} assume true; {12888#true} is VALID [2022-04-08 14:34:45,003 INFO L290 TraceCheckUtils]: 72: Hoare triple {12888#true} assume !(0 == ~cond); {12888#true} is VALID [2022-04-08 14:34:45,003 INFO L290 TraceCheckUtils]: 71: Hoare triple {12888#true} ~cond := #in~cond; {12888#true} is VALID [2022-04-08 14:34:45,003 INFO L272 TraceCheckUtils]: 70: Hoare triple {13105#(<= ~counter~0 8)} 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)); {12888#true} is VALID [2022-04-08 14:34:45,004 INFO L290 TraceCheckUtils]: 69: Hoare triple {13105#(<= ~counter~0 8)} assume !!(#t~post5 < 10);havoc #t~post5; {13105#(<= ~counter~0 8)} is VALID [2022-04-08 14:34:45,004 INFO L290 TraceCheckUtils]: 68: Hoare triple {13080#(<= ~counter~0 7)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {13105#(<= ~counter~0 8)} is VALID [2022-04-08 14:34:45,004 INFO L290 TraceCheckUtils]: 67: Hoare triple {13080#(<= ~counter~0 7)} 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; {13080#(<= ~counter~0 7)} is VALID [2022-04-08 14:34:45,005 INFO L284 TraceCheckUtils]: 66: Hoare quadruple {12888#true} {13080#(<= ~counter~0 7)} #55#return; {13080#(<= ~counter~0 7)} is VALID [2022-04-08 14:34:45,005 INFO L290 TraceCheckUtils]: 65: Hoare triple {12888#true} assume true; {12888#true} is VALID [2022-04-08 14:34:45,005 INFO L290 TraceCheckUtils]: 64: Hoare triple {12888#true} assume !(0 == ~cond); {12888#true} is VALID [2022-04-08 14:34:45,005 INFO L290 TraceCheckUtils]: 63: Hoare triple {12888#true} ~cond := #in~cond; {12888#true} is VALID [2022-04-08 14:34:45,005 INFO L272 TraceCheckUtils]: 62: Hoare triple {13080#(<= ~counter~0 7)} 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)); {12888#true} is VALID [2022-04-08 14:34:45,005 INFO L290 TraceCheckUtils]: 61: Hoare triple {13080#(<= ~counter~0 7)} assume !!(#t~post5 < 10);havoc #t~post5; {13080#(<= ~counter~0 7)} is VALID [2022-04-08 14:34:45,006 INFO L290 TraceCheckUtils]: 60: Hoare triple {13055#(<= ~counter~0 6)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {13080#(<= ~counter~0 7)} is VALID [2022-04-08 14:34:45,006 INFO L290 TraceCheckUtils]: 59: Hoare triple {13055#(<= ~counter~0 6)} 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; {13055#(<= ~counter~0 6)} is VALID [2022-04-08 14:34:45,007 INFO L284 TraceCheckUtils]: 58: Hoare quadruple {12888#true} {13055#(<= ~counter~0 6)} #55#return; {13055#(<= ~counter~0 6)} is VALID [2022-04-08 14:34:45,007 INFO L290 TraceCheckUtils]: 57: Hoare triple {12888#true} assume true; {12888#true} is VALID [2022-04-08 14:34:45,007 INFO L290 TraceCheckUtils]: 56: Hoare triple {12888#true} assume !(0 == ~cond); {12888#true} is VALID [2022-04-08 14:34:45,007 INFO L290 TraceCheckUtils]: 55: Hoare triple {12888#true} ~cond := #in~cond; {12888#true} is VALID [2022-04-08 14:34:45,007 INFO L272 TraceCheckUtils]: 54: Hoare triple {13055#(<= ~counter~0 6)} 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)); {12888#true} is VALID [2022-04-08 14:34:45,007 INFO L290 TraceCheckUtils]: 53: Hoare triple {13055#(<= ~counter~0 6)} assume !!(#t~post5 < 10);havoc #t~post5; {13055#(<= ~counter~0 6)} is VALID [2022-04-08 14:34:45,008 INFO L290 TraceCheckUtils]: 52: Hoare triple {13030#(<= ~counter~0 5)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {13055#(<= ~counter~0 6)} is VALID [2022-04-08 14:34:45,008 INFO L290 TraceCheckUtils]: 51: Hoare triple {13030#(<= ~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; {13030#(<= ~counter~0 5)} is VALID [2022-04-08 14:34:45,008 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {12888#true} {13030#(<= ~counter~0 5)} #55#return; {13030#(<= ~counter~0 5)} is VALID [2022-04-08 14:34:45,009 INFO L290 TraceCheckUtils]: 49: Hoare triple {12888#true} assume true; {12888#true} is VALID [2022-04-08 14:34:45,009 INFO L290 TraceCheckUtils]: 48: Hoare triple {12888#true} assume !(0 == ~cond); {12888#true} is VALID [2022-04-08 14:34:45,009 INFO L290 TraceCheckUtils]: 47: Hoare triple {12888#true} ~cond := #in~cond; {12888#true} is VALID [2022-04-08 14:34:45,009 INFO L272 TraceCheckUtils]: 46: Hoare triple {13030#(<= ~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)); {12888#true} is VALID [2022-04-08 14:34:45,009 INFO L290 TraceCheckUtils]: 45: Hoare triple {13030#(<= ~counter~0 5)} assume !!(#t~post5 < 10);havoc #t~post5; {13030#(<= ~counter~0 5)} is VALID [2022-04-08 14:34:45,009 INFO L290 TraceCheckUtils]: 44: Hoare triple {13005#(<= ~counter~0 4)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {13030#(<= ~counter~0 5)} is VALID [2022-04-08 14:34:45,010 INFO L290 TraceCheckUtils]: 43: Hoare triple {13005#(<= ~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; {13005#(<= ~counter~0 4)} is VALID [2022-04-08 14:34:45,010 INFO L284 TraceCheckUtils]: 42: Hoare quadruple {12888#true} {13005#(<= ~counter~0 4)} #55#return; {13005#(<= ~counter~0 4)} is VALID [2022-04-08 14:34:45,010 INFO L290 TraceCheckUtils]: 41: Hoare triple {12888#true} assume true; {12888#true} is VALID [2022-04-08 14:34:45,010 INFO L290 TraceCheckUtils]: 40: Hoare triple {12888#true} assume !(0 == ~cond); {12888#true} is VALID [2022-04-08 14:34:45,010 INFO L290 TraceCheckUtils]: 39: Hoare triple {12888#true} ~cond := #in~cond; {12888#true} is VALID [2022-04-08 14:34:45,010 INFO L272 TraceCheckUtils]: 38: Hoare triple {13005#(<= ~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)); {12888#true} is VALID [2022-04-08 14:34:45,011 INFO L290 TraceCheckUtils]: 37: Hoare triple {13005#(<= ~counter~0 4)} assume !!(#t~post5 < 10);havoc #t~post5; {13005#(<= ~counter~0 4)} is VALID [2022-04-08 14:34:45,011 INFO L290 TraceCheckUtils]: 36: Hoare triple {12980#(<= ~counter~0 3)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {13005#(<= ~counter~0 4)} is VALID [2022-04-08 14:34:45,011 INFO L290 TraceCheckUtils]: 35: Hoare triple {12980#(<= ~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; {12980#(<= ~counter~0 3)} is VALID [2022-04-08 14:34:45,012 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {12888#true} {12980#(<= ~counter~0 3)} #55#return; {12980#(<= ~counter~0 3)} is VALID [2022-04-08 14:34:45,012 INFO L290 TraceCheckUtils]: 33: Hoare triple {12888#true} assume true; {12888#true} is VALID [2022-04-08 14:34:45,012 INFO L290 TraceCheckUtils]: 32: Hoare triple {12888#true} assume !(0 == ~cond); {12888#true} is VALID [2022-04-08 14:34:45,012 INFO L290 TraceCheckUtils]: 31: Hoare triple {12888#true} ~cond := #in~cond; {12888#true} is VALID [2022-04-08 14:34:45,012 INFO L272 TraceCheckUtils]: 30: Hoare triple {12980#(<= ~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)); {12888#true} is VALID [2022-04-08 14:34:45,012 INFO L290 TraceCheckUtils]: 29: Hoare triple {12980#(<= ~counter~0 3)} assume !!(#t~post5 < 10);havoc #t~post5; {12980#(<= ~counter~0 3)} is VALID [2022-04-08 14:34:45,013 INFO L290 TraceCheckUtils]: 28: Hoare triple {12955#(<= ~counter~0 2)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {12980#(<= ~counter~0 3)} is VALID [2022-04-08 14:34:45,013 INFO L290 TraceCheckUtils]: 27: Hoare triple {12955#(<= ~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; {12955#(<= ~counter~0 2)} is VALID [2022-04-08 14:34:45,014 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {12888#true} {12955#(<= ~counter~0 2)} #55#return; {12955#(<= ~counter~0 2)} is VALID [2022-04-08 14:34:45,014 INFO L290 TraceCheckUtils]: 25: Hoare triple {12888#true} assume true; {12888#true} is VALID [2022-04-08 14:34:45,014 INFO L290 TraceCheckUtils]: 24: Hoare triple {12888#true} assume !(0 == ~cond); {12888#true} is VALID [2022-04-08 14:34:45,014 INFO L290 TraceCheckUtils]: 23: Hoare triple {12888#true} ~cond := #in~cond; {12888#true} is VALID [2022-04-08 14:34:45,014 INFO L272 TraceCheckUtils]: 22: Hoare triple {12955#(<= ~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)); {12888#true} is VALID [2022-04-08 14:34:45,014 INFO L290 TraceCheckUtils]: 21: Hoare triple {12955#(<= ~counter~0 2)} assume !!(#t~post5 < 10);havoc #t~post5; {12955#(<= ~counter~0 2)} is VALID [2022-04-08 14:34:45,015 INFO L290 TraceCheckUtils]: 20: Hoare triple {12930#(<= ~counter~0 1)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {12955#(<= ~counter~0 2)} is VALID [2022-04-08 14:34:45,015 INFO L290 TraceCheckUtils]: 19: Hoare triple {12930#(<= ~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; {12930#(<= ~counter~0 1)} is VALID [2022-04-08 14:34:45,015 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {12888#true} {12930#(<= ~counter~0 1)} #55#return; {12930#(<= ~counter~0 1)} is VALID [2022-04-08 14:34:45,015 INFO L290 TraceCheckUtils]: 17: Hoare triple {12888#true} assume true; {12888#true} is VALID [2022-04-08 14:34:45,016 INFO L290 TraceCheckUtils]: 16: Hoare triple {12888#true} assume !(0 == ~cond); {12888#true} is VALID [2022-04-08 14:34:45,016 INFO L290 TraceCheckUtils]: 15: Hoare triple {12888#true} ~cond := #in~cond; {12888#true} is VALID [2022-04-08 14:34:45,016 INFO L272 TraceCheckUtils]: 14: Hoare triple {12930#(<= ~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)); {12888#true} is VALID [2022-04-08 14:34:45,016 INFO L290 TraceCheckUtils]: 13: Hoare triple {12930#(<= ~counter~0 1)} assume !!(#t~post5 < 10);havoc #t~post5; {12930#(<= ~counter~0 1)} is VALID [2022-04-08 14:34:45,016 INFO L290 TraceCheckUtils]: 12: Hoare triple {12896#(<= ~counter~0 0)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {12930#(<= ~counter~0 1)} is VALID [2022-04-08 14:34:45,017 INFO L290 TraceCheckUtils]: 11: Hoare triple {12896#(<= ~counter~0 0)} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {12896#(<= ~counter~0 0)} is VALID [2022-04-08 14:34:45,017 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {12888#true} {12896#(<= ~counter~0 0)} #53#return; {12896#(<= ~counter~0 0)} is VALID [2022-04-08 14:34:45,017 INFO L290 TraceCheckUtils]: 9: Hoare triple {12888#true} assume true; {12888#true} is VALID [2022-04-08 14:34:45,017 INFO L290 TraceCheckUtils]: 8: Hoare triple {12888#true} assume !(0 == ~cond); {12888#true} is VALID [2022-04-08 14:34:45,017 INFO L290 TraceCheckUtils]: 7: Hoare triple {12888#true} ~cond := #in~cond; {12888#true} is VALID [2022-04-08 14:34:45,017 INFO L272 TraceCheckUtils]: 6: Hoare triple {12896#(<= ~counter~0 0)} call assume_abort_if_not((if ~k~0 <= 256 then 1 else 0)); {12888#true} is VALID [2022-04-08 14:34:45,018 INFO L290 TraceCheckUtils]: 5: Hoare triple {12896#(<= ~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; {12896#(<= ~counter~0 0)} is VALID [2022-04-08 14:34:45,018 INFO L272 TraceCheckUtils]: 4: Hoare triple {12896#(<= ~counter~0 0)} call #t~ret6 := main(); {12896#(<= ~counter~0 0)} is VALID [2022-04-08 14:34:45,018 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {12896#(<= ~counter~0 0)} {12888#true} #61#return; {12896#(<= ~counter~0 0)} is VALID [2022-04-08 14:34:45,019 INFO L290 TraceCheckUtils]: 2: Hoare triple {12896#(<= ~counter~0 0)} assume true; {12896#(<= ~counter~0 0)} is VALID [2022-04-08 14:34:45,023 INFO L290 TraceCheckUtils]: 1: Hoare triple {12888#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; {12896#(<= ~counter~0 0)} is VALID [2022-04-08 14:34:45,024 INFO L272 TraceCheckUtils]: 0: Hoare triple {12888#true} call ULTIMATE.init(); {12888#true} is VALID [2022-04-08 14:34:45,024 INFO L134 CoverageAnalysis]: Checked inductivity of 362 backedges. 20 proven. 162 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2022-04-08 14:34:45,024 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 14:34:45,024 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [743401866] [2022-04-08 14:34:45,024 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 14:34:45,025 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [117228239] [2022-04-08 14:34:45,025 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [117228239] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 14:34:45,025 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-08 14:34:45,025 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 13 [2022-04-08 14:34:45,026 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 14:34:45,026 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1115780474] [2022-04-08 14:34:45,026 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1115780474] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 14:34:45,026 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 14:34:45,026 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-04-08 14:34:45,026 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [701590223] [2022-04-08 14:34:45,026 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 14:34:45,026 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 5.230769230769231) internal successors, (68), 12 states have internal predecessors, (68), 12 states have call successors, (14), 12 states have call predecessors, (14), 11 states have return successors, (12), 11 states have call predecessors, (12), 12 states have call successors, (12) Word has length 95 [2022-04-08 14:34:45,026 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 14:34:45,027 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 13 states, 13 states have (on average 5.230769230769231) internal successors, (68), 12 states have internal predecessors, (68), 12 states have call successors, (14), 12 states have call predecessors, (14), 11 states have return successors, (12), 11 states have call predecessors, (12), 12 states have call successors, (12) [2022-04-08 14:34:45,113 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 94 edges. 94 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 14:34:45,114 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-04-08 14:34:45,114 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 14:34:45,114 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-04-08 14:34:45,114 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2022-04-08 14:34:45,115 INFO L87 Difference]: Start difference. First operand 94 states and 97 transitions. Second operand has 13 states, 13 states have (on average 5.230769230769231) internal successors, (68), 12 states have internal predecessors, (68), 12 states have call successors, (14), 12 states have call predecessors, (14), 11 states have return successors, (12), 11 states have call predecessors, (12), 12 states have call successors, (12) [2022-04-08 14:34:45,565 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:34:45,566 INFO L93 Difference]: Finished difference Result 110 states and 112 transitions. [2022-04-08 14:34:45,566 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-04-08 14:34:45,566 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 5.230769230769231) internal successors, (68), 12 states have internal predecessors, (68), 12 states have call successors, (14), 12 states have call predecessors, (14), 11 states have return successors, (12), 11 states have call predecessors, (12), 12 states have call successors, (12) Word has length 95 [2022-04-08 14:34:45,566 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 14:34:45,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 13 states have (on average 5.230769230769231) internal successors, (68), 12 states have internal predecessors, (68), 12 states have call successors, (14), 12 states have call predecessors, (14), 11 states have return successors, (12), 11 states have call predecessors, (12), 12 states have call successors, (12) [2022-04-08 14:34:45,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 110 transitions. [2022-04-08 14:34:45,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 13 states have (on average 5.230769230769231) internal successors, (68), 12 states have internal predecessors, (68), 12 states have call successors, (14), 12 states have call predecessors, (14), 11 states have return successors, (12), 11 states have call predecessors, (12), 12 states have call successors, (12) [2022-04-08 14:34:45,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 110 transitions. [2022-04-08 14:34:45,570 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 22 states and 110 transitions. [2022-04-08 14:34:45,673 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 110 edges. 110 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 14:34:45,674 INFO L225 Difference]: With dead ends: 110 [2022-04-08 14:34:45,674 INFO L226 Difference]: Without dead ends: 100 [2022-04-08 14:34:45,675 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 198 GetRequests, 177 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=176, Invalid=286, Unknown=0, NotChecked=0, Total=462 [2022-04-08 14:34:45,675 INFO L913 BasicCegarLoop]: 34 mSDtfsCounter, 18 mSDsluCounter, 92 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 126 SdHoareTripleChecker+Invalid, 67 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-08 14:34:45,676 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [18 Valid, 126 Invalid, 67 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-08 14:34:45,676 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2022-04-08 14:34:45,822 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 100. [2022-04-08 14:34:45,822 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 14:34:45,822 INFO L82 GeneralOperation]: Start isEquivalent. First operand 100 states. Second operand has 100 states, 72 states have (on average 1.0277777777777777) internal successors, (74), 72 states have internal predecessors, (74), 15 states have call successors, (15), 14 states have call predecessors, (15), 12 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2022-04-08 14:34:45,823 INFO L74 IsIncluded]: Start isIncluded. First operand 100 states. Second operand has 100 states, 72 states have (on average 1.0277777777777777) internal successors, (74), 72 states have internal predecessors, (74), 15 states have call successors, (15), 14 states have call predecessors, (15), 12 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2022-04-08 14:34:45,823 INFO L87 Difference]: Start difference. First operand 100 states. Second operand has 100 states, 72 states have (on average 1.0277777777777777) internal successors, (74), 72 states have internal predecessors, (74), 15 states have call successors, (15), 14 states have call predecessors, (15), 12 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2022-04-08 14:34:45,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:34:45,829 INFO L93 Difference]: Finished difference Result 100 states and 102 transitions. [2022-04-08 14:34:45,829 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 102 transitions. [2022-04-08 14:34:45,829 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 14:34:45,829 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 14:34:45,829 INFO L74 IsIncluded]: Start isIncluded. First operand has 100 states, 72 states have (on average 1.0277777777777777) internal successors, (74), 72 states have internal predecessors, (74), 15 states have call successors, (15), 14 states have call predecessors, (15), 12 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) Second operand 100 states. [2022-04-08 14:34:45,830 INFO L87 Difference]: Start difference. First operand has 100 states, 72 states have (on average 1.0277777777777777) internal successors, (74), 72 states have internal predecessors, (74), 15 states have call successors, (15), 14 states have call predecessors, (15), 12 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) Second operand 100 states. [2022-04-08 14:34:45,831 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:34:45,831 INFO L93 Difference]: Finished difference Result 100 states and 102 transitions. [2022-04-08 14:34:45,831 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 102 transitions. [2022-04-08 14:34:45,832 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 14:34:45,832 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 14:34:45,832 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 14:34:45,832 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 14:34:45,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 72 states have (on average 1.0277777777777777) internal successors, (74), 72 states have internal predecessors, (74), 15 states have call successors, (15), 14 states have call predecessors, (15), 12 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2022-04-08 14:34:45,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 102 transitions. [2022-04-08 14:34:45,834 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 102 transitions. Word has length 95 [2022-04-08 14:34:45,834 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 14:34:45,834 INFO L478 AbstractCegarLoop]: Abstraction has 100 states and 102 transitions. [2022-04-08 14:34:45,834 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 5.230769230769231) internal successors, (68), 12 states have internal predecessors, (68), 12 states have call successors, (14), 12 states have call predecessors, (14), 11 states have return successors, (12), 11 states have call predecessors, (12), 12 states have call successors, (12) [2022-04-08 14:34:45,835 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 100 states and 102 transitions. [2022-04-08 14:34:50,222 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 102 edges. 101 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-08 14:34:50,223 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 102 transitions. [2022-04-08 14:34:50,223 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2022-04-08 14:34:50,223 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 14:34:50,224 INFO L499 BasicCegarLoop]: trace histogram [12, 11, 11, 10, 10, 10, 10, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 14:34:50,251 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Forceful destruction successful, exit code 0 [2022-04-08 14:34:50,436 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable20 [2022-04-08 14:34:50,437 INFO L403 AbstractCegarLoop]: === Iteration 22 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 14:34:50,437 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 14:34:50,437 INFO L85 PathProgramCache]: Analyzing trace with hash 1379030639, now seen corresponding path program 17 times [2022-04-08 14:34:50,437 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 14:34:50,437 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [608067879] [2022-04-08 14:34:50,522 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 14:34:50,522 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 14:34:50,522 INFO L85 PathProgramCache]: Analyzing trace with hash 1379030639, now seen corresponding path program 18 times [2022-04-08 14:34:50,522 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 14:34:50,523 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [737458634] [2022-04-08 14:34:50,523 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 14:34:50,523 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 14:34:50,536 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 14:34:50,537 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1973883742] [2022-04-08 14:34:50,537 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-08 14:34:50,537 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 14:34:50,537 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 14:34:50,538 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 14:34:50,539 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Waiting until timeout for monitored process [2022-04-08 14:36:37,570 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 10 check-sat command(s) [2022-04-08 14:36:37,570 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 14:36:37,637 INFO L263 TraceCheckSpWp]: Trace formula consists of 288 conjuncts, 45 conjunts are in the unsatisfiable core [2022-04-08 14:36:37,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 14:36:37,661 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 14:36:38,329 INFO L272 TraceCheckUtils]: 0: Hoare triple {14108#true} call ULTIMATE.init(); {14108#true} is VALID [2022-04-08 14:36:38,329 INFO L290 TraceCheckUtils]: 1: Hoare triple {14108#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; {14108#true} is VALID [2022-04-08 14:36:38,330 INFO L290 TraceCheckUtils]: 2: Hoare triple {14108#true} assume true; {14108#true} is VALID [2022-04-08 14:36:38,330 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {14108#true} {14108#true} #61#return; {14108#true} is VALID [2022-04-08 14:36:38,330 INFO L272 TraceCheckUtils]: 4: Hoare triple {14108#true} call #t~ret6 := main(); {14108#true} is VALID [2022-04-08 14:36:38,330 INFO L290 TraceCheckUtils]: 5: Hoare triple {14108#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; {14108#true} is VALID [2022-04-08 14:36:38,330 INFO L272 TraceCheckUtils]: 6: Hoare triple {14108#true} call assume_abort_if_not((if ~k~0 <= 256 then 1 else 0)); {14108#true} is VALID [2022-04-08 14:36:38,330 INFO L290 TraceCheckUtils]: 7: Hoare triple {14108#true} ~cond := #in~cond; {14108#true} is VALID [2022-04-08 14:36:38,330 INFO L290 TraceCheckUtils]: 8: Hoare triple {14108#true} assume !(0 == ~cond); {14108#true} is VALID [2022-04-08 14:36:38,330 INFO L290 TraceCheckUtils]: 9: Hoare triple {14108#true} assume true; {14108#true} is VALID [2022-04-08 14:36:38,330 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {14108#true} {14108#true} #53#return; {14108#true} is VALID [2022-04-08 14:36:38,331 INFO L290 TraceCheckUtils]: 11: Hoare triple {14108#true} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {14146#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-08 14:36:38,331 INFO L290 TraceCheckUtils]: 12: Hoare triple {14146#(and (= main_~c~0 0) (= main_~y~0 0))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {14146#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-08 14:36:38,331 INFO L290 TraceCheckUtils]: 13: Hoare triple {14146#(and (= main_~c~0 0) (= main_~y~0 0))} assume !!(#t~post5 < 10);havoc #t~post5; {14146#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-08 14:36:38,331 INFO L272 TraceCheckUtils]: 14: Hoare triple {14146#(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)); {14108#true} is VALID [2022-04-08 14:36:38,331 INFO L290 TraceCheckUtils]: 15: Hoare triple {14108#true} ~cond := #in~cond; {14108#true} is VALID [2022-04-08 14:36:38,331 INFO L290 TraceCheckUtils]: 16: Hoare triple {14108#true} assume !(0 == ~cond); {14108#true} is VALID [2022-04-08 14:36:38,332 INFO L290 TraceCheckUtils]: 17: Hoare triple {14108#true} assume true; {14108#true} is VALID [2022-04-08 14:36:38,332 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {14108#true} {14146#(and (= main_~c~0 0) (= main_~y~0 0))} #55#return; {14146#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-08 14:36:38,332 INFO L290 TraceCheckUtils]: 19: Hoare triple {14146#(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; {14171#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} is VALID [2022-04-08 14:36:38,333 INFO L290 TraceCheckUtils]: 20: Hoare triple {14171#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {14171#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} is VALID [2022-04-08 14:36:38,333 INFO L290 TraceCheckUtils]: 21: Hoare triple {14171#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} assume !!(#t~post5 < 10);havoc #t~post5; {14171#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} is VALID [2022-04-08 14:36:38,333 INFO L272 TraceCheckUtils]: 22: Hoare triple {14171#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~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)); {14108#true} is VALID [2022-04-08 14:36:38,333 INFO L290 TraceCheckUtils]: 23: Hoare triple {14108#true} ~cond := #in~cond; {14108#true} is VALID [2022-04-08 14:36:38,333 INFO L290 TraceCheckUtils]: 24: Hoare triple {14108#true} assume !(0 == ~cond); {14108#true} is VALID [2022-04-08 14:36:38,333 INFO L290 TraceCheckUtils]: 25: Hoare triple {14108#true} assume true; {14108#true} is VALID [2022-04-08 14:36:38,334 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {14108#true} {14171#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} #55#return; {14171#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} is VALID [2022-04-08 14:36:38,334 INFO L290 TraceCheckUtils]: 27: Hoare triple {14171#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~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; {14196#(and (= (+ (- 2) main_~y~0) 0) (= 0 (+ (- 2) main_~c~0)) (< main_~c~0 (+ main_~k~0 1)))} is VALID [2022-04-08 14:36:38,335 INFO L290 TraceCheckUtils]: 28: Hoare triple {14196#(and (= (+ (- 2) main_~y~0) 0) (= 0 (+ (- 2) main_~c~0)) (< main_~c~0 (+ main_~k~0 1)))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {14196#(and (= (+ (- 2) main_~y~0) 0) (= 0 (+ (- 2) main_~c~0)) (< main_~c~0 (+ main_~k~0 1)))} is VALID [2022-04-08 14:36:38,335 INFO L290 TraceCheckUtils]: 29: Hoare triple {14196#(and (= (+ (- 2) main_~y~0) 0) (= 0 (+ (- 2) main_~c~0)) (< main_~c~0 (+ main_~k~0 1)))} assume !!(#t~post5 < 10);havoc #t~post5; {14196#(and (= (+ (- 2) main_~y~0) 0) (= 0 (+ (- 2) main_~c~0)) (< main_~c~0 (+ main_~k~0 1)))} is VALID [2022-04-08 14:36:38,335 INFO L272 TraceCheckUtils]: 30: Hoare triple {14196#(and (= (+ (- 2) main_~y~0) 0) (= 0 (+ (- 2) main_~c~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)); {14108#true} is VALID [2022-04-08 14:36:38,335 INFO L290 TraceCheckUtils]: 31: Hoare triple {14108#true} ~cond := #in~cond; {14108#true} is VALID [2022-04-08 14:36:38,335 INFO L290 TraceCheckUtils]: 32: Hoare triple {14108#true} assume !(0 == ~cond); {14108#true} is VALID [2022-04-08 14:36:38,335 INFO L290 TraceCheckUtils]: 33: Hoare triple {14108#true} assume true; {14108#true} is VALID [2022-04-08 14:36:38,336 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {14108#true} {14196#(and (= (+ (- 2) main_~y~0) 0) (= 0 (+ (- 2) main_~c~0)) (< main_~c~0 (+ main_~k~0 1)))} #55#return; {14196#(and (= (+ (- 2) main_~y~0) 0) (= 0 (+ (- 2) main_~c~0)) (< main_~c~0 (+ main_~k~0 1)))} is VALID [2022-04-08 14:36:38,337 INFO L290 TraceCheckUtils]: 35: Hoare triple {14196#(and (= (+ (- 2) main_~y~0) 0) (= 0 (+ (- 2) main_~c~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; {14221#(and (= (+ main_~c~0 (- 3)) 0) (= main_~y~0 3) (< main_~c~0 (+ main_~k~0 2)))} is VALID [2022-04-08 14:36:38,337 INFO L290 TraceCheckUtils]: 36: Hoare triple {14221#(and (= (+ main_~c~0 (- 3)) 0) (= main_~y~0 3) (< main_~c~0 (+ main_~k~0 2)))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {14221#(and (= (+ main_~c~0 (- 3)) 0) (= main_~y~0 3) (< main_~c~0 (+ main_~k~0 2)))} is VALID [2022-04-08 14:36:38,338 INFO L290 TraceCheckUtils]: 37: Hoare triple {14221#(and (= (+ main_~c~0 (- 3)) 0) (= main_~y~0 3) (< main_~c~0 (+ main_~k~0 2)))} assume !!(#t~post5 < 10);havoc #t~post5; {14221#(and (= (+ main_~c~0 (- 3)) 0) (= main_~y~0 3) (< main_~c~0 (+ main_~k~0 2)))} is VALID [2022-04-08 14:36:38,338 INFO L272 TraceCheckUtils]: 38: Hoare triple {14221#(and (= (+ main_~c~0 (- 3)) 0) (= main_~y~0 3) (< main_~c~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)); {14108#true} is VALID [2022-04-08 14:36:38,338 INFO L290 TraceCheckUtils]: 39: Hoare triple {14108#true} ~cond := #in~cond; {14108#true} is VALID [2022-04-08 14:36:38,338 INFO L290 TraceCheckUtils]: 40: Hoare triple {14108#true} assume !(0 == ~cond); {14108#true} is VALID [2022-04-08 14:36:38,338 INFO L290 TraceCheckUtils]: 41: Hoare triple {14108#true} assume true; {14108#true} is VALID [2022-04-08 14:36:38,338 INFO L284 TraceCheckUtils]: 42: Hoare quadruple {14108#true} {14221#(and (= (+ main_~c~0 (- 3)) 0) (= main_~y~0 3) (< main_~c~0 (+ main_~k~0 2)))} #55#return; {14221#(and (= (+ main_~c~0 (- 3)) 0) (= main_~y~0 3) (< main_~c~0 (+ main_~k~0 2)))} is VALID [2022-04-08 14:36:38,339 INFO L290 TraceCheckUtils]: 43: Hoare triple {14221#(and (= (+ main_~c~0 (- 3)) 0) (= main_~y~0 3) (< main_~c~0 (+ main_~k~0 2)))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {14246#(and (< 1 main_~k~0) (= main_~y~0 4) (= main_~c~0 4))} is VALID [2022-04-08 14:36:38,340 INFO L290 TraceCheckUtils]: 44: Hoare triple {14246#(and (< 1 main_~k~0) (= main_~y~0 4) (= main_~c~0 4))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {14246#(and (< 1 main_~k~0) (= main_~y~0 4) (= main_~c~0 4))} is VALID [2022-04-08 14:36:38,340 INFO L290 TraceCheckUtils]: 45: Hoare triple {14246#(and (< 1 main_~k~0) (= main_~y~0 4) (= main_~c~0 4))} assume !!(#t~post5 < 10);havoc #t~post5; {14246#(and (< 1 main_~k~0) (= main_~y~0 4) (= main_~c~0 4))} is VALID [2022-04-08 14:36:38,340 INFO L272 TraceCheckUtils]: 46: Hoare triple {14246#(and (< 1 main_~k~0) (= main_~y~0 4) (= 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)); {14108#true} is VALID [2022-04-08 14:36:38,340 INFO L290 TraceCheckUtils]: 47: Hoare triple {14108#true} ~cond := #in~cond; {14108#true} is VALID [2022-04-08 14:36:38,340 INFO L290 TraceCheckUtils]: 48: Hoare triple {14108#true} assume !(0 == ~cond); {14108#true} is VALID [2022-04-08 14:36:38,340 INFO L290 TraceCheckUtils]: 49: Hoare triple {14108#true} assume true; {14108#true} is VALID [2022-04-08 14:36:38,341 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {14108#true} {14246#(and (< 1 main_~k~0) (= main_~y~0 4) (= main_~c~0 4))} #55#return; {14246#(and (< 1 main_~k~0) (= main_~y~0 4) (= main_~c~0 4))} is VALID [2022-04-08 14:36:38,341 INFO L290 TraceCheckUtils]: 51: Hoare triple {14246#(and (< 1 main_~k~0) (= main_~y~0 4) (= main_~c~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; {14271#(and (< 1 main_~k~0) (= (+ (- 1) main_~c~0) 4) (= 5 main_~y~0))} is VALID [2022-04-08 14:36:38,341 INFO L290 TraceCheckUtils]: 52: Hoare triple {14271#(and (< 1 main_~k~0) (= (+ (- 1) main_~c~0) 4) (= 5 main_~y~0))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {14271#(and (< 1 main_~k~0) (= (+ (- 1) main_~c~0) 4) (= 5 main_~y~0))} is VALID [2022-04-08 14:36:38,342 INFO L290 TraceCheckUtils]: 53: Hoare triple {14271#(and (< 1 main_~k~0) (= (+ (- 1) main_~c~0) 4) (= 5 main_~y~0))} assume !!(#t~post5 < 10);havoc #t~post5; {14271#(and (< 1 main_~k~0) (= (+ (- 1) main_~c~0) 4) (= 5 main_~y~0))} is VALID [2022-04-08 14:36:38,342 INFO L272 TraceCheckUtils]: 54: Hoare triple {14271#(and (< 1 main_~k~0) (= (+ (- 1) main_~c~0) 4) (= 5 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)); {14108#true} is VALID [2022-04-08 14:36:38,342 INFO L290 TraceCheckUtils]: 55: Hoare triple {14108#true} ~cond := #in~cond; {14108#true} is VALID [2022-04-08 14:36:38,342 INFO L290 TraceCheckUtils]: 56: Hoare triple {14108#true} assume !(0 == ~cond); {14108#true} is VALID [2022-04-08 14:36:38,342 INFO L290 TraceCheckUtils]: 57: Hoare triple {14108#true} assume true; {14108#true} is VALID [2022-04-08 14:36:38,343 INFO L284 TraceCheckUtils]: 58: Hoare quadruple {14108#true} {14271#(and (< 1 main_~k~0) (= (+ (- 1) main_~c~0) 4) (= 5 main_~y~0))} #55#return; {14271#(and (< 1 main_~k~0) (= (+ (- 1) main_~c~0) 4) (= 5 main_~y~0))} is VALID [2022-04-08 14:36:38,343 INFO L290 TraceCheckUtils]: 59: Hoare triple {14271#(and (< 1 main_~k~0) (= (+ (- 1) main_~c~0) 4) (= 5 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; {14296#(and (= main_~y~0 6) (< 1 main_~k~0) (= 4 (+ (- 2) main_~c~0)))} is VALID [2022-04-08 14:36:38,343 INFO L290 TraceCheckUtils]: 60: Hoare triple {14296#(and (= main_~y~0 6) (< 1 main_~k~0) (= 4 (+ (- 2) main_~c~0)))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {14296#(and (= main_~y~0 6) (< 1 main_~k~0) (= 4 (+ (- 2) main_~c~0)))} is VALID [2022-04-08 14:36:38,344 INFO L290 TraceCheckUtils]: 61: Hoare triple {14296#(and (= main_~y~0 6) (< 1 main_~k~0) (= 4 (+ (- 2) main_~c~0)))} assume !!(#t~post5 < 10);havoc #t~post5; {14296#(and (= main_~y~0 6) (< 1 main_~k~0) (= 4 (+ (- 2) main_~c~0)))} is VALID [2022-04-08 14:36:38,344 INFO L272 TraceCheckUtils]: 62: Hoare triple {14296#(and (= main_~y~0 6) (< 1 main_~k~0) (= 4 (+ (- 2) main_~c~0)))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {14108#true} is VALID [2022-04-08 14:36:38,344 INFO L290 TraceCheckUtils]: 63: Hoare triple {14108#true} ~cond := #in~cond; {14108#true} is VALID [2022-04-08 14:36:38,344 INFO L290 TraceCheckUtils]: 64: Hoare triple {14108#true} assume !(0 == ~cond); {14108#true} is VALID [2022-04-08 14:36:38,344 INFO L290 TraceCheckUtils]: 65: Hoare triple {14108#true} assume true; {14108#true} is VALID [2022-04-08 14:36:38,345 INFO L284 TraceCheckUtils]: 66: Hoare quadruple {14108#true} {14296#(and (= main_~y~0 6) (< 1 main_~k~0) (= 4 (+ (- 2) main_~c~0)))} #55#return; {14296#(and (= main_~y~0 6) (< 1 main_~k~0) (= 4 (+ (- 2) main_~c~0)))} is VALID [2022-04-08 14:36:38,345 INFO L290 TraceCheckUtils]: 67: Hoare triple {14296#(and (= main_~y~0 6) (< 1 main_~k~0) (= 4 (+ (- 2) main_~c~0)))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {14321#(and (< 1 main_~k~0) (= (+ main_~c~0 (- 3)) 4) (= 6 (+ (- 1) main_~y~0)))} is VALID [2022-04-08 14:36:38,345 INFO L290 TraceCheckUtils]: 68: Hoare triple {14321#(and (< 1 main_~k~0) (= (+ main_~c~0 (- 3)) 4) (= 6 (+ (- 1) main_~y~0)))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {14321#(and (< 1 main_~k~0) (= (+ main_~c~0 (- 3)) 4) (= 6 (+ (- 1) main_~y~0)))} is VALID [2022-04-08 14:36:38,346 INFO L290 TraceCheckUtils]: 69: Hoare triple {14321#(and (< 1 main_~k~0) (= (+ main_~c~0 (- 3)) 4) (= 6 (+ (- 1) main_~y~0)))} assume !!(#t~post5 < 10);havoc #t~post5; {14321#(and (< 1 main_~k~0) (= (+ main_~c~0 (- 3)) 4) (= 6 (+ (- 1) main_~y~0)))} is VALID [2022-04-08 14:36:38,346 INFO L272 TraceCheckUtils]: 70: Hoare triple {14321#(and (< 1 main_~k~0) (= (+ main_~c~0 (- 3)) 4) (= 6 (+ (- 1) 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)); {14108#true} is VALID [2022-04-08 14:36:38,346 INFO L290 TraceCheckUtils]: 71: Hoare triple {14108#true} ~cond := #in~cond; {14108#true} is VALID [2022-04-08 14:36:38,346 INFO L290 TraceCheckUtils]: 72: Hoare triple {14108#true} assume !(0 == ~cond); {14108#true} is VALID [2022-04-08 14:36:38,346 INFO L290 TraceCheckUtils]: 73: Hoare triple {14108#true} assume true; {14108#true} is VALID [2022-04-08 14:36:38,347 INFO L284 TraceCheckUtils]: 74: Hoare quadruple {14108#true} {14321#(and (< 1 main_~k~0) (= (+ main_~c~0 (- 3)) 4) (= 6 (+ (- 1) main_~y~0)))} #55#return; {14321#(and (< 1 main_~k~0) (= (+ main_~c~0 (- 3)) 4) (= 6 (+ (- 1) main_~y~0)))} is VALID [2022-04-08 14:36:38,347 INFO L290 TraceCheckUtils]: 75: Hoare triple {14321#(and (< 1 main_~k~0) (= (+ main_~c~0 (- 3)) 4) (= 6 (+ (- 1) 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; {14346#(and (< 1 main_~k~0) (= main_~y~0 8) (= main_~c~0 8))} is VALID [2022-04-08 14:36:38,347 INFO L290 TraceCheckUtils]: 76: Hoare triple {14346#(and (< 1 main_~k~0) (= main_~y~0 8) (= main_~c~0 8))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {14346#(and (< 1 main_~k~0) (= main_~y~0 8) (= main_~c~0 8))} is VALID [2022-04-08 14:36:38,348 INFO L290 TraceCheckUtils]: 77: Hoare triple {14346#(and (< 1 main_~k~0) (= main_~y~0 8) (= main_~c~0 8))} assume !!(#t~post5 < 10);havoc #t~post5; {14346#(and (< 1 main_~k~0) (= main_~y~0 8) (= main_~c~0 8))} is VALID [2022-04-08 14:36:38,348 INFO L272 TraceCheckUtils]: 78: Hoare triple {14346#(and (< 1 main_~k~0) (= main_~y~0 8) (= main_~c~0 8))} 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)); {14108#true} is VALID [2022-04-08 14:36:38,348 INFO L290 TraceCheckUtils]: 79: Hoare triple {14108#true} ~cond := #in~cond; {14108#true} is VALID [2022-04-08 14:36:38,348 INFO L290 TraceCheckUtils]: 80: Hoare triple {14108#true} assume !(0 == ~cond); {14108#true} is VALID [2022-04-08 14:36:38,348 INFO L290 TraceCheckUtils]: 81: Hoare triple {14108#true} assume true; {14108#true} is VALID [2022-04-08 14:36:38,349 INFO L284 TraceCheckUtils]: 82: Hoare quadruple {14108#true} {14346#(and (< 1 main_~k~0) (= main_~y~0 8) (= main_~c~0 8))} #55#return; {14346#(and (< 1 main_~k~0) (= main_~y~0 8) (= main_~c~0 8))} is VALID [2022-04-08 14:36:38,349 INFO L290 TraceCheckUtils]: 83: Hoare triple {14346#(and (< 1 main_~k~0) (= main_~y~0 8) (= main_~c~0 8))} 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; {14371#(and (= main_~y~0 9) (< 8 main_~k~0) (<= main_~c~0 9))} is VALID [2022-04-08 14:36:38,349 INFO L290 TraceCheckUtils]: 84: Hoare triple {14371#(and (= main_~y~0 9) (< 8 main_~k~0) (<= main_~c~0 9))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {14371#(and (= main_~y~0 9) (< 8 main_~k~0) (<= main_~c~0 9))} is VALID [2022-04-08 14:36:38,350 INFO L290 TraceCheckUtils]: 85: Hoare triple {14371#(and (= main_~y~0 9) (< 8 main_~k~0) (<= main_~c~0 9))} assume !!(#t~post5 < 10);havoc #t~post5; {14371#(and (= main_~y~0 9) (< 8 main_~k~0) (<= main_~c~0 9))} is VALID [2022-04-08 14:36:38,350 INFO L272 TraceCheckUtils]: 86: Hoare triple {14371#(and (= main_~y~0 9) (< 8 main_~k~0) (<= main_~c~0 9))} 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)); {14108#true} is VALID [2022-04-08 14:36:38,350 INFO L290 TraceCheckUtils]: 87: Hoare triple {14108#true} ~cond := #in~cond; {14108#true} is VALID [2022-04-08 14:36:38,350 INFO L290 TraceCheckUtils]: 88: Hoare triple {14108#true} assume !(0 == ~cond); {14108#true} is VALID [2022-04-08 14:36:38,350 INFO L290 TraceCheckUtils]: 89: Hoare triple {14108#true} assume true; {14108#true} is VALID [2022-04-08 14:36:38,350 INFO L284 TraceCheckUtils]: 90: Hoare quadruple {14108#true} {14371#(and (= main_~y~0 9) (< 8 main_~k~0) (<= main_~c~0 9))} #55#return; {14371#(and (= main_~y~0 9) (< 8 main_~k~0) (<= main_~c~0 9))} is VALID [2022-04-08 14:36:38,351 INFO L290 TraceCheckUtils]: 91: Hoare triple {14371#(and (= main_~y~0 9) (< 8 main_~k~0) (<= main_~c~0 9))} assume !(~c~0 < ~k~0); {14396#(and (= main_~y~0 9) (<= main_~k~0 9) (< 8 main_~k~0))} is VALID [2022-04-08 14:36:38,351 INFO L272 TraceCheckUtils]: 92: Hoare triple {14396#(and (= main_~y~0 9) (<= main_~k~0 9) (< 8 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)); {14108#true} is VALID [2022-04-08 14:36:38,351 INFO L290 TraceCheckUtils]: 93: Hoare triple {14108#true} ~cond := #in~cond; {14108#true} is VALID [2022-04-08 14:36:38,352 INFO L290 TraceCheckUtils]: 94: Hoare triple {14108#true} assume !(0 == ~cond); {14108#true} is VALID [2022-04-08 14:36:38,352 INFO L290 TraceCheckUtils]: 95: Hoare triple {14108#true} assume true; {14108#true} is VALID [2022-04-08 14:36:38,352 INFO L284 TraceCheckUtils]: 96: Hoare quadruple {14108#true} {14396#(and (= main_~y~0 9) (<= main_~k~0 9) (< 8 main_~k~0))} #57#return; {14396#(and (= main_~y~0 9) (<= main_~k~0 9) (< 8 main_~k~0))} is VALID [2022-04-08 14:36:38,353 INFO L272 TraceCheckUtils]: 97: Hoare triple {14396#(and (= main_~y~0 9) (<= main_~k~0 9) (< 8 main_~k~0))} call __VERIFIER_assert((if ~k~0 * ~y~0 == ~y~0 * ~y~0 then 1 else 0)); {14415#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 14:36:38,353 INFO L290 TraceCheckUtils]: 98: Hoare triple {14415#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {14419#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 14:36:38,353 INFO L290 TraceCheckUtils]: 99: Hoare triple {14419#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {14109#false} is VALID [2022-04-08 14:36:38,353 INFO L290 TraceCheckUtils]: 100: Hoare triple {14109#false} assume !false; {14109#false} is VALID [2022-04-08 14:36:38,354 INFO L134 CoverageAnalysis]: Checked inductivity of 422 backedges. 22 proven. 180 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2022-04-08 14:36:38,354 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 14:36:39,274 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 14:36:39,275 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [737458634] [2022-04-08 14:36:39,275 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 14:36:39,275 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1973883742] [2022-04-08 14:36:39,275 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1973883742] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 14:36:39,275 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-08 14:36:39,275 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2022-04-08 14:36:39,275 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 14:36:39,276 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [608067879] [2022-04-08 14:36:39,276 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [608067879] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 14:36:39,276 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 14:36:39,276 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2022-04-08 14:36:39,276 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [126949647] [2022-04-08 14:36:39,276 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 14:36:39,276 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 3.0714285714285716) internal successors, (43), 14 states have internal predecessors, (43), 12 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (13), 12 states have call predecessors, (13), 12 states have call successors, (13) Word has length 101 [2022-04-08 14:36:39,277 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 14:36:39,277 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 15 states, 14 states have (on average 3.0714285714285716) internal successors, (43), 14 states have internal predecessors, (43), 12 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (13), 12 states have call predecessors, (13), 12 states have call successors, (13) [2022-04-08 14:36:39,331 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 71 edges. 71 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 14:36:39,332 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-04-08 14:36:39,332 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 14:36:39,332 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-04-08 14:36:39,332 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=126, Invalid=474, Unknown=0, NotChecked=0, Total=600 [2022-04-08 14:36:39,333 INFO L87 Difference]: Start difference. First operand 100 states and 102 transitions. Second operand has 15 states, 14 states have (on average 3.0714285714285716) internal successors, (43), 14 states have internal predecessors, (43), 12 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (13), 12 states have call predecessors, (13), 12 states have call successors, (13) [2022-04-08 14:36:40,770 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:36:40,770 INFO L93 Difference]: Finished difference Result 108 states and 112 transitions. [2022-04-08 14:36:40,770 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-04-08 14:36:40,771 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 3.0714285714285716) internal successors, (43), 14 states have internal predecessors, (43), 12 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (13), 12 states have call predecessors, (13), 12 states have call successors, (13) Word has length 101 [2022-04-08 14:36:40,771 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 14:36:40,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 14 states have (on average 3.0714285714285716) internal successors, (43), 14 states have internal predecessors, (43), 12 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (13), 12 states have call predecessors, (13), 12 states have call successors, (13) [2022-04-08 14:36:40,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 84 transitions. [2022-04-08 14:36:40,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 14 states have (on average 3.0714285714285716) internal successors, (43), 14 states have internal predecessors, (43), 12 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (13), 12 states have call predecessors, (13), 12 states have call successors, (13) [2022-04-08 14:36:40,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 84 transitions. [2022-04-08 14:36:40,774 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 15 states and 84 transitions. [2022-04-08 14:36:40,862 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 84 edges. 84 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 14:36:40,864 INFO L225 Difference]: With dead ends: 108 [2022-04-08 14:36:40,864 INFO L226 Difference]: Without dead ends: 102 [2022-04-08 14:36:40,864 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 177 GetRequests, 151 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=136, Invalid=566, Unknown=0, NotChecked=0, Total=702 [2022-04-08 14:36:40,865 INFO L913 BasicCegarLoop]: 64 mSDtfsCounter, 2 mSDsluCounter, 488 mSDsCounter, 0 mSdLazyCounter, 467 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 552 SdHoareTripleChecker+Invalid, 468 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 467 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-04-08 14:36:40,865 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [2 Valid, 552 Invalid, 468 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 467 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-04-08 14:36:40,865 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2022-04-08 14:36:41,035 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 102. [2022-04-08 14:36:41,035 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 14:36:41,036 INFO L82 GeneralOperation]: Start isEquivalent. First operand 102 states. Second operand has 102 states, 73 states have (on average 1.0273972602739727) internal successors, (75), 73 states have internal predecessors, (75), 16 states have call successors, (16), 14 states have call predecessors, (16), 12 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2022-04-08 14:36:41,036 INFO L74 IsIncluded]: Start isIncluded. First operand 102 states. Second operand has 102 states, 73 states have (on average 1.0273972602739727) internal successors, (75), 73 states have internal predecessors, (75), 16 states have call successors, (16), 14 states have call predecessors, (16), 12 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2022-04-08 14:36:41,036 INFO L87 Difference]: Start difference. First operand 102 states. Second operand has 102 states, 73 states have (on average 1.0273972602739727) internal successors, (75), 73 states have internal predecessors, (75), 16 states have call successors, (16), 14 states have call predecessors, (16), 12 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2022-04-08 14:36:41,038 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:36:41,038 INFO L93 Difference]: Finished difference Result 102 states and 105 transitions. [2022-04-08 14:36:41,038 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 105 transitions. [2022-04-08 14:36:41,038 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 14:36:41,038 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 14:36:41,039 INFO L74 IsIncluded]: Start isIncluded. First operand has 102 states, 73 states have (on average 1.0273972602739727) internal successors, (75), 73 states have internal predecessors, (75), 16 states have call successors, (16), 14 states have call predecessors, (16), 12 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) Second operand 102 states. [2022-04-08 14:36:41,039 INFO L87 Difference]: Start difference. First operand has 102 states, 73 states have (on average 1.0273972602739727) internal successors, (75), 73 states have internal predecessors, (75), 16 states have call successors, (16), 14 states have call predecessors, (16), 12 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) Second operand 102 states. [2022-04-08 14:36:41,040 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:36:41,041 INFO L93 Difference]: Finished difference Result 102 states and 105 transitions. [2022-04-08 14:36:41,041 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 105 transitions. [2022-04-08 14:36:41,041 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 14:36:41,041 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 14:36:41,041 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 14:36:41,041 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 14:36:41,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 73 states have (on average 1.0273972602739727) internal successors, (75), 73 states have internal predecessors, (75), 16 states have call successors, (16), 14 states have call predecessors, (16), 12 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2022-04-08 14:36:41,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 105 transitions. [2022-04-08 14:36:41,043 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 105 transitions. Word has length 101 [2022-04-08 14:36:41,043 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 14:36:41,043 INFO L478 AbstractCegarLoop]: Abstraction has 102 states and 105 transitions. [2022-04-08 14:36:41,043 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 3.0714285714285716) internal successors, (43), 14 states have internal predecessors, (43), 12 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (13), 12 states have call predecessors, (13), 12 states have call successors, (13) [2022-04-08 14:36:41,043 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 102 states and 105 transitions. [2022-04-08 14:36:45,519 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 105 edges. 104 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-08 14:36:45,519 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 105 transitions. [2022-04-08 14:36:45,520 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2022-04-08 14:36:45,520 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 14:36:45,520 INFO L499 BasicCegarLoop]: trace histogram [12, 11, 11, 11, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 14:36:45,562 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Forceful destruction successful, exit code 0 [2022-04-08 14:36:45,720 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2022-04-08 14:36:45,721 INFO L403 AbstractCegarLoop]: === Iteration 23 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 14:36:45,721 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 14:36:45,721 INFO L85 PathProgramCache]: Analyzing trace with hash 844335210, now seen corresponding path program 17 times [2022-04-08 14:36:45,721 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 14:36:45,721 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1387744183] [2022-04-08 14:36:45,828 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 14:36:45,828 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 14:36:45,828 INFO L85 PathProgramCache]: Analyzing trace with hash 844335210, now seen corresponding path program 18 times [2022-04-08 14:36:45,828 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 14:36:45,828 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1967220516] [2022-04-08 14:36:45,828 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 14:36:45,828 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 14:36:45,840 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 14:36:45,841 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [334935139] [2022-04-08 14:36:45,841 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-08 14:36:45,841 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 14:36:45,841 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 14:36:45,844 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 14:36:45,844 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Waiting until timeout for monitored process [2022-04-08 14:36:46,493 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 11 check-sat command(s) [2022-04-08 14:36:46,493 INFO L229 tOrderPrioritization]: Conjunction of SSA is sat [2022-04-08 14:36:46,493 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.