/usr/bin/java -ea -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data --core.log.level.for.class de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationJordan_32.epf -i ../../../trunk/examples/svcomp/nla-digbench-scaling/ps4-ll_unwindbound20.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-e106359-m [2022-04-15 10:44:56,977 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-15 10:44:56,979 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-15 10:44:57,039 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-15 10:44:57,039 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-15 10:44:57,040 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-15 10:44:57,042 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-15 10:44:57,046 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-15 10:44:57,047 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-15 10:44:57,063 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-15 10:44:57,064 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-15 10:44:57,065 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-15 10:44:57,065 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-15 10:44:57,067 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-15 10:44:57,068 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-15 10:44:57,072 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-15 10:44:57,072 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-15 10:44:57,073 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-15 10:44:57,074 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-15 10:44:57,078 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-15 10:44:57,079 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-15 10:44:57,080 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-15 10:44:57,081 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-15 10:44:57,081 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-15 10:44:57,082 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-15 10:44:57,087 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-15 10:44:57,087 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-15 10:44:57,087 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-15 10:44:57,088 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-15 10:44:57,088 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-15 10:44:57,089 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-15 10:44:57,089 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-15 10:44:57,103 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-15 10:44:57,104 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-15 10:44:57,104 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-15 10:44:57,105 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-15 10:44:57,105 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-15 10:44:57,106 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-15 10:44:57,106 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-15 10:44:57,106 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-15 10:44:57,106 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-15 10:44:57,107 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-15 10:44:57,107 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationJordan_32.epf [2022-04-15 10:44:57,113 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-15 10:44:57,113 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-15 10:44:57,114 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-15 10:44:57,114 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-15 10:44:57,114 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-15 10:44:57,114 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-15 10:44:57,114 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-15 10:44:57,114 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-15 10:44:57,114 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-15 10:44:57,114 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-15 10:44:57,114 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-15 10:44:57,114 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-15 10:44:57,115 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-15 10:44:57,115 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-15 10:44:57,115 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-15 10:44:57,118 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-15 10:44:57,118 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-15 10:44:57,118 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-15 10:44:57,118 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-15 10:44:57,118 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-15 10:44:57,118 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-04-15 10:44:57,118 INFO L138 SettingsManager]: * Trace refinement strategy=ACCELERATED_INTERPOLATION [2022-04-15 10:44:57,119 INFO L138 SettingsManager]: * Trace refinement strategy used in Accelerated Interpolation=CAMEL [2022-04-15 10:44:57,119 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-15 10:44:57,119 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=JORDAN [2022-04-15 10:44:57,119 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-15 10:44:57,423 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-15 10:44:57,440 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-15 10:44:57,441 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-15 10:44:57,442 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-15 10:44:57,443 INFO L275 PluginConnector]: CDTParser initialized [2022-04-15 10:44:57,444 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/nla-digbench-scaling/ps4-ll_unwindbound20.c [2022-04-15 10:44:57,487 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/702eb13ae/80cce3ca637140e4ae2cb349cbb34e0b/FLAG094b7bdb6 [2022-04-15 10:44:57,823 INFO L306 CDTParser]: Found 1 translation units. [2022-04-15 10:44:57,823 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/ps4-ll_unwindbound20.c [2022-04-15 10:44:57,827 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/702eb13ae/80cce3ca637140e4ae2cb349cbb34e0b/FLAG094b7bdb6 [2022-04-15 10:44:58,266 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/702eb13ae/80cce3ca637140e4ae2cb349cbb34e0b [2022-04-15 10:44:58,267 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-15 10:44:58,268 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-15 10:44:58,269 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-15 10:44:58,269 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-15 10:44:58,271 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-15 10:44:58,272 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.04 10:44:58" (1/1) ... [2022-04-15 10:44:58,272 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2ba09cf0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 10:44:58, skipping insertion in model container [2022-04-15 10:44:58,273 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.04 10:44:58" (1/1) ... [2022-04-15 10:44:58,277 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-15 10:44:58,284 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-15 10:44:58,401 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/ps4-ll_unwindbound20.c[458,471] [2022-04-15 10:44:58,430 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-15 10:44:58,437 INFO L203 MainTranslator]: Completed pre-run [2022-04-15 10:44:58,447 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/ps4-ll_unwindbound20.c[458,471] [2022-04-15 10:44:58,465 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-15 10:44:58,475 INFO L208 MainTranslator]: Completed translation [2022-04-15 10:44:58,475 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 10:44:58 WrapperNode [2022-04-15 10:44:58,476 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-15 10:44:58,477 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-15 10:44:58,477 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-15 10:44:58,477 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-15 10:44:58,484 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 10:44:58" (1/1) ... [2022-04-15 10:44:58,485 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 10:44:58" (1/1) ... [2022-04-15 10:44:58,492 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 10:44:58" (1/1) ... [2022-04-15 10:44:58,492 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 10:44:58" (1/1) ... [2022-04-15 10:44:58,504 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 10:44:58" (1/1) ... [2022-04-15 10:44:58,514 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 10:44:58" (1/1) ... [2022-04-15 10:44:58,515 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 10:44:58" (1/1) ... [2022-04-15 10:44:58,520 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-15 10:44:58,521 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-15 10:44:58,521 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-15 10:44:58,522 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-15 10:44:58,522 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 10:44:58" (1/1) ... [2022-04-15 10:44:58,528 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-15 10:44:58,537 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 10:44:58,553 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-15 10:44:58,584 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-15 10:44:58,602 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-15 10:44:58,602 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-15 10:44:58,602 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-15 10:44:58,602 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-15 10:44:58,602 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-15 10:44:58,603 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-15 10:44:58,603 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-15 10:44:58,603 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-15 10:44:58,603 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-15 10:44:58,603 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-15 10:44:58,603 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_short [2022-04-15 10:44:58,603 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-15 10:44:58,603 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-15 10:44:58,603 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-15 10:44:58,603 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-15 10:44:58,603 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-15 10:44:58,603 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-15 10:44:58,603 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-15 10:44:58,603 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-15 10:44:58,603 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-15 10:44:58,648 INFO L234 CfgBuilder]: Building ICFG [2022-04-15 10:44:58,650 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-15 10:44:58,754 INFO L275 CfgBuilder]: Performing block encoding [2022-04-15 10:44:58,758 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-15 10:44:58,758 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-15 10:44:58,760 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.04 10:44:58 BoogieIcfgContainer [2022-04-15 10:44:58,760 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-15 10:44:58,761 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-15 10:44:58,761 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-15 10:44:58,763 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-15 10:44:58,763 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.04 10:44:58" (1/3) ... [2022-04-15 10:44:58,764 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2ac69036 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.04 10:44:58, skipping insertion in model container [2022-04-15 10:44:58,764 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 10:44:58" (2/3) ... [2022-04-15 10:44:58,764 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2ac69036 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.04 10:44:58, skipping insertion in model container [2022-04-15 10:44:58,764 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.04 10:44:58" (3/3) ... [2022-04-15 10:44:58,765 INFO L111 eAbstractionObserver]: Analyzing ICFG ps4-ll_unwindbound20.c [2022-04-15 10:44:58,768 INFO L202 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-04-15 10:44:58,768 INFO L161 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-15 10:44:58,797 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-15 10:44:58,801 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-15 10:44:58,802 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-15 10:44:58,818 INFO L276 IsEmpty]: Start isEmpty. Operand has 23 states, 13 states have (on average 1.3846153846153846) internal successors, (18), 14 states have internal predecessors, (18), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-15 10:44:58,823 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-04-15 10:44:58,823 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 10:44:58,824 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 10:44:58,824 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 10:44:58,827 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 10:44:58,827 INFO L85 PathProgramCache]: Analyzing trace with hash -2133548928, now seen corresponding path program 1 times [2022-04-15 10:44:58,832 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 10:44:58,832 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [898997023] [2022-04-15 10:44:58,838 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 10:44:58,839 INFO L85 PathProgramCache]: Analyzing trace with hash -2133548928, now seen corresponding path program 2 times [2022-04-15 10:44:58,840 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 10:44:58,841 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [488622794] [2022-04-15 10:44:58,841 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 10:44:58,841 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 10:44:58,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 10:44:58,945 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 10:44:58,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 10:44:58,969 INFO L290 TraceCheckUtils]: 0: Hoare triple {31#(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; {26#true} is VALID [2022-04-15 10:44:58,970 INFO L290 TraceCheckUtils]: 1: Hoare triple {26#true} assume true; {26#true} is VALID [2022-04-15 10:44:58,970 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {26#true} {26#true} #57#return; {26#true} is VALID [2022-04-15 10:44:58,972 INFO L272 TraceCheckUtils]: 0: Hoare triple {26#true} call ULTIMATE.init(); {31#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 10:44:58,972 INFO L290 TraceCheckUtils]: 1: Hoare triple {31#(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; {26#true} is VALID [2022-04-15 10:44:58,972 INFO L290 TraceCheckUtils]: 2: Hoare triple {26#true} assume true; {26#true} is VALID [2022-04-15 10:44:58,972 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {26#true} {26#true} #57#return; {26#true} is VALID [2022-04-15 10:44:58,972 INFO L272 TraceCheckUtils]: 4: Hoare triple {26#true} call #t~ret6 := main(); {26#true} is VALID [2022-04-15 10:44:58,973 INFO L290 TraceCheckUtils]: 5: Hoare triple {26#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;~y~0 := 0;~x~0 := 0;~c~0 := 0; {26#true} is VALID [2022-04-15 10:44:58,973 INFO L290 TraceCheckUtils]: 6: Hoare triple {26#true} assume !true; {27#false} is VALID [2022-04-15 10:44:58,974 INFO L272 TraceCheckUtils]: 7: Hoare triple {27#false} call __VERIFIER_assert((if 0 == ~k~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {27#false} is VALID [2022-04-15 10:44:58,974 INFO L290 TraceCheckUtils]: 8: Hoare triple {27#false} ~cond := #in~cond; {27#false} is VALID [2022-04-15 10:44:58,974 INFO L290 TraceCheckUtils]: 9: Hoare triple {27#false} assume 0 == ~cond; {27#false} is VALID [2022-04-15 10:44:58,974 INFO L290 TraceCheckUtils]: 10: Hoare triple {27#false} assume !false; {27#false} is VALID [2022-04-15 10:44:58,974 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-15 10:44:58,975 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 10:44:58,975 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [488622794] [2022-04-15 10:44:58,975 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [488622794] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 10:44:58,975 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 10:44:58,976 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-15 10:44:58,977 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 10:44:58,977 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [898997023] [2022-04-15 10:44:58,977 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [898997023] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 10:44:58,978 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 10:44:58,978 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-15 10:44:58,978 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [479243961] [2022-04-15 10:44:58,978 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 10:44:58,981 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 11 [2022-04-15 10:44:58,982 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 10:44:58,984 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 10:44:58,997 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 11 edges. 11 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 10:44:58,998 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-15 10:44:58,998 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 10:44:59,012 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-15 10:44:59,012 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-15 10:44:59,014 INFO L87 Difference]: Start difference. First operand has 23 states, 13 states have (on average 1.3846153846153846) internal successors, (18), 14 states have internal predecessors, (18), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 10:44:59,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 10:44:59,095 INFO L93 Difference]: Finished difference Result 41 states and 55 transitions. [2022-04-15 10:44:59,095 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-15 10:44:59,096 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 11 [2022-04-15 10:44:59,096 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 10:44:59,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 10:44:59,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 55 transitions. [2022-04-15 10:44:59,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 10:44:59,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 55 transitions. [2022-04-15 10:44:59,105 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 55 transitions. [2022-04-15 10:44:59,154 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 55 edges. 55 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 10:44:59,160 INFO L225 Difference]: With dead ends: 41 [2022-04-15 10:44:59,160 INFO L226 Difference]: Without dead ends: 19 [2022-04-15 10:44:59,162 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 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-15 10:44:59,165 INFO L913 BasicCegarLoop]: 25 mSDtfsCounter, 6 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 29 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 10:44:59,165 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [6 Valid, 29 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 10:44:59,176 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2022-04-15 10:44:59,185 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 18. [2022-04-15 10:44:59,186 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 10:44:59,186 INFO L82 GeneralOperation]: Start isEquivalent. First operand 19 states. Second operand has 18 states, 10 states have (on average 1.3) internal successors, (13), 11 states have internal predecessors, (13), 5 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 10:44:59,187 INFO L74 IsIncluded]: Start isIncluded. First operand 19 states. Second operand has 18 states, 10 states have (on average 1.3) internal successors, (13), 11 states have internal predecessors, (13), 5 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 10:44:59,187 INFO L87 Difference]: Start difference. First operand 19 states. Second operand has 18 states, 10 states have (on average 1.3) internal successors, (13), 11 states have internal predecessors, (13), 5 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 10:44:59,190 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 10:44:59,190 INFO L93 Difference]: Finished difference Result 19 states and 22 transitions. [2022-04-15 10:44:59,190 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 22 transitions. [2022-04-15 10:44:59,190 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 10:44:59,191 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 10:44:59,191 INFO L74 IsIncluded]: Start isIncluded. First operand has 18 states, 10 states have (on average 1.3) internal successors, (13), 11 states have internal predecessors, (13), 5 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 19 states. [2022-04-15 10:44:59,191 INFO L87 Difference]: Start difference. First operand has 18 states, 10 states have (on average 1.3) internal successors, (13), 11 states have internal predecessors, (13), 5 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 19 states. [2022-04-15 10:44:59,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 10:44:59,194 INFO L93 Difference]: Finished difference Result 19 states and 22 transitions. [2022-04-15 10:44:59,194 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 22 transitions. [2022-04-15 10:44:59,194 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 10:44:59,194 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 10:44:59,194 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 10:44:59,194 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 10:44:59,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 10 states have (on average 1.3) internal successors, (13), 11 states have internal predecessors, (13), 5 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 10:44:59,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 21 transitions. [2022-04-15 10:44:59,197 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 21 transitions. Word has length 11 [2022-04-15 10:44:59,197 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 10:44:59,197 INFO L478 AbstractCegarLoop]: Abstraction has 18 states and 21 transitions. [2022-04-15 10:44:59,198 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 10:44:59,198 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 18 states and 21 transitions. [2022-04-15 10:44:59,222 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 21 edges. 21 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 10:44:59,222 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 21 transitions. [2022-04-15 10:44:59,225 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-04-15 10:44:59,225 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 10:44:59,225 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 10:44:59,225 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-15 10:44:59,225 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 10:44:59,226 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 10:44:59,226 INFO L85 PathProgramCache]: Analyzing trace with hash -2118701623, now seen corresponding path program 1 times [2022-04-15 10:44:59,226 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 10:44:59,226 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1003208277] [2022-04-15 10:44:59,227 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 10:44:59,227 INFO L85 PathProgramCache]: Analyzing trace with hash -2118701623, now seen corresponding path program 2 times [2022-04-15 10:44:59,227 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 10:44:59,227 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [112227454] [2022-04-15 10:44:59,227 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 10:44:59,228 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 10:44:59,242 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 10:44:59,243 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1546588236] [2022-04-15 10:44:59,243 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 10:44:59,243 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 10:44:59,243 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 10:44:59,251 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-15 10:44:59,251 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-15 10:44:59,287 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-04-15 10:44:59,287 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 10:44:59,289 INFO L263 TraceCheckSpWp]: Trace formula consists of 71 conjuncts, 5 conjunts are in the unsatisfiable core [2022-04-15 10:44:59,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 10:44:59,302 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 10:44:59,443 INFO L272 TraceCheckUtils]: 0: Hoare triple {190#true} call ULTIMATE.init(); {190#true} is VALID [2022-04-15 10:44:59,444 INFO L290 TraceCheckUtils]: 1: Hoare triple {190#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; {198#(<= ~counter~0 0)} is VALID [2022-04-15 10:44:59,445 INFO L290 TraceCheckUtils]: 2: Hoare triple {198#(<= ~counter~0 0)} assume true; {198#(<= ~counter~0 0)} is VALID [2022-04-15 10:44:59,445 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {198#(<= ~counter~0 0)} {190#true} #57#return; {198#(<= ~counter~0 0)} is VALID [2022-04-15 10:44:59,446 INFO L272 TraceCheckUtils]: 4: Hoare triple {198#(<= ~counter~0 0)} call #t~ret6 := main(); {198#(<= ~counter~0 0)} is VALID [2022-04-15 10:44:59,446 INFO L290 TraceCheckUtils]: 5: Hoare triple {198#(<= ~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;~y~0 := 0;~x~0 := 0;~c~0 := 0; {198#(<= ~counter~0 0)} is VALID [2022-04-15 10:44:59,448 INFO L290 TraceCheckUtils]: 6: Hoare triple {198#(<= ~counter~0 0)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {214#(<= |main_#t~post5| 0)} is VALID [2022-04-15 10:44:59,449 INFO L290 TraceCheckUtils]: 7: Hoare triple {214#(<= |main_#t~post5| 0)} assume !(#t~post5 < 20);havoc #t~post5; {191#false} is VALID [2022-04-15 10:44:59,449 INFO L272 TraceCheckUtils]: 8: Hoare triple {191#false} call __VERIFIER_assert((if 0 == ~k~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {191#false} is VALID [2022-04-15 10:44:59,449 INFO L290 TraceCheckUtils]: 9: Hoare triple {191#false} ~cond := #in~cond; {191#false} is VALID [2022-04-15 10:44:59,449 INFO L290 TraceCheckUtils]: 10: Hoare triple {191#false} assume 0 == ~cond; {191#false} is VALID [2022-04-15 10:44:59,449 INFO L290 TraceCheckUtils]: 11: Hoare triple {191#false} assume !false; {191#false} is VALID [2022-04-15 10:44:59,450 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-15 10:44:59,450 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-15 10:44:59,450 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 10:44:59,450 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [112227454] [2022-04-15 10:44:59,450 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 10:44:59,450 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1546588236] [2022-04-15 10:44:59,451 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1546588236] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 10:44:59,451 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 10:44:59,451 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 10:44:59,452 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 10:44:59,452 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1003208277] [2022-04-15 10:44:59,452 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1003208277] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 10:44:59,452 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 10:44:59,452 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 10:44:59,452 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1045369460] [2022-04-15 10:44:59,452 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 10:44:59,453 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2022-04-15 10:44:59,453 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 10:44:59,453 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 10:44:59,463 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 12 edges. 12 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 10:44:59,463 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-15 10:44:59,463 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 10:44:59,464 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-15 10:44:59,464 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-15 10:44:59,464 INFO L87 Difference]: Start difference. First operand 18 states and 21 transitions. Second operand has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 10:44:59,518 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 10:44:59,518 INFO L93 Difference]: Finished difference Result 28 states and 32 transitions. [2022-04-15 10:44:59,518 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-15 10:44:59,518 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2022-04-15 10:44:59,518 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 10:44:59,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 10:44:59,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 32 transitions. [2022-04-15 10:44:59,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 10:44:59,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 32 transitions. [2022-04-15 10:44:59,522 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 32 transitions. [2022-04-15 10:44:59,544 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 32 edges. 32 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 10:44:59,544 INFO L225 Difference]: With dead ends: 28 [2022-04-15 10:44:59,545 INFO L226 Difference]: Without dead ends: 20 [2022-04-15 10:44:59,545 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 9 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-15 10:44:59,546 INFO L913 BasicCegarLoop]: 19 mSDtfsCounter, 0 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 51 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-15 10:44:59,546 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 51 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 10:44:59,547 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2022-04-15 10:44:59,552 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2022-04-15 10:44:59,552 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 10:44:59,553 INFO L82 GeneralOperation]: Start isEquivalent. First operand 20 states. Second operand has 20 states, 12 states have (on average 1.25) internal successors, (15), 13 states have internal predecessors, (15), 5 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 10:44:59,553 INFO L74 IsIncluded]: Start isIncluded. First operand 20 states. Second operand has 20 states, 12 states have (on average 1.25) internal successors, (15), 13 states have internal predecessors, (15), 5 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 10:44:59,553 INFO L87 Difference]: Start difference. First operand 20 states. Second operand has 20 states, 12 states have (on average 1.25) internal successors, (15), 13 states have internal predecessors, (15), 5 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 10:44:59,554 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 10:44:59,554 INFO L93 Difference]: Finished difference Result 20 states and 23 transitions. [2022-04-15 10:44:59,555 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 23 transitions. [2022-04-15 10:44:59,555 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 10:44:59,555 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 10:44:59,555 INFO L74 IsIncluded]: Start isIncluded. First operand has 20 states, 12 states have (on average 1.25) internal successors, (15), 13 states have internal predecessors, (15), 5 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 20 states. [2022-04-15 10:44:59,556 INFO L87 Difference]: Start difference. First operand has 20 states, 12 states have (on average 1.25) internal successors, (15), 13 states have internal predecessors, (15), 5 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 20 states. [2022-04-15 10:44:59,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 10:44:59,557 INFO L93 Difference]: Finished difference Result 20 states and 23 transitions. [2022-04-15 10:44:59,557 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 23 transitions. [2022-04-15 10:44:59,557 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 10:44:59,557 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 10:44:59,557 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 10:44:59,558 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 10:44:59,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 12 states have (on average 1.25) internal successors, (15), 13 states have internal predecessors, (15), 5 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 10:44:59,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 23 transitions. [2022-04-15 10:44:59,559 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 23 transitions. Word has length 12 [2022-04-15 10:44:59,559 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 10:44:59,559 INFO L478 AbstractCegarLoop]: Abstraction has 20 states and 23 transitions. [2022-04-15 10:44:59,559 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 10:44:59,559 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 20 states and 23 transitions. [2022-04-15 10:44:59,578 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 23 edges. 23 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 10:44:59,578 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 23 transitions. [2022-04-15 10:44:59,578 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-04-15 10:44:59,578 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 10:44:59,578 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 10:44:59,595 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-15 10:44:59,791 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-15 10:44:59,791 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 10:44:59,792 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 10:44:59,792 INFO L85 PathProgramCache]: Analyzing trace with hash -2116914163, now seen corresponding path program 1 times [2022-04-15 10:44:59,792 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 10:44:59,792 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1087649908] [2022-04-15 10:44:59,793 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 10:44:59,793 INFO L85 PathProgramCache]: Analyzing trace with hash -2116914163, now seen corresponding path program 2 times [2022-04-15 10:44:59,794 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 10:44:59,794 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1922421213] [2022-04-15 10:44:59,794 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 10:44:59,794 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 10:44:59,805 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 10:44:59,805 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [943932174] [2022-04-15 10:44:59,805 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 10:44:59,805 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 10:44:59,806 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 10:44:59,806 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-15 10:44:59,807 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-15 10:44:59,836 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-04-15 10:44:59,836 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 10:44:59,837 INFO L263 TraceCheckSpWp]: Trace formula consists of 71 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-15 10:44:59,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 10:44:59,844 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 10:44:59,923 INFO L272 TraceCheckUtils]: 0: Hoare triple {365#true} call ULTIMATE.init(); {365#true} is VALID [2022-04-15 10:44:59,923 INFO L290 TraceCheckUtils]: 1: Hoare triple {365#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; {365#true} is VALID [2022-04-15 10:44:59,924 INFO L290 TraceCheckUtils]: 2: Hoare triple {365#true} assume true; {365#true} is VALID [2022-04-15 10:44:59,924 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {365#true} {365#true} #57#return; {365#true} is VALID [2022-04-15 10:44:59,924 INFO L272 TraceCheckUtils]: 4: Hoare triple {365#true} call #t~ret6 := main(); {365#true} is VALID [2022-04-15 10:44:59,925 INFO L290 TraceCheckUtils]: 5: Hoare triple {365#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;~y~0 := 0;~x~0 := 0;~c~0 := 0; {385#(and (= main_~x~0 0) (= main_~y~0 0))} is VALID [2022-04-15 10:44:59,925 INFO L290 TraceCheckUtils]: 6: Hoare triple {385#(and (= main_~x~0 0) (= main_~y~0 0))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {385#(and (= main_~x~0 0) (= main_~y~0 0))} is VALID [2022-04-15 10:44:59,925 INFO L290 TraceCheckUtils]: 7: Hoare triple {385#(and (= main_~x~0 0) (= main_~y~0 0))} assume !!(#t~post5 < 20);havoc #t~post5; {385#(and (= main_~x~0 0) (= main_~y~0 0))} is VALID [2022-04-15 10:44:59,926 INFO L272 TraceCheckUtils]: 8: Hoare triple {385#(and (= main_~x~0 0) (= main_~y~0 0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {395#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 10:44:59,927 INFO L290 TraceCheckUtils]: 9: Hoare triple {395#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {399#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 10:44:59,927 INFO L290 TraceCheckUtils]: 10: Hoare triple {399#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {366#false} is VALID [2022-04-15 10:44:59,928 INFO L290 TraceCheckUtils]: 11: Hoare triple {366#false} assume !false; {366#false} is VALID [2022-04-15 10:44:59,928 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-15 10:44:59,928 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-15 10:44:59,928 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 10:44:59,928 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1922421213] [2022-04-15 10:44:59,928 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 10:44:59,928 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [943932174] [2022-04-15 10:44:59,928 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [943932174] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 10:44:59,929 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 10:44:59,929 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 10:44:59,929 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 10:44:59,929 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1087649908] [2022-04-15 10:44:59,929 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1087649908] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 10:44:59,929 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 10:44:59,929 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 10:44:59,929 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1104372739] [2022-04-15 10:44:59,929 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 10:44:59,930 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2022-04-15 10:44:59,930 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 10:44:59,930 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 10:44:59,939 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 12 edges. 12 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 10:44:59,939 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-15 10:44:59,939 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 10:44:59,939 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-15 10:44:59,939 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-15 10:44:59,940 INFO L87 Difference]: Start difference. First operand 20 states and 23 transitions. Second operand has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 10:45:00,036 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 10:45:00,036 INFO L93 Difference]: Finished difference Result 30 states and 35 transitions. [2022-04-15 10:45:00,036 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-15 10:45:00,037 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2022-04-15 10:45:00,037 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 10:45:00,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 10:45:00,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 35 transitions. [2022-04-15 10:45:00,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 10:45:00,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 35 transitions. [2022-04-15 10:45:00,039 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 35 transitions. [2022-04-15 10:45:00,063 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-15 10:45:00,064 INFO L225 Difference]: With dead ends: 30 [2022-04-15 10:45:00,064 INFO L226 Difference]: Without dead ends: 26 [2022-04-15 10:45:00,065 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 8 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-15 10:45:00,065 INFO L913 BasicCegarLoop]: 19 mSDtfsCounter, 6 mSDsluCounter, 45 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 64 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 10:45:00,066 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [8 Valid, 64 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 10:45:00,066 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2022-04-15 10:45:00,076 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2022-04-15 10:45:00,076 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 10:45:00,076 INFO L82 GeneralOperation]: Start isEquivalent. First operand 26 states. Second operand has 26 states, 16 states have (on average 1.1875) internal successors, (19), 17 states have internal predecessors, (19), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-15 10:45:00,076 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-15 10:45:00,076 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-15 10:45:00,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 10:45:00,077 INFO L93 Difference]: Finished difference Result 26 states and 29 transitions. [2022-04-15 10:45:00,078 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 29 transitions. [2022-04-15 10:45:00,078 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 10:45:00,078 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 10:45:00,078 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-15 10:45:00,078 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-15 10:45:00,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 10:45:00,080 INFO L93 Difference]: Finished difference Result 26 states and 29 transitions. [2022-04-15 10:45:00,080 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 29 transitions. [2022-04-15 10:45:00,080 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 10:45:00,080 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 10:45:00,080 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 10:45:00,080 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 10:45:00,080 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-15 10:45:00,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 29 transitions. [2022-04-15 10:45:00,081 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 29 transitions. Word has length 12 [2022-04-15 10:45:00,082 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 10:45:00,082 INFO L478 AbstractCegarLoop]: Abstraction has 26 states and 29 transitions. [2022-04-15 10:45:00,082 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 10:45:00,082 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 26 states and 29 transitions. [2022-04-15 10:45:00,107 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-15 10:45:00,107 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 29 transitions. [2022-04-15 10:45:00,107 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-04-15 10:45:00,107 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 10:45:00,107 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 10:45:00,139 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-15 10:45:00,322 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-15 10:45:00,323 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 10:45:00,323 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 10:45:00,323 INFO L85 PathProgramCache]: Analyzing trace with hash -263585780, now seen corresponding path program 1 times [2022-04-15 10:45:00,323 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 10:45:00,323 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1075579676] [2022-04-15 10:45:00,461 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 4 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 10:45:00,461 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONLINEAR_UPDATE [2022-04-15 10:45:00,461 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 10:45:00,461 INFO L85 PathProgramCache]: Analyzing trace with hash -263585780, now seen corresponding path program 2 times [2022-04-15 10:45:00,461 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 10:45:00,461 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2125636893] [2022-04-15 10:45:00,461 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 10:45:00,461 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 10:45:00,470 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 10:45:00,471 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1092323223] [2022-04-15 10:45:00,471 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 10:45:00,471 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 10:45:00,471 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 10:45:00,472 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-15 10:45:00,473 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-15 10:45:00,513 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-15 10:45:00,514 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 10:45:00,514 INFO L263 TraceCheckSpWp]: Trace formula consists of 92 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-15 10:45:00,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 10:45:00,521 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 10:45:00,629 INFO L272 TraceCheckUtils]: 0: Hoare triple {571#true} call ULTIMATE.init(); {571#true} is VALID [2022-04-15 10:45:00,630 INFO L290 TraceCheckUtils]: 1: Hoare triple {571#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; {579#(<= ~counter~0 0)} is VALID [2022-04-15 10:45:00,630 INFO L290 TraceCheckUtils]: 2: Hoare triple {579#(<= ~counter~0 0)} assume true; {579#(<= ~counter~0 0)} is VALID [2022-04-15 10:45:00,631 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {579#(<= ~counter~0 0)} {571#true} #57#return; {579#(<= ~counter~0 0)} is VALID [2022-04-15 10:45:00,632 INFO L272 TraceCheckUtils]: 4: Hoare triple {579#(<= ~counter~0 0)} call #t~ret6 := main(); {579#(<= ~counter~0 0)} is VALID [2022-04-15 10:45:00,633 INFO L290 TraceCheckUtils]: 5: Hoare triple {579#(<= ~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;~y~0 := 0;~x~0 := 0;~c~0 := 0; {579#(<= ~counter~0 0)} is VALID [2022-04-15 10:45:00,635 INFO L290 TraceCheckUtils]: 6: Hoare triple {579#(<= ~counter~0 0)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {595#(<= ~counter~0 1)} is VALID [2022-04-15 10:45:00,636 INFO L290 TraceCheckUtils]: 7: Hoare triple {595#(<= ~counter~0 1)} assume !!(#t~post5 < 20);havoc #t~post5; {595#(<= ~counter~0 1)} is VALID [2022-04-15 10:45:00,636 INFO L272 TraceCheckUtils]: 8: Hoare triple {595#(<= ~counter~0 1)} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {595#(<= ~counter~0 1)} is VALID [2022-04-15 10:45:00,637 INFO L290 TraceCheckUtils]: 9: Hoare triple {595#(<= ~counter~0 1)} ~cond := #in~cond; {595#(<= ~counter~0 1)} is VALID [2022-04-15 10:45:00,639 INFO L290 TraceCheckUtils]: 10: Hoare triple {595#(<= ~counter~0 1)} assume !(0 == ~cond); {595#(<= ~counter~0 1)} is VALID [2022-04-15 10:45:00,640 INFO L290 TraceCheckUtils]: 11: Hoare triple {595#(<= ~counter~0 1)} assume true; {595#(<= ~counter~0 1)} is VALID [2022-04-15 10:45:00,641 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {595#(<= ~counter~0 1)} {595#(<= ~counter~0 1)} #51#return; {595#(<= ~counter~0 1)} is VALID [2022-04-15 10:45:00,641 INFO L290 TraceCheckUtils]: 13: Hoare triple {595#(<= ~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 + ~x~0; {595#(<= ~counter~0 1)} is VALID [2022-04-15 10:45:00,642 INFO L290 TraceCheckUtils]: 14: Hoare triple {595#(<= ~counter~0 1)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {620#(<= |main_#t~post5| 1)} is VALID [2022-04-15 10:45:00,642 INFO L290 TraceCheckUtils]: 15: Hoare triple {620#(<= |main_#t~post5| 1)} assume !(#t~post5 < 20);havoc #t~post5; {572#false} is VALID [2022-04-15 10:45:00,642 INFO L272 TraceCheckUtils]: 16: Hoare triple {572#false} call __VERIFIER_assert((if 0 == ~k~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {572#false} is VALID [2022-04-15 10:45:00,644 INFO L290 TraceCheckUtils]: 17: Hoare triple {572#false} ~cond := #in~cond; {572#false} is VALID [2022-04-15 10:45:00,644 INFO L290 TraceCheckUtils]: 18: Hoare triple {572#false} assume 0 == ~cond; {572#false} is VALID [2022-04-15 10:45:00,644 INFO L290 TraceCheckUtils]: 19: Hoare triple {572#false} assume !false; {572#false} is VALID [2022-04-15 10:45:00,645 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-15 10:45:00,645 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 10:45:00,790 INFO L290 TraceCheckUtils]: 19: Hoare triple {572#false} assume !false; {572#false} is VALID [2022-04-15 10:45:00,790 INFO L290 TraceCheckUtils]: 18: Hoare triple {572#false} assume 0 == ~cond; {572#false} is VALID [2022-04-15 10:45:00,790 INFO L290 TraceCheckUtils]: 17: Hoare triple {572#false} ~cond := #in~cond; {572#false} is VALID [2022-04-15 10:45:00,790 INFO L272 TraceCheckUtils]: 16: Hoare triple {572#false} call __VERIFIER_assert((if 0 == ~k~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {572#false} is VALID [2022-04-15 10:45:00,791 INFO L290 TraceCheckUtils]: 15: Hoare triple {648#(< |main_#t~post5| 20)} assume !(#t~post5 < 20);havoc #t~post5; {572#false} is VALID [2022-04-15 10:45:00,791 INFO L290 TraceCheckUtils]: 14: Hoare triple {652#(< ~counter~0 20)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {648#(< |main_#t~post5| 20)} is VALID [2022-04-15 10:45:00,791 INFO L290 TraceCheckUtils]: 13: Hoare triple {652#(< ~counter~0 20)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {652#(< ~counter~0 20)} is VALID [2022-04-15 10:45:00,792 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {571#true} {652#(< ~counter~0 20)} #51#return; {652#(< ~counter~0 20)} is VALID [2022-04-15 10:45:00,792 INFO L290 TraceCheckUtils]: 11: Hoare triple {571#true} assume true; {571#true} is VALID [2022-04-15 10:45:00,792 INFO L290 TraceCheckUtils]: 10: Hoare triple {571#true} assume !(0 == ~cond); {571#true} is VALID [2022-04-15 10:45:00,792 INFO L290 TraceCheckUtils]: 9: Hoare triple {571#true} ~cond := #in~cond; {571#true} is VALID [2022-04-15 10:45:00,792 INFO L272 TraceCheckUtils]: 8: Hoare triple {652#(< ~counter~0 20)} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {571#true} is VALID [2022-04-15 10:45:00,793 INFO L290 TraceCheckUtils]: 7: Hoare triple {652#(< ~counter~0 20)} assume !!(#t~post5 < 20);havoc #t~post5; {652#(< ~counter~0 20)} is VALID [2022-04-15 10:45:00,794 INFO L290 TraceCheckUtils]: 6: Hoare triple {677#(< ~counter~0 19)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {652#(< ~counter~0 20)} is VALID [2022-04-15 10:45:00,794 INFO L290 TraceCheckUtils]: 5: Hoare triple {677#(< ~counter~0 19)} 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;~y~0 := 0;~x~0 := 0;~c~0 := 0; {677#(< ~counter~0 19)} is VALID [2022-04-15 10:45:00,794 INFO L272 TraceCheckUtils]: 4: Hoare triple {677#(< ~counter~0 19)} call #t~ret6 := main(); {677#(< ~counter~0 19)} is VALID [2022-04-15 10:45:00,795 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {677#(< ~counter~0 19)} {571#true} #57#return; {677#(< ~counter~0 19)} is VALID [2022-04-15 10:45:00,795 INFO L290 TraceCheckUtils]: 2: Hoare triple {677#(< ~counter~0 19)} assume true; {677#(< ~counter~0 19)} is VALID [2022-04-15 10:45:00,796 INFO L290 TraceCheckUtils]: 1: Hoare triple {571#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; {677#(< ~counter~0 19)} is VALID [2022-04-15 10:45:00,796 INFO L272 TraceCheckUtils]: 0: Hoare triple {571#true} call ULTIMATE.init(); {571#true} is VALID [2022-04-15 10:45:00,796 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-15 10:45:00,796 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 10:45:00,796 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2125636893] [2022-04-15 10:45:00,796 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 10:45:00,796 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1092323223] [2022-04-15 10:45:00,797 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1092323223] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 10:45:00,797 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-15 10:45:00,797 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2022-04-15 10:45:00,797 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 10:45:00,797 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1075579676] [2022-04-15 10:45:00,797 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1075579676] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 10:45:00,797 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 10:45:00,797 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 10:45:00,797 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1248479925] [2022-04-15 10:45:00,797 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 10:45:00,798 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 4 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 20 [2022-04-15 10:45:00,798 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 10:45:00,798 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 4 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 10:45:00,810 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 20 edges. 20 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 10:45:00,810 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-15 10:45:00,810 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 10:45:00,811 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-15 10:45:00,811 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2022-04-15 10:45:00,811 INFO L87 Difference]: Start difference. First operand 26 states and 29 transitions. Second operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 4 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 10:45:00,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 10:45:00,881 INFO L93 Difference]: Finished difference Result 36 states and 40 transitions. [2022-04-15 10:45:00,881 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-15 10:45:00,881 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 4 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 20 [2022-04-15 10:45:00,882 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 10:45:00,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 4 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 10:45:00,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 40 transitions. [2022-04-15 10:45:00,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 4 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 10:45:00,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 40 transitions. [2022-04-15 10:45:00,890 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 40 transitions. [2022-04-15 10:45:00,914 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 40 edges. 40 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 10:45:00,915 INFO L225 Difference]: With dead ends: 36 [2022-04-15 10:45:00,915 INFO L226 Difference]: Without dead ends: 28 [2022-04-15 10:45:00,916 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 33 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-15 10:45:00,920 INFO L913 BasicCegarLoop]: 20 mSDtfsCounter, 2 mSDsluCounter, 46 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 66 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 10:45:00,920 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [2 Valid, 66 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 10:45:00,922 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2022-04-15 10:45:00,937 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2022-04-15 10:45:00,937 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 10:45:00,938 INFO L82 GeneralOperation]: Start isEquivalent. First operand 28 states. Second operand has 28 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 19 states have internal predecessors, (21), 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-15 10:45:00,939 INFO L74 IsIncluded]: Start isIncluded. First operand 28 states. Second operand has 28 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 19 states have internal predecessors, (21), 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-15 10:45:00,939 INFO L87 Difference]: Start difference. First operand 28 states. Second operand has 28 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 19 states have internal predecessors, (21), 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-15 10:45:00,947 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 10:45:00,947 INFO L93 Difference]: Finished difference Result 28 states and 31 transitions. [2022-04-15 10:45:00,947 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 31 transitions. [2022-04-15 10:45:00,948 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 10:45:00,948 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 10:45:00,948 INFO L74 IsIncluded]: Start isIncluded. First operand has 28 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 19 states have internal predecessors, (21), 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 28 states. [2022-04-15 10:45:00,948 INFO L87 Difference]: Start difference. First operand has 28 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 19 states have internal predecessors, (21), 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 28 states. [2022-04-15 10:45:00,955 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 10:45:00,955 INFO L93 Difference]: Finished difference Result 28 states and 31 transitions. [2022-04-15 10:45:00,956 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 31 transitions. [2022-04-15 10:45:00,956 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 10:45:00,956 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 10:45:00,956 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 10:45:00,956 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 10:45:00,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 19 states have internal predecessors, (21), 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-15 10:45:00,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 31 transitions. [2022-04-15 10:45:00,957 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 31 transitions. Word has length 20 [2022-04-15 10:45:00,957 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 10:45:00,957 INFO L478 AbstractCegarLoop]: Abstraction has 28 states and 31 transitions. [2022-04-15 10:45:00,957 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 4 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 10:45:00,958 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 28 states and 31 transitions. [2022-04-15 10:45:00,984 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-15 10:45:00,984 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 31 transitions. [2022-04-15 10:45:00,985 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-04-15 10:45:00,985 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 10:45:00,985 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 10:45:01,006 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-15 10:45:01,207 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-15 10:45:01,207 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 10:45:01,208 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 10:45:01,208 INFO L85 PathProgramCache]: Analyzing trace with hash -261798320, now seen corresponding path program 1 times [2022-04-15 10:45:01,208 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 10:45:01,208 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [980629147] [2022-04-15 10:45:01,294 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 4 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 10:45:01,295 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONLINEAR_UPDATE [2022-04-15 10:45:01,295 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 10:45:01,295 INFO L85 PathProgramCache]: Analyzing trace with hash -261798320, now seen corresponding path program 2 times [2022-04-15 10:45:01,295 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 10:45:01,295 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2079648921] [2022-04-15 10:45:01,295 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 10:45:01,295 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 10:45:01,303 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 10:45:01,303 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [163812021] [2022-04-15 10:45:01,303 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 10:45:01,303 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 10:45:01,303 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 10:45:01,320 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-15 10:45:01,322 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-15 10:45:01,357 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-15 10:45:01,358 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 10:45:01,358 INFO L263 TraceCheckSpWp]: Trace formula consists of 92 conjuncts, 11 conjunts are in the unsatisfiable core [2022-04-15 10:45:01,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 10:45:01,367 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 10:45:01,448 INFO L272 TraceCheckUtils]: 0: Hoare triple {884#true} call ULTIMATE.init(); {884#true} is VALID [2022-04-15 10:45:01,449 INFO L290 TraceCheckUtils]: 1: Hoare triple {884#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; {884#true} is VALID [2022-04-15 10:45:01,449 INFO L290 TraceCheckUtils]: 2: Hoare triple {884#true} assume true; {884#true} is VALID [2022-04-15 10:45:01,449 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {884#true} {884#true} #57#return; {884#true} is VALID [2022-04-15 10:45:01,449 INFO L272 TraceCheckUtils]: 4: Hoare triple {884#true} call #t~ret6 := main(); {884#true} is VALID [2022-04-15 10:45:01,449 INFO L290 TraceCheckUtils]: 5: Hoare triple {884#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;~y~0 := 0;~x~0 := 0;~c~0 := 0; {904#(and (= main_~x~0 0) (= main_~y~0 0))} is VALID [2022-04-15 10:45:01,450 INFO L290 TraceCheckUtils]: 6: Hoare triple {904#(and (= main_~x~0 0) (= main_~y~0 0))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {904#(and (= main_~x~0 0) (= main_~y~0 0))} is VALID [2022-04-15 10:45:01,450 INFO L290 TraceCheckUtils]: 7: Hoare triple {904#(and (= main_~x~0 0) (= main_~y~0 0))} assume !!(#t~post5 < 20);havoc #t~post5; {904#(and (= main_~x~0 0) (= main_~y~0 0))} is VALID [2022-04-15 10:45:01,450 INFO L272 TraceCheckUtils]: 8: Hoare triple {904#(and (= main_~x~0 0) (= main_~y~0 0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {884#true} is VALID [2022-04-15 10:45:01,450 INFO L290 TraceCheckUtils]: 9: Hoare triple {884#true} ~cond := #in~cond; {884#true} is VALID [2022-04-15 10:45:01,450 INFO L290 TraceCheckUtils]: 10: Hoare triple {884#true} assume !(0 == ~cond); {884#true} is VALID [2022-04-15 10:45:01,451 INFO L290 TraceCheckUtils]: 11: Hoare triple {884#true} assume true; {884#true} is VALID [2022-04-15 10:45:01,452 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {884#true} {904#(and (= main_~x~0 0) (= main_~y~0 0))} #51#return; {904#(and (= main_~x~0 0) (= main_~y~0 0))} is VALID [2022-04-15 10:45:01,452 INFO L290 TraceCheckUtils]: 13: Hoare triple {904#(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 + ~x~0; {929#(and (= (+ (- 1) main_~y~0) 0) (= (* main_~y~0 (* main_~y~0 main_~y~0)) main_~x~0))} is VALID [2022-04-15 10:45:01,452 INFO L290 TraceCheckUtils]: 14: Hoare triple {929#(and (= (+ (- 1) main_~y~0) 0) (= (* main_~y~0 (* main_~y~0 main_~y~0)) main_~x~0))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {929#(and (= (+ (- 1) main_~y~0) 0) (= (* main_~y~0 (* main_~y~0 main_~y~0)) main_~x~0))} is VALID [2022-04-15 10:45:01,453 INFO L290 TraceCheckUtils]: 15: Hoare triple {929#(and (= (+ (- 1) main_~y~0) 0) (= (* main_~y~0 (* main_~y~0 main_~y~0)) main_~x~0))} assume !!(#t~post5 < 20);havoc #t~post5; {929#(and (= (+ (- 1) main_~y~0) 0) (= (* main_~y~0 (* main_~y~0 main_~y~0)) main_~x~0))} is VALID [2022-04-15 10:45:01,453 INFO L272 TraceCheckUtils]: 16: Hoare triple {929#(and (= (+ (- 1) main_~y~0) 0) (= (* main_~y~0 (* main_~y~0 main_~y~0)) main_~x~0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {939#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 10:45:01,454 INFO L290 TraceCheckUtils]: 17: Hoare triple {939#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {943#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 10:45:01,454 INFO L290 TraceCheckUtils]: 18: Hoare triple {943#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {885#false} is VALID [2022-04-15 10:45:01,454 INFO L290 TraceCheckUtils]: 19: Hoare triple {885#false} assume !false; {885#false} is VALID [2022-04-15 10:45:01,454 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-15 10:45:01,454 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 10:46:35,451 INFO L290 TraceCheckUtils]: 19: Hoare triple {885#false} assume !false; {885#false} is VALID [2022-04-15 10:46:35,452 INFO L290 TraceCheckUtils]: 18: Hoare triple {943#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {885#false} is VALID [2022-04-15 10:46:35,452 INFO L290 TraceCheckUtils]: 17: Hoare triple {939#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {943#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 10:46:35,453 INFO L272 TraceCheckUtils]: 16: Hoare triple {959#(= (+ (* main_~y~0 main_~y~0 main_~y~0 main_~y~0) (* main_~y~0 main_~y~0) (* (* main_~y~0 main_~y~0 main_~y~0) 2)) (* main_~x~0 4))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {939#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 10:46:35,453 INFO L290 TraceCheckUtils]: 15: Hoare triple {959#(= (+ (* main_~y~0 main_~y~0 main_~y~0 main_~y~0) (* main_~y~0 main_~y~0) (* (* main_~y~0 main_~y~0 main_~y~0) 2)) (* main_~x~0 4))} assume !!(#t~post5 < 20);havoc #t~post5; {959#(= (+ (* main_~y~0 main_~y~0 main_~y~0 main_~y~0) (* main_~y~0 main_~y~0) (* (* main_~y~0 main_~y~0 main_~y~0) 2)) (* main_~x~0 4))} is VALID [2022-04-15 10:46:35,454 INFO L290 TraceCheckUtils]: 14: Hoare triple {959#(= (+ (* main_~y~0 main_~y~0 main_~y~0 main_~y~0) (* main_~y~0 main_~y~0) (* (* main_~y~0 main_~y~0 main_~y~0) 2)) (* main_~x~0 4))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {959#(= (+ (* main_~y~0 main_~y~0 main_~y~0 main_~y~0) (* main_~y~0 main_~y~0) (* (* main_~y~0 main_~y~0 main_~y~0) 2)) (* main_~x~0 4))} is VALID [2022-04-15 10:46:35,474 INFO L290 TraceCheckUtils]: 13: Hoare triple {959#(= (+ (* main_~y~0 main_~y~0 main_~y~0 main_~y~0) (* main_~y~0 main_~y~0) (* (* main_~y~0 main_~y~0 main_~y~0) 2)) (* main_~x~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 + ~x~0; {959#(= (+ (* main_~y~0 main_~y~0 main_~y~0 main_~y~0) (* main_~y~0 main_~y~0) (* (* main_~y~0 main_~y~0 main_~y~0) 2)) (* main_~x~0 4))} is VALID [2022-04-15 10:46:35,474 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {884#true} {959#(= (+ (* main_~y~0 main_~y~0 main_~y~0 main_~y~0) (* main_~y~0 main_~y~0) (* (* main_~y~0 main_~y~0 main_~y~0) 2)) (* main_~x~0 4))} #51#return; {959#(= (+ (* main_~y~0 main_~y~0 main_~y~0 main_~y~0) (* main_~y~0 main_~y~0) (* (* main_~y~0 main_~y~0 main_~y~0) 2)) (* main_~x~0 4))} is VALID [2022-04-15 10:46:35,474 INFO L290 TraceCheckUtils]: 11: Hoare triple {884#true} assume true; {884#true} is VALID [2022-04-15 10:46:35,474 INFO L290 TraceCheckUtils]: 10: Hoare triple {884#true} assume !(0 == ~cond); {884#true} is VALID [2022-04-15 10:46:35,474 INFO L290 TraceCheckUtils]: 9: Hoare triple {884#true} ~cond := #in~cond; {884#true} is VALID [2022-04-15 10:46:35,475 INFO L272 TraceCheckUtils]: 8: Hoare triple {959#(= (+ (* main_~y~0 main_~y~0 main_~y~0 main_~y~0) (* main_~y~0 main_~y~0) (* (* main_~y~0 main_~y~0 main_~y~0) 2)) (* main_~x~0 4))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {884#true} is VALID [2022-04-15 10:46:35,475 INFO L290 TraceCheckUtils]: 7: Hoare triple {959#(= (+ (* main_~y~0 main_~y~0 main_~y~0 main_~y~0) (* main_~y~0 main_~y~0) (* (* main_~y~0 main_~y~0 main_~y~0) 2)) (* main_~x~0 4))} assume !!(#t~post5 < 20);havoc #t~post5; {959#(= (+ (* main_~y~0 main_~y~0 main_~y~0 main_~y~0) (* main_~y~0 main_~y~0) (* (* main_~y~0 main_~y~0 main_~y~0) 2)) (* main_~x~0 4))} is VALID [2022-04-15 10:46:35,476 INFO L290 TraceCheckUtils]: 6: Hoare triple {959#(= (+ (* main_~y~0 main_~y~0 main_~y~0 main_~y~0) (* main_~y~0 main_~y~0) (* (* main_~y~0 main_~y~0 main_~y~0) 2)) (* main_~x~0 4))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {959#(= (+ (* main_~y~0 main_~y~0 main_~y~0 main_~y~0) (* main_~y~0 main_~y~0) (* (* main_~y~0 main_~y~0 main_~y~0) 2)) (* main_~x~0 4))} is VALID [2022-04-15 10:46:35,476 INFO L290 TraceCheckUtils]: 5: Hoare triple {884#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;~y~0 := 0;~x~0 := 0;~c~0 := 0; {959#(= (+ (* main_~y~0 main_~y~0 main_~y~0 main_~y~0) (* main_~y~0 main_~y~0) (* (* main_~y~0 main_~y~0 main_~y~0) 2)) (* main_~x~0 4))} is VALID [2022-04-15 10:46:35,476 INFO L272 TraceCheckUtils]: 4: Hoare triple {884#true} call #t~ret6 := main(); {884#true} is VALID [2022-04-15 10:46:35,476 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {884#true} {884#true} #57#return; {884#true} is VALID [2022-04-15 10:46:35,476 INFO L290 TraceCheckUtils]: 2: Hoare triple {884#true} assume true; {884#true} is VALID [2022-04-15 10:46:35,477 INFO L290 TraceCheckUtils]: 1: Hoare triple {884#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; {884#true} is VALID [2022-04-15 10:46:35,477 INFO L272 TraceCheckUtils]: 0: Hoare triple {884#true} call ULTIMATE.init(); {884#true} is VALID [2022-04-15 10:46:35,477 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-15 10:46:35,477 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 10:46:35,477 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2079648921] [2022-04-15 10:46:35,477 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 10:46:35,477 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [163812021] [2022-04-15 10:46:35,477 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [163812021] provided 1 perfect and 1 imperfect interpolant sequences [2022-04-15 10:46:35,477 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-04-15 10:46:35,478 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 7 [2022-04-15 10:46:35,478 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 10:46:35,478 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [980629147] [2022-04-15 10:46:35,478 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [980629147] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 10:46:35,478 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 10:46:35,478 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 10:46:35,478 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1851119233] [2022-04-15 10:46:35,478 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 10:46:35,478 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), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 20 [2022-04-15 10:46:35,479 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 10:46:35,479 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), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 10:46:35,935 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-15 10:46:35,935 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-15 10:46:35,935 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 10:46:35,936 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-15 10:46:35,936 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-04-15 10:46:35,936 INFO L87 Difference]: Start difference. First operand 28 states and 31 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), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 10:46:36,017 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 10:46:36,018 INFO L93 Difference]: Finished difference Result 34 states and 36 transitions. [2022-04-15 10:46:36,018 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-15 10:46:36,018 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), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 20 [2022-04-15 10:46:36,018 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 10:46:36,018 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), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 10:46:36,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 26 transitions. [2022-04-15 10:46:36,019 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), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 10:46:36,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 26 transitions. [2022-04-15 10:46:36,020 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 26 transitions. [2022-04-15 10:46:36,482 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-15 10:46:36,483 INFO L225 Difference]: With dead ends: 34 [2022-04-15 10:46:36,483 INFO L226 Difference]: Without dead ends: 29 [2022-04-15 10:46:36,483 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 32 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 93.9s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-04-15 10:46:36,484 INFO L913 BasicCegarLoop]: 17 mSDtfsCounter, 7 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 53 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 10:46:36,484 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [8 Valid, 53 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 10:46:36,484 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2022-04-15 10:46:36,499 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2022-04-15 10:46:36,499 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 10:46:36,500 INFO L82 GeneralOperation]: Start isEquivalent. First operand 29 states. Second operand has 29 states, 20 states have (on average 1.1) internal successors, (22), 20 states have internal predecessors, (22), 5 states have call successors, (5), 5 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 10:46:36,500 INFO L74 IsIncluded]: Start isIncluded. First operand 29 states. Second operand has 29 states, 20 states have (on average 1.1) internal successors, (22), 20 states have internal predecessors, (22), 5 states have call successors, (5), 5 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 10:46:36,500 INFO L87 Difference]: Start difference. First operand 29 states. Second operand has 29 states, 20 states have (on average 1.1) internal successors, (22), 20 states have internal predecessors, (22), 5 states have call successors, (5), 5 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 10:46:36,503 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 10:46:36,503 INFO L93 Difference]: Finished difference Result 29 states and 30 transitions. [2022-04-15 10:46:36,504 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 30 transitions. [2022-04-15 10:46:36,506 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 10:46:36,506 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 10:46:36,506 INFO L74 IsIncluded]: Start isIncluded. First operand has 29 states, 20 states have (on average 1.1) internal successors, (22), 20 states have internal predecessors, (22), 5 states have call successors, (5), 5 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 29 states. [2022-04-15 10:46:36,506 INFO L87 Difference]: Start difference. First operand has 29 states, 20 states have (on average 1.1) internal successors, (22), 20 states have internal predecessors, (22), 5 states have call successors, (5), 5 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 29 states. [2022-04-15 10:46:36,507 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 10:46:36,507 INFO L93 Difference]: Finished difference Result 29 states and 30 transitions. [2022-04-15 10:46:36,507 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 30 transitions. [2022-04-15 10:46:36,507 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 10:46:36,507 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 10:46:36,507 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 10:46:36,507 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 10:46:36,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 20 states have (on average 1.1) internal successors, (22), 20 states have internal predecessors, (22), 5 states have call successors, (5), 5 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 10:46:36,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 30 transitions. [2022-04-15 10:46:36,508 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 30 transitions. Word has length 20 [2022-04-15 10:46:36,509 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 10:46:36,509 INFO L478 AbstractCegarLoop]: Abstraction has 29 states and 30 transitions. [2022-04-15 10:46:36,509 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), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 10:46:36,509 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 29 states and 30 transitions. [2022-04-15 10:46:36,982 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 30 edges. 30 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 10:46:36,983 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 30 transitions. [2022-04-15 10:46:36,983 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-04-15 10:46:36,983 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 10:46:36,983 INFO L499 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 10:46:37,000 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-15 10:46:37,183 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-15 10:46:37,184 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 10:46:37,184 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 10:46:37,184 INFO L85 PathProgramCache]: Analyzing trace with hash 891414954, now seen corresponding path program 1 times [2022-04-15 10:46:37,184 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 10:46:37,184 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1435916572] [2022-04-15 10:46:37,307 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 4 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 10:46:37,307 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONLINEAR_UPDATE [2022-04-15 10:46:37,307 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 10:46:37,307 INFO L85 PathProgramCache]: Analyzing trace with hash 891414954, now seen corresponding path program 2 times [2022-04-15 10:46:37,307 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 10:46:37,307 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1001555572] [2022-04-15 10:46:37,307 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 10:46:37,308 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 10:46:37,326 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 10:46:37,326 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [698256898] [2022-04-15 10:46:37,326 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 10:46:37,326 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 10:46:37,326 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 10:46:37,344 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-15 10:46:37,359 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-15 10:46:37,392 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-15 10:46:37,392 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 10:46:37,393 INFO L263 TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 12 conjunts are in the unsatisfiable core [2022-04-15 10:46:37,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 10:46:37,409 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 10:46:37,628 INFO L272 TraceCheckUtils]: 0: Hoare triple {1196#true} call ULTIMATE.init(); {1196#true} is VALID [2022-04-15 10:46:37,639 INFO L290 TraceCheckUtils]: 1: Hoare triple {1196#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; {1196#true} is VALID [2022-04-15 10:46:37,639 INFO L290 TraceCheckUtils]: 2: Hoare triple {1196#true} assume true; {1196#true} is VALID [2022-04-15 10:46:37,639 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1196#true} {1196#true} #57#return; {1196#true} is VALID [2022-04-15 10:46:37,639 INFO L272 TraceCheckUtils]: 4: Hoare triple {1196#true} call #t~ret6 := main(); {1196#true} is VALID [2022-04-15 10:46:37,640 INFO L290 TraceCheckUtils]: 5: Hoare triple {1196#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;~y~0 := 0;~x~0 := 0;~c~0 := 0; {1216#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-15 10:46:37,641 INFO L290 TraceCheckUtils]: 6: Hoare triple {1216#(and (= main_~c~0 0) (= main_~y~0 0))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {1216#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-15 10:46:37,641 INFO L290 TraceCheckUtils]: 7: Hoare triple {1216#(and (= main_~c~0 0) (= main_~y~0 0))} assume !!(#t~post5 < 20);havoc #t~post5; {1216#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-15 10:46:37,641 INFO L272 TraceCheckUtils]: 8: Hoare triple {1216#(and (= main_~c~0 0) (= main_~y~0 0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {1196#true} is VALID [2022-04-15 10:46:37,641 INFO L290 TraceCheckUtils]: 9: Hoare triple {1196#true} ~cond := #in~cond; {1196#true} is VALID [2022-04-15 10:46:37,641 INFO L290 TraceCheckUtils]: 10: Hoare triple {1196#true} assume !(0 == ~cond); {1196#true} is VALID [2022-04-15 10:46:37,641 INFO L290 TraceCheckUtils]: 11: Hoare triple {1196#true} assume true; {1196#true} is VALID [2022-04-15 10:46:37,642 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {1196#true} {1216#(and (= main_~c~0 0) (= main_~y~0 0))} #51#return; {1216#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-15 10:46:37,642 INFO L290 TraceCheckUtils]: 13: Hoare triple {1216#(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 + ~x~0; {1241#(and (= (+ (- 1) main_~y~0) 0) (< 0 main_~k~0) (<= main_~c~0 1))} is VALID [2022-04-15 10:46:37,643 INFO L290 TraceCheckUtils]: 14: Hoare triple {1241#(and (= (+ (- 1) main_~y~0) 0) (< 0 main_~k~0) (<= main_~c~0 1))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {1241#(and (= (+ (- 1) main_~y~0) 0) (< 0 main_~k~0) (<= main_~c~0 1))} is VALID [2022-04-15 10:46:37,643 INFO L290 TraceCheckUtils]: 15: Hoare triple {1241#(and (= (+ (- 1) main_~y~0) 0) (< 0 main_~k~0) (<= main_~c~0 1))} assume !!(#t~post5 < 20);havoc #t~post5; {1241#(and (= (+ (- 1) main_~y~0) 0) (< 0 main_~k~0) (<= main_~c~0 1))} is VALID [2022-04-15 10:46:37,643 INFO L272 TraceCheckUtils]: 16: Hoare triple {1241#(and (= (+ (- 1) main_~y~0) 0) (< 0 main_~k~0) (<= main_~c~0 1))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {1196#true} is VALID [2022-04-15 10:46:37,643 INFO L290 TraceCheckUtils]: 17: Hoare triple {1196#true} ~cond := #in~cond; {1196#true} is VALID [2022-04-15 10:46:37,643 INFO L290 TraceCheckUtils]: 18: Hoare triple {1196#true} assume !(0 == ~cond); {1196#true} is VALID [2022-04-15 10:46:37,644 INFO L290 TraceCheckUtils]: 19: Hoare triple {1196#true} assume true; {1196#true} is VALID [2022-04-15 10:46:37,644 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {1196#true} {1241#(and (= (+ (- 1) main_~y~0) 0) (< 0 main_~k~0) (<= main_~c~0 1))} #51#return; {1241#(and (= (+ (- 1) main_~y~0) 0) (< 0 main_~k~0) (<= main_~c~0 1))} is VALID [2022-04-15 10:46:37,645 INFO L290 TraceCheckUtils]: 21: Hoare triple {1241#(and (= (+ (- 1) main_~y~0) 0) (< 0 main_~k~0) (<= main_~c~0 1))} assume !(~c~0 < ~k~0); {1266#(and (= (+ (- 1) main_~y~0) 0) (<= main_~k~0 1) (< 0 main_~k~0))} is VALID [2022-04-15 10:46:37,645 INFO L272 TraceCheckUtils]: 22: Hoare triple {1266#(and (= (+ (- 1) main_~y~0) 0) (<= main_~k~0 1) (< 0 main_~k~0))} call __VERIFIER_assert((if 0 == ~k~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {1270#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 10:46:37,646 INFO L290 TraceCheckUtils]: 23: Hoare triple {1270#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1274#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 10:46:37,646 INFO L290 TraceCheckUtils]: 24: Hoare triple {1274#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1197#false} is VALID [2022-04-15 10:46:37,646 INFO L290 TraceCheckUtils]: 25: Hoare triple {1197#false} assume !false; {1197#false} is VALID [2022-04-15 10:46:37,646 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-15 10:46:37,646 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 10:46:37,877 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 10:46:37,877 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1001555572] [2022-04-15 10:46:37,877 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 10:46:37,877 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [698256898] [2022-04-15 10:46:37,878 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [698256898] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 10:46:37,878 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-15 10:46:37,878 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2022-04-15 10:46:37,878 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 10:46:37,878 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1435916572] [2022-04-15 10:46:37,878 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1435916572] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 10:46:37,878 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 10:46:37,878 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-15 10:46:37,878 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1924653189] [2022-04-15 10:46:37,878 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 10:46:37,879 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.5) internal successors, (15), 6 states have internal predecessors, (15), 4 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 26 [2022-04-15 10:46:37,879 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 10:46:37,879 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 7 states, 6 states have (on average 2.5) internal successors, (15), 6 states have internal predecessors, (15), 4 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 10:46:37,897 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 23 edges. 23 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 10:46:37,897 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-15 10:46:37,897 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 10:46:37,897 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-15 10:46:37,897 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2022-04-15 10:46:37,897 INFO L87 Difference]: Start difference. First operand 29 states and 30 transitions. Second operand has 7 states, 6 states have (on average 2.5) internal successors, (15), 6 states have internal predecessors, (15), 4 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 10:46:38,043 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 10:46:38,043 INFO L93 Difference]: Finished difference Result 36 states and 38 transitions. [2022-04-15 10:46:38,043 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-15 10:46:38,044 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.5) internal successors, (15), 6 states have internal predecessors, (15), 4 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 26 [2022-04-15 10:46:38,044 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 10:46:38,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 6 states have (on average 2.5) internal successors, (15), 6 states have internal predecessors, (15), 4 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 10:46:38,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 34 transitions. [2022-04-15 10:46:38,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 6 states have (on average 2.5) internal successors, (15), 6 states have internal predecessors, (15), 4 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 10:46:38,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 34 transitions. [2022-04-15 10:46:38,045 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 34 transitions. [2022-04-15 10:46:38,068 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 34 edges. 34 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 10:46:38,068 INFO L225 Difference]: With dead ends: 36 [2022-04-15 10:46:38,068 INFO L226 Difference]: Without dead ends: 31 [2022-04-15 10:46:38,068 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 30 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-15 10:46:38,069 INFO L913 BasicCegarLoop]: 22 mSDtfsCounter, 2 mSDsluCounter, 78 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 100 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 10:46:38,069 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [2 Valid, 100 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 10:46:38,069 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2022-04-15 10:46:38,088 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2022-04-15 10:46:38,088 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 10:46:38,088 INFO L82 GeneralOperation]: Start isEquivalent. First operand 31 states. Second operand has 31 states, 21 states have (on average 1.0952380952380953) internal successors, (23), 21 states have internal predecessors, (23), 6 states have call successors, (6), 5 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-15 10:46:38,089 INFO L74 IsIncluded]: Start isIncluded. First operand 31 states. Second operand has 31 states, 21 states have (on average 1.0952380952380953) internal successors, (23), 21 states have internal predecessors, (23), 6 states have call successors, (6), 5 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-15 10:46:38,089 INFO L87 Difference]: Start difference. First operand 31 states. Second operand has 31 states, 21 states have (on average 1.0952380952380953) internal successors, (23), 21 states have internal predecessors, (23), 6 states have call successors, (6), 5 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-15 10:46:38,090 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 10:46:38,090 INFO L93 Difference]: Finished difference Result 31 states and 33 transitions. [2022-04-15 10:46:38,090 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 33 transitions. [2022-04-15 10:46:38,090 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 10:46:38,090 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 10:46:38,090 INFO L74 IsIncluded]: Start isIncluded. First operand has 31 states, 21 states have (on average 1.0952380952380953) internal successors, (23), 21 states have internal predecessors, (23), 6 states have call successors, (6), 5 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 31 states. [2022-04-15 10:46:38,090 INFO L87 Difference]: Start difference. First operand has 31 states, 21 states have (on average 1.0952380952380953) internal successors, (23), 21 states have internal predecessors, (23), 6 states have call successors, (6), 5 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 31 states. [2022-04-15 10:46:38,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 10:46:38,091 INFO L93 Difference]: Finished difference Result 31 states and 33 transitions. [2022-04-15 10:46:38,091 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 33 transitions. [2022-04-15 10:46:38,091 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 10:46:38,091 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 10:46:38,091 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 10:46:38,091 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 10:46:38,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 21 states have (on average 1.0952380952380953) internal successors, (23), 21 states have internal predecessors, (23), 6 states have call successors, (6), 5 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-15 10:46:38,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 33 transitions. [2022-04-15 10:46:38,092 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 33 transitions. Word has length 26 [2022-04-15 10:46:38,092 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 10:46:38,093 INFO L478 AbstractCegarLoop]: Abstraction has 31 states and 33 transitions. [2022-04-15 10:46:38,093 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.5) internal successors, (15), 6 states have internal predecessors, (15), 4 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 10:46:38,093 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 31 states and 33 transitions. [2022-04-15 10:46:38,566 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 33 edges. 33 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 10:46:38,566 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 33 transitions. [2022-04-15 10:46:38,567 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-04-15 10:46:38,567 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 10:46:38,567 INFO L499 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 10:46:38,582 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-15 10:46:38,767 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-15 10:46:38,768 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 10:46:38,768 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 10:46:38,768 INFO L85 PathProgramCache]: Analyzing trace with hash -1647059121, now seen corresponding path program 3 times [2022-04-15 10:46:38,768 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 10:46:38,768 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1204909789] [2022-04-15 10:46:38,844 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 4 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 10:46:38,845 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONLINEAR_UPDATE [2022-04-15 10:46:38,845 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 10:46:38,845 INFO L85 PathProgramCache]: Analyzing trace with hash -1647059121, now seen corresponding path program 4 times [2022-04-15 10:46:38,845 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 10:46:38,845 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2136872066] [2022-04-15 10:46:38,845 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 10:46:38,845 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 10:46:38,852 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 10:46:38,852 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [651509849] [2022-04-15 10:46:38,852 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-15 10:46:38,852 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 10:46:38,852 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 10:46:38,868 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-15 10:46:38,871 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-15 10:46:38,901 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-15 10:46:38,901 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 10:46:38,902 INFO L263 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 9 conjunts are in the unsatisfiable core [2022-04-15 10:46:38,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 10:46:38,909 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 10:46:39,045 INFO L272 TraceCheckUtils]: 0: Hoare triple {1525#true} call ULTIMATE.init(); {1525#true} is VALID [2022-04-15 10:46:39,046 INFO L290 TraceCheckUtils]: 1: Hoare triple {1525#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; {1533#(<= ~counter~0 0)} is VALID [2022-04-15 10:46:39,046 INFO L290 TraceCheckUtils]: 2: Hoare triple {1533#(<= ~counter~0 0)} assume true; {1533#(<= ~counter~0 0)} is VALID [2022-04-15 10:46:39,047 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1533#(<= ~counter~0 0)} {1525#true} #57#return; {1533#(<= ~counter~0 0)} is VALID [2022-04-15 10:46:39,047 INFO L272 TraceCheckUtils]: 4: Hoare triple {1533#(<= ~counter~0 0)} call #t~ret6 := main(); {1533#(<= ~counter~0 0)} is VALID [2022-04-15 10:46:39,048 INFO L290 TraceCheckUtils]: 5: Hoare triple {1533#(<= ~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;~y~0 := 0;~x~0 := 0;~c~0 := 0; {1533#(<= ~counter~0 0)} is VALID [2022-04-15 10:46:39,048 INFO L290 TraceCheckUtils]: 6: Hoare triple {1533#(<= ~counter~0 0)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {1549#(<= ~counter~0 1)} is VALID [2022-04-15 10:46:39,048 INFO L290 TraceCheckUtils]: 7: Hoare triple {1549#(<= ~counter~0 1)} assume !!(#t~post5 < 20);havoc #t~post5; {1549#(<= ~counter~0 1)} is VALID [2022-04-15 10:46:39,049 INFO L272 TraceCheckUtils]: 8: Hoare triple {1549#(<= ~counter~0 1)} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {1549#(<= ~counter~0 1)} is VALID [2022-04-15 10:46:39,049 INFO L290 TraceCheckUtils]: 9: Hoare triple {1549#(<= ~counter~0 1)} ~cond := #in~cond; {1549#(<= ~counter~0 1)} is VALID [2022-04-15 10:46:39,050 INFO L290 TraceCheckUtils]: 10: Hoare triple {1549#(<= ~counter~0 1)} assume !(0 == ~cond); {1549#(<= ~counter~0 1)} is VALID [2022-04-15 10:46:39,050 INFO L290 TraceCheckUtils]: 11: Hoare triple {1549#(<= ~counter~0 1)} assume true; {1549#(<= ~counter~0 1)} is VALID [2022-04-15 10:46:39,050 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {1549#(<= ~counter~0 1)} {1549#(<= ~counter~0 1)} #51#return; {1549#(<= ~counter~0 1)} is VALID [2022-04-15 10:46:39,051 INFO L290 TraceCheckUtils]: 13: Hoare triple {1549#(<= ~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 + ~x~0; {1549#(<= ~counter~0 1)} is VALID [2022-04-15 10:46:39,051 INFO L290 TraceCheckUtils]: 14: Hoare triple {1549#(<= ~counter~0 1)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {1574#(<= ~counter~0 2)} is VALID [2022-04-15 10:46:39,052 INFO L290 TraceCheckUtils]: 15: Hoare triple {1574#(<= ~counter~0 2)} assume !!(#t~post5 < 20);havoc #t~post5; {1574#(<= ~counter~0 2)} is VALID [2022-04-15 10:46:39,052 INFO L272 TraceCheckUtils]: 16: Hoare triple {1574#(<= ~counter~0 2)} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {1574#(<= ~counter~0 2)} is VALID [2022-04-15 10:46:39,052 INFO L290 TraceCheckUtils]: 17: Hoare triple {1574#(<= ~counter~0 2)} ~cond := #in~cond; {1574#(<= ~counter~0 2)} is VALID [2022-04-15 10:46:39,053 INFO L290 TraceCheckUtils]: 18: Hoare triple {1574#(<= ~counter~0 2)} assume !(0 == ~cond); {1574#(<= ~counter~0 2)} is VALID [2022-04-15 10:46:39,053 INFO L290 TraceCheckUtils]: 19: Hoare triple {1574#(<= ~counter~0 2)} assume true; {1574#(<= ~counter~0 2)} is VALID [2022-04-15 10:46:39,054 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {1574#(<= ~counter~0 2)} {1574#(<= ~counter~0 2)} #51#return; {1574#(<= ~counter~0 2)} is VALID [2022-04-15 10:46:39,054 INFO L290 TraceCheckUtils]: 21: Hoare triple {1574#(<= ~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 + ~x~0; {1574#(<= ~counter~0 2)} is VALID [2022-04-15 10:46:39,054 INFO L290 TraceCheckUtils]: 22: Hoare triple {1574#(<= ~counter~0 2)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {1599#(<= |main_#t~post5| 2)} is VALID [2022-04-15 10:46:39,055 INFO L290 TraceCheckUtils]: 23: Hoare triple {1599#(<= |main_#t~post5| 2)} assume !(#t~post5 < 20);havoc #t~post5; {1526#false} is VALID [2022-04-15 10:46:39,055 INFO L272 TraceCheckUtils]: 24: Hoare triple {1526#false} call __VERIFIER_assert((if 0 == ~k~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {1526#false} is VALID [2022-04-15 10:46:39,055 INFO L290 TraceCheckUtils]: 25: Hoare triple {1526#false} ~cond := #in~cond; {1526#false} is VALID [2022-04-15 10:46:39,055 INFO L290 TraceCheckUtils]: 26: Hoare triple {1526#false} assume 0 == ~cond; {1526#false} is VALID [2022-04-15 10:46:39,055 INFO L290 TraceCheckUtils]: 27: Hoare triple {1526#false} assume !false; {1526#false} is VALID [2022-04-15 10:46:39,055 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 4 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 10:46:39,055 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 10:46:39,224 INFO L290 TraceCheckUtils]: 27: Hoare triple {1526#false} assume !false; {1526#false} is VALID [2022-04-15 10:46:39,224 INFO L290 TraceCheckUtils]: 26: Hoare triple {1526#false} assume 0 == ~cond; {1526#false} is VALID [2022-04-15 10:46:39,224 INFO L290 TraceCheckUtils]: 25: Hoare triple {1526#false} ~cond := #in~cond; {1526#false} is VALID [2022-04-15 10:46:39,224 INFO L272 TraceCheckUtils]: 24: Hoare triple {1526#false} call __VERIFIER_assert((if 0 == ~k~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {1526#false} is VALID [2022-04-15 10:46:39,225 INFO L290 TraceCheckUtils]: 23: Hoare triple {1627#(< |main_#t~post5| 20)} assume !(#t~post5 < 20);havoc #t~post5; {1526#false} is VALID [2022-04-15 10:46:39,225 INFO L290 TraceCheckUtils]: 22: Hoare triple {1631#(< ~counter~0 20)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {1627#(< |main_#t~post5| 20)} is VALID [2022-04-15 10:46:39,225 INFO L290 TraceCheckUtils]: 21: Hoare triple {1631#(< ~counter~0 20)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {1631#(< ~counter~0 20)} is VALID [2022-04-15 10:46:39,226 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {1525#true} {1631#(< ~counter~0 20)} #51#return; {1631#(< ~counter~0 20)} is VALID [2022-04-15 10:46:39,226 INFO L290 TraceCheckUtils]: 19: Hoare triple {1525#true} assume true; {1525#true} is VALID [2022-04-15 10:46:39,226 INFO L290 TraceCheckUtils]: 18: Hoare triple {1525#true} assume !(0 == ~cond); {1525#true} is VALID [2022-04-15 10:46:39,226 INFO L290 TraceCheckUtils]: 17: Hoare triple {1525#true} ~cond := #in~cond; {1525#true} is VALID [2022-04-15 10:46:39,226 INFO L272 TraceCheckUtils]: 16: Hoare triple {1631#(< ~counter~0 20)} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {1525#true} is VALID [2022-04-15 10:46:39,227 INFO L290 TraceCheckUtils]: 15: Hoare triple {1631#(< ~counter~0 20)} assume !!(#t~post5 < 20);havoc #t~post5; {1631#(< ~counter~0 20)} is VALID [2022-04-15 10:46:39,227 INFO L290 TraceCheckUtils]: 14: Hoare triple {1656#(< ~counter~0 19)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {1631#(< ~counter~0 20)} is VALID [2022-04-15 10:46:39,227 INFO L290 TraceCheckUtils]: 13: Hoare triple {1656#(< ~counter~0 19)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {1656#(< ~counter~0 19)} is VALID [2022-04-15 10:46:39,228 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {1525#true} {1656#(< ~counter~0 19)} #51#return; {1656#(< ~counter~0 19)} is VALID [2022-04-15 10:46:39,228 INFO L290 TraceCheckUtils]: 11: Hoare triple {1525#true} assume true; {1525#true} is VALID [2022-04-15 10:46:39,228 INFO L290 TraceCheckUtils]: 10: Hoare triple {1525#true} assume !(0 == ~cond); {1525#true} is VALID [2022-04-15 10:46:39,228 INFO L290 TraceCheckUtils]: 9: Hoare triple {1525#true} ~cond := #in~cond; {1525#true} is VALID [2022-04-15 10:46:39,228 INFO L272 TraceCheckUtils]: 8: Hoare triple {1656#(< ~counter~0 19)} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {1525#true} is VALID [2022-04-15 10:46:39,229 INFO L290 TraceCheckUtils]: 7: Hoare triple {1656#(< ~counter~0 19)} assume !!(#t~post5 < 20);havoc #t~post5; {1656#(< ~counter~0 19)} is VALID [2022-04-15 10:46:39,229 INFO L290 TraceCheckUtils]: 6: Hoare triple {1681#(< ~counter~0 18)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {1656#(< ~counter~0 19)} is VALID [2022-04-15 10:46:39,229 INFO L290 TraceCheckUtils]: 5: Hoare triple {1681#(< ~counter~0 18)} 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;~y~0 := 0;~x~0 := 0;~c~0 := 0; {1681#(< ~counter~0 18)} is VALID [2022-04-15 10:46:39,230 INFO L272 TraceCheckUtils]: 4: Hoare triple {1681#(< ~counter~0 18)} call #t~ret6 := main(); {1681#(< ~counter~0 18)} is VALID [2022-04-15 10:46:39,230 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1681#(< ~counter~0 18)} {1525#true} #57#return; {1681#(< ~counter~0 18)} is VALID [2022-04-15 10:46:39,231 INFO L290 TraceCheckUtils]: 2: Hoare triple {1681#(< ~counter~0 18)} assume true; {1681#(< ~counter~0 18)} is VALID [2022-04-15 10:46:39,231 INFO L290 TraceCheckUtils]: 1: Hoare triple {1525#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; {1681#(< ~counter~0 18)} is VALID [2022-04-15 10:46:39,231 INFO L272 TraceCheckUtils]: 0: Hoare triple {1525#true} call ULTIMATE.init(); {1525#true} is VALID [2022-04-15 10:46:39,231 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 4 proven. 8 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-15 10:46:39,232 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 10:46:39,232 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2136872066] [2022-04-15 10:46:39,232 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 10:46:39,232 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [651509849] [2022-04-15 10:46:39,232 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [651509849] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 10:46:39,232 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-15 10:46:39,232 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2022-04-15 10:46:39,232 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 10:46:39,232 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1204909789] [2022-04-15 10:46:39,232 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1204909789] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 10:46:39,232 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 10:46:39,232 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-15 10:46:39,232 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [107827030] [2022-04-15 10:46:39,233 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 10:46:39,233 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 5 states have internal predecessors, (20), 5 states have call successors, (5), 5 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 28 [2022-04-15 10:46:39,233 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 10:46:39,233 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 5 states have internal predecessors, (20), 5 states have call successors, (5), 5 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 10:46:39,251 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 28 edges. 28 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 10:46:39,252 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-15 10:46:39,252 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 10:46:39,252 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-15 10:46:39,252 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-04-15 10:46:39,252 INFO L87 Difference]: Start difference. First operand 31 states and 33 transitions. Second operand has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 5 states have internal predecessors, (20), 5 states have call successors, (5), 5 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 10:46:39,347 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 10:46:39,347 INFO L93 Difference]: Finished difference Result 42 states and 43 transitions. [2022-04-15 10:46:39,347 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-15 10:46:39,347 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 5 states have internal predecessors, (20), 5 states have call successors, (5), 5 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 28 [2022-04-15 10:46:39,347 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 10:46:39,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 5 states have internal predecessors, (20), 5 states have call successors, (5), 5 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 10:46:39,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 42 transitions. [2022-04-15 10:46:39,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 5 states have internal predecessors, (20), 5 states have call successors, (5), 5 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 10:46:39,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 42 transitions. [2022-04-15 10:46:39,349 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 42 transitions. [2022-04-15 10:46:39,380 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 42 edges. 42 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 10:46:39,380 INFO L225 Difference]: With dead ends: 42 [2022-04-15 10:46:39,380 INFO L226 Difference]: Without dead ends: 37 [2022-04-15 10:46:39,381 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=51, Invalid=81, Unknown=0, NotChecked=0, Total=132 [2022-04-15 10:46:39,381 INFO L913 BasicCegarLoop]: 19 mSDtfsCounter, 2 mSDsluCounter, 45 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 64 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 10:46:39,381 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [2 Valid, 64 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 10:46:39,381 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2022-04-15 10:46:39,409 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2022-04-15 10:46:39,409 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 10:46:39,410 INFO L82 GeneralOperation]: Start isEquivalent. First operand 37 states. Second operand has 37 states, 26 states have (on average 1.0769230769230769) internal successors, (28), 26 states have internal predecessors, (28), 6 states have call successors, (6), 6 states have call predecessors, (6), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-15 10:46:39,410 INFO L74 IsIncluded]: Start isIncluded. First operand 37 states. Second operand has 37 states, 26 states have (on average 1.0769230769230769) internal successors, (28), 26 states have internal predecessors, (28), 6 states have call successors, (6), 6 states have call predecessors, (6), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-15 10:46:39,410 INFO L87 Difference]: Start difference. First operand 37 states. Second operand has 37 states, 26 states have (on average 1.0769230769230769) internal successors, (28), 26 states have internal predecessors, (28), 6 states have call successors, (6), 6 states have call predecessors, (6), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-15 10:46:39,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 10:46:39,411 INFO L93 Difference]: Finished difference Result 37 states and 38 transitions. [2022-04-15 10:46:39,411 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 38 transitions. [2022-04-15 10:46:39,411 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 10:46:39,411 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 10:46:39,411 INFO L74 IsIncluded]: Start isIncluded. First operand has 37 states, 26 states have (on average 1.0769230769230769) internal successors, (28), 26 states have internal predecessors, (28), 6 states have call successors, (6), 6 states have call predecessors, (6), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand 37 states. [2022-04-15 10:46:39,411 INFO L87 Difference]: Start difference. First operand has 37 states, 26 states have (on average 1.0769230769230769) internal successors, (28), 26 states have internal predecessors, (28), 6 states have call successors, (6), 6 states have call predecessors, (6), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand 37 states. [2022-04-15 10:46:39,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 10:46:39,426 INFO L93 Difference]: Finished difference Result 37 states and 38 transitions. [2022-04-15 10:46:39,426 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 38 transitions. [2022-04-15 10:46:39,426 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 10:46:39,426 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 10:46:39,426 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 10:46:39,426 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 10:46:39,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 26 states have (on average 1.0769230769230769) internal successors, (28), 26 states have internal predecessors, (28), 6 states have call successors, (6), 6 states have call predecessors, (6), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-15 10:46:39,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 38 transitions. [2022-04-15 10:46:39,427 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 38 transitions. Word has length 28 [2022-04-15 10:46:39,428 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 10:46:39,428 INFO L478 AbstractCegarLoop]: Abstraction has 37 states and 38 transitions. [2022-04-15 10:46:39,428 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 5 states have internal predecessors, (20), 5 states have call successors, (5), 5 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 10:46:39,428 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 37 states and 38 transitions. [2022-04-15 10:46:39,904 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-15 10:46:39,904 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 38 transitions. [2022-04-15 10:46:39,904 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-04-15 10:46:39,905 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 10:46:39,905 INFO L499 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 10:46:39,920 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2022-04-15 10:46:40,105 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-15 10:46:40,105 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 10:46:40,106 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 10:46:40,106 INFO L85 PathProgramCache]: Analyzing trace with hash 1036651181, now seen corresponding path program 3 times [2022-04-15 10:46:40,106 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 10:46:40,106 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [45785815] [2022-04-15 10:46:40,185 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 4 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 10:46:40,185 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONLINEAR_UPDATE [2022-04-15 10:46:40,185 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 10:46:40,185 INFO L85 PathProgramCache]: Analyzing trace with hash 1036651181, now seen corresponding path program 4 times [2022-04-15 10:46:40,185 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 10:46:40,185 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [292770171] [2022-04-15 10:46:40,185 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 10:46:40,186 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 10:46:40,192 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 10:46:40,192 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1423926804] [2022-04-15 10:46:40,192 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-15 10:46:40,192 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 10:46:40,192 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 10:46:40,193 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-15 10:46:40,196 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-15 10:46:40,246 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-15 10:46:40,246 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 10:46:40,247 INFO L263 TraceCheckSpWp]: Trace formula consists of 123 conjuncts, 17 conjunts are in the unsatisfiable core [2022-04-15 10:46:40,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 10:46:40,258 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 10:46:40,538 INFO L272 TraceCheckUtils]: 0: Hoare triple {1938#true} call ULTIMATE.init(); {1938#true} is VALID [2022-04-15 10:46:40,538 INFO L290 TraceCheckUtils]: 1: Hoare triple {1938#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; {1938#true} is VALID [2022-04-15 10:46:40,538 INFO L290 TraceCheckUtils]: 2: Hoare triple {1938#true} assume true; {1938#true} is VALID [2022-04-15 10:46:40,539 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1938#true} {1938#true} #57#return; {1938#true} is VALID [2022-04-15 10:46:40,539 INFO L272 TraceCheckUtils]: 4: Hoare triple {1938#true} call #t~ret6 := main(); {1938#true} is VALID [2022-04-15 10:46:40,539 INFO L290 TraceCheckUtils]: 5: Hoare triple {1938#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;~y~0 := 0;~x~0 := 0;~c~0 := 0; {1958#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-15 10:46:40,539 INFO L290 TraceCheckUtils]: 6: Hoare triple {1958#(and (= main_~c~0 0) (= main_~y~0 0))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {1958#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-15 10:46:40,540 INFO L290 TraceCheckUtils]: 7: Hoare triple {1958#(and (= main_~c~0 0) (= main_~y~0 0))} assume !!(#t~post5 < 20);havoc #t~post5; {1958#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-15 10:46:40,540 INFO L272 TraceCheckUtils]: 8: Hoare triple {1958#(and (= main_~c~0 0) (= main_~y~0 0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {1938#true} is VALID [2022-04-15 10:46:40,540 INFO L290 TraceCheckUtils]: 9: Hoare triple {1938#true} ~cond := #in~cond; {1938#true} is VALID [2022-04-15 10:46:40,540 INFO L290 TraceCheckUtils]: 10: Hoare triple {1938#true} assume !(0 == ~cond); {1938#true} is VALID [2022-04-15 10:46:40,540 INFO L290 TraceCheckUtils]: 11: Hoare triple {1938#true} assume true; {1938#true} is VALID [2022-04-15 10:46:40,541 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {1938#true} {1958#(and (= main_~c~0 0) (= main_~y~0 0))} #51#return; {1958#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-15 10:46:40,541 INFO L290 TraceCheckUtils]: 13: Hoare triple {1958#(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 + ~x~0; {1983#(and (= (+ (- 1) main_~y~0) 0) (< 0 main_~k~0) (= main_~c~0 1))} is VALID [2022-04-15 10:46:40,542 INFO L290 TraceCheckUtils]: 14: Hoare triple {1983#(and (= (+ (- 1) main_~y~0) 0) (< 0 main_~k~0) (= main_~c~0 1))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {1983#(and (= (+ (- 1) main_~y~0) 0) (< 0 main_~k~0) (= main_~c~0 1))} is VALID [2022-04-15 10:46:40,542 INFO L290 TraceCheckUtils]: 15: Hoare triple {1983#(and (= (+ (- 1) main_~y~0) 0) (< 0 main_~k~0) (= main_~c~0 1))} assume !!(#t~post5 < 20);havoc #t~post5; {1983#(and (= (+ (- 1) main_~y~0) 0) (< 0 main_~k~0) (= main_~c~0 1))} is VALID [2022-04-15 10:46:40,542 INFO L272 TraceCheckUtils]: 16: Hoare triple {1983#(and (= (+ (- 1) main_~y~0) 0) (< 0 main_~k~0) (= main_~c~0 1))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {1938#true} is VALID [2022-04-15 10:46:40,542 INFO L290 TraceCheckUtils]: 17: Hoare triple {1938#true} ~cond := #in~cond; {1938#true} is VALID [2022-04-15 10:46:40,542 INFO L290 TraceCheckUtils]: 18: Hoare triple {1938#true} assume !(0 == ~cond); {1938#true} is VALID [2022-04-15 10:46:40,542 INFO L290 TraceCheckUtils]: 19: Hoare triple {1938#true} assume true; {1938#true} is VALID [2022-04-15 10:46:40,543 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {1938#true} {1983#(and (= (+ (- 1) main_~y~0) 0) (< 0 main_~k~0) (= main_~c~0 1))} #51#return; {1983#(and (= (+ (- 1) main_~y~0) 0) (< 0 main_~k~0) (= main_~c~0 1))} is VALID [2022-04-15 10:46:40,543 INFO L290 TraceCheckUtils]: 21: Hoare triple {1983#(and (= (+ (- 1) main_~y~0) 0) (< 0 main_~k~0) (= main_~c~0 1))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {2008#(and (= main_~y~0 2) (< 1 main_~k~0) (<= main_~c~0 2))} is VALID [2022-04-15 10:46:40,544 INFO L290 TraceCheckUtils]: 22: Hoare triple {2008#(and (= main_~y~0 2) (< 1 main_~k~0) (<= main_~c~0 2))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {2008#(and (= main_~y~0 2) (< 1 main_~k~0) (<= main_~c~0 2))} is VALID [2022-04-15 10:46:40,544 INFO L290 TraceCheckUtils]: 23: Hoare triple {2008#(and (= main_~y~0 2) (< 1 main_~k~0) (<= main_~c~0 2))} assume !!(#t~post5 < 20);havoc #t~post5; {2008#(and (= main_~y~0 2) (< 1 main_~k~0) (<= main_~c~0 2))} is VALID [2022-04-15 10:46:40,544 INFO L272 TraceCheckUtils]: 24: Hoare triple {2008#(and (= main_~y~0 2) (< 1 main_~k~0) (<= main_~c~0 2))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {1938#true} is VALID [2022-04-15 10:46:40,544 INFO L290 TraceCheckUtils]: 25: Hoare triple {1938#true} ~cond := #in~cond; {1938#true} is VALID [2022-04-15 10:46:40,545 INFO L290 TraceCheckUtils]: 26: Hoare triple {1938#true} assume !(0 == ~cond); {1938#true} is VALID [2022-04-15 10:46:40,545 INFO L290 TraceCheckUtils]: 27: Hoare triple {1938#true} assume true; {1938#true} is VALID [2022-04-15 10:46:40,545 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {1938#true} {2008#(and (= main_~y~0 2) (< 1 main_~k~0) (<= main_~c~0 2))} #51#return; {2008#(and (= main_~y~0 2) (< 1 main_~k~0) (<= main_~c~0 2))} is VALID [2022-04-15 10:46:40,546 INFO L290 TraceCheckUtils]: 29: Hoare triple {2008#(and (= main_~y~0 2) (< 1 main_~k~0) (<= main_~c~0 2))} assume !(~c~0 < ~k~0); {2033#(and (= main_~y~0 2) (< 1 main_~k~0) (<= main_~k~0 2))} is VALID [2022-04-15 10:46:40,546 INFO L272 TraceCheckUtils]: 30: Hoare triple {2033#(and (= main_~y~0 2) (< 1 main_~k~0) (<= main_~k~0 2))} call __VERIFIER_assert((if 0 == ~k~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {2037#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 10:46:40,547 INFO L290 TraceCheckUtils]: 31: Hoare triple {2037#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {2041#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 10:46:40,547 INFO L290 TraceCheckUtils]: 32: Hoare triple {2041#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1939#false} is VALID [2022-04-15 10:46:40,547 INFO L290 TraceCheckUtils]: 33: Hoare triple {1939#false} assume !false; {1939#false} is VALID [2022-04-15 10:46:40,547 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 6 proven. 12 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-04-15 10:46:40,547 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 10:46:40,861 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 10:46:40,861 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [292770171] [2022-04-15 10:46:40,861 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 10:46:40,861 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1423926804] [2022-04-15 10:46:40,861 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1423926804] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 10:46:40,861 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-15 10:46:40,861 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2022-04-15 10:46:40,861 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 10:46:40,861 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [45785815] [2022-04-15 10:46:40,861 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [45785815] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 10:46:40,861 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 10:46:40,862 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-15 10:46:40,862 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2093045893] [2022-04-15 10:46:40,862 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 10:46:40,862 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 7 states have internal predecessors, (18), 5 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Word has length 34 [2022-04-15 10:46:40,862 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 10:46:40,862 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 8 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 7 states have internal predecessors, (18), 5 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-15 10:46:40,881 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 28 edges. 28 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 10:46:40,881 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-15 10:46:40,881 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 10:46:40,881 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-15 10:46:40,881 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2022-04-15 10:46:40,881 INFO L87 Difference]: Start difference. First operand 37 states and 38 transitions. Second operand has 8 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 7 states have internal predecessors, (18), 5 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-15 10:46:41,084 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 10:46:41,084 INFO L93 Difference]: Finished difference Result 44 states and 46 transitions. [2022-04-15 10:46:41,084 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-15 10:46:41,084 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 7 states have internal predecessors, (18), 5 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Word has length 34 [2022-04-15 10:46:41,084 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 10:46:41,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 7 states have internal predecessors, (18), 5 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-15 10:46:41,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 39 transitions. [2022-04-15 10:46:41,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 7 states have internal predecessors, (18), 5 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-15 10:46:41,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 39 transitions. [2022-04-15 10:46:41,086 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 39 transitions. [2022-04-15 10:46:41,114 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 39 edges. 39 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 10:46:41,115 INFO L225 Difference]: With dead ends: 44 [2022-04-15 10:46:41,115 INFO L226 Difference]: Without dead ends: 39 [2022-04-15 10:46:41,115 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 44 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=140, Unknown=0, NotChecked=0, Total=182 [2022-04-15 10:46:41,115 INFO L913 BasicCegarLoop]: 26 mSDtfsCounter, 2 mSDsluCounter, 106 mSDsCounter, 0 mSdLazyCounter, 71 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 132 SdHoareTripleChecker+Invalid, 71 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 71 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-15 10:46:41,115 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [2 Valid, 132 Invalid, 71 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 71 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-15 10:46:41,116 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2022-04-15 10:46:41,146 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2022-04-15 10:46:41,146 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 10:46:41,146 INFO L82 GeneralOperation]: Start isEquivalent. First operand 39 states. Second operand has 39 states, 27 states have (on average 1.0740740740740742) internal successors, (29), 27 states have internal predecessors, (29), 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-15 10:46:41,146 INFO L74 IsIncluded]: Start isIncluded. First operand 39 states. Second operand has 39 states, 27 states have (on average 1.0740740740740742) internal successors, (29), 27 states have internal predecessors, (29), 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-15 10:46:41,146 INFO L87 Difference]: Start difference. First operand 39 states. Second operand has 39 states, 27 states have (on average 1.0740740740740742) internal successors, (29), 27 states have internal predecessors, (29), 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-15 10:46:41,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 10:46:41,147 INFO L93 Difference]: Finished difference Result 39 states and 41 transitions. [2022-04-15 10:46:41,147 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 41 transitions. [2022-04-15 10:46:41,148 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 10:46:41,148 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 10:46:41,148 INFO L74 IsIncluded]: Start isIncluded. First operand has 39 states, 27 states have (on average 1.0740740740740742) internal successors, (29), 27 states have internal predecessors, (29), 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 39 states. [2022-04-15 10:46:41,148 INFO L87 Difference]: Start difference. First operand has 39 states, 27 states have (on average 1.0740740740740742) internal successors, (29), 27 states have internal predecessors, (29), 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 39 states. [2022-04-15 10:46:41,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 10:46:41,149 INFO L93 Difference]: Finished difference Result 39 states and 41 transitions. [2022-04-15 10:46:41,149 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 41 transitions. [2022-04-15 10:46:41,149 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 10:46:41,149 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 10:46:41,149 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 10:46:41,149 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 10:46:41,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 27 states have (on average 1.0740740740740742) internal successors, (29), 27 states have internal predecessors, (29), 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-15 10:46:41,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 41 transitions. [2022-04-15 10:46:41,150 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 41 transitions. Word has length 34 [2022-04-15 10:46:41,150 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 10:46:41,150 INFO L478 AbstractCegarLoop]: Abstraction has 39 states and 41 transitions. [2022-04-15 10:46:41,150 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 7 states have internal predecessors, (18), 5 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-15 10:46:41,150 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 39 states and 41 transitions. [2022-04-15 10:46:41,632 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-15 10:46:41,632 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 41 transitions. [2022-04-15 10:46:41,633 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-04-15 10:46:41,633 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 10:46:41,633 INFO L499 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 10:46:41,637 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-15 10:46:41,833 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-15 10:46:41,833 INFO L403 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 10:46:41,834 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 10:46:41,834 INFO L85 PathProgramCache]: Analyzing trace with hash 486001554, now seen corresponding path program 5 times [2022-04-15 10:46:41,834 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 10:46:41,834 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [452005927] [2022-04-15 10:46:41,942 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 4 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 10:46:41,942 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONLINEAR_UPDATE [2022-04-15 10:46:41,942 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 10:46:41,942 INFO L85 PathProgramCache]: Analyzing trace with hash 486001554, now seen corresponding path program 6 times [2022-04-15 10:46:41,942 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 10:46:41,942 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [827162047] [2022-04-15 10:46:41,942 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 10:46:41,942 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 10:46:41,949 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 10:46:41,949 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [422262815] [2022-04-15 10:46:41,949 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-15 10:46:41,949 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 10:46:41,949 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 10:46:41,950 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-15 10:46:41,951 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-15 10:46:41,987 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2022-04-15 10:46:41,988 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 10:46:41,988 INFO L263 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 11 conjunts are in the unsatisfiable core [2022-04-15 10:46:41,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 10:46:41,997 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 10:46:42,185 INFO L272 TraceCheckUtils]: 0: Hoare triple {2365#true} call ULTIMATE.init(); {2365#true} is VALID [2022-04-15 10:46:42,185 INFO L290 TraceCheckUtils]: 1: Hoare triple {2365#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; {2373#(<= ~counter~0 0)} is VALID [2022-04-15 10:46:42,186 INFO L290 TraceCheckUtils]: 2: Hoare triple {2373#(<= ~counter~0 0)} assume true; {2373#(<= ~counter~0 0)} is VALID [2022-04-15 10:46:42,186 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2373#(<= ~counter~0 0)} {2365#true} #57#return; {2373#(<= ~counter~0 0)} is VALID [2022-04-15 10:46:42,186 INFO L272 TraceCheckUtils]: 4: Hoare triple {2373#(<= ~counter~0 0)} call #t~ret6 := main(); {2373#(<= ~counter~0 0)} is VALID [2022-04-15 10:46:42,187 INFO L290 TraceCheckUtils]: 5: Hoare triple {2373#(<= ~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;~y~0 := 0;~x~0 := 0;~c~0 := 0; {2373#(<= ~counter~0 0)} is VALID [2022-04-15 10:46:42,187 INFO L290 TraceCheckUtils]: 6: Hoare triple {2373#(<= ~counter~0 0)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {2389#(<= ~counter~0 1)} is VALID [2022-04-15 10:46:42,188 INFO L290 TraceCheckUtils]: 7: Hoare triple {2389#(<= ~counter~0 1)} assume !!(#t~post5 < 20);havoc #t~post5; {2389#(<= ~counter~0 1)} is VALID [2022-04-15 10:46:42,188 INFO L272 TraceCheckUtils]: 8: Hoare triple {2389#(<= ~counter~0 1)} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {2389#(<= ~counter~0 1)} is VALID [2022-04-15 10:46:42,188 INFO L290 TraceCheckUtils]: 9: Hoare triple {2389#(<= ~counter~0 1)} ~cond := #in~cond; {2389#(<= ~counter~0 1)} is VALID [2022-04-15 10:46:42,189 INFO L290 TraceCheckUtils]: 10: Hoare triple {2389#(<= ~counter~0 1)} assume !(0 == ~cond); {2389#(<= ~counter~0 1)} is VALID [2022-04-15 10:46:42,189 INFO L290 TraceCheckUtils]: 11: Hoare triple {2389#(<= ~counter~0 1)} assume true; {2389#(<= ~counter~0 1)} is VALID [2022-04-15 10:46:42,189 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {2389#(<= ~counter~0 1)} {2389#(<= ~counter~0 1)} #51#return; {2389#(<= ~counter~0 1)} is VALID [2022-04-15 10:46:42,190 INFO L290 TraceCheckUtils]: 13: Hoare triple {2389#(<= ~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 + ~x~0; {2389#(<= ~counter~0 1)} is VALID [2022-04-15 10:46:42,190 INFO L290 TraceCheckUtils]: 14: Hoare triple {2389#(<= ~counter~0 1)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {2414#(<= ~counter~0 2)} is VALID [2022-04-15 10:46:42,191 INFO L290 TraceCheckUtils]: 15: Hoare triple {2414#(<= ~counter~0 2)} assume !!(#t~post5 < 20);havoc #t~post5; {2414#(<= ~counter~0 2)} is VALID [2022-04-15 10:46:42,191 INFO L272 TraceCheckUtils]: 16: Hoare triple {2414#(<= ~counter~0 2)} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {2414#(<= ~counter~0 2)} is VALID [2022-04-15 10:46:42,191 INFO L290 TraceCheckUtils]: 17: Hoare triple {2414#(<= ~counter~0 2)} ~cond := #in~cond; {2414#(<= ~counter~0 2)} is VALID [2022-04-15 10:46:42,192 INFO L290 TraceCheckUtils]: 18: Hoare triple {2414#(<= ~counter~0 2)} assume !(0 == ~cond); {2414#(<= ~counter~0 2)} is VALID [2022-04-15 10:46:42,192 INFO L290 TraceCheckUtils]: 19: Hoare triple {2414#(<= ~counter~0 2)} assume true; {2414#(<= ~counter~0 2)} is VALID [2022-04-15 10:46:42,193 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {2414#(<= ~counter~0 2)} {2414#(<= ~counter~0 2)} #51#return; {2414#(<= ~counter~0 2)} is VALID [2022-04-15 10:46:42,193 INFO L290 TraceCheckUtils]: 21: Hoare triple {2414#(<= ~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 + ~x~0; {2414#(<= ~counter~0 2)} is VALID [2022-04-15 10:46:42,193 INFO L290 TraceCheckUtils]: 22: Hoare triple {2414#(<= ~counter~0 2)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {2439#(<= ~counter~0 3)} is VALID [2022-04-15 10:46:42,194 INFO L290 TraceCheckUtils]: 23: Hoare triple {2439#(<= ~counter~0 3)} assume !!(#t~post5 < 20);havoc #t~post5; {2439#(<= ~counter~0 3)} is VALID [2022-04-15 10:46:42,194 INFO L272 TraceCheckUtils]: 24: Hoare triple {2439#(<= ~counter~0 3)} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {2439#(<= ~counter~0 3)} is VALID [2022-04-15 10:46:42,194 INFO L290 TraceCheckUtils]: 25: Hoare triple {2439#(<= ~counter~0 3)} ~cond := #in~cond; {2439#(<= ~counter~0 3)} is VALID [2022-04-15 10:46:42,195 INFO L290 TraceCheckUtils]: 26: Hoare triple {2439#(<= ~counter~0 3)} assume !(0 == ~cond); {2439#(<= ~counter~0 3)} is VALID [2022-04-15 10:46:42,195 INFO L290 TraceCheckUtils]: 27: Hoare triple {2439#(<= ~counter~0 3)} assume true; {2439#(<= ~counter~0 3)} is VALID [2022-04-15 10:46:42,196 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {2439#(<= ~counter~0 3)} {2439#(<= ~counter~0 3)} #51#return; {2439#(<= ~counter~0 3)} is VALID [2022-04-15 10:46:42,196 INFO L290 TraceCheckUtils]: 29: Hoare triple {2439#(<= ~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 + ~x~0; {2439#(<= ~counter~0 3)} is VALID [2022-04-15 10:46:42,196 INFO L290 TraceCheckUtils]: 30: Hoare triple {2439#(<= ~counter~0 3)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {2464#(<= |main_#t~post5| 3)} is VALID [2022-04-15 10:46:42,197 INFO L290 TraceCheckUtils]: 31: Hoare triple {2464#(<= |main_#t~post5| 3)} assume !(#t~post5 < 20);havoc #t~post5; {2366#false} is VALID [2022-04-15 10:46:42,197 INFO L272 TraceCheckUtils]: 32: Hoare triple {2366#false} call __VERIFIER_assert((if 0 == ~k~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {2366#false} is VALID [2022-04-15 10:46:42,197 INFO L290 TraceCheckUtils]: 33: Hoare triple {2366#false} ~cond := #in~cond; {2366#false} is VALID [2022-04-15 10:46:42,197 INFO L290 TraceCheckUtils]: 34: Hoare triple {2366#false} assume 0 == ~cond; {2366#false} is VALID [2022-04-15 10:46:42,197 INFO L290 TraceCheckUtils]: 35: Hoare triple {2366#false} assume !false; {2366#false} is VALID [2022-04-15 10:46:42,197 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 6 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 10:46:42,197 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 10:46:42,419 INFO L290 TraceCheckUtils]: 35: Hoare triple {2366#false} assume !false; {2366#false} is VALID [2022-04-15 10:46:42,419 INFO L290 TraceCheckUtils]: 34: Hoare triple {2366#false} assume 0 == ~cond; {2366#false} is VALID [2022-04-15 10:46:42,419 INFO L290 TraceCheckUtils]: 33: Hoare triple {2366#false} ~cond := #in~cond; {2366#false} is VALID [2022-04-15 10:46:42,419 INFO L272 TraceCheckUtils]: 32: Hoare triple {2366#false} call __VERIFIER_assert((if 0 == ~k~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {2366#false} is VALID [2022-04-15 10:46:42,419 INFO L290 TraceCheckUtils]: 31: Hoare triple {2492#(< |main_#t~post5| 20)} assume !(#t~post5 < 20);havoc #t~post5; {2366#false} is VALID [2022-04-15 10:46:42,420 INFO L290 TraceCheckUtils]: 30: Hoare triple {2496#(< ~counter~0 20)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {2492#(< |main_#t~post5| 20)} is VALID [2022-04-15 10:46:42,420 INFO L290 TraceCheckUtils]: 29: Hoare triple {2496#(< ~counter~0 20)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {2496#(< ~counter~0 20)} is VALID [2022-04-15 10:46:42,421 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {2365#true} {2496#(< ~counter~0 20)} #51#return; {2496#(< ~counter~0 20)} is VALID [2022-04-15 10:46:42,421 INFO L290 TraceCheckUtils]: 27: Hoare triple {2365#true} assume true; {2365#true} is VALID [2022-04-15 10:46:42,421 INFO L290 TraceCheckUtils]: 26: Hoare triple {2365#true} assume !(0 == ~cond); {2365#true} is VALID [2022-04-15 10:46:42,421 INFO L290 TraceCheckUtils]: 25: Hoare triple {2365#true} ~cond := #in~cond; {2365#true} is VALID [2022-04-15 10:46:42,421 INFO L272 TraceCheckUtils]: 24: Hoare triple {2496#(< ~counter~0 20)} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {2365#true} is VALID [2022-04-15 10:46:42,421 INFO L290 TraceCheckUtils]: 23: Hoare triple {2496#(< ~counter~0 20)} assume !!(#t~post5 < 20);havoc #t~post5; {2496#(< ~counter~0 20)} is VALID [2022-04-15 10:46:42,422 INFO L290 TraceCheckUtils]: 22: Hoare triple {2521#(< ~counter~0 19)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {2496#(< ~counter~0 20)} is VALID [2022-04-15 10:46:42,422 INFO L290 TraceCheckUtils]: 21: Hoare triple {2521#(< ~counter~0 19)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {2521#(< ~counter~0 19)} is VALID [2022-04-15 10:46:42,423 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {2365#true} {2521#(< ~counter~0 19)} #51#return; {2521#(< ~counter~0 19)} is VALID [2022-04-15 10:46:42,423 INFO L290 TraceCheckUtils]: 19: Hoare triple {2365#true} assume true; {2365#true} is VALID [2022-04-15 10:46:42,423 INFO L290 TraceCheckUtils]: 18: Hoare triple {2365#true} assume !(0 == ~cond); {2365#true} is VALID [2022-04-15 10:46:42,423 INFO L290 TraceCheckUtils]: 17: Hoare triple {2365#true} ~cond := #in~cond; {2365#true} is VALID [2022-04-15 10:46:42,423 INFO L272 TraceCheckUtils]: 16: Hoare triple {2521#(< ~counter~0 19)} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {2365#true} is VALID [2022-04-15 10:46:42,423 INFO L290 TraceCheckUtils]: 15: Hoare triple {2521#(< ~counter~0 19)} assume !!(#t~post5 < 20);havoc #t~post5; {2521#(< ~counter~0 19)} is VALID [2022-04-15 10:46:42,424 INFO L290 TraceCheckUtils]: 14: Hoare triple {2546#(< ~counter~0 18)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {2521#(< ~counter~0 19)} is VALID [2022-04-15 10:46:42,424 INFO L290 TraceCheckUtils]: 13: Hoare triple {2546#(< ~counter~0 18)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {2546#(< ~counter~0 18)} is VALID [2022-04-15 10:46:42,424 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {2365#true} {2546#(< ~counter~0 18)} #51#return; {2546#(< ~counter~0 18)} is VALID [2022-04-15 10:46:42,425 INFO L290 TraceCheckUtils]: 11: Hoare triple {2365#true} assume true; {2365#true} is VALID [2022-04-15 10:46:42,425 INFO L290 TraceCheckUtils]: 10: Hoare triple {2365#true} assume !(0 == ~cond); {2365#true} is VALID [2022-04-15 10:46:42,425 INFO L290 TraceCheckUtils]: 9: Hoare triple {2365#true} ~cond := #in~cond; {2365#true} is VALID [2022-04-15 10:46:42,425 INFO L272 TraceCheckUtils]: 8: Hoare triple {2546#(< ~counter~0 18)} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {2365#true} is VALID [2022-04-15 10:46:42,425 INFO L290 TraceCheckUtils]: 7: Hoare triple {2546#(< ~counter~0 18)} assume !!(#t~post5 < 20);havoc #t~post5; {2546#(< ~counter~0 18)} is VALID [2022-04-15 10:46:42,426 INFO L290 TraceCheckUtils]: 6: Hoare triple {2571#(< ~counter~0 17)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {2546#(< ~counter~0 18)} is VALID [2022-04-15 10:46:42,426 INFO L290 TraceCheckUtils]: 5: Hoare triple {2571#(< ~counter~0 17)} 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;~y~0 := 0;~x~0 := 0;~c~0 := 0; {2571#(< ~counter~0 17)} is VALID [2022-04-15 10:46:42,426 INFO L272 TraceCheckUtils]: 4: Hoare triple {2571#(< ~counter~0 17)} call #t~ret6 := main(); {2571#(< ~counter~0 17)} is VALID [2022-04-15 10:46:42,427 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2571#(< ~counter~0 17)} {2365#true} #57#return; {2571#(< ~counter~0 17)} is VALID [2022-04-15 10:46:42,427 INFO L290 TraceCheckUtils]: 2: Hoare triple {2571#(< ~counter~0 17)} assume true; {2571#(< ~counter~0 17)} is VALID [2022-04-15 10:46:42,427 INFO L290 TraceCheckUtils]: 1: Hoare triple {2365#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; {2571#(< ~counter~0 17)} is VALID [2022-04-15 10:46:42,428 INFO L272 TraceCheckUtils]: 0: Hoare triple {2365#true} call ULTIMATE.init(); {2365#true} is VALID [2022-04-15 10:46:42,428 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 6 proven. 18 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-04-15 10:46:42,428 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 10:46:42,428 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [827162047] [2022-04-15 10:46:42,428 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 10:46:42,428 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [422262815] [2022-04-15 10:46:42,428 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [422262815] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 10:46:42,428 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-15 10:46:42,428 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2022-04-15 10:46:42,428 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 10:46:42,428 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [452005927] [2022-04-15 10:46:42,429 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [452005927] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 10:46:42,429 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 10:46:42,429 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-15 10:46:42,429 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1086059192] [2022-04-15 10:46:42,429 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 10:46:42,430 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 6 states have internal predecessors, (26), 6 states have call successors, (6), 6 states have call predecessors, (6), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Word has length 36 [2022-04-15 10:46:42,430 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 10:46:42,430 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 6 states have internal predecessors, (26), 6 states have call successors, (6), 6 states have call predecessors, (6), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-15 10:46:42,454 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-15 10:46:42,454 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-15 10:46:42,454 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 10:46:42,455 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-15 10:46:42,455 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=82, Unknown=0, NotChecked=0, Total=132 [2022-04-15 10:46:42,455 INFO L87 Difference]: Start difference. First operand 39 states and 41 transitions. Second operand has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 6 states have internal predecessors, (26), 6 states have call successors, (6), 6 states have call predecessors, (6), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-15 10:46:42,591 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 10:46:42,591 INFO L93 Difference]: Finished difference Result 50 states and 51 transitions. [2022-04-15 10:46:42,591 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-04-15 10:46:42,591 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 6 states have internal predecessors, (26), 6 states have call successors, (6), 6 states have call predecessors, (6), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Word has length 36 [2022-04-15 10:46:42,591 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 10:46:42,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 6 states have internal predecessors, (26), 6 states have call successors, (6), 6 states have call predecessors, (6), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-15 10:46:42,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 50 transitions. [2022-04-15 10:46:42,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 6 states have internal predecessors, (26), 6 states have call successors, (6), 6 states have call predecessors, (6), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-15 10:46:42,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 50 transitions. [2022-04-15 10:46:42,594 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 10 states and 50 transitions. [2022-04-15 10:46:42,625 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 50 edges. 50 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 10:46:42,626 INFO L225 Difference]: With dead ends: 50 [2022-04-15 10:46:42,626 INFO L226 Difference]: Without dead ends: 45 [2022-04-15 10:46:42,626 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 61 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-15 10:46:42,627 INFO L913 BasicCegarLoop]: 20 mSDtfsCounter, 4 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 77 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 10:46:42,627 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [4 Valid, 77 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 10:46:42,627 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2022-04-15 10:46:42,665 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2022-04-15 10:46:42,665 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 10:46:42,665 INFO L82 GeneralOperation]: Start isEquivalent. First operand 45 states. Second operand has 45 states, 32 states have (on average 1.0625) internal successors, (34), 32 states have internal predecessors, (34), 7 states have call successors, (7), 7 states have call predecessors, (7), 5 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-15 10:46:42,665 INFO L74 IsIncluded]: Start isIncluded. First operand 45 states. Second operand has 45 states, 32 states have (on average 1.0625) internal successors, (34), 32 states have internal predecessors, (34), 7 states have call successors, (7), 7 states have call predecessors, (7), 5 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-15 10:46:42,665 INFO L87 Difference]: Start difference. First operand 45 states. Second operand has 45 states, 32 states have (on average 1.0625) internal successors, (34), 32 states have internal predecessors, (34), 7 states have call successors, (7), 7 states have call predecessors, (7), 5 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-15 10:46:42,666 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 10:46:42,666 INFO L93 Difference]: Finished difference Result 45 states and 46 transitions. [2022-04-15 10:46:42,666 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 46 transitions. [2022-04-15 10:46:42,666 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 10:46:42,666 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 10:46:42,667 INFO L74 IsIncluded]: Start isIncluded. First operand has 45 states, 32 states have (on average 1.0625) internal successors, (34), 32 states have internal predecessors, (34), 7 states have call successors, (7), 7 states have call predecessors, (7), 5 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand 45 states. [2022-04-15 10:46:42,667 INFO L87 Difference]: Start difference. First operand has 45 states, 32 states have (on average 1.0625) internal successors, (34), 32 states have internal predecessors, (34), 7 states have call successors, (7), 7 states have call predecessors, (7), 5 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand 45 states. [2022-04-15 10:46:42,668 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 10:46:42,668 INFO L93 Difference]: Finished difference Result 45 states and 46 transitions. [2022-04-15 10:46:42,668 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 46 transitions. [2022-04-15 10:46:42,668 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 10:46:42,668 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 10:46:42,668 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 10:46:42,668 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 10:46:42,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 32 states have (on average 1.0625) internal successors, (34), 32 states have internal predecessors, (34), 7 states have call successors, (7), 7 states have call predecessors, (7), 5 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-15 10:46:42,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 46 transitions. [2022-04-15 10:46:42,669 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 46 transitions. Word has length 36 [2022-04-15 10:46:42,669 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 10:46:42,669 INFO L478 AbstractCegarLoop]: Abstraction has 45 states and 46 transitions. [2022-04-15 10:46:42,669 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 6 states have internal predecessors, (26), 6 states have call successors, (6), 6 states have call predecessors, (6), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-15 10:46:42,669 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 45 states and 46 transitions. [2022-04-15 10:46:43,156 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-15 10:46:43,157 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 46 transitions. [2022-04-15 10:46:43,157 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2022-04-15 10:46:43,157 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 10:46:43,157 INFO L499 BasicCegarLoop]: trace histogram [5, 4, 4, 4, 4, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 10:46:43,175 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-15 10:46:43,357 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-15 10:46:43,358 INFO L403 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 10:46:43,358 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 10:46:43,358 INFO L85 PathProgramCache]: Analyzing trace with hash -1383171920, now seen corresponding path program 5 times [2022-04-15 10:46:43,358 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 10:46:43,358 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1910057381] [2022-04-15 10:46:43,439 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 4 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 10:46:43,440 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONLINEAR_UPDATE [2022-04-15 10:46:43,440 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 10:46:43,440 INFO L85 PathProgramCache]: Analyzing trace with hash -1383171920, now seen corresponding path program 6 times [2022-04-15 10:46:43,440 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 10:46:43,440 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1929763483] [2022-04-15 10:46:43,440 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 10:46:43,440 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 10:46:43,448 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 10:46:43,448 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2140667054] [2022-04-15 10:46:43,449 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-15 10:46:43,449 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 10:46:43,449 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 10:46:43,451 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-15 10:46:43,483 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-15 10:46:43,565 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2022-04-15 10:46:43,566 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 10:46:43,566 INFO L263 TraceCheckSpWp]: Trace formula consists of 144 conjuncts, 20 conjunts are in the unsatisfiable core [2022-04-15 10:46:43,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 10:46:43,575 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 10:46:43,894 INFO L272 TraceCheckUtils]: 0: Hoare triple {2878#true} call ULTIMATE.init(); {2878#true} is VALID [2022-04-15 10:46:43,894 INFO L290 TraceCheckUtils]: 1: Hoare triple {2878#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; {2878#true} is VALID [2022-04-15 10:46:43,894 INFO L290 TraceCheckUtils]: 2: Hoare triple {2878#true} assume true; {2878#true} is VALID [2022-04-15 10:46:43,894 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2878#true} {2878#true} #57#return; {2878#true} is VALID [2022-04-15 10:46:43,894 INFO L272 TraceCheckUtils]: 4: Hoare triple {2878#true} call #t~ret6 := main(); {2878#true} is VALID [2022-04-15 10:46:43,895 INFO L290 TraceCheckUtils]: 5: Hoare triple {2878#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;~y~0 := 0;~x~0 := 0;~c~0 := 0; {2898#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-15 10:46:43,895 INFO L290 TraceCheckUtils]: 6: Hoare triple {2898#(and (= main_~c~0 0) (= main_~y~0 0))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {2898#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-15 10:46:43,896 INFO L290 TraceCheckUtils]: 7: Hoare triple {2898#(and (= main_~c~0 0) (= main_~y~0 0))} assume !!(#t~post5 < 20);havoc #t~post5; {2898#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-15 10:46:43,896 INFO L272 TraceCheckUtils]: 8: Hoare triple {2898#(and (= main_~c~0 0) (= main_~y~0 0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {2878#true} is VALID [2022-04-15 10:46:43,896 INFO L290 TraceCheckUtils]: 9: Hoare triple {2878#true} ~cond := #in~cond; {2878#true} is VALID [2022-04-15 10:46:43,896 INFO L290 TraceCheckUtils]: 10: Hoare triple {2878#true} assume !(0 == ~cond); {2878#true} is VALID [2022-04-15 10:46:43,896 INFO L290 TraceCheckUtils]: 11: Hoare triple {2878#true} assume true; {2878#true} is VALID [2022-04-15 10:46:43,896 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {2878#true} {2898#(and (= main_~c~0 0) (= main_~y~0 0))} #51#return; {2898#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-15 10:46:43,897 INFO L290 TraceCheckUtils]: 13: Hoare triple {2898#(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 + ~x~0; {2923#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} is VALID [2022-04-15 10:46:43,897 INFO L290 TraceCheckUtils]: 14: Hoare triple {2923#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {2923#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} is VALID [2022-04-15 10:46:43,898 INFO L290 TraceCheckUtils]: 15: Hoare triple {2923#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} assume !!(#t~post5 < 20);havoc #t~post5; {2923#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} is VALID [2022-04-15 10:46:43,898 INFO L272 TraceCheckUtils]: 16: Hoare triple {2923#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {2878#true} is VALID [2022-04-15 10:46:43,898 INFO L290 TraceCheckUtils]: 17: Hoare triple {2878#true} ~cond := #in~cond; {2878#true} is VALID [2022-04-15 10:46:43,898 INFO L290 TraceCheckUtils]: 18: Hoare triple {2878#true} assume !(0 == ~cond); {2878#true} is VALID [2022-04-15 10:46:43,898 INFO L290 TraceCheckUtils]: 19: Hoare triple {2878#true} assume true; {2878#true} is VALID [2022-04-15 10:46:43,898 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {2878#true} {2923#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} #51#return; {2923#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} is VALID [2022-04-15 10:46:43,899 INFO L290 TraceCheckUtils]: 21: Hoare triple {2923#(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 + ~x~0; {2948#(and (= main_~y~0 2) (= main_~c~0 2))} is VALID [2022-04-15 10:46:43,899 INFO L290 TraceCheckUtils]: 22: Hoare triple {2948#(and (= main_~y~0 2) (= main_~c~0 2))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {2948#(and (= main_~y~0 2) (= main_~c~0 2))} is VALID [2022-04-15 10:46:43,900 INFO L290 TraceCheckUtils]: 23: Hoare triple {2948#(and (= main_~y~0 2) (= main_~c~0 2))} assume !!(#t~post5 < 20);havoc #t~post5; {2948#(and (= main_~y~0 2) (= main_~c~0 2))} is VALID [2022-04-15 10:46:43,900 INFO L272 TraceCheckUtils]: 24: Hoare triple {2948#(and (= main_~y~0 2) (= main_~c~0 2))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {2878#true} is VALID [2022-04-15 10:46:43,900 INFO L290 TraceCheckUtils]: 25: Hoare triple {2878#true} ~cond := #in~cond; {2878#true} is VALID [2022-04-15 10:46:43,900 INFO L290 TraceCheckUtils]: 26: Hoare triple {2878#true} assume !(0 == ~cond); {2878#true} is VALID [2022-04-15 10:46:43,900 INFO L290 TraceCheckUtils]: 27: Hoare triple {2878#true} assume true; {2878#true} is VALID [2022-04-15 10:46:43,900 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {2878#true} {2948#(and (= main_~y~0 2) (= main_~c~0 2))} #51#return; {2948#(and (= main_~y~0 2) (= main_~c~0 2))} is VALID [2022-04-15 10:46:43,901 INFO L290 TraceCheckUtils]: 29: Hoare triple {2948#(and (= main_~y~0 2) (= 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 + ~x~0; {2973#(and (= 2 (+ (- 1) main_~y~0)) (<= main_~c~0 3) (< 2 main_~k~0))} is VALID [2022-04-15 10:46:43,901 INFO L290 TraceCheckUtils]: 30: Hoare triple {2973#(and (= 2 (+ (- 1) main_~y~0)) (<= main_~c~0 3) (< 2 main_~k~0))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {2973#(and (= 2 (+ (- 1) main_~y~0)) (<= main_~c~0 3) (< 2 main_~k~0))} is VALID [2022-04-15 10:46:43,902 INFO L290 TraceCheckUtils]: 31: Hoare triple {2973#(and (= 2 (+ (- 1) main_~y~0)) (<= main_~c~0 3) (< 2 main_~k~0))} assume !!(#t~post5 < 20);havoc #t~post5; {2973#(and (= 2 (+ (- 1) main_~y~0)) (<= main_~c~0 3) (< 2 main_~k~0))} is VALID [2022-04-15 10:46:43,902 INFO L272 TraceCheckUtils]: 32: Hoare triple {2973#(and (= 2 (+ (- 1) main_~y~0)) (<= main_~c~0 3) (< 2 main_~k~0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {2878#true} is VALID [2022-04-15 10:46:43,902 INFO L290 TraceCheckUtils]: 33: Hoare triple {2878#true} ~cond := #in~cond; {2878#true} is VALID [2022-04-15 10:46:43,902 INFO L290 TraceCheckUtils]: 34: Hoare triple {2878#true} assume !(0 == ~cond); {2878#true} is VALID [2022-04-15 10:46:43,902 INFO L290 TraceCheckUtils]: 35: Hoare triple {2878#true} assume true; {2878#true} is VALID [2022-04-15 10:46:43,902 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {2878#true} {2973#(and (= 2 (+ (- 1) main_~y~0)) (<= main_~c~0 3) (< 2 main_~k~0))} #51#return; {2973#(and (= 2 (+ (- 1) main_~y~0)) (<= main_~c~0 3) (< 2 main_~k~0))} is VALID [2022-04-15 10:46:43,903 INFO L290 TraceCheckUtils]: 37: Hoare triple {2973#(and (= 2 (+ (- 1) main_~y~0)) (<= main_~c~0 3) (< 2 main_~k~0))} assume !(~c~0 < ~k~0); {2998#(and (= 2 (+ (- 1) main_~y~0)) (<= main_~k~0 3) (< 2 main_~k~0))} is VALID [2022-04-15 10:46:43,904 INFO L272 TraceCheckUtils]: 38: Hoare triple {2998#(and (= 2 (+ (- 1) main_~y~0)) (<= main_~k~0 3) (< 2 main_~k~0))} call __VERIFIER_assert((if 0 == ~k~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {3002#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 10:46:43,904 INFO L290 TraceCheckUtils]: 39: Hoare triple {3002#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {3006#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 10:46:43,904 INFO L290 TraceCheckUtils]: 40: Hoare triple {3006#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {2879#false} is VALID [2022-04-15 10:46:43,904 INFO L290 TraceCheckUtils]: 41: Hoare triple {2879#false} assume !false; {2879#false} is VALID [2022-04-15 10:46:43,905 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 8 proven. 24 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-04-15 10:46:43,905 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 10:46:44,221 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 10:46:44,221 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1929763483] [2022-04-15 10:46:44,221 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 10:46:44,221 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2140667054] [2022-04-15 10:46:44,222 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2140667054] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 10:46:44,222 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-15 10:46:44,222 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2022-04-15 10:46:44,222 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 10:46:44,222 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1910057381] [2022-04-15 10:46:44,222 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1910057381] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 10:46:44,222 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 10:46:44,222 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-04-15 10:46:44,222 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [856952848] [2022-04-15 10:46:44,222 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 10:46:44,223 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 6 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Word has length 42 [2022-04-15 10:46:44,223 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 10:46:44,223 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 9 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 6 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-15 10:46:44,244 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 33 edges. 33 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 10:46:44,245 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-04-15 10:46:44,245 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 10:46:44,245 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-04-15 10:46:44,245 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2022-04-15 10:46:44,245 INFO L87 Difference]: Start difference. First operand 45 states and 46 transitions. Second operand has 9 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 6 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-15 10:46:44,518 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 10:46:44,518 INFO L93 Difference]: Finished difference Result 52 states and 54 transitions. [2022-04-15 10:46:44,518 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-15 10:46:44,518 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 6 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Word has length 42 [2022-04-15 10:46:44,519 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 10:46:44,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 6 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-15 10:46:44,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 44 transitions. [2022-04-15 10:46:44,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 6 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-15 10:46:44,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 44 transitions. [2022-04-15 10:46:44,520 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 9 states and 44 transitions. [2022-04-15 10:46:44,547 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-15 10:46:44,548 INFO L225 Difference]: With dead ends: 52 [2022-04-15 10:46:44,548 INFO L226 Difference]: Without dead ends: 47 [2022-04-15 10:46:44,548 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 44 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-15 10:46:44,549 INFO L913 BasicCegarLoop]: 30 mSDtfsCounter, 2 mSDsluCounter, 138 mSDsCounter, 0 mSdLazyCounter, 102 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 168 SdHoareTripleChecker+Invalid, 102 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 102 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-15 10:46:44,549 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [2 Valid, 168 Invalid, 102 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 102 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-15 10:46:44,549 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2022-04-15 10:46:44,589 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2022-04-15 10:46:44,589 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 10:46:44,589 INFO L82 GeneralOperation]: Start isEquivalent. First operand 47 states. Second operand has 47 states, 33 states have (on average 1.0606060606060606) internal successors, (35), 33 states have internal predecessors, (35), 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-15 10:46:44,589 INFO L74 IsIncluded]: Start isIncluded. First operand 47 states. Second operand has 47 states, 33 states have (on average 1.0606060606060606) internal successors, (35), 33 states have internal predecessors, (35), 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-15 10:46:44,590 INFO L87 Difference]: Start difference. First operand 47 states. Second operand has 47 states, 33 states have (on average 1.0606060606060606) internal successors, (35), 33 states have internal predecessors, (35), 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-15 10:46:44,591 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 10:46:44,591 INFO L93 Difference]: Finished difference Result 47 states and 49 transitions. [2022-04-15 10:46:44,591 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 49 transitions. [2022-04-15 10:46:44,591 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 10:46:44,592 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 10:46:44,592 INFO L74 IsIncluded]: Start isIncluded. First operand has 47 states, 33 states have (on average 1.0606060606060606) internal successors, (35), 33 states have internal predecessors, (35), 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 47 states. [2022-04-15 10:46:44,592 INFO L87 Difference]: Start difference. First operand has 47 states, 33 states have (on average 1.0606060606060606) internal successors, (35), 33 states have internal predecessors, (35), 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 47 states. [2022-04-15 10:46:44,592 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 10:46:44,593 INFO L93 Difference]: Finished difference Result 47 states and 49 transitions. [2022-04-15 10:46:44,593 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 49 transitions. [2022-04-15 10:46:44,593 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 10:46:44,593 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 10:46:44,593 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 10:46:44,593 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 10:46:44,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 33 states have (on average 1.0606060606060606) internal successors, (35), 33 states have internal predecessors, (35), 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-15 10:46:44,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 49 transitions. [2022-04-15 10:46:44,594 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 49 transitions. Word has length 42 [2022-04-15 10:46:44,594 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 10:46:44,594 INFO L478 AbstractCegarLoop]: Abstraction has 47 states and 49 transitions. [2022-04-15 10:46:44,594 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 6 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-15 10:46:44,594 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 47 states and 49 transitions. [2022-04-15 10:46:45,083 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-15 10:46:45,083 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 49 transitions. [2022-04-15 10:46:45,083 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-04-15 10:46:45,083 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 10:46:45,083 INFO L499 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 10:46:45,103 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2022-04-15 10:46:45,284 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-15 10:46:45,284 INFO L403 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 10:46:45,284 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 10:46:45,284 INFO L85 PathProgramCache]: Analyzing trace with hash -1386691371, now seen corresponding path program 7 times [2022-04-15 10:46:45,284 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 10:46:45,284 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [252918460] [2022-04-15 10:46:45,360 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 4 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 10:46:45,360 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONLINEAR_UPDATE [2022-04-15 10:46:45,360 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 10:46:45,360 INFO L85 PathProgramCache]: Analyzing trace with hash -1386691371, now seen corresponding path program 8 times [2022-04-15 10:46:45,360 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 10:46:45,360 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [873507922] [2022-04-15 10:46:45,360 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 10:46:45,360 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 10:46:45,368 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 10:46:45,368 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2103203963] [2022-04-15 10:46:45,368 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 10:46:45,368 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 10:46:45,368 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 10:46:45,369 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-15 10:46:45,370 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-15 10:46:45,406 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-15 10:46:45,406 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 10:46:45,407 INFO L263 TraceCheckSpWp]: Trace formula consists of 155 conjuncts, 13 conjunts are in the unsatisfiable core [2022-04-15 10:46:45,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 10:46:45,419 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 10:46:45,649 INFO L272 TraceCheckUtils]: 0: Hoare triple {3353#true} call ULTIMATE.init(); {3353#true} is VALID [2022-04-15 10:46:45,650 INFO L290 TraceCheckUtils]: 1: Hoare triple {3353#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; {3361#(<= ~counter~0 0)} is VALID [2022-04-15 10:46:45,650 INFO L290 TraceCheckUtils]: 2: Hoare triple {3361#(<= ~counter~0 0)} assume true; {3361#(<= ~counter~0 0)} is VALID [2022-04-15 10:46:45,650 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3361#(<= ~counter~0 0)} {3353#true} #57#return; {3361#(<= ~counter~0 0)} is VALID [2022-04-15 10:46:45,650 INFO L272 TraceCheckUtils]: 4: Hoare triple {3361#(<= ~counter~0 0)} call #t~ret6 := main(); {3361#(<= ~counter~0 0)} is VALID [2022-04-15 10:46:45,651 INFO L290 TraceCheckUtils]: 5: Hoare triple {3361#(<= ~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;~y~0 := 0;~x~0 := 0;~c~0 := 0; {3361#(<= ~counter~0 0)} is VALID [2022-04-15 10:46:45,651 INFO L290 TraceCheckUtils]: 6: Hoare triple {3361#(<= ~counter~0 0)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {3377#(<= ~counter~0 1)} is VALID [2022-04-15 10:46:45,651 INFO L290 TraceCheckUtils]: 7: Hoare triple {3377#(<= ~counter~0 1)} assume !!(#t~post5 < 20);havoc #t~post5; {3377#(<= ~counter~0 1)} is VALID [2022-04-15 10:46:45,652 INFO L272 TraceCheckUtils]: 8: Hoare triple {3377#(<= ~counter~0 1)} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {3377#(<= ~counter~0 1)} is VALID [2022-04-15 10:46:45,652 INFO L290 TraceCheckUtils]: 9: Hoare triple {3377#(<= ~counter~0 1)} ~cond := #in~cond; {3377#(<= ~counter~0 1)} is VALID [2022-04-15 10:46:45,652 INFO L290 TraceCheckUtils]: 10: Hoare triple {3377#(<= ~counter~0 1)} assume !(0 == ~cond); {3377#(<= ~counter~0 1)} is VALID [2022-04-15 10:46:45,652 INFO L290 TraceCheckUtils]: 11: Hoare triple {3377#(<= ~counter~0 1)} assume true; {3377#(<= ~counter~0 1)} is VALID [2022-04-15 10:46:45,653 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {3377#(<= ~counter~0 1)} {3377#(<= ~counter~0 1)} #51#return; {3377#(<= ~counter~0 1)} is VALID [2022-04-15 10:46:45,653 INFO L290 TraceCheckUtils]: 13: Hoare triple {3377#(<= ~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 + ~x~0; {3377#(<= ~counter~0 1)} is VALID [2022-04-15 10:46:45,653 INFO L290 TraceCheckUtils]: 14: Hoare triple {3377#(<= ~counter~0 1)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {3402#(<= ~counter~0 2)} is VALID [2022-04-15 10:46:45,654 INFO L290 TraceCheckUtils]: 15: Hoare triple {3402#(<= ~counter~0 2)} assume !!(#t~post5 < 20);havoc #t~post5; {3402#(<= ~counter~0 2)} is VALID [2022-04-15 10:46:45,655 INFO L272 TraceCheckUtils]: 16: Hoare triple {3402#(<= ~counter~0 2)} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {3402#(<= ~counter~0 2)} is VALID [2022-04-15 10:46:45,655 INFO L290 TraceCheckUtils]: 17: Hoare triple {3402#(<= ~counter~0 2)} ~cond := #in~cond; {3402#(<= ~counter~0 2)} is VALID [2022-04-15 10:46:45,655 INFO L290 TraceCheckUtils]: 18: Hoare triple {3402#(<= ~counter~0 2)} assume !(0 == ~cond); {3402#(<= ~counter~0 2)} is VALID [2022-04-15 10:46:45,656 INFO L290 TraceCheckUtils]: 19: Hoare triple {3402#(<= ~counter~0 2)} assume true; {3402#(<= ~counter~0 2)} is VALID [2022-04-15 10:46:45,656 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {3402#(<= ~counter~0 2)} {3402#(<= ~counter~0 2)} #51#return; {3402#(<= ~counter~0 2)} is VALID [2022-04-15 10:46:45,656 INFO L290 TraceCheckUtils]: 21: Hoare triple {3402#(<= ~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 + ~x~0; {3402#(<= ~counter~0 2)} is VALID [2022-04-15 10:46:45,657 INFO L290 TraceCheckUtils]: 22: Hoare triple {3402#(<= ~counter~0 2)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {3427#(<= ~counter~0 3)} is VALID [2022-04-15 10:46:45,657 INFO L290 TraceCheckUtils]: 23: Hoare triple {3427#(<= ~counter~0 3)} assume !!(#t~post5 < 20);havoc #t~post5; {3427#(<= ~counter~0 3)} is VALID [2022-04-15 10:46:45,657 INFO L272 TraceCheckUtils]: 24: Hoare triple {3427#(<= ~counter~0 3)} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {3427#(<= ~counter~0 3)} is VALID [2022-04-15 10:46:45,657 INFO L290 TraceCheckUtils]: 25: Hoare triple {3427#(<= ~counter~0 3)} ~cond := #in~cond; {3427#(<= ~counter~0 3)} is VALID [2022-04-15 10:46:45,661 INFO L290 TraceCheckUtils]: 26: Hoare triple {3427#(<= ~counter~0 3)} assume !(0 == ~cond); {3427#(<= ~counter~0 3)} is VALID [2022-04-15 10:46:45,664 INFO L290 TraceCheckUtils]: 27: Hoare triple {3427#(<= ~counter~0 3)} assume true; {3427#(<= ~counter~0 3)} is VALID [2022-04-15 10:46:45,670 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {3427#(<= ~counter~0 3)} {3427#(<= ~counter~0 3)} #51#return; {3427#(<= ~counter~0 3)} is VALID [2022-04-15 10:46:45,670 INFO L290 TraceCheckUtils]: 29: Hoare triple {3427#(<= ~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 + ~x~0; {3427#(<= ~counter~0 3)} is VALID [2022-04-15 10:46:45,671 INFO L290 TraceCheckUtils]: 30: Hoare triple {3427#(<= ~counter~0 3)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {3452#(<= ~counter~0 4)} is VALID [2022-04-15 10:46:45,672 INFO L290 TraceCheckUtils]: 31: Hoare triple {3452#(<= ~counter~0 4)} assume !!(#t~post5 < 20);havoc #t~post5; {3452#(<= ~counter~0 4)} is VALID [2022-04-15 10:46:45,672 INFO L272 TraceCheckUtils]: 32: Hoare triple {3452#(<= ~counter~0 4)} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {3452#(<= ~counter~0 4)} is VALID [2022-04-15 10:46:45,673 INFO L290 TraceCheckUtils]: 33: Hoare triple {3452#(<= ~counter~0 4)} ~cond := #in~cond; {3452#(<= ~counter~0 4)} is VALID [2022-04-15 10:46:45,673 INFO L290 TraceCheckUtils]: 34: Hoare triple {3452#(<= ~counter~0 4)} assume !(0 == ~cond); {3452#(<= ~counter~0 4)} is VALID [2022-04-15 10:46:45,673 INFO L290 TraceCheckUtils]: 35: Hoare triple {3452#(<= ~counter~0 4)} assume true; {3452#(<= ~counter~0 4)} is VALID [2022-04-15 10:46:45,674 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {3452#(<= ~counter~0 4)} {3452#(<= ~counter~0 4)} #51#return; {3452#(<= ~counter~0 4)} is VALID [2022-04-15 10:46:45,674 INFO L290 TraceCheckUtils]: 37: Hoare triple {3452#(<= ~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 + ~x~0; {3452#(<= ~counter~0 4)} is VALID [2022-04-15 10:46:45,674 INFO L290 TraceCheckUtils]: 38: Hoare triple {3452#(<= ~counter~0 4)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {3477#(<= |main_#t~post5| 4)} is VALID [2022-04-15 10:46:45,675 INFO L290 TraceCheckUtils]: 39: Hoare triple {3477#(<= |main_#t~post5| 4)} assume !(#t~post5 < 20);havoc #t~post5; {3354#false} is VALID [2022-04-15 10:46:45,675 INFO L272 TraceCheckUtils]: 40: Hoare triple {3354#false} call __VERIFIER_assert((if 0 == ~k~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {3354#false} is VALID [2022-04-15 10:46:45,682 INFO L290 TraceCheckUtils]: 41: Hoare triple {3354#false} ~cond := #in~cond; {3354#false} is VALID [2022-04-15 10:46:45,682 INFO L290 TraceCheckUtils]: 42: Hoare triple {3354#false} assume 0 == ~cond; {3354#false} is VALID [2022-04-15 10:46:45,682 INFO L290 TraceCheckUtils]: 43: Hoare triple {3354#false} assume !false; {3354#false} is VALID [2022-04-15 10:46:45,682 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 8 proven. 56 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 10:46:45,683 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 10:46:45,928 INFO L290 TraceCheckUtils]: 43: Hoare triple {3354#false} assume !false; {3354#false} is VALID [2022-04-15 10:46:45,928 INFO L290 TraceCheckUtils]: 42: Hoare triple {3354#false} assume 0 == ~cond; {3354#false} is VALID [2022-04-15 10:46:45,928 INFO L290 TraceCheckUtils]: 41: Hoare triple {3354#false} ~cond := #in~cond; {3354#false} is VALID [2022-04-15 10:46:45,928 INFO L272 TraceCheckUtils]: 40: Hoare triple {3354#false} call __VERIFIER_assert((if 0 == ~k~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {3354#false} is VALID [2022-04-15 10:46:45,929 INFO L290 TraceCheckUtils]: 39: Hoare triple {3505#(< |main_#t~post5| 20)} assume !(#t~post5 < 20);havoc #t~post5; {3354#false} is VALID [2022-04-15 10:46:45,929 INFO L290 TraceCheckUtils]: 38: Hoare triple {3509#(< ~counter~0 20)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {3505#(< |main_#t~post5| 20)} is VALID [2022-04-15 10:46:45,929 INFO L290 TraceCheckUtils]: 37: Hoare triple {3509#(< ~counter~0 20)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {3509#(< ~counter~0 20)} is VALID [2022-04-15 10:46:45,930 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {3353#true} {3509#(< ~counter~0 20)} #51#return; {3509#(< ~counter~0 20)} is VALID [2022-04-15 10:46:45,930 INFO L290 TraceCheckUtils]: 35: Hoare triple {3353#true} assume true; {3353#true} is VALID [2022-04-15 10:46:45,930 INFO L290 TraceCheckUtils]: 34: Hoare triple {3353#true} assume !(0 == ~cond); {3353#true} is VALID [2022-04-15 10:46:45,930 INFO L290 TraceCheckUtils]: 33: Hoare triple {3353#true} ~cond := #in~cond; {3353#true} is VALID [2022-04-15 10:46:45,930 INFO L272 TraceCheckUtils]: 32: Hoare triple {3509#(< ~counter~0 20)} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {3353#true} is VALID [2022-04-15 10:46:45,930 INFO L290 TraceCheckUtils]: 31: Hoare triple {3509#(< ~counter~0 20)} assume !!(#t~post5 < 20);havoc #t~post5; {3509#(< ~counter~0 20)} is VALID [2022-04-15 10:46:45,931 INFO L290 TraceCheckUtils]: 30: Hoare triple {3534#(< ~counter~0 19)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {3509#(< ~counter~0 20)} is VALID [2022-04-15 10:46:45,931 INFO L290 TraceCheckUtils]: 29: Hoare triple {3534#(< ~counter~0 19)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {3534#(< ~counter~0 19)} is VALID [2022-04-15 10:46:45,932 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {3353#true} {3534#(< ~counter~0 19)} #51#return; {3534#(< ~counter~0 19)} is VALID [2022-04-15 10:46:45,932 INFO L290 TraceCheckUtils]: 27: Hoare triple {3353#true} assume true; {3353#true} is VALID [2022-04-15 10:46:45,932 INFO L290 TraceCheckUtils]: 26: Hoare triple {3353#true} assume !(0 == ~cond); {3353#true} is VALID [2022-04-15 10:46:45,932 INFO L290 TraceCheckUtils]: 25: Hoare triple {3353#true} ~cond := #in~cond; {3353#true} is VALID [2022-04-15 10:46:45,932 INFO L272 TraceCheckUtils]: 24: Hoare triple {3534#(< ~counter~0 19)} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {3353#true} is VALID [2022-04-15 10:46:45,932 INFO L290 TraceCheckUtils]: 23: Hoare triple {3534#(< ~counter~0 19)} assume !!(#t~post5 < 20);havoc #t~post5; {3534#(< ~counter~0 19)} is VALID [2022-04-15 10:46:45,933 INFO L290 TraceCheckUtils]: 22: Hoare triple {3559#(< ~counter~0 18)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {3534#(< ~counter~0 19)} is VALID [2022-04-15 10:46:45,933 INFO L290 TraceCheckUtils]: 21: Hoare triple {3559#(< ~counter~0 18)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {3559#(< ~counter~0 18)} is VALID [2022-04-15 10:46:45,933 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {3353#true} {3559#(< ~counter~0 18)} #51#return; {3559#(< ~counter~0 18)} is VALID [2022-04-15 10:46:45,933 INFO L290 TraceCheckUtils]: 19: Hoare triple {3353#true} assume true; {3353#true} is VALID [2022-04-15 10:46:45,933 INFO L290 TraceCheckUtils]: 18: Hoare triple {3353#true} assume !(0 == ~cond); {3353#true} is VALID [2022-04-15 10:46:45,934 INFO L290 TraceCheckUtils]: 17: Hoare triple {3353#true} ~cond := #in~cond; {3353#true} is VALID [2022-04-15 10:46:45,934 INFO L272 TraceCheckUtils]: 16: Hoare triple {3559#(< ~counter~0 18)} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {3353#true} is VALID [2022-04-15 10:46:45,934 INFO L290 TraceCheckUtils]: 15: Hoare triple {3559#(< ~counter~0 18)} assume !!(#t~post5 < 20);havoc #t~post5; {3559#(< ~counter~0 18)} is VALID [2022-04-15 10:46:45,934 INFO L290 TraceCheckUtils]: 14: Hoare triple {3584#(< ~counter~0 17)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {3559#(< ~counter~0 18)} is VALID [2022-04-15 10:46:45,935 INFO L290 TraceCheckUtils]: 13: Hoare triple {3584#(< ~counter~0 17)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {3584#(< ~counter~0 17)} is VALID [2022-04-15 10:46:45,935 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {3353#true} {3584#(< ~counter~0 17)} #51#return; {3584#(< ~counter~0 17)} is VALID [2022-04-15 10:46:45,935 INFO L290 TraceCheckUtils]: 11: Hoare triple {3353#true} assume true; {3353#true} is VALID [2022-04-15 10:46:45,935 INFO L290 TraceCheckUtils]: 10: Hoare triple {3353#true} assume !(0 == ~cond); {3353#true} is VALID [2022-04-15 10:46:45,935 INFO L290 TraceCheckUtils]: 9: Hoare triple {3353#true} ~cond := #in~cond; {3353#true} is VALID [2022-04-15 10:46:45,935 INFO L272 TraceCheckUtils]: 8: Hoare triple {3584#(< ~counter~0 17)} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {3353#true} is VALID [2022-04-15 10:46:45,936 INFO L290 TraceCheckUtils]: 7: Hoare triple {3584#(< ~counter~0 17)} assume !!(#t~post5 < 20);havoc #t~post5; {3584#(< ~counter~0 17)} is VALID [2022-04-15 10:46:45,936 INFO L290 TraceCheckUtils]: 6: Hoare triple {3609#(< ~counter~0 16)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {3584#(< ~counter~0 17)} is VALID [2022-04-15 10:46:45,936 INFO L290 TraceCheckUtils]: 5: Hoare triple {3609#(< ~counter~0 16)} 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;~y~0 := 0;~x~0 := 0;~c~0 := 0; {3609#(< ~counter~0 16)} is VALID [2022-04-15 10:46:45,937 INFO L272 TraceCheckUtils]: 4: Hoare triple {3609#(< ~counter~0 16)} call #t~ret6 := main(); {3609#(< ~counter~0 16)} is VALID [2022-04-15 10:46:45,937 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3609#(< ~counter~0 16)} {3353#true} #57#return; {3609#(< ~counter~0 16)} is VALID [2022-04-15 10:46:45,937 INFO L290 TraceCheckUtils]: 2: Hoare triple {3609#(< ~counter~0 16)} assume true; {3609#(< ~counter~0 16)} is VALID [2022-04-15 10:46:45,938 INFO L290 TraceCheckUtils]: 1: Hoare triple {3353#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; {3609#(< ~counter~0 16)} is VALID [2022-04-15 10:46:45,938 INFO L272 TraceCheckUtils]: 0: Hoare triple {3353#true} call ULTIMATE.init(); {3353#true} is VALID [2022-04-15 10:46:45,938 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 8 proven. 32 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-04-15 10:46:45,938 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 10:46:45,938 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [873507922] [2022-04-15 10:46:45,938 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 10:46:45,938 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2103203963] [2022-04-15 10:46:45,938 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2103203963] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 10:46:45,938 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-15 10:46:45,939 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 14 [2022-04-15 10:46:45,939 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 10:46:45,939 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [252918460] [2022-04-15 10:46:45,939 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [252918460] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 10:46:45,939 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 10:46:45,939 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-15 10:46:45,939 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1906089815] [2022-04-15 10:46:45,939 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 10:46:45,939 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.0) internal successors, (32), 7 states have internal predecessors, (32), 7 states have call successors, (7), 7 states have call predecessors, (7), 5 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Word has length 44 [2022-04-15 10:46:45,940 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 10:46:45,940 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 8 states, 8 states have (on average 4.0) internal successors, (32), 7 states have internal predecessors, (32), 7 states have call successors, (7), 7 states have call predecessors, (7), 5 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-15 10:46:45,968 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-15 10:46:45,968 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-15 10:46:45,969 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 10:46:45,969 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-15 10:46:45,969 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=111, Unknown=0, NotChecked=0, Total=182 [2022-04-15 10:46:45,969 INFO L87 Difference]: Start difference. First operand 47 states and 49 transitions. Second operand has 8 states, 8 states have (on average 4.0) internal successors, (32), 7 states have internal predecessors, (32), 7 states have call successors, (7), 7 states have call predecessors, (7), 5 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-15 10:46:46,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 10:46:46,113 INFO L93 Difference]: Finished difference Result 58 states and 59 transitions. [2022-04-15 10:46:46,113 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-04-15 10:46:46,113 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.0) internal successors, (32), 7 states have internal predecessors, (32), 7 states have call successors, (7), 7 states have call predecessors, (7), 5 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Word has length 44 [2022-04-15 10:46:46,113 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 10:46:46,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 4.0) internal successors, (32), 7 states have internal predecessors, (32), 7 states have call successors, (7), 7 states have call predecessors, (7), 5 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-15 10:46:46,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 58 transitions. [2022-04-15 10:46:46,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 4.0) internal successors, (32), 7 states have internal predecessors, (32), 7 states have call successors, (7), 7 states have call predecessors, (7), 5 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-15 10:46:46,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 58 transitions. [2022-04-15 10:46:46,115 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 12 states and 58 transitions. [2022-04-15 10:46:46,152 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 58 edges. 58 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 10:46:46,152 INFO L225 Difference]: With dead ends: 58 [2022-04-15 10:46:46,152 INFO L226 Difference]: Without dead ends: 53 [2022-04-15 10:46:46,153 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 75 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-15 10:46:46,153 INFO L913 BasicCegarLoop]: 21 mSDtfsCounter, 6 mSDsluCounter, 55 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 76 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 10:46:46,153 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [6 Valid, 76 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 10:46:46,153 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2022-04-15 10:46:46,202 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2022-04-15 10:46:46,202 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 10:46:46,202 INFO L82 GeneralOperation]: Start isEquivalent. First operand 53 states. Second operand has 53 states, 38 states have (on average 1.0526315789473684) internal successors, (40), 38 states have internal predecessors, (40), 8 states have call successors, (8), 8 states have call predecessors, (8), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-15 10:46:46,203 INFO L74 IsIncluded]: Start isIncluded. First operand 53 states. Second operand has 53 states, 38 states have (on average 1.0526315789473684) internal successors, (40), 38 states have internal predecessors, (40), 8 states have call successors, (8), 8 states have call predecessors, (8), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-15 10:46:46,203 INFO L87 Difference]: Start difference. First operand 53 states. Second operand has 53 states, 38 states have (on average 1.0526315789473684) internal successors, (40), 38 states have internal predecessors, (40), 8 states have call successors, (8), 8 states have call predecessors, (8), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-15 10:46:46,204 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 10:46:46,204 INFO L93 Difference]: Finished difference Result 53 states and 54 transitions. [2022-04-15 10:46:46,204 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 54 transitions. [2022-04-15 10:46:46,204 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 10:46:46,204 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 10:46:46,205 INFO L74 IsIncluded]: Start isIncluded. First operand has 53 states, 38 states have (on average 1.0526315789473684) internal successors, (40), 38 states have internal predecessors, (40), 8 states have call successors, (8), 8 states have call predecessors, (8), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand 53 states. [2022-04-15 10:46:46,205 INFO L87 Difference]: Start difference. First operand has 53 states, 38 states have (on average 1.0526315789473684) internal successors, (40), 38 states have internal predecessors, (40), 8 states have call successors, (8), 8 states have call predecessors, (8), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand 53 states. [2022-04-15 10:46:46,205 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 10:46:46,205 INFO L93 Difference]: Finished difference Result 53 states and 54 transitions. [2022-04-15 10:46:46,206 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 54 transitions. [2022-04-15 10:46:46,206 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 10:46:46,206 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 10:46:46,206 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 10:46:46,206 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 10:46:46,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 38 states have (on average 1.0526315789473684) internal successors, (40), 38 states have internal predecessors, (40), 8 states have call successors, (8), 8 states have call predecessors, (8), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-15 10:46:46,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 54 transitions. [2022-04-15 10:46:46,207 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 54 transitions. Word has length 44 [2022-04-15 10:46:46,207 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 10:46:46,207 INFO L478 AbstractCegarLoop]: Abstraction has 53 states and 54 transitions. [2022-04-15 10:46:46,207 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.0) internal successors, (32), 7 states have internal predecessors, (32), 7 states have call successors, (7), 7 states have call predecessors, (7), 5 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-15 10:46:46,207 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 53 states and 54 transitions. [2022-04-15 10:46:46,702 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-15 10:46:46,702 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 54 transitions. [2022-04-15 10:46:46,703 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2022-04-15 10:46:46,703 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 10:46:46,703 INFO L499 BasicCegarLoop]: trace histogram [6, 5, 5, 5, 5, 5, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 10:46:46,719 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-04-15 10:46:46,903 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-15 10:46:46,903 INFO L403 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 10:46:46,903 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 10:46:46,904 INFO L85 PathProgramCache]: Analyzing trace with hash 1037185971, now seen corresponding path program 7 times [2022-04-15 10:46:46,904 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 10:46:46,904 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [986400161] [2022-04-15 10:46:46,976 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 4 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 10:46:46,976 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONLINEAR_UPDATE [2022-04-15 10:46:46,976 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 10:46:46,976 INFO L85 PathProgramCache]: Analyzing trace with hash 1037185971, now seen corresponding path program 8 times [2022-04-15 10:46:46,976 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 10:46:46,976 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2106599080] [2022-04-15 10:46:46,976 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 10:46:46,976 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 10:46:46,988 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 10:46:46,988 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [696804071] [2022-04-15 10:46:46,989 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 10:46:46,989 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 10:46:46,989 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 10:46:46,989 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-15 10:46:47,009 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-15 10:46:47,104 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-15 10:46:47,104 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 10:46:47,105 INFO L263 TraceCheckSpWp]: Trace formula consists of 165 conjuncts, 24 conjunts are in the unsatisfiable core [2022-04-15 10:46:47,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 10:46:47,113 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 10:46:47,376 INFO L272 TraceCheckUtils]: 0: Hoare triple {3966#true} call ULTIMATE.init(); {3966#true} is VALID [2022-04-15 10:46:47,377 INFO L290 TraceCheckUtils]: 1: Hoare triple {3966#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; {3966#true} is VALID [2022-04-15 10:46:47,377 INFO L290 TraceCheckUtils]: 2: Hoare triple {3966#true} assume true; {3966#true} is VALID [2022-04-15 10:46:47,377 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3966#true} {3966#true} #57#return; {3966#true} is VALID [2022-04-15 10:46:47,377 INFO L272 TraceCheckUtils]: 4: Hoare triple {3966#true} call #t~ret6 := main(); {3966#true} is VALID [2022-04-15 10:46:47,397 INFO L290 TraceCheckUtils]: 5: Hoare triple {3966#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;~y~0 := 0;~x~0 := 0;~c~0 := 0; {3986#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-15 10:46:47,397 INFO L290 TraceCheckUtils]: 6: Hoare triple {3986#(and (= main_~c~0 0) (= main_~y~0 0))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {3986#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-15 10:46:47,397 INFO L290 TraceCheckUtils]: 7: Hoare triple {3986#(and (= main_~c~0 0) (= main_~y~0 0))} assume !!(#t~post5 < 20);havoc #t~post5; {3986#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-15 10:46:47,398 INFO L272 TraceCheckUtils]: 8: Hoare triple {3986#(and (= main_~c~0 0) (= main_~y~0 0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {3966#true} is VALID [2022-04-15 10:46:47,398 INFO L290 TraceCheckUtils]: 9: Hoare triple {3966#true} ~cond := #in~cond; {3966#true} is VALID [2022-04-15 10:46:47,398 INFO L290 TraceCheckUtils]: 10: Hoare triple {3966#true} assume !(0 == ~cond); {3966#true} is VALID [2022-04-15 10:46:47,398 INFO L290 TraceCheckUtils]: 11: Hoare triple {3966#true} assume true; {3966#true} is VALID [2022-04-15 10:46:47,398 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {3966#true} {3986#(and (= main_~c~0 0) (= main_~y~0 0))} #51#return; {3986#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-15 10:46:47,399 INFO L290 TraceCheckUtils]: 13: Hoare triple {3986#(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 + ~x~0; {4011#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} is VALID [2022-04-15 10:46:47,399 INFO L290 TraceCheckUtils]: 14: Hoare triple {4011#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {4011#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} is VALID [2022-04-15 10:46:47,399 INFO L290 TraceCheckUtils]: 15: Hoare triple {4011#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} assume !!(#t~post5 < 20);havoc #t~post5; {4011#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} is VALID [2022-04-15 10:46:47,399 INFO L272 TraceCheckUtils]: 16: Hoare triple {4011#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {3966#true} is VALID [2022-04-15 10:46:47,399 INFO L290 TraceCheckUtils]: 17: Hoare triple {3966#true} ~cond := #in~cond; {3966#true} is VALID [2022-04-15 10:46:47,400 INFO L290 TraceCheckUtils]: 18: Hoare triple {3966#true} assume !(0 == ~cond); {3966#true} is VALID [2022-04-15 10:46:47,400 INFO L290 TraceCheckUtils]: 19: Hoare triple {3966#true} assume true; {3966#true} is VALID [2022-04-15 10:46:47,400 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {3966#true} {4011#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} #51#return; {4011#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} is VALID [2022-04-15 10:46:47,400 INFO L290 TraceCheckUtils]: 21: Hoare triple {4011#(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 + ~x~0; {4036#(and (= main_~y~0 2) (= (+ (- 1) main_~c~0) 1))} is VALID [2022-04-15 10:46:47,401 INFO L290 TraceCheckUtils]: 22: Hoare triple {4036#(and (= main_~y~0 2) (= (+ (- 1) main_~c~0) 1))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {4036#(and (= main_~y~0 2) (= (+ (- 1) main_~c~0) 1))} is VALID [2022-04-15 10:46:47,401 INFO L290 TraceCheckUtils]: 23: Hoare triple {4036#(and (= main_~y~0 2) (= (+ (- 1) main_~c~0) 1))} assume !!(#t~post5 < 20);havoc #t~post5; {4036#(and (= main_~y~0 2) (= (+ (- 1) main_~c~0) 1))} is VALID [2022-04-15 10:46:47,401 INFO L272 TraceCheckUtils]: 24: Hoare triple {4036#(and (= main_~y~0 2) (= (+ (- 1) main_~c~0) 1))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {3966#true} is VALID [2022-04-15 10:46:47,401 INFO L290 TraceCheckUtils]: 25: Hoare triple {3966#true} ~cond := #in~cond; {3966#true} is VALID [2022-04-15 10:46:47,401 INFO L290 TraceCheckUtils]: 26: Hoare triple {3966#true} assume !(0 == ~cond); {3966#true} is VALID [2022-04-15 10:46:47,401 INFO L290 TraceCheckUtils]: 27: Hoare triple {3966#true} assume true; {3966#true} is VALID [2022-04-15 10:46:47,402 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {3966#true} {4036#(and (= main_~y~0 2) (= (+ (- 1) main_~c~0) 1))} #51#return; {4036#(and (= main_~y~0 2) (= (+ (- 1) main_~c~0) 1))} is VALID [2022-04-15 10:46:47,402 INFO L290 TraceCheckUtils]: 29: Hoare triple {4036#(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 + ~x~0; {4061#(and (= 2 (+ (- 1) main_~y~0)) (= (+ (- 2) main_~c~0) 1))} is VALID [2022-04-15 10:46:47,402 INFO L290 TraceCheckUtils]: 30: Hoare triple {4061#(and (= 2 (+ (- 1) main_~y~0)) (= (+ (- 2) main_~c~0) 1))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {4061#(and (= 2 (+ (- 1) main_~y~0)) (= (+ (- 2) main_~c~0) 1))} is VALID [2022-04-15 10:46:47,403 INFO L290 TraceCheckUtils]: 31: Hoare triple {4061#(and (= 2 (+ (- 1) main_~y~0)) (= (+ (- 2) main_~c~0) 1))} assume !!(#t~post5 < 20);havoc #t~post5; {4061#(and (= 2 (+ (- 1) main_~y~0)) (= (+ (- 2) main_~c~0) 1))} is VALID [2022-04-15 10:46:47,403 INFO L272 TraceCheckUtils]: 32: Hoare triple {4061#(and (= 2 (+ (- 1) main_~y~0)) (= (+ (- 2) main_~c~0) 1))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {3966#true} is VALID [2022-04-15 10:46:47,403 INFO L290 TraceCheckUtils]: 33: Hoare triple {3966#true} ~cond := #in~cond; {3966#true} is VALID [2022-04-15 10:46:47,403 INFO L290 TraceCheckUtils]: 34: Hoare triple {3966#true} assume !(0 == ~cond); {3966#true} is VALID [2022-04-15 10:46:47,403 INFO L290 TraceCheckUtils]: 35: Hoare triple {3966#true} assume true; {3966#true} is VALID [2022-04-15 10:46:47,403 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {3966#true} {4061#(and (= 2 (+ (- 1) main_~y~0)) (= (+ (- 2) main_~c~0) 1))} #51#return; {4061#(and (= 2 (+ (- 1) main_~y~0)) (= (+ (- 2) main_~c~0) 1))} is VALID [2022-04-15 10:46:47,404 INFO L290 TraceCheckUtils]: 37: Hoare triple {4061#(and (= 2 (+ (- 1) main_~y~0)) (= (+ (- 2) 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 + ~x~0; {4086#(and (< 3 main_~k~0) (= (+ (- 2) main_~y~0) 2) (<= main_~c~0 4))} is VALID [2022-04-15 10:46:47,404 INFO L290 TraceCheckUtils]: 38: Hoare triple {4086#(and (< 3 main_~k~0) (= (+ (- 2) main_~y~0) 2) (<= main_~c~0 4))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {4086#(and (< 3 main_~k~0) (= (+ (- 2) main_~y~0) 2) (<= main_~c~0 4))} is VALID [2022-04-15 10:46:47,405 INFO L290 TraceCheckUtils]: 39: Hoare triple {4086#(and (< 3 main_~k~0) (= (+ (- 2) main_~y~0) 2) (<= main_~c~0 4))} assume !!(#t~post5 < 20);havoc #t~post5; {4086#(and (< 3 main_~k~0) (= (+ (- 2) main_~y~0) 2) (<= main_~c~0 4))} is VALID [2022-04-15 10:46:47,405 INFO L272 TraceCheckUtils]: 40: Hoare triple {4086#(and (< 3 main_~k~0) (= (+ (- 2) main_~y~0) 2) (<= main_~c~0 4))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {3966#true} is VALID [2022-04-15 10:46:47,405 INFO L290 TraceCheckUtils]: 41: Hoare triple {3966#true} ~cond := #in~cond; {3966#true} is VALID [2022-04-15 10:46:47,405 INFO L290 TraceCheckUtils]: 42: Hoare triple {3966#true} assume !(0 == ~cond); {3966#true} is VALID [2022-04-15 10:46:47,405 INFO L290 TraceCheckUtils]: 43: Hoare triple {3966#true} assume true; {3966#true} is VALID [2022-04-15 10:46:47,405 INFO L284 TraceCheckUtils]: 44: Hoare quadruple {3966#true} {4086#(and (< 3 main_~k~0) (= (+ (- 2) main_~y~0) 2) (<= main_~c~0 4))} #51#return; {4086#(and (< 3 main_~k~0) (= (+ (- 2) main_~y~0) 2) (<= main_~c~0 4))} is VALID [2022-04-15 10:46:47,406 INFO L290 TraceCheckUtils]: 45: Hoare triple {4086#(and (< 3 main_~k~0) (= (+ (- 2) main_~y~0) 2) (<= main_~c~0 4))} assume !(~c~0 < ~k~0); {4111#(and (< 3 main_~k~0) (<= main_~k~0 4) (= (+ (- 2) main_~y~0) 2))} is VALID [2022-04-15 10:46:47,406 INFO L272 TraceCheckUtils]: 46: Hoare triple {4111#(and (< 3 main_~k~0) (<= main_~k~0 4) (= (+ (- 2) main_~y~0) 2))} call __VERIFIER_assert((if 0 == ~k~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {4115#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 10:46:47,407 INFO L290 TraceCheckUtils]: 47: Hoare triple {4115#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {4119#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 10:46:47,407 INFO L290 TraceCheckUtils]: 48: Hoare triple {4119#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {3967#false} is VALID [2022-04-15 10:46:47,407 INFO L290 TraceCheckUtils]: 49: Hoare triple {3967#false} assume !false; {3967#false} is VALID [2022-04-15 10:46:47,407 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 10 proven. 40 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2022-04-15 10:46:47,407 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 10:46:47,623 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 10:46:47,623 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2106599080] [2022-04-15 10:46:47,623 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 10:46:47,623 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [696804071] [2022-04-15 10:46:47,623 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [696804071] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 10:46:47,623 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-15 10:46:47,623 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2022-04-15 10:46:47,624 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 10:46:47,624 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [986400161] [2022-04-15 10:46:47,624 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [986400161] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 10:46:47,624 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 10:46:47,624 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-04-15 10:46:47,624 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [577261626] [2022-04-15 10:46:47,624 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 10:46:47,626 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 2.6666666666666665) internal successors, (24), 9 states have internal predecessors, (24), 7 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 50 [2022-04-15 10:46:47,626 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 10:46:47,627 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 10 states, 9 states have (on average 2.6666666666666665) internal successors, (24), 9 states have internal predecessors, (24), 7 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-15 10:46:47,650 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-15 10:46:47,650 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-04-15 10:46:47,650 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 10:46:47,650 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-04-15 10:46:47,650 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2022-04-15 10:46:47,651 INFO L87 Difference]: Start difference. First operand 53 states and 54 transitions. Second operand has 10 states, 9 states have (on average 2.6666666666666665) internal successors, (24), 9 states have internal predecessors, (24), 7 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-15 10:46:48,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 10:46:48,056 INFO L93 Difference]: Finished difference Result 60 states and 62 transitions. [2022-04-15 10:46:48,056 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-04-15 10:46:48,056 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 2.6666666666666665) internal successors, (24), 9 states have internal predecessors, (24), 7 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 50 [2022-04-15 10:46:48,057 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 10:46:48,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 9 states have (on average 2.6666666666666665) internal successors, (24), 9 states have internal predecessors, (24), 7 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-15 10:46:48,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 49 transitions. [2022-04-15 10:46:48,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 9 states have (on average 2.6666666666666665) internal successors, (24), 9 states have internal predecessors, (24), 7 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-15 10:46:48,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 49 transitions. [2022-04-15 10:46:48,058 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 10 states and 49 transitions. [2022-04-15 10:46:48,091 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-15 10:46:48,092 INFO L225 Difference]: With dead ends: 60 [2022-04-15 10:46:48,092 INFO L226 Difference]: Without dead ends: 55 [2022-04-15 10:46:48,092 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 51 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=167, Unknown=0, NotChecked=0, Total=210 [2022-04-15 10:46:48,097 INFO L913 BasicCegarLoop]: 34 mSDtfsCounter, 2 mSDsluCounter, 174 mSDsCounter, 0 mSdLazyCounter, 139 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 208 SdHoareTripleChecker+Invalid, 139 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 139 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-15 10:46:48,097 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [2 Valid, 208 Invalid, 139 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 139 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-15 10:46:48,097 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2022-04-15 10:46:48,152 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2022-04-15 10:46:48,152 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 10:46:48,153 INFO L82 GeneralOperation]: Start isEquivalent. First operand 55 states. Second operand has 55 states, 39 states have (on average 1.0512820512820513) internal successors, (41), 39 states have internal predecessors, (41), 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-15 10:46:48,153 INFO L74 IsIncluded]: Start isIncluded. First operand 55 states. Second operand has 55 states, 39 states have (on average 1.0512820512820513) internal successors, (41), 39 states have internal predecessors, (41), 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-15 10:46:48,153 INFO L87 Difference]: Start difference. First operand 55 states. Second operand has 55 states, 39 states have (on average 1.0512820512820513) internal successors, (41), 39 states have internal predecessors, (41), 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-15 10:46:48,159 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 10:46:48,160 INFO L93 Difference]: Finished difference Result 55 states and 57 transitions. [2022-04-15 10:46:48,160 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 57 transitions. [2022-04-15 10:46:48,164 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 10:46:48,164 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 10:46:48,165 INFO L74 IsIncluded]: Start isIncluded. First operand has 55 states, 39 states have (on average 1.0512820512820513) internal successors, (41), 39 states have internal predecessors, (41), 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 55 states. [2022-04-15 10:46:48,165 INFO L87 Difference]: Start difference. First operand has 55 states, 39 states have (on average 1.0512820512820513) internal successors, (41), 39 states have internal predecessors, (41), 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 55 states. [2022-04-15 10:46:48,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 10:46:48,172 INFO L93 Difference]: Finished difference Result 55 states and 57 transitions. [2022-04-15 10:46:48,172 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 57 transitions. [2022-04-15 10:46:48,173 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 10:46:48,173 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 10:46:48,173 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 10:46:48,173 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 10:46:48,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 39 states have (on average 1.0512820512820513) internal successors, (41), 39 states have internal predecessors, (41), 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-15 10:46:48,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 57 transitions. [2022-04-15 10:46:48,174 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 57 transitions. Word has length 50 [2022-04-15 10:46:48,174 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 10:46:48,174 INFO L478 AbstractCegarLoop]: Abstraction has 55 states and 57 transitions. [2022-04-15 10:46:48,174 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 2.6666666666666665) internal successors, (24), 9 states have internal predecessors, (24), 7 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-15 10:46:48,174 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 55 states and 57 transitions. [2022-04-15 10:46:48,672 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 57 edges. 57 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 10:46:48,673 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 57 transitions. [2022-04-15 10:46:48,673 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2022-04-15 10:46:48,673 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 10:46:48,673 INFO L499 BasicCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 10:46:48,680 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-15 10:46:48,873 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-15 10:46:48,874 INFO L403 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 10:46:48,874 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 10:46:48,874 INFO L85 PathProgramCache]: Analyzing trace with hash 999934744, now seen corresponding path program 9 times [2022-04-15 10:46:48,874 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 10:46:48,874 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2097990271] [2022-04-15 10:46:48,992 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 4 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 10:46:48,992 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONLINEAR_UPDATE [2022-04-15 10:46:48,992 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 10:46:48,992 INFO L85 PathProgramCache]: Analyzing trace with hash 999934744, now seen corresponding path program 10 times [2022-04-15 10:46:48,992 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 10:46:48,992 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [985488934] [2022-04-15 10:46:48,992 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 10:46:48,993 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 10:46:49,008 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 10:46:49,008 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2028365407] [2022-04-15 10:46:49,008 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-15 10:46:49,008 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 10:46:49,008 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 10:46:49,009 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-15 10:46:49,059 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-15 10:46:49,148 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-15 10:46:49,148 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 10:46:49,149 INFO L263 TraceCheckSpWp]: Trace formula consists of 176 conjuncts, 15 conjunts are in the unsatisfiable core [2022-04-15 10:46:49,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 10:46:49,162 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 10:46:49,467 INFO L272 TraceCheckUtils]: 0: Hoare triple {4514#true} call ULTIMATE.init(); {4514#true} is VALID [2022-04-15 10:46:49,467 INFO L290 TraceCheckUtils]: 1: Hoare triple {4514#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; {4522#(<= ~counter~0 0)} is VALID [2022-04-15 10:46:49,468 INFO L290 TraceCheckUtils]: 2: Hoare triple {4522#(<= ~counter~0 0)} assume true; {4522#(<= ~counter~0 0)} is VALID [2022-04-15 10:46:49,468 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4522#(<= ~counter~0 0)} {4514#true} #57#return; {4522#(<= ~counter~0 0)} is VALID [2022-04-15 10:46:49,468 INFO L272 TraceCheckUtils]: 4: Hoare triple {4522#(<= ~counter~0 0)} call #t~ret6 := main(); {4522#(<= ~counter~0 0)} is VALID [2022-04-15 10:46:49,469 INFO L290 TraceCheckUtils]: 5: Hoare triple {4522#(<= ~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;~y~0 := 0;~x~0 := 0;~c~0 := 0; {4522#(<= ~counter~0 0)} is VALID [2022-04-15 10:46:49,469 INFO L290 TraceCheckUtils]: 6: Hoare triple {4522#(<= ~counter~0 0)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {4538#(<= ~counter~0 1)} is VALID [2022-04-15 10:46:49,470 INFO L290 TraceCheckUtils]: 7: Hoare triple {4538#(<= ~counter~0 1)} assume !!(#t~post5 < 20);havoc #t~post5; {4538#(<= ~counter~0 1)} is VALID [2022-04-15 10:46:49,470 INFO L272 TraceCheckUtils]: 8: Hoare triple {4538#(<= ~counter~0 1)} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {4538#(<= ~counter~0 1)} is VALID [2022-04-15 10:46:49,470 INFO L290 TraceCheckUtils]: 9: Hoare triple {4538#(<= ~counter~0 1)} ~cond := #in~cond; {4538#(<= ~counter~0 1)} is VALID [2022-04-15 10:46:49,471 INFO L290 TraceCheckUtils]: 10: Hoare triple {4538#(<= ~counter~0 1)} assume !(0 == ~cond); {4538#(<= ~counter~0 1)} is VALID [2022-04-15 10:46:49,471 INFO L290 TraceCheckUtils]: 11: Hoare triple {4538#(<= ~counter~0 1)} assume true; {4538#(<= ~counter~0 1)} is VALID [2022-04-15 10:46:49,472 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {4538#(<= ~counter~0 1)} {4538#(<= ~counter~0 1)} #51#return; {4538#(<= ~counter~0 1)} is VALID [2022-04-15 10:46:49,472 INFO L290 TraceCheckUtils]: 13: Hoare triple {4538#(<= ~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 + ~x~0; {4538#(<= ~counter~0 1)} is VALID [2022-04-15 10:46:49,472 INFO L290 TraceCheckUtils]: 14: Hoare triple {4538#(<= ~counter~0 1)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {4563#(<= ~counter~0 2)} is VALID [2022-04-15 10:46:49,473 INFO L290 TraceCheckUtils]: 15: Hoare triple {4563#(<= ~counter~0 2)} assume !!(#t~post5 < 20);havoc #t~post5; {4563#(<= ~counter~0 2)} is VALID [2022-04-15 10:46:49,473 INFO L272 TraceCheckUtils]: 16: Hoare triple {4563#(<= ~counter~0 2)} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {4563#(<= ~counter~0 2)} is VALID [2022-04-15 10:46:49,473 INFO L290 TraceCheckUtils]: 17: Hoare triple {4563#(<= ~counter~0 2)} ~cond := #in~cond; {4563#(<= ~counter~0 2)} is VALID [2022-04-15 10:46:49,474 INFO L290 TraceCheckUtils]: 18: Hoare triple {4563#(<= ~counter~0 2)} assume !(0 == ~cond); {4563#(<= ~counter~0 2)} is VALID [2022-04-15 10:46:49,474 INFO L290 TraceCheckUtils]: 19: Hoare triple {4563#(<= ~counter~0 2)} assume true; {4563#(<= ~counter~0 2)} is VALID [2022-04-15 10:46:49,475 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {4563#(<= ~counter~0 2)} {4563#(<= ~counter~0 2)} #51#return; {4563#(<= ~counter~0 2)} is VALID [2022-04-15 10:46:49,475 INFO L290 TraceCheckUtils]: 21: Hoare triple {4563#(<= ~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 + ~x~0; {4563#(<= ~counter~0 2)} is VALID [2022-04-15 10:46:49,475 INFO L290 TraceCheckUtils]: 22: Hoare triple {4563#(<= ~counter~0 2)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {4588#(<= ~counter~0 3)} is VALID [2022-04-15 10:46:49,476 INFO L290 TraceCheckUtils]: 23: Hoare triple {4588#(<= ~counter~0 3)} assume !!(#t~post5 < 20);havoc #t~post5; {4588#(<= ~counter~0 3)} is VALID [2022-04-15 10:46:49,476 INFO L272 TraceCheckUtils]: 24: Hoare triple {4588#(<= ~counter~0 3)} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {4588#(<= ~counter~0 3)} is VALID [2022-04-15 10:46:49,477 INFO L290 TraceCheckUtils]: 25: Hoare triple {4588#(<= ~counter~0 3)} ~cond := #in~cond; {4588#(<= ~counter~0 3)} is VALID [2022-04-15 10:46:49,477 INFO L290 TraceCheckUtils]: 26: Hoare triple {4588#(<= ~counter~0 3)} assume !(0 == ~cond); {4588#(<= ~counter~0 3)} is VALID [2022-04-15 10:46:49,477 INFO L290 TraceCheckUtils]: 27: Hoare triple {4588#(<= ~counter~0 3)} assume true; {4588#(<= ~counter~0 3)} is VALID [2022-04-15 10:46:49,478 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {4588#(<= ~counter~0 3)} {4588#(<= ~counter~0 3)} #51#return; {4588#(<= ~counter~0 3)} is VALID [2022-04-15 10:46:49,478 INFO L290 TraceCheckUtils]: 29: Hoare triple {4588#(<= ~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 + ~x~0; {4588#(<= ~counter~0 3)} is VALID [2022-04-15 10:46:49,478 INFO L290 TraceCheckUtils]: 30: Hoare triple {4588#(<= ~counter~0 3)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {4613#(<= ~counter~0 4)} is VALID [2022-04-15 10:46:49,479 INFO L290 TraceCheckUtils]: 31: Hoare triple {4613#(<= ~counter~0 4)} assume !!(#t~post5 < 20);havoc #t~post5; {4613#(<= ~counter~0 4)} is VALID [2022-04-15 10:46:49,479 INFO L272 TraceCheckUtils]: 32: Hoare triple {4613#(<= ~counter~0 4)} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {4613#(<= ~counter~0 4)} is VALID [2022-04-15 10:46:49,479 INFO L290 TraceCheckUtils]: 33: Hoare triple {4613#(<= ~counter~0 4)} ~cond := #in~cond; {4613#(<= ~counter~0 4)} is VALID [2022-04-15 10:46:49,480 INFO L290 TraceCheckUtils]: 34: Hoare triple {4613#(<= ~counter~0 4)} assume !(0 == ~cond); {4613#(<= ~counter~0 4)} is VALID [2022-04-15 10:46:49,480 INFO L290 TraceCheckUtils]: 35: Hoare triple {4613#(<= ~counter~0 4)} assume true; {4613#(<= ~counter~0 4)} is VALID [2022-04-15 10:46:49,480 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {4613#(<= ~counter~0 4)} {4613#(<= ~counter~0 4)} #51#return; {4613#(<= ~counter~0 4)} is VALID [2022-04-15 10:46:49,481 INFO L290 TraceCheckUtils]: 37: Hoare triple {4613#(<= ~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 + ~x~0; {4613#(<= ~counter~0 4)} is VALID [2022-04-15 10:46:49,481 INFO L290 TraceCheckUtils]: 38: Hoare triple {4613#(<= ~counter~0 4)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {4638#(<= ~counter~0 5)} is VALID [2022-04-15 10:46:49,481 INFO L290 TraceCheckUtils]: 39: Hoare triple {4638#(<= ~counter~0 5)} assume !!(#t~post5 < 20);havoc #t~post5; {4638#(<= ~counter~0 5)} is VALID [2022-04-15 10:46:49,482 INFO L272 TraceCheckUtils]: 40: Hoare triple {4638#(<= ~counter~0 5)} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {4638#(<= ~counter~0 5)} is VALID [2022-04-15 10:46:49,482 INFO L290 TraceCheckUtils]: 41: Hoare triple {4638#(<= ~counter~0 5)} ~cond := #in~cond; {4638#(<= ~counter~0 5)} is VALID [2022-04-15 10:46:49,482 INFO L290 TraceCheckUtils]: 42: Hoare triple {4638#(<= ~counter~0 5)} assume !(0 == ~cond); {4638#(<= ~counter~0 5)} is VALID [2022-04-15 10:46:49,483 INFO L290 TraceCheckUtils]: 43: Hoare triple {4638#(<= ~counter~0 5)} assume true; {4638#(<= ~counter~0 5)} is VALID [2022-04-15 10:46:49,483 INFO L284 TraceCheckUtils]: 44: Hoare quadruple {4638#(<= ~counter~0 5)} {4638#(<= ~counter~0 5)} #51#return; {4638#(<= ~counter~0 5)} is VALID [2022-04-15 10:46:49,484 INFO L290 TraceCheckUtils]: 45: Hoare triple {4638#(<= ~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 + ~x~0; {4638#(<= ~counter~0 5)} is VALID [2022-04-15 10:46:49,484 INFO L290 TraceCheckUtils]: 46: Hoare triple {4638#(<= ~counter~0 5)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {4663#(<= |main_#t~post5| 5)} is VALID [2022-04-15 10:46:49,484 INFO L290 TraceCheckUtils]: 47: Hoare triple {4663#(<= |main_#t~post5| 5)} assume !(#t~post5 < 20);havoc #t~post5; {4515#false} is VALID [2022-04-15 10:46:49,484 INFO L272 TraceCheckUtils]: 48: Hoare triple {4515#false} call __VERIFIER_assert((if 0 == ~k~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {4515#false} is VALID [2022-04-15 10:46:49,484 INFO L290 TraceCheckUtils]: 49: Hoare triple {4515#false} ~cond := #in~cond; {4515#false} is VALID [2022-04-15 10:46:49,484 INFO L290 TraceCheckUtils]: 50: Hoare triple {4515#false} assume 0 == ~cond; {4515#false} is VALID [2022-04-15 10:46:49,485 INFO L290 TraceCheckUtils]: 51: Hoare triple {4515#false} assume !false; {4515#false} is VALID [2022-04-15 10:46:49,485 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 10 proven. 90 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 10:46:49,485 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 10:46:49,782 INFO L290 TraceCheckUtils]: 51: Hoare triple {4515#false} assume !false; {4515#false} is VALID [2022-04-15 10:46:49,782 INFO L290 TraceCheckUtils]: 50: Hoare triple {4515#false} assume 0 == ~cond; {4515#false} is VALID [2022-04-15 10:46:49,782 INFO L290 TraceCheckUtils]: 49: Hoare triple {4515#false} ~cond := #in~cond; {4515#false} is VALID [2022-04-15 10:46:49,782 INFO L272 TraceCheckUtils]: 48: Hoare triple {4515#false} call __VERIFIER_assert((if 0 == ~k~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {4515#false} is VALID [2022-04-15 10:46:49,782 INFO L290 TraceCheckUtils]: 47: Hoare triple {4691#(< |main_#t~post5| 20)} assume !(#t~post5 < 20);havoc #t~post5; {4515#false} is VALID [2022-04-15 10:46:49,783 INFO L290 TraceCheckUtils]: 46: Hoare triple {4695#(< ~counter~0 20)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {4691#(< |main_#t~post5| 20)} is VALID [2022-04-15 10:46:49,783 INFO L290 TraceCheckUtils]: 45: Hoare triple {4695#(< ~counter~0 20)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {4695#(< ~counter~0 20)} is VALID [2022-04-15 10:46:49,783 INFO L284 TraceCheckUtils]: 44: Hoare quadruple {4514#true} {4695#(< ~counter~0 20)} #51#return; {4695#(< ~counter~0 20)} is VALID [2022-04-15 10:46:49,783 INFO L290 TraceCheckUtils]: 43: Hoare triple {4514#true} assume true; {4514#true} is VALID [2022-04-15 10:46:49,784 INFO L290 TraceCheckUtils]: 42: Hoare triple {4514#true} assume !(0 == ~cond); {4514#true} is VALID [2022-04-15 10:46:49,784 INFO L290 TraceCheckUtils]: 41: Hoare triple {4514#true} ~cond := #in~cond; {4514#true} is VALID [2022-04-15 10:46:49,784 INFO L272 TraceCheckUtils]: 40: Hoare triple {4695#(< ~counter~0 20)} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {4514#true} is VALID [2022-04-15 10:46:49,784 INFO L290 TraceCheckUtils]: 39: Hoare triple {4695#(< ~counter~0 20)} assume !!(#t~post5 < 20);havoc #t~post5; {4695#(< ~counter~0 20)} is VALID [2022-04-15 10:46:49,784 INFO L290 TraceCheckUtils]: 38: Hoare triple {4720#(< ~counter~0 19)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {4695#(< ~counter~0 20)} is VALID [2022-04-15 10:46:49,785 INFO L290 TraceCheckUtils]: 37: Hoare triple {4720#(< ~counter~0 19)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {4720#(< ~counter~0 19)} is VALID [2022-04-15 10:46:49,785 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {4514#true} {4720#(< ~counter~0 19)} #51#return; {4720#(< ~counter~0 19)} is VALID [2022-04-15 10:46:49,785 INFO L290 TraceCheckUtils]: 35: Hoare triple {4514#true} assume true; {4514#true} is VALID [2022-04-15 10:46:49,785 INFO L290 TraceCheckUtils]: 34: Hoare triple {4514#true} assume !(0 == ~cond); {4514#true} is VALID [2022-04-15 10:46:49,785 INFO L290 TraceCheckUtils]: 33: Hoare triple {4514#true} ~cond := #in~cond; {4514#true} is VALID [2022-04-15 10:46:49,785 INFO L272 TraceCheckUtils]: 32: Hoare triple {4720#(< ~counter~0 19)} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {4514#true} is VALID [2022-04-15 10:46:49,786 INFO L290 TraceCheckUtils]: 31: Hoare triple {4720#(< ~counter~0 19)} assume !!(#t~post5 < 20);havoc #t~post5; {4720#(< ~counter~0 19)} is VALID [2022-04-15 10:46:49,786 INFO L290 TraceCheckUtils]: 30: Hoare triple {4745#(< ~counter~0 18)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {4720#(< ~counter~0 19)} is VALID [2022-04-15 10:46:49,786 INFO L290 TraceCheckUtils]: 29: Hoare triple {4745#(< ~counter~0 18)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {4745#(< ~counter~0 18)} is VALID [2022-04-15 10:46:49,787 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {4514#true} {4745#(< ~counter~0 18)} #51#return; {4745#(< ~counter~0 18)} is VALID [2022-04-15 10:46:49,787 INFO L290 TraceCheckUtils]: 27: Hoare triple {4514#true} assume true; {4514#true} is VALID [2022-04-15 10:46:49,787 INFO L290 TraceCheckUtils]: 26: Hoare triple {4514#true} assume !(0 == ~cond); {4514#true} is VALID [2022-04-15 10:46:49,787 INFO L290 TraceCheckUtils]: 25: Hoare triple {4514#true} ~cond := #in~cond; {4514#true} is VALID [2022-04-15 10:46:49,787 INFO L272 TraceCheckUtils]: 24: Hoare triple {4745#(< ~counter~0 18)} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {4514#true} is VALID [2022-04-15 10:46:49,787 INFO L290 TraceCheckUtils]: 23: Hoare triple {4745#(< ~counter~0 18)} assume !!(#t~post5 < 20);havoc #t~post5; {4745#(< ~counter~0 18)} is VALID [2022-04-15 10:46:49,788 INFO L290 TraceCheckUtils]: 22: Hoare triple {4770#(< ~counter~0 17)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {4745#(< ~counter~0 18)} is VALID [2022-04-15 10:46:49,788 INFO L290 TraceCheckUtils]: 21: Hoare triple {4770#(< ~counter~0 17)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {4770#(< ~counter~0 17)} is VALID [2022-04-15 10:46:49,789 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {4514#true} {4770#(< ~counter~0 17)} #51#return; {4770#(< ~counter~0 17)} is VALID [2022-04-15 10:46:49,789 INFO L290 TraceCheckUtils]: 19: Hoare triple {4514#true} assume true; {4514#true} is VALID [2022-04-15 10:46:49,789 INFO L290 TraceCheckUtils]: 18: Hoare triple {4514#true} assume !(0 == ~cond); {4514#true} is VALID [2022-04-15 10:46:49,789 INFO L290 TraceCheckUtils]: 17: Hoare triple {4514#true} ~cond := #in~cond; {4514#true} is VALID [2022-04-15 10:46:49,789 INFO L272 TraceCheckUtils]: 16: Hoare triple {4770#(< ~counter~0 17)} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {4514#true} is VALID [2022-04-15 10:46:49,789 INFO L290 TraceCheckUtils]: 15: Hoare triple {4770#(< ~counter~0 17)} assume !!(#t~post5 < 20);havoc #t~post5; {4770#(< ~counter~0 17)} is VALID [2022-04-15 10:46:49,790 INFO L290 TraceCheckUtils]: 14: Hoare triple {4795#(< ~counter~0 16)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {4770#(< ~counter~0 17)} is VALID [2022-04-15 10:46:49,790 INFO L290 TraceCheckUtils]: 13: Hoare triple {4795#(< ~counter~0 16)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {4795#(< ~counter~0 16)} is VALID [2022-04-15 10:46:49,790 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {4514#true} {4795#(< ~counter~0 16)} #51#return; {4795#(< ~counter~0 16)} is VALID [2022-04-15 10:46:49,790 INFO L290 TraceCheckUtils]: 11: Hoare triple {4514#true} assume true; {4514#true} is VALID [2022-04-15 10:46:49,791 INFO L290 TraceCheckUtils]: 10: Hoare triple {4514#true} assume !(0 == ~cond); {4514#true} is VALID [2022-04-15 10:46:49,791 INFO L290 TraceCheckUtils]: 9: Hoare triple {4514#true} ~cond := #in~cond; {4514#true} is VALID [2022-04-15 10:46:49,791 INFO L272 TraceCheckUtils]: 8: Hoare triple {4795#(< ~counter~0 16)} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {4514#true} is VALID [2022-04-15 10:46:49,791 INFO L290 TraceCheckUtils]: 7: Hoare triple {4795#(< ~counter~0 16)} assume !!(#t~post5 < 20);havoc #t~post5; {4795#(< ~counter~0 16)} is VALID [2022-04-15 10:46:49,791 INFO L290 TraceCheckUtils]: 6: Hoare triple {4820#(< ~counter~0 15)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {4795#(< ~counter~0 16)} is VALID [2022-04-15 10:46:49,792 INFO L290 TraceCheckUtils]: 5: Hoare triple {4820#(< ~counter~0 15)} 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;~y~0 := 0;~x~0 := 0;~c~0 := 0; {4820#(< ~counter~0 15)} is VALID [2022-04-15 10:46:49,792 INFO L272 TraceCheckUtils]: 4: Hoare triple {4820#(< ~counter~0 15)} call #t~ret6 := main(); {4820#(< ~counter~0 15)} is VALID [2022-04-15 10:46:49,792 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4820#(< ~counter~0 15)} {4514#true} #57#return; {4820#(< ~counter~0 15)} is VALID [2022-04-15 10:46:49,793 INFO L290 TraceCheckUtils]: 2: Hoare triple {4820#(< ~counter~0 15)} assume true; {4820#(< ~counter~0 15)} is VALID [2022-04-15 10:46:49,793 INFO L290 TraceCheckUtils]: 1: Hoare triple {4514#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; {4820#(< ~counter~0 15)} is VALID [2022-04-15 10:46:49,793 INFO L272 TraceCheckUtils]: 0: Hoare triple {4514#true} call ULTIMATE.init(); {4514#true} is VALID [2022-04-15 10:46:49,793 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 10 proven. 50 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2022-04-15 10:46:49,793 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 10:46:49,793 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [985488934] [2022-04-15 10:46:49,794 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 10:46:49,794 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2028365407] [2022-04-15 10:46:49,794 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2028365407] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 10:46:49,794 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-15 10:46:49,794 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 16 [2022-04-15 10:46:49,794 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 10:46:49,794 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2097990271] [2022-04-15 10:46:49,794 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2097990271] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 10:46:49,794 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 10:46:49,794 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-04-15 10:46:49,794 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [741252495] [2022-04-15 10:46:49,794 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 10:46:49,795 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.222222222222222) internal successors, (38), 8 states have internal predecessors, (38), 8 states have call successors, (8), 8 states have call predecessors, (8), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 52 [2022-04-15 10:46:49,795 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 10:46:49,795 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 9 states, 9 states have (on average 4.222222222222222) internal successors, (38), 8 states have internal predecessors, (38), 8 states have call successors, (8), 8 states have call predecessors, (8), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-15 10:46:49,834 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 52 edges. 52 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 10:46:49,834 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-04-15 10:46:49,834 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 10:46:49,834 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-04-15 10:46:49,834 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=96, Invalid=144, Unknown=0, NotChecked=0, Total=240 [2022-04-15 10:46:49,835 INFO L87 Difference]: Start difference. First operand 55 states and 57 transitions. Second operand has 9 states, 9 states have (on average 4.222222222222222) internal successors, (38), 8 states have internal predecessors, (38), 8 states have call successors, (8), 8 states have call predecessors, (8), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-15 10:46:50,011 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 10:46:50,011 INFO L93 Difference]: Finished difference Result 66 states and 67 transitions. [2022-04-15 10:46:50,011 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-04-15 10:46:50,011 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.222222222222222) internal successors, (38), 8 states have internal predecessors, (38), 8 states have call successors, (8), 8 states have call predecessors, (8), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 52 [2022-04-15 10:46:50,011 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 10:46:50,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 4.222222222222222) internal successors, (38), 8 states have internal predecessors, (38), 8 states have call successors, (8), 8 states have call predecessors, (8), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-15 10:46:50,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 66 transitions. [2022-04-15 10:46:50,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 4.222222222222222) internal successors, (38), 8 states have internal predecessors, (38), 8 states have call successors, (8), 8 states have call predecessors, (8), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-15 10:46:50,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 66 transitions. [2022-04-15 10:46:50,013 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 14 states and 66 transitions. [2022-04-15 10:46:50,056 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-15 10:46:50,057 INFO L225 Difference]: With dead ends: 66 [2022-04-15 10:46:50,057 INFO L226 Difference]: Without dead ends: 61 [2022-04-15 10:46:50,057 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 89 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=171, Invalid=249, Unknown=0, NotChecked=0, Total=420 [2022-04-15 10:46:50,057 INFO L913 BasicCegarLoop]: 22 mSDtfsCounter, 6 mSDsluCounter, 60 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 82 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 10:46:50,058 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [6 Valid, 82 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 10:46:50,058 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2022-04-15 10:46:50,121 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2022-04-15 10:46:50,121 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 10:46:50,121 INFO L82 GeneralOperation]: Start isEquivalent. First operand 61 states. Second operand has 61 states, 44 states have (on average 1.0454545454545454) internal successors, (46), 44 states have internal predecessors, (46), 9 states have call successors, (9), 9 states have call predecessors, (9), 7 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-15 10:46:50,121 INFO L74 IsIncluded]: Start isIncluded. First operand 61 states. Second operand has 61 states, 44 states have (on average 1.0454545454545454) internal successors, (46), 44 states have internal predecessors, (46), 9 states have call successors, (9), 9 states have call predecessors, (9), 7 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-15 10:46:50,121 INFO L87 Difference]: Start difference. First operand 61 states. Second operand has 61 states, 44 states have (on average 1.0454545454545454) internal successors, (46), 44 states have internal predecessors, (46), 9 states have call successors, (9), 9 states have call predecessors, (9), 7 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-15 10:46:50,122 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 10:46:50,122 INFO L93 Difference]: Finished difference Result 61 states and 62 transitions. [2022-04-15 10:46:50,122 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 62 transitions. [2022-04-15 10:46:50,122 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 10:46:50,123 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 10:46:50,123 INFO L74 IsIncluded]: Start isIncluded. First operand has 61 states, 44 states have (on average 1.0454545454545454) internal successors, (46), 44 states have internal predecessors, (46), 9 states have call successors, (9), 9 states have call predecessors, (9), 7 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Second operand 61 states. [2022-04-15 10:46:50,123 INFO L87 Difference]: Start difference. First operand has 61 states, 44 states have (on average 1.0454545454545454) internal successors, (46), 44 states have internal predecessors, (46), 9 states have call successors, (9), 9 states have call predecessors, (9), 7 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Second operand 61 states. [2022-04-15 10:46:50,127 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 10:46:50,127 INFO L93 Difference]: Finished difference Result 61 states and 62 transitions. [2022-04-15 10:46:50,131 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 62 transitions. [2022-04-15 10:46:50,131 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 10:46:50,131 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 10:46:50,131 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 10:46:50,131 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 10:46:50,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 44 states have (on average 1.0454545454545454) internal successors, (46), 44 states have internal predecessors, (46), 9 states have call successors, (9), 9 states have call predecessors, (9), 7 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-15 10:46:50,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 62 transitions. [2022-04-15 10:46:50,138 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 62 transitions. Word has length 52 [2022-04-15 10:46:50,138 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 10:46:50,138 INFO L478 AbstractCegarLoop]: Abstraction has 61 states and 62 transitions. [2022-04-15 10:46:50,138 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.222222222222222) internal successors, (38), 8 states have internal predecessors, (38), 8 states have call successors, (8), 8 states have call predecessors, (8), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-15 10:46:50,138 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 61 states and 62 transitions. [2022-04-15 10:46:50,635 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-15 10:46:50,636 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 62 transitions. [2022-04-15 10:46:50,636 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2022-04-15 10:46:50,636 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 10:46:50,636 INFO L499 BasicCegarLoop]: trace histogram [7, 6, 6, 6, 6, 6, 6, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 10:46:50,640 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2022-04-15 10:46:50,840 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-15 10:46:50,841 INFO L403 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 10:46:50,841 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 10:46:50,841 INFO L85 PathProgramCache]: Analyzing trace with hash -1795671114, now seen corresponding path program 9 times [2022-04-15 10:46:50,841 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 10:46:50,841 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [634771159] [2022-04-15 10:46:50,938 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 4 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 10:46:50,938 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONLINEAR_UPDATE [2022-04-15 10:46:50,938 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 10:46:50,938 INFO L85 PathProgramCache]: Analyzing trace with hash -1795671114, now seen corresponding path program 10 times [2022-04-15 10:46:50,939 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 10:46:50,939 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1951567719] [2022-04-15 10:46:50,939 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 10:46:50,939 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 10:46:50,946 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 10:46:50,947 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [177870483] [2022-04-15 10:46:50,947 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-15 10:46:50,947 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 10:46:50,947 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 10:46:50,964 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-15 10:46:50,976 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-15 10:46:51,245 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-15 10:46:51,245 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 10:46:51,247 INFO L263 TraceCheckSpWp]: Trace formula consists of 186 conjuncts, 28 conjunts are in the unsatisfiable core [2022-04-15 10:46:51,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 10:46:51,258 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 10:46:51,663 INFO L272 TraceCheckUtils]: 0: Hoare triple {5227#true} call ULTIMATE.init(); {5227#true} is VALID [2022-04-15 10:46:51,663 INFO L290 TraceCheckUtils]: 1: Hoare triple {5227#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; {5227#true} is VALID [2022-04-15 10:46:51,663 INFO L290 TraceCheckUtils]: 2: Hoare triple {5227#true} assume true; {5227#true} is VALID [2022-04-15 10:46:51,663 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5227#true} {5227#true} #57#return; {5227#true} is VALID [2022-04-15 10:46:51,663 INFO L272 TraceCheckUtils]: 4: Hoare triple {5227#true} call #t~ret6 := main(); {5227#true} is VALID [2022-04-15 10:46:51,664 INFO L290 TraceCheckUtils]: 5: Hoare triple {5227#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;~y~0 := 0;~x~0 := 0;~c~0 := 0; {5247#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-15 10:46:51,664 INFO L290 TraceCheckUtils]: 6: Hoare triple {5247#(and (= main_~c~0 0) (= main_~y~0 0))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {5247#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-15 10:46:51,665 INFO L290 TraceCheckUtils]: 7: Hoare triple {5247#(and (= main_~c~0 0) (= main_~y~0 0))} assume !!(#t~post5 < 20);havoc #t~post5; {5247#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-15 10:46:51,665 INFO L272 TraceCheckUtils]: 8: Hoare triple {5247#(and (= main_~c~0 0) (= main_~y~0 0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {5227#true} is VALID [2022-04-15 10:46:51,665 INFO L290 TraceCheckUtils]: 9: Hoare triple {5227#true} ~cond := #in~cond; {5227#true} is VALID [2022-04-15 10:46:51,665 INFO L290 TraceCheckUtils]: 10: Hoare triple {5227#true} assume !(0 == ~cond); {5227#true} is VALID [2022-04-15 10:46:51,665 INFO L290 TraceCheckUtils]: 11: Hoare triple {5227#true} assume true; {5227#true} is VALID [2022-04-15 10:46:51,665 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {5227#true} {5247#(and (= main_~c~0 0) (= main_~y~0 0))} #51#return; {5247#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-15 10:46:51,666 INFO L290 TraceCheckUtils]: 13: Hoare triple {5247#(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 + ~x~0; {5272#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} is VALID [2022-04-15 10:46:51,666 INFO L290 TraceCheckUtils]: 14: Hoare triple {5272#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {5272#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} is VALID [2022-04-15 10:46:51,667 INFO L290 TraceCheckUtils]: 15: Hoare triple {5272#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} assume !!(#t~post5 < 20);havoc #t~post5; {5272#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} is VALID [2022-04-15 10:46:51,667 INFO L272 TraceCheckUtils]: 16: Hoare triple {5272#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {5227#true} is VALID [2022-04-15 10:46:51,667 INFO L290 TraceCheckUtils]: 17: Hoare triple {5227#true} ~cond := #in~cond; {5227#true} is VALID [2022-04-15 10:46:51,667 INFO L290 TraceCheckUtils]: 18: Hoare triple {5227#true} assume !(0 == ~cond); {5227#true} is VALID [2022-04-15 10:46:51,667 INFO L290 TraceCheckUtils]: 19: Hoare triple {5227#true} assume true; {5227#true} is VALID [2022-04-15 10:46:51,667 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {5227#true} {5272#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} #51#return; {5272#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} is VALID [2022-04-15 10:46:51,668 INFO L290 TraceCheckUtils]: 21: Hoare triple {5272#(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 + ~x~0; {5297#(and (= main_~y~0 2) (= 0 (+ (- 2) main_~c~0)))} is VALID [2022-04-15 10:46:51,668 INFO L290 TraceCheckUtils]: 22: Hoare triple {5297#(and (= main_~y~0 2) (= 0 (+ (- 2) main_~c~0)))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {5297#(and (= main_~y~0 2) (= 0 (+ (- 2) main_~c~0)))} is VALID [2022-04-15 10:46:51,669 INFO L290 TraceCheckUtils]: 23: Hoare triple {5297#(and (= main_~y~0 2) (= 0 (+ (- 2) main_~c~0)))} assume !!(#t~post5 < 20);havoc #t~post5; {5297#(and (= main_~y~0 2) (= 0 (+ (- 2) main_~c~0)))} is VALID [2022-04-15 10:46:51,669 INFO L272 TraceCheckUtils]: 24: Hoare triple {5297#(and (= main_~y~0 2) (= 0 (+ (- 2) main_~c~0)))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {5227#true} is VALID [2022-04-15 10:46:51,669 INFO L290 TraceCheckUtils]: 25: Hoare triple {5227#true} ~cond := #in~cond; {5227#true} is VALID [2022-04-15 10:46:51,669 INFO L290 TraceCheckUtils]: 26: Hoare triple {5227#true} assume !(0 == ~cond); {5227#true} is VALID [2022-04-15 10:46:51,669 INFO L290 TraceCheckUtils]: 27: Hoare triple {5227#true} assume true; {5227#true} is VALID [2022-04-15 10:46:51,669 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {5227#true} {5297#(and (= main_~y~0 2) (= 0 (+ (- 2) main_~c~0)))} #51#return; {5297#(and (= main_~y~0 2) (= 0 (+ (- 2) main_~c~0)))} is VALID [2022-04-15 10:46:51,670 INFO L290 TraceCheckUtils]: 29: Hoare triple {5297#(and (= main_~y~0 2) (= 0 (+ (- 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 + ~x~0; {5322#(and (= (+ main_~c~0 (- 3)) 0) (= main_~y~0 3))} is VALID [2022-04-15 10:46:51,670 INFO L290 TraceCheckUtils]: 30: Hoare triple {5322#(and (= (+ main_~c~0 (- 3)) 0) (= main_~y~0 3))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {5322#(and (= (+ main_~c~0 (- 3)) 0) (= main_~y~0 3))} is VALID [2022-04-15 10:46:51,671 INFO L290 TraceCheckUtils]: 31: Hoare triple {5322#(and (= (+ main_~c~0 (- 3)) 0) (= main_~y~0 3))} assume !!(#t~post5 < 20);havoc #t~post5; {5322#(and (= (+ main_~c~0 (- 3)) 0) (= main_~y~0 3))} is VALID [2022-04-15 10:46:51,671 INFO L272 TraceCheckUtils]: 32: Hoare triple {5322#(and (= (+ main_~c~0 (- 3)) 0) (= main_~y~0 3))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {5227#true} is VALID [2022-04-15 10:46:51,671 INFO L290 TraceCheckUtils]: 33: Hoare triple {5227#true} ~cond := #in~cond; {5227#true} is VALID [2022-04-15 10:46:51,671 INFO L290 TraceCheckUtils]: 34: Hoare triple {5227#true} assume !(0 == ~cond); {5227#true} is VALID [2022-04-15 10:46:51,671 INFO L290 TraceCheckUtils]: 35: Hoare triple {5227#true} assume true; {5227#true} is VALID [2022-04-15 10:46:51,671 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {5227#true} {5322#(and (= (+ main_~c~0 (- 3)) 0) (= main_~y~0 3))} #51#return; {5322#(and (= (+ main_~c~0 (- 3)) 0) (= main_~y~0 3))} is VALID [2022-04-15 10:46:51,672 INFO L290 TraceCheckUtils]: 37: Hoare triple {5322#(and (= (+ main_~c~0 (- 3)) 0) (= 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 + ~x~0; {5347#(and (= main_~y~0 4) (= (+ main_~c~0 (- 4)) 0))} is VALID [2022-04-15 10:46:51,672 INFO L290 TraceCheckUtils]: 38: Hoare triple {5347#(and (= main_~y~0 4) (= (+ main_~c~0 (- 4)) 0))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {5347#(and (= main_~y~0 4) (= (+ main_~c~0 (- 4)) 0))} is VALID [2022-04-15 10:46:51,672 INFO L290 TraceCheckUtils]: 39: Hoare triple {5347#(and (= main_~y~0 4) (= (+ main_~c~0 (- 4)) 0))} assume !!(#t~post5 < 20);havoc #t~post5; {5347#(and (= main_~y~0 4) (= (+ main_~c~0 (- 4)) 0))} is VALID [2022-04-15 10:46:51,673 INFO L272 TraceCheckUtils]: 40: Hoare triple {5347#(and (= main_~y~0 4) (= (+ main_~c~0 (- 4)) 0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {5227#true} is VALID [2022-04-15 10:46:51,673 INFO L290 TraceCheckUtils]: 41: Hoare triple {5227#true} ~cond := #in~cond; {5227#true} is VALID [2022-04-15 10:46:51,673 INFO L290 TraceCheckUtils]: 42: Hoare triple {5227#true} assume !(0 == ~cond); {5227#true} is VALID [2022-04-15 10:46:51,673 INFO L290 TraceCheckUtils]: 43: Hoare triple {5227#true} assume true; {5227#true} is VALID [2022-04-15 10:46:51,673 INFO L284 TraceCheckUtils]: 44: Hoare quadruple {5227#true} {5347#(and (= main_~y~0 4) (= (+ main_~c~0 (- 4)) 0))} #51#return; {5347#(and (= main_~y~0 4) (= (+ main_~c~0 (- 4)) 0))} is VALID [2022-04-15 10:46:51,674 INFO L290 TraceCheckUtils]: 45: Hoare triple {5347#(and (= main_~y~0 4) (= (+ main_~c~0 (- 4)) 0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {5372#(and (<= main_~c~0 5) (= (+ (- 1) main_~y~0) 4) (< 4 main_~k~0))} is VALID [2022-04-15 10:46:51,674 INFO L290 TraceCheckUtils]: 46: Hoare triple {5372#(and (<= main_~c~0 5) (= (+ (- 1) main_~y~0) 4) (< 4 main_~k~0))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {5372#(and (<= main_~c~0 5) (= (+ (- 1) main_~y~0) 4) (< 4 main_~k~0))} is VALID [2022-04-15 10:46:51,674 INFO L290 TraceCheckUtils]: 47: Hoare triple {5372#(and (<= main_~c~0 5) (= (+ (- 1) main_~y~0) 4) (< 4 main_~k~0))} assume !!(#t~post5 < 20);havoc #t~post5; {5372#(and (<= main_~c~0 5) (= (+ (- 1) main_~y~0) 4) (< 4 main_~k~0))} is VALID [2022-04-15 10:46:51,674 INFO L272 TraceCheckUtils]: 48: Hoare triple {5372#(and (<= main_~c~0 5) (= (+ (- 1) main_~y~0) 4) (< 4 main_~k~0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {5227#true} is VALID [2022-04-15 10:46:51,675 INFO L290 TraceCheckUtils]: 49: Hoare triple {5227#true} ~cond := #in~cond; {5227#true} is VALID [2022-04-15 10:46:51,675 INFO L290 TraceCheckUtils]: 50: Hoare triple {5227#true} assume !(0 == ~cond); {5227#true} is VALID [2022-04-15 10:46:51,675 INFO L290 TraceCheckUtils]: 51: Hoare triple {5227#true} assume true; {5227#true} is VALID [2022-04-15 10:46:51,675 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {5227#true} {5372#(and (<= main_~c~0 5) (= (+ (- 1) main_~y~0) 4) (< 4 main_~k~0))} #51#return; {5372#(and (<= main_~c~0 5) (= (+ (- 1) main_~y~0) 4) (< 4 main_~k~0))} is VALID [2022-04-15 10:46:51,676 INFO L290 TraceCheckUtils]: 53: Hoare triple {5372#(and (<= main_~c~0 5) (= (+ (- 1) main_~y~0) 4) (< 4 main_~k~0))} assume !(~c~0 < ~k~0); {5397#(and (<= main_~k~0 5) (= (+ (- 1) main_~y~0) 4) (< 4 main_~k~0))} is VALID [2022-04-15 10:46:51,676 INFO L272 TraceCheckUtils]: 54: Hoare triple {5397#(and (<= main_~k~0 5) (= (+ (- 1) main_~y~0) 4) (< 4 main_~k~0))} call __VERIFIER_assert((if 0 == ~k~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {5401#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 10:46:51,677 INFO L290 TraceCheckUtils]: 55: Hoare triple {5401#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {5405#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 10:46:51,677 INFO L290 TraceCheckUtils]: 56: Hoare triple {5405#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {5228#false} is VALID [2022-04-15 10:46:51,677 INFO L290 TraceCheckUtils]: 57: Hoare triple {5228#false} assume !false; {5228#false} is VALID [2022-04-15 10:46:51,677 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 12 proven. 60 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2022-04-15 10:46:51,677 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 10:46:51,960 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 10:46:51,960 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1951567719] [2022-04-15 10:46:51,960 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 10:46:51,960 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [177870483] [2022-04-15 10:46:51,960 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [177870483] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 10:46:51,960 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-15 10:46:51,960 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2022-04-15 10:46:51,961 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 10:46:51,961 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [634771159] [2022-04-15 10:46:51,961 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [634771159] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 10:46:51,961 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 10:46:51,961 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-04-15 10:46:51,961 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [973683632] [2022-04-15 10:46:51,961 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 10:46:51,961 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 2.7) internal successors, (27), 10 states have internal predecessors, (27), 8 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Word has length 58 [2022-04-15 10:46:51,961 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 10:46:51,962 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 11 states, 10 states have (on average 2.7) internal successors, (27), 10 states have internal predecessors, (27), 8 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-15 10:46:51,982 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 43 edges. 43 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 10:46:51,982 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-04-15 10:46:51,982 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 10:46:51,983 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-04-15 10:46:51,983 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=146, Unknown=0, NotChecked=0, Total=182 [2022-04-15 10:46:51,983 INFO L87 Difference]: Start difference. First operand 61 states and 62 transitions. Second operand has 11 states, 10 states have (on average 2.7) internal successors, (27), 10 states have internal predecessors, (27), 8 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-15 10:46:52,481 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 10:46:52,481 INFO L93 Difference]: Finished difference Result 68 states and 70 transitions. [2022-04-15 10:46:52,481 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-04-15 10:46:52,482 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 2.7) internal successors, (27), 10 states have internal predecessors, (27), 8 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Word has length 58 [2022-04-15 10:46:52,482 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 10:46:52,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 10 states have (on average 2.7) internal successors, (27), 10 states have internal predecessors, (27), 8 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-15 10:46:52,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 54 transitions. [2022-04-15 10:46:52,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 10 states have (on average 2.7) internal successors, (27), 10 states have internal predecessors, (27), 8 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-15 10:46:52,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 54 transitions. [2022-04-15 10:46:52,484 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 11 states and 54 transitions. [2022-04-15 10:46:52,514 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-15 10:46:52,515 INFO L225 Difference]: With dead ends: 68 [2022-04-15 10:46:52,515 INFO L226 Difference]: Without dead ends: 63 [2022-04-15 10:46:52,515 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 58 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-15 10:46:52,515 INFO L913 BasicCegarLoop]: 38 mSDtfsCounter, 2 mSDsluCounter, 214 mSDsCounter, 0 mSdLazyCounter, 182 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 252 SdHoareTripleChecker+Invalid, 182 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 182 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-15 10:46:52,515 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [2 Valid, 252 Invalid, 182 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 182 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-15 10:46:52,516 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2022-04-15 10:46:52,569 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2022-04-15 10:46:52,569 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 10:46:52,569 INFO L82 GeneralOperation]: Start isEquivalent. First operand 63 states. Second operand has 63 states, 45 states have (on average 1.0444444444444445) internal successors, (47), 45 states have internal predecessors, (47), 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-15 10:46:52,569 INFO L74 IsIncluded]: Start isIncluded. First operand 63 states. Second operand has 63 states, 45 states have (on average 1.0444444444444445) internal successors, (47), 45 states have internal predecessors, (47), 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-15 10:46:52,569 INFO L87 Difference]: Start difference. First operand 63 states. Second operand has 63 states, 45 states have (on average 1.0444444444444445) internal successors, (47), 45 states have internal predecessors, (47), 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-15 10:46:52,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 10:46:52,573 INFO L93 Difference]: Finished difference Result 63 states and 65 transitions. [2022-04-15 10:46:52,573 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 65 transitions. [2022-04-15 10:46:52,573 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 10:46:52,573 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 10:46:52,573 INFO L74 IsIncluded]: Start isIncluded. First operand has 63 states, 45 states have (on average 1.0444444444444445) internal successors, (47), 45 states have internal predecessors, (47), 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 63 states. [2022-04-15 10:46:52,574 INFO L87 Difference]: Start difference. First operand has 63 states, 45 states have (on average 1.0444444444444445) internal successors, (47), 45 states have internal predecessors, (47), 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 63 states. [2022-04-15 10:46:52,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 10:46:52,575 INFO L93 Difference]: Finished difference Result 63 states and 65 transitions. [2022-04-15 10:46:52,577 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 65 transitions. [2022-04-15 10:46:52,578 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 10:46:52,578 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 10:46:52,578 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 10:46:52,578 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 10:46:52,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 45 states have (on average 1.0444444444444445) internal successors, (47), 45 states have internal predecessors, (47), 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-15 10:46:52,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 65 transitions. [2022-04-15 10:46:52,579 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 65 transitions. Word has length 58 [2022-04-15 10:46:52,579 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 10:46:52,579 INFO L478 AbstractCegarLoop]: Abstraction has 63 states and 65 transitions. [2022-04-15 10:46:52,580 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 2.7) internal successors, (27), 10 states have internal predecessors, (27), 8 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-15 10:46:52,580 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 63 states and 65 transitions. [2022-04-15 10:46:53,073 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-15 10:46:53,074 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 65 transitions. [2022-04-15 10:46:53,074 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2022-04-15 10:46:53,074 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 10:46:53,074 INFO L499 BasicCegarLoop]: trace histogram [7, 7, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 10:46:53,079 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-15 10:46:53,279 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-15 10:46:53,279 INFO L403 AbstractCegarLoop]: === Iteration 15 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 10:46:53,280 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 10:46:53,285 INFO L85 PathProgramCache]: Analyzing trace with hash 1633541723, now seen corresponding path program 11 times [2022-04-15 10:46:53,285 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 10:46:53,285 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [433177209] [2022-04-15 10:46:53,366 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 4 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 10:46:53,366 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONLINEAR_UPDATE [2022-04-15 10:46:53,366 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 10:46:53,366 INFO L85 PathProgramCache]: Analyzing trace with hash 1633541723, now seen corresponding path program 12 times [2022-04-15 10:46:53,367 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 10:46:53,367 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1955420494] [2022-04-15 10:46:53,367 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 10:46:53,367 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 10:46:53,374 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 10:46:53,374 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2006739429] [2022-04-15 10:46:53,374 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-15 10:46:53,374 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 10:46:53,375 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 10:46:53,379 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-15 10:46:53,379 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-15 10:46:53,559 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2022-04-15 10:46:53,559 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 10:46:53,561 INFO L263 TraceCheckSpWp]: Trace formula consists of 197 conjuncts, 17 conjunts are in the unsatisfiable core [2022-04-15 10:46:53,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 10:46:53,574 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 10:46:53,813 INFO L272 TraceCheckUtils]: 0: Hoare triple {5848#true} call ULTIMATE.init(); {5848#true} is VALID [2022-04-15 10:46:53,814 INFO L290 TraceCheckUtils]: 1: Hoare triple {5848#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; {5856#(<= ~counter~0 0)} is VALID [2022-04-15 10:46:53,814 INFO L290 TraceCheckUtils]: 2: Hoare triple {5856#(<= ~counter~0 0)} assume true; {5856#(<= ~counter~0 0)} is VALID [2022-04-15 10:46:53,814 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5856#(<= ~counter~0 0)} {5848#true} #57#return; {5856#(<= ~counter~0 0)} is VALID [2022-04-15 10:46:53,815 INFO L272 TraceCheckUtils]: 4: Hoare triple {5856#(<= ~counter~0 0)} call #t~ret6 := main(); {5856#(<= ~counter~0 0)} is VALID [2022-04-15 10:46:53,815 INFO L290 TraceCheckUtils]: 5: Hoare triple {5856#(<= ~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;~y~0 := 0;~x~0 := 0;~c~0 := 0; {5856#(<= ~counter~0 0)} is VALID [2022-04-15 10:46:53,815 INFO L290 TraceCheckUtils]: 6: Hoare triple {5856#(<= ~counter~0 0)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {5872#(<= ~counter~0 1)} is VALID [2022-04-15 10:46:53,816 INFO L290 TraceCheckUtils]: 7: Hoare triple {5872#(<= ~counter~0 1)} assume !!(#t~post5 < 20);havoc #t~post5; {5872#(<= ~counter~0 1)} is VALID [2022-04-15 10:46:53,816 INFO L272 TraceCheckUtils]: 8: Hoare triple {5872#(<= ~counter~0 1)} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {5872#(<= ~counter~0 1)} is VALID [2022-04-15 10:46:53,816 INFO L290 TraceCheckUtils]: 9: Hoare triple {5872#(<= ~counter~0 1)} ~cond := #in~cond; {5872#(<= ~counter~0 1)} is VALID [2022-04-15 10:46:53,817 INFO L290 TraceCheckUtils]: 10: Hoare triple {5872#(<= ~counter~0 1)} assume !(0 == ~cond); {5872#(<= ~counter~0 1)} is VALID [2022-04-15 10:46:53,817 INFO L290 TraceCheckUtils]: 11: Hoare triple {5872#(<= ~counter~0 1)} assume true; {5872#(<= ~counter~0 1)} is VALID [2022-04-15 10:46:53,817 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {5872#(<= ~counter~0 1)} {5872#(<= ~counter~0 1)} #51#return; {5872#(<= ~counter~0 1)} is VALID [2022-04-15 10:46:53,817 INFO L290 TraceCheckUtils]: 13: Hoare triple {5872#(<= ~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 + ~x~0; {5872#(<= ~counter~0 1)} is VALID [2022-04-15 10:46:53,818 INFO L290 TraceCheckUtils]: 14: Hoare triple {5872#(<= ~counter~0 1)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {5897#(<= ~counter~0 2)} is VALID [2022-04-15 10:46:53,818 INFO L290 TraceCheckUtils]: 15: Hoare triple {5897#(<= ~counter~0 2)} assume !!(#t~post5 < 20);havoc #t~post5; {5897#(<= ~counter~0 2)} is VALID [2022-04-15 10:46:53,818 INFO L272 TraceCheckUtils]: 16: Hoare triple {5897#(<= ~counter~0 2)} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {5897#(<= ~counter~0 2)} is VALID [2022-04-15 10:46:53,818 INFO L290 TraceCheckUtils]: 17: Hoare triple {5897#(<= ~counter~0 2)} ~cond := #in~cond; {5897#(<= ~counter~0 2)} is VALID [2022-04-15 10:46:53,819 INFO L290 TraceCheckUtils]: 18: Hoare triple {5897#(<= ~counter~0 2)} assume !(0 == ~cond); {5897#(<= ~counter~0 2)} is VALID [2022-04-15 10:46:53,819 INFO L290 TraceCheckUtils]: 19: Hoare triple {5897#(<= ~counter~0 2)} assume true; {5897#(<= ~counter~0 2)} is VALID [2022-04-15 10:46:53,819 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {5897#(<= ~counter~0 2)} {5897#(<= ~counter~0 2)} #51#return; {5897#(<= ~counter~0 2)} is VALID [2022-04-15 10:46:53,819 INFO L290 TraceCheckUtils]: 21: Hoare triple {5897#(<= ~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 + ~x~0; {5897#(<= ~counter~0 2)} is VALID [2022-04-15 10:46:53,820 INFO L290 TraceCheckUtils]: 22: Hoare triple {5897#(<= ~counter~0 2)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {5922#(<= ~counter~0 3)} is VALID [2022-04-15 10:46:53,820 INFO L290 TraceCheckUtils]: 23: Hoare triple {5922#(<= ~counter~0 3)} assume !!(#t~post5 < 20);havoc #t~post5; {5922#(<= ~counter~0 3)} is VALID [2022-04-15 10:46:53,820 INFO L272 TraceCheckUtils]: 24: Hoare triple {5922#(<= ~counter~0 3)} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {5922#(<= ~counter~0 3)} is VALID [2022-04-15 10:46:53,821 INFO L290 TraceCheckUtils]: 25: Hoare triple {5922#(<= ~counter~0 3)} ~cond := #in~cond; {5922#(<= ~counter~0 3)} is VALID [2022-04-15 10:46:53,821 INFO L290 TraceCheckUtils]: 26: Hoare triple {5922#(<= ~counter~0 3)} assume !(0 == ~cond); {5922#(<= ~counter~0 3)} is VALID [2022-04-15 10:46:53,821 INFO L290 TraceCheckUtils]: 27: Hoare triple {5922#(<= ~counter~0 3)} assume true; {5922#(<= ~counter~0 3)} is VALID [2022-04-15 10:46:53,821 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {5922#(<= ~counter~0 3)} {5922#(<= ~counter~0 3)} #51#return; {5922#(<= ~counter~0 3)} is VALID [2022-04-15 10:46:53,822 INFO L290 TraceCheckUtils]: 29: Hoare triple {5922#(<= ~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 + ~x~0; {5922#(<= ~counter~0 3)} is VALID [2022-04-15 10:46:53,822 INFO L290 TraceCheckUtils]: 30: Hoare triple {5922#(<= ~counter~0 3)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {5947#(<= ~counter~0 4)} is VALID [2022-04-15 10:46:53,822 INFO L290 TraceCheckUtils]: 31: Hoare triple {5947#(<= ~counter~0 4)} assume !!(#t~post5 < 20);havoc #t~post5; {5947#(<= ~counter~0 4)} is VALID [2022-04-15 10:46:53,823 INFO L272 TraceCheckUtils]: 32: Hoare triple {5947#(<= ~counter~0 4)} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {5947#(<= ~counter~0 4)} is VALID [2022-04-15 10:46:53,823 INFO L290 TraceCheckUtils]: 33: Hoare triple {5947#(<= ~counter~0 4)} ~cond := #in~cond; {5947#(<= ~counter~0 4)} is VALID [2022-04-15 10:46:53,823 INFO L290 TraceCheckUtils]: 34: Hoare triple {5947#(<= ~counter~0 4)} assume !(0 == ~cond); {5947#(<= ~counter~0 4)} is VALID [2022-04-15 10:46:53,823 INFO L290 TraceCheckUtils]: 35: Hoare triple {5947#(<= ~counter~0 4)} assume true; {5947#(<= ~counter~0 4)} is VALID [2022-04-15 10:46:53,824 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {5947#(<= ~counter~0 4)} {5947#(<= ~counter~0 4)} #51#return; {5947#(<= ~counter~0 4)} is VALID [2022-04-15 10:46:53,824 INFO L290 TraceCheckUtils]: 37: Hoare triple {5947#(<= ~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 + ~x~0; {5947#(<= ~counter~0 4)} is VALID [2022-04-15 10:46:53,824 INFO L290 TraceCheckUtils]: 38: Hoare triple {5947#(<= ~counter~0 4)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {5972#(<= ~counter~0 5)} is VALID [2022-04-15 10:46:53,824 INFO L290 TraceCheckUtils]: 39: Hoare triple {5972#(<= ~counter~0 5)} assume !!(#t~post5 < 20);havoc #t~post5; {5972#(<= ~counter~0 5)} is VALID [2022-04-15 10:46:53,825 INFO L272 TraceCheckUtils]: 40: Hoare triple {5972#(<= ~counter~0 5)} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {5972#(<= ~counter~0 5)} is VALID [2022-04-15 10:46:53,825 INFO L290 TraceCheckUtils]: 41: Hoare triple {5972#(<= ~counter~0 5)} ~cond := #in~cond; {5972#(<= ~counter~0 5)} is VALID [2022-04-15 10:46:53,825 INFO L290 TraceCheckUtils]: 42: Hoare triple {5972#(<= ~counter~0 5)} assume !(0 == ~cond); {5972#(<= ~counter~0 5)} is VALID [2022-04-15 10:46:53,825 INFO L290 TraceCheckUtils]: 43: Hoare triple {5972#(<= ~counter~0 5)} assume true; {5972#(<= ~counter~0 5)} is VALID [2022-04-15 10:46:53,826 INFO L284 TraceCheckUtils]: 44: Hoare quadruple {5972#(<= ~counter~0 5)} {5972#(<= ~counter~0 5)} #51#return; {5972#(<= ~counter~0 5)} is VALID [2022-04-15 10:46:53,826 INFO L290 TraceCheckUtils]: 45: Hoare triple {5972#(<= ~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 + ~x~0; {5972#(<= ~counter~0 5)} is VALID [2022-04-15 10:46:53,826 INFO L290 TraceCheckUtils]: 46: Hoare triple {5972#(<= ~counter~0 5)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {5997#(<= ~counter~0 6)} is VALID [2022-04-15 10:46:53,827 INFO L290 TraceCheckUtils]: 47: Hoare triple {5997#(<= ~counter~0 6)} assume !!(#t~post5 < 20);havoc #t~post5; {5997#(<= ~counter~0 6)} is VALID [2022-04-15 10:46:53,827 INFO L272 TraceCheckUtils]: 48: Hoare triple {5997#(<= ~counter~0 6)} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {5997#(<= ~counter~0 6)} is VALID [2022-04-15 10:46:53,827 INFO L290 TraceCheckUtils]: 49: Hoare triple {5997#(<= ~counter~0 6)} ~cond := #in~cond; {5997#(<= ~counter~0 6)} is VALID [2022-04-15 10:46:53,827 INFO L290 TraceCheckUtils]: 50: Hoare triple {5997#(<= ~counter~0 6)} assume !(0 == ~cond); {5997#(<= ~counter~0 6)} is VALID [2022-04-15 10:46:53,828 INFO L290 TraceCheckUtils]: 51: Hoare triple {5997#(<= ~counter~0 6)} assume true; {5997#(<= ~counter~0 6)} is VALID [2022-04-15 10:46:53,828 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {5997#(<= ~counter~0 6)} {5997#(<= ~counter~0 6)} #51#return; {5997#(<= ~counter~0 6)} is VALID [2022-04-15 10:46:53,828 INFO L290 TraceCheckUtils]: 53: Hoare triple {5997#(<= ~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 + ~x~0; {5997#(<= ~counter~0 6)} is VALID [2022-04-15 10:46:53,829 INFO L290 TraceCheckUtils]: 54: Hoare triple {5997#(<= ~counter~0 6)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {6022#(<= |main_#t~post5| 6)} is VALID [2022-04-15 10:46:53,829 INFO L290 TraceCheckUtils]: 55: Hoare triple {6022#(<= |main_#t~post5| 6)} assume !(#t~post5 < 20);havoc #t~post5; {5849#false} is VALID [2022-04-15 10:46:53,829 INFO L272 TraceCheckUtils]: 56: Hoare triple {5849#false} call __VERIFIER_assert((if 0 == ~k~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {5849#false} is VALID [2022-04-15 10:46:53,829 INFO L290 TraceCheckUtils]: 57: Hoare triple {5849#false} ~cond := #in~cond; {5849#false} is VALID [2022-04-15 10:46:53,829 INFO L290 TraceCheckUtils]: 58: Hoare triple {5849#false} assume 0 == ~cond; {5849#false} is VALID [2022-04-15 10:46:53,829 INFO L290 TraceCheckUtils]: 59: Hoare triple {5849#false} assume !false; {5849#false} is VALID [2022-04-15 10:46:53,829 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 12 proven. 132 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 10:46:53,829 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 10:46:54,095 INFO L290 TraceCheckUtils]: 59: Hoare triple {5849#false} assume !false; {5849#false} is VALID [2022-04-15 10:46:54,095 INFO L290 TraceCheckUtils]: 58: Hoare triple {5849#false} assume 0 == ~cond; {5849#false} is VALID [2022-04-15 10:46:54,095 INFO L290 TraceCheckUtils]: 57: Hoare triple {5849#false} ~cond := #in~cond; {5849#false} is VALID [2022-04-15 10:46:54,096 INFO L272 TraceCheckUtils]: 56: Hoare triple {5849#false} call __VERIFIER_assert((if 0 == ~k~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {5849#false} is VALID [2022-04-15 10:46:54,096 INFO L290 TraceCheckUtils]: 55: Hoare triple {6050#(< |main_#t~post5| 20)} assume !(#t~post5 < 20);havoc #t~post5; {5849#false} is VALID [2022-04-15 10:46:54,096 INFO L290 TraceCheckUtils]: 54: Hoare triple {6054#(< ~counter~0 20)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {6050#(< |main_#t~post5| 20)} is VALID [2022-04-15 10:46:54,096 INFO L290 TraceCheckUtils]: 53: Hoare triple {6054#(< ~counter~0 20)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {6054#(< ~counter~0 20)} is VALID [2022-04-15 10:46:54,097 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {5848#true} {6054#(< ~counter~0 20)} #51#return; {6054#(< ~counter~0 20)} is VALID [2022-04-15 10:46:54,097 INFO L290 TraceCheckUtils]: 51: Hoare triple {5848#true} assume true; {5848#true} is VALID [2022-04-15 10:46:54,097 INFO L290 TraceCheckUtils]: 50: Hoare triple {5848#true} assume !(0 == ~cond); {5848#true} is VALID [2022-04-15 10:46:54,097 INFO L290 TraceCheckUtils]: 49: Hoare triple {5848#true} ~cond := #in~cond; {5848#true} is VALID [2022-04-15 10:46:54,097 INFO L272 TraceCheckUtils]: 48: Hoare triple {6054#(< ~counter~0 20)} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {5848#true} is VALID [2022-04-15 10:46:54,097 INFO L290 TraceCheckUtils]: 47: Hoare triple {6054#(< ~counter~0 20)} assume !!(#t~post5 < 20);havoc #t~post5; {6054#(< ~counter~0 20)} is VALID [2022-04-15 10:46:54,098 INFO L290 TraceCheckUtils]: 46: Hoare triple {6079#(< ~counter~0 19)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {6054#(< ~counter~0 20)} is VALID [2022-04-15 10:46:54,098 INFO L290 TraceCheckUtils]: 45: Hoare triple {6079#(< ~counter~0 19)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {6079#(< ~counter~0 19)} is VALID [2022-04-15 10:46:54,098 INFO L284 TraceCheckUtils]: 44: Hoare quadruple {5848#true} {6079#(< ~counter~0 19)} #51#return; {6079#(< ~counter~0 19)} is VALID [2022-04-15 10:46:54,098 INFO L290 TraceCheckUtils]: 43: Hoare triple {5848#true} assume true; {5848#true} is VALID [2022-04-15 10:46:54,099 INFO L290 TraceCheckUtils]: 42: Hoare triple {5848#true} assume !(0 == ~cond); {5848#true} is VALID [2022-04-15 10:46:54,099 INFO L290 TraceCheckUtils]: 41: Hoare triple {5848#true} ~cond := #in~cond; {5848#true} is VALID [2022-04-15 10:46:54,099 INFO L272 TraceCheckUtils]: 40: Hoare triple {6079#(< ~counter~0 19)} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {5848#true} is VALID [2022-04-15 10:46:54,099 INFO L290 TraceCheckUtils]: 39: Hoare triple {6079#(< ~counter~0 19)} assume !!(#t~post5 < 20);havoc #t~post5; {6079#(< ~counter~0 19)} is VALID [2022-04-15 10:46:54,099 INFO L290 TraceCheckUtils]: 38: Hoare triple {6104#(< ~counter~0 18)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {6079#(< ~counter~0 19)} is VALID [2022-04-15 10:46:54,100 INFO L290 TraceCheckUtils]: 37: Hoare triple {6104#(< ~counter~0 18)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {6104#(< ~counter~0 18)} is VALID [2022-04-15 10:46:54,100 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {5848#true} {6104#(< ~counter~0 18)} #51#return; {6104#(< ~counter~0 18)} is VALID [2022-04-15 10:46:54,100 INFO L290 TraceCheckUtils]: 35: Hoare triple {5848#true} assume true; {5848#true} is VALID [2022-04-15 10:46:54,100 INFO L290 TraceCheckUtils]: 34: Hoare triple {5848#true} assume !(0 == ~cond); {5848#true} is VALID [2022-04-15 10:46:54,100 INFO L290 TraceCheckUtils]: 33: Hoare triple {5848#true} ~cond := #in~cond; {5848#true} is VALID [2022-04-15 10:46:54,100 INFO L272 TraceCheckUtils]: 32: Hoare triple {6104#(< ~counter~0 18)} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {5848#true} is VALID [2022-04-15 10:46:54,100 INFO L290 TraceCheckUtils]: 31: Hoare triple {6104#(< ~counter~0 18)} assume !!(#t~post5 < 20);havoc #t~post5; {6104#(< ~counter~0 18)} is VALID [2022-04-15 10:46:54,101 INFO L290 TraceCheckUtils]: 30: Hoare triple {6129#(< ~counter~0 17)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {6104#(< ~counter~0 18)} is VALID [2022-04-15 10:46:54,101 INFO L290 TraceCheckUtils]: 29: Hoare triple {6129#(< ~counter~0 17)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {6129#(< ~counter~0 17)} is VALID [2022-04-15 10:46:54,101 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {5848#true} {6129#(< ~counter~0 17)} #51#return; {6129#(< ~counter~0 17)} is VALID [2022-04-15 10:46:54,101 INFO L290 TraceCheckUtils]: 27: Hoare triple {5848#true} assume true; {5848#true} is VALID [2022-04-15 10:46:54,102 INFO L290 TraceCheckUtils]: 26: Hoare triple {5848#true} assume !(0 == ~cond); {5848#true} is VALID [2022-04-15 10:46:54,102 INFO L290 TraceCheckUtils]: 25: Hoare triple {5848#true} ~cond := #in~cond; {5848#true} is VALID [2022-04-15 10:46:54,102 INFO L272 TraceCheckUtils]: 24: Hoare triple {6129#(< ~counter~0 17)} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {5848#true} is VALID [2022-04-15 10:46:54,102 INFO L290 TraceCheckUtils]: 23: Hoare triple {6129#(< ~counter~0 17)} assume !!(#t~post5 < 20);havoc #t~post5; {6129#(< ~counter~0 17)} is VALID [2022-04-15 10:46:54,102 INFO L290 TraceCheckUtils]: 22: Hoare triple {6154#(< ~counter~0 16)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {6129#(< ~counter~0 17)} is VALID [2022-04-15 10:46:54,103 INFO L290 TraceCheckUtils]: 21: Hoare triple {6154#(< ~counter~0 16)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {6154#(< ~counter~0 16)} is VALID [2022-04-15 10:46:54,103 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {5848#true} {6154#(< ~counter~0 16)} #51#return; {6154#(< ~counter~0 16)} is VALID [2022-04-15 10:46:54,103 INFO L290 TraceCheckUtils]: 19: Hoare triple {5848#true} assume true; {5848#true} is VALID [2022-04-15 10:46:54,103 INFO L290 TraceCheckUtils]: 18: Hoare triple {5848#true} assume !(0 == ~cond); {5848#true} is VALID [2022-04-15 10:46:54,103 INFO L290 TraceCheckUtils]: 17: Hoare triple {5848#true} ~cond := #in~cond; {5848#true} is VALID [2022-04-15 10:46:54,103 INFO L272 TraceCheckUtils]: 16: Hoare triple {6154#(< ~counter~0 16)} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {5848#true} is VALID [2022-04-15 10:46:54,103 INFO L290 TraceCheckUtils]: 15: Hoare triple {6154#(< ~counter~0 16)} assume !!(#t~post5 < 20);havoc #t~post5; {6154#(< ~counter~0 16)} is VALID [2022-04-15 10:46:54,104 INFO L290 TraceCheckUtils]: 14: Hoare triple {6179#(< ~counter~0 15)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {6154#(< ~counter~0 16)} is VALID [2022-04-15 10:46:54,104 INFO L290 TraceCheckUtils]: 13: Hoare triple {6179#(< ~counter~0 15)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {6179#(< ~counter~0 15)} is VALID [2022-04-15 10:46:54,104 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {5848#true} {6179#(< ~counter~0 15)} #51#return; {6179#(< ~counter~0 15)} is VALID [2022-04-15 10:46:54,105 INFO L290 TraceCheckUtils]: 11: Hoare triple {5848#true} assume true; {5848#true} is VALID [2022-04-15 10:46:54,105 INFO L290 TraceCheckUtils]: 10: Hoare triple {5848#true} assume !(0 == ~cond); {5848#true} is VALID [2022-04-15 10:46:54,105 INFO L290 TraceCheckUtils]: 9: Hoare triple {5848#true} ~cond := #in~cond; {5848#true} is VALID [2022-04-15 10:46:54,105 INFO L272 TraceCheckUtils]: 8: Hoare triple {6179#(< ~counter~0 15)} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {5848#true} is VALID [2022-04-15 10:46:54,105 INFO L290 TraceCheckUtils]: 7: Hoare triple {6179#(< ~counter~0 15)} assume !!(#t~post5 < 20);havoc #t~post5; {6179#(< ~counter~0 15)} is VALID [2022-04-15 10:46:54,105 INFO L290 TraceCheckUtils]: 6: Hoare triple {6204#(< ~counter~0 14)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {6179#(< ~counter~0 15)} is VALID [2022-04-15 10:46:54,106 INFO L290 TraceCheckUtils]: 5: Hoare triple {6204#(< ~counter~0 14)} 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;~y~0 := 0;~x~0 := 0;~c~0 := 0; {6204#(< ~counter~0 14)} is VALID [2022-04-15 10:46:54,106 INFO L272 TraceCheckUtils]: 4: Hoare triple {6204#(< ~counter~0 14)} call #t~ret6 := main(); {6204#(< ~counter~0 14)} is VALID [2022-04-15 10:46:54,106 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6204#(< ~counter~0 14)} {5848#true} #57#return; {6204#(< ~counter~0 14)} is VALID [2022-04-15 10:46:54,106 INFO L290 TraceCheckUtils]: 2: Hoare triple {6204#(< ~counter~0 14)} assume true; {6204#(< ~counter~0 14)} is VALID [2022-04-15 10:46:54,107 INFO L290 TraceCheckUtils]: 1: Hoare triple {5848#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; {6204#(< ~counter~0 14)} is VALID [2022-04-15 10:46:54,107 INFO L272 TraceCheckUtils]: 0: Hoare triple {5848#true} call ULTIMATE.init(); {5848#true} is VALID [2022-04-15 10:46:54,107 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 12 proven. 72 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2022-04-15 10:46:54,107 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 10:46:54,107 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1955420494] [2022-04-15 10:46:54,107 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 10:46:54,107 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2006739429] [2022-04-15 10:46:54,107 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2006739429] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 10:46:54,108 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-15 10:46:54,108 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 18 [2022-04-15 10:46:54,108 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 10:46:54,108 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [433177209] [2022-04-15 10:46:54,109 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [433177209] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 10:46:54,109 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 10:46:54,109 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-04-15 10:46:54,109 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1179162640] [2022-04-15 10:46:54,109 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 10:46:54,110 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 4.4) internal successors, (44), 9 states have internal predecessors, (44), 9 states have call successors, (9), 9 states have call predecessors, (9), 7 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Word has length 60 [2022-04-15 10:46:54,110 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 10:46:54,110 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 10 states, 10 states have (on average 4.4) internal successors, (44), 9 states have internal predecessors, (44), 9 states have call successors, (9), 9 states have call predecessors, (9), 7 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-15 10:46:54,151 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 60 edges. 60 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 10:46:54,151 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-04-15 10:46:54,151 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 10:46:54,152 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-04-15 10:46:54,152 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=125, Invalid=181, Unknown=0, NotChecked=0, Total=306 [2022-04-15 10:46:54,152 INFO L87 Difference]: Start difference. First operand 63 states and 65 transitions. Second operand has 10 states, 10 states have (on average 4.4) internal successors, (44), 9 states have internal predecessors, (44), 9 states have call successors, (9), 9 states have call predecessors, (9), 7 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-15 10:46:54,373 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 10:46:54,373 INFO L93 Difference]: Finished difference Result 74 states and 75 transitions. [2022-04-15 10:46:54,373 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-04-15 10:46:54,374 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 4.4) internal successors, (44), 9 states have internal predecessors, (44), 9 states have call successors, (9), 9 states have call predecessors, (9), 7 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Word has length 60 [2022-04-15 10:46:54,374 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 10:46:54,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 4.4) internal successors, (44), 9 states have internal predecessors, (44), 9 states have call successors, (9), 9 states have call predecessors, (9), 7 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-15 10:46:54,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 74 transitions. [2022-04-15 10:46:54,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 4.4) internal successors, (44), 9 states have internal predecessors, (44), 9 states have call successors, (9), 9 states have call predecessors, (9), 7 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-15 10:46:54,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 74 transitions. [2022-04-15 10:46:54,380 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 16 states and 74 transitions. [2022-04-15 10:46:54,426 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-15 10:46:54,428 INFO L225 Difference]: With dead ends: 74 [2022-04-15 10:46:54,428 INFO L226 Difference]: Without dead ends: 69 [2022-04-15 10:46:54,428 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 103 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=227, Invalid=325, Unknown=0, NotChecked=0, Total=552 [2022-04-15 10:46:54,429 INFO L913 BasicCegarLoop]: 23 mSDtfsCounter, 4 mSDsluCounter, 79 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 102 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 10:46:54,429 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [4 Valid, 102 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 10:46:54,429 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2022-04-15 10:46:54,521 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 69. [2022-04-15 10:46:54,521 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 10:46:54,521 INFO L82 GeneralOperation]: Start isEquivalent. First operand 69 states. Second operand has 69 states, 50 states have (on average 1.04) internal successors, (52), 50 states have internal predecessors, (52), 10 states have call successors, (10), 10 states have call predecessors, (10), 8 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-15 10:46:54,521 INFO L74 IsIncluded]: Start isIncluded. First operand 69 states. Second operand has 69 states, 50 states have (on average 1.04) internal successors, (52), 50 states have internal predecessors, (52), 10 states have call successors, (10), 10 states have call predecessors, (10), 8 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-15 10:46:54,522 INFO L87 Difference]: Start difference. First operand 69 states. Second operand has 69 states, 50 states have (on average 1.04) internal successors, (52), 50 states have internal predecessors, (52), 10 states have call successors, (10), 10 states have call predecessors, (10), 8 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-15 10:46:54,524 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 10:46:54,524 INFO L93 Difference]: Finished difference Result 69 states and 70 transitions. [2022-04-15 10:46:54,524 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 70 transitions. [2022-04-15 10:46:54,524 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 10:46:54,524 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 10:46:54,524 INFO L74 IsIncluded]: Start isIncluded. First operand has 69 states, 50 states have (on average 1.04) internal successors, (52), 50 states have internal predecessors, (52), 10 states have call successors, (10), 10 states have call predecessors, (10), 8 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Second operand 69 states. [2022-04-15 10:46:54,524 INFO L87 Difference]: Start difference. First operand has 69 states, 50 states have (on average 1.04) internal successors, (52), 50 states have internal predecessors, (52), 10 states have call successors, (10), 10 states have call predecessors, (10), 8 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Second operand 69 states. [2022-04-15 10:46:54,525 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 10:46:54,525 INFO L93 Difference]: Finished difference Result 69 states and 70 transitions. [2022-04-15 10:46:54,525 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 70 transitions. [2022-04-15 10:46:54,525 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 10:46:54,525 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 10:46:54,526 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 10:46:54,526 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 10:46:54,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 50 states have (on average 1.04) internal successors, (52), 50 states have internal predecessors, (52), 10 states have call successors, (10), 10 states have call predecessors, (10), 8 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-15 10:46:54,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 70 transitions. [2022-04-15 10:46:54,527 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 70 transitions. Word has length 60 [2022-04-15 10:46:54,527 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 10:46:54,527 INFO L478 AbstractCegarLoop]: Abstraction has 69 states and 70 transitions. [2022-04-15 10:46:54,527 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 4.4) internal successors, (44), 9 states have internal predecessors, (44), 9 states have call successors, (9), 9 states have call predecessors, (9), 7 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-15 10:46:54,528 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 69 states and 70 transitions. [2022-04-15 10:46:55,033 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-15 10:46:55,034 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 70 transitions. [2022-04-15 10:46:55,037 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2022-04-15 10:46:55,038 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 10:46:55,038 INFO L499 BasicCegarLoop]: trace histogram [8, 7, 7, 7, 7, 7, 7, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 10:46:55,042 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-15 10:46:55,242 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-15 10:46:55,243 INFO L403 AbstractCegarLoop]: === Iteration 16 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 10:46:55,243 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 10:46:55,243 INFO L85 PathProgramCache]: Analyzing trace with hash 1180930233, now seen corresponding path program 11 times [2022-04-15 10:46:55,243 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 10:46:55,243 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1350857383] [2022-04-15 10:46:55,313 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 4 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 10:46:55,313 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONLINEAR_UPDATE [2022-04-15 10:46:55,313 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 10:46:55,313 INFO L85 PathProgramCache]: Analyzing trace with hash 1180930233, now seen corresponding path program 12 times [2022-04-15 10:46:55,313 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 10:46:55,314 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [644314238] [2022-04-15 10:46:55,314 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 10:46:55,314 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 10:46:55,340 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 10:46:55,340 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [544739229] [2022-04-15 10:46:55,340 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-15 10:46:55,340 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 10:46:55,340 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 10:46:55,341 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-15 10:46:55,342 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-15 10:46:55,551 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2022-04-15 10:46:55,552 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 10:46:55,553 INFO L263 TraceCheckSpWp]: Trace formula consists of 207 conjuncts, 33 conjunts are in the unsatisfiable core [2022-04-15 10:46:55,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 10:46:55,565 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 10:46:55,974 INFO L272 TraceCheckUtils]: 0: Hoare triple {6661#true} call ULTIMATE.init(); {6661#true} is VALID [2022-04-15 10:46:55,974 INFO L290 TraceCheckUtils]: 1: Hoare triple {6661#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; {6661#true} is VALID [2022-04-15 10:46:55,974 INFO L290 TraceCheckUtils]: 2: Hoare triple {6661#true} assume true; {6661#true} is VALID [2022-04-15 10:46:55,974 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6661#true} {6661#true} #57#return; {6661#true} is VALID [2022-04-15 10:46:55,974 INFO L272 TraceCheckUtils]: 4: Hoare triple {6661#true} call #t~ret6 := main(); {6661#true} is VALID [2022-04-15 10:46:55,975 INFO L290 TraceCheckUtils]: 5: Hoare triple {6661#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;~y~0 := 0;~x~0 := 0;~c~0 := 0; {6681#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-15 10:46:55,975 INFO L290 TraceCheckUtils]: 6: Hoare triple {6681#(and (= main_~c~0 0) (= main_~y~0 0))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {6681#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-15 10:46:55,975 INFO L290 TraceCheckUtils]: 7: Hoare triple {6681#(and (= main_~c~0 0) (= main_~y~0 0))} assume !!(#t~post5 < 20);havoc #t~post5; {6681#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-15 10:46:55,976 INFO L272 TraceCheckUtils]: 8: Hoare triple {6681#(and (= main_~c~0 0) (= main_~y~0 0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {6661#true} is VALID [2022-04-15 10:46:55,976 INFO L290 TraceCheckUtils]: 9: Hoare triple {6661#true} ~cond := #in~cond; {6661#true} is VALID [2022-04-15 10:46:55,976 INFO L290 TraceCheckUtils]: 10: Hoare triple {6661#true} assume !(0 == ~cond); {6661#true} is VALID [2022-04-15 10:46:55,976 INFO L290 TraceCheckUtils]: 11: Hoare triple {6661#true} assume true; {6661#true} is VALID [2022-04-15 10:46:55,976 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {6661#true} {6681#(and (= main_~c~0 0) (= main_~y~0 0))} #51#return; {6681#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-15 10:46:55,977 INFO L290 TraceCheckUtils]: 13: Hoare triple {6681#(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 + ~x~0; {6706#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} is VALID [2022-04-15 10:46:55,977 INFO L290 TraceCheckUtils]: 14: Hoare triple {6706#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {6706#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} is VALID [2022-04-15 10:46:55,978 INFO L290 TraceCheckUtils]: 15: Hoare triple {6706#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} assume !!(#t~post5 < 20);havoc #t~post5; {6706#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} is VALID [2022-04-15 10:46:55,978 INFO L272 TraceCheckUtils]: 16: Hoare triple {6706#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {6661#true} is VALID [2022-04-15 10:46:55,978 INFO L290 TraceCheckUtils]: 17: Hoare triple {6661#true} ~cond := #in~cond; {6661#true} is VALID [2022-04-15 10:46:55,978 INFO L290 TraceCheckUtils]: 18: Hoare triple {6661#true} assume !(0 == ~cond); {6661#true} is VALID [2022-04-15 10:46:55,978 INFO L290 TraceCheckUtils]: 19: Hoare triple {6661#true} assume true; {6661#true} is VALID [2022-04-15 10:46:55,978 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {6661#true} {6706#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} #51#return; {6706#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} is VALID [2022-04-15 10:46:55,979 INFO L290 TraceCheckUtils]: 21: Hoare triple {6706#(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 + ~x~0; {6731#(and (= main_~y~0 2) (= (+ (- 1) main_~c~0) 1) (< main_~c~0 (+ main_~k~0 1)))} is VALID [2022-04-15 10:46:55,979 INFO L290 TraceCheckUtils]: 22: Hoare triple {6731#(and (= main_~y~0 2) (= (+ (- 1) main_~c~0) 1) (< main_~c~0 (+ main_~k~0 1)))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {6731#(and (= main_~y~0 2) (= (+ (- 1) main_~c~0) 1) (< main_~c~0 (+ main_~k~0 1)))} is VALID [2022-04-15 10:46:55,980 INFO L290 TraceCheckUtils]: 23: Hoare triple {6731#(and (= main_~y~0 2) (= (+ (- 1) main_~c~0) 1) (< main_~c~0 (+ main_~k~0 1)))} assume !!(#t~post5 < 20);havoc #t~post5; {6731#(and (= main_~y~0 2) (= (+ (- 1) main_~c~0) 1) (< main_~c~0 (+ main_~k~0 1)))} is VALID [2022-04-15 10:46:55,980 INFO L272 TraceCheckUtils]: 24: Hoare triple {6731#(and (= main_~y~0 2) (= (+ (- 1) main_~c~0) 1) (< main_~c~0 (+ main_~k~0 1)))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {6661#true} is VALID [2022-04-15 10:46:55,980 INFO L290 TraceCheckUtils]: 25: Hoare triple {6661#true} ~cond := #in~cond; {6661#true} is VALID [2022-04-15 10:46:55,980 INFO L290 TraceCheckUtils]: 26: Hoare triple {6661#true} assume !(0 == ~cond); {6661#true} is VALID [2022-04-15 10:46:55,980 INFO L290 TraceCheckUtils]: 27: Hoare triple {6661#true} assume true; {6661#true} is VALID [2022-04-15 10:46:55,981 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {6661#true} {6731#(and (= main_~y~0 2) (= (+ (- 1) main_~c~0) 1) (< main_~c~0 (+ main_~k~0 1)))} #51#return; {6731#(and (= main_~y~0 2) (= (+ (- 1) main_~c~0) 1) (< main_~c~0 (+ main_~k~0 1)))} is VALID [2022-04-15 10:46:55,981 INFO L290 TraceCheckUtils]: 29: Hoare triple {6731#(and (= main_~y~0 2) (= (+ (- 1) main_~c~0) 1) (< 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 + ~x~0; {6756#(and (= (+ (- 2) main_~c~0) 1) (= main_~y~0 3) (< main_~c~0 (+ main_~k~0 2)))} is VALID [2022-04-15 10:46:55,982 INFO L290 TraceCheckUtils]: 30: Hoare triple {6756#(and (= (+ (- 2) main_~c~0) 1) (= main_~y~0 3) (< main_~c~0 (+ main_~k~0 2)))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {6756#(and (= (+ (- 2) main_~c~0) 1) (= main_~y~0 3) (< main_~c~0 (+ main_~k~0 2)))} is VALID [2022-04-15 10:46:55,982 INFO L290 TraceCheckUtils]: 31: Hoare triple {6756#(and (= (+ (- 2) main_~c~0) 1) (= main_~y~0 3) (< main_~c~0 (+ main_~k~0 2)))} assume !!(#t~post5 < 20);havoc #t~post5; {6756#(and (= (+ (- 2) main_~c~0) 1) (= main_~y~0 3) (< main_~c~0 (+ main_~k~0 2)))} is VALID [2022-04-15 10:46:55,982 INFO L272 TraceCheckUtils]: 32: Hoare triple {6756#(and (= (+ (- 2) main_~c~0) 1) (= main_~y~0 3) (< main_~c~0 (+ main_~k~0 2)))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {6661#true} is VALID [2022-04-15 10:46:55,982 INFO L290 TraceCheckUtils]: 33: Hoare triple {6661#true} ~cond := #in~cond; {6661#true} is VALID [2022-04-15 10:46:55,982 INFO L290 TraceCheckUtils]: 34: Hoare triple {6661#true} assume !(0 == ~cond); {6661#true} is VALID [2022-04-15 10:46:55,982 INFO L290 TraceCheckUtils]: 35: Hoare triple {6661#true} assume true; {6661#true} is VALID [2022-04-15 10:46:55,983 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {6661#true} {6756#(and (= (+ (- 2) main_~c~0) 1) (= main_~y~0 3) (< main_~c~0 (+ main_~k~0 2)))} #51#return; {6756#(and (= (+ (- 2) main_~c~0) 1) (= main_~y~0 3) (< main_~c~0 (+ main_~k~0 2)))} is VALID [2022-04-15 10:46:55,983 INFO L290 TraceCheckUtils]: 37: Hoare triple {6756#(and (= (+ (- 2) main_~c~0) 1) (= 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 + ~x~0; {6781#(and (< 1 main_~k~0) (= main_~y~0 4) (= main_~c~0 4))} is VALID [2022-04-15 10:46:55,984 INFO L290 TraceCheckUtils]: 38: Hoare triple {6781#(and (< 1 main_~k~0) (= main_~y~0 4) (= main_~c~0 4))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {6781#(and (< 1 main_~k~0) (= main_~y~0 4) (= main_~c~0 4))} is VALID [2022-04-15 10:46:55,984 INFO L290 TraceCheckUtils]: 39: Hoare triple {6781#(and (< 1 main_~k~0) (= main_~y~0 4) (= main_~c~0 4))} assume !!(#t~post5 < 20);havoc #t~post5; {6781#(and (< 1 main_~k~0) (= main_~y~0 4) (= main_~c~0 4))} is VALID [2022-04-15 10:46:55,984 INFO L272 TraceCheckUtils]: 40: Hoare triple {6781#(and (< 1 main_~k~0) (= main_~y~0 4) (= main_~c~0 4))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {6661#true} is VALID [2022-04-15 10:46:55,984 INFO L290 TraceCheckUtils]: 41: Hoare triple {6661#true} ~cond := #in~cond; {6661#true} is VALID [2022-04-15 10:46:55,984 INFO L290 TraceCheckUtils]: 42: Hoare triple {6661#true} assume !(0 == ~cond); {6661#true} is VALID [2022-04-15 10:46:55,985 INFO L290 TraceCheckUtils]: 43: Hoare triple {6661#true} assume true; {6661#true} is VALID [2022-04-15 10:46:55,985 INFO L284 TraceCheckUtils]: 44: Hoare quadruple {6661#true} {6781#(and (< 1 main_~k~0) (= main_~y~0 4) (= main_~c~0 4))} #51#return; {6781#(and (< 1 main_~k~0) (= main_~y~0 4) (= main_~c~0 4))} is VALID [2022-04-15 10:46:55,985 INFO L290 TraceCheckUtils]: 45: Hoare triple {6781#(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 + ~x~0; {6806#(and (< 1 main_~k~0) (= (+ (- 1) main_~y~0) 4) (= (+ (- 1) main_~c~0) 4))} is VALID [2022-04-15 10:46:55,986 INFO L290 TraceCheckUtils]: 46: Hoare triple {6806#(and (< 1 main_~k~0) (= (+ (- 1) main_~y~0) 4) (= (+ (- 1) main_~c~0) 4))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {6806#(and (< 1 main_~k~0) (= (+ (- 1) main_~y~0) 4) (= (+ (- 1) main_~c~0) 4))} is VALID [2022-04-15 10:46:55,986 INFO L290 TraceCheckUtils]: 47: Hoare triple {6806#(and (< 1 main_~k~0) (= (+ (- 1) main_~y~0) 4) (= (+ (- 1) main_~c~0) 4))} assume !!(#t~post5 < 20);havoc #t~post5; {6806#(and (< 1 main_~k~0) (= (+ (- 1) main_~y~0) 4) (= (+ (- 1) main_~c~0) 4))} is VALID [2022-04-15 10:46:55,986 INFO L272 TraceCheckUtils]: 48: Hoare triple {6806#(and (< 1 main_~k~0) (= (+ (- 1) main_~y~0) 4) (= (+ (- 1) main_~c~0) 4))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {6661#true} is VALID [2022-04-15 10:46:55,986 INFO L290 TraceCheckUtils]: 49: Hoare triple {6661#true} ~cond := #in~cond; {6661#true} is VALID [2022-04-15 10:46:55,986 INFO L290 TraceCheckUtils]: 50: Hoare triple {6661#true} assume !(0 == ~cond); {6661#true} is VALID [2022-04-15 10:46:55,987 INFO L290 TraceCheckUtils]: 51: Hoare triple {6661#true} assume true; {6661#true} is VALID [2022-04-15 10:46:55,987 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {6661#true} {6806#(and (< 1 main_~k~0) (= (+ (- 1) main_~y~0) 4) (= (+ (- 1) main_~c~0) 4))} #51#return; {6806#(and (< 1 main_~k~0) (= (+ (- 1) main_~y~0) 4) (= (+ (- 1) main_~c~0) 4))} is VALID [2022-04-15 10:46:55,988 INFO L290 TraceCheckUtils]: 53: Hoare triple {6806#(and (< 1 main_~k~0) (= (+ (- 1) main_~y~0) 4) (= (+ (- 1) 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 + ~x~0; {6831#(and (= main_~y~0 6) (< 5 main_~k~0) (<= main_~c~0 6))} is VALID [2022-04-15 10:46:55,988 INFO L290 TraceCheckUtils]: 54: Hoare triple {6831#(and (= main_~y~0 6) (< 5 main_~k~0) (<= main_~c~0 6))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {6831#(and (= main_~y~0 6) (< 5 main_~k~0) (<= main_~c~0 6))} is VALID [2022-04-15 10:46:55,988 INFO L290 TraceCheckUtils]: 55: Hoare triple {6831#(and (= main_~y~0 6) (< 5 main_~k~0) (<= main_~c~0 6))} assume !!(#t~post5 < 20);havoc #t~post5; {6831#(and (= main_~y~0 6) (< 5 main_~k~0) (<= main_~c~0 6))} is VALID [2022-04-15 10:46:55,988 INFO L272 TraceCheckUtils]: 56: Hoare triple {6831#(and (= main_~y~0 6) (< 5 main_~k~0) (<= main_~c~0 6))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {6661#true} is VALID [2022-04-15 10:46:55,988 INFO L290 TraceCheckUtils]: 57: Hoare triple {6661#true} ~cond := #in~cond; {6661#true} is VALID [2022-04-15 10:46:55,989 INFO L290 TraceCheckUtils]: 58: Hoare triple {6661#true} assume !(0 == ~cond); {6661#true} is VALID [2022-04-15 10:46:55,989 INFO L290 TraceCheckUtils]: 59: Hoare triple {6661#true} assume true; {6661#true} is VALID [2022-04-15 10:46:55,989 INFO L284 TraceCheckUtils]: 60: Hoare quadruple {6661#true} {6831#(and (= main_~y~0 6) (< 5 main_~k~0) (<= main_~c~0 6))} #51#return; {6831#(and (= main_~y~0 6) (< 5 main_~k~0) (<= main_~c~0 6))} is VALID [2022-04-15 10:46:55,990 INFO L290 TraceCheckUtils]: 61: Hoare triple {6831#(and (= main_~y~0 6) (< 5 main_~k~0) (<= main_~c~0 6))} assume !(~c~0 < ~k~0); {6856#(and (= main_~y~0 6) (<= main_~k~0 6) (< 5 main_~k~0))} is VALID [2022-04-15 10:46:55,990 INFO L272 TraceCheckUtils]: 62: Hoare triple {6856#(and (= main_~y~0 6) (<= main_~k~0 6) (< 5 main_~k~0))} call __VERIFIER_assert((if 0 == ~k~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {6860#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 10:46:55,991 INFO L290 TraceCheckUtils]: 63: Hoare triple {6860#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {6864#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 10:46:55,991 INFO L290 TraceCheckUtils]: 64: Hoare triple {6864#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {6662#false} is VALID [2022-04-15 10:46:55,991 INFO L290 TraceCheckUtils]: 65: Hoare triple {6662#false} assume !false; {6662#false} is VALID [2022-04-15 10:46:55,991 INFO L134 CoverageAnalysis]: Checked inductivity of 182 backedges. 14 proven. 84 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2022-04-15 10:46:55,991 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 10:46:56,679 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 10:46:56,679 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [644314238] [2022-04-15 10:46:56,679 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 10:46:56,679 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [544739229] [2022-04-15 10:46:56,679 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [544739229] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 10:46:56,679 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-15 10:46:56,679 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2022-04-15 10:46:56,679 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 10:46:56,679 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1350857383] [2022-04-15 10:46:56,679 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1350857383] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 10:46:56,679 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 10:46:56,680 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-04-15 10:46:56,680 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [548243302] [2022-04-15 10:46:56,680 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 10:46:56,680 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 2.727272727272727) internal successors, (30), 11 states have internal predecessors, (30), 9 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Word has length 66 [2022-04-15 10:46:56,680 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 10:46:56,681 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 12 states, 11 states have (on average 2.727272727272727) internal successors, (30), 11 states have internal predecessors, (30), 9 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-15 10:46:56,714 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 48 edges. 48 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 10:46:56,715 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-04-15 10:46:56,715 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 10:46:56,715 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-04-15 10:46:56,715 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=270, Unknown=0, NotChecked=0, Total=342 [2022-04-15 10:46:56,715 INFO L87 Difference]: Start difference. First operand 69 states and 70 transitions. Second operand has 12 states, 11 states have (on average 2.727272727272727) internal successors, (30), 11 states have internal predecessors, (30), 9 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-15 10:46:57,210 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 10:46:57,211 INFO L93 Difference]: Finished difference Result 76 states and 78 transitions. [2022-04-15 10:46:57,211 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-04-15 10:46:57,211 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 2.727272727272727) internal successors, (30), 11 states have internal predecessors, (30), 9 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Word has length 66 [2022-04-15 10:46:57,211 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 10:46:57,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 11 states have (on average 2.727272727272727) internal successors, (30), 11 states have internal predecessors, (30), 9 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-15 10:46:57,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 59 transitions. [2022-04-15 10:46:57,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 11 states have (on average 2.727272727272727) internal successors, (30), 11 states have internal predecessors, (30), 9 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-15 10:46:57,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 59 transitions. [2022-04-15 10:46:57,215 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 12 states and 59 transitions. [2022-04-15 10:46:57,241 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-15 10:46:57,244 INFO L225 Difference]: With dead ends: 76 [2022-04-15 10:46:57,244 INFO L226 Difference]: Without dead ends: 71 [2022-04-15 10:46:57,244 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 93 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-15 10:46:57,264 INFO L913 BasicCegarLoop]: 42 mSDtfsCounter, 2 mSDsluCounter, 258 mSDsCounter, 0 mSdLazyCounter, 231 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 300 SdHoareTripleChecker+Invalid, 231 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 231 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-15 10:46:57,264 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [2 Valid, 300 Invalid, 231 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 231 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-15 10:46:57,265 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2022-04-15 10:46:57,325 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2022-04-15 10:46:57,326 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 10:46:57,326 INFO L82 GeneralOperation]: Start isEquivalent. First operand 71 states. Second operand has 71 states, 51 states have (on average 1.0392156862745099) internal successors, (53), 51 states have internal predecessors, (53), 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-15 10:46:57,326 INFO L74 IsIncluded]: Start isIncluded. First operand 71 states. Second operand has 71 states, 51 states have (on average 1.0392156862745099) internal successors, (53), 51 states have internal predecessors, (53), 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-15 10:46:57,326 INFO L87 Difference]: Start difference. First operand 71 states. Second operand has 71 states, 51 states have (on average 1.0392156862745099) internal successors, (53), 51 states have internal predecessors, (53), 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-15 10:46:57,327 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 10:46:57,327 INFO L93 Difference]: Finished difference Result 71 states and 73 transitions. [2022-04-15 10:46:57,327 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 73 transitions. [2022-04-15 10:46:57,328 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 10:46:57,328 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 10:46:57,328 INFO L74 IsIncluded]: Start isIncluded. First operand has 71 states, 51 states have (on average 1.0392156862745099) internal successors, (53), 51 states have internal predecessors, (53), 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 71 states. [2022-04-15 10:46:57,328 INFO L87 Difference]: Start difference. First operand has 71 states, 51 states have (on average 1.0392156862745099) internal successors, (53), 51 states have internal predecessors, (53), 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 71 states. [2022-04-15 10:46:57,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 10:46:57,329 INFO L93 Difference]: Finished difference Result 71 states and 73 transitions. [2022-04-15 10:46:57,329 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 73 transitions. [2022-04-15 10:46:57,329 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 10:46:57,329 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 10:46:57,329 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 10:46:57,329 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 10:46:57,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 51 states have (on average 1.0392156862745099) internal successors, (53), 51 states have internal predecessors, (53), 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-15 10:46:57,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 73 transitions. [2022-04-15 10:46:57,330 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 73 transitions. Word has length 66 [2022-04-15 10:46:57,330 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 10:46:57,330 INFO L478 AbstractCegarLoop]: Abstraction has 71 states and 73 transitions. [2022-04-15 10:46:57,331 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 2.727272727272727) internal successors, (30), 11 states have internal predecessors, (30), 9 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-15 10:46:57,331 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 71 states and 73 transitions. [2022-04-15 10:46:57,851 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 73 edges. 73 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 10:46:57,851 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 73 transitions. [2022-04-15 10:46:57,851 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2022-04-15 10:46:57,851 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 10:46:57,851 INFO L499 BasicCegarLoop]: trace histogram [8, 8, 7, 7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 10:46:57,859 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Ended with exit code 0 [2022-04-15 10:46:58,052 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-15 10:46:58,052 INFO L403 AbstractCegarLoop]: === Iteration 17 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 10:46:58,052 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 10:46:58,052 INFO L85 PathProgramCache]: Analyzing trace with hash 1699217054, now seen corresponding path program 13 times [2022-04-15 10:46:58,052 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 10:46:58,052 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [9373444] [2022-04-15 10:46:58,160 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 4 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 10:46:58,160 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONLINEAR_UPDATE [2022-04-15 10:46:58,160 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 10:46:58,160 INFO L85 PathProgramCache]: Analyzing trace with hash 1699217054, now seen corresponding path program 14 times [2022-04-15 10:46:58,160 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 10:46:58,161 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [937960639] [2022-04-15 10:46:58,161 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 10:46:58,161 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 10:46:58,170 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 10:46:58,170 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1354135077] [2022-04-15 10:46:58,170 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 10:46:58,170 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 10:46:58,170 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 10:46:58,171 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-15 10:46:58,190 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-15 10:46:58,231 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-15 10:46:58,232 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 10:46:58,232 INFO L263 TraceCheckSpWp]: Trace formula consists of 218 conjuncts, 19 conjunts are in the unsatisfiable core [2022-04-15 10:46:58,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 10:46:58,246 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 10:46:58,612 INFO L272 TraceCheckUtils]: 0: Hoare triple {7455#true} call ULTIMATE.init(); {7455#true} is VALID [2022-04-15 10:46:58,612 INFO L290 TraceCheckUtils]: 1: Hoare triple {7455#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; {7463#(<= ~counter~0 0)} is VALID [2022-04-15 10:46:58,613 INFO L290 TraceCheckUtils]: 2: Hoare triple {7463#(<= ~counter~0 0)} assume true; {7463#(<= ~counter~0 0)} is VALID [2022-04-15 10:46:58,613 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7463#(<= ~counter~0 0)} {7455#true} #57#return; {7463#(<= ~counter~0 0)} is VALID [2022-04-15 10:46:58,613 INFO L272 TraceCheckUtils]: 4: Hoare triple {7463#(<= ~counter~0 0)} call #t~ret6 := main(); {7463#(<= ~counter~0 0)} is VALID [2022-04-15 10:46:58,614 INFO L290 TraceCheckUtils]: 5: Hoare triple {7463#(<= ~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;~y~0 := 0;~x~0 := 0;~c~0 := 0; {7463#(<= ~counter~0 0)} is VALID [2022-04-15 10:46:58,614 INFO L290 TraceCheckUtils]: 6: Hoare triple {7463#(<= ~counter~0 0)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {7479#(<= ~counter~0 1)} is VALID [2022-04-15 10:46:58,615 INFO L290 TraceCheckUtils]: 7: Hoare triple {7479#(<= ~counter~0 1)} assume !!(#t~post5 < 20);havoc #t~post5; {7479#(<= ~counter~0 1)} is VALID [2022-04-15 10:46:58,615 INFO L272 TraceCheckUtils]: 8: Hoare triple {7479#(<= ~counter~0 1)} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {7479#(<= ~counter~0 1)} is VALID [2022-04-15 10:46:58,615 INFO L290 TraceCheckUtils]: 9: Hoare triple {7479#(<= ~counter~0 1)} ~cond := #in~cond; {7479#(<= ~counter~0 1)} is VALID [2022-04-15 10:46:58,616 INFO L290 TraceCheckUtils]: 10: Hoare triple {7479#(<= ~counter~0 1)} assume !(0 == ~cond); {7479#(<= ~counter~0 1)} is VALID [2022-04-15 10:46:58,616 INFO L290 TraceCheckUtils]: 11: Hoare triple {7479#(<= ~counter~0 1)} assume true; {7479#(<= ~counter~0 1)} is VALID [2022-04-15 10:46:58,617 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {7479#(<= ~counter~0 1)} {7479#(<= ~counter~0 1)} #51#return; {7479#(<= ~counter~0 1)} is VALID [2022-04-15 10:46:58,617 INFO L290 TraceCheckUtils]: 13: Hoare triple {7479#(<= ~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 + ~x~0; {7479#(<= ~counter~0 1)} is VALID [2022-04-15 10:46:58,617 INFO L290 TraceCheckUtils]: 14: Hoare triple {7479#(<= ~counter~0 1)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {7504#(<= ~counter~0 2)} is VALID [2022-04-15 10:46:58,618 INFO L290 TraceCheckUtils]: 15: Hoare triple {7504#(<= ~counter~0 2)} assume !!(#t~post5 < 20);havoc #t~post5; {7504#(<= ~counter~0 2)} is VALID [2022-04-15 10:46:58,618 INFO L272 TraceCheckUtils]: 16: Hoare triple {7504#(<= ~counter~0 2)} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {7504#(<= ~counter~0 2)} is VALID [2022-04-15 10:46:58,618 INFO L290 TraceCheckUtils]: 17: Hoare triple {7504#(<= ~counter~0 2)} ~cond := #in~cond; {7504#(<= ~counter~0 2)} is VALID [2022-04-15 10:46:58,619 INFO L290 TraceCheckUtils]: 18: Hoare triple {7504#(<= ~counter~0 2)} assume !(0 == ~cond); {7504#(<= ~counter~0 2)} is VALID [2022-04-15 10:46:58,619 INFO L290 TraceCheckUtils]: 19: Hoare triple {7504#(<= ~counter~0 2)} assume true; {7504#(<= ~counter~0 2)} is VALID [2022-04-15 10:46:58,620 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {7504#(<= ~counter~0 2)} {7504#(<= ~counter~0 2)} #51#return; {7504#(<= ~counter~0 2)} is VALID [2022-04-15 10:46:58,620 INFO L290 TraceCheckUtils]: 21: Hoare triple {7504#(<= ~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 + ~x~0; {7504#(<= ~counter~0 2)} is VALID [2022-04-15 10:46:58,620 INFO L290 TraceCheckUtils]: 22: Hoare triple {7504#(<= ~counter~0 2)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {7529#(<= ~counter~0 3)} is VALID [2022-04-15 10:46:58,621 INFO L290 TraceCheckUtils]: 23: Hoare triple {7529#(<= ~counter~0 3)} assume !!(#t~post5 < 20);havoc #t~post5; {7529#(<= ~counter~0 3)} is VALID [2022-04-15 10:46:58,621 INFO L272 TraceCheckUtils]: 24: Hoare triple {7529#(<= ~counter~0 3)} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {7529#(<= ~counter~0 3)} is VALID [2022-04-15 10:46:58,622 INFO L290 TraceCheckUtils]: 25: Hoare triple {7529#(<= ~counter~0 3)} ~cond := #in~cond; {7529#(<= ~counter~0 3)} is VALID [2022-04-15 10:46:58,622 INFO L290 TraceCheckUtils]: 26: Hoare triple {7529#(<= ~counter~0 3)} assume !(0 == ~cond); {7529#(<= ~counter~0 3)} is VALID [2022-04-15 10:46:58,622 INFO L290 TraceCheckUtils]: 27: Hoare triple {7529#(<= ~counter~0 3)} assume true; {7529#(<= ~counter~0 3)} is VALID [2022-04-15 10:46:58,623 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {7529#(<= ~counter~0 3)} {7529#(<= ~counter~0 3)} #51#return; {7529#(<= ~counter~0 3)} is VALID [2022-04-15 10:46:58,623 INFO L290 TraceCheckUtils]: 29: Hoare triple {7529#(<= ~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 + ~x~0; {7529#(<= ~counter~0 3)} is VALID [2022-04-15 10:46:58,623 INFO L290 TraceCheckUtils]: 30: Hoare triple {7529#(<= ~counter~0 3)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {7554#(<= ~counter~0 4)} is VALID [2022-04-15 10:46:58,624 INFO L290 TraceCheckUtils]: 31: Hoare triple {7554#(<= ~counter~0 4)} assume !!(#t~post5 < 20);havoc #t~post5; {7554#(<= ~counter~0 4)} is VALID [2022-04-15 10:46:58,624 INFO L272 TraceCheckUtils]: 32: Hoare triple {7554#(<= ~counter~0 4)} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {7554#(<= ~counter~0 4)} is VALID [2022-04-15 10:46:58,625 INFO L290 TraceCheckUtils]: 33: Hoare triple {7554#(<= ~counter~0 4)} ~cond := #in~cond; {7554#(<= ~counter~0 4)} is VALID [2022-04-15 10:46:58,625 INFO L290 TraceCheckUtils]: 34: Hoare triple {7554#(<= ~counter~0 4)} assume !(0 == ~cond); {7554#(<= ~counter~0 4)} is VALID [2022-04-15 10:46:58,625 INFO L290 TraceCheckUtils]: 35: Hoare triple {7554#(<= ~counter~0 4)} assume true; {7554#(<= ~counter~0 4)} is VALID [2022-04-15 10:46:58,626 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {7554#(<= ~counter~0 4)} {7554#(<= ~counter~0 4)} #51#return; {7554#(<= ~counter~0 4)} is VALID [2022-04-15 10:46:58,626 INFO L290 TraceCheckUtils]: 37: Hoare triple {7554#(<= ~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 + ~x~0; {7554#(<= ~counter~0 4)} is VALID [2022-04-15 10:46:58,626 INFO L290 TraceCheckUtils]: 38: Hoare triple {7554#(<= ~counter~0 4)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {7579#(<= ~counter~0 5)} is VALID [2022-04-15 10:46:58,627 INFO L290 TraceCheckUtils]: 39: Hoare triple {7579#(<= ~counter~0 5)} assume !!(#t~post5 < 20);havoc #t~post5; {7579#(<= ~counter~0 5)} is VALID [2022-04-15 10:46:58,627 INFO L272 TraceCheckUtils]: 40: Hoare triple {7579#(<= ~counter~0 5)} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {7579#(<= ~counter~0 5)} is VALID [2022-04-15 10:46:58,628 INFO L290 TraceCheckUtils]: 41: Hoare triple {7579#(<= ~counter~0 5)} ~cond := #in~cond; {7579#(<= ~counter~0 5)} is VALID [2022-04-15 10:46:58,628 INFO L290 TraceCheckUtils]: 42: Hoare triple {7579#(<= ~counter~0 5)} assume !(0 == ~cond); {7579#(<= ~counter~0 5)} is VALID [2022-04-15 10:46:58,628 INFO L290 TraceCheckUtils]: 43: Hoare triple {7579#(<= ~counter~0 5)} assume true; {7579#(<= ~counter~0 5)} is VALID [2022-04-15 10:46:58,629 INFO L284 TraceCheckUtils]: 44: Hoare quadruple {7579#(<= ~counter~0 5)} {7579#(<= ~counter~0 5)} #51#return; {7579#(<= ~counter~0 5)} is VALID [2022-04-15 10:46:58,629 INFO L290 TraceCheckUtils]: 45: Hoare triple {7579#(<= ~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 + ~x~0; {7579#(<= ~counter~0 5)} is VALID [2022-04-15 10:46:58,629 INFO L290 TraceCheckUtils]: 46: Hoare triple {7579#(<= ~counter~0 5)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {7604#(<= ~counter~0 6)} is VALID [2022-04-15 10:46:58,630 INFO L290 TraceCheckUtils]: 47: Hoare triple {7604#(<= ~counter~0 6)} assume !!(#t~post5 < 20);havoc #t~post5; {7604#(<= ~counter~0 6)} is VALID [2022-04-15 10:46:58,630 INFO L272 TraceCheckUtils]: 48: Hoare triple {7604#(<= ~counter~0 6)} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {7604#(<= ~counter~0 6)} is VALID [2022-04-15 10:46:58,630 INFO L290 TraceCheckUtils]: 49: Hoare triple {7604#(<= ~counter~0 6)} ~cond := #in~cond; {7604#(<= ~counter~0 6)} is VALID [2022-04-15 10:46:58,631 INFO L290 TraceCheckUtils]: 50: Hoare triple {7604#(<= ~counter~0 6)} assume !(0 == ~cond); {7604#(<= ~counter~0 6)} is VALID [2022-04-15 10:46:58,631 INFO L290 TraceCheckUtils]: 51: Hoare triple {7604#(<= ~counter~0 6)} assume true; {7604#(<= ~counter~0 6)} is VALID [2022-04-15 10:46:58,631 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {7604#(<= ~counter~0 6)} {7604#(<= ~counter~0 6)} #51#return; {7604#(<= ~counter~0 6)} is VALID [2022-04-15 10:46:58,632 INFO L290 TraceCheckUtils]: 53: Hoare triple {7604#(<= ~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 + ~x~0; {7604#(<= ~counter~0 6)} is VALID [2022-04-15 10:46:58,632 INFO L290 TraceCheckUtils]: 54: Hoare triple {7604#(<= ~counter~0 6)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {7629#(<= ~counter~0 7)} is VALID [2022-04-15 10:46:58,633 INFO L290 TraceCheckUtils]: 55: Hoare triple {7629#(<= ~counter~0 7)} assume !!(#t~post5 < 20);havoc #t~post5; {7629#(<= ~counter~0 7)} is VALID [2022-04-15 10:46:58,633 INFO L272 TraceCheckUtils]: 56: Hoare triple {7629#(<= ~counter~0 7)} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {7629#(<= ~counter~0 7)} is VALID [2022-04-15 10:46:58,633 INFO L290 TraceCheckUtils]: 57: Hoare triple {7629#(<= ~counter~0 7)} ~cond := #in~cond; {7629#(<= ~counter~0 7)} is VALID [2022-04-15 10:46:58,634 INFO L290 TraceCheckUtils]: 58: Hoare triple {7629#(<= ~counter~0 7)} assume !(0 == ~cond); {7629#(<= ~counter~0 7)} is VALID [2022-04-15 10:46:58,634 INFO L290 TraceCheckUtils]: 59: Hoare triple {7629#(<= ~counter~0 7)} assume true; {7629#(<= ~counter~0 7)} is VALID [2022-04-15 10:46:58,634 INFO L284 TraceCheckUtils]: 60: Hoare quadruple {7629#(<= ~counter~0 7)} {7629#(<= ~counter~0 7)} #51#return; {7629#(<= ~counter~0 7)} is VALID [2022-04-15 10:46:58,635 INFO L290 TraceCheckUtils]: 61: Hoare triple {7629#(<= ~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 + ~x~0; {7629#(<= ~counter~0 7)} is VALID [2022-04-15 10:46:58,635 INFO L290 TraceCheckUtils]: 62: Hoare triple {7629#(<= ~counter~0 7)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {7654#(<= |main_#t~post5| 7)} is VALID [2022-04-15 10:46:58,635 INFO L290 TraceCheckUtils]: 63: Hoare triple {7654#(<= |main_#t~post5| 7)} assume !(#t~post5 < 20);havoc #t~post5; {7456#false} is VALID [2022-04-15 10:46:58,635 INFO L272 TraceCheckUtils]: 64: Hoare triple {7456#false} call __VERIFIER_assert((if 0 == ~k~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {7456#false} is VALID [2022-04-15 10:46:58,635 INFO L290 TraceCheckUtils]: 65: Hoare triple {7456#false} ~cond := #in~cond; {7456#false} is VALID [2022-04-15 10:46:58,636 INFO L290 TraceCheckUtils]: 66: Hoare triple {7456#false} assume 0 == ~cond; {7456#false} is VALID [2022-04-15 10:46:58,636 INFO L290 TraceCheckUtils]: 67: Hoare triple {7456#false} assume !false; {7456#false} is VALID [2022-04-15 10:46:58,636 INFO L134 CoverageAnalysis]: Checked inductivity of 196 backedges. 14 proven. 182 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 10:46:58,636 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 10:46:59,024 INFO L290 TraceCheckUtils]: 67: Hoare triple {7456#false} assume !false; {7456#false} is VALID [2022-04-15 10:46:59,024 INFO L290 TraceCheckUtils]: 66: Hoare triple {7456#false} assume 0 == ~cond; {7456#false} is VALID [2022-04-15 10:46:59,024 INFO L290 TraceCheckUtils]: 65: Hoare triple {7456#false} ~cond := #in~cond; {7456#false} is VALID [2022-04-15 10:46:59,025 INFO L272 TraceCheckUtils]: 64: Hoare triple {7456#false} call __VERIFIER_assert((if 0 == ~k~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {7456#false} is VALID [2022-04-15 10:46:59,025 INFO L290 TraceCheckUtils]: 63: Hoare triple {7682#(< |main_#t~post5| 20)} assume !(#t~post5 < 20);havoc #t~post5; {7456#false} is VALID [2022-04-15 10:46:59,025 INFO L290 TraceCheckUtils]: 62: Hoare triple {7686#(< ~counter~0 20)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {7682#(< |main_#t~post5| 20)} is VALID [2022-04-15 10:46:59,025 INFO L290 TraceCheckUtils]: 61: Hoare triple {7686#(< ~counter~0 20)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {7686#(< ~counter~0 20)} is VALID [2022-04-15 10:46:59,026 INFO L284 TraceCheckUtils]: 60: Hoare quadruple {7455#true} {7686#(< ~counter~0 20)} #51#return; {7686#(< ~counter~0 20)} is VALID [2022-04-15 10:46:59,026 INFO L290 TraceCheckUtils]: 59: Hoare triple {7455#true} assume true; {7455#true} is VALID [2022-04-15 10:46:59,026 INFO L290 TraceCheckUtils]: 58: Hoare triple {7455#true} assume !(0 == ~cond); {7455#true} is VALID [2022-04-15 10:46:59,026 INFO L290 TraceCheckUtils]: 57: Hoare triple {7455#true} ~cond := #in~cond; {7455#true} is VALID [2022-04-15 10:46:59,026 INFO L272 TraceCheckUtils]: 56: Hoare triple {7686#(< ~counter~0 20)} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {7455#true} is VALID [2022-04-15 10:46:59,027 INFO L290 TraceCheckUtils]: 55: Hoare triple {7686#(< ~counter~0 20)} assume !!(#t~post5 < 20);havoc #t~post5; {7686#(< ~counter~0 20)} is VALID [2022-04-15 10:46:59,027 INFO L290 TraceCheckUtils]: 54: Hoare triple {7711#(< ~counter~0 19)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {7686#(< ~counter~0 20)} is VALID [2022-04-15 10:46:59,027 INFO L290 TraceCheckUtils]: 53: Hoare triple {7711#(< ~counter~0 19)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {7711#(< ~counter~0 19)} is VALID [2022-04-15 10:46:59,028 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {7455#true} {7711#(< ~counter~0 19)} #51#return; {7711#(< ~counter~0 19)} is VALID [2022-04-15 10:46:59,028 INFO L290 TraceCheckUtils]: 51: Hoare triple {7455#true} assume true; {7455#true} is VALID [2022-04-15 10:46:59,028 INFO L290 TraceCheckUtils]: 50: Hoare triple {7455#true} assume !(0 == ~cond); {7455#true} is VALID [2022-04-15 10:46:59,028 INFO L290 TraceCheckUtils]: 49: Hoare triple {7455#true} ~cond := #in~cond; {7455#true} is VALID [2022-04-15 10:46:59,028 INFO L272 TraceCheckUtils]: 48: Hoare triple {7711#(< ~counter~0 19)} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {7455#true} is VALID [2022-04-15 10:46:59,028 INFO L290 TraceCheckUtils]: 47: Hoare triple {7711#(< ~counter~0 19)} assume !!(#t~post5 < 20);havoc #t~post5; {7711#(< ~counter~0 19)} is VALID [2022-04-15 10:46:59,029 INFO L290 TraceCheckUtils]: 46: Hoare triple {7736#(< ~counter~0 18)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {7711#(< ~counter~0 19)} is VALID [2022-04-15 10:46:59,029 INFO L290 TraceCheckUtils]: 45: Hoare triple {7736#(< ~counter~0 18)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {7736#(< ~counter~0 18)} is VALID [2022-04-15 10:46:59,030 INFO L284 TraceCheckUtils]: 44: Hoare quadruple {7455#true} {7736#(< ~counter~0 18)} #51#return; {7736#(< ~counter~0 18)} is VALID [2022-04-15 10:46:59,030 INFO L290 TraceCheckUtils]: 43: Hoare triple {7455#true} assume true; {7455#true} is VALID [2022-04-15 10:46:59,030 INFO L290 TraceCheckUtils]: 42: Hoare triple {7455#true} assume !(0 == ~cond); {7455#true} is VALID [2022-04-15 10:46:59,030 INFO L290 TraceCheckUtils]: 41: Hoare triple {7455#true} ~cond := #in~cond; {7455#true} is VALID [2022-04-15 10:46:59,030 INFO L272 TraceCheckUtils]: 40: Hoare triple {7736#(< ~counter~0 18)} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {7455#true} is VALID [2022-04-15 10:46:59,030 INFO L290 TraceCheckUtils]: 39: Hoare triple {7736#(< ~counter~0 18)} assume !!(#t~post5 < 20);havoc #t~post5; {7736#(< ~counter~0 18)} is VALID [2022-04-15 10:46:59,031 INFO L290 TraceCheckUtils]: 38: Hoare triple {7761#(< ~counter~0 17)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {7736#(< ~counter~0 18)} is VALID [2022-04-15 10:46:59,031 INFO L290 TraceCheckUtils]: 37: Hoare triple {7761#(< ~counter~0 17)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {7761#(< ~counter~0 17)} is VALID [2022-04-15 10:46:59,031 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {7455#true} {7761#(< ~counter~0 17)} #51#return; {7761#(< ~counter~0 17)} is VALID [2022-04-15 10:46:59,032 INFO L290 TraceCheckUtils]: 35: Hoare triple {7455#true} assume true; {7455#true} is VALID [2022-04-15 10:46:59,032 INFO L290 TraceCheckUtils]: 34: Hoare triple {7455#true} assume !(0 == ~cond); {7455#true} is VALID [2022-04-15 10:46:59,032 INFO L290 TraceCheckUtils]: 33: Hoare triple {7455#true} ~cond := #in~cond; {7455#true} is VALID [2022-04-15 10:46:59,032 INFO L272 TraceCheckUtils]: 32: Hoare triple {7761#(< ~counter~0 17)} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {7455#true} is VALID [2022-04-15 10:46:59,032 INFO L290 TraceCheckUtils]: 31: Hoare triple {7761#(< ~counter~0 17)} assume !!(#t~post5 < 20);havoc #t~post5; {7761#(< ~counter~0 17)} is VALID [2022-04-15 10:46:59,032 INFO L290 TraceCheckUtils]: 30: Hoare triple {7786#(< ~counter~0 16)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {7761#(< ~counter~0 17)} is VALID [2022-04-15 10:46:59,033 INFO L290 TraceCheckUtils]: 29: Hoare triple {7786#(< ~counter~0 16)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {7786#(< ~counter~0 16)} is VALID [2022-04-15 10:46:59,033 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {7455#true} {7786#(< ~counter~0 16)} #51#return; {7786#(< ~counter~0 16)} is VALID [2022-04-15 10:46:59,033 INFO L290 TraceCheckUtils]: 27: Hoare triple {7455#true} assume true; {7455#true} is VALID [2022-04-15 10:46:59,033 INFO L290 TraceCheckUtils]: 26: Hoare triple {7455#true} assume !(0 == ~cond); {7455#true} is VALID [2022-04-15 10:46:59,033 INFO L290 TraceCheckUtils]: 25: Hoare triple {7455#true} ~cond := #in~cond; {7455#true} is VALID [2022-04-15 10:46:59,034 INFO L272 TraceCheckUtils]: 24: Hoare triple {7786#(< ~counter~0 16)} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {7455#true} is VALID [2022-04-15 10:46:59,034 INFO L290 TraceCheckUtils]: 23: Hoare triple {7786#(< ~counter~0 16)} assume !!(#t~post5 < 20);havoc #t~post5; {7786#(< ~counter~0 16)} is VALID [2022-04-15 10:46:59,034 INFO L290 TraceCheckUtils]: 22: Hoare triple {7811#(< ~counter~0 15)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {7786#(< ~counter~0 16)} is VALID [2022-04-15 10:46:59,035 INFO L290 TraceCheckUtils]: 21: Hoare triple {7811#(< ~counter~0 15)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {7811#(< ~counter~0 15)} is VALID [2022-04-15 10:46:59,035 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {7455#true} {7811#(< ~counter~0 15)} #51#return; {7811#(< ~counter~0 15)} is VALID [2022-04-15 10:46:59,035 INFO L290 TraceCheckUtils]: 19: Hoare triple {7455#true} assume true; {7455#true} is VALID [2022-04-15 10:46:59,035 INFO L290 TraceCheckUtils]: 18: Hoare triple {7455#true} assume !(0 == ~cond); {7455#true} is VALID [2022-04-15 10:46:59,035 INFO L290 TraceCheckUtils]: 17: Hoare triple {7455#true} ~cond := #in~cond; {7455#true} is VALID [2022-04-15 10:46:59,035 INFO L272 TraceCheckUtils]: 16: Hoare triple {7811#(< ~counter~0 15)} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {7455#true} is VALID [2022-04-15 10:46:59,036 INFO L290 TraceCheckUtils]: 15: Hoare triple {7811#(< ~counter~0 15)} assume !!(#t~post5 < 20);havoc #t~post5; {7811#(< ~counter~0 15)} is VALID [2022-04-15 10:46:59,036 INFO L290 TraceCheckUtils]: 14: Hoare triple {7836#(< ~counter~0 14)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {7811#(< ~counter~0 15)} is VALID [2022-04-15 10:46:59,036 INFO L290 TraceCheckUtils]: 13: Hoare triple {7836#(< ~counter~0 14)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {7836#(< ~counter~0 14)} is VALID [2022-04-15 10:46:59,037 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {7455#true} {7836#(< ~counter~0 14)} #51#return; {7836#(< ~counter~0 14)} is VALID [2022-04-15 10:46:59,037 INFO L290 TraceCheckUtils]: 11: Hoare triple {7455#true} assume true; {7455#true} is VALID [2022-04-15 10:46:59,037 INFO L290 TraceCheckUtils]: 10: Hoare triple {7455#true} assume !(0 == ~cond); {7455#true} is VALID [2022-04-15 10:46:59,037 INFO L290 TraceCheckUtils]: 9: Hoare triple {7455#true} ~cond := #in~cond; {7455#true} is VALID [2022-04-15 10:46:59,037 INFO L272 TraceCheckUtils]: 8: Hoare triple {7836#(< ~counter~0 14)} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {7455#true} is VALID [2022-04-15 10:46:59,037 INFO L290 TraceCheckUtils]: 7: Hoare triple {7836#(< ~counter~0 14)} assume !!(#t~post5 < 20);havoc #t~post5; {7836#(< ~counter~0 14)} is VALID [2022-04-15 10:46:59,038 INFO L290 TraceCheckUtils]: 6: Hoare triple {7861#(< ~counter~0 13)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {7836#(< ~counter~0 14)} is VALID [2022-04-15 10:46:59,038 INFO L290 TraceCheckUtils]: 5: Hoare triple {7861#(< ~counter~0 13)} 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;~y~0 := 0;~x~0 := 0;~c~0 := 0; {7861#(< ~counter~0 13)} is VALID [2022-04-15 10:46:59,038 INFO L272 TraceCheckUtils]: 4: Hoare triple {7861#(< ~counter~0 13)} call #t~ret6 := main(); {7861#(< ~counter~0 13)} is VALID [2022-04-15 10:46:59,039 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7861#(< ~counter~0 13)} {7455#true} #57#return; {7861#(< ~counter~0 13)} is VALID [2022-04-15 10:46:59,039 INFO L290 TraceCheckUtils]: 2: Hoare triple {7861#(< ~counter~0 13)} assume true; {7861#(< ~counter~0 13)} is VALID [2022-04-15 10:46:59,040 INFO L290 TraceCheckUtils]: 1: Hoare triple {7455#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; {7861#(< ~counter~0 13)} is VALID [2022-04-15 10:46:59,040 INFO L272 TraceCheckUtils]: 0: Hoare triple {7455#true} call ULTIMATE.init(); {7455#true} is VALID [2022-04-15 10:46:59,040 INFO L134 CoverageAnalysis]: Checked inductivity of 196 backedges. 14 proven. 98 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2022-04-15 10:46:59,040 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 10:46:59,040 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [937960639] [2022-04-15 10:46:59,040 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 10:46:59,040 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1354135077] [2022-04-15 10:46:59,040 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1354135077] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 10:46:59,040 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-15 10:46:59,040 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 20 [2022-04-15 10:46:59,041 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 10:46:59,041 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [9373444] [2022-04-15 10:46:59,041 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [9373444] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 10:46:59,041 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 10:46:59,041 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-04-15 10:46:59,041 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [993043625] [2022-04-15 10:46:59,041 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 10:46:59,041 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 4.545454545454546) internal successors, (50), 10 states have internal predecessors, (50), 10 states have call successors, (10), 10 states have call predecessors, (10), 8 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Word has length 68 [2022-04-15 10:46:59,042 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 10:46:59,042 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 11 states, 11 states have (on average 4.545454545454546) internal successors, (50), 10 states have internal predecessors, (50), 10 states have call successors, (10), 10 states have call predecessors, (10), 8 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-15 10:46:59,087 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 68 edges. 68 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 10:46:59,088 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-04-15 10:46:59,088 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 10:46:59,088 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-04-15 10:46:59,088 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=158, Invalid=222, Unknown=0, NotChecked=0, Total=380 [2022-04-15 10:46:59,088 INFO L87 Difference]: Start difference. First operand 71 states and 73 transitions. Second operand has 11 states, 11 states have (on average 4.545454545454546) internal successors, (50), 10 states have internal predecessors, (50), 10 states have call successors, (10), 10 states have call predecessors, (10), 8 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-15 10:46:59,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 10:46:59,352 INFO L93 Difference]: Finished difference Result 82 states and 83 transitions. [2022-04-15 10:46:59,352 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-04-15 10:46:59,353 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 4.545454545454546) internal successors, (50), 10 states have internal predecessors, (50), 10 states have call successors, (10), 10 states have call predecessors, (10), 8 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Word has length 68 [2022-04-15 10:46:59,353 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 10:46:59,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 4.545454545454546) internal successors, (50), 10 states have internal predecessors, (50), 10 states have call successors, (10), 10 states have call predecessors, (10), 8 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-15 10:46:59,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 82 transitions. [2022-04-15 10:46:59,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 4.545454545454546) internal successors, (50), 10 states have internal predecessors, (50), 10 states have call successors, (10), 10 states have call predecessors, (10), 8 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-15 10:46:59,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 82 transitions. [2022-04-15 10:46:59,357 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 18 states and 82 transitions. [2022-04-15 10:46:59,441 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 82 edges. 82 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 10:46:59,442 INFO L225 Difference]: With dead ends: 82 [2022-04-15 10:46:59,442 INFO L226 Difference]: Without dead ends: 77 [2022-04-15 10:46:59,442 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 142 GetRequests, 117 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=291, Invalid=411, Unknown=0, NotChecked=0, Total=702 [2022-04-15 10:46:59,443 INFO L913 BasicCegarLoop]: 24 mSDtfsCounter, 2 mSDsluCounter, 77 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 101 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 10:46:59,443 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [2 Valid, 101 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 10:46:59,443 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2022-04-15 10:46:59,550 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 77. [2022-04-15 10:46:59,551 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 10:46:59,551 INFO L82 GeneralOperation]: Start isEquivalent. First operand 77 states. Second operand has 77 states, 56 states have (on average 1.0357142857142858) internal successors, (58), 56 states have internal predecessors, (58), 11 states have call successors, (11), 11 states have call predecessors, (11), 9 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-15 10:46:59,551 INFO L74 IsIncluded]: Start isIncluded. First operand 77 states. Second operand has 77 states, 56 states have (on average 1.0357142857142858) internal successors, (58), 56 states have internal predecessors, (58), 11 states have call successors, (11), 11 states have call predecessors, (11), 9 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-15 10:46:59,551 INFO L87 Difference]: Start difference. First operand 77 states. Second operand has 77 states, 56 states have (on average 1.0357142857142858) internal successors, (58), 56 states have internal predecessors, (58), 11 states have call successors, (11), 11 states have call predecessors, (11), 9 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-15 10:46:59,552 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 10:46:59,552 INFO L93 Difference]: Finished difference Result 77 states and 78 transitions. [2022-04-15 10:46:59,552 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 78 transitions. [2022-04-15 10:46:59,552 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 10:46:59,552 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 10:46:59,553 INFO L74 IsIncluded]: Start isIncluded. First operand has 77 states, 56 states have (on average 1.0357142857142858) internal successors, (58), 56 states have internal predecessors, (58), 11 states have call successors, (11), 11 states have call predecessors, (11), 9 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) Second operand 77 states. [2022-04-15 10:46:59,553 INFO L87 Difference]: Start difference. First operand has 77 states, 56 states have (on average 1.0357142857142858) internal successors, (58), 56 states have internal predecessors, (58), 11 states have call successors, (11), 11 states have call predecessors, (11), 9 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) Second operand 77 states. [2022-04-15 10:46:59,554 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 10:46:59,554 INFO L93 Difference]: Finished difference Result 77 states and 78 transitions. [2022-04-15 10:46:59,554 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 78 transitions. [2022-04-15 10:46:59,554 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 10:46:59,554 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 10:46:59,554 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 10:46:59,554 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 10:46:59,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 56 states have (on average 1.0357142857142858) internal successors, (58), 56 states have internal predecessors, (58), 11 states have call successors, (11), 11 states have call predecessors, (11), 9 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-15 10:46:59,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 78 transitions. [2022-04-15 10:46:59,555 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 78 transitions. Word has length 68 [2022-04-15 10:46:59,555 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 10:46:59,555 INFO L478 AbstractCegarLoop]: Abstraction has 77 states and 78 transitions. [2022-04-15 10:46:59,556 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 4.545454545454546) internal successors, (50), 10 states have internal predecessors, (50), 10 states have call successors, (10), 10 states have call predecessors, (10), 8 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-15 10:46:59,556 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 77 states and 78 transitions. [2022-04-15 10:47:00,079 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-15 10:47:00,080 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 78 transitions. [2022-04-15 10:47:00,080 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2022-04-15 10:47:00,080 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 10:47:00,080 INFO L499 BasicCegarLoop]: trace histogram [9, 8, 8, 8, 8, 8, 8, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 10:47:00,096 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-15 10:47:00,281 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-15 10:47:00,281 INFO L403 AbstractCegarLoop]: === Iteration 18 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 10:47:00,281 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 10:47:00,281 INFO L85 PathProgramCache]: Analyzing trace with hash -763940164, now seen corresponding path program 13 times [2022-04-15 10:47:00,281 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 10:47:00,281 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [475487817] [2022-04-15 10:47:00,362 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 4 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 10:47:00,363 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONLINEAR_UPDATE [2022-04-15 10:47:00,363 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 10:47:00,363 INFO L85 PathProgramCache]: Analyzing trace with hash -763940164, now seen corresponding path program 14 times [2022-04-15 10:47:00,363 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 10:47:00,363 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [643317262] [2022-04-15 10:47:00,363 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 10:47:00,363 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 10:47:00,374 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 10:47:00,374 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1384961718] [2022-04-15 10:47:00,374 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 10:47:00,375 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 10:47:00,375 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 10:47:00,375 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-15 10:47:00,376 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-15 10:47:00,780 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-15 10:47:00,780 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 10:47:00,781 INFO L263 TraceCheckSpWp]: Trace formula consists of 228 conjuncts, 36 conjunts are in the unsatisfiable core [2022-04-15 10:47:00,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 10:47:00,795 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 10:47:01,258 INFO L272 TraceCheckUtils]: 0: Hoare triple {8368#true} call ULTIMATE.init(); {8368#true} is VALID [2022-04-15 10:47:01,259 INFO L290 TraceCheckUtils]: 1: Hoare triple {8368#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; {8368#true} is VALID [2022-04-15 10:47:01,259 INFO L290 TraceCheckUtils]: 2: Hoare triple {8368#true} assume true; {8368#true} is VALID [2022-04-15 10:47:01,259 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {8368#true} {8368#true} #57#return; {8368#true} is VALID [2022-04-15 10:47:01,259 INFO L272 TraceCheckUtils]: 4: Hoare triple {8368#true} call #t~ret6 := main(); {8368#true} is VALID [2022-04-15 10:47:01,259 INFO L290 TraceCheckUtils]: 5: Hoare triple {8368#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;~y~0 := 0;~x~0 := 0;~c~0 := 0; {8388#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-15 10:47:01,260 INFO L290 TraceCheckUtils]: 6: Hoare triple {8388#(and (= main_~c~0 0) (= main_~y~0 0))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {8388#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-15 10:47:01,260 INFO L290 TraceCheckUtils]: 7: Hoare triple {8388#(and (= main_~c~0 0) (= main_~y~0 0))} assume !!(#t~post5 < 20);havoc #t~post5; {8388#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-15 10:47:01,260 INFO L272 TraceCheckUtils]: 8: Hoare triple {8388#(and (= main_~c~0 0) (= main_~y~0 0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {8368#true} is VALID [2022-04-15 10:47:01,260 INFO L290 TraceCheckUtils]: 9: Hoare triple {8368#true} ~cond := #in~cond; {8368#true} is VALID [2022-04-15 10:47:01,260 INFO L290 TraceCheckUtils]: 10: Hoare triple {8368#true} assume !(0 == ~cond); {8368#true} is VALID [2022-04-15 10:47:01,260 INFO L290 TraceCheckUtils]: 11: Hoare triple {8368#true} assume true; {8368#true} is VALID [2022-04-15 10:47:01,261 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {8368#true} {8388#(and (= main_~c~0 0) (= main_~y~0 0))} #51#return; {8388#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-15 10:47:01,261 INFO L290 TraceCheckUtils]: 13: Hoare triple {8388#(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 + ~x~0; {8413#(and (= main_~y~0 1) (= main_~c~0 1))} is VALID [2022-04-15 10:47:01,262 INFO L290 TraceCheckUtils]: 14: Hoare triple {8413#(and (= main_~y~0 1) (= main_~c~0 1))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {8413#(and (= main_~y~0 1) (= main_~c~0 1))} is VALID [2022-04-15 10:47:01,262 INFO L290 TraceCheckUtils]: 15: Hoare triple {8413#(and (= main_~y~0 1) (= main_~c~0 1))} assume !!(#t~post5 < 20);havoc #t~post5; {8413#(and (= main_~y~0 1) (= main_~c~0 1))} is VALID [2022-04-15 10:47:01,262 INFO L272 TraceCheckUtils]: 16: Hoare triple {8413#(and (= main_~y~0 1) (= main_~c~0 1))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {8368#true} is VALID [2022-04-15 10:47:01,262 INFO L290 TraceCheckUtils]: 17: Hoare triple {8368#true} ~cond := #in~cond; {8368#true} is VALID [2022-04-15 10:47:01,262 INFO L290 TraceCheckUtils]: 18: Hoare triple {8368#true} assume !(0 == ~cond); {8368#true} is VALID [2022-04-15 10:47:01,262 INFO L290 TraceCheckUtils]: 19: Hoare triple {8368#true} assume true; {8368#true} is VALID [2022-04-15 10:47:01,263 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {8368#true} {8413#(and (= main_~y~0 1) (= main_~c~0 1))} #51#return; {8413#(and (= main_~y~0 1) (= main_~c~0 1))} is VALID [2022-04-15 10:47:01,263 INFO L290 TraceCheckUtils]: 21: Hoare triple {8413#(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 + ~x~0; {8438#(and (= main_~y~0 2) (= main_~c~0 2))} is VALID [2022-04-15 10:47:01,264 INFO L290 TraceCheckUtils]: 22: Hoare triple {8438#(and (= main_~y~0 2) (= main_~c~0 2))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {8438#(and (= main_~y~0 2) (= main_~c~0 2))} is VALID [2022-04-15 10:47:01,264 INFO L290 TraceCheckUtils]: 23: Hoare triple {8438#(and (= main_~y~0 2) (= main_~c~0 2))} assume !!(#t~post5 < 20);havoc #t~post5; {8438#(and (= main_~y~0 2) (= main_~c~0 2))} is VALID [2022-04-15 10:47:01,264 INFO L272 TraceCheckUtils]: 24: Hoare triple {8438#(and (= main_~y~0 2) (= main_~c~0 2))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {8368#true} is VALID [2022-04-15 10:47:01,264 INFO L290 TraceCheckUtils]: 25: Hoare triple {8368#true} ~cond := #in~cond; {8368#true} is VALID [2022-04-15 10:47:01,264 INFO L290 TraceCheckUtils]: 26: Hoare triple {8368#true} assume !(0 == ~cond); {8368#true} is VALID [2022-04-15 10:47:01,264 INFO L290 TraceCheckUtils]: 27: Hoare triple {8368#true} assume true; {8368#true} is VALID [2022-04-15 10:47:01,265 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {8368#true} {8438#(and (= main_~y~0 2) (= main_~c~0 2))} #51#return; {8438#(and (= main_~y~0 2) (= main_~c~0 2))} is VALID [2022-04-15 10:47:01,265 INFO L290 TraceCheckUtils]: 29: Hoare triple {8438#(and (= main_~y~0 2) (= 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 + ~x~0; {8463#(and (= main_~y~0 3) (= main_~c~0 3))} is VALID [2022-04-15 10:47:01,266 INFO L290 TraceCheckUtils]: 30: Hoare triple {8463#(and (= main_~y~0 3) (= main_~c~0 3))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {8463#(and (= main_~y~0 3) (= main_~c~0 3))} is VALID [2022-04-15 10:47:01,266 INFO L290 TraceCheckUtils]: 31: Hoare triple {8463#(and (= main_~y~0 3) (= main_~c~0 3))} assume !!(#t~post5 < 20);havoc #t~post5; {8463#(and (= main_~y~0 3) (= main_~c~0 3))} is VALID [2022-04-15 10:47:01,266 INFO L272 TraceCheckUtils]: 32: Hoare triple {8463#(and (= main_~y~0 3) (= main_~c~0 3))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {8368#true} is VALID [2022-04-15 10:47:01,266 INFO L290 TraceCheckUtils]: 33: Hoare triple {8368#true} ~cond := #in~cond; {8368#true} is VALID [2022-04-15 10:47:01,266 INFO L290 TraceCheckUtils]: 34: Hoare triple {8368#true} assume !(0 == ~cond); {8368#true} is VALID [2022-04-15 10:47:01,266 INFO L290 TraceCheckUtils]: 35: Hoare triple {8368#true} assume true; {8368#true} is VALID [2022-04-15 10:47:01,267 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {8368#true} {8463#(and (= main_~y~0 3) (= main_~c~0 3))} #51#return; {8463#(and (= main_~y~0 3) (= main_~c~0 3))} is VALID [2022-04-15 10:47:01,267 INFO L290 TraceCheckUtils]: 37: Hoare triple {8463#(and (= main_~y~0 3) (= main_~c~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 + ~x~0; {8488#(and (= (+ (- 1) main_~c~0) 3) (= main_~y~0 4))} is VALID [2022-04-15 10:47:01,268 INFO L290 TraceCheckUtils]: 38: Hoare triple {8488#(and (= (+ (- 1) main_~c~0) 3) (= main_~y~0 4))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {8488#(and (= (+ (- 1) main_~c~0) 3) (= main_~y~0 4))} is VALID [2022-04-15 10:47:01,268 INFO L290 TraceCheckUtils]: 39: Hoare triple {8488#(and (= (+ (- 1) main_~c~0) 3) (= main_~y~0 4))} assume !!(#t~post5 < 20);havoc #t~post5; {8488#(and (= (+ (- 1) main_~c~0) 3) (= main_~y~0 4))} is VALID [2022-04-15 10:47:01,268 INFO L272 TraceCheckUtils]: 40: Hoare triple {8488#(and (= (+ (- 1) main_~c~0) 3) (= main_~y~0 4))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {8368#true} is VALID [2022-04-15 10:47:01,268 INFO L290 TraceCheckUtils]: 41: Hoare triple {8368#true} ~cond := #in~cond; {8368#true} is VALID [2022-04-15 10:47:01,268 INFO L290 TraceCheckUtils]: 42: Hoare triple {8368#true} assume !(0 == ~cond); {8368#true} is VALID [2022-04-15 10:47:01,268 INFO L290 TraceCheckUtils]: 43: Hoare triple {8368#true} assume true; {8368#true} is VALID [2022-04-15 10:47:01,269 INFO L284 TraceCheckUtils]: 44: Hoare quadruple {8368#true} {8488#(and (= (+ (- 1) main_~c~0) 3) (= main_~y~0 4))} #51#return; {8488#(and (= (+ (- 1) main_~c~0) 3) (= main_~y~0 4))} is VALID [2022-04-15 10:47:01,269 INFO L290 TraceCheckUtils]: 45: Hoare triple {8488#(and (= (+ (- 1) main_~c~0) 3) (= 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 + ~x~0; {8513#(and (= 5 main_~c~0) (= 5 main_~y~0))} is VALID [2022-04-15 10:47:01,270 INFO L290 TraceCheckUtils]: 46: Hoare triple {8513#(and (= 5 main_~c~0) (= 5 main_~y~0))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {8513#(and (= 5 main_~c~0) (= 5 main_~y~0))} is VALID [2022-04-15 10:47:01,270 INFO L290 TraceCheckUtils]: 47: Hoare triple {8513#(and (= 5 main_~c~0) (= 5 main_~y~0))} assume !!(#t~post5 < 20);havoc #t~post5; {8513#(and (= 5 main_~c~0) (= 5 main_~y~0))} is VALID [2022-04-15 10:47:01,270 INFO L272 TraceCheckUtils]: 48: Hoare triple {8513#(and (= 5 main_~c~0) (= 5 main_~y~0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {8368#true} is VALID [2022-04-15 10:47:01,270 INFO L290 TraceCheckUtils]: 49: Hoare triple {8368#true} ~cond := #in~cond; {8368#true} is VALID [2022-04-15 10:47:01,270 INFO L290 TraceCheckUtils]: 50: Hoare triple {8368#true} assume !(0 == ~cond); {8368#true} is VALID [2022-04-15 10:47:01,270 INFO L290 TraceCheckUtils]: 51: Hoare triple {8368#true} assume true; {8368#true} is VALID [2022-04-15 10:47:01,271 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {8368#true} {8513#(and (= 5 main_~c~0) (= 5 main_~y~0))} #51#return; {8513#(and (= 5 main_~c~0) (= 5 main_~y~0))} is VALID [2022-04-15 10:47:01,271 INFO L290 TraceCheckUtils]: 53: Hoare triple {8513#(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 + ~x~0; {8538#(and (= (+ (- 1) main_~c~0) 5) (= 5 (+ (- 1) main_~y~0)))} is VALID [2022-04-15 10:47:01,271 INFO L290 TraceCheckUtils]: 54: Hoare triple {8538#(and (= (+ (- 1) main_~c~0) 5) (= 5 (+ (- 1) main_~y~0)))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {8538#(and (= (+ (- 1) main_~c~0) 5) (= 5 (+ (- 1) main_~y~0)))} is VALID [2022-04-15 10:47:01,272 INFO L290 TraceCheckUtils]: 55: Hoare triple {8538#(and (= (+ (- 1) main_~c~0) 5) (= 5 (+ (- 1) main_~y~0)))} assume !!(#t~post5 < 20);havoc #t~post5; {8538#(and (= (+ (- 1) main_~c~0) 5) (= 5 (+ (- 1) main_~y~0)))} is VALID [2022-04-15 10:47:01,272 INFO L272 TraceCheckUtils]: 56: Hoare triple {8538#(and (= (+ (- 1) main_~c~0) 5) (= 5 (+ (- 1) main_~y~0)))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {8368#true} is VALID [2022-04-15 10:47:01,272 INFO L290 TraceCheckUtils]: 57: Hoare triple {8368#true} ~cond := #in~cond; {8368#true} is VALID [2022-04-15 10:47:01,272 INFO L290 TraceCheckUtils]: 58: Hoare triple {8368#true} assume !(0 == ~cond); {8368#true} is VALID [2022-04-15 10:47:01,272 INFO L290 TraceCheckUtils]: 59: Hoare triple {8368#true} assume true; {8368#true} is VALID [2022-04-15 10:47:01,273 INFO L284 TraceCheckUtils]: 60: Hoare quadruple {8368#true} {8538#(and (= (+ (- 1) main_~c~0) 5) (= 5 (+ (- 1) main_~y~0)))} #51#return; {8538#(and (= (+ (- 1) main_~c~0) 5) (= 5 (+ (- 1) main_~y~0)))} is VALID [2022-04-15 10:47:01,273 INFO L290 TraceCheckUtils]: 61: Hoare triple {8538#(and (= (+ (- 1) main_~c~0) 5) (= 5 (+ (- 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 + ~x~0; {8563#(and (<= main_~c~0 7) (= 7 main_~y~0) (< 6 main_~k~0))} is VALID [2022-04-15 10:47:01,273 INFO L290 TraceCheckUtils]: 62: Hoare triple {8563#(and (<= main_~c~0 7) (= 7 main_~y~0) (< 6 main_~k~0))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {8563#(and (<= main_~c~0 7) (= 7 main_~y~0) (< 6 main_~k~0))} is VALID [2022-04-15 10:47:01,274 INFO L290 TraceCheckUtils]: 63: Hoare triple {8563#(and (<= main_~c~0 7) (= 7 main_~y~0) (< 6 main_~k~0))} assume !!(#t~post5 < 20);havoc #t~post5; {8563#(and (<= main_~c~0 7) (= 7 main_~y~0) (< 6 main_~k~0))} is VALID [2022-04-15 10:47:01,274 INFO L272 TraceCheckUtils]: 64: Hoare triple {8563#(and (<= main_~c~0 7) (= 7 main_~y~0) (< 6 main_~k~0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {8368#true} is VALID [2022-04-15 10:47:01,274 INFO L290 TraceCheckUtils]: 65: Hoare triple {8368#true} ~cond := #in~cond; {8368#true} is VALID [2022-04-15 10:47:01,274 INFO L290 TraceCheckUtils]: 66: Hoare triple {8368#true} assume !(0 == ~cond); {8368#true} is VALID [2022-04-15 10:47:01,274 INFO L290 TraceCheckUtils]: 67: Hoare triple {8368#true} assume true; {8368#true} is VALID [2022-04-15 10:47:01,275 INFO L284 TraceCheckUtils]: 68: Hoare quadruple {8368#true} {8563#(and (<= main_~c~0 7) (= 7 main_~y~0) (< 6 main_~k~0))} #51#return; {8563#(and (<= main_~c~0 7) (= 7 main_~y~0) (< 6 main_~k~0))} is VALID [2022-04-15 10:47:01,275 INFO L290 TraceCheckUtils]: 69: Hoare triple {8563#(and (<= main_~c~0 7) (= 7 main_~y~0) (< 6 main_~k~0))} assume !(~c~0 < ~k~0); {8588#(and (<= main_~k~0 7) (= 7 main_~y~0) (< 6 main_~k~0))} is VALID [2022-04-15 10:47:01,276 INFO L272 TraceCheckUtils]: 70: Hoare triple {8588#(and (<= main_~k~0 7) (= 7 main_~y~0) (< 6 main_~k~0))} call __VERIFIER_assert((if 0 == ~k~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {8592#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 10:47:01,276 INFO L290 TraceCheckUtils]: 71: Hoare triple {8592#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {8596#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 10:47:01,277 INFO L290 TraceCheckUtils]: 72: Hoare triple {8596#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {8369#false} is VALID [2022-04-15 10:47:01,277 INFO L290 TraceCheckUtils]: 73: Hoare triple {8369#false} assume !false; {8369#false} is VALID [2022-04-15 10:47:01,277 INFO L134 CoverageAnalysis]: Checked inductivity of 240 backedges. 16 proven. 112 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2022-04-15 10:47:01,277 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 10:47:01,539 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 10:47:01,539 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [643317262] [2022-04-15 10:47:01,539 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 10:47:01,539 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1384961718] [2022-04-15 10:47:01,539 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1384961718] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 10:47:01,540 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-15 10:47:01,540 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2022-04-15 10:47:01,540 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 10:47:01,540 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [475487817] [2022-04-15 10:47:01,540 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [475487817] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 10:47:01,540 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 10:47:01,540 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-04-15 10:47:01,540 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1028974948] [2022-04-15 10:47:01,540 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 10:47:01,540 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 2.75) internal successors, (33), 12 states have internal predecessors, (33), 10 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) Word has length 74 [2022-04-15 10:47:01,541 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 10:47:01,541 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 13 states, 12 states have (on average 2.75) internal successors, (33), 12 states have internal predecessors, (33), 10 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-15 10:47:01,583 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 53 edges. 53 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 10:47:01,583 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-04-15 10:47:01,583 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 10:47:01,583 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-04-15 10:47:01,584 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=198, Unknown=0, NotChecked=0, Total=240 [2022-04-15 10:47:01,584 INFO L87 Difference]: Start difference. First operand 77 states and 78 transitions. Second operand has 13 states, 12 states have (on average 2.75) internal successors, (33), 12 states have internal predecessors, (33), 10 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-15 10:47:02,115 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 10:47:02,115 INFO L93 Difference]: Finished difference Result 84 states and 86 transitions. [2022-04-15 10:47:02,115 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-04-15 10:47:02,115 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 2.75) internal successors, (33), 12 states have internal predecessors, (33), 10 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) Word has length 74 [2022-04-15 10:47:02,117 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 10:47:02,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 12 states have (on average 2.75) internal successors, (33), 12 states have internal predecessors, (33), 10 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-15 10:47:02,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 64 transitions. [2022-04-15 10:47:02,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 12 states have (on average 2.75) internal successors, (33), 12 states have internal predecessors, (33), 10 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-15 10:47:02,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 64 transitions. [2022-04-15 10:47:02,119 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 13 states and 64 transitions. [2022-04-15 10:47:02,175 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-15 10:47:02,176 INFO L225 Difference]: With dead ends: 84 [2022-04-15 10:47:02,176 INFO L226 Difference]: Without dead ends: 79 [2022-04-15 10:47:02,176 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 72 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=52, Invalid=254, Unknown=0, NotChecked=0, Total=306 [2022-04-15 10:47:02,177 INFO L913 BasicCegarLoop]: 46 mSDtfsCounter, 2 mSDsluCounter, 306 mSDsCounter, 0 mSdLazyCounter, 286 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 352 SdHoareTripleChecker+Invalid, 286 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 286 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-15 10:47:02,177 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [2 Valid, 352 Invalid, 286 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 286 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-15 10:47:02,177 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2022-04-15 10:47:02,275 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 79. [2022-04-15 10:47:02,275 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 10:47:02,275 INFO L82 GeneralOperation]: Start isEquivalent. First operand 79 states. Second operand has 79 states, 57 states have (on average 1.0350877192982457) internal successors, (59), 57 states have internal predecessors, (59), 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-15 10:47:02,275 INFO L74 IsIncluded]: Start isIncluded. First operand 79 states. Second operand has 79 states, 57 states have (on average 1.0350877192982457) internal successors, (59), 57 states have internal predecessors, (59), 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-15 10:47:02,275 INFO L87 Difference]: Start difference. First operand 79 states. Second operand has 79 states, 57 states have (on average 1.0350877192982457) internal successors, (59), 57 states have internal predecessors, (59), 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-15 10:47:02,277 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 10:47:02,277 INFO L93 Difference]: Finished difference Result 79 states and 81 transitions. [2022-04-15 10:47:02,277 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 81 transitions. [2022-04-15 10:47:02,277 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 10:47:02,277 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 10:47:02,277 INFO L74 IsIncluded]: Start isIncluded. First operand has 79 states, 57 states have (on average 1.0350877192982457) internal successors, (59), 57 states have internal predecessors, (59), 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 79 states. [2022-04-15 10:47:02,277 INFO L87 Difference]: Start difference. First operand has 79 states, 57 states have (on average 1.0350877192982457) internal successors, (59), 57 states have internal predecessors, (59), 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 79 states. [2022-04-15 10:47:02,278 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 10:47:02,278 INFO L93 Difference]: Finished difference Result 79 states and 81 transitions. [2022-04-15 10:47:02,278 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 81 transitions. [2022-04-15 10:47:02,279 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 10:47:02,279 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 10:47:02,279 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 10:47:02,279 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 10:47:02,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 57 states have (on average 1.0350877192982457) internal successors, (59), 57 states have internal predecessors, (59), 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-15 10:47:02,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 81 transitions. [2022-04-15 10:47:02,280 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 81 transitions. Word has length 74 [2022-04-15 10:47:02,280 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 10:47:02,280 INFO L478 AbstractCegarLoop]: Abstraction has 79 states and 81 transitions. [2022-04-15 10:47:02,280 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 2.75) internal successors, (33), 12 states have internal predecessors, (33), 10 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-15 10:47:02,280 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 79 states and 81 transitions. [2022-04-15 10:47:02,810 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 81 edges. 81 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 10:47:02,810 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 81 transitions. [2022-04-15 10:47:02,810 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2022-04-15 10:47:02,810 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 10:47:02,810 INFO L499 BasicCegarLoop]: trace histogram [9, 9, 8, 8, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 10:47:02,815 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-15 10:47:03,011 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-15 10:47:03,011 INFO L403 AbstractCegarLoop]: === Iteration 19 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 10:47:03,011 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 10:47:03,012 INFO L85 PathProgramCache]: Analyzing trace with hash 989539297, now seen corresponding path program 15 times [2022-04-15 10:47:03,012 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 10:47:03,012 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2021323942] [2022-04-15 10:47:03,103 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 4 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 10:47:03,103 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONLINEAR_UPDATE [2022-04-15 10:47:03,103 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 10:47:03,103 INFO L85 PathProgramCache]: Analyzing trace with hash 989539297, now seen corresponding path program 16 times [2022-04-15 10:47:03,103 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 10:47:03,103 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [445075747] [2022-04-15 10:47:03,103 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 10:47:03,103 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 10:47:03,122 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 10:47:03,122 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1866745654] [2022-04-15 10:47:03,122 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-15 10:47:03,122 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 10:47:03,122 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 10:47:03,123 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-15 10:47:03,124 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-15 10:47:03,643 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-15 10:47:03,643 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 10:47:03,644 INFO L263 TraceCheckSpWp]: Trace formula consists of 239 conjuncts, 21 conjunts are in the unsatisfiable core [2022-04-15 10:47:03,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 10:47:03,661 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 10:47:04,050 INFO L272 TraceCheckUtils]: 0: Hoare triple {9135#true} call ULTIMATE.init(); {9135#true} is VALID [2022-04-15 10:47:04,051 INFO L290 TraceCheckUtils]: 1: Hoare triple {9135#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; {9143#(<= ~counter~0 0)} is VALID [2022-04-15 10:47:04,052 INFO L290 TraceCheckUtils]: 2: Hoare triple {9143#(<= ~counter~0 0)} assume true; {9143#(<= ~counter~0 0)} is VALID [2022-04-15 10:47:04,052 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {9143#(<= ~counter~0 0)} {9135#true} #57#return; {9143#(<= ~counter~0 0)} is VALID [2022-04-15 10:47:04,052 INFO L272 TraceCheckUtils]: 4: Hoare triple {9143#(<= ~counter~0 0)} call #t~ret6 := main(); {9143#(<= ~counter~0 0)} is VALID [2022-04-15 10:47:04,053 INFO L290 TraceCheckUtils]: 5: Hoare triple {9143#(<= ~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;~y~0 := 0;~x~0 := 0;~c~0 := 0; {9143#(<= ~counter~0 0)} is VALID [2022-04-15 10:47:04,053 INFO L290 TraceCheckUtils]: 6: Hoare triple {9143#(<= ~counter~0 0)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {9159#(<= ~counter~0 1)} is VALID [2022-04-15 10:47:04,054 INFO L290 TraceCheckUtils]: 7: Hoare triple {9159#(<= ~counter~0 1)} assume !!(#t~post5 < 20);havoc #t~post5; {9159#(<= ~counter~0 1)} is VALID [2022-04-15 10:47:04,054 INFO L272 TraceCheckUtils]: 8: Hoare triple {9159#(<= ~counter~0 1)} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {9159#(<= ~counter~0 1)} is VALID [2022-04-15 10:47:04,054 INFO L290 TraceCheckUtils]: 9: Hoare triple {9159#(<= ~counter~0 1)} ~cond := #in~cond; {9159#(<= ~counter~0 1)} is VALID [2022-04-15 10:47:04,055 INFO L290 TraceCheckUtils]: 10: Hoare triple {9159#(<= ~counter~0 1)} assume !(0 == ~cond); {9159#(<= ~counter~0 1)} is VALID [2022-04-15 10:47:04,055 INFO L290 TraceCheckUtils]: 11: Hoare triple {9159#(<= ~counter~0 1)} assume true; {9159#(<= ~counter~0 1)} is VALID [2022-04-15 10:47:04,055 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {9159#(<= ~counter~0 1)} {9159#(<= ~counter~0 1)} #51#return; {9159#(<= ~counter~0 1)} is VALID [2022-04-15 10:47:04,056 INFO L290 TraceCheckUtils]: 13: Hoare triple {9159#(<= ~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 + ~x~0; {9159#(<= ~counter~0 1)} is VALID [2022-04-15 10:47:04,056 INFO L290 TraceCheckUtils]: 14: Hoare triple {9159#(<= ~counter~0 1)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {9184#(<= ~counter~0 2)} is VALID [2022-04-15 10:47:04,056 INFO L290 TraceCheckUtils]: 15: Hoare triple {9184#(<= ~counter~0 2)} assume !!(#t~post5 < 20);havoc #t~post5; {9184#(<= ~counter~0 2)} is VALID [2022-04-15 10:47:04,057 INFO L272 TraceCheckUtils]: 16: Hoare triple {9184#(<= ~counter~0 2)} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {9184#(<= ~counter~0 2)} is VALID [2022-04-15 10:47:04,057 INFO L290 TraceCheckUtils]: 17: Hoare triple {9184#(<= ~counter~0 2)} ~cond := #in~cond; {9184#(<= ~counter~0 2)} is VALID [2022-04-15 10:47:04,057 INFO L290 TraceCheckUtils]: 18: Hoare triple {9184#(<= ~counter~0 2)} assume !(0 == ~cond); {9184#(<= ~counter~0 2)} is VALID [2022-04-15 10:47:04,058 INFO L290 TraceCheckUtils]: 19: Hoare triple {9184#(<= ~counter~0 2)} assume true; {9184#(<= ~counter~0 2)} is VALID [2022-04-15 10:47:04,058 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {9184#(<= ~counter~0 2)} {9184#(<= ~counter~0 2)} #51#return; {9184#(<= ~counter~0 2)} is VALID [2022-04-15 10:47:04,058 INFO L290 TraceCheckUtils]: 21: Hoare triple {9184#(<= ~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 + ~x~0; {9184#(<= ~counter~0 2)} is VALID [2022-04-15 10:47:04,059 INFO L290 TraceCheckUtils]: 22: Hoare triple {9184#(<= ~counter~0 2)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {9209#(<= ~counter~0 3)} is VALID [2022-04-15 10:47:04,059 INFO L290 TraceCheckUtils]: 23: Hoare triple {9209#(<= ~counter~0 3)} assume !!(#t~post5 < 20);havoc #t~post5; {9209#(<= ~counter~0 3)} is VALID [2022-04-15 10:47:04,059 INFO L272 TraceCheckUtils]: 24: Hoare triple {9209#(<= ~counter~0 3)} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {9209#(<= ~counter~0 3)} is VALID [2022-04-15 10:47:04,060 INFO L290 TraceCheckUtils]: 25: Hoare triple {9209#(<= ~counter~0 3)} ~cond := #in~cond; {9209#(<= ~counter~0 3)} is VALID [2022-04-15 10:47:04,060 INFO L290 TraceCheckUtils]: 26: Hoare triple {9209#(<= ~counter~0 3)} assume !(0 == ~cond); {9209#(<= ~counter~0 3)} is VALID [2022-04-15 10:47:04,060 INFO L290 TraceCheckUtils]: 27: Hoare triple {9209#(<= ~counter~0 3)} assume true; {9209#(<= ~counter~0 3)} is VALID [2022-04-15 10:47:04,061 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {9209#(<= ~counter~0 3)} {9209#(<= ~counter~0 3)} #51#return; {9209#(<= ~counter~0 3)} is VALID [2022-04-15 10:47:04,061 INFO L290 TraceCheckUtils]: 29: Hoare triple {9209#(<= ~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 + ~x~0; {9209#(<= ~counter~0 3)} is VALID [2022-04-15 10:47:04,061 INFO L290 TraceCheckUtils]: 30: Hoare triple {9209#(<= ~counter~0 3)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {9234#(<= ~counter~0 4)} is VALID [2022-04-15 10:47:04,062 INFO L290 TraceCheckUtils]: 31: Hoare triple {9234#(<= ~counter~0 4)} assume !!(#t~post5 < 20);havoc #t~post5; {9234#(<= ~counter~0 4)} is VALID [2022-04-15 10:47:04,062 INFO L272 TraceCheckUtils]: 32: Hoare triple {9234#(<= ~counter~0 4)} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {9234#(<= ~counter~0 4)} is VALID [2022-04-15 10:47:04,062 INFO L290 TraceCheckUtils]: 33: Hoare triple {9234#(<= ~counter~0 4)} ~cond := #in~cond; {9234#(<= ~counter~0 4)} is VALID [2022-04-15 10:47:04,063 INFO L290 TraceCheckUtils]: 34: Hoare triple {9234#(<= ~counter~0 4)} assume !(0 == ~cond); {9234#(<= ~counter~0 4)} is VALID [2022-04-15 10:47:04,063 INFO L290 TraceCheckUtils]: 35: Hoare triple {9234#(<= ~counter~0 4)} assume true; {9234#(<= ~counter~0 4)} is VALID [2022-04-15 10:47:04,063 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {9234#(<= ~counter~0 4)} {9234#(<= ~counter~0 4)} #51#return; {9234#(<= ~counter~0 4)} is VALID [2022-04-15 10:47:04,064 INFO L290 TraceCheckUtils]: 37: Hoare triple {9234#(<= ~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 + ~x~0; {9234#(<= ~counter~0 4)} is VALID [2022-04-15 10:47:04,064 INFO L290 TraceCheckUtils]: 38: Hoare triple {9234#(<= ~counter~0 4)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {9259#(<= ~counter~0 5)} is VALID [2022-04-15 10:47:04,064 INFO L290 TraceCheckUtils]: 39: Hoare triple {9259#(<= ~counter~0 5)} assume !!(#t~post5 < 20);havoc #t~post5; {9259#(<= ~counter~0 5)} is VALID [2022-04-15 10:47:04,065 INFO L272 TraceCheckUtils]: 40: Hoare triple {9259#(<= ~counter~0 5)} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {9259#(<= ~counter~0 5)} is VALID [2022-04-15 10:47:04,065 INFO L290 TraceCheckUtils]: 41: Hoare triple {9259#(<= ~counter~0 5)} ~cond := #in~cond; {9259#(<= ~counter~0 5)} is VALID [2022-04-15 10:47:04,065 INFO L290 TraceCheckUtils]: 42: Hoare triple {9259#(<= ~counter~0 5)} assume !(0 == ~cond); {9259#(<= ~counter~0 5)} is VALID [2022-04-15 10:47:04,066 INFO L290 TraceCheckUtils]: 43: Hoare triple {9259#(<= ~counter~0 5)} assume true; {9259#(<= ~counter~0 5)} is VALID [2022-04-15 10:47:04,066 INFO L284 TraceCheckUtils]: 44: Hoare quadruple {9259#(<= ~counter~0 5)} {9259#(<= ~counter~0 5)} #51#return; {9259#(<= ~counter~0 5)} is VALID [2022-04-15 10:47:04,066 INFO L290 TraceCheckUtils]: 45: Hoare triple {9259#(<= ~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 + ~x~0; {9259#(<= ~counter~0 5)} is VALID [2022-04-15 10:47:04,067 INFO L290 TraceCheckUtils]: 46: Hoare triple {9259#(<= ~counter~0 5)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {9284#(<= ~counter~0 6)} is VALID [2022-04-15 10:47:04,067 INFO L290 TraceCheckUtils]: 47: Hoare triple {9284#(<= ~counter~0 6)} assume !!(#t~post5 < 20);havoc #t~post5; {9284#(<= ~counter~0 6)} is VALID [2022-04-15 10:47:04,068 INFO L272 TraceCheckUtils]: 48: Hoare triple {9284#(<= ~counter~0 6)} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {9284#(<= ~counter~0 6)} is VALID [2022-04-15 10:47:04,068 INFO L290 TraceCheckUtils]: 49: Hoare triple {9284#(<= ~counter~0 6)} ~cond := #in~cond; {9284#(<= ~counter~0 6)} is VALID [2022-04-15 10:47:04,068 INFO L290 TraceCheckUtils]: 50: Hoare triple {9284#(<= ~counter~0 6)} assume !(0 == ~cond); {9284#(<= ~counter~0 6)} is VALID [2022-04-15 10:47:04,068 INFO L290 TraceCheckUtils]: 51: Hoare triple {9284#(<= ~counter~0 6)} assume true; {9284#(<= ~counter~0 6)} is VALID [2022-04-15 10:47:04,069 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {9284#(<= ~counter~0 6)} {9284#(<= ~counter~0 6)} #51#return; {9284#(<= ~counter~0 6)} is VALID [2022-04-15 10:47:04,069 INFO L290 TraceCheckUtils]: 53: Hoare triple {9284#(<= ~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 + ~x~0; {9284#(<= ~counter~0 6)} is VALID [2022-04-15 10:47:04,070 INFO L290 TraceCheckUtils]: 54: Hoare triple {9284#(<= ~counter~0 6)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {9309#(<= ~counter~0 7)} is VALID [2022-04-15 10:47:04,070 INFO L290 TraceCheckUtils]: 55: Hoare triple {9309#(<= ~counter~0 7)} assume !!(#t~post5 < 20);havoc #t~post5; {9309#(<= ~counter~0 7)} is VALID [2022-04-15 10:47:04,070 INFO L272 TraceCheckUtils]: 56: Hoare triple {9309#(<= ~counter~0 7)} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {9309#(<= ~counter~0 7)} is VALID [2022-04-15 10:47:04,071 INFO L290 TraceCheckUtils]: 57: Hoare triple {9309#(<= ~counter~0 7)} ~cond := #in~cond; {9309#(<= ~counter~0 7)} is VALID [2022-04-15 10:47:04,071 INFO L290 TraceCheckUtils]: 58: Hoare triple {9309#(<= ~counter~0 7)} assume !(0 == ~cond); {9309#(<= ~counter~0 7)} is VALID [2022-04-15 10:47:04,071 INFO L290 TraceCheckUtils]: 59: Hoare triple {9309#(<= ~counter~0 7)} assume true; {9309#(<= ~counter~0 7)} is VALID [2022-04-15 10:47:04,072 INFO L284 TraceCheckUtils]: 60: Hoare quadruple {9309#(<= ~counter~0 7)} {9309#(<= ~counter~0 7)} #51#return; {9309#(<= ~counter~0 7)} is VALID [2022-04-15 10:47:04,072 INFO L290 TraceCheckUtils]: 61: Hoare triple {9309#(<= ~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 + ~x~0; {9309#(<= ~counter~0 7)} is VALID [2022-04-15 10:47:04,072 INFO L290 TraceCheckUtils]: 62: Hoare triple {9309#(<= ~counter~0 7)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {9334#(<= ~counter~0 8)} is VALID [2022-04-15 10:47:04,073 INFO L290 TraceCheckUtils]: 63: Hoare triple {9334#(<= ~counter~0 8)} assume !!(#t~post5 < 20);havoc #t~post5; {9334#(<= ~counter~0 8)} is VALID [2022-04-15 10:47:04,073 INFO L272 TraceCheckUtils]: 64: Hoare triple {9334#(<= ~counter~0 8)} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {9334#(<= ~counter~0 8)} is VALID [2022-04-15 10:47:04,073 INFO L290 TraceCheckUtils]: 65: Hoare triple {9334#(<= ~counter~0 8)} ~cond := #in~cond; {9334#(<= ~counter~0 8)} is VALID [2022-04-15 10:47:04,074 INFO L290 TraceCheckUtils]: 66: Hoare triple {9334#(<= ~counter~0 8)} assume !(0 == ~cond); {9334#(<= ~counter~0 8)} is VALID [2022-04-15 10:47:04,074 INFO L290 TraceCheckUtils]: 67: Hoare triple {9334#(<= ~counter~0 8)} assume true; {9334#(<= ~counter~0 8)} is VALID [2022-04-15 10:47:04,074 INFO L284 TraceCheckUtils]: 68: Hoare quadruple {9334#(<= ~counter~0 8)} {9334#(<= ~counter~0 8)} #51#return; {9334#(<= ~counter~0 8)} is VALID [2022-04-15 10:47:04,075 INFO L290 TraceCheckUtils]: 69: Hoare triple {9334#(<= ~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 + ~x~0; {9334#(<= ~counter~0 8)} is VALID [2022-04-15 10:47:04,075 INFO L290 TraceCheckUtils]: 70: Hoare triple {9334#(<= ~counter~0 8)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {9359#(<= |main_#t~post5| 8)} is VALID [2022-04-15 10:47:04,075 INFO L290 TraceCheckUtils]: 71: Hoare triple {9359#(<= |main_#t~post5| 8)} assume !(#t~post5 < 20);havoc #t~post5; {9136#false} is VALID [2022-04-15 10:47:04,075 INFO L272 TraceCheckUtils]: 72: Hoare triple {9136#false} call __VERIFIER_assert((if 0 == ~k~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {9136#false} is VALID [2022-04-15 10:47:04,076 INFO L290 TraceCheckUtils]: 73: Hoare triple {9136#false} ~cond := #in~cond; {9136#false} is VALID [2022-04-15 10:47:04,076 INFO L290 TraceCheckUtils]: 74: Hoare triple {9136#false} assume 0 == ~cond; {9136#false} is VALID [2022-04-15 10:47:04,076 INFO L290 TraceCheckUtils]: 75: Hoare triple {9136#false} assume !false; {9136#false} is VALID [2022-04-15 10:47:04,076 INFO L134 CoverageAnalysis]: Checked inductivity of 256 backedges. 16 proven. 240 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 10:47:04,076 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 10:47:04,492 INFO L290 TraceCheckUtils]: 75: Hoare triple {9136#false} assume !false; {9136#false} is VALID [2022-04-15 10:47:04,492 INFO L290 TraceCheckUtils]: 74: Hoare triple {9136#false} assume 0 == ~cond; {9136#false} is VALID [2022-04-15 10:47:04,492 INFO L290 TraceCheckUtils]: 73: Hoare triple {9136#false} ~cond := #in~cond; {9136#false} is VALID [2022-04-15 10:47:04,492 INFO L272 TraceCheckUtils]: 72: Hoare triple {9136#false} call __VERIFIER_assert((if 0 == ~k~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {9136#false} is VALID [2022-04-15 10:47:04,492 INFO L290 TraceCheckUtils]: 71: Hoare triple {9387#(< |main_#t~post5| 20)} assume !(#t~post5 < 20);havoc #t~post5; {9136#false} is VALID [2022-04-15 10:47:04,493 INFO L290 TraceCheckUtils]: 70: Hoare triple {9391#(< ~counter~0 20)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {9387#(< |main_#t~post5| 20)} is VALID [2022-04-15 10:47:04,493 INFO L290 TraceCheckUtils]: 69: Hoare triple {9391#(< ~counter~0 20)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {9391#(< ~counter~0 20)} is VALID [2022-04-15 10:47:04,493 INFO L284 TraceCheckUtils]: 68: Hoare quadruple {9135#true} {9391#(< ~counter~0 20)} #51#return; {9391#(< ~counter~0 20)} is VALID [2022-04-15 10:47:04,493 INFO L290 TraceCheckUtils]: 67: Hoare triple {9135#true} assume true; {9135#true} is VALID [2022-04-15 10:47:04,494 INFO L290 TraceCheckUtils]: 66: Hoare triple {9135#true} assume !(0 == ~cond); {9135#true} is VALID [2022-04-15 10:47:04,494 INFO L290 TraceCheckUtils]: 65: Hoare triple {9135#true} ~cond := #in~cond; {9135#true} is VALID [2022-04-15 10:47:04,494 INFO L272 TraceCheckUtils]: 64: Hoare triple {9391#(< ~counter~0 20)} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {9135#true} is VALID [2022-04-15 10:47:04,494 INFO L290 TraceCheckUtils]: 63: Hoare triple {9391#(< ~counter~0 20)} assume !!(#t~post5 < 20);havoc #t~post5; {9391#(< ~counter~0 20)} is VALID [2022-04-15 10:47:04,495 INFO L290 TraceCheckUtils]: 62: Hoare triple {9416#(< ~counter~0 19)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {9391#(< ~counter~0 20)} is VALID [2022-04-15 10:47:04,495 INFO L290 TraceCheckUtils]: 61: Hoare triple {9416#(< ~counter~0 19)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {9416#(< ~counter~0 19)} is VALID [2022-04-15 10:47:04,495 INFO L284 TraceCheckUtils]: 60: Hoare quadruple {9135#true} {9416#(< ~counter~0 19)} #51#return; {9416#(< ~counter~0 19)} is VALID [2022-04-15 10:47:04,495 INFO L290 TraceCheckUtils]: 59: Hoare triple {9135#true} assume true; {9135#true} is VALID [2022-04-15 10:47:04,495 INFO L290 TraceCheckUtils]: 58: Hoare triple {9135#true} assume !(0 == ~cond); {9135#true} is VALID [2022-04-15 10:47:04,496 INFO L290 TraceCheckUtils]: 57: Hoare triple {9135#true} ~cond := #in~cond; {9135#true} is VALID [2022-04-15 10:47:04,496 INFO L272 TraceCheckUtils]: 56: Hoare triple {9416#(< ~counter~0 19)} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {9135#true} is VALID [2022-04-15 10:47:04,496 INFO L290 TraceCheckUtils]: 55: Hoare triple {9416#(< ~counter~0 19)} assume !!(#t~post5 < 20);havoc #t~post5; {9416#(< ~counter~0 19)} is VALID [2022-04-15 10:47:04,496 INFO L290 TraceCheckUtils]: 54: Hoare triple {9441#(< ~counter~0 18)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {9416#(< ~counter~0 19)} is VALID [2022-04-15 10:47:04,497 INFO L290 TraceCheckUtils]: 53: Hoare triple {9441#(< ~counter~0 18)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {9441#(< ~counter~0 18)} is VALID [2022-04-15 10:47:04,497 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {9135#true} {9441#(< ~counter~0 18)} #51#return; {9441#(< ~counter~0 18)} is VALID [2022-04-15 10:47:04,497 INFO L290 TraceCheckUtils]: 51: Hoare triple {9135#true} assume true; {9135#true} is VALID [2022-04-15 10:47:04,497 INFO L290 TraceCheckUtils]: 50: Hoare triple {9135#true} assume !(0 == ~cond); {9135#true} is VALID [2022-04-15 10:47:04,497 INFO L290 TraceCheckUtils]: 49: Hoare triple {9135#true} ~cond := #in~cond; {9135#true} is VALID [2022-04-15 10:47:04,497 INFO L272 TraceCheckUtils]: 48: Hoare triple {9441#(< ~counter~0 18)} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {9135#true} is VALID [2022-04-15 10:47:04,498 INFO L290 TraceCheckUtils]: 47: Hoare triple {9441#(< ~counter~0 18)} assume !!(#t~post5 < 20);havoc #t~post5; {9441#(< ~counter~0 18)} is VALID [2022-04-15 10:47:04,498 INFO L290 TraceCheckUtils]: 46: Hoare triple {9466#(< ~counter~0 17)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {9441#(< ~counter~0 18)} is VALID [2022-04-15 10:47:04,498 INFO L290 TraceCheckUtils]: 45: Hoare triple {9466#(< ~counter~0 17)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {9466#(< ~counter~0 17)} is VALID [2022-04-15 10:47:04,499 INFO L284 TraceCheckUtils]: 44: Hoare quadruple {9135#true} {9466#(< ~counter~0 17)} #51#return; {9466#(< ~counter~0 17)} is VALID [2022-04-15 10:47:04,499 INFO L290 TraceCheckUtils]: 43: Hoare triple {9135#true} assume true; {9135#true} is VALID [2022-04-15 10:47:04,499 INFO L290 TraceCheckUtils]: 42: Hoare triple {9135#true} assume !(0 == ~cond); {9135#true} is VALID [2022-04-15 10:47:04,499 INFO L290 TraceCheckUtils]: 41: Hoare triple {9135#true} ~cond := #in~cond; {9135#true} is VALID [2022-04-15 10:47:04,499 INFO L272 TraceCheckUtils]: 40: Hoare triple {9466#(< ~counter~0 17)} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {9135#true} is VALID [2022-04-15 10:47:04,499 INFO L290 TraceCheckUtils]: 39: Hoare triple {9466#(< ~counter~0 17)} assume !!(#t~post5 < 20);havoc #t~post5; {9466#(< ~counter~0 17)} is VALID [2022-04-15 10:47:04,500 INFO L290 TraceCheckUtils]: 38: Hoare triple {9491#(< ~counter~0 16)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {9466#(< ~counter~0 17)} is VALID [2022-04-15 10:47:04,500 INFO L290 TraceCheckUtils]: 37: Hoare triple {9491#(< ~counter~0 16)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {9491#(< ~counter~0 16)} is VALID [2022-04-15 10:47:04,500 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {9135#true} {9491#(< ~counter~0 16)} #51#return; {9491#(< ~counter~0 16)} is VALID [2022-04-15 10:47:04,501 INFO L290 TraceCheckUtils]: 35: Hoare triple {9135#true} assume true; {9135#true} is VALID [2022-04-15 10:47:04,501 INFO L290 TraceCheckUtils]: 34: Hoare triple {9135#true} assume !(0 == ~cond); {9135#true} is VALID [2022-04-15 10:47:04,501 INFO L290 TraceCheckUtils]: 33: Hoare triple {9135#true} ~cond := #in~cond; {9135#true} is VALID [2022-04-15 10:47:04,501 INFO L272 TraceCheckUtils]: 32: Hoare triple {9491#(< ~counter~0 16)} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {9135#true} is VALID [2022-04-15 10:47:04,501 INFO L290 TraceCheckUtils]: 31: Hoare triple {9491#(< ~counter~0 16)} assume !!(#t~post5 < 20);havoc #t~post5; {9491#(< ~counter~0 16)} is VALID [2022-04-15 10:47:04,501 INFO L290 TraceCheckUtils]: 30: Hoare triple {9516#(< ~counter~0 15)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {9491#(< ~counter~0 16)} is VALID [2022-04-15 10:47:04,502 INFO L290 TraceCheckUtils]: 29: Hoare triple {9516#(< ~counter~0 15)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {9516#(< ~counter~0 15)} is VALID [2022-04-15 10:47:04,502 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {9135#true} {9516#(< ~counter~0 15)} #51#return; {9516#(< ~counter~0 15)} is VALID [2022-04-15 10:47:04,502 INFO L290 TraceCheckUtils]: 27: Hoare triple {9135#true} assume true; {9135#true} is VALID [2022-04-15 10:47:04,502 INFO L290 TraceCheckUtils]: 26: Hoare triple {9135#true} assume !(0 == ~cond); {9135#true} is VALID [2022-04-15 10:47:04,502 INFO L290 TraceCheckUtils]: 25: Hoare triple {9135#true} ~cond := #in~cond; {9135#true} is VALID [2022-04-15 10:47:04,502 INFO L272 TraceCheckUtils]: 24: Hoare triple {9516#(< ~counter~0 15)} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {9135#true} is VALID [2022-04-15 10:47:04,503 INFO L290 TraceCheckUtils]: 23: Hoare triple {9516#(< ~counter~0 15)} assume !!(#t~post5 < 20);havoc #t~post5; {9516#(< ~counter~0 15)} is VALID [2022-04-15 10:47:04,503 INFO L290 TraceCheckUtils]: 22: Hoare triple {9541#(< ~counter~0 14)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {9516#(< ~counter~0 15)} is VALID [2022-04-15 10:47:04,503 INFO L290 TraceCheckUtils]: 21: Hoare triple {9541#(< ~counter~0 14)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {9541#(< ~counter~0 14)} is VALID [2022-04-15 10:47:04,504 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {9135#true} {9541#(< ~counter~0 14)} #51#return; {9541#(< ~counter~0 14)} is VALID [2022-04-15 10:47:04,504 INFO L290 TraceCheckUtils]: 19: Hoare triple {9135#true} assume true; {9135#true} is VALID [2022-04-15 10:47:04,504 INFO L290 TraceCheckUtils]: 18: Hoare triple {9135#true} assume !(0 == ~cond); {9135#true} is VALID [2022-04-15 10:47:04,504 INFO L290 TraceCheckUtils]: 17: Hoare triple {9135#true} ~cond := #in~cond; {9135#true} is VALID [2022-04-15 10:47:04,504 INFO L272 TraceCheckUtils]: 16: Hoare triple {9541#(< ~counter~0 14)} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {9135#true} is VALID [2022-04-15 10:47:04,504 INFO L290 TraceCheckUtils]: 15: Hoare triple {9541#(< ~counter~0 14)} assume !!(#t~post5 < 20);havoc #t~post5; {9541#(< ~counter~0 14)} is VALID [2022-04-15 10:47:04,505 INFO L290 TraceCheckUtils]: 14: Hoare triple {9566#(< ~counter~0 13)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {9541#(< ~counter~0 14)} is VALID [2022-04-15 10:47:04,505 INFO L290 TraceCheckUtils]: 13: Hoare triple {9566#(< ~counter~0 13)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {9566#(< ~counter~0 13)} is VALID [2022-04-15 10:47:04,506 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {9135#true} {9566#(< ~counter~0 13)} #51#return; {9566#(< ~counter~0 13)} is VALID [2022-04-15 10:47:04,506 INFO L290 TraceCheckUtils]: 11: Hoare triple {9135#true} assume true; {9135#true} is VALID [2022-04-15 10:47:04,506 INFO L290 TraceCheckUtils]: 10: Hoare triple {9135#true} assume !(0 == ~cond); {9135#true} is VALID [2022-04-15 10:47:04,506 INFO L290 TraceCheckUtils]: 9: Hoare triple {9135#true} ~cond := #in~cond; {9135#true} is VALID [2022-04-15 10:47:04,506 INFO L272 TraceCheckUtils]: 8: Hoare triple {9566#(< ~counter~0 13)} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {9135#true} is VALID [2022-04-15 10:47:04,506 INFO L290 TraceCheckUtils]: 7: Hoare triple {9566#(< ~counter~0 13)} assume !!(#t~post5 < 20);havoc #t~post5; {9566#(< ~counter~0 13)} is VALID [2022-04-15 10:47:04,507 INFO L290 TraceCheckUtils]: 6: Hoare triple {9591#(< ~counter~0 12)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {9566#(< ~counter~0 13)} is VALID [2022-04-15 10:47:04,507 INFO L290 TraceCheckUtils]: 5: Hoare triple {9591#(< ~counter~0 12)} 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;~y~0 := 0;~x~0 := 0;~c~0 := 0; {9591#(< ~counter~0 12)} is VALID [2022-04-15 10:47:04,507 INFO L272 TraceCheckUtils]: 4: Hoare triple {9591#(< ~counter~0 12)} call #t~ret6 := main(); {9591#(< ~counter~0 12)} is VALID [2022-04-15 10:47:04,508 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {9591#(< ~counter~0 12)} {9135#true} #57#return; {9591#(< ~counter~0 12)} is VALID [2022-04-15 10:47:04,508 INFO L290 TraceCheckUtils]: 2: Hoare triple {9591#(< ~counter~0 12)} assume true; {9591#(< ~counter~0 12)} is VALID [2022-04-15 10:47:04,508 INFO L290 TraceCheckUtils]: 1: Hoare triple {9135#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; {9591#(< ~counter~0 12)} is VALID [2022-04-15 10:47:04,508 INFO L272 TraceCheckUtils]: 0: Hoare triple {9135#true} call ULTIMATE.init(); {9135#true} is VALID [2022-04-15 10:47:04,509 INFO L134 CoverageAnalysis]: Checked inductivity of 256 backedges. 16 proven. 128 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2022-04-15 10:47:04,509 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 10:47:04,509 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [445075747] [2022-04-15 10:47:04,509 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 10:47:04,509 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1866745654] [2022-04-15 10:47:04,509 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1866745654] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 10:47:04,509 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-15 10:47:04,509 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 22 [2022-04-15 10:47:04,509 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 10:47:04,509 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2021323942] [2022-04-15 10:47:04,509 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2021323942] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 10:47:04,509 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 10:47:04,510 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-04-15 10:47:04,510 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1598771290] [2022-04-15 10:47:04,510 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 10:47:04,510 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 4.666666666666667) internal successors, (56), 11 states have internal predecessors, (56), 11 states have call successors, (11), 11 states have call predecessors, (11), 9 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) Word has length 76 [2022-04-15 10:47:04,510 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 10:47:04,510 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 12 states, 12 states have (on average 4.666666666666667) internal successors, (56), 11 states have internal predecessors, (56), 11 states have call successors, (11), 11 states have call predecessors, (11), 9 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-15 10:47:04,560 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 76 edges. 76 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 10:47:04,560 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-04-15 10:47:04,560 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 10:47:04,560 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-04-15 10:47:04,561 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=195, Invalid=267, Unknown=0, NotChecked=0, Total=462 [2022-04-15 10:47:04,561 INFO L87 Difference]: Start difference. First operand 79 states and 81 transitions. Second operand has 12 states, 12 states have (on average 4.666666666666667) internal successors, (56), 11 states have internal predecessors, (56), 11 states have call successors, (11), 11 states have call predecessors, (11), 9 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-15 10:47:04,851 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 10:47:04,851 INFO L93 Difference]: Finished difference Result 90 states and 91 transitions. [2022-04-15 10:47:04,851 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-04-15 10:47:04,851 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 4.666666666666667) internal successors, (56), 11 states have internal predecessors, (56), 11 states have call successors, (11), 11 states have call predecessors, (11), 9 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) Word has length 76 [2022-04-15 10:47:04,852 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 10:47:04,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 4.666666666666667) internal successors, (56), 11 states have internal predecessors, (56), 11 states have call successors, (11), 11 states have call predecessors, (11), 9 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-15 10:47:04,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 90 transitions. [2022-04-15 10:47:04,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 4.666666666666667) internal successors, (56), 11 states have internal predecessors, (56), 11 states have call successors, (11), 11 states have call predecessors, (11), 9 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-15 10:47:04,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 90 transitions. [2022-04-15 10:47:04,855 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 20 states and 90 transitions. [2022-04-15 10:47:04,915 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 90 edges. 90 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 10:47:04,916 INFO L225 Difference]: With dead ends: 90 [2022-04-15 10:47:04,916 INFO L226 Difference]: Without dead ends: 85 [2022-04-15 10:47:04,916 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 159 GetRequests, 131 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=363, Invalid=507, Unknown=0, NotChecked=0, Total=870 [2022-04-15 10:47:04,917 INFO L913 BasicCegarLoop]: 25 mSDtfsCounter, 6 mSDsluCounter, 68 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 93 SdHoareTripleChecker+Invalid, 62 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 10:47:04,917 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [6 Valid, 93 Invalid, 62 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 10:47:04,917 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2022-04-15 10:47:05,019 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 85. [2022-04-15 10:47:05,020 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 10:47:05,020 INFO L82 GeneralOperation]: Start isEquivalent. First operand 85 states. Second operand has 85 states, 62 states have (on average 1.032258064516129) internal successors, (64), 62 states have internal predecessors, (64), 12 states have call successors, (12), 12 states have call predecessors, (12), 10 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-15 10:47:05,020 INFO L74 IsIncluded]: Start isIncluded. First operand 85 states. Second operand has 85 states, 62 states have (on average 1.032258064516129) internal successors, (64), 62 states have internal predecessors, (64), 12 states have call successors, (12), 12 states have call predecessors, (12), 10 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-15 10:47:05,020 INFO L87 Difference]: Start difference. First operand 85 states. Second operand has 85 states, 62 states have (on average 1.032258064516129) internal successors, (64), 62 states have internal predecessors, (64), 12 states have call successors, (12), 12 states have call predecessors, (12), 10 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-15 10:47:05,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 10:47:05,021 INFO L93 Difference]: Finished difference Result 85 states and 86 transitions. [2022-04-15 10:47:05,021 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 86 transitions. [2022-04-15 10:47:05,022 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 10:47:05,022 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 10:47:05,022 INFO L74 IsIncluded]: Start isIncluded. First operand has 85 states, 62 states have (on average 1.032258064516129) internal successors, (64), 62 states have internal predecessors, (64), 12 states have call successors, (12), 12 states have call predecessors, (12), 10 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) Second operand 85 states. [2022-04-15 10:47:05,022 INFO L87 Difference]: Start difference. First operand has 85 states, 62 states have (on average 1.032258064516129) internal successors, (64), 62 states have internal predecessors, (64), 12 states have call successors, (12), 12 states have call predecessors, (12), 10 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) Second operand 85 states. [2022-04-15 10:47:05,023 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 10:47:05,023 INFO L93 Difference]: Finished difference Result 85 states and 86 transitions. [2022-04-15 10:47:05,023 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 86 transitions. [2022-04-15 10:47:05,023 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 10:47:05,023 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 10:47:05,023 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 10:47:05,023 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 10:47:05,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85 states, 62 states have (on average 1.032258064516129) internal successors, (64), 62 states have internal predecessors, (64), 12 states have call successors, (12), 12 states have call predecessors, (12), 10 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-15 10:47:05,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 86 transitions. [2022-04-15 10:47:05,024 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 86 transitions. Word has length 76 [2022-04-15 10:47:05,025 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 10:47:05,025 INFO L478 AbstractCegarLoop]: Abstraction has 85 states and 86 transitions. [2022-04-15 10:47:05,025 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 4.666666666666667) internal successors, (56), 11 states have internal predecessors, (56), 11 states have call successors, (11), 11 states have call predecessors, (11), 9 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-15 10:47:05,025 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 85 states and 86 transitions. [2022-04-15 10:47:05,579 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-15 10:47:05,579 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 86 transitions. [2022-04-15 10:47:05,579 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2022-04-15 10:47:05,579 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 10:47:05,580 INFO L499 BasicCegarLoop]: trace histogram [10, 9, 9, 9, 9, 9, 9, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 10:47:05,584 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Ended with exit code 0 [2022-04-15 10:47:05,780 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-15 10:47:05,780 INFO L403 AbstractCegarLoop]: === Iteration 20 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 10:47:05,780 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 10:47:05,780 INFO L85 PathProgramCache]: Analyzing trace with hash -1500110401, now seen corresponding path program 15 times [2022-04-15 10:47:05,781 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 10:47:05,781 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2092211638] [2022-04-15 10:47:05,893 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 4 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 10:47:05,893 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONLINEAR_UPDATE [2022-04-15 10:47:05,893 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 10:47:05,893 INFO L85 PathProgramCache]: Analyzing trace with hash -1500110401, now seen corresponding path program 16 times [2022-04-15 10:47:05,893 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 10:47:05,893 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1708725685] [2022-04-15 10:47:05,893 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 10:47:05,893 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 10:47:05,912 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 10:47:05,912 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1708426712] [2022-04-15 10:47:05,912 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-15 10:47:05,912 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 10:47:05,912 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 10:47:05,913 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-15 10:47:05,931 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-15 10:47:06,556 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-15 10:47:06,556 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 10:47:06,558 INFO L263 TraceCheckSpWp]: Trace formula consists of 249 conjuncts, 40 conjunts are in the unsatisfiable core [2022-04-15 10:47:06,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 10:47:06,570 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 10:47:06,991 INFO L272 TraceCheckUtils]: 0: Hoare triple {10148#true} call ULTIMATE.init(); {10148#true} is VALID [2022-04-15 10:47:06,992 INFO L290 TraceCheckUtils]: 1: Hoare triple {10148#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; {10148#true} is VALID [2022-04-15 10:47:06,992 INFO L290 TraceCheckUtils]: 2: Hoare triple {10148#true} assume true; {10148#true} is VALID [2022-04-15 10:47:06,992 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {10148#true} {10148#true} #57#return; {10148#true} is VALID [2022-04-15 10:47:06,992 INFO L272 TraceCheckUtils]: 4: Hoare triple {10148#true} call #t~ret6 := main(); {10148#true} is VALID [2022-04-15 10:47:06,992 INFO L290 TraceCheckUtils]: 5: Hoare triple {10148#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;~y~0 := 0;~x~0 := 0;~c~0 := 0; {10168#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-15 10:47:06,993 INFO L290 TraceCheckUtils]: 6: Hoare triple {10168#(and (= main_~c~0 0) (= main_~y~0 0))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {10168#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-15 10:47:06,993 INFO L290 TraceCheckUtils]: 7: Hoare triple {10168#(and (= main_~c~0 0) (= main_~y~0 0))} assume !!(#t~post5 < 20);havoc #t~post5; {10168#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-15 10:47:06,993 INFO L272 TraceCheckUtils]: 8: Hoare triple {10168#(and (= main_~c~0 0) (= main_~y~0 0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {10148#true} is VALID [2022-04-15 10:47:06,993 INFO L290 TraceCheckUtils]: 9: Hoare triple {10148#true} ~cond := #in~cond; {10148#true} is VALID [2022-04-15 10:47:06,993 INFO L290 TraceCheckUtils]: 10: Hoare triple {10148#true} assume !(0 == ~cond); {10148#true} is VALID [2022-04-15 10:47:06,993 INFO L290 TraceCheckUtils]: 11: Hoare triple {10148#true} assume true; {10148#true} is VALID [2022-04-15 10:47:06,994 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {10148#true} {10168#(and (= main_~c~0 0) (= main_~y~0 0))} #51#return; {10168#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-15 10:47:06,994 INFO L290 TraceCheckUtils]: 13: Hoare triple {10168#(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 + ~x~0; {10193#(and (= main_~y~0 1) (= main_~c~0 1))} is VALID [2022-04-15 10:47:06,994 INFO L290 TraceCheckUtils]: 14: Hoare triple {10193#(and (= main_~y~0 1) (= main_~c~0 1))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {10193#(and (= main_~y~0 1) (= main_~c~0 1))} is VALID [2022-04-15 10:47:06,995 INFO L290 TraceCheckUtils]: 15: Hoare triple {10193#(and (= main_~y~0 1) (= main_~c~0 1))} assume !!(#t~post5 < 20);havoc #t~post5; {10193#(and (= main_~y~0 1) (= main_~c~0 1))} is VALID [2022-04-15 10:47:06,995 INFO L272 TraceCheckUtils]: 16: Hoare triple {10193#(and (= main_~y~0 1) (= main_~c~0 1))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {10148#true} is VALID [2022-04-15 10:47:06,995 INFO L290 TraceCheckUtils]: 17: Hoare triple {10148#true} ~cond := #in~cond; {10148#true} is VALID [2022-04-15 10:47:06,995 INFO L290 TraceCheckUtils]: 18: Hoare triple {10148#true} assume !(0 == ~cond); {10148#true} is VALID [2022-04-15 10:47:06,995 INFO L290 TraceCheckUtils]: 19: Hoare triple {10148#true} assume true; {10148#true} is VALID [2022-04-15 10:47:06,995 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {10148#true} {10193#(and (= main_~y~0 1) (= main_~c~0 1))} #51#return; {10193#(and (= main_~y~0 1) (= main_~c~0 1))} is VALID [2022-04-15 10:47:06,996 INFO L290 TraceCheckUtils]: 21: Hoare triple {10193#(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 + ~x~0; {10218#(and (= (+ (- 1) main_~y~0) 1) (= main_~c~0 2))} is VALID [2022-04-15 10:47:06,996 INFO L290 TraceCheckUtils]: 22: Hoare triple {10218#(and (= (+ (- 1) main_~y~0) 1) (= main_~c~0 2))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {10218#(and (= (+ (- 1) main_~y~0) 1) (= main_~c~0 2))} is VALID [2022-04-15 10:47:06,997 INFO L290 TraceCheckUtils]: 23: Hoare triple {10218#(and (= (+ (- 1) main_~y~0) 1) (= main_~c~0 2))} assume !!(#t~post5 < 20);havoc #t~post5; {10218#(and (= (+ (- 1) main_~y~0) 1) (= main_~c~0 2))} is VALID [2022-04-15 10:47:06,997 INFO L272 TraceCheckUtils]: 24: Hoare triple {10218#(and (= (+ (- 1) main_~y~0) 1) (= main_~c~0 2))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {10148#true} is VALID [2022-04-15 10:47:06,997 INFO L290 TraceCheckUtils]: 25: Hoare triple {10148#true} ~cond := #in~cond; {10148#true} is VALID [2022-04-15 10:47:06,997 INFO L290 TraceCheckUtils]: 26: Hoare triple {10148#true} assume !(0 == ~cond); {10148#true} is VALID [2022-04-15 10:47:06,997 INFO L290 TraceCheckUtils]: 27: Hoare triple {10148#true} assume true; {10148#true} is VALID [2022-04-15 10:47:06,997 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {10148#true} {10218#(and (= (+ (- 1) main_~y~0) 1) (= main_~c~0 2))} #51#return; {10218#(and (= (+ (- 1) main_~y~0) 1) (= main_~c~0 2))} is VALID [2022-04-15 10:47:06,998 INFO L290 TraceCheckUtils]: 29: Hoare triple {10218#(and (= (+ (- 1) main_~y~0) 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 + ~x~0; {10243#(and (= main_~y~0 3) (= (+ (- 1) main_~c~0) 2))} is VALID [2022-04-15 10:47:06,998 INFO L290 TraceCheckUtils]: 30: Hoare triple {10243#(and (= main_~y~0 3) (= (+ (- 1) main_~c~0) 2))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {10243#(and (= main_~y~0 3) (= (+ (- 1) main_~c~0) 2))} is VALID [2022-04-15 10:47:06,998 INFO L290 TraceCheckUtils]: 31: Hoare triple {10243#(and (= main_~y~0 3) (= (+ (- 1) main_~c~0) 2))} assume !!(#t~post5 < 20);havoc #t~post5; {10243#(and (= main_~y~0 3) (= (+ (- 1) main_~c~0) 2))} is VALID [2022-04-15 10:47:06,998 INFO L272 TraceCheckUtils]: 32: Hoare triple {10243#(and (= main_~y~0 3) (= (+ (- 1) main_~c~0) 2))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {10148#true} is VALID [2022-04-15 10:47:06,999 INFO L290 TraceCheckUtils]: 33: Hoare triple {10148#true} ~cond := #in~cond; {10148#true} is VALID [2022-04-15 10:47:06,999 INFO L290 TraceCheckUtils]: 34: Hoare triple {10148#true} assume !(0 == ~cond); {10148#true} is VALID [2022-04-15 10:47:06,999 INFO L290 TraceCheckUtils]: 35: Hoare triple {10148#true} assume true; {10148#true} is VALID [2022-04-15 10:47:06,999 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {10148#true} {10243#(and (= main_~y~0 3) (= (+ (- 1) main_~c~0) 2))} #51#return; {10243#(and (= main_~y~0 3) (= (+ (- 1) main_~c~0) 2))} is VALID [2022-04-15 10:47:07,000 INFO L290 TraceCheckUtils]: 37: Hoare triple {10243#(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 + ~x~0; {10268#(and (= 2 (+ (- 2) main_~c~0)) (= 3 (+ (- 1) main_~y~0)))} is VALID [2022-04-15 10:47:07,000 INFO L290 TraceCheckUtils]: 38: Hoare triple {10268#(and (= 2 (+ (- 2) main_~c~0)) (= 3 (+ (- 1) main_~y~0)))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {10268#(and (= 2 (+ (- 2) main_~c~0)) (= 3 (+ (- 1) main_~y~0)))} is VALID [2022-04-15 10:47:07,000 INFO L290 TraceCheckUtils]: 39: Hoare triple {10268#(and (= 2 (+ (- 2) main_~c~0)) (= 3 (+ (- 1) main_~y~0)))} assume !!(#t~post5 < 20);havoc #t~post5; {10268#(and (= 2 (+ (- 2) main_~c~0)) (= 3 (+ (- 1) main_~y~0)))} is VALID [2022-04-15 10:47:07,000 INFO L272 TraceCheckUtils]: 40: Hoare triple {10268#(and (= 2 (+ (- 2) main_~c~0)) (= 3 (+ (- 1) main_~y~0)))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {10148#true} is VALID [2022-04-15 10:47:07,000 INFO L290 TraceCheckUtils]: 41: Hoare triple {10148#true} ~cond := #in~cond; {10148#true} is VALID [2022-04-15 10:47:07,001 INFO L290 TraceCheckUtils]: 42: Hoare triple {10148#true} assume !(0 == ~cond); {10148#true} is VALID [2022-04-15 10:47:07,001 INFO L290 TraceCheckUtils]: 43: Hoare triple {10148#true} assume true; {10148#true} is VALID [2022-04-15 10:47:07,001 INFO L284 TraceCheckUtils]: 44: Hoare quadruple {10148#true} {10268#(and (= 2 (+ (- 2) main_~c~0)) (= 3 (+ (- 1) main_~y~0)))} #51#return; {10268#(and (= 2 (+ (- 2) main_~c~0)) (= 3 (+ (- 1) main_~y~0)))} is VALID [2022-04-15 10:47:07,001 INFO L290 TraceCheckUtils]: 45: Hoare triple {10268#(and (= 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 + ~x~0; {10293#(and (= 5 main_~c~0) (= 5 main_~y~0))} is VALID [2022-04-15 10:47:07,002 INFO L290 TraceCheckUtils]: 46: Hoare triple {10293#(and (= 5 main_~c~0) (= 5 main_~y~0))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {10293#(and (= 5 main_~c~0) (= 5 main_~y~0))} is VALID [2022-04-15 10:47:07,002 INFO L290 TraceCheckUtils]: 47: Hoare triple {10293#(and (= 5 main_~c~0) (= 5 main_~y~0))} assume !!(#t~post5 < 20);havoc #t~post5; {10293#(and (= 5 main_~c~0) (= 5 main_~y~0))} is VALID [2022-04-15 10:47:07,002 INFO L272 TraceCheckUtils]: 48: Hoare triple {10293#(and (= 5 main_~c~0) (= 5 main_~y~0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {10148#true} is VALID [2022-04-15 10:47:07,002 INFO L290 TraceCheckUtils]: 49: Hoare triple {10148#true} ~cond := #in~cond; {10148#true} is VALID [2022-04-15 10:47:07,002 INFO L290 TraceCheckUtils]: 50: Hoare triple {10148#true} assume !(0 == ~cond); {10148#true} is VALID [2022-04-15 10:47:07,002 INFO L290 TraceCheckUtils]: 51: Hoare triple {10148#true} assume true; {10148#true} is VALID [2022-04-15 10:47:07,003 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {10148#true} {10293#(and (= 5 main_~c~0) (= 5 main_~y~0))} #51#return; {10293#(and (= 5 main_~c~0) (= 5 main_~y~0))} is VALID [2022-04-15 10:47:07,003 INFO L290 TraceCheckUtils]: 53: Hoare triple {10293#(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 + ~x~0; {10318#(and (= main_~c~0 6) (= 5 (+ (- 1) main_~y~0)))} is VALID [2022-04-15 10:47:07,004 INFO L290 TraceCheckUtils]: 54: Hoare triple {10318#(and (= main_~c~0 6) (= 5 (+ (- 1) main_~y~0)))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {10318#(and (= main_~c~0 6) (= 5 (+ (- 1) main_~y~0)))} is VALID [2022-04-15 10:47:07,004 INFO L290 TraceCheckUtils]: 55: Hoare triple {10318#(and (= main_~c~0 6) (= 5 (+ (- 1) main_~y~0)))} assume !!(#t~post5 < 20);havoc #t~post5; {10318#(and (= main_~c~0 6) (= 5 (+ (- 1) main_~y~0)))} is VALID [2022-04-15 10:47:07,004 INFO L272 TraceCheckUtils]: 56: Hoare triple {10318#(and (= main_~c~0 6) (= 5 (+ (- 1) main_~y~0)))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {10148#true} is VALID [2022-04-15 10:47:07,004 INFO L290 TraceCheckUtils]: 57: Hoare triple {10148#true} ~cond := #in~cond; {10148#true} is VALID [2022-04-15 10:47:07,004 INFO L290 TraceCheckUtils]: 58: Hoare triple {10148#true} assume !(0 == ~cond); {10148#true} is VALID [2022-04-15 10:47:07,004 INFO L290 TraceCheckUtils]: 59: Hoare triple {10148#true} assume true; {10148#true} is VALID [2022-04-15 10:47:07,005 INFO L284 TraceCheckUtils]: 60: Hoare quadruple {10148#true} {10318#(and (= main_~c~0 6) (= 5 (+ (- 1) main_~y~0)))} #51#return; {10318#(and (= main_~c~0 6) (= 5 (+ (- 1) main_~y~0)))} is VALID [2022-04-15 10:47:07,005 INFO L290 TraceCheckUtils]: 61: Hoare triple {10318#(and (= main_~c~0 6) (= 5 (+ (- 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 + ~x~0; {10343#(and (= (+ (- 2) main_~y~0) 5) (= 7 main_~c~0))} is VALID [2022-04-15 10:47:07,005 INFO L290 TraceCheckUtils]: 62: Hoare triple {10343#(and (= (+ (- 2) main_~y~0) 5) (= 7 main_~c~0))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {10343#(and (= (+ (- 2) main_~y~0) 5) (= 7 main_~c~0))} is VALID [2022-04-15 10:47:07,006 INFO L290 TraceCheckUtils]: 63: Hoare triple {10343#(and (= (+ (- 2) main_~y~0) 5) (= 7 main_~c~0))} assume !!(#t~post5 < 20);havoc #t~post5; {10343#(and (= (+ (- 2) main_~y~0) 5) (= 7 main_~c~0))} is VALID [2022-04-15 10:47:07,006 INFO L272 TraceCheckUtils]: 64: Hoare triple {10343#(and (= (+ (- 2) main_~y~0) 5) (= 7 main_~c~0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {10148#true} is VALID [2022-04-15 10:47:07,006 INFO L290 TraceCheckUtils]: 65: Hoare triple {10148#true} ~cond := #in~cond; {10148#true} is VALID [2022-04-15 10:47:07,006 INFO L290 TraceCheckUtils]: 66: Hoare triple {10148#true} assume !(0 == ~cond); {10148#true} is VALID [2022-04-15 10:47:07,006 INFO L290 TraceCheckUtils]: 67: Hoare triple {10148#true} assume true; {10148#true} is VALID [2022-04-15 10:47:07,007 INFO L284 TraceCheckUtils]: 68: Hoare quadruple {10148#true} {10343#(and (= (+ (- 2) main_~y~0) 5) (= 7 main_~c~0))} #51#return; {10343#(and (= (+ (- 2) main_~y~0) 5) (= 7 main_~c~0))} is VALID [2022-04-15 10:47:07,007 INFO L290 TraceCheckUtils]: 69: Hoare triple {10343#(and (= (+ (- 2) main_~y~0) 5) (= 7 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 + ~x~0; {10368#(and (< 7 main_~k~0) (= main_~y~0 8) (<= main_~c~0 8))} is VALID [2022-04-15 10:47:07,007 INFO L290 TraceCheckUtils]: 70: Hoare triple {10368#(and (< 7 main_~k~0) (= main_~y~0 8) (<= main_~c~0 8))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {10368#(and (< 7 main_~k~0) (= main_~y~0 8) (<= main_~c~0 8))} is VALID [2022-04-15 10:47:07,008 INFO L290 TraceCheckUtils]: 71: Hoare triple {10368#(and (< 7 main_~k~0) (= main_~y~0 8) (<= main_~c~0 8))} assume !!(#t~post5 < 20);havoc #t~post5; {10368#(and (< 7 main_~k~0) (= main_~y~0 8) (<= main_~c~0 8))} is VALID [2022-04-15 10:47:07,008 INFO L272 TraceCheckUtils]: 72: Hoare triple {10368#(and (< 7 main_~k~0) (= main_~y~0 8) (<= main_~c~0 8))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {10148#true} is VALID [2022-04-15 10:47:07,008 INFO L290 TraceCheckUtils]: 73: Hoare triple {10148#true} ~cond := #in~cond; {10148#true} is VALID [2022-04-15 10:47:07,008 INFO L290 TraceCheckUtils]: 74: Hoare triple {10148#true} assume !(0 == ~cond); {10148#true} is VALID [2022-04-15 10:47:07,008 INFO L290 TraceCheckUtils]: 75: Hoare triple {10148#true} assume true; {10148#true} is VALID [2022-04-15 10:47:07,008 INFO L284 TraceCheckUtils]: 76: Hoare quadruple {10148#true} {10368#(and (< 7 main_~k~0) (= main_~y~0 8) (<= main_~c~0 8))} #51#return; {10368#(and (< 7 main_~k~0) (= main_~y~0 8) (<= main_~c~0 8))} is VALID [2022-04-15 10:47:07,009 INFO L290 TraceCheckUtils]: 77: Hoare triple {10368#(and (< 7 main_~k~0) (= main_~y~0 8) (<= main_~c~0 8))} assume !(~c~0 < ~k~0); {10393#(and (< 7 main_~k~0) (= main_~y~0 8) (<= main_~k~0 8))} is VALID [2022-04-15 10:47:07,010 INFO L272 TraceCheckUtils]: 78: Hoare triple {10393#(and (< 7 main_~k~0) (= main_~y~0 8) (<= main_~k~0 8))} call __VERIFIER_assert((if 0 == ~k~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {10397#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 10:47:07,010 INFO L290 TraceCheckUtils]: 79: Hoare triple {10397#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {10401#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 10:47:07,011 INFO L290 TraceCheckUtils]: 80: Hoare triple {10401#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {10149#false} is VALID [2022-04-15 10:47:07,011 INFO L290 TraceCheckUtils]: 81: Hoare triple {10149#false} assume !false; {10149#false} is VALID [2022-04-15 10:47:07,023 INFO L134 CoverageAnalysis]: Checked inductivity of 306 backedges. 18 proven. 144 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2022-04-15 10:47:07,023 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 10:47:07,266 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 10:47:07,267 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1708725685] [2022-04-15 10:47:07,267 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 10:47:07,267 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1708426712] [2022-04-15 10:47:07,267 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1708426712] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 10:47:07,267 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-15 10:47:07,267 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2022-04-15 10:47:07,267 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 10:47:07,267 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2092211638] [2022-04-15 10:47:07,267 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2092211638] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 10:47:07,267 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 10:47:07,267 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-04-15 10:47:07,268 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [48443797] [2022-04-15 10:47:07,268 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 10:47:07,268 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 2.769230769230769) internal successors, (36), 13 states have internal predecessors, (36), 11 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) Word has length 82 [2022-04-15 10:47:07,268 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 10:47:07,268 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 14 states, 13 states have (on average 2.769230769230769) internal successors, (36), 13 states have internal predecessors, (36), 11 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-15 10:47:07,325 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 58 edges. 58 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 10:47:07,325 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-04-15 10:47:07,325 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 10:47:07,326 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-04-15 10:47:07,326 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=227, Unknown=0, NotChecked=0, Total=272 [2022-04-15 10:47:07,326 INFO L87 Difference]: Start difference. First operand 85 states and 86 transitions. Second operand has 14 states, 13 states have (on average 2.769230769230769) internal successors, (36), 13 states have internal predecessors, (36), 11 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-15 10:47:08,317 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 10:47:08,317 INFO L93 Difference]: Finished difference Result 92 states and 94 transitions. [2022-04-15 10:47:08,317 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-04-15 10:47:08,317 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 2.769230769230769) internal successors, (36), 13 states have internal predecessors, (36), 11 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) Word has length 82 [2022-04-15 10:47:08,317 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 10:47:08,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 13 states have (on average 2.769230769230769) internal successors, (36), 13 states have internal predecessors, (36), 11 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-15 10:47:08,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 69 transitions. [2022-04-15 10:47:08,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 13 states have (on average 2.769230769230769) internal successors, (36), 13 states have internal predecessors, (36), 11 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-15 10:47:08,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 69 transitions. [2022-04-15 10:47:08,319 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 14 states and 69 transitions. [2022-04-15 10:47:08,372 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-15 10:47:08,374 INFO L225 Difference]: With dead ends: 92 [2022-04-15 10:47:08,374 INFO L226 Difference]: Without dead ends: 87 [2022-04-15 10:47:08,374 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 79 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-15 10:47:08,374 INFO L913 BasicCegarLoop]: 50 mSDtfsCounter, 2 mSDsluCounter, 358 mSDsCounter, 0 mSdLazyCounter, 347 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 408 SdHoareTripleChecker+Invalid, 347 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 347 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-04-15 10:47:08,374 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [2 Valid, 408 Invalid, 347 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 347 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-04-15 10:47:08,375 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2022-04-15 10:47:08,548 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 87. [2022-04-15 10:47:08,548 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 10:47:08,549 INFO L82 GeneralOperation]: Start isEquivalent. First operand 87 states. Second operand has 87 states, 63 states have (on average 1.0317460317460319) internal successors, (65), 63 states have internal predecessors, (65), 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-15 10:47:08,549 INFO L74 IsIncluded]: Start isIncluded. First operand 87 states. Second operand has 87 states, 63 states have (on average 1.0317460317460319) internal successors, (65), 63 states have internal predecessors, (65), 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-15 10:47:08,549 INFO L87 Difference]: Start difference. First operand 87 states. Second operand has 87 states, 63 states have (on average 1.0317460317460319) internal successors, (65), 63 states have internal predecessors, (65), 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-15 10:47:08,550 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 10:47:08,550 INFO L93 Difference]: Finished difference Result 87 states and 89 transitions. [2022-04-15 10:47:08,550 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 89 transitions. [2022-04-15 10:47:08,550 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 10:47:08,550 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 10:47:08,551 INFO L74 IsIncluded]: Start isIncluded. First operand has 87 states, 63 states have (on average 1.0317460317460319) internal successors, (65), 63 states have internal predecessors, (65), 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 87 states. [2022-04-15 10:47:08,551 INFO L87 Difference]: Start difference. First operand has 87 states, 63 states have (on average 1.0317460317460319) internal successors, (65), 63 states have internal predecessors, (65), 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 87 states. [2022-04-15 10:47:08,552 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 10:47:08,552 INFO L93 Difference]: Finished difference Result 87 states and 89 transitions. [2022-04-15 10:47:08,552 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 89 transitions. [2022-04-15 10:47:08,552 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 10:47:08,552 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 10:47:08,552 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 10:47:08,552 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 10:47:08,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 63 states have (on average 1.0317460317460319) internal successors, (65), 63 states have internal predecessors, (65), 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-15 10:47:08,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 89 transitions. [2022-04-15 10:47:08,553 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 89 transitions. Word has length 82 [2022-04-15 10:47:08,553 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 10:47:08,554 INFO L478 AbstractCegarLoop]: Abstraction has 87 states and 89 transitions. [2022-04-15 10:47:08,554 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 2.769230769230769) internal successors, (36), 13 states have internal predecessors, (36), 11 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-15 10:47:08,554 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 87 states and 89 transitions. [2022-04-15 10:47:09,112 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 89 edges. 89 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 10:47:09,112 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 89 transitions. [2022-04-15 10:47:09,113 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2022-04-15 10:47:09,113 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 10:47:09,113 INFO L499 BasicCegarLoop]: trace histogram [10, 10, 9, 9, 9, 9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 10:47:09,119 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Ended with exit code 0 [2022-04-15 10:47:09,313 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-15 10:47:09,314 INFO L403 AbstractCegarLoop]: === Iteration 21 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 10:47:09,314 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 10:47:09,314 INFO L85 PathProgramCache]: Analyzing trace with hash -2095421916, now seen corresponding path program 17 times [2022-04-15 10:47:09,314 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 10:47:09,314 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1613435530] [2022-04-15 10:47:09,391 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 4 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 10:47:09,392 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONLINEAR_UPDATE [2022-04-15 10:47:09,392 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 10:47:09,392 INFO L85 PathProgramCache]: Analyzing trace with hash -2095421916, now seen corresponding path program 18 times [2022-04-15 10:47:09,392 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 10:47:09,392 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1319830091] [2022-04-15 10:47:09,392 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 10:47:09,392 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 10:47:09,419 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 10:47:09,419 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1196281871] [2022-04-15 10:47:09,419 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-15 10:47:09,419 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 10:47:09,420 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 10:47:09,420 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-15 10:47:09,436 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process