/usr/bin/java -ea -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data --core.log.level.for.class de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationQvasr_64.epf -i ../../../trunk/examples/svcomp/nla-digbench-scaling/ps4-ll_unwindbound100.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-34549b5 [2022-04-08 14:16:14,713 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-08 14:16:14,715 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-08 14:16:14,744 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-08 14:16:14,744 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-08 14:16:14,745 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-08 14:16:14,746 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-08 14:16:14,748 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-08 14:16:14,749 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-08 14:16:14,750 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-08 14:16:14,750 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-08 14:16:14,751 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-08 14:16:14,752 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-08 14:16:14,752 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-08 14:16:14,753 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-08 14:16:14,754 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-08 14:16:14,754 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-08 14:16:14,755 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-08 14:16:14,756 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-08 14:16:14,758 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-08 14:16:14,759 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-08 14:16:14,760 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-08 14:16:14,760 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-08 14:16:14,761 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-08 14:16:14,762 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-08 14:16:14,764 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-08 14:16:14,764 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-08 14:16:14,765 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-08 14:16:14,765 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-08 14:16:14,765 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-08 14:16:14,766 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-08 14:16:14,766 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-08 14:16:14,767 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-08 14:16:14,767 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-08 14:16:14,768 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-08 14:16:14,769 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-08 14:16:14,769 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-08 14:16:14,769 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-08 14:16:14,770 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-08 14:16:14,770 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-08 14:16:14,770 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-08 14:16:14,771 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-08 14:16:14,772 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationQvasr_64.epf [2022-04-08 14:16:14,778 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-08 14:16:14,778 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-08 14:16:14,779 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-08 14:16:14,779 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-08 14:16:14,780 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-08 14:16:14,780 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-08 14:16:14,780 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-08 14:16:14,780 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-08 14:16:14,780 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-08 14:16:14,781 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-08 14:16:14,781 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-08 14:16:14,781 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-08 14:16:14,781 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-08 14:16:14,781 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-08 14:16:14,781 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-08 14:16:14,782 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-08 14:16:14,782 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-08 14:16:14,782 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-04-08 14:16:14,782 INFO L138 SettingsManager]: * Trace refinement strategy=ACCELERATED_INTERPOLATION [2022-04-08 14:16:14,782 INFO L138 SettingsManager]: * Trace refinement strategy used in Accelerated Interpolation=CAMEL [2022-04-08 14:16:14,783 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-08 14:16:14,783 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=QVASR [2022-04-08 14:16:14,783 INFO L138 SettingsManager]: * Use separate solver for trace checks=false WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.core: Log level for class -> de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN; [2022-04-08 14:16:15,001 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-08 14:16:15,023 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-08 14:16:15,025 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-08 14:16:15,026 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-08 14:16:15,028 INFO L275 PluginConnector]: CDTParser initialized [2022-04-08 14:16:15,029 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/nla-digbench-scaling/ps4-ll_unwindbound100.c [2022-04-08 14:16:15,079 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3cd7729f3/0333e7c0c0ef44a49340104e8dde388e/FLAGda44a7639 [2022-04-08 14:16:15,383 INFO L306 CDTParser]: Found 1 translation units. [2022-04-08 14:16:15,383 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/ps4-ll_unwindbound100.c [2022-04-08 14:16:15,392 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3cd7729f3/0333e7c0c0ef44a49340104e8dde388e/FLAGda44a7639 [2022-04-08 14:16:15,831 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3cd7729f3/0333e7c0c0ef44a49340104e8dde388e [2022-04-08 14:16:15,833 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-08 14:16:15,835 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-08 14:16:15,836 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-08 14:16:15,836 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-08 14:16:15,840 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-08 14:16:15,841 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.04 02:16:15" (1/1) ... [2022-04-08 14:16:15,843 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@29cb4f8d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 02:16:15, skipping insertion in model container [2022-04-08 14:16:15,843 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.04 02:16:15" (1/1) ... [2022-04-08 14:16:15,848 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-08 14:16:15,860 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-08 14:16:15,974 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_unwindbound100.c[458,471] [2022-04-08 14:16:15,988 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-08 14:16:15,994 INFO L203 MainTranslator]: Completed pre-run [2022-04-08 14:16:16,022 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_unwindbound100.c[458,471] [2022-04-08 14:16:16,028 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-08 14:16:16,040 INFO L208 MainTranslator]: Completed translation [2022-04-08 14:16:16,040 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 02:16:16 WrapperNode [2022-04-08 14:16:16,040 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-08 14:16:16,041 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-08 14:16:16,041 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-08 14:16:16,041 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-08 14:16:16,054 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 02:16:16" (1/1) ... [2022-04-08 14:16:16,055 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 02:16:16" (1/1) ... [2022-04-08 14:16:16,060 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 02:16:16" (1/1) ... [2022-04-08 14:16:16,060 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 02:16:16" (1/1) ... [2022-04-08 14:16:16,065 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 02:16:16" (1/1) ... [2022-04-08 14:16:16,068 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 02:16:16" (1/1) ... [2022-04-08 14:16:16,069 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 02:16:16" (1/1) ... [2022-04-08 14:16:16,070 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-08 14:16:16,071 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-08 14:16:16,071 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-08 14:16:16,071 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-08 14:16:16,072 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 02:16:16" (1/1) ... [2022-04-08 14:16:16,084 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-08 14:16:16,094 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 14:16:16,104 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-04-08 14:16:16,105 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-04-08 14:16:16,129 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-08 14:16:16,129 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-08 14:16:16,129 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-08 14:16:16,129 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-08 14:16:16,129 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-08 14:16:16,130 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-08 14:16:16,130 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-08 14:16:16,130 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-08 14:16:16,130 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-08 14:16:16,130 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-08 14:16:16,130 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_short [2022-04-08 14:16:16,130 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-08 14:16:16,131 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-08 14:16:16,131 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-08 14:16:16,131 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-08 14:16:16,131 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-08 14:16:16,131 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-08 14:16:16,131 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-08 14:16:16,131 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-08 14:16:16,132 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-08 14:16:16,179 INFO L234 CfgBuilder]: Building ICFG [2022-04-08 14:16:16,180 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-08 14:16:16,288 INFO L275 CfgBuilder]: Performing block encoding [2022-04-08 14:16:16,294 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-08 14:16:16,294 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-08 14:16:16,311 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.04 02:16:16 BoogieIcfgContainer [2022-04-08 14:16:16,311 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-08 14:16:16,313 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-08 14:16:16,313 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-08 14:16:16,327 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-08 14:16:16,327 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.04 02:16:15" (1/3) ... [2022-04-08 14:16:16,328 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@a83e97 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.04 02:16:16, skipping insertion in model container [2022-04-08 14:16:16,328 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 02:16:16" (2/3) ... [2022-04-08 14:16:16,328 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@a83e97 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.04 02:16:16, skipping insertion in model container [2022-04-08 14:16:16,328 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.04 02:16:16" (3/3) ... [2022-04-08 14:16:16,329 INFO L111 eAbstractionObserver]: Analyzing ICFG ps4-ll_unwindbound100.c [2022-04-08 14:16:16,333 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-04-08 14:16:16,333 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-08 14:16:16,378 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-08 14:16:16,386 INFO L340 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=Craig_NestedInterpolation, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP [2022-04-08 14:16:16,386 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-08 14:16:16,405 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-08 14:16:16,410 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-04-08 14:16:16,410 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 14:16:16,411 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 14:16:16,411 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 14:16:16,419 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 14:16:16,419 INFO L85 PathProgramCache]: Analyzing trace with hash -2133548928, now seen corresponding path program 1 times [2022-04-08 14:16:16,427 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 14:16:16,428 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1349322450] [2022-04-08 14:16:16,437 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 14:16:16,437 INFO L85 PathProgramCache]: Analyzing trace with hash -2133548928, now seen corresponding path program 2 times [2022-04-08 14:16:16,441 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 14:16:16,442 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [400548562] [2022-04-08 14:16:16,442 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 14:16:16,444 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 14:16:16,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 14:16:16,611 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 14:16:16,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 14:16:16,635 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-08 14:16:16,635 INFO L290 TraceCheckUtils]: 1: Hoare triple {26#true} assume true; {26#true} is VALID [2022-04-08 14:16:16,635 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {26#true} {26#true} #57#return; {26#true} is VALID [2022-04-08 14:16:16,637 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-08 14:16:16,637 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-08 14:16:16,637 INFO L290 TraceCheckUtils]: 2: Hoare triple {26#true} assume true; {26#true} is VALID [2022-04-08 14:16:16,638 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {26#true} {26#true} #57#return; {26#true} is VALID [2022-04-08 14:16:16,638 INFO L272 TraceCheckUtils]: 4: Hoare triple {26#true} call #t~ret6 := main(); {26#true} is VALID [2022-04-08 14:16:16,638 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-08 14:16:16,640 INFO L290 TraceCheckUtils]: 6: Hoare triple {26#true} assume !true; {27#false} is VALID [2022-04-08 14:16:16,641 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-08 14:16:16,641 INFO L290 TraceCheckUtils]: 8: Hoare triple {27#false} ~cond := #in~cond; {27#false} is VALID [2022-04-08 14:16:16,641 INFO L290 TraceCheckUtils]: 9: Hoare triple {27#false} assume 0 == ~cond; {27#false} is VALID [2022-04-08 14:16:16,641 INFO L290 TraceCheckUtils]: 10: Hoare triple {27#false} assume !false; {27#false} is VALID [2022-04-08 14:16:16,642 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 14:16:16,642 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 14:16:16,642 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [400548562] [2022-04-08 14:16:16,643 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [400548562] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 14:16:16,643 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 14:16:16,643 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-08 14:16:16,645 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 14:16:16,645 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1349322450] [2022-04-08 14:16:16,646 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1349322450] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 14:16:16,646 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 14:16:16,646 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-08 14:16:16,646 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2136331911] [2022-04-08 14:16:16,646 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 14:16:16,650 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-08 14:16:16,652 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 14:16:16,654 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-08 14:16:16,668 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-08 14:16:16,669 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-08 14:16:16,669 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 14:16:16,691 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-08 14:16:16,692 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-08 14:16:16,694 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-08 14:16:16,902 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:16:16,902 INFO L93 Difference]: Finished difference Result 41 states and 55 transitions. [2022-04-08 14:16:16,903 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-08 14:16:16,903 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-08 14:16:16,903 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 14:16:16,904 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-08 14:16:16,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 55 transitions. [2022-04-08 14:16:16,917 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-08 14:16:16,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 55 transitions. [2022-04-08 14:16:16,925 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 55 transitions. [2022-04-08 14:16:17,002 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-08 14:16:17,015 INFO L225 Difference]: With dead ends: 41 [2022-04-08 14:16:17,016 INFO L226 Difference]: Without dead ends: 19 [2022-04-08 14:16:17,018 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-08 14:16:17,024 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-08 14:16:17,025 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-08 14:16:17,039 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2022-04-08 14:16:17,067 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 18. [2022-04-08 14:16:17,067 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 14:16:17,068 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-08 14:16:17,069 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-08 14:16:17,069 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-08 14:16:17,072 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:16:17,072 INFO L93 Difference]: Finished difference Result 19 states and 22 transitions. [2022-04-08 14:16:17,072 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 22 transitions. [2022-04-08 14:16:17,072 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 14:16:17,072 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 14:16:17,073 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-08 14:16:17,073 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-08 14:16:17,075 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:16:17,075 INFO L93 Difference]: Finished difference Result 19 states and 22 transitions. [2022-04-08 14:16:17,075 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 22 transitions. [2022-04-08 14:16:17,076 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 14:16:17,076 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 14:16:17,076 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 14:16:17,076 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 14:16:17,076 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-08 14:16:17,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 21 transitions. [2022-04-08 14:16:17,081 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 21 transitions. Word has length 11 [2022-04-08 14:16:17,081 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 14:16:17,081 INFO L478 AbstractCegarLoop]: Abstraction has 18 states and 21 transitions. [2022-04-08 14:16:17,081 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-08 14:16:17,081 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 18 states and 21 transitions. [2022-04-08 14:16:17,105 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-08 14:16:17,107 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 21 transitions. [2022-04-08 14:16:17,108 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-04-08 14:16:17,110 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 14:16:17,111 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 14:16:17,116 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-08 14:16:17,117 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 14:16:17,118 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 14:16:17,118 INFO L85 PathProgramCache]: Analyzing trace with hash -2118701623, now seen corresponding path program 1 times [2022-04-08 14:16:17,118 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 14:16:17,119 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [300353994] [2022-04-08 14:16:17,121 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 14:16:17,121 INFO L85 PathProgramCache]: Analyzing trace with hash -2118701623, now seen corresponding path program 2 times [2022-04-08 14:16:17,121 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 14:16:17,122 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2006263840] [2022-04-08 14:16:17,122 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 14:16:17,122 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 14:16:17,151 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 14:16:17,153 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1706825526] [2022-04-08 14:16:17,153 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 14:16:17,154 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 14:16:17,154 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 14:16:17,163 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 14:16:17,169 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-04-08 14:16:17,218 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-04-08 14:16:17,218 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 14:16:17,224 INFO L263 TraceCheckSpWp]: Trace formula consists of 71 conjuncts, 5 conjunts are in the unsatisfiable core [2022-04-08 14:16:17,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 14:16:17,237 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 14:16:17,356 INFO L272 TraceCheckUtils]: 0: Hoare triple {190#true} call ULTIMATE.init(); {190#true} is VALID [2022-04-08 14:16:17,357 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-08 14:16:17,358 INFO L290 TraceCheckUtils]: 2: Hoare triple {198#(<= ~counter~0 0)} assume true; {198#(<= ~counter~0 0)} is VALID [2022-04-08 14:16:17,359 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {198#(<= ~counter~0 0)} {190#true} #57#return; {198#(<= ~counter~0 0)} is VALID [2022-04-08 14:16:17,359 INFO L272 TraceCheckUtils]: 4: Hoare triple {198#(<= ~counter~0 0)} call #t~ret6 := main(); {198#(<= ~counter~0 0)} is VALID [2022-04-08 14:16:17,360 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-08 14:16:17,360 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-08 14:16:17,361 INFO L290 TraceCheckUtils]: 7: Hoare triple {214#(<= |main_#t~post5| 0)} assume !(#t~post5 < 100);havoc #t~post5; {191#false} is VALID [2022-04-08 14:16:17,363 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-08 14:16:17,363 INFO L290 TraceCheckUtils]: 9: Hoare triple {191#false} ~cond := #in~cond; {191#false} is VALID [2022-04-08 14:16:17,363 INFO L290 TraceCheckUtils]: 10: Hoare triple {191#false} assume 0 == ~cond; {191#false} is VALID [2022-04-08 14:16:17,363 INFO L290 TraceCheckUtils]: 11: Hoare triple {191#false} assume !false; {191#false} is VALID [2022-04-08 14:16:17,364 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 14:16:17,364 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-08 14:16:17,364 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 14:16:17,364 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2006263840] [2022-04-08 14:16:17,365 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 14:16:17,365 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1706825526] [2022-04-08 14:16:17,366 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1706825526] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 14:16:17,366 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 14:16:17,366 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 14:16:17,367 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 14:16:17,367 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [300353994] [2022-04-08 14:16:17,367 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [300353994] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 14:16:17,367 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 14:16:17,368 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 14:16:17,368 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [76012146] [2022-04-08 14:16:17,368 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 14:16:17,368 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-08 14:16:17,369 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 14:16:17,369 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-08 14:16:17,380 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-08 14:16:17,380 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-08 14:16:17,380 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 14:16:17,380 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-08 14:16:17,381 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-08 14:16:17,381 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-08 14:16:17,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:16:17,454 INFO L93 Difference]: Finished difference Result 28 states and 32 transitions. [2022-04-08 14:16:17,455 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-08 14:16:17,455 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-08 14:16:17,456 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 14:16:17,456 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-08 14:16:17,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 32 transitions. [2022-04-08 14:16:17,461 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-08 14:16:17,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 32 transitions. [2022-04-08 14:16:17,476 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 32 transitions. [2022-04-08 14:16:17,504 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-08 14:16:17,506 INFO L225 Difference]: With dead ends: 28 [2022-04-08 14:16:17,507 INFO L226 Difference]: Without dead ends: 20 [2022-04-08 14:16:17,508 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-08 14:16:17,510 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-08 14:16:17,512 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-08 14:16:17,513 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2022-04-08 14:16:17,521 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2022-04-08 14:16:17,522 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 14:16:17,522 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-08 14:16:17,522 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-08 14:16:17,523 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-08 14:16:17,524 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:16:17,524 INFO L93 Difference]: Finished difference Result 20 states and 23 transitions. [2022-04-08 14:16:17,524 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 23 transitions. [2022-04-08 14:16:17,525 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 14:16:17,525 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 14:16:17,525 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-08 14:16:17,526 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-08 14:16:17,527 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:16:17,527 INFO L93 Difference]: Finished difference Result 20 states and 23 transitions. [2022-04-08 14:16:17,527 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 23 transitions. [2022-04-08 14:16:17,528 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 14:16:17,528 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 14:16:17,528 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 14:16:17,528 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 14:16:17,528 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-08 14:16:17,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 23 transitions. [2022-04-08 14:16:17,530 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 23 transitions. Word has length 12 [2022-04-08 14:16:17,530 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 14:16:17,530 INFO L478 AbstractCegarLoop]: Abstraction has 20 states and 23 transitions. [2022-04-08 14:16:17,530 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-08 14:16:17,530 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 20 states and 23 transitions. [2022-04-08 14:16:17,553 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-08 14:16:17,553 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 23 transitions. [2022-04-08 14:16:17,553 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-04-08 14:16:17,553 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 14:16:17,554 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 14:16:17,579 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-04-08 14:16:17,770 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 14:16:17,771 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 14:16:17,771 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 14:16:17,777 INFO L85 PathProgramCache]: Analyzing trace with hash -2116914163, now seen corresponding path program 1 times [2022-04-08 14:16:17,777 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 14:16:17,777 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [578446895] [2022-04-08 14:16:17,778 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 14:16:17,778 INFO L85 PathProgramCache]: Analyzing trace with hash -2116914163, now seen corresponding path program 2 times [2022-04-08 14:16:17,778 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 14:16:17,778 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1582782445] [2022-04-08 14:16:17,779 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 14:16:17,779 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 14:16:17,792 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 14:16:17,792 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1459367138] [2022-04-08 14:16:17,792 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 14:16:17,793 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 14:16:17,793 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 14:16:17,794 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 14:16:17,803 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-04-08 14:16:17,837 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-04-08 14:16:17,838 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 14:16:17,838 INFO L263 TraceCheckSpWp]: Trace formula consists of 71 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-08 14:16:17,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 14:16:17,858 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 14:16:17,964 INFO L272 TraceCheckUtils]: 0: Hoare triple {365#true} call ULTIMATE.init(); {365#true} is VALID [2022-04-08 14:16:17,964 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-08 14:16:17,965 INFO L290 TraceCheckUtils]: 2: Hoare triple {365#true} assume true; {365#true} is VALID [2022-04-08 14:16:17,965 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {365#true} {365#true} #57#return; {365#true} is VALID [2022-04-08 14:16:17,965 INFO L272 TraceCheckUtils]: 4: Hoare triple {365#true} call #t~ret6 := main(); {365#true} is VALID [2022-04-08 14:16:17,966 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-08 14:16:17,966 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-08 14:16:17,967 INFO L290 TraceCheckUtils]: 7: Hoare triple {385#(and (= main_~x~0 0) (= main_~y~0 0))} assume !!(#t~post5 < 100);havoc #t~post5; {385#(and (= main_~x~0 0) (= main_~y~0 0))} is VALID [2022-04-08 14:16:17,968 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-08 14:16:17,969 INFO L290 TraceCheckUtils]: 9: Hoare triple {395#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {399#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 14:16:17,969 INFO L290 TraceCheckUtils]: 10: Hoare triple {399#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {366#false} is VALID [2022-04-08 14:16:17,969 INFO L290 TraceCheckUtils]: 11: Hoare triple {366#false} assume !false; {366#false} is VALID [2022-04-08 14:16:17,970 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 14:16:17,970 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-08 14:16:17,970 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 14:16:17,970 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1582782445] [2022-04-08 14:16:17,970 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 14:16:17,970 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1459367138] [2022-04-08 14:16:17,971 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1459367138] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 14:16:17,971 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 14:16:17,971 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 14:16:17,971 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 14:16:17,971 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [578446895] [2022-04-08 14:16:17,971 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [578446895] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 14:16:17,971 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 14:16:17,971 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 14:16:17,971 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1872076455] [2022-04-08 14:16:17,972 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 14:16:17,972 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-08 14:16:17,972 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 14:16:17,973 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-08 14:16:17,994 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-08 14:16:17,994 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-08 14:16:17,994 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 14:16:17,995 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-08 14:16:17,995 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-08 14:16:17,995 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-08 14:16:18,139 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:16:18,139 INFO L93 Difference]: Finished difference Result 30 states and 35 transitions. [2022-04-08 14:16:18,139 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-08 14:16:18,140 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-08 14:16:18,140 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 14:16:18,140 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-08 14:16:18,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 35 transitions. [2022-04-08 14:16:18,142 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-08 14:16:18,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 35 transitions. [2022-04-08 14:16:18,143 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 35 transitions. [2022-04-08 14:16:18,177 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 35 edges. 35 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 14:16:18,178 INFO L225 Difference]: With dead ends: 30 [2022-04-08 14:16:18,178 INFO L226 Difference]: Without dead ends: 26 [2022-04-08 14:16:18,179 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-08 14:16:18,180 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-08 14:16:18,180 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-08 14:16:18,181 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2022-04-08 14:16:18,197 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2022-04-08 14:16:18,197 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 14:16:18,197 INFO L82 GeneralOperation]: Start isEquivalent. First operand 26 states. Second operand has 26 states, 16 states have (on average 1.1875) internal successors, (19), 17 states have internal predecessors, (19), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-08 14:16:18,200 INFO L74 IsIncluded]: Start isIncluded. First operand 26 states. Second operand has 26 states, 16 states have (on average 1.1875) internal successors, (19), 17 states have internal predecessors, (19), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-08 14:16:18,200 INFO L87 Difference]: Start difference. First operand 26 states. Second operand has 26 states, 16 states have (on average 1.1875) internal successors, (19), 17 states have internal predecessors, (19), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-08 14:16:18,210 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:16:18,211 INFO L93 Difference]: Finished difference Result 26 states and 29 transitions. [2022-04-08 14:16:18,211 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 29 transitions. [2022-04-08 14:16:18,211 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 14:16:18,211 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 14:16:18,212 INFO L74 IsIncluded]: Start isIncluded. First operand has 26 states, 16 states have (on average 1.1875) internal successors, (19), 17 states have internal predecessors, (19), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand 26 states. [2022-04-08 14:16:18,212 INFO L87 Difference]: Start difference. First operand has 26 states, 16 states have (on average 1.1875) internal successors, (19), 17 states have internal predecessors, (19), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand 26 states. [2022-04-08 14:16:18,215 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:16:18,215 INFO L93 Difference]: Finished difference Result 26 states and 29 transitions. [2022-04-08 14:16:18,215 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 29 transitions. [2022-04-08 14:16:18,216 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 14:16:18,216 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 14:16:18,216 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 14:16:18,216 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 14:16:18,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 16 states have (on average 1.1875) internal successors, (19), 17 states have internal predecessors, (19), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-08 14:16:18,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 29 transitions. [2022-04-08 14:16:18,218 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 29 transitions. Word has length 12 [2022-04-08 14:16:18,218 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 14:16:18,218 INFO L478 AbstractCegarLoop]: Abstraction has 26 states and 29 transitions. [2022-04-08 14:16:18,218 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-08 14:16:18,218 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 26 states and 29 transitions. [2022-04-08 14:16:18,256 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 29 edges. 29 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 14:16:18,256 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 29 transitions. [2022-04-08 14:16:18,260 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-04-08 14:16:18,260 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 14:16:18,260 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-08 14:16:18,286 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-04-08 14:16:18,474 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2022-04-08 14:16:18,474 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 14:16:18,475 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 14:16:18,475 INFO L85 PathProgramCache]: Analyzing trace with hash -263585780, now seen corresponding path program 1 times [2022-04-08 14:16:18,475 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 14:16:18,475 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1148355045] [2022-04-08 14:16:18,632 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 14:16:18,632 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 14:16:18,632 INFO L85 PathProgramCache]: Analyzing trace with hash -263585780, now seen corresponding path program 2 times [2022-04-08 14:16:18,632 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 14:16:18,632 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1167531476] [2022-04-08 14:16:18,632 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 14:16:18,633 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 14:16:18,643 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 14:16:18,644 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1913195575] [2022-04-08 14:16:18,644 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 14:16:18,644 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 14:16:18,644 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 14:16:18,645 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 14:16:18,673 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-04-08 14:16:18,690 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 14:16:18,690 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 14:16:18,691 INFO L263 TraceCheckSpWp]: Trace formula consists of 92 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-08 14:16:18,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 14:16:18,700 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 14:16:18,830 INFO L272 TraceCheckUtils]: 0: Hoare triple {571#true} call ULTIMATE.init(); {571#true} is VALID [2022-04-08 14:16:18,831 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-08 14:16:18,832 INFO L290 TraceCheckUtils]: 2: Hoare triple {579#(<= ~counter~0 0)} assume true; {579#(<= ~counter~0 0)} is VALID [2022-04-08 14:16:18,832 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {579#(<= ~counter~0 0)} {571#true} #57#return; {579#(<= ~counter~0 0)} is VALID [2022-04-08 14:16:18,833 INFO L272 TraceCheckUtils]: 4: Hoare triple {579#(<= ~counter~0 0)} call #t~ret6 := main(); {579#(<= ~counter~0 0)} is VALID [2022-04-08 14:16:18,833 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-08 14:16:18,834 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-08 14:16:18,834 INFO L290 TraceCheckUtils]: 7: Hoare triple {595#(<= ~counter~0 1)} assume !!(#t~post5 < 100);havoc #t~post5; {595#(<= ~counter~0 1)} is VALID [2022-04-08 14:16:18,836 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-08 14:16:18,837 INFO L290 TraceCheckUtils]: 9: Hoare triple {595#(<= ~counter~0 1)} ~cond := #in~cond; {595#(<= ~counter~0 1)} is VALID [2022-04-08 14:16:18,839 INFO L290 TraceCheckUtils]: 10: Hoare triple {595#(<= ~counter~0 1)} assume !(0 == ~cond); {595#(<= ~counter~0 1)} is VALID [2022-04-08 14:16:18,842 INFO L290 TraceCheckUtils]: 11: Hoare triple {595#(<= ~counter~0 1)} assume true; {595#(<= ~counter~0 1)} is VALID [2022-04-08 14:16:18,843 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {595#(<= ~counter~0 1)} {595#(<= ~counter~0 1)} #51#return; {595#(<= ~counter~0 1)} is VALID [2022-04-08 14:16:18,843 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-08 14:16:18,844 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-08 14:16:18,844 INFO L290 TraceCheckUtils]: 15: Hoare triple {620#(<= |main_#t~post5| 1)} assume !(#t~post5 < 100);havoc #t~post5; {572#false} is VALID [2022-04-08 14:16:18,844 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-08 14:16:18,844 INFO L290 TraceCheckUtils]: 17: Hoare triple {572#false} ~cond := #in~cond; {572#false} is VALID [2022-04-08 14:16:18,845 INFO L290 TraceCheckUtils]: 18: Hoare triple {572#false} assume 0 == ~cond; {572#false} is VALID [2022-04-08 14:16:18,845 INFO L290 TraceCheckUtils]: 19: Hoare triple {572#false} assume !false; {572#false} is VALID [2022-04-08 14:16:18,845 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 14:16:18,845 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 14:16:18,987 INFO L290 TraceCheckUtils]: 19: Hoare triple {572#false} assume !false; {572#false} is VALID [2022-04-08 14:16:18,988 INFO L290 TraceCheckUtils]: 18: Hoare triple {572#false} assume 0 == ~cond; {572#false} is VALID [2022-04-08 14:16:18,988 INFO L290 TraceCheckUtils]: 17: Hoare triple {572#false} ~cond := #in~cond; {572#false} is VALID [2022-04-08 14:16:18,988 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-08 14:16:18,989 INFO L290 TraceCheckUtils]: 15: Hoare triple {648#(< |main_#t~post5| 100)} assume !(#t~post5 < 100);havoc #t~post5; {572#false} is VALID [2022-04-08 14:16:18,989 INFO L290 TraceCheckUtils]: 14: Hoare triple {652#(< ~counter~0 100)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {648#(< |main_#t~post5| 100)} is VALID [2022-04-08 14:16:18,990 INFO L290 TraceCheckUtils]: 13: Hoare triple {652#(< ~counter~0 100)} 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 100)} is VALID [2022-04-08 14:16:18,990 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {571#true} {652#(< ~counter~0 100)} #51#return; {652#(< ~counter~0 100)} is VALID [2022-04-08 14:16:18,990 INFO L290 TraceCheckUtils]: 11: Hoare triple {571#true} assume true; {571#true} is VALID [2022-04-08 14:16:18,991 INFO L290 TraceCheckUtils]: 10: Hoare triple {571#true} assume !(0 == ~cond); {571#true} is VALID [2022-04-08 14:16:18,991 INFO L290 TraceCheckUtils]: 9: Hoare triple {571#true} ~cond := #in~cond; {571#true} is VALID [2022-04-08 14:16:18,991 INFO L272 TraceCheckUtils]: 8: Hoare triple {652#(< ~counter~0 100)} 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-08 14:16:18,991 INFO L290 TraceCheckUtils]: 7: Hoare triple {652#(< ~counter~0 100)} assume !!(#t~post5 < 100);havoc #t~post5; {652#(< ~counter~0 100)} is VALID [2022-04-08 14:16:18,992 INFO L290 TraceCheckUtils]: 6: Hoare triple {677#(< ~counter~0 99)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {652#(< ~counter~0 100)} is VALID [2022-04-08 14:16:18,992 INFO L290 TraceCheckUtils]: 5: Hoare triple {677#(< ~counter~0 99)} 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 99)} is VALID [2022-04-08 14:16:18,993 INFO L272 TraceCheckUtils]: 4: Hoare triple {677#(< ~counter~0 99)} call #t~ret6 := main(); {677#(< ~counter~0 99)} is VALID [2022-04-08 14:16:18,993 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {677#(< ~counter~0 99)} {571#true} #57#return; {677#(< ~counter~0 99)} is VALID [2022-04-08 14:16:18,994 INFO L290 TraceCheckUtils]: 2: Hoare triple {677#(< ~counter~0 99)} assume true; {677#(< ~counter~0 99)} is VALID [2022-04-08 14:16:18,994 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 99)} is VALID [2022-04-08 14:16:18,994 INFO L272 TraceCheckUtils]: 0: Hoare triple {571#true} call ULTIMATE.init(); {571#true} is VALID [2022-04-08 14:16:18,995 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 14:16:18,995 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 14:16:18,995 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1167531476] [2022-04-08 14:16:18,995 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 14:16:18,996 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1913195575] [2022-04-08 14:16:18,996 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1913195575] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 14:16:18,996 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-08 14:16:18,996 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2022-04-08 14:16:18,996 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 14:16:18,996 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1148355045] [2022-04-08 14:16:18,996 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1148355045] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 14:16:18,996 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 14:16:18,996 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 14:16:18,996 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [432205231] [2022-04-08 14:16:18,997 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 14:16:18,997 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-08 14:16:18,997 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 14:16:18,997 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-08 14:16:19,012 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-08 14:16:19,013 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-08 14:16:19,013 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 14:16:19,014 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-08 14:16:19,014 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2022-04-08 14:16:19,014 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-08 14:16:19,104 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:16:19,104 INFO L93 Difference]: Finished difference Result 36 states and 40 transitions. [2022-04-08 14:16:19,104 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-08 14:16:19,104 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-08 14:16:19,105 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 14:16:19,105 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-08 14:16:19,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 40 transitions. [2022-04-08 14:16:19,110 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-08 14:16:19,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 40 transitions. [2022-04-08 14:16:19,113 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 40 transitions. [2022-04-08 14:16:19,145 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-08 14:16:19,146 INFO L225 Difference]: With dead ends: 36 [2022-04-08 14:16:19,146 INFO L226 Difference]: Without dead ends: 28 [2022-04-08 14:16:19,146 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-08 14:16:19,148 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-08 14:16:19,149 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-08 14:16:19,150 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2022-04-08 14:16:19,169 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2022-04-08 14:16:19,170 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 14:16:19,170 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-08 14:16:19,172 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-08 14:16:19,172 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-08 14:16:19,176 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:16:19,176 INFO L93 Difference]: Finished difference Result 28 states and 31 transitions. [2022-04-08 14:16:19,176 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 31 transitions. [2022-04-08 14:16:19,177 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 14:16:19,177 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 14:16:19,178 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-08 14:16:19,178 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-08 14:16:19,184 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:16:19,184 INFO L93 Difference]: Finished difference Result 28 states and 31 transitions. [2022-04-08 14:16:19,184 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 31 transitions. [2022-04-08 14:16:19,185 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 14:16:19,185 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 14:16:19,185 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 14:16:19,186 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 14:16:19,186 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-08 14:16:19,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 31 transitions. [2022-04-08 14:16:19,187 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 31 transitions. Word has length 20 [2022-04-08 14:16:19,188 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 14:16:19,188 INFO L478 AbstractCegarLoop]: Abstraction has 28 states and 31 transitions. [2022-04-08 14:16:19,188 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-08 14:16:19,188 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 28 states and 31 transitions. [2022-04-08 14:16:19,223 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 31 edges. 31 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 14:16:19,223 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 31 transitions. [2022-04-08 14:16:19,224 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-04-08 14:16:19,224 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 14:16:19,224 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 14:16:19,246 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-04-08 14:16:19,443 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 14:16:19,444 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 14:16:19,444 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 14:16:19,444 INFO L85 PathProgramCache]: Analyzing trace with hash -261798320, now seen corresponding path program 1 times [2022-04-08 14:16:19,444 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 14:16:19,444 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1612754693] [2022-04-08 14:16:19,597 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 14:16:19,598 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 14:16:19,598 INFO L85 PathProgramCache]: Analyzing trace with hash -261798320, now seen corresponding path program 2 times [2022-04-08 14:16:19,598 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 14:16:19,598 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [107298814] [2022-04-08 14:16:19,598 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 14:16:19,598 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 14:16:19,620 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 14:16:19,620 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [613404858] [2022-04-08 14:16:19,620 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 14:16:19,620 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 14:16:19,621 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 14:16:19,628 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 14:16:19,655 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-04-08 14:16:19,675 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 14:16:19,675 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 14:16:19,675 INFO L263 TraceCheckSpWp]: Trace formula consists of 92 conjuncts, 11 conjunts are in the unsatisfiable core [2022-04-08 14:16:19,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 14:16:19,685 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 14:16:19,786 INFO L272 TraceCheckUtils]: 0: Hoare triple {884#true} call ULTIMATE.init(); {884#true} is VALID [2022-04-08 14:16:19,786 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-08 14:16:19,786 INFO L290 TraceCheckUtils]: 2: Hoare triple {884#true} assume true; {884#true} is VALID [2022-04-08 14:16:19,786 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {884#true} {884#true} #57#return; {884#true} is VALID [2022-04-08 14:16:19,786 INFO L272 TraceCheckUtils]: 4: Hoare triple {884#true} call #t~ret6 := main(); {884#true} is VALID [2022-04-08 14:16:19,787 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-08 14:16:19,787 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-08 14:16:19,788 INFO L290 TraceCheckUtils]: 7: Hoare triple {904#(and (= main_~x~0 0) (= main_~y~0 0))} assume !!(#t~post5 < 100);havoc #t~post5; {904#(and (= main_~x~0 0) (= main_~y~0 0))} is VALID [2022-04-08 14:16:19,788 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-08 14:16:19,788 INFO L290 TraceCheckUtils]: 9: Hoare triple {884#true} ~cond := #in~cond; {884#true} is VALID [2022-04-08 14:16:19,788 INFO L290 TraceCheckUtils]: 10: Hoare triple {884#true} assume !(0 == ~cond); {884#true} is VALID [2022-04-08 14:16:19,788 INFO L290 TraceCheckUtils]: 11: Hoare triple {884#true} assume true; {884#true} is VALID [2022-04-08 14:16:19,789 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-08 14:16:19,789 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-08 14:16:19,790 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-08 14:16:19,790 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 < 100);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-08 14:16:19,791 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-08 14:16:19,792 INFO L290 TraceCheckUtils]: 17: Hoare triple {939#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {943#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 14:16:19,792 INFO L290 TraceCheckUtils]: 18: Hoare triple {943#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {885#false} is VALID [2022-04-08 14:16:19,792 INFO L290 TraceCheckUtils]: 19: Hoare triple {885#false} assume !false; {885#false} is VALID [2022-04-08 14:16:19,793 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 14:16:19,793 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 14:16:20,486 INFO L290 TraceCheckUtils]: 19: Hoare triple {885#false} assume !false; {885#false} is VALID [2022-04-08 14:16:20,486 INFO L290 TraceCheckUtils]: 18: Hoare triple {943#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {885#false} is VALID [2022-04-08 14:16:20,487 INFO L290 TraceCheckUtils]: 17: Hoare triple {939#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {943#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 14:16:20,488 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-08 14:16:20,488 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 < 100);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-08 14:16:20,489 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-08 14:16:20,501 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-08 14:16:20,502 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-08 14:16:20,502 INFO L290 TraceCheckUtils]: 11: Hoare triple {884#true} assume true; {884#true} is VALID [2022-04-08 14:16:20,502 INFO L290 TraceCheckUtils]: 10: Hoare triple {884#true} assume !(0 == ~cond); {884#true} is VALID [2022-04-08 14:16:20,502 INFO L290 TraceCheckUtils]: 9: Hoare triple {884#true} ~cond := #in~cond; {884#true} is VALID [2022-04-08 14:16:20,502 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-08 14:16:20,503 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 < 100);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-08 14:16:20,503 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-08 14:16:20,504 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-08 14:16:20,504 INFO L272 TraceCheckUtils]: 4: Hoare triple {884#true} call #t~ret6 := main(); {884#true} is VALID [2022-04-08 14:16:20,504 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {884#true} {884#true} #57#return; {884#true} is VALID [2022-04-08 14:16:20,504 INFO L290 TraceCheckUtils]: 2: Hoare triple {884#true} assume true; {884#true} is VALID [2022-04-08 14:16:20,504 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-08 14:16:20,505 INFO L272 TraceCheckUtils]: 0: Hoare triple {884#true} call ULTIMATE.init(); {884#true} is VALID [2022-04-08 14:16:20,505 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-04-08 14:16:20,505 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 14:16:20,505 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [107298814] [2022-04-08 14:16:20,505 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 14:16:20,505 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [613404858] [2022-04-08 14:16:20,505 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [613404858] provided 1 perfect and 1 imperfect interpolant sequences [2022-04-08 14:16:20,506 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-04-08 14:16:20,506 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 7 [2022-04-08 14:16:20,506 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 14:16:20,506 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1612754693] [2022-04-08 14:16:20,506 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1612754693] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 14:16:20,506 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 14:16:20,506 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 14:16:20,506 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1519468586] [2022-04-08 14:16:20,506 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 14:16:20,507 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-08 14:16:20,507 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 14:16:20,507 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-08 14:16:20,532 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 18 edges. 18 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 14:16:20,532 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-08 14:16:20,533 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 14:16:20,533 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-08 14:16:20,533 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-04-08 14:16:20,533 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-08 14:16:20,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:16:20,651 INFO L93 Difference]: Finished difference Result 34 states and 36 transitions. [2022-04-08 14:16:20,651 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-08 14:16:20,651 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-08 14:16:20,651 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 14:16:20,651 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-08 14:16:20,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 26 transitions. [2022-04-08 14:16:20,652 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-08 14:16:20,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 26 transitions. [2022-04-08 14:16:20,653 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 26 transitions. [2022-04-08 14:16:20,685 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 26 edges. 26 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 14:16:20,686 INFO L225 Difference]: With dead ends: 34 [2022-04-08 14:16:20,686 INFO L226 Difference]: Without dead ends: 29 [2022-04-08 14:16:20,687 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 32 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-04-08 14:16:20,687 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-08 14:16:20,688 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-08 14:16:20,688 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2022-04-08 14:16:20,709 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2022-04-08 14:16:20,709 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 14:16:20,709 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-08 14:16:20,710 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-08 14:16:20,710 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-08 14:16:20,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:16:20,711 INFO L93 Difference]: Finished difference Result 29 states and 30 transitions. [2022-04-08 14:16:20,711 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 30 transitions. [2022-04-08 14:16:20,711 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 14:16:20,711 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 14:16:20,712 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-08 14:16:20,712 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-08 14:16:20,713 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:16:20,713 INFO L93 Difference]: Finished difference Result 29 states and 30 transitions. [2022-04-08 14:16:20,713 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 30 transitions. [2022-04-08 14:16:20,713 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 14:16:20,713 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 14:16:20,713 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 14:16:20,713 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 14:16:20,714 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-08 14:16:20,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 30 transitions. [2022-04-08 14:16:20,715 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 30 transitions. Word has length 20 [2022-04-08 14:16:20,715 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 14:16:20,715 INFO L478 AbstractCegarLoop]: Abstraction has 29 states and 30 transitions. [2022-04-08 14:16:20,715 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-08 14:16:20,715 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 29 states and 30 transitions. [2022-04-08 14:16:20,755 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-08 14:16:20,755 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 30 transitions. [2022-04-08 14:16:20,755 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-04-08 14:16:20,755 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 14:16:20,755 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-08 14:16:20,772 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-04-08 14:16:20,956 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 14:16:20,956 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 14:16:20,956 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 14:16:20,956 INFO L85 PathProgramCache]: Analyzing trace with hash 891414954, now seen corresponding path program 1 times [2022-04-08 14:16:20,957 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 14:16:20,957 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [507568348] [2022-04-08 14:16:21,070 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 14:16:21,070 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 14:16:21,070 INFO L85 PathProgramCache]: Analyzing trace with hash 891414954, now seen corresponding path program 2 times [2022-04-08 14:16:21,070 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 14:16:21,071 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [50341481] [2022-04-08 14:16:21,071 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 14:16:21,071 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 14:16:21,102 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 14:16:21,102 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1508087641] [2022-04-08 14:16:21,102 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 14:16:21,102 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 14:16:21,103 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 14:16:21,107 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 14:16:21,108 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-04-08 14:16:21,147 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 14:16:21,147 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 14:16:21,148 INFO L263 TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 12 conjunts are in the unsatisfiable core [2022-04-08 14:16:21,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 14:16:21,177 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 14:16:21,457 INFO L272 TraceCheckUtils]: 0: Hoare triple {1196#true} call ULTIMATE.init(); {1196#true} is VALID [2022-04-08 14:16:21,458 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-08 14:16:21,458 INFO L290 TraceCheckUtils]: 2: Hoare triple {1196#true} assume true; {1196#true} is VALID [2022-04-08 14:16:21,458 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1196#true} {1196#true} #57#return; {1196#true} is VALID [2022-04-08 14:16:21,458 INFO L272 TraceCheckUtils]: 4: Hoare triple {1196#true} call #t~ret6 := main(); {1196#true} is VALID [2022-04-08 14:16:21,460 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-08 14:16:21,464 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-08 14:16:21,464 INFO L290 TraceCheckUtils]: 7: Hoare triple {1216#(and (= main_~c~0 0) (= main_~y~0 0))} assume !!(#t~post5 < 100);havoc #t~post5; {1216#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-08 14:16:21,464 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-08 14:16:21,465 INFO L290 TraceCheckUtils]: 9: Hoare triple {1196#true} ~cond := #in~cond; {1196#true} is VALID [2022-04-08 14:16:21,465 INFO L290 TraceCheckUtils]: 10: Hoare triple {1196#true} assume !(0 == ~cond); {1196#true} is VALID [2022-04-08 14:16:21,465 INFO L290 TraceCheckUtils]: 11: Hoare triple {1196#true} assume true; {1196#true} is VALID [2022-04-08 14:16:21,465 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-08 14:16:21,466 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-08 14:16:21,466 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-08 14:16:21,478 INFO L290 TraceCheckUtils]: 15: Hoare triple {1241#(and (= (+ (- 1) main_~y~0) 0) (< 0 main_~k~0) (<= main_~c~0 1))} assume !!(#t~post5 < 100);havoc #t~post5; {1241#(and (= (+ (- 1) main_~y~0) 0) (< 0 main_~k~0) (<= main_~c~0 1))} is VALID [2022-04-08 14:16:21,478 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-08 14:16:21,478 INFO L290 TraceCheckUtils]: 17: Hoare triple {1196#true} ~cond := #in~cond; {1196#true} is VALID [2022-04-08 14:16:21,478 INFO L290 TraceCheckUtils]: 18: Hoare triple {1196#true} assume !(0 == ~cond); {1196#true} is VALID [2022-04-08 14:16:21,478 INFO L290 TraceCheckUtils]: 19: Hoare triple {1196#true} assume true; {1196#true} is VALID [2022-04-08 14:16:21,479 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-08 14:16:21,480 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-08 14:16:21,480 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-08 14:16:21,481 INFO L290 TraceCheckUtils]: 23: Hoare triple {1270#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1274#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 14:16:21,481 INFO L290 TraceCheckUtils]: 24: Hoare triple {1274#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1197#false} is VALID [2022-04-08 14:16:21,481 INFO L290 TraceCheckUtils]: 25: Hoare triple {1197#false} assume !false; {1197#false} is VALID [2022-04-08 14:16:21,482 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-08 14:16:21,482 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 14:16:21,837 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 14:16:21,837 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [50341481] [2022-04-08 14:16:21,837 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 14:16:21,838 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1508087641] [2022-04-08 14:16:21,838 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1508087641] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 14:16:21,838 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-08 14:16:21,838 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2022-04-08 14:16:21,838 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 14:16:21,838 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [507568348] [2022-04-08 14:16:21,838 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [507568348] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 14:16:21,838 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 14:16:21,838 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-08 14:16:21,838 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [966945970] [2022-04-08 14:16:21,838 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 14:16:21,839 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-08 14:16:21,839 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 14:16:21,839 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-08 14:16:21,864 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-08 14:16:21,865 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-08 14:16:21,865 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 14:16:21,865 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-08 14:16:21,865 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2022-04-08 14:16:21,865 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-08 14:16:22,066 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:16:22,066 INFO L93 Difference]: Finished difference Result 36 states and 38 transitions. [2022-04-08 14:16:22,066 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-08 14:16:22,067 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-08 14:16:22,067 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 14:16:22,067 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-08 14:16:22,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 34 transitions. [2022-04-08 14:16:22,069 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-08 14:16:22,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 34 transitions. [2022-04-08 14:16:22,070 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 34 transitions. [2022-04-08 14:16:22,100 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-08 14:16:22,101 INFO L225 Difference]: With dead ends: 36 [2022-04-08 14:16:22,101 INFO L226 Difference]: Without dead ends: 31 [2022-04-08 14:16:22,101 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-08 14:16:22,102 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-08 14:16:22,102 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-08 14:16:22,103 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2022-04-08 14:16:22,132 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2022-04-08 14:16:22,132 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 14:16:22,132 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-08 14:16:22,132 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-08 14:16:22,133 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-08 14:16:22,135 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:16:22,135 INFO L93 Difference]: Finished difference Result 31 states and 33 transitions. [2022-04-08 14:16:22,135 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 33 transitions. [2022-04-08 14:16:22,135 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 14:16:22,135 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 14:16:22,136 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-08 14:16:22,136 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-08 14:16:22,137 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:16:22,137 INFO L93 Difference]: Finished difference Result 31 states and 33 transitions. [2022-04-08 14:16:22,137 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 33 transitions. [2022-04-08 14:16:22,137 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 14:16:22,137 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 14:16:22,137 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 14:16:22,137 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 14:16:22,138 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-08 14:16:22,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 33 transitions. [2022-04-08 14:16:22,140 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 33 transitions. Word has length 26 [2022-04-08 14:16:22,140 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 14:16:22,140 INFO L478 AbstractCegarLoop]: Abstraction has 31 states and 33 transitions. [2022-04-08 14:16:22,140 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-08 14:16:22,140 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 31 states and 33 transitions. [2022-04-08 14:16:22,185 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-08 14:16:22,186 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 33 transitions. [2022-04-08 14:16:22,186 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-04-08 14:16:22,186 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 14:16:22,186 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-08 14:16:22,206 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-04-08 14:16:22,386 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 14:16:22,387 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 14:16:22,387 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 14:16:22,387 INFO L85 PathProgramCache]: Analyzing trace with hash -1647059121, now seen corresponding path program 3 times [2022-04-08 14:16:22,387 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 14:16:22,387 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [108174738] [2022-04-08 14:16:22,530 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 14:16:22,530 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 14:16:22,530 INFO L85 PathProgramCache]: Analyzing trace with hash -1647059121, now seen corresponding path program 4 times [2022-04-08 14:16:22,530 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 14:16:22,530 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2099755360] [2022-04-08 14:16:22,530 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 14:16:22,530 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 14:16:22,545 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 14:16:22,545 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [426286543] [2022-04-08 14:16:22,545 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-08 14:16:22,545 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 14:16:22,546 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 14:16:22,552 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 14:16:22,553 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-04-08 14:16:22,592 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-08 14:16:22,593 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 14:16:22,593 INFO L263 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 9 conjunts are in the unsatisfiable core [2022-04-08 14:16:22,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 14:16:22,604 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 14:16:22,769 INFO L272 TraceCheckUtils]: 0: Hoare triple {1525#true} call ULTIMATE.init(); {1525#true} is VALID [2022-04-08 14:16:22,770 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-08 14:16:22,771 INFO L290 TraceCheckUtils]: 2: Hoare triple {1533#(<= ~counter~0 0)} assume true; {1533#(<= ~counter~0 0)} is VALID [2022-04-08 14:16:22,771 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1533#(<= ~counter~0 0)} {1525#true} #57#return; {1533#(<= ~counter~0 0)} is VALID [2022-04-08 14:16:22,772 INFO L272 TraceCheckUtils]: 4: Hoare triple {1533#(<= ~counter~0 0)} call #t~ret6 := main(); {1533#(<= ~counter~0 0)} is VALID [2022-04-08 14:16:22,772 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-08 14:16:22,773 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-08 14:16:22,775 INFO L290 TraceCheckUtils]: 7: Hoare triple {1549#(<= ~counter~0 1)} assume !!(#t~post5 < 100);havoc #t~post5; {1549#(<= ~counter~0 1)} is VALID [2022-04-08 14:16:22,775 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-08 14:16:22,776 INFO L290 TraceCheckUtils]: 9: Hoare triple {1549#(<= ~counter~0 1)} ~cond := #in~cond; {1549#(<= ~counter~0 1)} is VALID [2022-04-08 14:16:22,776 INFO L290 TraceCheckUtils]: 10: Hoare triple {1549#(<= ~counter~0 1)} assume !(0 == ~cond); {1549#(<= ~counter~0 1)} is VALID [2022-04-08 14:16:22,777 INFO L290 TraceCheckUtils]: 11: Hoare triple {1549#(<= ~counter~0 1)} assume true; {1549#(<= ~counter~0 1)} is VALID [2022-04-08 14:16:22,777 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {1549#(<= ~counter~0 1)} {1549#(<= ~counter~0 1)} #51#return; {1549#(<= ~counter~0 1)} is VALID [2022-04-08 14:16:22,778 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-08 14:16:22,778 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-08 14:16:22,779 INFO L290 TraceCheckUtils]: 15: Hoare triple {1574#(<= ~counter~0 2)} assume !!(#t~post5 < 100);havoc #t~post5; {1574#(<= ~counter~0 2)} is VALID [2022-04-08 14:16:22,779 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-08 14:16:22,780 INFO L290 TraceCheckUtils]: 17: Hoare triple {1574#(<= ~counter~0 2)} ~cond := #in~cond; {1574#(<= ~counter~0 2)} is VALID [2022-04-08 14:16:22,780 INFO L290 TraceCheckUtils]: 18: Hoare triple {1574#(<= ~counter~0 2)} assume !(0 == ~cond); {1574#(<= ~counter~0 2)} is VALID [2022-04-08 14:16:22,781 INFO L290 TraceCheckUtils]: 19: Hoare triple {1574#(<= ~counter~0 2)} assume true; {1574#(<= ~counter~0 2)} is VALID [2022-04-08 14:16:22,781 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {1574#(<= ~counter~0 2)} {1574#(<= ~counter~0 2)} #51#return; {1574#(<= ~counter~0 2)} is VALID [2022-04-08 14:16:22,782 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-08 14:16:22,782 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-08 14:16:22,783 INFO L290 TraceCheckUtils]: 23: Hoare triple {1599#(<= |main_#t~post5| 2)} assume !(#t~post5 < 100);havoc #t~post5; {1526#false} is VALID [2022-04-08 14:16:22,783 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-08 14:16:22,783 INFO L290 TraceCheckUtils]: 25: Hoare triple {1526#false} ~cond := #in~cond; {1526#false} is VALID [2022-04-08 14:16:22,784 INFO L290 TraceCheckUtils]: 26: Hoare triple {1526#false} assume 0 == ~cond; {1526#false} is VALID [2022-04-08 14:16:22,784 INFO L290 TraceCheckUtils]: 27: Hoare triple {1526#false} assume !false; {1526#false} is VALID [2022-04-08 14:16:22,784 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-08 14:16:22,784 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 14:16:22,969 INFO L290 TraceCheckUtils]: 27: Hoare triple {1526#false} assume !false; {1526#false} is VALID [2022-04-08 14:16:22,970 INFO L290 TraceCheckUtils]: 26: Hoare triple {1526#false} assume 0 == ~cond; {1526#false} is VALID [2022-04-08 14:16:22,970 INFO L290 TraceCheckUtils]: 25: Hoare triple {1526#false} ~cond := #in~cond; {1526#false} is VALID [2022-04-08 14:16:22,970 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-08 14:16:22,971 INFO L290 TraceCheckUtils]: 23: Hoare triple {1627#(< |main_#t~post5| 100)} assume !(#t~post5 < 100);havoc #t~post5; {1526#false} is VALID [2022-04-08 14:16:22,972 INFO L290 TraceCheckUtils]: 22: Hoare triple {1631#(< ~counter~0 100)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {1627#(< |main_#t~post5| 100)} is VALID [2022-04-08 14:16:22,972 INFO L290 TraceCheckUtils]: 21: Hoare triple {1631#(< ~counter~0 100)} 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 100)} is VALID [2022-04-08 14:16:22,973 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {1525#true} {1631#(< ~counter~0 100)} #51#return; {1631#(< ~counter~0 100)} is VALID [2022-04-08 14:16:22,973 INFO L290 TraceCheckUtils]: 19: Hoare triple {1525#true} assume true; {1525#true} is VALID [2022-04-08 14:16:22,973 INFO L290 TraceCheckUtils]: 18: Hoare triple {1525#true} assume !(0 == ~cond); {1525#true} is VALID [2022-04-08 14:16:22,973 INFO L290 TraceCheckUtils]: 17: Hoare triple {1525#true} ~cond := #in~cond; {1525#true} is VALID [2022-04-08 14:16:22,973 INFO L272 TraceCheckUtils]: 16: Hoare triple {1631#(< ~counter~0 100)} 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-08 14:16:22,973 INFO L290 TraceCheckUtils]: 15: Hoare triple {1631#(< ~counter~0 100)} assume !!(#t~post5 < 100);havoc #t~post5; {1631#(< ~counter~0 100)} is VALID [2022-04-08 14:16:22,974 INFO L290 TraceCheckUtils]: 14: Hoare triple {1656#(< ~counter~0 99)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {1631#(< ~counter~0 100)} is VALID [2022-04-08 14:16:22,974 INFO L290 TraceCheckUtils]: 13: Hoare triple {1656#(< ~counter~0 99)} 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 99)} is VALID [2022-04-08 14:16:22,975 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {1525#true} {1656#(< ~counter~0 99)} #51#return; {1656#(< ~counter~0 99)} is VALID [2022-04-08 14:16:22,975 INFO L290 TraceCheckUtils]: 11: Hoare triple {1525#true} assume true; {1525#true} is VALID [2022-04-08 14:16:22,975 INFO L290 TraceCheckUtils]: 10: Hoare triple {1525#true} assume !(0 == ~cond); {1525#true} is VALID [2022-04-08 14:16:22,975 INFO L290 TraceCheckUtils]: 9: Hoare triple {1525#true} ~cond := #in~cond; {1525#true} is VALID [2022-04-08 14:16:22,975 INFO L272 TraceCheckUtils]: 8: Hoare triple {1656#(< ~counter~0 99)} 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-08 14:16:22,976 INFO L290 TraceCheckUtils]: 7: Hoare triple {1656#(< ~counter~0 99)} assume !!(#t~post5 < 100);havoc #t~post5; {1656#(< ~counter~0 99)} is VALID [2022-04-08 14:16:22,976 INFO L290 TraceCheckUtils]: 6: Hoare triple {1681#(< ~counter~0 98)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {1656#(< ~counter~0 99)} is VALID [2022-04-08 14:16:22,977 INFO L290 TraceCheckUtils]: 5: Hoare triple {1681#(< ~counter~0 98)} 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 98)} is VALID [2022-04-08 14:16:22,977 INFO L272 TraceCheckUtils]: 4: Hoare triple {1681#(< ~counter~0 98)} call #t~ret6 := main(); {1681#(< ~counter~0 98)} is VALID [2022-04-08 14:16:22,977 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1681#(< ~counter~0 98)} {1525#true} #57#return; {1681#(< ~counter~0 98)} is VALID [2022-04-08 14:16:22,978 INFO L290 TraceCheckUtils]: 2: Hoare triple {1681#(< ~counter~0 98)} assume true; {1681#(< ~counter~0 98)} is VALID [2022-04-08 14:16:22,978 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 98)} is VALID [2022-04-08 14:16:22,978 INFO L272 TraceCheckUtils]: 0: Hoare triple {1525#true} call ULTIMATE.init(); {1525#true} is VALID [2022-04-08 14:16:22,979 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-08 14:16:22,979 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 14:16:22,979 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2099755360] [2022-04-08 14:16:22,979 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 14:16:22,979 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [426286543] [2022-04-08 14:16:22,979 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [426286543] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 14:16:22,979 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-08 14:16:22,979 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2022-04-08 14:16:22,980 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 14:16:22,980 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [108174738] [2022-04-08 14:16:22,980 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [108174738] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 14:16:22,980 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 14:16:22,980 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-08 14:16:22,980 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1403014706] [2022-04-08 14:16:22,980 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 14:16:22,980 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-08 14:16:22,981 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 14:16:22,981 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-08 14:16:23,002 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-08 14:16:23,002 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-08 14:16:23,002 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 14:16:23,002 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-08 14:16:23,002 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-04-08 14:16:23,003 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-08 14:16:23,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:16:23,112 INFO L93 Difference]: Finished difference Result 42 states and 43 transitions. [2022-04-08 14:16:23,112 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-08 14:16:23,112 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-08 14:16:23,112 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 14:16:23,112 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-08 14:16:23,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 42 transitions. [2022-04-08 14:16:23,114 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-08 14:16:23,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 42 transitions. [2022-04-08 14:16:23,115 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 42 transitions. [2022-04-08 14:16:23,150 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-08 14:16:23,151 INFO L225 Difference]: With dead ends: 42 [2022-04-08 14:16:23,152 INFO L226 Difference]: Without dead ends: 37 [2022-04-08 14:16:23,152 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-08 14:16:23,152 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-08 14:16:23,153 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-08 14:16:23,153 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2022-04-08 14:16:23,190 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2022-04-08 14:16:23,190 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 14:16:23,190 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-08 14:16:23,190 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-08 14:16:23,191 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-08 14:16:23,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:16:23,192 INFO L93 Difference]: Finished difference Result 37 states and 38 transitions. [2022-04-08 14:16:23,192 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 38 transitions. [2022-04-08 14:16:23,192 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 14:16:23,192 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 14:16:23,192 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-08 14:16:23,193 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-08 14:16:23,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:16:23,194 INFO L93 Difference]: Finished difference Result 37 states and 38 transitions. [2022-04-08 14:16:23,194 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 38 transitions. [2022-04-08 14:16:23,194 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 14:16:23,194 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 14:16:23,194 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 14:16:23,194 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 14:16:23,194 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-08 14:16:23,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 38 transitions. [2022-04-08 14:16:23,195 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 38 transitions. Word has length 28 [2022-04-08 14:16:23,195 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 14:16:23,196 INFO L478 AbstractCegarLoop]: Abstraction has 37 states and 38 transitions. [2022-04-08 14:16:23,196 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-08 14:16:23,196 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 37 states and 38 transitions. [2022-04-08 14:16:23,238 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 38 edges. 38 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 14:16:23,238 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 38 transitions. [2022-04-08 14:16:23,238 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-04-08 14:16:23,239 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 14:16:23,239 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-08 14:16:23,254 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-04-08 14:16:23,443 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 14:16:23,443 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 14:16:23,444 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 14:16:23,444 INFO L85 PathProgramCache]: Analyzing trace with hash 1036651181, now seen corresponding path program 3 times [2022-04-08 14:16:23,444 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 14:16:23,444 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [49719735] [2022-04-08 14:16:23,568 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 14:16:23,568 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 14:16:23,568 INFO L85 PathProgramCache]: Analyzing trace with hash 1036651181, now seen corresponding path program 4 times [2022-04-08 14:16:23,569 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 14:16:23,569 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1307072144] [2022-04-08 14:16:23,569 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 14:16:23,569 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 14:16:23,592 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 14:16:23,592 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1980233300] [2022-04-08 14:16:23,592 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-08 14:16:23,592 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 14:16:23,592 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 14:16:23,593 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 14:16:23,594 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-04-08 14:16:23,656 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-08 14:16:23,656 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 14:16:23,657 INFO L263 TraceCheckSpWp]: Trace formula consists of 123 conjuncts, 17 conjunts are in the unsatisfiable core [2022-04-08 14:16:23,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 14:16:23,670 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 14:16:24,035 INFO L272 TraceCheckUtils]: 0: Hoare triple {1938#true} call ULTIMATE.init(); {1938#true} is VALID [2022-04-08 14:16:24,035 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-08 14:16:24,035 INFO L290 TraceCheckUtils]: 2: Hoare triple {1938#true} assume true; {1938#true} is VALID [2022-04-08 14:16:24,035 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1938#true} {1938#true} #57#return; {1938#true} is VALID [2022-04-08 14:16:24,035 INFO L272 TraceCheckUtils]: 4: Hoare triple {1938#true} call #t~ret6 := main(); {1938#true} is VALID [2022-04-08 14:16:24,036 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-08 14:16:24,036 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-08 14:16:24,037 INFO L290 TraceCheckUtils]: 7: Hoare triple {1958#(and (= main_~c~0 0) (= main_~y~0 0))} assume !!(#t~post5 < 100);havoc #t~post5; {1958#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-08 14:16:24,037 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-08 14:16:24,037 INFO L290 TraceCheckUtils]: 9: Hoare triple {1938#true} ~cond := #in~cond; {1938#true} is VALID [2022-04-08 14:16:24,037 INFO L290 TraceCheckUtils]: 10: Hoare triple {1938#true} assume !(0 == ~cond); {1938#true} is VALID [2022-04-08 14:16:24,037 INFO L290 TraceCheckUtils]: 11: Hoare triple {1938#true} assume true; {1938#true} is VALID [2022-04-08 14:16:24,038 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-08 14:16:24,038 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-08 14:16:24,039 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-08 14:16:24,039 INFO L290 TraceCheckUtils]: 15: Hoare triple {1983#(and (= (+ (- 1) main_~y~0) 0) (< 0 main_~k~0) (= main_~c~0 1))} assume !!(#t~post5 < 100);havoc #t~post5; {1983#(and (= (+ (- 1) main_~y~0) 0) (< 0 main_~k~0) (= main_~c~0 1))} is VALID [2022-04-08 14:16:24,039 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-08 14:16:24,039 INFO L290 TraceCheckUtils]: 17: Hoare triple {1938#true} ~cond := #in~cond; {1938#true} is VALID [2022-04-08 14:16:24,039 INFO L290 TraceCheckUtils]: 18: Hoare triple {1938#true} assume !(0 == ~cond); {1938#true} is VALID [2022-04-08 14:16:24,040 INFO L290 TraceCheckUtils]: 19: Hoare triple {1938#true} assume true; {1938#true} is VALID [2022-04-08 14:16:24,040 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-08 14:16:24,041 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-08 14:16:24,041 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-08 14:16:24,041 INFO L290 TraceCheckUtils]: 23: Hoare triple {2008#(and (= main_~y~0 2) (< 1 main_~k~0) (<= main_~c~0 2))} assume !!(#t~post5 < 100);havoc #t~post5; {2008#(and (= main_~y~0 2) (< 1 main_~k~0) (<= main_~c~0 2))} is VALID [2022-04-08 14:16:24,042 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-08 14:16:24,042 INFO L290 TraceCheckUtils]: 25: Hoare triple {1938#true} ~cond := #in~cond; {1938#true} is VALID [2022-04-08 14:16:24,042 INFO L290 TraceCheckUtils]: 26: Hoare triple {1938#true} assume !(0 == ~cond); {1938#true} is VALID [2022-04-08 14:16:24,042 INFO L290 TraceCheckUtils]: 27: Hoare triple {1938#true} assume true; {1938#true} is VALID [2022-04-08 14:16:24,042 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-08 14:16:24,043 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-08 14:16:24,044 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-08 14:16:24,044 INFO L290 TraceCheckUtils]: 31: Hoare triple {2037#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {2041#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 14:16:24,044 INFO L290 TraceCheckUtils]: 32: Hoare triple {2041#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1939#false} is VALID [2022-04-08 14:16:24,044 INFO L290 TraceCheckUtils]: 33: Hoare triple {1939#false} assume !false; {1939#false} is VALID [2022-04-08 14:16:24,045 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-08 14:16:24,045 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 14:16:24,451 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 14:16:24,451 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1307072144] [2022-04-08 14:16:24,452 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 14:16:24,452 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1980233300] [2022-04-08 14:16:24,452 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1980233300] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 14:16:24,452 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-08 14:16:24,452 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2022-04-08 14:16:24,452 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 14:16:24,452 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [49719735] [2022-04-08 14:16:24,452 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [49719735] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 14:16:24,452 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 14:16:24,452 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-08 14:16:24,453 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [865429900] [2022-04-08 14:16:24,453 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 14:16:24,453 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-08 14:16:24,453 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 14:16:24,453 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-08 14:16:24,479 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-08 14:16:24,479 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-08 14:16:24,479 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 14:16:24,479 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-08 14:16:24,480 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2022-04-08 14:16:24,480 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-08 14:16:24,748 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:16:24,748 INFO L93 Difference]: Finished difference Result 44 states and 46 transitions. [2022-04-08 14:16:24,749 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-08 14:16:24,749 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-08 14:16:24,749 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 14:16:24,749 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-08 14:16:24,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 39 transitions. [2022-04-08 14:16:24,751 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-08 14:16:24,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 39 transitions. [2022-04-08 14:16:24,752 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 39 transitions. [2022-04-08 14:16:24,782 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-08 14:16:24,783 INFO L225 Difference]: With dead ends: 44 [2022-04-08 14:16:24,783 INFO L226 Difference]: Without dead ends: 39 [2022-04-08 14:16:24,784 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-08 14:16:24,784 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-08 14:16:24,785 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-08 14:16:24,785 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2022-04-08 14:16:24,821 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2022-04-08 14:16:24,822 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 14:16:24,822 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-08 14:16:24,829 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-08 14:16:24,830 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-08 14:16:24,831 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:16:24,831 INFO L93 Difference]: Finished difference Result 39 states and 41 transitions. [2022-04-08 14:16:24,831 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 41 transitions. [2022-04-08 14:16:24,831 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 14:16:24,832 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 14:16:24,832 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-08 14:16:24,832 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-08 14:16:24,833 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:16:24,833 INFO L93 Difference]: Finished difference Result 39 states and 41 transitions. [2022-04-08 14:16:24,833 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 41 transitions. [2022-04-08 14:16:24,833 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 14:16:24,833 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 14:16:24,834 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 14:16:24,834 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 14:16:24,834 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-08 14:16:24,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 41 transitions. [2022-04-08 14:16:24,837 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 41 transitions. Word has length 34 [2022-04-08 14:16:24,839 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 14:16:24,839 INFO L478 AbstractCegarLoop]: Abstraction has 39 states and 41 transitions. [2022-04-08 14:16:24,841 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-08 14:16:24,841 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 39 states and 41 transitions. [2022-04-08 14:16:24,898 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 41 edges. 41 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 14:16:24,898 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 41 transitions. [2022-04-08 14:16:24,899 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-04-08 14:16:24,899 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 14:16:24,899 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-08 14:16:24,907 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2022-04-08 14:16:25,099 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 14:16:25,100 INFO L403 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 14:16:25,100 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 14:16:25,100 INFO L85 PathProgramCache]: Analyzing trace with hash 486001554, now seen corresponding path program 5 times [2022-04-08 14:16:25,100 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 14:16:25,100 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [473322043] [2022-04-08 14:16:25,211 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 14:16:25,212 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 14:16:25,212 INFO L85 PathProgramCache]: Analyzing trace with hash 486001554, now seen corresponding path program 6 times [2022-04-08 14:16:25,212 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 14:16:25,212 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1967099756] [2022-04-08 14:16:25,212 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 14:16:25,212 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 14:16:25,222 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 14:16:25,222 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2133253352] [2022-04-08 14:16:25,222 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-08 14:16:25,222 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 14:16:25,222 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 14:16:25,223 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 14:16:25,228 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-04-08 14:16:25,289 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2022-04-08 14:16:25,289 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 14:16:25,290 INFO L263 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 11 conjunts are in the unsatisfiable core [2022-04-08 14:16:25,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 14:16:25,308 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 14:16:25,523 INFO L272 TraceCheckUtils]: 0: Hoare triple {2365#true} call ULTIMATE.init(); {2365#true} is VALID [2022-04-08 14:16:25,524 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-08 14:16:25,524 INFO L290 TraceCheckUtils]: 2: Hoare triple {2373#(<= ~counter~0 0)} assume true; {2373#(<= ~counter~0 0)} is VALID [2022-04-08 14:16:25,525 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2373#(<= ~counter~0 0)} {2365#true} #57#return; {2373#(<= ~counter~0 0)} is VALID [2022-04-08 14:16:25,525 INFO L272 TraceCheckUtils]: 4: Hoare triple {2373#(<= ~counter~0 0)} call #t~ret6 := main(); {2373#(<= ~counter~0 0)} is VALID [2022-04-08 14:16:25,525 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-08 14:16:25,526 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-08 14:16:25,526 INFO L290 TraceCheckUtils]: 7: Hoare triple {2389#(<= ~counter~0 1)} assume !!(#t~post5 < 100);havoc #t~post5; {2389#(<= ~counter~0 1)} is VALID [2022-04-08 14:16:25,527 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-08 14:16:25,527 INFO L290 TraceCheckUtils]: 9: Hoare triple {2389#(<= ~counter~0 1)} ~cond := #in~cond; {2389#(<= ~counter~0 1)} is VALID [2022-04-08 14:16:25,527 INFO L290 TraceCheckUtils]: 10: Hoare triple {2389#(<= ~counter~0 1)} assume !(0 == ~cond); {2389#(<= ~counter~0 1)} is VALID [2022-04-08 14:16:25,528 INFO L290 TraceCheckUtils]: 11: Hoare triple {2389#(<= ~counter~0 1)} assume true; {2389#(<= ~counter~0 1)} is VALID [2022-04-08 14:16:25,528 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {2389#(<= ~counter~0 1)} {2389#(<= ~counter~0 1)} #51#return; {2389#(<= ~counter~0 1)} is VALID [2022-04-08 14:16:25,528 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-08 14:16:25,529 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-08 14:16:25,529 INFO L290 TraceCheckUtils]: 15: Hoare triple {2414#(<= ~counter~0 2)} assume !!(#t~post5 < 100);havoc #t~post5; {2414#(<= ~counter~0 2)} is VALID [2022-04-08 14:16:25,531 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-08 14:16:25,532 INFO L290 TraceCheckUtils]: 17: Hoare triple {2414#(<= ~counter~0 2)} ~cond := #in~cond; {2414#(<= ~counter~0 2)} is VALID [2022-04-08 14:16:25,534 INFO L290 TraceCheckUtils]: 18: Hoare triple {2414#(<= ~counter~0 2)} assume !(0 == ~cond); {2414#(<= ~counter~0 2)} is VALID [2022-04-08 14:16:25,535 INFO L290 TraceCheckUtils]: 19: Hoare triple {2414#(<= ~counter~0 2)} assume true; {2414#(<= ~counter~0 2)} is VALID [2022-04-08 14:16:25,535 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {2414#(<= ~counter~0 2)} {2414#(<= ~counter~0 2)} #51#return; {2414#(<= ~counter~0 2)} is VALID [2022-04-08 14:16:25,537 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-08 14:16:25,538 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-08 14:16:25,538 INFO L290 TraceCheckUtils]: 23: Hoare triple {2439#(<= ~counter~0 3)} assume !!(#t~post5 < 100);havoc #t~post5; {2439#(<= ~counter~0 3)} is VALID [2022-04-08 14:16:25,539 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-08 14:16:25,544 INFO L290 TraceCheckUtils]: 25: Hoare triple {2439#(<= ~counter~0 3)} ~cond := #in~cond; {2439#(<= ~counter~0 3)} is VALID [2022-04-08 14:16:25,544 INFO L290 TraceCheckUtils]: 26: Hoare triple {2439#(<= ~counter~0 3)} assume !(0 == ~cond); {2439#(<= ~counter~0 3)} is VALID [2022-04-08 14:16:25,545 INFO L290 TraceCheckUtils]: 27: Hoare triple {2439#(<= ~counter~0 3)} assume true; {2439#(<= ~counter~0 3)} is VALID [2022-04-08 14:16:25,546 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {2439#(<= ~counter~0 3)} {2439#(<= ~counter~0 3)} #51#return; {2439#(<= ~counter~0 3)} is VALID [2022-04-08 14:16:25,546 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-08 14:16:25,546 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-08 14:16:25,547 INFO L290 TraceCheckUtils]: 31: Hoare triple {2464#(<= |main_#t~post5| 3)} assume !(#t~post5 < 100);havoc #t~post5; {2366#false} is VALID [2022-04-08 14:16:25,547 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-08 14:16:25,547 INFO L290 TraceCheckUtils]: 33: Hoare triple {2366#false} ~cond := #in~cond; {2366#false} is VALID [2022-04-08 14:16:25,547 INFO L290 TraceCheckUtils]: 34: Hoare triple {2366#false} assume 0 == ~cond; {2366#false} is VALID [2022-04-08 14:16:25,547 INFO L290 TraceCheckUtils]: 35: Hoare triple {2366#false} assume !false; {2366#false} is VALID [2022-04-08 14:16:25,547 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-08 14:16:25,548 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 14:16:25,794 INFO L290 TraceCheckUtils]: 35: Hoare triple {2366#false} assume !false; {2366#false} is VALID [2022-04-08 14:16:25,794 INFO L290 TraceCheckUtils]: 34: Hoare triple {2366#false} assume 0 == ~cond; {2366#false} is VALID [2022-04-08 14:16:25,794 INFO L290 TraceCheckUtils]: 33: Hoare triple {2366#false} ~cond := #in~cond; {2366#false} is VALID [2022-04-08 14:16:25,795 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-08 14:16:25,795 INFO L290 TraceCheckUtils]: 31: Hoare triple {2492#(< |main_#t~post5| 100)} assume !(#t~post5 < 100);havoc #t~post5; {2366#false} is VALID [2022-04-08 14:16:25,795 INFO L290 TraceCheckUtils]: 30: Hoare triple {2496#(< ~counter~0 100)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {2492#(< |main_#t~post5| 100)} is VALID [2022-04-08 14:16:25,796 INFO L290 TraceCheckUtils]: 29: Hoare triple {2496#(< ~counter~0 100)} 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 100)} is VALID [2022-04-08 14:16:25,796 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {2365#true} {2496#(< ~counter~0 100)} #51#return; {2496#(< ~counter~0 100)} is VALID [2022-04-08 14:16:25,796 INFO L290 TraceCheckUtils]: 27: Hoare triple {2365#true} assume true; {2365#true} is VALID [2022-04-08 14:16:25,797 INFO L290 TraceCheckUtils]: 26: Hoare triple {2365#true} assume !(0 == ~cond); {2365#true} is VALID [2022-04-08 14:16:25,797 INFO L290 TraceCheckUtils]: 25: Hoare triple {2365#true} ~cond := #in~cond; {2365#true} is VALID [2022-04-08 14:16:25,797 INFO L272 TraceCheckUtils]: 24: Hoare triple {2496#(< ~counter~0 100)} 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-08 14:16:25,798 INFO L290 TraceCheckUtils]: 23: Hoare triple {2496#(< ~counter~0 100)} assume !!(#t~post5 < 100);havoc #t~post5; {2496#(< ~counter~0 100)} is VALID [2022-04-08 14:16:25,798 INFO L290 TraceCheckUtils]: 22: Hoare triple {2521#(< ~counter~0 99)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {2496#(< ~counter~0 100)} is VALID [2022-04-08 14:16:25,799 INFO L290 TraceCheckUtils]: 21: Hoare triple {2521#(< ~counter~0 99)} 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 99)} is VALID [2022-04-08 14:16:25,799 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {2365#true} {2521#(< ~counter~0 99)} #51#return; {2521#(< ~counter~0 99)} is VALID [2022-04-08 14:16:25,799 INFO L290 TraceCheckUtils]: 19: Hoare triple {2365#true} assume true; {2365#true} is VALID [2022-04-08 14:16:25,800 INFO L290 TraceCheckUtils]: 18: Hoare triple {2365#true} assume !(0 == ~cond); {2365#true} is VALID [2022-04-08 14:16:25,800 INFO L290 TraceCheckUtils]: 17: Hoare triple {2365#true} ~cond := #in~cond; {2365#true} is VALID [2022-04-08 14:16:25,800 INFO L272 TraceCheckUtils]: 16: Hoare triple {2521#(< ~counter~0 99)} 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-08 14:16:25,800 INFO L290 TraceCheckUtils]: 15: Hoare triple {2521#(< ~counter~0 99)} assume !!(#t~post5 < 100);havoc #t~post5; {2521#(< ~counter~0 99)} is VALID [2022-04-08 14:16:25,801 INFO L290 TraceCheckUtils]: 14: Hoare triple {2546#(< ~counter~0 98)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {2521#(< ~counter~0 99)} is VALID [2022-04-08 14:16:25,801 INFO L290 TraceCheckUtils]: 13: Hoare triple {2546#(< ~counter~0 98)} 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 98)} is VALID [2022-04-08 14:16:25,801 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {2365#true} {2546#(< ~counter~0 98)} #51#return; {2546#(< ~counter~0 98)} is VALID [2022-04-08 14:16:25,802 INFO L290 TraceCheckUtils]: 11: Hoare triple {2365#true} assume true; {2365#true} is VALID [2022-04-08 14:16:25,802 INFO L290 TraceCheckUtils]: 10: Hoare triple {2365#true} assume !(0 == ~cond); {2365#true} is VALID [2022-04-08 14:16:25,802 INFO L290 TraceCheckUtils]: 9: Hoare triple {2365#true} ~cond := #in~cond; {2365#true} is VALID [2022-04-08 14:16:25,802 INFO L272 TraceCheckUtils]: 8: Hoare triple {2546#(< ~counter~0 98)} 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-08 14:16:25,802 INFO L290 TraceCheckUtils]: 7: Hoare triple {2546#(< ~counter~0 98)} assume !!(#t~post5 < 100);havoc #t~post5; {2546#(< ~counter~0 98)} is VALID [2022-04-08 14:16:25,803 INFO L290 TraceCheckUtils]: 6: Hoare triple {2571#(< ~counter~0 97)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {2546#(< ~counter~0 98)} is VALID [2022-04-08 14:16:25,803 INFO L290 TraceCheckUtils]: 5: Hoare triple {2571#(< ~counter~0 97)} 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 97)} is VALID [2022-04-08 14:16:25,803 INFO L272 TraceCheckUtils]: 4: Hoare triple {2571#(< ~counter~0 97)} call #t~ret6 := main(); {2571#(< ~counter~0 97)} is VALID [2022-04-08 14:16:25,804 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2571#(< ~counter~0 97)} {2365#true} #57#return; {2571#(< ~counter~0 97)} is VALID [2022-04-08 14:16:25,804 INFO L290 TraceCheckUtils]: 2: Hoare triple {2571#(< ~counter~0 97)} assume true; {2571#(< ~counter~0 97)} is VALID [2022-04-08 14:16:25,805 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 97)} is VALID [2022-04-08 14:16:25,805 INFO L272 TraceCheckUtils]: 0: Hoare triple {2365#true} call ULTIMATE.init(); {2365#true} is VALID [2022-04-08 14:16:25,805 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-08 14:16:25,805 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 14:16:25,805 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1967099756] [2022-04-08 14:16:25,805 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 14:16:25,806 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2133253352] [2022-04-08 14:16:25,806 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2133253352] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 14:16:25,806 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-08 14:16:25,806 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2022-04-08 14:16:25,806 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 14:16:25,806 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [473322043] [2022-04-08 14:16:25,806 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [473322043] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 14:16:25,806 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 14:16:25,806 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-08 14:16:25,806 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1644388181] [2022-04-08 14:16:25,807 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 14:16:25,807 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-08 14:16:25,807 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 14:16:25,807 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-08 14:16:25,841 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 36 edges. 36 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 14:16:25,841 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-08 14:16:25,841 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 14:16:25,842 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-08 14:16:25,842 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=82, Unknown=0, NotChecked=0, Total=132 [2022-04-08 14:16:25,842 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-08 14:16:26,036 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:16:26,036 INFO L93 Difference]: Finished difference Result 50 states and 51 transitions. [2022-04-08 14:16:26,036 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-04-08 14:16:26,036 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-08 14:16:26,037 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 14:16:26,037 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-08 14:16:26,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 50 transitions. [2022-04-08 14:16:26,038 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-08 14:16:26,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 50 transitions. [2022-04-08 14:16:26,040 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 10 states and 50 transitions. [2022-04-08 14:16:26,078 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-08 14:16:26,078 INFO L225 Difference]: With dead ends: 50 [2022-04-08 14:16:26,079 INFO L226 Difference]: Without dead ends: 45 [2022-04-08 14:16:26,079 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-08 14:16:26,079 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-08 14:16:26,080 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-08 14:16:26,080 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2022-04-08 14:16:26,127 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2022-04-08 14:16:26,127 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 14:16:26,127 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-08 14:16:26,127 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-08 14:16:26,127 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-08 14:16:26,129 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:16:26,129 INFO L93 Difference]: Finished difference Result 45 states and 46 transitions. [2022-04-08 14:16:26,129 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 46 transitions. [2022-04-08 14:16:26,129 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 14:16:26,129 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 14:16:26,129 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-08 14:16:26,130 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-08 14:16:26,131 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:16:26,131 INFO L93 Difference]: Finished difference Result 45 states and 46 transitions. [2022-04-08 14:16:26,131 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 46 transitions. [2022-04-08 14:16:26,131 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 14:16:26,131 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 14:16:26,131 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 14:16:26,131 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 14:16:26,131 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-08 14:16:26,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 46 transitions. [2022-04-08 14:16:26,133 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 46 transitions. Word has length 36 [2022-04-08 14:16:26,133 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 14:16:26,133 INFO L478 AbstractCegarLoop]: Abstraction has 45 states and 46 transitions. [2022-04-08 14:16:26,133 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-08 14:16:26,133 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 45 states and 46 transitions. [2022-04-08 14:16:26,195 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 46 edges. 46 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 14:16:26,195 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 46 transitions. [2022-04-08 14:16:26,196 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2022-04-08 14:16:26,196 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 14:16:26,196 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-08 14:16:26,221 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-04-08 14:16:26,397 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable8 [2022-04-08 14:16:26,397 INFO L403 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 14:16:26,397 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 14:16:26,397 INFO L85 PathProgramCache]: Analyzing trace with hash -1383171920, now seen corresponding path program 5 times [2022-04-08 14:16:26,398 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 14:16:26,398 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1090363180] [2022-04-08 14:16:26,495 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 14:16:26,495 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 14:16:26,495 INFO L85 PathProgramCache]: Analyzing trace with hash -1383171920, now seen corresponding path program 6 times [2022-04-08 14:16:26,495 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 14:16:26,495 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2082145352] [2022-04-08 14:16:26,495 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 14:16:26,496 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 14:16:26,516 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 14:16:26,516 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2116200353] [2022-04-08 14:16:26,516 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-08 14:16:26,516 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 14:16:26,517 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 14:16:26,517 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 14:16:26,519 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-04-08 14:16:26,634 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2022-04-08 14:16:26,634 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 14:16:26,635 INFO L263 TraceCheckSpWp]: Trace formula consists of 144 conjuncts, 20 conjunts are in the unsatisfiable core [2022-04-08 14:16:26,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 14:16:26,646 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 14:16:26,993 INFO L272 TraceCheckUtils]: 0: Hoare triple {2878#true} call ULTIMATE.init(); {2878#true} is VALID [2022-04-08 14:16:26,993 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-08 14:16:26,993 INFO L290 TraceCheckUtils]: 2: Hoare triple {2878#true} assume true; {2878#true} is VALID [2022-04-08 14:16:26,993 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2878#true} {2878#true} #57#return; {2878#true} is VALID [2022-04-08 14:16:26,993 INFO L272 TraceCheckUtils]: 4: Hoare triple {2878#true} call #t~ret6 := main(); {2878#true} is VALID [2022-04-08 14:16:26,993 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-08 14:16:26,994 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-08 14:16:26,994 INFO L290 TraceCheckUtils]: 7: Hoare triple {2898#(and (= main_~c~0 0) (= main_~y~0 0))} assume !!(#t~post5 < 100);havoc #t~post5; {2898#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-08 14:16:26,994 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-08 14:16:26,994 INFO L290 TraceCheckUtils]: 9: Hoare triple {2878#true} ~cond := #in~cond; {2878#true} is VALID [2022-04-08 14:16:26,994 INFO L290 TraceCheckUtils]: 10: Hoare triple {2878#true} assume !(0 == ~cond); {2878#true} is VALID [2022-04-08 14:16:26,994 INFO L290 TraceCheckUtils]: 11: Hoare triple {2878#true} assume true; {2878#true} is VALID [2022-04-08 14:16:26,995 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-08 14:16:26,995 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-08 14:16:26,996 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-08 14:16:26,996 INFO L290 TraceCheckUtils]: 15: Hoare triple {2923#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} assume !!(#t~post5 < 100);havoc #t~post5; {2923#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} is VALID [2022-04-08 14:16:26,996 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-08 14:16:26,996 INFO L290 TraceCheckUtils]: 17: Hoare triple {2878#true} ~cond := #in~cond; {2878#true} is VALID [2022-04-08 14:16:26,996 INFO L290 TraceCheckUtils]: 18: Hoare triple {2878#true} assume !(0 == ~cond); {2878#true} is VALID [2022-04-08 14:16:26,996 INFO L290 TraceCheckUtils]: 19: Hoare triple {2878#true} assume true; {2878#true} is VALID [2022-04-08 14:16:26,997 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-08 14:16:26,997 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-08 14:16:26,998 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-08 14:16:26,998 INFO L290 TraceCheckUtils]: 23: Hoare triple {2948#(and (= main_~y~0 2) (= main_~c~0 2))} assume !!(#t~post5 < 100);havoc #t~post5; {2948#(and (= main_~y~0 2) (= main_~c~0 2))} is VALID [2022-04-08 14:16:26,998 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-08 14:16:26,998 INFO L290 TraceCheckUtils]: 25: Hoare triple {2878#true} ~cond := #in~cond; {2878#true} is VALID [2022-04-08 14:16:26,998 INFO L290 TraceCheckUtils]: 26: Hoare triple {2878#true} assume !(0 == ~cond); {2878#true} is VALID [2022-04-08 14:16:26,999 INFO L290 TraceCheckUtils]: 27: Hoare triple {2878#true} assume true; {2878#true} is VALID [2022-04-08 14:16:27,004 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-08 14:16:27,005 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-08 14:16:27,005 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-08 14:16:27,005 INFO L290 TraceCheckUtils]: 31: Hoare triple {2973#(and (= 2 (+ (- 1) main_~y~0)) (<= main_~c~0 3) (< 2 main_~k~0))} assume !!(#t~post5 < 100);havoc #t~post5; {2973#(and (= 2 (+ (- 1) main_~y~0)) (<= main_~c~0 3) (< 2 main_~k~0))} is VALID [2022-04-08 14:16:27,006 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-08 14:16:27,006 INFO L290 TraceCheckUtils]: 33: Hoare triple {2878#true} ~cond := #in~cond; {2878#true} is VALID [2022-04-08 14:16:27,006 INFO L290 TraceCheckUtils]: 34: Hoare triple {2878#true} assume !(0 == ~cond); {2878#true} is VALID [2022-04-08 14:16:27,006 INFO L290 TraceCheckUtils]: 35: Hoare triple {2878#true} assume true; {2878#true} is VALID [2022-04-08 14:16:27,006 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-08 14:16:27,007 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-08 14:16:27,008 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-08 14:16:27,008 INFO L290 TraceCheckUtils]: 39: Hoare triple {3002#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {3006#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 14:16:27,008 INFO L290 TraceCheckUtils]: 40: Hoare triple {3006#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {2879#false} is VALID [2022-04-08 14:16:27,008 INFO L290 TraceCheckUtils]: 41: Hoare triple {2879#false} assume !false; {2879#false} is VALID [2022-04-08 14:16:27,009 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-08 14:16:27,009 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 14:16:27,323 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 14:16:27,323 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2082145352] [2022-04-08 14:16:27,323 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 14:16:27,323 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2116200353] [2022-04-08 14:16:27,323 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2116200353] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 14:16:27,324 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-08 14:16:27,324 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2022-04-08 14:16:27,324 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 14:16:27,324 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1090363180] [2022-04-08 14:16:27,324 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1090363180] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 14:16:27,324 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 14:16:27,324 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-04-08 14:16:27,324 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [891300908] [2022-04-08 14:16:27,324 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 14:16:27,325 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-08 14:16:27,325 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 14:16:27,325 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-08 14:16:27,348 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-08 14:16:27,348 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-04-08 14:16:27,348 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 14:16:27,348 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-04-08 14:16:27,348 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2022-04-08 14:16:27,348 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-08 14:16:27,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:16:27,690 INFO L93 Difference]: Finished difference Result 52 states and 54 transitions. [2022-04-08 14:16:27,690 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-08 14:16:27,690 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-08 14:16:27,691 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 14:16:27,691 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-08 14:16:27,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 44 transitions. [2022-04-08 14:16:27,692 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-08 14:16:27,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 44 transitions. [2022-04-08 14:16:27,693 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 9 states and 44 transitions. [2022-04-08 14:16:27,744 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 44 edges. 44 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 14:16:27,745 INFO L225 Difference]: With dead ends: 52 [2022-04-08 14:16:27,745 INFO L226 Difference]: Without dead ends: 47 [2022-04-08 14:16:27,745 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 44 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=142, Unknown=0, NotChecked=0, Total=182 [2022-04-08 14:16:27,746 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-08 14:16:27,746 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-08 14:16:27,746 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2022-04-08 14:16:27,798 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2022-04-08 14:16:27,799 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 14:16:27,799 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-08 14:16:27,799 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-08 14:16:27,799 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-08 14:16:27,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:16:27,801 INFO L93 Difference]: Finished difference Result 47 states and 49 transitions. [2022-04-08 14:16:27,802 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 49 transitions. [2022-04-08 14:16:27,802 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 14:16:27,802 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 14:16:27,802 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-08 14:16:27,802 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-08 14:16:27,803 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:16:27,803 INFO L93 Difference]: Finished difference Result 47 states and 49 transitions. [2022-04-08 14:16:27,804 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 49 transitions. [2022-04-08 14:16:27,804 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 14:16:27,804 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 14:16:27,804 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 14:16:27,804 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 14:16:27,804 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-08 14:16:27,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 49 transitions. [2022-04-08 14:16:27,805 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 49 transitions. Word has length 42 [2022-04-08 14:16:27,805 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 14:16:27,806 INFO L478 AbstractCegarLoop]: Abstraction has 47 states and 49 transitions. [2022-04-08 14:16:27,806 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-08 14:16:27,806 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 47 states and 49 transitions. [2022-04-08 14:16:27,872 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 49 edges. 49 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 14:16:27,872 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 49 transitions. [2022-04-08 14:16:27,873 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-04-08 14:16:27,873 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 14:16:27,873 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-08 14:16:27,899 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-04-08 14:16:28,073 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2022-04-08 14:16:28,073 INFO L403 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 14:16:28,074 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 14:16:28,074 INFO L85 PathProgramCache]: Analyzing trace with hash -1386691371, now seen corresponding path program 7 times [2022-04-08 14:16:28,074 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 14:16:28,074 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1980387644] [2022-04-08 14:16:28,170 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 14:16:28,170 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 14:16:28,170 INFO L85 PathProgramCache]: Analyzing trace with hash -1386691371, now seen corresponding path program 8 times [2022-04-08 14:16:28,171 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 14:16:28,171 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [637111716] [2022-04-08 14:16:28,171 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 14:16:28,171 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 14:16:28,180 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 14:16:28,181 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1042583500] [2022-04-08 14:16:28,181 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 14:16:28,181 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 14:16:28,181 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 14:16:28,189 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 14:16:28,201 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-04-08 14:16:28,242 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 14:16:28,242 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 14:16:28,243 INFO L263 TraceCheckSpWp]: Trace formula consists of 155 conjuncts, 13 conjunts are in the unsatisfiable core [2022-04-08 14:16:28,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 14:16:28,255 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 14:16:28,488 INFO L272 TraceCheckUtils]: 0: Hoare triple {3353#true} call ULTIMATE.init(); {3353#true} is VALID [2022-04-08 14:16:28,488 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-08 14:16:28,489 INFO L290 TraceCheckUtils]: 2: Hoare triple {3361#(<= ~counter~0 0)} assume true; {3361#(<= ~counter~0 0)} is VALID [2022-04-08 14:16:28,491 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3361#(<= ~counter~0 0)} {3353#true} #57#return; {3361#(<= ~counter~0 0)} is VALID [2022-04-08 14:16:28,492 INFO L272 TraceCheckUtils]: 4: Hoare triple {3361#(<= ~counter~0 0)} call #t~ret6 := main(); {3361#(<= ~counter~0 0)} is VALID [2022-04-08 14:16:28,492 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-08 14:16:28,493 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-08 14:16:28,493 INFO L290 TraceCheckUtils]: 7: Hoare triple {3377#(<= ~counter~0 1)} assume !!(#t~post5 < 100);havoc #t~post5; {3377#(<= ~counter~0 1)} is VALID [2022-04-08 14:16:28,494 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-08 14:16:28,494 INFO L290 TraceCheckUtils]: 9: Hoare triple {3377#(<= ~counter~0 1)} ~cond := #in~cond; {3377#(<= ~counter~0 1)} is VALID [2022-04-08 14:16:28,494 INFO L290 TraceCheckUtils]: 10: Hoare triple {3377#(<= ~counter~0 1)} assume !(0 == ~cond); {3377#(<= ~counter~0 1)} is VALID [2022-04-08 14:16:28,495 INFO L290 TraceCheckUtils]: 11: Hoare triple {3377#(<= ~counter~0 1)} assume true; {3377#(<= ~counter~0 1)} is VALID [2022-04-08 14:16:28,495 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {3377#(<= ~counter~0 1)} {3377#(<= ~counter~0 1)} #51#return; {3377#(<= ~counter~0 1)} is VALID [2022-04-08 14:16:28,496 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-08 14:16:28,496 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-08 14:16:28,497 INFO L290 TraceCheckUtils]: 15: Hoare triple {3402#(<= ~counter~0 2)} assume !!(#t~post5 < 100);havoc #t~post5; {3402#(<= ~counter~0 2)} is VALID [2022-04-08 14:16:28,497 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-08 14:16:28,498 INFO L290 TraceCheckUtils]: 17: Hoare triple {3402#(<= ~counter~0 2)} ~cond := #in~cond; {3402#(<= ~counter~0 2)} is VALID [2022-04-08 14:16:28,498 INFO L290 TraceCheckUtils]: 18: Hoare triple {3402#(<= ~counter~0 2)} assume !(0 == ~cond); {3402#(<= ~counter~0 2)} is VALID [2022-04-08 14:16:28,498 INFO L290 TraceCheckUtils]: 19: Hoare triple {3402#(<= ~counter~0 2)} assume true; {3402#(<= ~counter~0 2)} is VALID [2022-04-08 14:16:28,499 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {3402#(<= ~counter~0 2)} {3402#(<= ~counter~0 2)} #51#return; {3402#(<= ~counter~0 2)} is VALID [2022-04-08 14:16:28,499 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-08 14:16:28,500 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-08 14:16:28,500 INFO L290 TraceCheckUtils]: 23: Hoare triple {3427#(<= ~counter~0 3)} assume !!(#t~post5 < 100);havoc #t~post5; {3427#(<= ~counter~0 3)} is VALID [2022-04-08 14:16:28,501 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-08 14:16:28,501 INFO L290 TraceCheckUtils]: 25: Hoare triple {3427#(<= ~counter~0 3)} ~cond := #in~cond; {3427#(<= ~counter~0 3)} is VALID [2022-04-08 14:16:28,502 INFO L290 TraceCheckUtils]: 26: Hoare triple {3427#(<= ~counter~0 3)} assume !(0 == ~cond); {3427#(<= ~counter~0 3)} is VALID [2022-04-08 14:16:28,502 INFO L290 TraceCheckUtils]: 27: Hoare triple {3427#(<= ~counter~0 3)} assume true; {3427#(<= ~counter~0 3)} is VALID [2022-04-08 14:16:28,503 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {3427#(<= ~counter~0 3)} {3427#(<= ~counter~0 3)} #51#return; {3427#(<= ~counter~0 3)} is VALID [2022-04-08 14:16:28,506 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-08 14:16:28,506 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-08 14:16:28,512 INFO L290 TraceCheckUtils]: 31: Hoare triple {3452#(<= ~counter~0 4)} assume !!(#t~post5 < 100);havoc #t~post5; {3452#(<= ~counter~0 4)} is VALID [2022-04-08 14:16:28,513 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-08 14:16:28,513 INFO L290 TraceCheckUtils]: 33: Hoare triple {3452#(<= ~counter~0 4)} ~cond := #in~cond; {3452#(<= ~counter~0 4)} is VALID [2022-04-08 14:16:28,514 INFO L290 TraceCheckUtils]: 34: Hoare triple {3452#(<= ~counter~0 4)} assume !(0 == ~cond); {3452#(<= ~counter~0 4)} is VALID [2022-04-08 14:16:28,514 INFO L290 TraceCheckUtils]: 35: Hoare triple {3452#(<= ~counter~0 4)} assume true; {3452#(<= ~counter~0 4)} is VALID [2022-04-08 14:16:28,515 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {3452#(<= ~counter~0 4)} {3452#(<= ~counter~0 4)} #51#return; {3452#(<= ~counter~0 4)} is VALID [2022-04-08 14:16:28,515 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-08 14:16:28,515 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-08 14:16:28,516 INFO L290 TraceCheckUtils]: 39: Hoare triple {3477#(<= |main_#t~post5| 4)} assume !(#t~post5 < 100);havoc #t~post5; {3354#false} is VALID [2022-04-08 14:16:28,517 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-08 14:16:28,517 INFO L290 TraceCheckUtils]: 41: Hoare triple {3354#false} ~cond := #in~cond; {3354#false} is VALID [2022-04-08 14:16:28,517 INFO L290 TraceCheckUtils]: 42: Hoare triple {3354#false} assume 0 == ~cond; {3354#false} is VALID [2022-04-08 14:16:28,518 INFO L290 TraceCheckUtils]: 43: Hoare triple {3354#false} assume !false; {3354#false} is VALID [2022-04-08 14:16:28,518 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-08 14:16:28,518 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 14:16:28,799 INFO L290 TraceCheckUtils]: 43: Hoare triple {3354#false} assume !false; {3354#false} is VALID [2022-04-08 14:16:28,799 INFO L290 TraceCheckUtils]: 42: Hoare triple {3354#false} assume 0 == ~cond; {3354#false} is VALID [2022-04-08 14:16:28,799 INFO L290 TraceCheckUtils]: 41: Hoare triple {3354#false} ~cond := #in~cond; {3354#false} is VALID [2022-04-08 14:16:28,799 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-08 14:16:28,800 INFO L290 TraceCheckUtils]: 39: Hoare triple {3505#(< |main_#t~post5| 100)} assume !(#t~post5 < 100);havoc #t~post5; {3354#false} is VALID [2022-04-08 14:16:28,800 INFO L290 TraceCheckUtils]: 38: Hoare triple {3509#(< ~counter~0 100)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {3505#(< |main_#t~post5| 100)} is VALID [2022-04-08 14:16:28,800 INFO L290 TraceCheckUtils]: 37: Hoare triple {3509#(< ~counter~0 100)} 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 100)} is VALID [2022-04-08 14:16:28,801 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {3353#true} {3509#(< ~counter~0 100)} #51#return; {3509#(< ~counter~0 100)} is VALID [2022-04-08 14:16:28,805 INFO L290 TraceCheckUtils]: 35: Hoare triple {3353#true} assume true; {3353#true} is VALID [2022-04-08 14:16:28,805 INFO L290 TraceCheckUtils]: 34: Hoare triple {3353#true} assume !(0 == ~cond); {3353#true} is VALID [2022-04-08 14:16:28,805 INFO L290 TraceCheckUtils]: 33: Hoare triple {3353#true} ~cond := #in~cond; {3353#true} is VALID [2022-04-08 14:16:28,805 INFO L272 TraceCheckUtils]: 32: Hoare triple {3509#(< ~counter~0 100)} 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-08 14:16:28,805 INFO L290 TraceCheckUtils]: 31: Hoare triple {3509#(< ~counter~0 100)} assume !!(#t~post5 < 100);havoc #t~post5; {3509#(< ~counter~0 100)} is VALID [2022-04-08 14:16:28,806 INFO L290 TraceCheckUtils]: 30: Hoare triple {3534#(< ~counter~0 99)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {3509#(< ~counter~0 100)} is VALID [2022-04-08 14:16:28,807 INFO L290 TraceCheckUtils]: 29: Hoare triple {3534#(< ~counter~0 99)} 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 99)} is VALID [2022-04-08 14:16:28,807 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {3353#true} {3534#(< ~counter~0 99)} #51#return; {3534#(< ~counter~0 99)} is VALID [2022-04-08 14:16:28,807 INFO L290 TraceCheckUtils]: 27: Hoare triple {3353#true} assume true; {3353#true} is VALID [2022-04-08 14:16:28,807 INFO L290 TraceCheckUtils]: 26: Hoare triple {3353#true} assume !(0 == ~cond); {3353#true} is VALID [2022-04-08 14:16:28,807 INFO L290 TraceCheckUtils]: 25: Hoare triple {3353#true} ~cond := #in~cond; {3353#true} is VALID [2022-04-08 14:16:28,807 INFO L272 TraceCheckUtils]: 24: Hoare triple {3534#(< ~counter~0 99)} 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-08 14:16:28,808 INFO L290 TraceCheckUtils]: 23: Hoare triple {3534#(< ~counter~0 99)} assume !!(#t~post5 < 100);havoc #t~post5; {3534#(< ~counter~0 99)} is VALID [2022-04-08 14:16:28,808 INFO L290 TraceCheckUtils]: 22: Hoare triple {3559#(< ~counter~0 98)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {3534#(< ~counter~0 99)} is VALID [2022-04-08 14:16:28,809 INFO L290 TraceCheckUtils]: 21: Hoare triple {3559#(< ~counter~0 98)} 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 98)} is VALID [2022-04-08 14:16:28,809 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {3353#true} {3559#(< ~counter~0 98)} #51#return; {3559#(< ~counter~0 98)} is VALID [2022-04-08 14:16:28,809 INFO L290 TraceCheckUtils]: 19: Hoare triple {3353#true} assume true; {3353#true} is VALID [2022-04-08 14:16:28,809 INFO L290 TraceCheckUtils]: 18: Hoare triple {3353#true} assume !(0 == ~cond); {3353#true} is VALID [2022-04-08 14:16:28,810 INFO L290 TraceCheckUtils]: 17: Hoare triple {3353#true} ~cond := #in~cond; {3353#true} is VALID [2022-04-08 14:16:28,810 INFO L272 TraceCheckUtils]: 16: Hoare triple {3559#(< ~counter~0 98)} 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-08 14:16:28,810 INFO L290 TraceCheckUtils]: 15: Hoare triple {3559#(< ~counter~0 98)} assume !!(#t~post5 < 100);havoc #t~post5; {3559#(< ~counter~0 98)} is VALID [2022-04-08 14:16:28,811 INFO L290 TraceCheckUtils]: 14: Hoare triple {3584#(< ~counter~0 97)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {3559#(< ~counter~0 98)} is VALID [2022-04-08 14:16:28,811 INFO L290 TraceCheckUtils]: 13: Hoare triple {3584#(< ~counter~0 97)} 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 97)} is VALID [2022-04-08 14:16:28,812 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {3353#true} {3584#(< ~counter~0 97)} #51#return; {3584#(< ~counter~0 97)} is VALID [2022-04-08 14:16:28,812 INFO L290 TraceCheckUtils]: 11: Hoare triple {3353#true} assume true; {3353#true} is VALID [2022-04-08 14:16:28,812 INFO L290 TraceCheckUtils]: 10: Hoare triple {3353#true} assume !(0 == ~cond); {3353#true} is VALID [2022-04-08 14:16:28,812 INFO L290 TraceCheckUtils]: 9: Hoare triple {3353#true} ~cond := #in~cond; {3353#true} is VALID [2022-04-08 14:16:28,812 INFO L272 TraceCheckUtils]: 8: Hoare triple {3584#(< ~counter~0 97)} 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-08 14:16:28,812 INFO L290 TraceCheckUtils]: 7: Hoare triple {3584#(< ~counter~0 97)} assume !!(#t~post5 < 100);havoc #t~post5; {3584#(< ~counter~0 97)} is VALID [2022-04-08 14:16:28,813 INFO L290 TraceCheckUtils]: 6: Hoare triple {3609#(< ~counter~0 96)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {3584#(< ~counter~0 97)} is VALID [2022-04-08 14:16:28,813 INFO L290 TraceCheckUtils]: 5: Hoare triple {3609#(< ~counter~0 96)} 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 96)} is VALID [2022-04-08 14:16:28,814 INFO L272 TraceCheckUtils]: 4: Hoare triple {3609#(< ~counter~0 96)} call #t~ret6 := main(); {3609#(< ~counter~0 96)} is VALID [2022-04-08 14:16:28,814 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3609#(< ~counter~0 96)} {3353#true} #57#return; {3609#(< ~counter~0 96)} is VALID [2022-04-08 14:16:28,815 INFO L290 TraceCheckUtils]: 2: Hoare triple {3609#(< ~counter~0 96)} assume true; {3609#(< ~counter~0 96)} is VALID [2022-04-08 14:16:28,815 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 96)} is VALID [2022-04-08 14:16:28,815 INFO L272 TraceCheckUtils]: 0: Hoare triple {3353#true} call ULTIMATE.init(); {3353#true} is VALID [2022-04-08 14:16:28,816 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-08 14:16:28,816 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 14:16:28,817 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [637111716] [2022-04-08 14:16:28,817 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 14:16:28,817 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1042583500] [2022-04-08 14:16:28,817 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1042583500] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 14:16:28,817 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-08 14:16:28,817 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 14 [2022-04-08 14:16:28,817 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 14:16:28,817 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1980387644] [2022-04-08 14:16:28,818 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1980387644] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 14:16:28,818 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 14:16:28,818 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-08 14:16:28,818 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [260568006] [2022-04-08 14:16:28,818 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 14:16:28,819 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-08 14:16:28,819 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 14:16:28,819 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-08 14:16:28,859 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 44 edges. 44 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 14:16:28,859 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-08 14:16:28,859 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 14:16:28,859 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-08 14:16:28,860 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=111, Unknown=0, NotChecked=0, Total=182 [2022-04-08 14:16:28,860 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-08 14:16:29,040 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:16:29,040 INFO L93 Difference]: Finished difference Result 58 states and 59 transitions. [2022-04-08 14:16:29,040 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-04-08 14:16:29,040 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-08 14:16:29,040 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 14:16:29,040 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-08 14:16:29,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 58 transitions. [2022-04-08 14:16:29,042 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-08 14:16:29,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 58 transitions. [2022-04-08 14:16:29,043 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 12 states and 58 transitions. [2022-04-08 14:16:29,091 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-08 14:16:29,092 INFO L225 Difference]: With dead ends: 58 [2022-04-08 14:16:29,092 INFO L226 Difference]: Without dead ends: 53 [2022-04-08 14:16:29,092 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-08 14:16:29,093 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-08 14:16:29,093 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-08 14:16:29,093 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2022-04-08 14:16:29,146 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2022-04-08 14:16:29,146 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 14:16:29,146 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-08 14:16:29,146 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-08 14:16:29,146 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-08 14:16:29,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:16:29,148 INFO L93 Difference]: Finished difference Result 53 states and 54 transitions. [2022-04-08 14:16:29,148 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 54 transitions. [2022-04-08 14:16:29,148 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 14:16:29,148 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 14:16:29,148 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-08 14:16:29,148 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-08 14:16:29,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:16:29,149 INFO L93 Difference]: Finished difference Result 53 states and 54 transitions. [2022-04-08 14:16:29,150 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 54 transitions. [2022-04-08 14:16:29,150 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 14:16:29,150 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 14:16:29,150 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 14:16:29,150 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 14:16:29,150 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-08 14:16:29,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 54 transitions. [2022-04-08 14:16:29,151 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 54 transitions. Word has length 44 [2022-04-08 14:16:29,151 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 14:16:29,151 INFO L478 AbstractCegarLoop]: Abstraction has 53 states and 54 transitions. [2022-04-08 14:16:29,151 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-08 14:16:29,152 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 53 states and 54 transitions. [2022-04-08 14:16:29,212 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 54 edges. 54 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 14:16:29,212 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 54 transitions. [2022-04-08 14:16:29,212 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2022-04-08 14:16:29,212 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 14:16:29,212 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-08 14:16:29,228 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-08 14:16:29,415 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2022-04-08 14:16:29,415 INFO L403 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 14:16:29,416 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 14:16:29,416 INFO L85 PathProgramCache]: Analyzing trace with hash 1037185971, now seen corresponding path program 7 times [2022-04-08 14:16:29,416 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 14:16:29,416 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [693581403] [2022-04-08 14:16:29,530 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 14:16:29,530 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 14:16:29,530 INFO L85 PathProgramCache]: Analyzing trace with hash 1037185971, now seen corresponding path program 8 times [2022-04-08 14:16:29,530 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 14:16:29,531 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1177145824] [2022-04-08 14:16:29,531 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 14:16:29,531 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 14:16:29,543 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 14:16:29,543 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1542815072] [2022-04-08 14:16:29,543 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 14:16:29,543 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 14:16:29,543 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 14:16:29,547 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 14:16:29,549 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-04-08 14:16:29,651 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 14:16:29,651 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 14:16:29,652 INFO L263 TraceCheckSpWp]: Trace formula consists of 165 conjuncts, 24 conjunts are in the unsatisfiable core [2022-04-08 14:16:29,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 14:16:29,665 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 14:16:30,033 INFO L272 TraceCheckUtils]: 0: Hoare triple {3966#true} call ULTIMATE.init(); {3966#true} is VALID [2022-04-08 14:16:30,034 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-08 14:16:30,034 INFO L290 TraceCheckUtils]: 2: Hoare triple {3966#true} assume true; {3966#true} is VALID [2022-04-08 14:16:30,034 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3966#true} {3966#true} #57#return; {3966#true} is VALID [2022-04-08 14:16:30,034 INFO L272 TraceCheckUtils]: 4: Hoare triple {3966#true} call #t~ret6 := main(); {3966#true} is VALID [2022-04-08 14:16:30,034 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-08 14:16:30,035 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-08 14:16:30,035 INFO L290 TraceCheckUtils]: 7: Hoare triple {3986#(and (= main_~c~0 0) (= main_~y~0 0))} assume !!(#t~post5 < 100);havoc #t~post5; {3986#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-08 14:16:30,035 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-08 14:16:30,035 INFO L290 TraceCheckUtils]: 9: Hoare triple {3966#true} ~cond := #in~cond; {3966#true} is VALID [2022-04-08 14:16:30,035 INFO L290 TraceCheckUtils]: 10: Hoare triple {3966#true} assume !(0 == ~cond); {3966#true} is VALID [2022-04-08 14:16:30,036 INFO L290 TraceCheckUtils]: 11: Hoare triple {3966#true} assume true; {3966#true} is VALID [2022-04-08 14:16:30,036 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-08 14:16:30,037 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-08 14:16:30,037 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-08 14:16:30,037 INFO L290 TraceCheckUtils]: 15: Hoare triple {4011#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} assume !!(#t~post5 < 100);havoc #t~post5; {4011#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} is VALID [2022-04-08 14:16:30,037 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-08 14:16:30,038 INFO L290 TraceCheckUtils]: 17: Hoare triple {3966#true} ~cond := #in~cond; {3966#true} is VALID [2022-04-08 14:16:30,038 INFO L290 TraceCheckUtils]: 18: Hoare triple {3966#true} assume !(0 == ~cond); {3966#true} is VALID [2022-04-08 14:16:30,038 INFO L290 TraceCheckUtils]: 19: Hoare triple {3966#true} assume true; {3966#true} is VALID [2022-04-08 14:16:30,038 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-08 14:16:30,039 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-08 14:16:30,039 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-08 14:16:30,040 INFO L290 TraceCheckUtils]: 23: Hoare triple {4036#(and (= main_~y~0 2) (= (+ (- 1) main_~c~0) 1))} assume !!(#t~post5 < 100);havoc #t~post5; {4036#(and (= main_~y~0 2) (= (+ (- 1) main_~c~0) 1))} is VALID [2022-04-08 14:16:30,040 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-08 14:16:30,040 INFO L290 TraceCheckUtils]: 25: Hoare triple {3966#true} ~cond := #in~cond; {3966#true} is VALID [2022-04-08 14:16:30,040 INFO L290 TraceCheckUtils]: 26: Hoare triple {3966#true} assume !(0 == ~cond); {3966#true} is VALID [2022-04-08 14:16:30,040 INFO L290 TraceCheckUtils]: 27: Hoare triple {3966#true} assume true; {3966#true} is VALID [2022-04-08 14:16:30,041 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-08 14:16:30,041 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-08 14:16:30,042 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-08 14:16:30,042 INFO L290 TraceCheckUtils]: 31: Hoare triple {4061#(and (= 2 (+ (- 1) main_~y~0)) (= (+ (- 2) main_~c~0) 1))} assume !!(#t~post5 < 100);havoc #t~post5; {4061#(and (= 2 (+ (- 1) main_~y~0)) (= (+ (- 2) main_~c~0) 1))} is VALID [2022-04-08 14:16:30,042 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-08 14:16:30,042 INFO L290 TraceCheckUtils]: 33: Hoare triple {3966#true} ~cond := #in~cond; {3966#true} is VALID [2022-04-08 14:16:30,042 INFO L290 TraceCheckUtils]: 34: Hoare triple {3966#true} assume !(0 == ~cond); {3966#true} is VALID [2022-04-08 14:16:30,042 INFO L290 TraceCheckUtils]: 35: Hoare triple {3966#true} assume true; {3966#true} is VALID [2022-04-08 14:16:30,043 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-08 14:16:30,044 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-08 14:16:30,044 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-08 14:16:30,045 INFO L290 TraceCheckUtils]: 39: Hoare triple {4086#(and (< 3 main_~k~0) (= (+ (- 2) main_~y~0) 2) (<= main_~c~0 4))} assume !!(#t~post5 < 100);havoc #t~post5; {4086#(and (< 3 main_~k~0) (= (+ (- 2) main_~y~0) 2) (<= main_~c~0 4))} is VALID [2022-04-08 14:16:30,045 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-08 14:16:30,045 INFO L290 TraceCheckUtils]: 41: Hoare triple {3966#true} ~cond := #in~cond; {3966#true} is VALID [2022-04-08 14:16:30,045 INFO L290 TraceCheckUtils]: 42: Hoare triple {3966#true} assume !(0 == ~cond); {3966#true} is VALID [2022-04-08 14:16:30,045 INFO L290 TraceCheckUtils]: 43: Hoare triple {3966#true} assume true; {3966#true} is VALID [2022-04-08 14:16:30,046 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-08 14:16:30,047 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-08 14:16:30,056 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-08 14:16:30,056 INFO L290 TraceCheckUtils]: 47: Hoare triple {4115#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {4119#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 14:16:30,056 INFO L290 TraceCheckUtils]: 48: Hoare triple {4119#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {3967#false} is VALID [2022-04-08 14:16:30,056 INFO L290 TraceCheckUtils]: 49: Hoare triple {3967#false} assume !false; {3967#false} is VALID [2022-04-08 14:16:30,057 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-08 14:16:30,057 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 14:16:30,344 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 14:16:30,345 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1177145824] [2022-04-08 14:16:30,345 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 14:16:30,345 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1542815072] [2022-04-08 14:16:30,345 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1542815072] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 14:16:30,345 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-08 14:16:30,345 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2022-04-08 14:16:30,345 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 14:16:30,345 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [693581403] [2022-04-08 14:16:30,345 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [693581403] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 14:16:30,345 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 14:16:30,345 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-04-08 14:16:30,345 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2019228272] [2022-04-08 14:16:30,345 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 14:16:30,346 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-08 14:16:30,346 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 14:16:30,346 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-08 14:16:30,374 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 38 edges. 38 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 14:16:30,374 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-04-08 14:16:30,374 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 14:16:30,374 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-04-08 14:16:30,374 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2022-04-08 14:16:30,374 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-08 14:16:30,796 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:16:30,796 INFO L93 Difference]: Finished difference Result 60 states and 62 transitions. [2022-04-08 14:16:30,796 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-04-08 14:16:30,796 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-08 14:16:30,796 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 14:16:30,797 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-08 14:16:30,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 49 transitions. [2022-04-08 14:16:30,798 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-08 14:16:30,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 49 transitions. [2022-04-08 14:16:30,799 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 10 states and 49 transitions. [2022-04-08 14:16:30,839 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 49 edges. 49 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 14:16:30,841 INFO L225 Difference]: With dead ends: 60 [2022-04-08 14:16:30,841 INFO L226 Difference]: Without dead ends: 55 [2022-04-08 14:16:30,841 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-08 14:16:30,841 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-08 14:16:30,842 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-08 14:16:30,842 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2022-04-08 14:16:30,913 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2022-04-08 14:16:30,913 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 14:16:30,913 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-08 14:16:30,913 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-08 14:16:30,913 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-08 14:16:30,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:16:30,915 INFO L93 Difference]: Finished difference Result 55 states and 57 transitions. [2022-04-08 14:16:30,915 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 57 transitions. [2022-04-08 14:16:30,915 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 14:16:30,915 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 14:16:30,916 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-08 14:16:30,916 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-08 14:16:30,917 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:16:30,917 INFO L93 Difference]: Finished difference Result 55 states and 57 transitions. [2022-04-08 14:16:30,917 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 57 transitions. [2022-04-08 14:16:30,917 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 14:16:30,917 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 14:16:30,917 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 14:16:30,917 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 14:16:30,918 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-08 14:16:30,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 57 transitions. [2022-04-08 14:16:30,919 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 57 transitions. Word has length 50 [2022-04-08 14:16:30,919 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 14:16:30,919 INFO L478 AbstractCegarLoop]: Abstraction has 55 states and 57 transitions. [2022-04-08 14:16:30,919 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-08 14:16:30,919 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 55 states and 57 transitions. [2022-04-08 14:16:30,988 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-08 14:16:30,988 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 57 transitions. [2022-04-08 14:16:30,988 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2022-04-08 14:16:30,988 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 14:16:30,989 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-08 14:16:30,995 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2022-04-08 14:16:31,191 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2022-04-08 14:16:31,191 INFO L403 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 14:16:31,192 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 14:16:31,192 INFO L85 PathProgramCache]: Analyzing trace with hash 999934744, now seen corresponding path program 9 times [2022-04-08 14:16:31,192 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 14:16:31,192 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [188443116] [2022-04-08 14:16:31,292 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 14:16:31,293 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 14:16:31,293 INFO L85 PathProgramCache]: Analyzing trace with hash 999934744, now seen corresponding path program 10 times [2022-04-08 14:16:31,293 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 14:16:31,293 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1383478447] [2022-04-08 14:16:31,293 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 14:16:31,293 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 14:16:31,314 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 14:16:31,314 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [286871029] [2022-04-08 14:16:31,314 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-08 14:16:31,314 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 14:16:31,314 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 14:16:31,315 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 14:16:31,316 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2022-04-08 14:16:31,458 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-08 14:16:31,459 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 14:16:31,459 INFO L263 TraceCheckSpWp]: Trace formula consists of 176 conjuncts, 15 conjunts are in the unsatisfiable core [2022-04-08 14:16:31,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 14:16:31,474 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 14:16:31,748 INFO L272 TraceCheckUtils]: 0: Hoare triple {4514#true} call ULTIMATE.init(); {4514#true} is VALID [2022-04-08 14:16:31,749 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-08 14:16:31,749 INFO L290 TraceCheckUtils]: 2: Hoare triple {4522#(<= ~counter~0 0)} assume true; {4522#(<= ~counter~0 0)} is VALID [2022-04-08 14:16:31,750 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4522#(<= ~counter~0 0)} {4514#true} #57#return; {4522#(<= ~counter~0 0)} is VALID [2022-04-08 14:16:31,750 INFO L272 TraceCheckUtils]: 4: Hoare triple {4522#(<= ~counter~0 0)} call #t~ret6 := main(); {4522#(<= ~counter~0 0)} is VALID [2022-04-08 14:16:31,750 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-08 14:16:31,751 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-08 14:16:31,751 INFO L290 TraceCheckUtils]: 7: Hoare triple {4538#(<= ~counter~0 1)} assume !!(#t~post5 < 100);havoc #t~post5; {4538#(<= ~counter~0 1)} is VALID [2022-04-08 14:16:31,752 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-08 14:16:31,752 INFO L290 TraceCheckUtils]: 9: Hoare triple {4538#(<= ~counter~0 1)} ~cond := #in~cond; {4538#(<= ~counter~0 1)} is VALID [2022-04-08 14:16:31,752 INFO L290 TraceCheckUtils]: 10: Hoare triple {4538#(<= ~counter~0 1)} assume !(0 == ~cond); {4538#(<= ~counter~0 1)} is VALID [2022-04-08 14:16:31,753 INFO L290 TraceCheckUtils]: 11: Hoare triple {4538#(<= ~counter~0 1)} assume true; {4538#(<= ~counter~0 1)} is VALID [2022-04-08 14:16:31,753 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {4538#(<= ~counter~0 1)} {4538#(<= ~counter~0 1)} #51#return; {4538#(<= ~counter~0 1)} is VALID [2022-04-08 14:16:31,753 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-08 14:16:31,754 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-08 14:16:31,754 INFO L290 TraceCheckUtils]: 15: Hoare triple {4563#(<= ~counter~0 2)} assume !!(#t~post5 < 100);havoc #t~post5; {4563#(<= ~counter~0 2)} is VALID [2022-04-08 14:16:31,754 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-08 14:16:31,755 INFO L290 TraceCheckUtils]: 17: Hoare triple {4563#(<= ~counter~0 2)} ~cond := #in~cond; {4563#(<= ~counter~0 2)} is VALID [2022-04-08 14:16:31,755 INFO L290 TraceCheckUtils]: 18: Hoare triple {4563#(<= ~counter~0 2)} assume !(0 == ~cond); {4563#(<= ~counter~0 2)} is VALID [2022-04-08 14:16:31,757 INFO L290 TraceCheckUtils]: 19: Hoare triple {4563#(<= ~counter~0 2)} assume true; {4563#(<= ~counter~0 2)} is VALID [2022-04-08 14:16:31,757 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {4563#(<= ~counter~0 2)} {4563#(<= ~counter~0 2)} #51#return; {4563#(<= ~counter~0 2)} is VALID [2022-04-08 14:16:31,759 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-08 14:16:31,760 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-08 14:16:31,760 INFO L290 TraceCheckUtils]: 23: Hoare triple {4588#(<= ~counter~0 3)} assume !!(#t~post5 < 100);havoc #t~post5; {4588#(<= ~counter~0 3)} is VALID [2022-04-08 14:16:31,780 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-08 14:16:31,780 INFO L290 TraceCheckUtils]: 25: Hoare triple {4588#(<= ~counter~0 3)} ~cond := #in~cond; {4588#(<= ~counter~0 3)} is VALID [2022-04-08 14:16:31,781 INFO L290 TraceCheckUtils]: 26: Hoare triple {4588#(<= ~counter~0 3)} assume !(0 == ~cond); {4588#(<= ~counter~0 3)} is VALID [2022-04-08 14:16:31,781 INFO L290 TraceCheckUtils]: 27: Hoare triple {4588#(<= ~counter~0 3)} assume true; {4588#(<= ~counter~0 3)} is VALID [2022-04-08 14:16:31,781 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {4588#(<= ~counter~0 3)} {4588#(<= ~counter~0 3)} #51#return; {4588#(<= ~counter~0 3)} is VALID [2022-04-08 14:16:31,781 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-08 14:16:31,782 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-08 14:16:31,782 INFO L290 TraceCheckUtils]: 31: Hoare triple {4613#(<= ~counter~0 4)} assume !!(#t~post5 < 100);havoc #t~post5; {4613#(<= ~counter~0 4)} is VALID [2022-04-08 14:16:31,783 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-08 14:16:31,783 INFO L290 TraceCheckUtils]: 33: Hoare triple {4613#(<= ~counter~0 4)} ~cond := #in~cond; {4613#(<= ~counter~0 4)} is VALID [2022-04-08 14:16:31,783 INFO L290 TraceCheckUtils]: 34: Hoare triple {4613#(<= ~counter~0 4)} assume !(0 == ~cond); {4613#(<= ~counter~0 4)} is VALID [2022-04-08 14:16:31,784 INFO L290 TraceCheckUtils]: 35: Hoare triple {4613#(<= ~counter~0 4)} assume true; {4613#(<= ~counter~0 4)} is VALID [2022-04-08 14:16:31,784 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {4613#(<= ~counter~0 4)} {4613#(<= ~counter~0 4)} #51#return; {4613#(<= ~counter~0 4)} is VALID [2022-04-08 14:16:31,784 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-08 14:16:31,785 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-08 14:16:31,785 INFO L290 TraceCheckUtils]: 39: Hoare triple {4638#(<= ~counter~0 5)} assume !!(#t~post5 < 100);havoc #t~post5; {4638#(<= ~counter~0 5)} is VALID [2022-04-08 14:16:31,785 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-08 14:16:31,786 INFO L290 TraceCheckUtils]: 41: Hoare triple {4638#(<= ~counter~0 5)} ~cond := #in~cond; {4638#(<= ~counter~0 5)} is VALID [2022-04-08 14:16:31,786 INFO L290 TraceCheckUtils]: 42: Hoare triple {4638#(<= ~counter~0 5)} assume !(0 == ~cond); {4638#(<= ~counter~0 5)} is VALID [2022-04-08 14:16:31,786 INFO L290 TraceCheckUtils]: 43: Hoare triple {4638#(<= ~counter~0 5)} assume true; {4638#(<= ~counter~0 5)} is VALID [2022-04-08 14:16:31,787 INFO L284 TraceCheckUtils]: 44: Hoare quadruple {4638#(<= ~counter~0 5)} {4638#(<= ~counter~0 5)} #51#return; {4638#(<= ~counter~0 5)} is VALID [2022-04-08 14:16:31,787 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-08 14:16:31,787 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-08 14:16:31,788 INFO L290 TraceCheckUtils]: 47: Hoare triple {4663#(<= |main_#t~post5| 5)} assume !(#t~post5 < 100);havoc #t~post5; {4515#false} is VALID [2022-04-08 14:16:31,788 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-08 14:16:31,788 INFO L290 TraceCheckUtils]: 49: Hoare triple {4515#false} ~cond := #in~cond; {4515#false} is VALID [2022-04-08 14:16:31,788 INFO L290 TraceCheckUtils]: 50: Hoare triple {4515#false} assume 0 == ~cond; {4515#false} is VALID [2022-04-08 14:16:31,788 INFO L290 TraceCheckUtils]: 51: Hoare triple {4515#false} assume !false; {4515#false} is VALID [2022-04-08 14:16:31,788 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-08 14:16:31,788 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 14:16:32,088 INFO L290 TraceCheckUtils]: 51: Hoare triple {4515#false} assume !false; {4515#false} is VALID [2022-04-08 14:16:32,088 INFO L290 TraceCheckUtils]: 50: Hoare triple {4515#false} assume 0 == ~cond; {4515#false} is VALID [2022-04-08 14:16:32,088 INFO L290 TraceCheckUtils]: 49: Hoare triple {4515#false} ~cond := #in~cond; {4515#false} is VALID [2022-04-08 14:16:32,088 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-08 14:16:32,088 INFO L290 TraceCheckUtils]: 47: Hoare triple {4691#(< |main_#t~post5| 100)} assume !(#t~post5 < 100);havoc #t~post5; {4515#false} is VALID [2022-04-08 14:16:32,089 INFO L290 TraceCheckUtils]: 46: Hoare triple {4695#(< ~counter~0 100)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {4691#(< |main_#t~post5| 100)} is VALID [2022-04-08 14:16:32,089 INFO L290 TraceCheckUtils]: 45: Hoare triple {4695#(< ~counter~0 100)} 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 100)} is VALID [2022-04-08 14:16:32,089 INFO L284 TraceCheckUtils]: 44: Hoare quadruple {4514#true} {4695#(< ~counter~0 100)} #51#return; {4695#(< ~counter~0 100)} is VALID [2022-04-08 14:16:32,089 INFO L290 TraceCheckUtils]: 43: Hoare triple {4514#true} assume true; {4514#true} is VALID [2022-04-08 14:16:32,089 INFO L290 TraceCheckUtils]: 42: Hoare triple {4514#true} assume !(0 == ~cond); {4514#true} is VALID [2022-04-08 14:16:32,090 INFO L290 TraceCheckUtils]: 41: Hoare triple {4514#true} ~cond := #in~cond; {4514#true} is VALID [2022-04-08 14:16:32,090 INFO L272 TraceCheckUtils]: 40: Hoare triple {4695#(< ~counter~0 100)} 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-08 14:16:32,090 INFO L290 TraceCheckUtils]: 39: Hoare triple {4695#(< ~counter~0 100)} assume !!(#t~post5 < 100);havoc #t~post5; {4695#(< ~counter~0 100)} is VALID [2022-04-08 14:16:32,090 INFO L290 TraceCheckUtils]: 38: Hoare triple {4720#(< ~counter~0 99)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {4695#(< ~counter~0 100)} is VALID [2022-04-08 14:16:32,091 INFO L290 TraceCheckUtils]: 37: Hoare triple {4720#(< ~counter~0 99)} 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 99)} is VALID [2022-04-08 14:16:32,091 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {4514#true} {4720#(< ~counter~0 99)} #51#return; {4720#(< ~counter~0 99)} is VALID [2022-04-08 14:16:32,091 INFO L290 TraceCheckUtils]: 35: Hoare triple {4514#true} assume true; {4514#true} is VALID [2022-04-08 14:16:32,091 INFO L290 TraceCheckUtils]: 34: Hoare triple {4514#true} assume !(0 == ~cond); {4514#true} is VALID [2022-04-08 14:16:32,091 INFO L290 TraceCheckUtils]: 33: Hoare triple {4514#true} ~cond := #in~cond; {4514#true} is VALID [2022-04-08 14:16:32,091 INFO L272 TraceCheckUtils]: 32: Hoare triple {4720#(< ~counter~0 99)} 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-08 14:16:32,092 INFO L290 TraceCheckUtils]: 31: Hoare triple {4720#(< ~counter~0 99)} assume !!(#t~post5 < 100);havoc #t~post5; {4720#(< ~counter~0 99)} is VALID [2022-04-08 14:16:32,092 INFO L290 TraceCheckUtils]: 30: Hoare triple {4745#(< ~counter~0 98)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {4720#(< ~counter~0 99)} is VALID [2022-04-08 14:16:32,092 INFO L290 TraceCheckUtils]: 29: Hoare triple {4745#(< ~counter~0 98)} 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 98)} is VALID [2022-04-08 14:16:32,093 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {4514#true} {4745#(< ~counter~0 98)} #51#return; {4745#(< ~counter~0 98)} is VALID [2022-04-08 14:16:32,093 INFO L290 TraceCheckUtils]: 27: Hoare triple {4514#true} assume true; {4514#true} is VALID [2022-04-08 14:16:32,093 INFO L290 TraceCheckUtils]: 26: Hoare triple {4514#true} assume !(0 == ~cond); {4514#true} is VALID [2022-04-08 14:16:32,093 INFO L290 TraceCheckUtils]: 25: Hoare triple {4514#true} ~cond := #in~cond; {4514#true} is VALID [2022-04-08 14:16:32,093 INFO L272 TraceCheckUtils]: 24: Hoare triple {4745#(< ~counter~0 98)} 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-08 14:16:32,093 INFO L290 TraceCheckUtils]: 23: Hoare triple {4745#(< ~counter~0 98)} assume !!(#t~post5 < 100);havoc #t~post5; {4745#(< ~counter~0 98)} is VALID [2022-04-08 14:16:32,094 INFO L290 TraceCheckUtils]: 22: Hoare triple {4770#(< ~counter~0 97)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {4745#(< ~counter~0 98)} is VALID [2022-04-08 14:16:32,094 INFO L290 TraceCheckUtils]: 21: Hoare triple {4770#(< ~counter~0 97)} 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 97)} is VALID [2022-04-08 14:16:32,094 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {4514#true} {4770#(< ~counter~0 97)} #51#return; {4770#(< ~counter~0 97)} is VALID [2022-04-08 14:16:32,094 INFO L290 TraceCheckUtils]: 19: Hoare triple {4514#true} assume true; {4514#true} is VALID [2022-04-08 14:16:32,095 INFO L290 TraceCheckUtils]: 18: Hoare triple {4514#true} assume !(0 == ~cond); {4514#true} is VALID [2022-04-08 14:16:32,095 INFO L290 TraceCheckUtils]: 17: Hoare triple {4514#true} ~cond := #in~cond; {4514#true} is VALID [2022-04-08 14:16:32,095 INFO L272 TraceCheckUtils]: 16: Hoare triple {4770#(< ~counter~0 97)} 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-08 14:16:32,095 INFO L290 TraceCheckUtils]: 15: Hoare triple {4770#(< ~counter~0 97)} assume !!(#t~post5 < 100);havoc #t~post5; {4770#(< ~counter~0 97)} is VALID [2022-04-08 14:16:32,095 INFO L290 TraceCheckUtils]: 14: Hoare triple {4795#(< ~counter~0 96)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {4770#(< ~counter~0 97)} is VALID [2022-04-08 14:16:32,096 INFO L290 TraceCheckUtils]: 13: Hoare triple {4795#(< ~counter~0 96)} 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 96)} is VALID [2022-04-08 14:16:32,096 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {4514#true} {4795#(< ~counter~0 96)} #51#return; {4795#(< ~counter~0 96)} is VALID [2022-04-08 14:16:32,096 INFO L290 TraceCheckUtils]: 11: Hoare triple {4514#true} assume true; {4514#true} is VALID [2022-04-08 14:16:32,096 INFO L290 TraceCheckUtils]: 10: Hoare triple {4514#true} assume !(0 == ~cond); {4514#true} is VALID [2022-04-08 14:16:32,096 INFO L290 TraceCheckUtils]: 9: Hoare triple {4514#true} ~cond := #in~cond; {4514#true} is VALID [2022-04-08 14:16:32,096 INFO L272 TraceCheckUtils]: 8: Hoare triple {4795#(< ~counter~0 96)} 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-08 14:16:32,097 INFO L290 TraceCheckUtils]: 7: Hoare triple {4795#(< ~counter~0 96)} assume !!(#t~post5 < 100);havoc #t~post5; {4795#(< ~counter~0 96)} is VALID [2022-04-08 14:16:32,097 INFO L290 TraceCheckUtils]: 6: Hoare triple {4820#(< ~counter~0 95)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {4795#(< ~counter~0 96)} is VALID [2022-04-08 14:16:32,097 INFO L290 TraceCheckUtils]: 5: Hoare triple {4820#(< ~counter~0 95)} 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 95)} is VALID [2022-04-08 14:16:32,098 INFO L272 TraceCheckUtils]: 4: Hoare triple {4820#(< ~counter~0 95)} call #t~ret6 := main(); {4820#(< ~counter~0 95)} is VALID [2022-04-08 14:16:32,098 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4820#(< ~counter~0 95)} {4514#true} #57#return; {4820#(< ~counter~0 95)} is VALID [2022-04-08 14:16:32,098 INFO L290 TraceCheckUtils]: 2: Hoare triple {4820#(< ~counter~0 95)} assume true; {4820#(< ~counter~0 95)} is VALID [2022-04-08 14:16:32,099 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 95)} is VALID [2022-04-08 14:16:32,099 INFO L272 TraceCheckUtils]: 0: Hoare triple {4514#true} call ULTIMATE.init(); {4514#true} is VALID [2022-04-08 14:16:32,099 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-08 14:16:32,099 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 14:16:32,099 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1383478447] [2022-04-08 14:16:32,099 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 14:16:32,099 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [286871029] [2022-04-08 14:16:32,099 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [286871029] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 14:16:32,099 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-08 14:16:32,099 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 16 [2022-04-08 14:16:32,100 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 14:16:32,100 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [188443116] [2022-04-08 14:16:32,100 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [188443116] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 14:16:32,100 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 14:16:32,100 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-04-08 14:16:32,100 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1204654312] [2022-04-08 14:16:32,100 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 14:16:32,100 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-08 14:16:32,101 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 14:16:32,101 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-08 14:16:32,141 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-08 14:16:32,141 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-04-08 14:16:32,141 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 14:16:32,141 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-04-08 14:16:32,141 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=96, Invalid=144, Unknown=0, NotChecked=0, Total=240 [2022-04-08 14:16:32,142 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-08 14:16:32,371 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:16:32,371 INFO L93 Difference]: Finished difference Result 66 states and 67 transitions. [2022-04-08 14:16:32,371 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-04-08 14:16:32,372 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-08 14:16:32,372 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 14:16:32,372 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-08 14:16:32,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 66 transitions. [2022-04-08 14:16:32,373 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-08 14:16:32,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 66 transitions. [2022-04-08 14:16:32,375 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 14 states and 66 transitions. [2022-04-08 14:16:32,431 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 66 edges. 66 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 14:16:32,432 INFO L225 Difference]: With dead ends: 66 [2022-04-08 14:16:32,432 INFO L226 Difference]: Without dead ends: 61 [2022-04-08 14:16:32,433 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-08 14:16:32,433 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-08 14:16:32,434 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-08 14:16:32,434 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2022-04-08 14:16:32,507 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2022-04-08 14:16:32,507 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 14:16:32,508 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-08 14:16:32,508 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-08 14:16:32,508 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-08 14:16:32,509 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:16:32,510 INFO L93 Difference]: Finished difference Result 61 states and 62 transitions. [2022-04-08 14:16:32,510 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 62 transitions. [2022-04-08 14:16:32,510 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 14:16:32,510 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 14:16:32,510 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-08 14:16:32,510 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-08 14:16:32,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:16:32,511 INFO L93 Difference]: Finished difference Result 61 states and 62 transitions. [2022-04-08 14:16:32,511 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 62 transitions. [2022-04-08 14:16:32,512 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 14:16:32,512 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 14:16:32,512 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 14:16:32,512 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 14:16:32,512 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-08 14:16:32,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 62 transitions. [2022-04-08 14:16:32,513 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 62 transitions. Word has length 52 [2022-04-08 14:16:32,513 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 14:16:32,513 INFO L478 AbstractCegarLoop]: Abstraction has 61 states and 62 transitions. [2022-04-08 14:16:32,513 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-08 14:16:32,513 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 61 states and 62 transitions. [2022-04-08 14:16:32,597 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 62 edges. 62 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 14:16:32,597 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 62 transitions. [2022-04-08 14:16:32,598 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2022-04-08 14:16:32,598 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 14:16:32,598 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-08 14:16:32,607 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2022-04-08 14:16:32,798 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2022-04-08 14:16:32,799 INFO L403 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 14:16:32,799 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 14:16:32,799 INFO L85 PathProgramCache]: Analyzing trace with hash -1795671114, now seen corresponding path program 9 times [2022-04-08 14:16:32,799 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 14:16:32,799 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [247807584] [2022-04-08 14:16:32,888 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 14:16:32,889 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 14:16:32,889 INFO L85 PathProgramCache]: Analyzing trace with hash -1795671114, now seen corresponding path program 10 times [2022-04-08 14:16:32,889 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 14:16:32,889 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2080370271] [2022-04-08 14:16:32,889 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 14:16:32,889 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 14:16:32,898 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 14:16:32,898 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1605227229] [2022-04-08 14:16:32,898 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-08 14:16:32,898 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 14:16:32,898 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 14:16:32,899 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 14:16:32,900 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2022-04-08 14:16:33,185 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-08 14:16:33,185 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 14:16:33,186 INFO L263 TraceCheckSpWp]: Trace formula consists of 186 conjuncts, 28 conjunts are in the unsatisfiable core [2022-04-08 14:16:33,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 14:16:33,197 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 14:16:33,558 INFO L272 TraceCheckUtils]: 0: Hoare triple {5227#true} call ULTIMATE.init(); {5227#true} is VALID [2022-04-08 14:16:33,559 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-08 14:16:33,559 INFO L290 TraceCheckUtils]: 2: Hoare triple {5227#true} assume true; {5227#true} is VALID [2022-04-08 14:16:33,559 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5227#true} {5227#true} #57#return; {5227#true} is VALID [2022-04-08 14:16:33,559 INFO L272 TraceCheckUtils]: 4: Hoare triple {5227#true} call #t~ret6 := main(); {5227#true} is VALID [2022-04-08 14:16:33,559 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-08 14:16:33,560 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-08 14:16:33,560 INFO L290 TraceCheckUtils]: 7: Hoare triple {5247#(and (= main_~c~0 0) (= main_~y~0 0))} assume !!(#t~post5 < 100);havoc #t~post5; {5247#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-08 14:16:33,560 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-08 14:16:33,560 INFO L290 TraceCheckUtils]: 9: Hoare triple {5227#true} ~cond := #in~cond; {5227#true} is VALID [2022-04-08 14:16:33,560 INFO L290 TraceCheckUtils]: 10: Hoare triple {5227#true} assume !(0 == ~cond); {5227#true} is VALID [2022-04-08 14:16:33,560 INFO L290 TraceCheckUtils]: 11: Hoare triple {5227#true} assume true; {5227#true} is VALID [2022-04-08 14:16:33,561 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-08 14:16:33,561 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-08 14:16:33,561 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-08 14:16:33,562 INFO L290 TraceCheckUtils]: 15: Hoare triple {5272#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} assume !!(#t~post5 < 100);havoc #t~post5; {5272#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} is VALID [2022-04-08 14:16:33,562 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-08 14:16:33,562 INFO L290 TraceCheckUtils]: 17: Hoare triple {5227#true} ~cond := #in~cond; {5227#true} is VALID [2022-04-08 14:16:33,562 INFO L290 TraceCheckUtils]: 18: Hoare triple {5227#true} assume !(0 == ~cond); {5227#true} is VALID [2022-04-08 14:16:33,562 INFO L290 TraceCheckUtils]: 19: Hoare triple {5227#true} assume true; {5227#true} is VALID [2022-04-08 14:16:33,562 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-08 14:16:33,563 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-08 14:16:33,563 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-08 14:16:33,563 INFO L290 TraceCheckUtils]: 23: Hoare triple {5297#(and (= main_~y~0 2) (= 0 (+ (- 2) main_~c~0)))} assume !!(#t~post5 < 100);havoc #t~post5; {5297#(and (= main_~y~0 2) (= 0 (+ (- 2) main_~c~0)))} is VALID [2022-04-08 14:16:33,564 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-08 14:16:33,564 INFO L290 TraceCheckUtils]: 25: Hoare triple {5227#true} ~cond := #in~cond; {5227#true} is VALID [2022-04-08 14:16:33,564 INFO L290 TraceCheckUtils]: 26: Hoare triple {5227#true} assume !(0 == ~cond); {5227#true} is VALID [2022-04-08 14:16:33,564 INFO L290 TraceCheckUtils]: 27: Hoare triple {5227#true} assume true; {5227#true} is VALID [2022-04-08 14:16:33,564 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-08 14:16:33,565 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-08 14:16:33,565 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-08 14:16:33,565 INFO L290 TraceCheckUtils]: 31: Hoare triple {5322#(and (= (+ main_~c~0 (- 3)) 0) (= main_~y~0 3))} assume !!(#t~post5 < 100);havoc #t~post5; {5322#(and (= (+ main_~c~0 (- 3)) 0) (= main_~y~0 3))} is VALID [2022-04-08 14:16:33,565 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-08 14:16:33,565 INFO L290 TraceCheckUtils]: 33: Hoare triple {5227#true} ~cond := #in~cond; {5227#true} is VALID [2022-04-08 14:16:33,565 INFO L290 TraceCheckUtils]: 34: Hoare triple {5227#true} assume !(0 == ~cond); {5227#true} is VALID [2022-04-08 14:16:33,565 INFO L290 TraceCheckUtils]: 35: Hoare triple {5227#true} assume true; {5227#true} is VALID [2022-04-08 14:16:33,566 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-08 14:16:33,566 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-08 14:16:33,567 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-08 14:16:33,567 INFO L290 TraceCheckUtils]: 39: Hoare triple {5347#(and (= main_~y~0 4) (= (+ main_~c~0 (- 4)) 0))} assume !!(#t~post5 < 100);havoc #t~post5; {5347#(and (= main_~y~0 4) (= (+ main_~c~0 (- 4)) 0))} is VALID [2022-04-08 14:16:33,567 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-08 14:16:33,567 INFO L290 TraceCheckUtils]: 41: Hoare triple {5227#true} ~cond := #in~cond; {5227#true} is VALID [2022-04-08 14:16:33,567 INFO L290 TraceCheckUtils]: 42: Hoare triple {5227#true} assume !(0 == ~cond); {5227#true} is VALID [2022-04-08 14:16:33,567 INFO L290 TraceCheckUtils]: 43: Hoare triple {5227#true} assume true; {5227#true} is VALID [2022-04-08 14:16:33,568 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-08 14:16:33,568 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-08 14:16:33,569 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-08 14:16:33,569 INFO L290 TraceCheckUtils]: 47: Hoare triple {5372#(and (<= main_~c~0 5) (= (+ (- 1) main_~y~0) 4) (< 4 main_~k~0))} assume !!(#t~post5 < 100);havoc #t~post5; {5372#(and (<= main_~c~0 5) (= (+ (- 1) main_~y~0) 4) (< 4 main_~k~0))} is VALID [2022-04-08 14:16:33,569 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-08 14:16:33,569 INFO L290 TraceCheckUtils]: 49: Hoare triple {5227#true} ~cond := #in~cond; {5227#true} is VALID [2022-04-08 14:16:33,569 INFO L290 TraceCheckUtils]: 50: Hoare triple {5227#true} assume !(0 == ~cond); {5227#true} is VALID [2022-04-08 14:16:33,569 INFO L290 TraceCheckUtils]: 51: Hoare triple {5227#true} assume true; {5227#true} is VALID [2022-04-08 14:16:33,570 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-08 14:16:33,570 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-08 14:16:33,571 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-08 14:16:33,572 INFO L290 TraceCheckUtils]: 55: Hoare triple {5401#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {5405#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 14:16:33,572 INFO L290 TraceCheckUtils]: 56: Hoare triple {5405#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {5228#false} is VALID [2022-04-08 14:16:33,572 INFO L290 TraceCheckUtils]: 57: Hoare triple {5228#false} assume !false; {5228#false} is VALID [2022-04-08 14:16:33,572 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-08 14:16:33,572 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 14:16:33,843 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 14:16:33,843 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2080370271] [2022-04-08 14:16:33,843 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 14:16:33,844 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1605227229] [2022-04-08 14:16:33,844 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1605227229] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 14:16:33,844 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-08 14:16:33,844 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2022-04-08 14:16:33,844 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 14:16:33,844 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [247807584] [2022-04-08 14:16:33,844 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [247807584] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 14:16:33,844 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 14:16:33,844 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-04-08 14:16:33,844 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1458710744] [2022-04-08 14:16:33,844 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 14:16:33,845 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-08 14:16:33,845 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 14:16:33,845 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-08 14:16:33,880 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-08 14:16:33,880 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-04-08 14:16:33,880 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 14:16:33,881 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-04-08 14:16:33,881 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=146, Unknown=0, NotChecked=0, Total=182 [2022-04-08 14:16:33,881 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-08 14:16:34,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:16:34,412 INFO L93 Difference]: Finished difference Result 68 states and 70 transitions. [2022-04-08 14:16:34,412 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-04-08 14:16:34,412 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-08 14:16:34,412 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 14:16:34,413 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-08 14:16:34,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 54 transitions. [2022-04-08 14:16:34,414 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-08 14:16:34,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 54 transitions. [2022-04-08 14:16:34,415 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 11 states and 54 transitions. [2022-04-08 14:16:34,460 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 54 edges. 54 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 14:16:34,461 INFO L225 Difference]: With dead ends: 68 [2022-04-08 14:16:34,461 INFO L226 Difference]: Without dead ends: 63 [2022-04-08 14:16:34,462 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 58 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=194, Unknown=0, NotChecked=0, Total=240 [2022-04-08 14:16:34,462 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-08 14:16:34,462 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-08 14:16:34,463 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2022-04-08 14:16:34,556 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2022-04-08 14:16:34,557 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 14:16:34,557 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-08 14:16:34,557 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-08 14:16:34,557 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-08 14:16:34,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:16:34,558 INFO L93 Difference]: Finished difference Result 63 states and 65 transitions. [2022-04-08 14:16:34,558 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 65 transitions. [2022-04-08 14:16:34,559 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 14:16:34,559 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 14:16:34,559 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-08 14:16:34,559 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-08 14:16:34,560 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:16:34,560 INFO L93 Difference]: Finished difference Result 63 states and 65 transitions. [2022-04-08 14:16:34,560 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 65 transitions. [2022-04-08 14:16:34,561 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 14:16:34,561 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 14:16:34,561 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 14:16:34,561 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 14:16:34,561 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-08 14:16:34,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 65 transitions. [2022-04-08 14:16:34,562 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 65 transitions. Word has length 58 [2022-04-08 14:16:34,562 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 14:16:34,563 INFO L478 AbstractCegarLoop]: Abstraction has 63 states and 65 transitions. [2022-04-08 14:16:34,563 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-08 14:16:34,563 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 63 states and 65 transitions. [2022-04-08 14:16:34,652 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 65 edges. 65 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 14:16:34,652 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 65 transitions. [2022-04-08 14:16:34,653 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2022-04-08 14:16:34,653 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 14:16:34,653 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-08 14:16:34,659 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2022-04-08 14:16:34,853 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2022-04-08 14:16:34,853 INFO L403 AbstractCegarLoop]: === Iteration 15 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 14:16:34,853 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 14:16:34,854 INFO L85 PathProgramCache]: Analyzing trace with hash 1633541723, now seen corresponding path program 11 times [2022-04-08 14:16:34,854 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 14:16:34,854 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2079407585] [2022-04-08 14:16:34,948 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 14:16:34,948 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 14:16:34,948 INFO L85 PathProgramCache]: Analyzing trace with hash 1633541723, now seen corresponding path program 12 times [2022-04-08 14:16:34,948 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 14:16:34,948 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1226323392] [2022-04-08 14:16:34,948 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 14:16:34,948 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 14:16:34,959 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 14:16:34,960 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [286612210] [2022-04-08 14:16:34,960 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-08 14:16:34,960 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 14:16:34,960 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 14:16:34,961 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 14:16:34,962 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2022-04-08 14:16:35,050 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2022-04-08 14:16:35,050 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 14:16:35,051 INFO L263 TraceCheckSpWp]: Trace formula consists of 197 conjuncts, 17 conjunts are in the unsatisfiable core [2022-04-08 14:16:35,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 14:16:35,065 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 14:16:35,360 INFO L272 TraceCheckUtils]: 0: Hoare triple {5848#true} call ULTIMATE.init(); {5848#true} is VALID [2022-04-08 14:16:35,361 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-08 14:16:35,361 INFO L290 TraceCheckUtils]: 2: Hoare triple {5856#(<= ~counter~0 0)} assume true; {5856#(<= ~counter~0 0)} is VALID [2022-04-08 14:16:35,361 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5856#(<= ~counter~0 0)} {5848#true} #57#return; {5856#(<= ~counter~0 0)} is VALID [2022-04-08 14:16:35,362 INFO L272 TraceCheckUtils]: 4: Hoare triple {5856#(<= ~counter~0 0)} call #t~ret6 := main(); {5856#(<= ~counter~0 0)} is VALID [2022-04-08 14:16:35,362 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-08 14:16:35,363 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-08 14:16:35,363 INFO L290 TraceCheckUtils]: 7: Hoare triple {5872#(<= ~counter~0 1)} assume !!(#t~post5 < 100);havoc #t~post5; {5872#(<= ~counter~0 1)} is VALID [2022-04-08 14:16:35,363 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-08 14:16:35,364 INFO L290 TraceCheckUtils]: 9: Hoare triple {5872#(<= ~counter~0 1)} ~cond := #in~cond; {5872#(<= ~counter~0 1)} is VALID [2022-04-08 14:16:35,364 INFO L290 TraceCheckUtils]: 10: Hoare triple {5872#(<= ~counter~0 1)} assume !(0 == ~cond); {5872#(<= ~counter~0 1)} is VALID [2022-04-08 14:16:35,364 INFO L290 TraceCheckUtils]: 11: Hoare triple {5872#(<= ~counter~0 1)} assume true; {5872#(<= ~counter~0 1)} is VALID [2022-04-08 14:16:35,365 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {5872#(<= ~counter~0 1)} {5872#(<= ~counter~0 1)} #51#return; {5872#(<= ~counter~0 1)} is VALID [2022-04-08 14:16:35,365 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-08 14:16:35,375 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-08 14:16:35,376 INFO L290 TraceCheckUtils]: 15: Hoare triple {5897#(<= ~counter~0 2)} assume !!(#t~post5 < 100);havoc #t~post5; {5897#(<= ~counter~0 2)} is VALID [2022-04-08 14:16:35,376 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-08 14:16:35,377 INFO L290 TraceCheckUtils]: 17: Hoare triple {5897#(<= ~counter~0 2)} ~cond := #in~cond; {5897#(<= ~counter~0 2)} is VALID [2022-04-08 14:16:35,377 INFO L290 TraceCheckUtils]: 18: Hoare triple {5897#(<= ~counter~0 2)} assume !(0 == ~cond); {5897#(<= ~counter~0 2)} is VALID [2022-04-08 14:16:35,377 INFO L290 TraceCheckUtils]: 19: Hoare triple {5897#(<= ~counter~0 2)} assume true; {5897#(<= ~counter~0 2)} is VALID [2022-04-08 14:16:35,377 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {5897#(<= ~counter~0 2)} {5897#(<= ~counter~0 2)} #51#return; {5897#(<= ~counter~0 2)} is VALID [2022-04-08 14:16:35,378 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-08 14:16:35,378 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-08 14:16:35,378 INFO L290 TraceCheckUtils]: 23: Hoare triple {5922#(<= ~counter~0 3)} assume !!(#t~post5 < 100);havoc #t~post5; {5922#(<= ~counter~0 3)} is VALID [2022-04-08 14:16:35,379 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-08 14:16:35,379 INFO L290 TraceCheckUtils]: 25: Hoare triple {5922#(<= ~counter~0 3)} ~cond := #in~cond; {5922#(<= ~counter~0 3)} is VALID [2022-04-08 14:16:35,379 INFO L290 TraceCheckUtils]: 26: Hoare triple {5922#(<= ~counter~0 3)} assume !(0 == ~cond); {5922#(<= ~counter~0 3)} is VALID [2022-04-08 14:16:35,380 INFO L290 TraceCheckUtils]: 27: Hoare triple {5922#(<= ~counter~0 3)} assume true; {5922#(<= ~counter~0 3)} is VALID [2022-04-08 14:16:35,380 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {5922#(<= ~counter~0 3)} {5922#(<= ~counter~0 3)} #51#return; {5922#(<= ~counter~0 3)} is VALID [2022-04-08 14:16:35,380 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-08 14:16:35,381 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-08 14:16:35,381 INFO L290 TraceCheckUtils]: 31: Hoare triple {5947#(<= ~counter~0 4)} assume !!(#t~post5 < 100);havoc #t~post5; {5947#(<= ~counter~0 4)} is VALID [2022-04-08 14:16:35,382 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-08 14:16:35,382 INFO L290 TraceCheckUtils]: 33: Hoare triple {5947#(<= ~counter~0 4)} ~cond := #in~cond; {5947#(<= ~counter~0 4)} is VALID [2022-04-08 14:16:35,382 INFO L290 TraceCheckUtils]: 34: Hoare triple {5947#(<= ~counter~0 4)} assume !(0 == ~cond); {5947#(<= ~counter~0 4)} is VALID [2022-04-08 14:16:35,382 INFO L290 TraceCheckUtils]: 35: Hoare triple {5947#(<= ~counter~0 4)} assume true; {5947#(<= ~counter~0 4)} is VALID [2022-04-08 14:16:35,383 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {5947#(<= ~counter~0 4)} {5947#(<= ~counter~0 4)} #51#return; {5947#(<= ~counter~0 4)} is VALID [2022-04-08 14:16:35,383 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-08 14:16:35,384 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-08 14:16:35,384 INFO L290 TraceCheckUtils]: 39: Hoare triple {5972#(<= ~counter~0 5)} assume !!(#t~post5 < 100);havoc #t~post5; {5972#(<= ~counter~0 5)} is VALID [2022-04-08 14:16:35,384 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-08 14:16:35,385 INFO L290 TraceCheckUtils]: 41: Hoare triple {5972#(<= ~counter~0 5)} ~cond := #in~cond; {5972#(<= ~counter~0 5)} is VALID [2022-04-08 14:16:35,385 INFO L290 TraceCheckUtils]: 42: Hoare triple {5972#(<= ~counter~0 5)} assume !(0 == ~cond); {5972#(<= ~counter~0 5)} is VALID [2022-04-08 14:16:35,385 INFO L290 TraceCheckUtils]: 43: Hoare triple {5972#(<= ~counter~0 5)} assume true; {5972#(<= ~counter~0 5)} is VALID [2022-04-08 14:16:35,386 INFO L284 TraceCheckUtils]: 44: Hoare quadruple {5972#(<= ~counter~0 5)} {5972#(<= ~counter~0 5)} #51#return; {5972#(<= ~counter~0 5)} is VALID [2022-04-08 14:16:35,386 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-08 14:16:35,386 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-08 14:16:35,386 INFO L290 TraceCheckUtils]: 47: Hoare triple {5997#(<= ~counter~0 6)} assume !!(#t~post5 < 100);havoc #t~post5; {5997#(<= ~counter~0 6)} is VALID [2022-04-08 14:16:35,387 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-08 14:16:35,387 INFO L290 TraceCheckUtils]: 49: Hoare triple {5997#(<= ~counter~0 6)} ~cond := #in~cond; {5997#(<= ~counter~0 6)} is VALID [2022-04-08 14:16:35,387 INFO L290 TraceCheckUtils]: 50: Hoare triple {5997#(<= ~counter~0 6)} assume !(0 == ~cond); {5997#(<= ~counter~0 6)} is VALID [2022-04-08 14:16:35,388 INFO L290 TraceCheckUtils]: 51: Hoare triple {5997#(<= ~counter~0 6)} assume true; {5997#(<= ~counter~0 6)} is VALID [2022-04-08 14:16:35,388 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {5997#(<= ~counter~0 6)} {5997#(<= ~counter~0 6)} #51#return; {5997#(<= ~counter~0 6)} is VALID [2022-04-08 14:16:35,388 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-08 14:16:35,389 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-08 14:16:35,389 INFO L290 TraceCheckUtils]: 55: Hoare triple {6022#(<= |main_#t~post5| 6)} assume !(#t~post5 < 100);havoc #t~post5; {5849#false} is VALID [2022-04-08 14:16:35,389 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-08 14:16:35,389 INFO L290 TraceCheckUtils]: 57: Hoare triple {5849#false} ~cond := #in~cond; {5849#false} is VALID [2022-04-08 14:16:35,389 INFO L290 TraceCheckUtils]: 58: Hoare triple {5849#false} assume 0 == ~cond; {5849#false} is VALID [2022-04-08 14:16:35,389 INFO L290 TraceCheckUtils]: 59: Hoare triple {5849#false} assume !false; {5849#false} is VALID [2022-04-08 14:16:35,389 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-08 14:16:35,390 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 14:16:35,745 INFO L290 TraceCheckUtils]: 59: Hoare triple {5849#false} assume !false; {5849#false} is VALID [2022-04-08 14:16:35,746 INFO L290 TraceCheckUtils]: 58: Hoare triple {5849#false} assume 0 == ~cond; {5849#false} is VALID [2022-04-08 14:16:35,746 INFO L290 TraceCheckUtils]: 57: Hoare triple {5849#false} ~cond := #in~cond; {5849#false} is VALID [2022-04-08 14:16:35,746 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-08 14:16:35,746 INFO L290 TraceCheckUtils]: 55: Hoare triple {6050#(< |main_#t~post5| 100)} assume !(#t~post5 < 100);havoc #t~post5; {5849#false} is VALID [2022-04-08 14:16:35,746 INFO L290 TraceCheckUtils]: 54: Hoare triple {6054#(< ~counter~0 100)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {6050#(< |main_#t~post5| 100)} is VALID [2022-04-08 14:16:35,746 INFO L290 TraceCheckUtils]: 53: Hoare triple {6054#(< ~counter~0 100)} 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 100)} is VALID [2022-04-08 14:16:35,747 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {5848#true} {6054#(< ~counter~0 100)} #51#return; {6054#(< ~counter~0 100)} is VALID [2022-04-08 14:16:35,747 INFO L290 TraceCheckUtils]: 51: Hoare triple {5848#true} assume true; {5848#true} is VALID [2022-04-08 14:16:35,747 INFO L290 TraceCheckUtils]: 50: Hoare triple {5848#true} assume !(0 == ~cond); {5848#true} is VALID [2022-04-08 14:16:35,747 INFO L290 TraceCheckUtils]: 49: Hoare triple {5848#true} ~cond := #in~cond; {5848#true} is VALID [2022-04-08 14:16:35,747 INFO L272 TraceCheckUtils]: 48: Hoare triple {6054#(< ~counter~0 100)} 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-08 14:16:35,747 INFO L290 TraceCheckUtils]: 47: Hoare triple {6054#(< ~counter~0 100)} assume !!(#t~post5 < 100);havoc #t~post5; {6054#(< ~counter~0 100)} is VALID [2022-04-08 14:16:35,748 INFO L290 TraceCheckUtils]: 46: Hoare triple {6079#(< ~counter~0 99)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {6054#(< ~counter~0 100)} is VALID [2022-04-08 14:16:35,748 INFO L290 TraceCheckUtils]: 45: Hoare triple {6079#(< ~counter~0 99)} 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 99)} is VALID [2022-04-08 14:16:35,749 INFO L284 TraceCheckUtils]: 44: Hoare quadruple {5848#true} {6079#(< ~counter~0 99)} #51#return; {6079#(< ~counter~0 99)} is VALID [2022-04-08 14:16:35,749 INFO L290 TraceCheckUtils]: 43: Hoare triple {5848#true} assume true; {5848#true} is VALID [2022-04-08 14:16:35,749 INFO L290 TraceCheckUtils]: 42: Hoare triple {5848#true} assume !(0 == ~cond); {5848#true} is VALID [2022-04-08 14:16:35,749 INFO L290 TraceCheckUtils]: 41: Hoare triple {5848#true} ~cond := #in~cond; {5848#true} is VALID [2022-04-08 14:16:35,749 INFO L272 TraceCheckUtils]: 40: Hoare triple {6079#(< ~counter~0 99)} 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-08 14:16:35,749 INFO L290 TraceCheckUtils]: 39: Hoare triple {6079#(< ~counter~0 99)} assume !!(#t~post5 < 100);havoc #t~post5; {6079#(< ~counter~0 99)} is VALID [2022-04-08 14:16:35,750 INFO L290 TraceCheckUtils]: 38: Hoare triple {6104#(< ~counter~0 98)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {6079#(< ~counter~0 99)} is VALID [2022-04-08 14:16:35,750 INFO L290 TraceCheckUtils]: 37: Hoare triple {6104#(< ~counter~0 98)} 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 98)} is VALID [2022-04-08 14:16:35,750 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {5848#true} {6104#(< ~counter~0 98)} #51#return; {6104#(< ~counter~0 98)} is VALID [2022-04-08 14:16:35,750 INFO L290 TraceCheckUtils]: 35: Hoare triple {5848#true} assume true; {5848#true} is VALID [2022-04-08 14:16:35,750 INFO L290 TraceCheckUtils]: 34: Hoare triple {5848#true} assume !(0 == ~cond); {5848#true} is VALID [2022-04-08 14:16:35,750 INFO L290 TraceCheckUtils]: 33: Hoare triple {5848#true} ~cond := #in~cond; {5848#true} is VALID [2022-04-08 14:16:35,751 INFO L272 TraceCheckUtils]: 32: Hoare triple {6104#(< ~counter~0 98)} 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-08 14:16:35,751 INFO L290 TraceCheckUtils]: 31: Hoare triple {6104#(< ~counter~0 98)} assume !!(#t~post5 < 100);havoc #t~post5; {6104#(< ~counter~0 98)} is VALID [2022-04-08 14:16:35,751 INFO L290 TraceCheckUtils]: 30: Hoare triple {6129#(< ~counter~0 97)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {6104#(< ~counter~0 98)} is VALID [2022-04-08 14:16:35,751 INFO L290 TraceCheckUtils]: 29: Hoare triple {6129#(< ~counter~0 97)} 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 97)} is VALID [2022-04-08 14:16:35,752 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {5848#true} {6129#(< ~counter~0 97)} #51#return; {6129#(< ~counter~0 97)} is VALID [2022-04-08 14:16:35,752 INFO L290 TraceCheckUtils]: 27: Hoare triple {5848#true} assume true; {5848#true} is VALID [2022-04-08 14:16:35,752 INFO L290 TraceCheckUtils]: 26: Hoare triple {5848#true} assume !(0 == ~cond); {5848#true} is VALID [2022-04-08 14:16:35,752 INFO L290 TraceCheckUtils]: 25: Hoare triple {5848#true} ~cond := #in~cond; {5848#true} is VALID [2022-04-08 14:16:35,752 INFO L272 TraceCheckUtils]: 24: Hoare triple {6129#(< ~counter~0 97)} 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-08 14:16:35,753 INFO L290 TraceCheckUtils]: 23: Hoare triple {6129#(< ~counter~0 97)} assume !!(#t~post5 < 100);havoc #t~post5; {6129#(< ~counter~0 97)} is VALID [2022-04-08 14:16:35,755 INFO L290 TraceCheckUtils]: 22: Hoare triple {6154#(< ~counter~0 96)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {6129#(< ~counter~0 97)} is VALID [2022-04-08 14:16:35,756 INFO L290 TraceCheckUtils]: 21: Hoare triple {6154#(< ~counter~0 96)} 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 96)} is VALID [2022-04-08 14:16:35,756 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {5848#true} {6154#(< ~counter~0 96)} #51#return; {6154#(< ~counter~0 96)} is VALID [2022-04-08 14:16:35,756 INFO L290 TraceCheckUtils]: 19: Hoare triple {5848#true} assume true; {5848#true} is VALID [2022-04-08 14:16:35,756 INFO L290 TraceCheckUtils]: 18: Hoare triple {5848#true} assume !(0 == ~cond); {5848#true} is VALID [2022-04-08 14:16:35,756 INFO L290 TraceCheckUtils]: 17: Hoare triple {5848#true} ~cond := #in~cond; {5848#true} is VALID [2022-04-08 14:16:35,756 INFO L272 TraceCheckUtils]: 16: Hoare triple {6154#(< ~counter~0 96)} 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-08 14:16:35,757 INFO L290 TraceCheckUtils]: 15: Hoare triple {6154#(< ~counter~0 96)} assume !!(#t~post5 < 100);havoc #t~post5; {6154#(< ~counter~0 96)} is VALID [2022-04-08 14:16:35,757 INFO L290 TraceCheckUtils]: 14: Hoare triple {6179#(< ~counter~0 95)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {6154#(< ~counter~0 96)} is VALID [2022-04-08 14:16:35,757 INFO L290 TraceCheckUtils]: 13: Hoare triple {6179#(< ~counter~0 95)} 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 95)} is VALID [2022-04-08 14:16:35,758 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {5848#true} {6179#(< ~counter~0 95)} #51#return; {6179#(< ~counter~0 95)} is VALID [2022-04-08 14:16:35,758 INFO L290 TraceCheckUtils]: 11: Hoare triple {5848#true} assume true; {5848#true} is VALID [2022-04-08 14:16:35,758 INFO L290 TraceCheckUtils]: 10: Hoare triple {5848#true} assume !(0 == ~cond); {5848#true} is VALID [2022-04-08 14:16:35,758 INFO L290 TraceCheckUtils]: 9: Hoare triple {5848#true} ~cond := #in~cond; {5848#true} is VALID [2022-04-08 14:16:35,758 INFO L272 TraceCheckUtils]: 8: Hoare triple {6179#(< ~counter~0 95)} 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-08 14:16:35,758 INFO L290 TraceCheckUtils]: 7: Hoare triple {6179#(< ~counter~0 95)} assume !!(#t~post5 < 100);havoc #t~post5; {6179#(< ~counter~0 95)} is VALID [2022-04-08 14:16:35,759 INFO L290 TraceCheckUtils]: 6: Hoare triple {6204#(< ~counter~0 94)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {6179#(< ~counter~0 95)} is VALID [2022-04-08 14:16:35,759 INFO L290 TraceCheckUtils]: 5: Hoare triple {6204#(< ~counter~0 94)} 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 94)} is VALID [2022-04-08 14:16:35,759 INFO L272 TraceCheckUtils]: 4: Hoare triple {6204#(< ~counter~0 94)} call #t~ret6 := main(); {6204#(< ~counter~0 94)} is VALID [2022-04-08 14:16:35,760 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6204#(< ~counter~0 94)} {5848#true} #57#return; {6204#(< ~counter~0 94)} is VALID [2022-04-08 14:16:35,760 INFO L290 TraceCheckUtils]: 2: Hoare triple {6204#(< ~counter~0 94)} assume true; {6204#(< ~counter~0 94)} is VALID [2022-04-08 14:16:35,760 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 94)} is VALID [2022-04-08 14:16:35,760 INFO L272 TraceCheckUtils]: 0: Hoare triple {5848#true} call ULTIMATE.init(); {5848#true} is VALID [2022-04-08 14:16:35,761 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-08 14:16:35,761 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 14:16:35,761 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1226323392] [2022-04-08 14:16:35,761 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 14:16:35,761 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [286612210] [2022-04-08 14:16:35,761 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [286612210] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 14:16:35,761 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-08 14:16:35,761 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 18 [2022-04-08 14:16:35,761 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 14:16:35,761 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2079407585] [2022-04-08 14:16:35,761 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2079407585] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 14:16:35,761 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 14:16:35,761 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-04-08 14:16:35,761 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2078277069] [2022-04-08 14:16:35,762 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 14:16:35,762 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-08 14:16:35,762 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 14:16:35,762 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-08 14:16:35,804 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-08 14:16:35,804 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-04-08 14:16:35,804 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 14:16:35,805 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-04-08 14:16:35,805 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=125, Invalid=181, Unknown=0, NotChecked=0, Total=306 [2022-04-08 14:16:35,805 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-08 14:16:36,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:16:36,056 INFO L93 Difference]: Finished difference Result 74 states and 75 transitions. [2022-04-08 14:16:36,056 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-04-08 14:16:36,056 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-08 14:16:36,058 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 14:16:36,058 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-08 14:16:36,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 74 transitions. [2022-04-08 14:16:36,060 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-08 14:16:36,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 74 transitions. [2022-04-08 14:16:36,063 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 16 states and 74 transitions. [2022-04-08 14:16:36,115 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 74 edges. 74 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 14:16:36,116 INFO L225 Difference]: With dead ends: 74 [2022-04-08 14:16:36,116 INFO L226 Difference]: Without dead ends: 69 [2022-04-08 14:16:36,117 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-08 14:16:36,117 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-08 14:16:36,118 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-08 14:16:36,118 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2022-04-08 14:16:36,215 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 69. [2022-04-08 14:16:36,215 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 14:16:36,216 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-08 14:16:36,216 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-08 14:16:36,216 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-08 14:16:36,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:16:36,217 INFO L93 Difference]: Finished difference Result 69 states and 70 transitions. [2022-04-08 14:16:36,217 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 70 transitions. [2022-04-08 14:16:36,218 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 14:16:36,218 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 14:16:36,218 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-08 14:16:36,218 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-08 14:16:36,219 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:16:36,219 INFO L93 Difference]: Finished difference Result 69 states and 70 transitions. [2022-04-08 14:16:36,219 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 70 transitions. [2022-04-08 14:16:36,220 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 14:16:36,220 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 14:16:36,220 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 14:16:36,220 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 14:16:36,220 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-08 14:16:36,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 70 transitions. [2022-04-08 14:16:36,221 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 70 transitions. Word has length 60 [2022-04-08 14:16:36,221 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 14:16:36,221 INFO L478 AbstractCegarLoop]: Abstraction has 69 states and 70 transitions. [2022-04-08 14:16:36,221 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-08 14:16:36,222 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 69 states and 70 transitions. [2022-04-08 14:16:36,318 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 70 edges. 70 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 14:16:36,318 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 70 transitions. [2022-04-08 14:16:36,319 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2022-04-08 14:16:36,319 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 14:16:36,319 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-08 14:16:36,323 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2022-04-08 14:16:36,519 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 14:16:36,520 INFO L403 AbstractCegarLoop]: === Iteration 16 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 14:16:36,520 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 14:16:36,520 INFO L85 PathProgramCache]: Analyzing trace with hash 1180930233, now seen corresponding path program 11 times [2022-04-08 14:16:36,520 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 14:16:36,520 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [121873980] [2022-04-08 14:16:36,600 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 14:16:36,600 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 14:16:36,600 INFO L85 PathProgramCache]: Analyzing trace with hash 1180930233, now seen corresponding path program 12 times [2022-04-08 14:16:36,600 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 14:16:36,600 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [857882096] [2022-04-08 14:16:36,600 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 14:16:36,601 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 14:16:36,609 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 14:16:36,610 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1820138135] [2022-04-08 14:16:36,610 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-08 14:16:36,610 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 14:16:36,610 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 14:16:36,610 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 14:16:36,611 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2022-04-08 14:16:36,952 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2022-04-08 14:16:36,952 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 14:16:36,953 INFO L263 TraceCheckSpWp]: Trace formula consists of 207 conjuncts, 32 conjunts are in the unsatisfiable core [2022-04-08 14:16:36,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 14:16:36,967 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 14:16:37,404 INFO L272 TraceCheckUtils]: 0: Hoare triple {6661#true} call ULTIMATE.init(); {6661#true} is VALID [2022-04-08 14:16:37,405 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-08 14:16:37,405 INFO L290 TraceCheckUtils]: 2: Hoare triple {6661#true} assume true; {6661#true} is VALID [2022-04-08 14:16:37,405 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6661#true} {6661#true} #57#return; {6661#true} is VALID [2022-04-08 14:16:37,405 INFO L272 TraceCheckUtils]: 4: Hoare triple {6661#true} call #t~ret6 := main(); {6661#true} is VALID [2022-04-08 14:16:37,405 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-08 14:16:37,406 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-08 14:16:37,406 INFO L290 TraceCheckUtils]: 7: Hoare triple {6681#(and (= main_~c~0 0) (= main_~y~0 0))} assume !!(#t~post5 < 100);havoc #t~post5; {6681#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-08 14:16:37,406 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-08 14:16:37,406 INFO L290 TraceCheckUtils]: 9: Hoare triple {6661#true} ~cond := #in~cond; {6661#true} is VALID [2022-04-08 14:16:37,406 INFO L290 TraceCheckUtils]: 10: Hoare triple {6661#true} assume !(0 == ~cond); {6661#true} is VALID [2022-04-08 14:16:37,406 INFO L290 TraceCheckUtils]: 11: Hoare triple {6661#true} assume true; {6661#true} is VALID [2022-04-08 14:16:37,407 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-08 14:16:37,407 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-08 14:16:37,407 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-08 14:16:37,408 INFO L290 TraceCheckUtils]: 15: Hoare triple {6706#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} assume !!(#t~post5 < 100);havoc #t~post5; {6706#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} is VALID [2022-04-08 14:16:37,408 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-08 14:16:37,408 INFO L290 TraceCheckUtils]: 17: Hoare triple {6661#true} ~cond := #in~cond; {6661#true} is VALID [2022-04-08 14:16:37,408 INFO L290 TraceCheckUtils]: 18: Hoare triple {6661#true} assume !(0 == ~cond); {6661#true} is VALID [2022-04-08 14:16:37,408 INFO L290 TraceCheckUtils]: 19: Hoare triple {6661#true} assume true; {6661#true} is VALID [2022-04-08 14:16:37,408 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-08 14:16:37,409 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))} is VALID [2022-04-08 14:16:37,410 INFO L290 TraceCheckUtils]: 22: Hoare triple {6731#(and (= main_~y~0 2) (= (+ (- 1) main_~c~0) 1))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {6731#(and (= main_~y~0 2) (= (+ (- 1) main_~c~0) 1))} is VALID [2022-04-08 14:16:37,410 INFO L290 TraceCheckUtils]: 23: Hoare triple {6731#(and (= main_~y~0 2) (= (+ (- 1) main_~c~0) 1))} assume !!(#t~post5 < 100);havoc #t~post5; {6731#(and (= main_~y~0 2) (= (+ (- 1) main_~c~0) 1))} is VALID [2022-04-08 14:16:37,410 INFO L272 TraceCheckUtils]: 24: Hoare triple {6731#(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)); {6661#true} is VALID [2022-04-08 14:16:37,410 INFO L290 TraceCheckUtils]: 25: Hoare triple {6661#true} ~cond := #in~cond; {6661#true} is VALID [2022-04-08 14:16:37,411 INFO L290 TraceCheckUtils]: 26: Hoare triple {6661#true} assume !(0 == ~cond); {6661#true} is VALID [2022-04-08 14:16:37,411 INFO L290 TraceCheckUtils]: 27: Hoare triple {6661#true} assume true; {6661#true} is VALID [2022-04-08 14:16:37,411 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {6661#true} {6731#(and (= main_~y~0 2) (= (+ (- 1) main_~c~0) 1))} #51#return; {6731#(and (= main_~y~0 2) (= (+ (- 1) main_~c~0) 1))} is VALID [2022-04-08 14:16:37,411 INFO L290 TraceCheckUtils]: 29: Hoare triple {6731#(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; {6756#(and (= (+ (- 2) main_~c~0) 1) (= main_~y~0 3))} is VALID [2022-04-08 14:16:37,412 INFO L290 TraceCheckUtils]: 30: Hoare triple {6756#(and (= (+ (- 2) main_~c~0) 1) (= main_~y~0 3))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {6756#(and (= (+ (- 2) main_~c~0) 1) (= main_~y~0 3))} is VALID [2022-04-08 14:16:37,412 INFO L290 TraceCheckUtils]: 31: Hoare triple {6756#(and (= (+ (- 2) main_~c~0) 1) (= main_~y~0 3))} assume !!(#t~post5 < 100);havoc #t~post5; {6756#(and (= (+ (- 2) main_~c~0) 1) (= main_~y~0 3))} is VALID [2022-04-08 14:16:37,412 INFO L272 TraceCheckUtils]: 32: Hoare triple {6756#(and (= (+ (- 2) main_~c~0) 1) (= 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)); {6661#true} is VALID [2022-04-08 14:16:37,412 INFO L290 TraceCheckUtils]: 33: Hoare triple {6661#true} ~cond := #in~cond; {6661#true} is VALID [2022-04-08 14:16:37,412 INFO L290 TraceCheckUtils]: 34: Hoare triple {6661#true} assume !(0 == ~cond); {6661#true} is VALID [2022-04-08 14:16:37,412 INFO L290 TraceCheckUtils]: 35: Hoare triple {6661#true} assume true; {6661#true} is VALID [2022-04-08 14:16:37,413 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {6661#true} {6756#(and (= (+ (- 2) main_~c~0) 1) (= main_~y~0 3))} #51#return; {6756#(and (= (+ (- 2) main_~c~0) 1) (= main_~y~0 3))} is VALID [2022-04-08 14:16:37,413 INFO L290 TraceCheckUtils]: 37: Hoare triple {6756#(and (= (+ (- 2) main_~c~0) 1) (= main_~y~0 3))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {6781#(and (= main_~y~0 4) (= main_~c~0 4))} is VALID [2022-04-08 14:16:37,414 INFO L290 TraceCheckUtils]: 38: Hoare triple {6781#(and (= main_~y~0 4) (= main_~c~0 4))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {6781#(and (= main_~y~0 4) (= main_~c~0 4))} is VALID [2022-04-08 14:16:37,414 INFO L290 TraceCheckUtils]: 39: Hoare triple {6781#(and (= main_~y~0 4) (= main_~c~0 4))} assume !!(#t~post5 < 100);havoc #t~post5; {6781#(and (= main_~y~0 4) (= main_~c~0 4))} is VALID [2022-04-08 14:16:37,414 INFO L272 TraceCheckUtils]: 40: Hoare triple {6781#(and (= 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-08 14:16:37,414 INFO L290 TraceCheckUtils]: 41: Hoare triple {6661#true} ~cond := #in~cond; {6661#true} is VALID [2022-04-08 14:16:37,414 INFO L290 TraceCheckUtils]: 42: Hoare triple {6661#true} assume !(0 == ~cond); {6661#true} is VALID [2022-04-08 14:16:37,414 INFO L290 TraceCheckUtils]: 43: Hoare triple {6661#true} assume true; {6661#true} is VALID [2022-04-08 14:16:37,415 INFO L284 TraceCheckUtils]: 44: Hoare quadruple {6661#true} {6781#(and (= main_~y~0 4) (= main_~c~0 4))} #51#return; {6781#(and (= main_~y~0 4) (= main_~c~0 4))} is VALID [2022-04-08 14:16:37,415 INFO L290 TraceCheckUtils]: 45: Hoare triple {6781#(and (= main_~y~0 4) (= main_~c~0 4))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {6806#(and (= (+ (- 1) main_~y~0) 4) (= (+ (- 1) main_~c~0) 4))} is VALID [2022-04-08 14:16:37,419 INFO L290 TraceCheckUtils]: 46: Hoare triple {6806#(and (= (+ (- 1) main_~y~0) 4) (= (+ (- 1) main_~c~0) 4))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {6806#(and (= (+ (- 1) main_~y~0) 4) (= (+ (- 1) main_~c~0) 4))} is VALID [2022-04-08 14:16:37,419 INFO L290 TraceCheckUtils]: 47: Hoare triple {6806#(and (= (+ (- 1) main_~y~0) 4) (= (+ (- 1) main_~c~0) 4))} assume !!(#t~post5 < 100);havoc #t~post5; {6806#(and (= (+ (- 1) main_~y~0) 4) (= (+ (- 1) main_~c~0) 4))} is VALID [2022-04-08 14:16:37,419 INFO L272 TraceCheckUtils]: 48: Hoare triple {6806#(and (= (+ (- 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-08 14:16:37,420 INFO L290 TraceCheckUtils]: 49: Hoare triple {6661#true} ~cond := #in~cond; {6661#true} is VALID [2022-04-08 14:16:37,420 INFO L290 TraceCheckUtils]: 50: Hoare triple {6661#true} assume !(0 == ~cond); {6661#true} is VALID [2022-04-08 14:16:37,420 INFO L290 TraceCheckUtils]: 51: Hoare triple {6661#true} assume true; {6661#true} is VALID [2022-04-08 14:16:37,420 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {6661#true} {6806#(and (= (+ (- 1) main_~y~0) 4) (= (+ (- 1) main_~c~0) 4))} #51#return; {6806#(and (= (+ (- 1) main_~y~0) 4) (= (+ (- 1) main_~c~0) 4))} is VALID [2022-04-08 14:16:37,421 INFO L290 TraceCheckUtils]: 53: Hoare triple {6806#(and (= (+ (- 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-08 14:16:37,421 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-08 14:16:37,421 INFO L290 TraceCheckUtils]: 55: Hoare triple {6831#(and (= main_~y~0 6) (< 5 main_~k~0) (<= main_~c~0 6))} assume !!(#t~post5 < 100);havoc #t~post5; {6831#(and (= main_~y~0 6) (< 5 main_~k~0) (<= main_~c~0 6))} is VALID [2022-04-08 14:16:37,422 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-08 14:16:37,422 INFO L290 TraceCheckUtils]: 57: Hoare triple {6661#true} ~cond := #in~cond; {6661#true} is VALID [2022-04-08 14:16:37,422 INFO L290 TraceCheckUtils]: 58: Hoare triple {6661#true} assume !(0 == ~cond); {6661#true} is VALID [2022-04-08 14:16:37,422 INFO L290 TraceCheckUtils]: 59: Hoare triple {6661#true} assume true; {6661#true} is VALID [2022-04-08 14:16:37,422 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-08 14:16:37,423 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-08 14:16:37,424 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-08 14:16:37,425 INFO L290 TraceCheckUtils]: 63: Hoare triple {6860#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {6864#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 14:16:37,425 INFO L290 TraceCheckUtils]: 64: Hoare triple {6864#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {6662#false} is VALID [2022-04-08 14:16:37,425 INFO L290 TraceCheckUtils]: 65: Hoare triple {6662#false} assume !false; {6662#false} is VALID [2022-04-08 14:16:37,425 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-08 14:16:37,426 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 14:16:37,713 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 14:16:37,713 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [857882096] [2022-04-08 14:16:37,713 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 14:16:37,713 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1820138135] [2022-04-08 14:16:37,714 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1820138135] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 14:16:37,714 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-08 14:16:37,714 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2022-04-08 14:16:37,714 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 14:16:37,714 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [121873980] [2022-04-08 14:16:37,714 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [121873980] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 14:16:37,714 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 14:16:37,714 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-04-08 14:16:37,714 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1065339795] [2022-04-08 14:16:37,714 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 14:16:37,714 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-08 14:16:37,715 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 14:16:37,715 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-08 14:16:37,754 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-08 14:16:37,754 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-04-08 14:16:37,754 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 14:16:37,754 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-04-08 14:16:37,755 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=171, Unknown=0, NotChecked=0, Total=210 [2022-04-08 14:16:37,755 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-08 14:16:38,356 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:16:38,356 INFO L93 Difference]: Finished difference Result 76 states and 78 transitions. [2022-04-08 14:16:38,356 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-04-08 14:16:38,356 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-08 14:16:38,356 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 14:16:38,356 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-08 14:16:38,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 59 transitions. [2022-04-08 14:16:38,358 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-08 14:16:38,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 59 transitions. [2022-04-08 14:16:38,359 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 12 states and 59 transitions. [2022-04-08 14:16:38,400 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 59 edges. 59 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 14:16:38,403 INFO L225 Difference]: With dead ends: 76 [2022-04-08 14:16:38,403 INFO L226 Difference]: Without dead ends: 71 [2022-04-08 14:16:38,403 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 65 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=49, Invalid=223, Unknown=0, NotChecked=0, Total=272 [2022-04-08 14:16:38,404 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-08 14:16:38,404 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-08 14:16:38,405 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2022-04-08 14:16:38,488 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2022-04-08 14:16:38,488 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 14:16:38,488 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-08 14:16:38,488 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-08 14:16:38,489 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-08 14:16:38,491 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:16:38,491 INFO L93 Difference]: Finished difference Result 71 states and 73 transitions. [2022-04-08 14:16:38,491 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 73 transitions. [2022-04-08 14:16:38,492 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 14:16:38,492 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 14:16:38,492 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-08 14:16:38,492 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-08 14:16:38,493 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:16:38,493 INFO L93 Difference]: Finished difference Result 71 states and 73 transitions. [2022-04-08 14:16:38,494 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 73 transitions. [2022-04-08 14:16:38,494 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 14:16:38,494 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 14:16:38,494 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 14:16:38,494 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 14:16:38,494 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-08 14:16:38,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 73 transitions. [2022-04-08 14:16:38,496 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 73 transitions. Word has length 66 [2022-04-08 14:16:38,496 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 14:16:38,496 INFO L478 AbstractCegarLoop]: Abstraction has 71 states and 73 transitions. [2022-04-08 14:16:38,496 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-08 14:16:38,496 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 71 states and 73 transitions. [2022-04-08 14:16:38,583 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-08 14:16:38,583 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 73 transitions. [2022-04-08 14:16:38,584 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2022-04-08 14:16:38,584 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 14:16:38,584 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-08 14:16:38,590 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2022-04-08 14:16:38,785 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2022-04-08 14:16:38,785 INFO L403 AbstractCegarLoop]: === Iteration 17 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 14:16:38,785 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 14:16:38,785 INFO L85 PathProgramCache]: Analyzing trace with hash 1699217054, now seen corresponding path program 13 times [2022-04-08 14:16:38,785 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 14:16:38,785 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1002517707] [2022-04-08 14:16:38,881 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 14:16:38,881 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 14:16:38,881 INFO L85 PathProgramCache]: Analyzing trace with hash 1699217054, now seen corresponding path program 14 times [2022-04-08 14:16:38,881 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 14:16:38,882 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1882296458] [2022-04-08 14:16:38,882 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 14:16:38,882 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 14:16:38,891 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 14:16:38,891 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1666019728] [2022-04-08 14:16:38,891 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 14:16:38,891 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 14:16:38,892 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 14:16:38,892 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 14:16:38,901 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2022-04-08 14:16:38,944 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 14:16:38,944 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 14:16:38,945 INFO L263 TraceCheckSpWp]: Trace formula consists of 218 conjuncts, 19 conjunts are in the unsatisfiable core [2022-04-08 14:16:38,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 14:16:38,961 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 14:16:39,302 INFO L272 TraceCheckUtils]: 0: Hoare triple {7355#true} call ULTIMATE.init(); {7355#true} is VALID [2022-04-08 14:16:39,303 INFO L290 TraceCheckUtils]: 1: Hoare triple {7355#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; {7363#(<= ~counter~0 0)} is VALID [2022-04-08 14:16:39,304 INFO L290 TraceCheckUtils]: 2: Hoare triple {7363#(<= ~counter~0 0)} assume true; {7363#(<= ~counter~0 0)} is VALID [2022-04-08 14:16:39,304 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7363#(<= ~counter~0 0)} {7355#true} #57#return; {7363#(<= ~counter~0 0)} is VALID [2022-04-08 14:16:39,305 INFO L272 TraceCheckUtils]: 4: Hoare triple {7363#(<= ~counter~0 0)} call #t~ret6 := main(); {7363#(<= ~counter~0 0)} is VALID [2022-04-08 14:16:39,305 INFO L290 TraceCheckUtils]: 5: Hoare triple {7363#(<= ~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; {7363#(<= ~counter~0 0)} is VALID [2022-04-08 14:16:39,306 INFO L290 TraceCheckUtils]: 6: Hoare triple {7363#(<= ~counter~0 0)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {7379#(<= ~counter~0 1)} is VALID [2022-04-08 14:16:39,306 INFO L290 TraceCheckUtils]: 7: Hoare triple {7379#(<= ~counter~0 1)} assume !!(#t~post5 < 100);havoc #t~post5; {7379#(<= ~counter~0 1)} is VALID [2022-04-08 14:16:39,307 INFO L272 TraceCheckUtils]: 8: Hoare triple {7379#(<= ~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)); {7379#(<= ~counter~0 1)} is VALID [2022-04-08 14:16:39,311 INFO L290 TraceCheckUtils]: 9: Hoare triple {7379#(<= ~counter~0 1)} ~cond := #in~cond; {7379#(<= ~counter~0 1)} is VALID [2022-04-08 14:16:39,311 INFO L290 TraceCheckUtils]: 10: Hoare triple {7379#(<= ~counter~0 1)} assume !(0 == ~cond); {7379#(<= ~counter~0 1)} is VALID [2022-04-08 14:16:39,312 INFO L290 TraceCheckUtils]: 11: Hoare triple {7379#(<= ~counter~0 1)} assume true; {7379#(<= ~counter~0 1)} is VALID [2022-04-08 14:16:39,312 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {7379#(<= ~counter~0 1)} {7379#(<= ~counter~0 1)} #51#return; {7379#(<= ~counter~0 1)} is VALID [2022-04-08 14:16:39,313 INFO L290 TraceCheckUtils]: 13: Hoare triple {7379#(<= ~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; {7379#(<= ~counter~0 1)} is VALID [2022-04-08 14:16:39,313 INFO L290 TraceCheckUtils]: 14: Hoare triple {7379#(<= ~counter~0 1)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {7404#(<= ~counter~0 2)} is VALID [2022-04-08 14:16:39,314 INFO L290 TraceCheckUtils]: 15: Hoare triple {7404#(<= ~counter~0 2)} assume !!(#t~post5 < 100);havoc #t~post5; {7404#(<= ~counter~0 2)} is VALID [2022-04-08 14:16:39,314 INFO L272 TraceCheckUtils]: 16: Hoare triple {7404#(<= ~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)); {7404#(<= ~counter~0 2)} is VALID [2022-04-08 14:16:39,315 INFO L290 TraceCheckUtils]: 17: Hoare triple {7404#(<= ~counter~0 2)} ~cond := #in~cond; {7404#(<= ~counter~0 2)} is VALID [2022-04-08 14:16:39,315 INFO L290 TraceCheckUtils]: 18: Hoare triple {7404#(<= ~counter~0 2)} assume !(0 == ~cond); {7404#(<= ~counter~0 2)} is VALID [2022-04-08 14:16:39,315 INFO L290 TraceCheckUtils]: 19: Hoare triple {7404#(<= ~counter~0 2)} assume true; {7404#(<= ~counter~0 2)} is VALID [2022-04-08 14:16:39,316 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {7404#(<= ~counter~0 2)} {7404#(<= ~counter~0 2)} #51#return; {7404#(<= ~counter~0 2)} is VALID [2022-04-08 14:16:39,316 INFO L290 TraceCheckUtils]: 21: Hoare triple {7404#(<= ~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; {7404#(<= ~counter~0 2)} is VALID [2022-04-08 14:16:39,317 INFO L290 TraceCheckUtils]: 22: Hoare triple {7404#(<= ~counter~0 2)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {7429#(<= ~counter~0 3)} is VALID [2022-04-08 14:16:39,317 INFO L290 TraceCheckUtils]: 23: Hoare triple {7429#(<= ~counter~0 3)} assume !!(#t~post5 < 100);havoc #t~post5; {7429#(<= ~counter~0 3)} is VALID [2022-04-08 14:16:39,318 INFO L272 TraceCheckUtils]: 24: Hoare triple {7429#(<= ~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)); {7429#(<= ~counter~0 3)} is VALID [2022-04-08 14:16:39,318 INFO L290 TraceCheckUtils]: 25: Hoare triple {7429#(<= ~counter~0 3)} ~cond := #in~cond; {7429#(<= ~counter~0 3)} is VALID [2022-04-08 14:16:39,318 INFO L290 TraceCheckUtils]: 26: Hoare triple {7429#(<= ~counter~0 3)} assume !(0 == ~cond); {7429#(<= ~counter~0 3)} is VALID [2022-04-08 14:16:39,319 INFO L290 TraceCheckUtils]: 27: Hoare triple {7429#(<= ~counter~0 3)} assume true; {7429#(<= ~counter~0 3)} is VALID [2022-04-08 14:16:39,319 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {7429#(<= ~counter~0 3)} {7429#(<= ~counter~0 3)} #51#return; {7429#(<= ~counter~0 3)} is VALID [2022-04-08 14:16:39,320 INFO L290 TraceCheckUtils]: 29: Hoare triple {7429#(<= ~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; {7429#(<= ~counter~0 3)} is VALID [2022-04-08 14:16:39,320 INFO L290 TraceCheckUtils]: 30: Hoare triple {7429#(<= ~counter~0 3)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {7454#(<= ~counter~0 4)} is VALID [2022-04-08 14:16:39,321 INFO L290 TraceCheckUtils]: 31: Hoare triple {7454#(<= ~counter~0 4)} assume !!(#t~post5 < 100);havoc #t~post5; {7454#(<= ~counter~0 4)} is VALID [2022-04-08 14:16:39,321 INFO L272 TraceCheckUtils]: 32: Hoare triple {7454#(<= ~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)); {7454#(<= ~counter~0 4)} is VALID [2022-04-08 14:16:39,322 INFO L290 TraceCheckUtils]: 33: Hoare triple {7454#(<= ~counter~0 4)} ~cond := #in~cond; {7454#(<= ~counter~0 4)} is VALID [2022-04-08 14:16:39,322 INFO L290 TraceCheckUtils]: 34: Hoare triple {7454#(<= ~counter~0 4)} assume !(0 == ~cond); {7454#(<= ~counter~0 4)} is VALID [2022-04-08 14:16:39,322 INFO L290 TraceCheckUtils]: 35: Hoare triple {7454#(<= ~counter~0 4)} assume true; {7454#(<= ~counter~0 4)} is VALID [2022-04-08 14:16:39,323 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {7454#(<= ~counter~0 4)} {7454#(<= ~counter~0 4)} #51#return; {7454#(<= ~counter~0 4)} is VALID [2022-04-08 14:16:39,323 INFO L290 TraceCheckUtils]: 37: Hoare triple {7454#(<= ~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; {7454#(<= ~counter~0 4)} is VALID [2022-04-08 14:16:39,324 INFO L290 TraceCheckUtils]: 38: Hoare triple {7454#(<= ~counter~0 4)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {7479#(<= ~counter~0 5)} is VALID [2022-04-08 14:16:39,324 INFO L290 TraceCheckUtils]: 39: Hoare triple {7479#(<= ~counter~0 5)} assume !!(#t~post5 < 100);havoc #t~post5; {7479#(<= ~counter~0 5)} is VALID [2022-04-08 14:16:39,325 INFO L272 TraceCheckUtils]: 40: Hoare triple {7479#(<= ~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)); {7479#(<= ~counter~0 5)} is VALID [2022-04-08 14:16:39,325 INFO L290 TraceCheckUtils]: 41: Hoare triple {7479#(<= ~counter~0 5)} ~cond := #in~cond; {7479#(<= ~counter~0 5)} is VALID [2022-04-08 14:16:39,325 INFO L290 TraceCheckUtils]: 42: Hoare triple {7479#(<= ~counter~0 5)} assume !(0 == ~cond); {7479#(<= ~counter~0 5)} is VALID [2022-04-08 14:16:39,326 INFO L290 TraceCheckUtils]: 43: Hoare triple {7479#(<= ~counter~0 5)} assume true; {7479#(<= ~counter~0 5)} is VALID [2022-04-08 14:16:39,326 INFO L284 TraceCheckUtils]: 44: Hoare quadruple {7479#(<= ~counter~0 5)} {7479#(<= ~counter~0 5)} #51#return; {7479#(<= ~counter~0 5)} is VALID [2022-04-08 14:16:39,327 INFO L290 TraceCheckUtils]: 45: Hoare triple {7479#(<= ~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; {7479#(<= ~counter~0 5)} is VALID [2022-04-08 14:16:39,327 INFO L290 TraceCheckUtils]: 46: Hoare triple {7479#(<= ~counter~0 5)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {7504#(<= ~counter~0 6)} is VALID [2022-04-08 14:16:39,328 INFO L290 TraceCheckUtils]: 47: Hoare triple {7504#(<= ~counter~0 6)} assume !!(#t~post5 < 100);havoc #t~post5; {7504#(<= ~counter~0 6)} is VALID [2022-04-08 14:16:39,328 INFO L272 TraceCheckUtils]: 48: Hoare triple {7504#(<= ~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)); {7504#(<= ~counter~0 6)} is VALID [2022-04-08 14:16:39,329 INFO L290 TraceCheckUtils]: 49: Hoare triple {7504#(<= ~counter~0 6)} ~cond := #in~cond; {7504#(<= ~counter~0 6)} is VALID [2022-04-08 14:16:39,329 INFO L290 TraceCheckUtils]: 50: Hoare triple {7504#(<= ~counter~0 6)} assume !(0 == ~cond); {7504#(<= ~counter~0 6)} is VALID [2022-04-08 14:16:39,329 INFO L290 TraceCheckUtils]: 51: Hoare triple {7504#(<= ~counter~0 6)} assume true; {7504#(<= ~counter~0 6)} is VALID [2022-04-08 14:16:39,330 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {7504#(<= ~counter~0 6)} {7504#(<= ~counter~0 6)} #51#return; {7504#(<= ~counter~0 6)} is VALID [2022-04-08 14:16:39,330 INFO L290 TraceCheckUtils]: 53: Hoare triple {7504#(<= ~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; {7504#(<= ~counter~0 6)} is VALID [2022-04-08 14:16:39,331 INFO L290 TraceCheckUtils]: 54: Hoare triple {7504#(<= ~counter~0 6)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {7529#(<= ~counter~0 7)} is VALID [2022-04-08 14:16:39,331 INFO L290 TraceCheckUtils]: 55: Hoare triple {7529#(<= ~counter~0 7)} assume !!(#t~post5 < 100);havoc #t~post5; {7529#(<= ~counter~0 7)} is VALID [2022-04-08 14:16:39,331 INFO L272 TraceCheckUtils]: 56: Hoare triple {7529#(<= ~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)); {7529#(<= ~counter~0 7)} is VALID [2022-04-08 14:16:39,332 INFO L290 TraceCheckUtils]: 57: Hoare triple {7529#(<= ~counter~0 7)} ~cond := #in~cond; {7529#(<= ~counter~0 7)} is VALID [2022-04-08 14:16:39,332 INFO L290 TraceCheckUtils]: 58: Hoare triple {7529#(<= ~counter~0 7)} assume !(0 == ~cond); {7529#(<= ~counter~0 7)} is VALID [2022-04-08 14:16:39,332 INFO L290 TraceCheckUtils]: 59: Hoare triple {7529#(<= ~counter~0 7)} assume true; {7529#(<= ~counter~0 7)} is VALID [2022-04-08 14:16:39,333 INFO L284 TraceCheckUtils]: 60: Hoare quadruple {7529#(<= ~counter~0 7)} {7529#(<= ~counter~0 7)} #51#return; {7529#(<= ~counter~0 7)} is VALID [2022-04-08 14:16:39,333 INFO L290 TraceCheckUtils]: 61: Hoare triple {7529#(<= ~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; {7529#(<= ~counter~0 7)} is VALID [2022-04-08 14:16:39,334 INFO L290 TraceCheckUtils]: 62: Hoare triple {7529#(<= ~counter~0 7)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {7554#(<= |main_#t~post5| 7)} is VALID [2022-04-08 14:16:39,334 INFO L290 TraceCheckUtils]: 63: Hoare triple {7554#(<= |main_#t~post5| 7)} assume !(#t~post5 < 100);havoc #t~post5; {7356#false} is VALID [2022-04-08 14:16:39,334 INFO L272 TraceCheckUtils]: 64: Hoare triple {7356#false} call __VERIFIER_assert((if 0 == ~k~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {7356#false} is VALID [2022-04-08 14:16:39,334 INFO L290 TraceCheckUtils]: 65: Hoare triple {7356#false} ~cond := #in~cond; {7356#false} is VALID [2022-04-08 14:16:39,334 INFO L290 TraceCheckUtils]: 66: Hoare triple {7356#false} assume 0 == ~cond; {7356#false} is VALID [2022-04-08 14:16:39,334 INFO L290 TraceCheckUtils]: 67: Hoare triple {7356#false} assume !false; {7356#false} is VALID [2022-04-08 14:16:39,335 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-08 14:16:39,335 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 14:16:39,739 INFO L290 TraceCheckUtils]: 67: Hoare triple {7356#false} assume !false; {7356#false} is VALID [2022-04-08 14:16:39,739 INFO L290 TraceCheckUtils]: 66: Hoare triple {7356#false} assume 0 == ~cond; {7356#false} is VALID [2022-04-08 14:16:39,740 INFO L290 TraceCheckUtils]: 65: Hoare triple {7356#false} ~cond := #in~cond; {7356#false} is VALID [2022-04-08 14:16:39,740 INFO L272 TraceCheckUtils]: 64: Hoare triple {7356#false} call __VERIFIER_assert((if 0 == ~k~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {7356#false} is VALID [2022-04-08 14:16:39,744 INFO L290 TraceCheckUtils]: 63: Hoare triple {7582#(< |main_#t~post5| 100)} assume !(#t~post5 < 100);havoc #t~post5; {7356#false} is VALID [2022-04-08 14:16:39,744 INFO L290 TraceCheckUtils]: 62: Hoare triple {7586#(< ~counter~0 100)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {7582#(< |main_#t~post5| 100)} is VALID [2022-04-08 14:16:39,744 INFO L290 TraceCheckUtils]: 61: Hoare triple {7586#(< ~counter~0 100)} 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; {7586#(< ~counter~0 100)} is VALID [2022-04-08 14:16:39,745 INFO L284 TraceCheckUtils]: 60: Hoare quadruple {7355#true} {7586#(< ~counter~0 100)} #51#return; {7586#(< ~counter~0 100)} is VALID [2022-04-08 14:16:39,745 INFO L290 TraceCheckUtils]: 59: Hoare triple {7355#true} assume true; {7355#true} is VALID [2022-04-08 14:16:39,745 INFO L290 TraceCheckUtils]: 58: Hoare triple {7355#true} assume !(0 == ~cond); {7355#true} is VALID [2022-04-08 14:16:39,745 INFO L290 TraceCheckUtils]: 57: Hoare triple {7355#true} ~cond := #in~cond; {7355#true} is VALID [2022-04-08 14:16:39,745 INFO L272 TraceCheckUtils]: 56: Hoare triple {7586#(< ~counter~0 100)} 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)); {7355#true} is VALID [2022-04-08 14:16:39,745 INFO L290 TraceCheckUtils]: 55: Hoare triple {7586#(< ~counter~0 100)} assume !!(#t~post5 < 100);havoc #t~post5; {7586#(< ~counter~0 100)} is VALID [2022-04-08 14:16:39,746 INFO L290 TraceCheckUtils]: 54: Hoare triple {7611#(< ~counter~0 99)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {7586#(< ~counter~0 100)} is VALID [2022-04-08 14:16:39,746 INFO L290 TraceCheckUtils]: 53: Hoare triple {7611#(< ~counter~0 99)} 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; {7611#(< ~counter~0 99)} is VALID [2022-04-08 14:16:39,746 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {7355#true} {7611#(< ~counter~0 99)} #51#return; {7611#(< ~counter~0 99)} is VALID [2022-04-08 14:16:39,747 INFO L290 TraceCheckUtils]: 51: Hoare triple {7355#true} assume true; {7355#true} is VALID [2022-04-08 14:16:39,747 INFO L290 TraceCheckUtils]: 50: Hoare triple {7355#true} assume !(0 == ~cond); {7355#true} is VALID [2022-04-08 14:16:39,747 INFO L290 TraceCheckUtils]: 49: Hoare triple {7355#true} ~cond := #in~cond; {7355#true} is VALID [2022-04-08 14:16:39,747 INFO L272 TraceCheckUtils]: 48: Hoare triple {7611#(< ~counter~0 99)} 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)); {7355#true} is VALID [2022-04-08 14:16:39,747 INFO L290 TraceCheckUtils]: 47: Hoare triple {7611#(< ~counter~0 99)} assume !!(#t~post5 < 100);havoc #t~post5; {7611#(< ~counter~0 99)} is VALID [2022-04-08 14:16:39,747 INFO L290 TraceCheckUtils]: 46: Hoare triple {7636#(< ~counter~0 98)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {7611#(< ~counter~0 99)} is VALID [2022-04-08 14:16:39,748 INFO L290 TraceCheckUtils]: 45: Hoare triple {7636#(< ~counter~0 98)} 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; {7636#(< ~counter~0 98)} is VALID [2022-04-08 14:16:39,748 INFO L284 TraceCheckUtils]: 44: Hoare quadruple {7355#true} {7636#(< ~counter~0 98)} #51#return; {7636#(< ~counter~0 98)} is VALID [2022-04-08 14:16:39,748 INFO L290 TraceCheckUtils]: 43: Hoare triple {7355#true} assume true; {7355#true} is VALID [2022-04-08 14:16:39,748 INFO L290 TraceCheckUtils]: 42: Hoare triple {7355#true} assume !(0 == ~cond); {7355#true} is VALID [2022-04-08 14:16:39,748 INFO L290 TraceCheckUtils]: 41: Hoare triple {7355#true} ~cond := #in~cond; {7355#true} is VALID [2022-04-08 14:16:39,748 INFO L272 TraceCheckUtils]: 40: Hoare triple {7636#(< ~counter~0 98)} 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)); {7355#true} is VALID [2022-04-08 14:16:39,749 INFO L290 TraceCheckUtils]: 39: Hoare triple {7636#(< ~counter~0 98)} assume !!(#t~post5 < 100);havoc #t~post5; {7636#(< ~counter~0 98)} is VALID [2022-04-08 14:16:39,749 INFO L290 TraceCheckUtils]: 38: Hoare triple {7661#(< ~counter~0 97)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {7636#(< ~counter~0 98)} is VALID [2022-04-08 14:16:39,749 INFO L290 TraceCheckUtils]: 37: Hoare triple {7661#(< ~counter~0 97)} 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; {7661#(< ~counter~0 97)} is VALID [2022-04-08 14:16:39,750 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {7355#true} {7661#(< ~counter~0 97)} #51#return; {7661#(< ~counter~0 97)} is VALID [2022-04-08 14:16:39,750 INFO L290 TraceCheckUtils]: 35: Hoare triple {7355#true} assume true; {7355#true} is VALID [2022-04-08 14:16:39,750 INFO L290 TraceCheckUtils]: 34: Hoare triple {7355#true} assume !(0 == ~cond); {7355#true} is VALID [2022-04-08 14:16:39,750 INFO L290 TraceCheckUtils]: 33: Hoare triple {7355#true} ~cond := #in~cond; {7355#true} is VALID [2022-04-08 14:16:39,750 INFO L272 TraceCheckUtils]: 32: Hoare triple {7661#(< ~counter~0 97)} 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)); {7355#true} is VALID [2022-04-08 14:16:39,750 INFO L290 TraceCheckUtils]: 31: Hoare triple {7661#(< ~counter~0 97)} assume !!(#t~post5 < 100);havoc #t~post5; {7661#(< ~counter~0 97)} is VALID [2022-04-08 14:16:39,751 INFO L290 TraceCheckUtils]: 30: Hoare triple {7686#(< ~counter~0 96)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {7661#(< ~counter~0 97)} is VALID [2022-04-08 14:16:39,751 INFO L290 TraceCheckUtils]: 29: Hoare triple {7686#(< ~counter~0 96)} 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 96)} is VALID [2022-04-08 14:16:39,751 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {7355#true} {7686#(< ~counter~0 96)} #51#return; {7686#(< ~counter~0 96)} is VALID [2022-04-08 14:16:39,752 INFO L290 TraceCheckUtils]: 27: Hoare triple {7355#true} assume true; {7355#true} is VALID [2022-04-08 14:16:39,752 INFO L290 TraceCheckUtils]: 26: Hoare triple {7355#true} assume !(0 == ~cond); {7355#true} is VALID [2022-04-08 14:16:39,752 INFO L290 TraceCheckUtils]: 25: Hoare triple {7355#true} ~cond := #in~cond; {7355#true} is VALID [2022-04-08 14:16:39,752 INFO L272 TraceCheckUtils]: 24: Hoare triple {7686#(< ~counter~0 96)} 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)); {7355#true} is VALID [2022-04-08 14:16:39,752 INFO L290 TraceCheckUtils]: 23: Hoare triple {7686#(< ~counter~0 96)} assume !!(#t~post5 < 100);havoc #t~post5; {7686#(< ~counter~0 96)} is VALID [2022-04-08 14:16:39,752 INFO L290 TraceCheckUtils]: 22: Hoare triple {7711#(< ~counter~0 95)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {7686#(< ~counter~0 96)} is VALID [2022-04-08 14:16:39,753 INFO L290 TraceCheckUtils]: 21: Hoare triple {7711#(< ~counter~0 95)} 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 95)} is VALID [2022-04-08 14:16:39,753 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {7355#true} {7711#(< ~counter~0 95)} #51#return; {7711#(< ~counter~0 95)} is VALID [2022-04-08 14:16:39,753 INFO L290 TraceCheckUtils]: 19: Hoare triple {7355#true} assume true; {7355#true} is VALID [2022-04-08 14:16:39,753 INFO L290 TraceCheckUtils]: 18: Hoare triple {7355#true} assume !(0 == ~cond); {7355#true} is VALID [2022-04-08 14:16:39,753 INFO L290 TraceCheckUtils]: 17: Hoare triple {7355#true} ~cond := #in~cond; {7355#true} is VALID [2022-04-08 14:16:39,753 INFO L272 TraceCheckUtils]: 16: Hoare triple {7711#(< ~counter~0 95)} 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)); {7355#true} is VALID [2022-04-08 14:16:39,754 INFO L290 TraceCheckUtils]: 15: Hoare triple {7711#(< ~counter~0 95)} assume !!(#t~post5 < 100);havoc #t~post5; {7711#(< ~counter~0 95)} is VALID [2022-04-08 14:16:39,754 INFO L290 TraceCheckUtils]: 14: Hoare triple {7736#(< ~counter~0 94)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {7711#(< ~counter~0 95)} is VALID [2022-04-08 14:16:39,754 INFO L290 TraceCheckUtils]: 13: Hoare triple {7736#(< ~counter~0 94)} 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 94)} is VALID [2022-04-08 14:16:39,755 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {7355#true} {7736#(< ~counter~0 94)} #51#return; {7736#(< ~counter~0 94)} is VALID [2022-04-08 14:16:39,755 INFO L290 TraceCheckUtils]: 11: Hoare triple {7355#true} assume true; {7355#true} is VALID [2022-04-08 14:16:39,755 INFO L290 TraceCheckUtils]: 10: Hoare triple {7355#true} assume !(0 == ~cond); {7355#true} is VALID [2022-04-08 14:16:39,755 INFO L290 TraceCheckUtils]: 9: Hoare triple {7355#true} ~cond := #in~cond; {7355#true} is VALID [2022-04-08 14:16:39,755 INFO L272 TraceCheckUtils]: 8: Hoare triple {7736#(< ~counter~0 94)} 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)); {7355#true} is VALID [2022-04-08 14:16:39,755 INFO L290 TraceCheckUtils]: 7: Hoare triple {7736#(< ~counter~0 94)} assume !!(#t~post5 < 100);havoc #t~post5; {7736#(< ~counter~0 94)} is VALID [2022-04-08 14:16:39,756 INFO L290 TraceCheckUtils]: 6: Hoare triple {7761#(< ~counter~0 93)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {7736#(< ~counter~0 94)} is VALID [2022-04-08 14:16:39,756 INFO L290 TraceCheckUtils]: 5: Hoare triple {7761#(< ~counter~0 93)} 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; {7761#(< ~counter~0 93)} is VALID [2022-04-08 14:16:39,756 INFO L272 TraceCheckUtils]: 4: Hoare triple {7761#(< ~counter~0 93)} call #t~ret6 := main(); {7761#(< ~counter~0 93)} is VALID [2022-04-08 14:16:39,757 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7761#(< ~counter~0 93)} {7355#true} #57#return; {7761#(< ~counter~0 93)} is VALID [2022-04-08 14:16:39,757 INFO L290 TraceCheckUtils]: 2: Hoare triple {7761#(< ~counter~0 93)} assume true; {7761#(< ~counter~0 93)} is VALID [2022-04-08 14:16:39,757 INFO L290 TraceCheckUtils]: 1: Hoare triple {7355#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; {7761#(< ~counter~0 93)} is VALID [2022-04-08 14:16:39,757 INFO L272 TraceCheckUtils]: 0: Hoare triple {7355#true} call ULTIMATE.init(); {7355#true} is VALID [2022-04-08 14:16:39,758 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-08 14:16:39,758 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 14:16:39,758 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1882296458] [2022-04-08 14:16:39,758 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 14:16:39,758 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1666019728] [2022-04-08 14:16:39,758 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1666019728] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 14:16:39,758 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-08 14:16:39,758 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 20 [2022-04-08 14:16:39,758 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 14:16:39,758 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1002517707] [2022-04-08 14:16:39,758 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1002517707] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 14:16:39,759 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 14:16:39,759 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-04-08 14:16:39,759 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [599778230] [2022-04-08 14:16:39,759 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 14:16:39,759 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-08 14:16:39,759 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 14:16:39,760 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-08 14:16:39,817 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-08 14:16:39,817 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-04-08 14:16:39,817 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 14:16:39,818 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-04-08 14:16:39,818 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=158, Invalid=222, Unknown=0, NotChecked=0, Total=380 [2022-04-08 14:16:39,818 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-08 14:16:40,098 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:16:40,098 INFO L93 Difference]: Finished difference Result 82 states and 83 transitions. [2022-04-08 14:16:40,099 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-04-08 14:16:40,099 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-08 14:16:40,099 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 14:16:40,099 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-08 14:16:40,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 82 transitions. [2022-04-08 14:16:40,101 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-08 14:16:40,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 82 transitions. [2022-04-08 14:16:40,103 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 18 states and 82 transitions. [2022-04-08 14:16:40,172 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-08 14:16:40,173 INFO L225 Difference]: With dead ends: 82 [2022-04-08 14:16:40,173 INFO L226 Difference]: Without dead ends: 77 [2022-04-08 14:16:40,174 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-08 14:16:40,174 INFO L913 BasicCegarLoop]: 24 mSDtfsCounter, 4 mSDsluCounter, 77 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 101 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-08 14:16:40,174 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [4 Valid, 101 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-08 14:16:40,175 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2022-04-08 14:16:40,265 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 77. [2022-04-08 14:16:40,265 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 14:16:40,265 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-08 14:16:40,265 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-08 14:16:40,266 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-08 14:16:40,267 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:16:40,267 INFO L93 Difference]: Finished difference Result 77 states and 78 transitions. [2022-04-08 14:16:40,267 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 78 transitions. [2022-04-08 14:16:40,267 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 14:16:40,267 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 14:16:40,267 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-08 14:16:40,268 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-08 14:16:40,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:16:40,269 INFO L93 Difference]: Finished difference Result 77 states and 78 transitions. [2022-04-08 14:16:40,269 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 78 transitions. [2022-04-08 14:16:40,269 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 14:16:40,269 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 14:16:40,269 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 14:16:40,269 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 14:16:40,269 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-08 14:16:40,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 78 transitions. [2022-04-08 14:16:40,271 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 78 transitions. Word has length 68 [2022-04-08 14:16:40,271 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 14:16:40,271 INFO L478 AbstractCegarLoop]: Abstraction has 77 states and 78 transitions. [2022-04-08 14:16:40,271 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-08 14:16:40,271 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 77 states and 78 transitions. [2022-04-08 14:16:40,366 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 78 edges. 78 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 14:16:40,366 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 78 transitions. [2022-04-08 14:16:40,366 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2022-04-08 14:16:40,366 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 14:16:40,366 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-08 14:16:40,382 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Ended with exit code 0 [2022-04-08 14:16:40,567 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2022-04-08 14:16:40,567 INFO L403 AbstractCegarLoop]: === Iteration 18 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 14:16:40,567 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 14:16:40,568 INFO L85 PathProgramCache]: Analyzing trace with hash -763940164, now seen corresponding path program 13 times [2022-04-08 14:16:40,568 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 14:16:40,568 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [390486926] [2022-04-08 14:16:40,642 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 14:16:40,642 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 14:16:40,642 INFO L85 PathProgramCache]: Analyzing trace with hash -763940164, now seen corresponding path program 14 times [2022-04-08 14:16:40,642 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 14:16:40,642 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1686913373] [2022-04-08 14:16:40,642 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 14:16:40,643 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 14:16:40,656 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 14:16:40,656 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1744772099] [2022-04-08 14:16:40,656 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 14:16:40,656 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 14:16:40,656 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 14:16:40,657 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 14:16:40,658 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2022-04-08 14:16:41,066 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 14:16:41,067 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 14:16:41,068 INFO L263 TraceCheckSpWp]: Trace formula consists of 228 conjuncts, 36 conjunts are in the unsatisfiable core [2022-04-08 14:16:41,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 14:16:41,082 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 14:16:41,530 INFO L272 TraceCheckUtils]: 0: Hoare triple {8268#true} call ULTIMATE.init(); {8268#true} is VALID [2022-04-08 14:16:41,530 INFO L290 TraceCheckUtils]: 1: Hoare triple {8268#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; {8268#true} is VALID [2022-04-08 14:16:41,530 INFO L290 TraceCheckUtils]: 2: Hoare triple {8268#true} assume true; {8268#true} is VALID [2022-04-08 14:16:41,530 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {8268#true} {8268#true} #57#return; {8268#true} is VALID [2022-04-08 14:16:41,530 INFO L272 TraceCheckUtils]: 4: Hoare triple {8268#true} call #t~ret6 := main(); {8268#true} is VALID [2022-04-08 14:16:41,530 INFO L290 TraceCheckUtils]: 5: Hoare triple {8268#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; {8288#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-08 14:16:41,531 INFO L290 TraceCheckUtils]: 6: Hoare triple {8288#(and (= main_~c~0 0) (= main_~y~0 0))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {8288#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-08 14:16:41,531 INFO L290 TraceCheckUtils]: 7: Hoare triple {8288#(and (= main_~c~0 0) (= main_~y~0 0))} assume !!(#t~post5 < 100);havoc #t~post5; {8288#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-08 14:16:41,531 INFO L272 TraceCheckUtils]: 8: Hoare triple {8288#(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)); {8268#true} is VALID [2022-04-08 14:16:41,531 INFO L290 TraceCheckUtils]: 9: Hoare triple {8268#true} ~cond := #in~cond; {8268#true} is VALID [2022-04-08 14:16:41,531 INFO L290 TraceCheckUtils]: 10: Hoare triple {8268#true} assume !(0 == ~cond); {8268#true} is VALID [2022-04-08 14:16:41,531 INFO L290 TraceCheckUtils]: 11: Hoare triple {8268#true} assume true; {8268#true} is VALID [2022-04-08 14:16:41,532 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {8268#true} {8288#(and (= main_~c~0 0) (= main_~y~0 0))} #51#return; {8288#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-08 14:16:41,532 INFO L290 TraceCheckUtils]: 13: Hoare triple {8288#(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; {8313#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} is VALID [2022-04-08 14:16:41,533 INFO L290 TraceCheckUtils]: 14: Hoare triple {8313#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {8313#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} is VALID [2022-04-08 14:16:41,533 INFO L290 TraceCheckUtils]: 15: Hoare triple {8313#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} assume !!(#t~post5 < 100);havoc #t~post5; {8313#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} is VALID [2022-04-08 14:16:41,533 INFO L272 TraceCheckUtils]: 16: Hoare triple {8313#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~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)); {8268#true} is VALID [2022-04-08 14:16:41,533 INFO L290 TraceCheckUtils]: 17: Hoare triple {8268#true} ~cond := #in~cond; {8268#true} is VALID [2022-04-08 14:16:41,533 INFO L290 TraceCheckUtils]: 18: Hoare triple {8268#true} assume !(0 == ~cond); {8268#true} is VALID [2022-04-08 14:16:41,533 INFO L290 TraceCheckUtils]: 19: Hoare triple {8268#true} assume true; {8268#true} is VALID [2022-04-08 14:16:41,534 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {8268#true} {8313#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} #51#return; {8313#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} is VALID [2022-04-08 14:16:41,534 INFO L290 TraceCheckUtils]: 21: Hoare triple {8313#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {8338#(and (= main_~y~0 2) (= 0 (+ (- 2) main_~c~0)))} is VALID [2022-04-08 14:16:41,534 INFO L290 TraceCheckUtils]: 22: Hoare triple {8338#(and (= main_~y~0 2) (= 0 (+ (- 2) main_~c~0)))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {8338#(and (= main_~y~0 2) (= 0 (+ (- 2) main_~c~0)))} is VALID [2022-04-08 14:16:41,535 INFO L290 TraceCheckUtils]: 23: Hoare triple {8338#(and (= main_~y~0 2) (= 0 (+ (- 2) main_~c~0)))} assume !!(#t~post5 < 100);havoc #t~post5; {8338#(and (= main_~y~0 2) (= 0 (+ (- 2) main_~c~0)))} is VALID [2022-04-08 14:16:41,535 INFO L272 TraceCheckUtils]: 24: Hoare triple {8338#(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)); {8268#true} is VALID [2022-04-08 14:16:41,535 INFO L290 TraceCheckUtils]: 25: Hoare triple {8268#true} ~cond := #in~cond; {8268#true} is VALID [2022-04-08 14:16:41,535 INFO L290 TraceCheckUtils]: 26: Hoare triple {8268#true} assume !(0 == ~cond); {8268#true} is VALID [2022-04-08 14:16:41,535 INFO L290 TraceCheckUtils]: 27: Hoare triple {8268#true} assume true; {8268#true} is VALID [2022-04-08 14:16:41,535 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {8268#true} {8338#(and (= main_~y~0 2) (= 0 (+ (- 2) main_~c~0)))} #51#return; {8338#(and (= main_~y~0 2) (= 0 (+ (- 2) main_~c~0)))} is VALID [2022-04-08 14:16:41,536 INFO L290 TraceCheckUtils]: 29: Hoare triple {8338#(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; {8363#(and (= 2 (+ (- 1) main_~y~0)) (= (+ main_~c~0 (- 3)) 0))} is VALID [2022-04-08 14:16:41,536 INFO L290 TraceCheckUtils]: 30: Hoare triple {8363#(and (= 2 (+ (- 1) main_~y~0)) (= (+ main_~c~0 (- 3)) 0))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {8363#(and (= 2 (+ (- 1) main_~y~0)) (= (+ main_~c~0 (- 3)) 0))} is VALID [2022-04-08 14:16:41,539 INFO L290 TraceCheckUtils]: 31: Hoare triple {8363#(and (= 2 (+ (- 1) main_~y~0)) (= (+ main_~c~0 (- 3)) 0))} assume !!(#t~post5 < 100);havoc #t~post5; {8363#(and (= 2 (+ (- 1) main_~y~0)) (= (+ main_~c~0 (- 3)) 0))} is VALID [2022-04-08 14:16:41,539 INFO L272 TraceCheckUtils]: 32: Hoare triple {8363#(and (= 2 (+ (- 1) main_~y~0)) (= (+ main_~c~0 (- 3)) 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)); {8268#true} is VALID [2022-04-08 14:16:41,539 INFO L290 TraceCheckUtils]: 33: Hoare triple {8268#true} ~cond := #in~cond; {8268#true} is VALID [2022-04-08 14:16:41,539 INFO L290 TraceCheckUtils]: 34: Hoare triple {8268#true} assume !(0 == ~cond); {8268#true} is VALID [2022-04-08 14:16:41,540 INFO L290 TraceCheckUtils]: 35: Hoare triple {8268#true} assume true; {8268#true} is VALID [2022-04-08 14:16:41,540 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {8268#true} {8363#(and (= 2 (+ (- 1) main_~y~0)) (= (+ main_~c~0 (- 3)) 0))} #51#return; {8363#(and (= 2 (+ (- 1) main_~y~0)) (= (+ main_~c~0 (- 3)) 0))} is VALID [2022-04-08 14:16:41,541 INFO L290 TraceCheckUtils]: 37: Hoare triple {8363#(and (= 2 (+ (- 1) main_~y~0)) (= (+ main_~c~0 (- 3)) 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; {8388#(and (= main_~c~0 4) (= (+ (- 2) main_~y~0) 2))} is VALID [2022-04-08 14:16:41,541 INFO L290 TraceCheckUtils]: 38: Hoare triple {8388#(and (= main_~c~0 4) (= (+ (- 2) main_~y~0) 2))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {8388#(and (= main_~c~0 4) (= (+ (- 2) main_~y~0) 2))} is VALID [2022-04-08 14:16:41,542 INFO L290 TraceCheckUtils]: 39: Hoare triple {8388#(and (= main_~c~0 4) (= (+ (- 2) main_~y~0) 2))} assume !!(#t~post5 < 100);havoc #t~post5; {8388#(and (= main_~c~0 4) (= (+ (- 2) main_~y~0) 2))} is VALID [2022-04-08 14:16:41,542 INFO L272 TraceCheckUtils]: 40: Hoare triple {8388#(and (= main_~c~0 4) (= (+ (- 2) main_~y~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)); {8268#true} is VALID [2022-04-08 14:16:41,542 INFO L290 TraceCheckUtils]: 41: Hoare triple {8268#true} ~cond := #in~cond; {8268#true} is VALID [2022-04-08 14:16:41,542 INFO L290 TraceCheckUtils]: 42: Hoare triple {8268#true} assume !(0 == ~cond); {8268#true} is VALID [2022-04-08 14:16:41,542 INFO L290 TraceCheckUtils]: 43: Hoare triple {8268#true} assume true; {8268#true} is VALID [2022-04-08 14:16:41,543 INFO L284 TraceCheckUtils]: 44: Hoare quadruple {8268#true} {8388#(and (= main_~c~0 4) (= (+ (- 2) main_~y~0) 2))} #51#return; {8388#(and (= main_~c~0 4) (= (+ (- 2) main_~y~0) 2))} is VALID [2022-04-08 14:16:41,543 INFO L290 TraceCheckUtils]: 45: Hoare triple {8388#(and (= main_~c~0 4) (= (+ (- 2) main_~y~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; {8413#(and (= 5 main_~c~0) (= 5 main_~y~0))} is VALID [2022-04-08 14:16:41,543 INFO L290 TraceCheckUtils]: 46: Hoare triple {8413#(and (= 5 main_~c~0) (= 5 main_~y~0))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {8413#(and (= 5 main_~c~0) (= 5 main_~y~0))} is VALID [2022-04-08 14:16:41,544 INFO L290 TraceCheckUtils]: 47: Hoare triple {8413#(and (= 5 main_~c~0) (= 5 main_~y~0))} assume !!(#t~post5 < 100);havoc #t~post5; {8413#(and (= 5 main_~c~0) (= 5 main_~y~0))} is VALID [2022-04-08 14:16:41,544 INFO L272 TraceCheckUtils]: 48: Hoare triple {8413#(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)); {8268#true} is VALID [2022-04-08 14:16:41,544 INFO L290 TraceCheckUtils]: 49: Hoare triple {8268#true} ~cond := #in~cond; {8268#true} is VALID [2022-04-08 14:16:41,544 INFO L290 TraceCheckUtils]: 50: Hoare triple {8268#true} assume !(0 == ~cond); {8268#true} is VALID [2022-04-08 14:16:41,544 INFO L290 TraceCheckUtils]: 51: Hoare triple {8268#true} assume true; {8268#true} is VALID [2022-04-08 14:16:41,545 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {8268#true} {8413#(and (= 5 main_~c~0) (= 5 main_~y~0))} #51#return; {8413#(and (= 5 main_~c~0) (= 5 main_~y~0))} is VALID [2022-04-08 14:16:41,545 INFO L290 TraceCheckUtils]: 53: Hoare triple {8413#(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; {8438#(and (= main_~y~0 6) (= (+ (- 1) main_~c~0) 5))} is VALID [2022-04-08 14:16:41,546 INFO L290 TraceCheckUtils]: 54: Hoare triple {8438#(and (= main_~y~0 6) (= (+ (- 1) main_~c~0) 5))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {8438#(and (= main_~y~0 6) (= (+ (- 1) main_~c~0) 5))} is VALID [2022-04-08 14:16:41,546 INFO L290 TraceCheckUtils]: 55: Hoare triple {8438#(and (= main_~y~0 6) (= (+ (- 1) main_~c~0) 5))} assume !!(#t~post5 < 100);havoc #t~post5; {8438#(and (= main_~y~0 6) (= (+ (- 1) main_~c~0) 5))} is VALID [2022-04-08 14:16:41,546 INFO L272 TraceCheckUtils]: 56: Hoare triple {8438#(and (= main_~y~0 6) (= (+ (- 1) main_~c~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)); {8268#true} is VALID [2022-04-08 14:16:41,546 INFO L290 TraceCheckUtils]: 57: Hoare triple {8268#true} ~cond := #in~cond; {8268#true} is VALID [2022-04-08 14:16:41,547 INFO L290 TraceCheckUtils]: 58: Hoare triple {8268#true} assume !(0 == ~cond); {8268#true} is VALID [2022-04-08 14:16:41,547 INFO L290 TraceCheckUtils]: 59: Hoare triple {8268#true} assume true; {8268#true} is VALID [2022-04-08 14:16:41,547 INFO L284 TraceCheckUtils]: 60: Hoare quadruple {8268#true} {8438#(and (= main_~y~0 6) (= (+ (- 1) main_~c~0) 5))} #51#return; {8438#(and (= main_~y~0 6) (= (+ (- 1) main_~c~0) 5))} is VALID [2022-04-08 14:16:41,548 INFO L290 TraceCheckUtils]: 61: Hoare triple {8438#(and (= main_~y~0 6) (= (+ (- 1) main_~c~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; {8463#(and (<= main_~c~0 7) (= 7 main_~y~0) (< 6 main_~k~0))} is VALID [2022-04-08 14:16:41,548 INFO L290 TraceCheckUtils]: 62: Hoare triple {8463#(and (<= main_~c~0 7) (= 7 main_~y~0) (< 6 main_~k~0))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {8463#(and (<= main_~c~0 7) (= 7 main_~y~0) (< 6 main_~k~0))} is VALID [2022-04-08 14:16:41,549 INFO L290 TraceCheckUtils]: 63: Hoare triple {8463#(and (<= main_~c~0 7) (= 7 main_~y~0) (< 6 main_~k~0))} assume !!(#t~post5 < 100);havoc #t~post5; {8463#(and (<= main_~c~0 7) (= 7 main_~y~0) (< 6 main_~k~0))} is VALID [2022-04-08 14:16:41,549 INFO L272 TraceCheckUtils]: 64: Hoare triple {8463#(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)); {8268#true} is VALID [2022-04-08 14:16:41,549 INFO L290 TraceCheckUtils]: 65: Hoare triple {8268#true} ~cond := #in~cond; {8268#true} is VALID [2022-04-08 14:16:41,549 INFO L290 TraceCheckUtils]: 66: Hoare triple {8268#true} assume !(0 == ~cond); {8268#true} is VALID [2022-04-08 14:16:41,549 INFO L290 TraceCheckUtils]: 67: Hoare triple {8268#true} assume true; {8268#true} is VALID [2022-04-08 14:16:41,550 INFO L284 TraceCheckUtils]: 68: Hoare quadruple {8268#true} {8463#(and (<= main_~c~0 7) (= 7 main_~y~0) (< 6 main_~k~0))} #51#return; {8463#(and (<= main_~c~0 7) (= 7 main_~y~0) (< 6 main_~k~0))} is VALID [2022-04-08 14:16:41,550 INFO L290 TraceCheckUtils]: 69: Hoare triple {8463#(and (<= main_~c~0 7) (= 7 main_~y~0) (< 6 main_~k~0))} assume !(~c~0 < ~k~0); {8488#(and (<= main_~k~0 7) (= 7 main_~y~0) (< 6 main_~k~0))} is VALID [2022-04-08 14:16:41,551 INFO L272 TraceCheckUtils]: 70: Hoare triple {8488#(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)); {8492#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 14:16:41,552 INFO L290 TraceCheckUtils]: 71: Hoare triple {8492#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {8496#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 14:16:41,552 INFO L290 TraceCheckUtils]: 72: Hoare triple {8496#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {8269#false} is VALID [2022-04-08 14:16:41,552 INFO L290 TraceCheckUtils]: 73: Hoare triple {8269#false} assume !false; {8269#false} is VALID [2022-04-08 14:16:41,553 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-08 14:16:41,553 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 14:16:41,815 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 14:16:41,815 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1686913373] [2022-04-08 14:16:41,815 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 14:16:41,815 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1744772099] [2022-04-08 14:16:41,815 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1744772099] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 14:16:41,815 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-08 14:16:41,816 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2022-04-08 14:16:41,816 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 14:16:41,816 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [390486926] [2022-04-08 14:16:41,816 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [390486926] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 14:16:41,816 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 14:16:41,816 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-04-08 14:16:41,816 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [568542426] [2022-04-08 14:16:41,816 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 14:16:41,818 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-08 14:16:41,818 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 14:16:41,818 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-08 14:16:41,857 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-08 14:16:41,858 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-04-08 14:16:41,858 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 14:16:41,858 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-04-08 14:16:41,858 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=198, Unknown=0, NotChecked=0, Total=240 [2022-04-08 14:16:41,859 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-08 14:16:42,584 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:16:42,584 INFO L93 Difference]: Finished difference Result 84 states and 86 transitions. [2022-04-08 14:16:42,584 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-04-08 14:16:42,584 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-08 14:16:42,584 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 14:16:42,584 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-08 14:16:42,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 64 transitions. [2022-04-08 14:16:42,586 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-08 14:16:42,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 64 transitions. [2022-04-08 14:16:42,587 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 13 states and 64 transitions. [2022-04-08 14:16:42,632 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 64 edges. 64 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 14:16:42,633 INFO L225 Difference]: With dead ends: 84 [2022-04-08 14:16:42,634 INFO L226 Difference]: Without dead ends: 79 [2022-04-08 14:16:42,634 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 72 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=52, Invalid=254, Unknown=0, NotChecked=0, Total=306 [2022-04-08 14:16:42,634 INFO L913 BasicCegarLoop]: 46 mSDtfsCounter, 2 mSDsluCounter, 306 mSDsCounter, 0 mSdLazyCounter, 286 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s 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.3s IncrementalHoareTripleChecker+Time [2022-04-08 14:16:42,634 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.3s Time] [2022-04-08 14:16:42,635 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2022-04-08 14:16:42,733 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 79. [2022-04-08 14:16:42,733 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 14:16:42,733 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-08 14:16:42,734 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-08 14:16:42,734 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-08 14:16:42,735 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:16:42,735 INFO L93 Difference]: Finished difference Result 79 states and 81 transitions. [2022-04-08 14:16:42,735 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 81 transitions. [2022-04-08 14:16:42,735 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 14:16:42,735 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 14:16:42,735 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-08 14:16:42,736 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-08 14:16:42,737 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:16:42,737 INFO L93 Difference]: Finished difference Result 79 states and 81 transitions. [2022-04-08 14:16:42,737 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 81 transitions. [2022-04-08 14:16:42,737 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 14:16:42,737 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 14:16:42,737 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 14:16:42,737 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 14:16:42,738 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-08 14:16:42,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 81 transitions. [2022-04-08 14:16:42,739 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 81 transitions. Word has length 74 [2022-04-08 14:16:42,740 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 14:16:42,740 INFO L478 AbstractCegarLoop]: Abstraction has 79 states and 81 transitions. [2022-04-08 14:16:42,740 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-08 14:16:42,740 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 79 states and 81 transitions. [2022-04-08 14:16:42,846 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-08 14:16:42,847 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 81 transitions. [2022-04-08 14:16:42,847 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2022-04-08 14:16:42,847 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 14:16:42,847 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-08 14:16:42,854 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Forceful destruction successful, exit code 0 [2022-04-08 14:16:43,051 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2022-04-08 14:16:43,055 INFO L403 AbstractCegarLoop]: === Iteration 19 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 14:16:43,056 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 14:16:43,056 INFO L85 PathProgramCache]: Analyzing trace with hash 989539297, now seen corresponding path program 15 times [2022-04-08 14:16:43,056 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 14:16:43,056 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [529569724] [2022-04-08 14:16:43,144 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 14:16:43,144 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 14:16:43,145 INFO L85 PathProgramCache]: Analyzing trace with hash 989539297, now seen corresponding path program 16 times [2022-04-08 14:16:43,145 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 14:16:43,145 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [735095127] [2022-04-08 14:16:43,145 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 14:16:43,145 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 14:16:43,156 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 14:16:43,156 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1950227043] [2022-04-08 14:16:43,156 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-08 14:16:43,157 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 14:16:43,157 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 14:16:43,158 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 14:16:43,173 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2022-04-08 14:16:43,730 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-08 14:16:43,730 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 14:16:43,731 INFO L263 TraceCheckSpWp]: Trace formula consists of 239 conjuncts, 21 conjunts are in the unsatisfiable core [2022-04-08 14:16:43,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 14:16:43,749 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 14:16:44,149 INFO L272 TraceCheckUtils]: 0: Hoare triple {9035#true} call ULTIMATE.init(); {9035#true} is VALID [2022-04-08 14:16:44,150 INFO L290 TraceCheckUtils]: 1: Hoare triple {9035#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; {9043#(<= ~counter~0 0)} is VALID [2022-04-08 14:16:44,150 INFO L290 TraceCheckUtils]: 2: Hoare triple {9043#(<= ~counter~0 0)} assume true; {9043#(<= ~counter~0 0)} is VALID [2022-04-08 14:16:44,151 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {9043#(<= ~counter~0 0)} {9035#true} #57#return; {9043#(<= ~counter~0 0)} is VALID [2022-04-08 14:16:44,151 INFO L272 TraceCheckUtils]: 4: Hoare triple {9043#(<= ~counter~0 0)} call #t~ret6 := main(); {9043#(<= ~counter~0 0)} is VALID [2022-04-08 14:16:44,151 INFO L290 TraceCheckUtils]: 5: Hoare triple {9043#(<= ~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; {9043#(<= ~counter~0 0)} is VALID [2022-04-08 14:16:44,152 INFO L290 TraceCheckUtils]: 6: Hoare triple {9043#(<= ~counter~0 0)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {9059#(<= ~counter~0 1)} is VALID [2022-04-08 14:16:44,152 INFO L290 TraceCheckUtils]: 7: Hoare triple {9059#(<= ~counter~0 1)} assume !!(#t~post5 < 100);havoc #t~post5; {9059#(<= ~counter~0 1)} is VALID [2022-04-08 14:16:44,153 INFO L272 TraceCheckUtils]: 8: Hoare triple {9059#(<= ~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)); {9059#(<= ~counter~0 1)} is VALID [2022-04-08 14:16:44,153 INFO L290 TraceCheckUtils]: 9: Hoare triple {9059#(<= ~counter~0 1)} ~cond := #in~cond; {9059#(<= ~counter~0 1)} is VALID [2022-04-08 14:16:44,154 INFO L290 TraceCheckUtils]: 10: Hoare triple {9059#(<= ~counter~0 1)} assume !(0 == ~cond); {9059#(<= ~counter~0 1)} is VALID [2022-04-08 14:16:44,154 INFO L290 TraceCheckUtils]: 11: Hoare triple {9059#(<= ~counter~0 1)} assume true; {9059#(<= ~counter~0 1)} is VALID [2022-04-08 14:16:44,155 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {9059#(<= ~counter~0 1)} {9059#(<= ~counter~0 1)} #51#return; {9059#(<= ~counter~0 1)} is VALID [2022-04-08 14:16:44,155 INFO L290 TraceCheckUtils]: 13: Hoare triple {9059#(<= ~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; {9059#(<= ~counter~0 1)} is VALID [2022-04-08 14:16:44,155 INFO L290 TraceCheckUtils]: 14: Hoare triple {9059#(<= ~counter~0 1)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {9084#(<= ~counter~0 2)} is VALID [2022-04-08 14:16:44,156 INFO L290 TraceCheckUtils]: 15: Hoare triple {9084#(<= ~counter~0 2)} assume !!(#t~post5 < 100);havoc #t~post5; {9084#(<= ~counter~0 2)} is VALID [2022-04-08 14:16:44,156 INFO L272 TraceCheckUtils]: 16: Hoare triple {9084#(<= ~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)); {9084#(<= ~counter~0 2)} is VALID [2022-04-08 14:16:44,157 INFO L290 TraceCheckUtils]: 17: Hoare triple {9084#(<= ~counter~0 2)} ~cond := #in~cond; {9084#(<= ~counter~0 2)} is VALID [2022-04-08 14:16:44,157 INFO L290 TraceCheckUtils]: 18: Hoare triple {9084#(<= ~counter~0 2)} assume !(0 == ~cond); {9084#(<= ~counter~0 2)} is VALID [2022-04-08 14:16:44,157 INFO L290 TraceCheckUtils]: 19: Hoare triple {9084#(<= ~counter~0 2)} assume true; {9084#(<= ~counter~0 2)} is VALID [2022-04-08 14:16:44,158 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {9084#(<= ~counter~0 2)} {9084#(<= ~counter~0 2)} #51#return; {9084#(<= ~counter~0 2)} is VALID [2022-04-08 14:16:44,158 INFO L290 TraceCheckUtils]: 21: Hoare triple {9084#(<= ~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; {9084#(<= ~counter~0 2)} is VALID [2022-04-08 14:16:44,159 INFO L290 TraceCheckUtils]: 22: Hoare triple {9084#(<= ~counter~0 2)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {9109#(<= ~counter~0 3)} is VALID [2022-04-08 14:16:44,159 INFO L290 TraceCheckUtils]: 23: Hoare triple {9109#(<= ~counter~0 3)} assume !!(#t~post5 < 100);havoc #t~post5; {9109#(<= ~counter~0 3)} is VALID [2022-04-08 14:16:44,160 INFO L272 TraceCheckUtils]: 24: Hoare triple {9109#(<= ~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)); {9109#(<= ~counter~0 3)} is VALID [2022-04-08 14:16:44,160 INFO L290 TraceCheckUtils]: 25: Hoare triple {9109#(<= ~counter~0 3)} ~cond := #in~cond; {9109#(<= ~counter~0 3)} is VALID [2022-04-08 14:16:44,160 INFO L290 TraceCheckUtils]: 26: Hoare triple {9109#(<= ~counter~0 3)} assume !(0 == ~cond); {9109#(<= ~counter~0 3)} is VALID [2022-04-08 14:16:44,161 INFO L290 TraceCheckUtils]: 27: Hoare triple {9109#(<= ~counter~0 3)} assume true; {9109#(<= ~counter~0 3)} is VALID [2022-04-08 14:16:44,161 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {9109#(<= ~counter~0 3)} {9109#(<= ~counter~0 3)} #51#return; {9109#(<= ~counter~0 3)} is VALID [2022-04-08 14:16:44,162 INFO L290 TraceCheckUtils]: 29: Hoare triple {9109#(<= ~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; {9109#(<= ~counter~0 3)} is VALID [2022-04-08 14:16:44,162 INFO L290 TraceCheckUtils]: 30: Hoare triple {9109#(<= ~counter~0 3)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {9134#(<= ~counter~0 4)} is VALID [2022-04-08 14:16:44,162 INFO L290 TraceCheckUtils]: 31: Hoare triple {9134#(<= ~counter~0 4)} assume !!(#t~post5 < 100);havoc #t~post5; {9134#(<= ~counter~0 4)} is VALID [2022-04-08 14:16:44,163 INFO L272 TraceCheckUtils]: 32: Hoare triple {9134#(<= ~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)); {9134#(<= ~counter~0 4)} is VALID [2022-04-08 14:16:44,163 INFO L290 TraceCheckUtils]: 33: Hoare triple {9134#(<= ~counter~0 4)} ~cond := #in~cond; {9134#(<= ~counter~0 4)} is VALID [2022-04-08 14:16:44,164 INFO L290 TraceCheckUtils]: 34: Hoare triple {9134#(<= ~counter~0 4)} assume !(0 == ~cond); {9134#(<= ~counter~0 4)} is VALID [2022-04-08 14:16:44,164 INFO L290 TraceCheckUtils]: 35: Hoare triple {9134#(<= ~counter~0 4)} assume true; {9134#(<= ~counter~0 4)} is VALID [2022-04-08 14:16:44,164 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {9134#(<= ~counter~0 4)} {9134#(<= ~counter~0 4)} #51#return; {9134#(<= ~counter~0 4)} is VALID [2022-04-08 14:16:44,165 INFO L290 TraceCheckUtils]: 37: Hoare triple {9134#(<= ~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; {9134#(<= ~counter~0 4)} is VALID [2022-04-08 14:16:44,165 INFO L290 TraceCheckUtils]: 38: Hoare triple {9134#(<= ~counter~0 4)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {9159#(<= ~counter~0 5)} is VALID [2022-04-08 14:16:44,166 INFO L290 TraceCheckUtils]: 39: Hoare triple {9159#(<= ~counter~0 5)} assume !!(#t~post5 < 100);havoc #t~post5; {9159#(<= ~counter~0 5)} is VALID [2022-04-08 14:16:44,166 INFO L272 TraceCheckUtils]: 40: Hoare triple {9159#(<= ~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)); {9159#(<= ~counter~0 5)} is VALID [2022-04-08 14:16:44,167 INFO L290 TraceCheckUtils]: 41: Hoare triple {9159#(<= ~counter~0 5)} ~cond := #in~cond; {9159#(<= ~counter~0 5)} is VALID [2022-04-08 14:16:44,167 INFO L290 TraceCheckUtils]: 42: Hoare triple {9159#(<= ~counter~0 5)} assume !(0 == ~cond); {9159#(<= ~counter~0 5)} is VALID [2022-04-08 14:16:44,167 INFO L290 TraceCheckUtils]: 43: Hoare triple {9159#(<= ~counter~0 5)} assume true; {9159#(<= ~counter~0 5)} is VALID [2022-04-08 14:16:44,168 INFO L284 TraceCheckUtils]: 44: Hoare quadruple {9159#(<= ~counter~0 5)} {9159#(<= ~counter~0 5)} #51#return; {9159#(<= ~counter~0 5)} is VALID [2022-04-08 14:16:44,168 INFO L290 TraceCheckUtils]: 45: Hoare triple {9159#(<= ~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; {9159#(<= ~counter~0 5)} is VALID [2022-04-08 14:16:44,169 INFO L290 TraceCheckUtils]: 46: Hoare triple {9159#(<= ~counter~0 5)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {9184#(<= ~counter~0 6)} is VALID [2022-04-08 14:16:44,169 INFO L290 TraceCheckUtils]: 47: Hoare triple {9184#(<= ~counter~0 6)} assume !!(#t~post5 < 100);havoc #t~post5; {9184#(<= ~counter~0 6)} is VALID [2022-04-08 14:16:44,169 INFO L272 TraceCheckUtils]: 48: Hoare triple {9184#(<= ~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)); {9184#(<= ~counter~0 6)} is VALID [2022-04-08 14:16:44,170 INFO L290 TraceCheckUtils]: 49: Hoare triple {9184#(<= ~counter~0 6)} ~cond := #in~cond; {9184#(<= ~counter~0 6)} is VALID [2022-04-08 14:16:44,170 INFO L290 TraceCheckUtils]: 50: Hoare triple {9184#(<= ~counter~0 6)} assume !(0 == ~cond); {9184#(<= ~counter~0 6)} is VALID [2022-04-08 14:16:44,171 INFO L290 TraceCheckUtils]: 51: Hoare triple {9184#(<= ~counter~0 6)} assume true; {9184#(<= ~counter~0 6)} is VALID [2022-04-08 14:16:44,171 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {9184#(<= ~counter~0 6)} {9184#(<= ~counter~0 6)} #51#return; {9184#(<= ~counter~0 6)} is VALID [2022-04-08 14:16:44,172 INFO L290 TraceCheckUtils]: 53: Hoare triple {9184#(<= ~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; {9184#(<= ~counter~0 6)} is VALID [2022-04-08 14:16:44,172 INFO L290 TraceCheckUtils]: 54: Hoare triple {9184#(<= ~counter~0 6)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {9209#(<= ~counter~0 7)} is VALID [2022-04-08 14:16:44,173 INFO L290 TraceCheckUtils]: 55: Hoare triple {9209#(<= ~counter~0 7)} assume !!(#t~post5 < 100);havoc #t~post5; {9209#(<= ~counter~0 7)} is VALID [2022-04-08 14:16:44,173 INFO L272 TraceCheckUtils]: 56: Hoare triple {9209#(<= ~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)); {9209#(<= ~counter~0 7)} is VALID [2022-04-08 14:16:44,176 INFO L290 TraceCheckUtils]: 57: Hoare triple {9209#(<= ~counter~0 7)} ~cond := #in~cond; {9209#(<= ~counter~0 7)} is VALID [2022-04-08 14:16:44,176 INFO L290 TraceCheckUtils]: 58: Hoare triple {9209#(<= ~counter~0 7)} assume !(0 == ~cond); {9209#(<= ~counter~0 7)} is VALID [2022-04-08 14:16:44,177 INFO L290 TraceCheckUtils]: 59: Hoare triple {9209#(<= ~counter~0 7)} assume true; {9209#(<= ~counter~0 7)} is VALID [2022-04-08 14:16:44,177 INFO L284 TraceCheckUtils]: 60: Hoare quadruple {9209#(<= ~counter~0 7)} {9209#(<= ~counter~0 7)} #51#return; {9209#(<= ~counter~0 7)} is VALID [2022-04-08 14:16:44,177 INFO L290 TraceCheckUtils]: 61: Hoare triple {9209#(<= ~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; {9209#(<= ~counter~0 7)} is VALID [2022-04-08 14:16:44,178 INFO L290 TraceCheckUtils]: 62: Hoare triple {9209#(<= ~counter~0 7)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {9234#(<= ~counter~0 8)} is VALID [2022-04-08 14:16:44,179 INFO L290 TraceCheckUtils]: 63: Hoare triple {9234#(<= ~counter~0 8)} assume !!(#t~post5 < 100);havoc #t~post5; {9234#(<= ~counter~0 8)} is VALID [2022-04-08 14:16:44,179 INFO L272 TraceCheckUtils]: 64: Hoare triple {9234#(<= ~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)); {9234#(<= ~counter~0 8)} is VALID [2022-04-08 14:16:44,180 INFO L290 TraceCheckUtils]: 65: Hoare triple {9234#(<= ~counter~0 8)} ~cond := #in~cond; {9234#(<= ~counter~0 8)} is VALID [2022-04-08 14:16:44,180 INFO L290 TraceCheckUtils]: 66: Hoare triple {9234#(<= ~counter~0 8)} assume !(0 == ~cond); {9234#(<= ~counter~0 8)} is VALID [2022-04-08 14:16:44,180 INFO L290 TraceCheckUtils]: 67: Hoare triple {9234#(<= ~counter~0 8)} assume true; {9234#(<= ~counter~0 8)} is VALID [2022-04-08 14:16:44,181 INFO L284 TraceCheckUtils]: 68: Hoare quadruple {9234#(<= ~counter~0 8)} {9234#(<= ~counter~0 8)} #51#return; {9234#(<= ~counter~0 8)} is VALID [2022-04-08 14:16:44,181 INFO L290 TraceCheckUtils]: 69: Hoare triple {9234#(<= ~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; {9234#(<= ~counter~0 8)} is VALID [2022-04-08 14:16:44,182 INFO L290 TraceCheckUtils]: 70: Hoare triple {9234#(<= ~counter~0 8)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {9259#(<= |main_#t~post5| 8)} is VALID [2022-04-08 14:16:44,182 INFO L290 TraceCheckUtils]: 71: Hoare triple {9259#(<= |main_#t~post5| 8)} assume !(#t~post5 < 100);havoc #t~post5; {9036#false} is VALID [2022-04-08 14:16:44,182 INFO L272 TraceCheckUtils]: 72: Hoare triple {9036#false} call __VERIFIER_assert((if 0 == ~k~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {9036#false} is VALID [2022-04-08 14:16:44,182 INFO L290 TraceCheckUtils]: 73: Hoare triple {9036#false} ~cond := #in~cond; {9036#false} is VALID [2022-04-08 14:16:44,183 INFO L290 TraceCheckUtils]: 74: Hoare triple {9036#false} assume 0 == ~cond; {9036#false} is VALID [2022-04-08 14:16:44,183 INFO L290 TraceCheckUtils]: 75: Hoare triple {9036#false} assume !false; {9036#false} is VALID [2022-04-08 14:16:44,183 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-08 14:16:44,183 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 14:16:44,622 INFO L290 TraceCheckUtils]: 75: Hoare triple {9036#false} assume !false; {9036#false} is VALID [2022-04-08 14:16:44,622 INFO L290 TraceCheckUtils]: 74: Hoare triple {9036#false} assume 0 == ~cond; {9036#false} is VALID [2022-04-08 14:16:44,622 INFO L290 TraceCheckUtils]: 73: Hoare triple {9036#false} ~cond := #in~cond; {9036#false} is VALID [2022-04-08 14:16:44,623 INFO L272 TraceCheckUtils]: 72: Hoare triple {9036#false} call __VERIFIER_assert((if 0 == ~k~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {9036#false} is VALID [2022-04-08 14:16:44,623 INFO L290 TraceCheckUtils]: 71: Hoare triple {9287#(< |main_#t~post5| 100)} assume !(#t~post5 < 100);havoc #t~post5; {9036#false} is VALID [2022-04-08 14:16:44,623 INFO L290 TraceCheckUtils]: 70: Hoare triple {9291#(< ~counter~0 100)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {9287#(< |main_#t~post5| 100)} is VALID [2022-04-08 14:16:44,623 INFO L290 TraceCheckUtils]: 69: Hoare triple {9291#(< ~counter~0 100)} 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; {9291#(< ~counter~0 100)} is VALID [2022-04-08 14:16:44,624 INFO L284 TraceCheckUtils]: 68: Hoare quadruple {9035#true} {9291#(< ~counter~0 100)} #51#return; {9291#(< ~counter~0 100)} is VALID [2022-04-08 14:16:44,624 INFO L290 TraceCheckUtils]: 67: Hoare triple {9035#true} assume true; {9035#true} is VALID [2022-04-08 14:16:44,624 INFO L290 TraceCheckUtils]: 66: Hoare triple {9035#true} assume !(0 == ~cond); {9035#true} is VALID [2022-04-08 14:16:44,624 INFO L290 TraceCheckUtils]: 65: Hoare triple {9035#true} ~cond := #in~cond; {9035#true} is VALID [2022-04-08 14:16:44,624 INFO L272 TraceCheckUtils]: 64: Hoare triple {9291#(< ~counter~0 100)} 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)); {9035#true} is VALID [2022-04-08 14:16:44,624 INFO L290 TraceCheckUtils]: 63: Hoare triple {9291#(< ~counter~0 100)} assume !!(#t~post5 < 100);havoc #t~post5; {9291#(< ~counter~0 100)} is VALID [2022-04-08 14:16:44,625 INFO L290 TraceCheckUtils]: 62: Hoare triple {9316#(< ~counter~0 99)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {9291#(< ~counter~0 100)} is VALID [2022-04-08 14:16:44,625 INFO L290 TraceCheckUtils]: 61: Hoare triple {9316#(< ~counter~0 99)} 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; {9316#(< ~counter~0 99)} is VALID [2022-04-08 14:16:44,626 INFO L284 TraceCheckUtils]: 60: Hoare quadruple {9035#true} {9316#(< ~counter~0 99)} #51#return; {9316#(< ~counter~0 99)} is VALID [2022-04-08 14:16:44,626 INFO L290 TraceCheckUtils]: 59: Hoare triple {9035#true} assume true; {9035#true} is VALID [2022-04-08 14:16:44,626 INFO L290 TraceCheckUtils]: 58: Hoare triple {9035#true} assume !(0 == ~cond); {9035#true} is VALID [2022-04-08 14:16:44,626 INFO L290 TraceCheckUtils]: 57: Hoare triple {9035#true} ~cond := #in~cond; {9035#true} is VALID [2022-04-08 14:16:44,626 INFO L272 TraceCheckUtils]: 56: Hoare triple {9316#(< ~counter~0 99)} 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)); {9035#true} is VALID [2022-04-08 14:16:44,626 INFO L290 TraceCheckUtils]: 55: Hoare triple {9316#(< ~counter~0 99)} assume !!(#t~post5 < 100);havoc #t~post5; {9316#(< ~counter~0 99)} is VALID [2022-04-08 14:16:44,627 INFO L290 TraceCheckUtils]: 54: Hoare triple {9341#(< ~counter~0 98)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {9316#(< ~counter~0 99)} is VALID [2022-04-08 14:16:44,627 INFO L290 TraceCheckUtils]: 53: Hoare triple {9341#(< ~counter~0 98)} 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; {9341#(< ~counter~0 98)} is VALID [2022-04-08 14:16:44,627 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {9035#true} {9341#(< ~counter~0 98)} #51#return; {9341#(< ~counter~0 98)} is VALID [2022-04-08 14:16:44,627 INFO L290 TraceCheckUtils]: 51: Hoare triple {9035#true} assume true; {9035#true} is VALID [2022-04-08 14:16:44,628 INFO L290 TraceCheckUtils]: 50: Hoare triple {9035#true} assume !(0 == ~cond); {9035#true} is VALID [2022-04-08 14:16:44,628 INFO L290 TraceCheckUtils]: 49: Hoare triple {9035#true} ~cond := #in~cond; {9035#true} is VALID [2022-04-08 14:16:44,628 INFO L272 TraceCheckUtils]: 48: Hoare triple {9341#(< ~counter~0 98)} 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)); {9035#true} is VALID [2022-04-08 14:16:44,628 INFO L290 TraceCheckUtils]: 47: Hoare triple {9341#(< ~counter~0 98)} assume !!(#t~post5 < 100);havoc #t~post5; {9341#(< ~counter~0 98)} is VALID [2022-04-08 14:16:44,628 INFO L290 TraceCheckUtils]: 46: Hoare triple {9366#(< ~counter~0 97)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {9341#(< ~counter~0 98)} is VALID [2022-04-08 14:16:44,629 INFO L290 TraceCheckUtils]: 45: Hoare triple {9366#(< ~counter~0 97)} 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; {9366#(< ~counter~0 97)} is VALID [2022-04-08 14:16:44,629 INFO L284 TraceCheckUtils]: 44: Hoare quadruple {9035#true} {9366#(< ~counter~0 97)} #51#return; {9366#(< ~counter~0 97)} is VALID [2022-04-08 14:16:44,629 INFO L290 TraceCheckUtils]: 43: Hoare triple {9035#true} assume true; {9035#true} is VALID [2022-04-08 14:16:44,629 INFO L290 TraceCheckUtils]: 42: Hoare triple {9035#true} assume !(0 == ~cond); {9035#true} is VALID [2022-04-08 14:16:44,629 INFO L290 TraceCheckUtils]: 41: Hoare triple {9035#true} ~cond := #in~cond; {9035#true} is VALID [2022-04-08 14:16:44,629 INFO L272 TraceCheckUtils]: 40: Hoare triple {9366#(< ~counter~0 97)} 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)); {9035#true} is VALID [2022-04-08 14:16:44,630 INFO L290 TraceCheckUtils]: 39: Hoare triple {9366#(< ~counter~0 97)} assume !!(#t~post5 < 100);havoc #t~post5; {9366#(< ~counter~0 97)} is VALID [2022-04-08 14:16:44,630 INFO L290 TraceCheckUtils]: 38: Hoare triple {9391#(< ~counter~0 96)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {9366#(< ~counter~0 97)} is VALID [2022-04-08 14:16:44,631 INFO L290 TraceCheckUtils]: 37: Hoare triple {9391#(< ~counter~0 96)} 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 96)} is VALID [2022-04-08 14:16:44,631 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {9035#true} {9391#(< ~counter~0 96)} #51#return; {9391#(< ~counter~0 96)} is VALID [2022-04-08 14:16:44,631 INFO L290 TraceCheckUtils]: 35: Hoare triple {9035#true} assume true; {9035#true} is VALID [2022-04-08 14:16:44,631 INFO L290 TraceCheckUtils]: 34: Hoare triple {9035#true} assume !(0 == ~cond); {9035#true} is VALID [2022-04-08 14:16:44,631 INFO L290 TraceCheckUtils]: 33: Hoare triple {9035#true} ~cond := #in~cond; {9035#true} is VALID [2022-04-08 14:16:44,631 INFO L272 TraceCheckUtils]: 32: Hoare triple {9391#(< ~counter~0 96)} 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)); {9035#true} is VALID [2022-04-08 14:16:44,632 INFO L290 TraceCheckUtils]: 31: Hoare triple {9391#(< ~counter~0 96)} assume !!(#t~post5 < 100);havoc #t~post5; {9391#(< ~counter~0 96)} is VALID [2022-04-08 14:16:44,632 INFO L290 TraceCheckUtils]: 30: Hoare triple {9416#(< ~counter~0 95)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {9391#(< ~counter~0 96)} is VALID [2022-04-08 14:16:44,632 INFO L290 TraceCheckUtils]: 29: Hoare triple {9416#(< ~counter~0 95)} 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 95)} is VALID [2022-04-08 14:16:44,633 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {9035#true} {9416#(< ~counter~0 95)} #51#return; {9416#(< ~counter~0 95)} is VALID [2022-04-08 14:16:44,633 INFO L290 TraceCheckUtils]: 27: Hoare triple {9035#true} assume true; {9035#true} is VALID [2022-04-08 14:16:44,633 INFO L290 TraceCheckUtils]: 26: Hoare triple {9035#true} assume !(0 == ~cond); {9035#true} is VALID [2022-04-08 14:16:44,633 INFO L290 TraceCheckUtils]: 25: Hoare triple {9035#true} ~cond := #in~cond; {9035#true} is VALID [2022-04-08 14:16:44,633 INFO L272 TraceCheckUtils]: 24: Hoare triple {9416#(< ~counter~0 95)} 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)); {9035#true} is VALID [2022-04-08 14:16:44,633 INFO L290 TraceCheckUtils]: 23: Hoare triple {9416#(< ~counter~0 95)} assume !!(#t~post5 < 100);havoc #t~post5; {9416#(< ~counter~0 95)} is VALID [2022-04-08 14:16:44,634 INFO L290 TraceCheckUtils]: 22: Hoare triple {9441#(< ~counter~0 94)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {9416#(< ~counter~0 95)} is VALID [2022-04-08 14:16:44,634 INFO L290 TraceCheckUtils]: 21: Hoare triple {9441#(< ~counter~0 94)} 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 94)} is VALID [2022-04-08 14:16:44,634 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {9035#true} {9441#(< ~counter~0 94)} #51#return; {9441#(< ~counter~0 94)} is VALID [2022-04-08 14:16:44,635 INFO L290 TraceCheckUtils]: 19: Hoare triple {9035#true} assume true; {9035#true} is VALID [2022-04-08 14:16:44,635 INFO L290 TraceCheckUtils]: 18: Hoare triple {9035#true} assume !(0 == ~cond); {9035#true} is VALID [2022-04-08 14:16:44,635 INFO L290 TraceCheckUtils]: 17: Hoare triple {9035#true} ~cond := #in~cond; {9035#true} is VALID [2022-04-08 14:16:44,635 INFO L272 TraceCheckUtils]: 16: Hoare triple {9441#(< ~counter~0 94)} 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)); {9035#true} is VALID [2022-04-08 14:16:44,635 INFO L290 TraceCheckUtils]: 15: Hoare triple {9441#(< ~counter~0 94)} assume !!(#t~post5 < 100);havoc #t~post5; {9441#(< ~counter~0 94)} is VALID [2022-04-08 14:16:44,635 INFO L290 TraceCheckUtils]: 14: Hoare triple {9466#(< ~counter~0 93)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {9441#(< ~counter~0 94)} is VALID [2022-04-08 14:16:44,636 INFO L290 TraceCheckUtils]: 13: Hoare triple {9466#(< ~counter~0 93)} 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 93)} is VALID [2022-04-08 14:16:44,636 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {9035#true} {9466#(< ~counter~0 93)} #51#return; {9466#(< ~counter~0 93)} is VALID [2022-04-08 14:16:44,636 INFO L290 TraceCheckUtils]: 11: Hoare triple {9035#true} assume true; {9035#true} is VALID [2022-04-08 14:16:44,636 INFO L290 TraceCheckUtils]: 10: Hoare triple {9035#true} assume !(0 == ~cond); {9035#true} is VALID [2022-04-08 14:16:44,636 INFO L290 TraceCheckUtils]: 9: Hoare triple {9035#true} ~cond := #in~cond; {9035#true} is VALID [2022-04-08 14:16:44,636 INFO L272 TraceCheckUtils]: 8: Hoare triple {9466#(< ~counter~0 93)} 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)); {9035#true} is VALID [2022-04-08 14:16:44,637 INFO L290 TraceCheckUtils]: 7: Hoare triple {9466#(< ~counter~0 93)} assume !!(#t~post5 < 100);havoc #t~post5; {9466#(< ~counter~0 93)} is VALID [2022-04-08 14:16:44,637 INFO L290 TraceCheckUtils]: 6: Hoare triple {9491#(< ~counter~0 92)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {9466#(< ~counter~0 93)} is VALID [2022-04-08 14:16:44,637 INFO L290 TraceCheckUtils]: 5: Hoare triple {9491#(< ~counter~0 92)} 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; {9491#(< ~counter~0 92)} is VALID [2022-04-08 14:16:44,638 INFO L272 TraceCheckUtils]: 4: Hoare triple {9491#(< ~counter~0 92)} call #t~ret6 := main(); {9491#(< ~counter~0 92)} is VALID [2022-04-08 14:16:44,638 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {9491#(< ~counter~0 92)} {9035#true} #57#return; {9491#(< ~counter~0 92)} is VALID [2022-04-08 14:16:44,638 INFO L290 TraceCheckUtils]: 2: Hoare triple {9491#(< ~counter~0 92)} assume true; {9491#(< ~counter~0 92)} is VALID [2022-04-08 14:16:44,639 INFO L290 TraceCheckUtils]: 1: Hoare triple {9035#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; {9491#(< ~counter~0 92)} is VALID [2022-04-08 14:16:44,639 INFO L272 TraceCheckUtils]: 0: Hoare triple {9035#true} call ULTIMATE.init(); {9035#true} is VALID [2022-04-08 14:16:44,639 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-08 14:16:44,639 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 14:16:44,639 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [735095127] [2022-04-08 14:16:44,639 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 14:16:44,639 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1950227043] [2022-04-08 14:16:44,639 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1950227043] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 14:16:44,639 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-08 14:16:44,640 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 22 [2022-04-08 14:16:44,640 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 14:16:44,640 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [529569724] [2022-04-08 14:16:44,640 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [529569724] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 14:16:44,640 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 14:16:44,640 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-04-08 14:16:44,640 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1860612577] [2022-04-08 14:16:44,640 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 14:16:44,640 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-08 14:16:44,641 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 14:16:44,641 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-08 14:16:44,698 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-08 14:16:44,699 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-04-08 14:16:44,699 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 14:16:44,699 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-04-08 14:16:44,699 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=195, Invalid=267, Unknown=0, NotChecked=0, Total=462 [2022-04-08 14:16:44,699 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-08 14:16:44,991 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:16:44,991 INFO L93 Difference]: Finished difference Result 90 states and 91 transitions. [2022-04-08 14:16:44,992 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-04-08 14:16:44,992 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-08 14:16:44,992 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 14:16:44,992 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-08 14:16:44,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 90 transitions. [2022-04-08 14:16:44,993 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-08 14:16:44,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 90 transitions. [2022-04-08 14:16:44,995 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 20 states and 90 transitions. [2022-04-08 14:16:45,058 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-08 14:16:45,059 INFO L225 Difference]: With dead ends: 90 [2022-04-08 14:16:45,059 INFO L226 Difference]: Without dead ends: 85 [2022-04-08 14:16:45,059 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-08 14:16:45,060 INFO L913 BasicCegarLoop]: 25 mSDtfsCounter, 4 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 107 SdHoareTripleChecker+Invalid, 56 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-08 14:16:45,060 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [4 Valid, 107 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-08 14:16:45,060 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2022-04-08 14:16:45,167 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 85. [2022-04-08 14:16:45,167 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 14:16:45,167 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-08 14:16:45,167 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-08 14:16:45,168 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-08 14:16:45,169 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:16:45,169 INFO L93 Difference]: Finished difference Result 85 states and 86 transitions. [2022-04-08 14:16:45,169 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 86 transitions. [2022-04-08 14:16:45,169 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 14:16:45,169 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 14:16:45,170 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-08 14:16:45,170 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-08 14:16:45,171 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:16:45,171 INFO L93 Difference]: Finished difference Result 85 states and 86 transitions. [2022-04-08 14:16:45,171 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 86 transitions. [2022-04-08 14:16:45,171 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 14:16:45,171 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 14:16:45,172 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 14:16:45,172 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 14:16:45,172 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-08 14:16:45,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 86 transitions. [2022-04-08 14:16:45,173 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 86 transitions. Word has length 76 [2022-04-08 14:16:45,173 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 14:16:45,173 INFO L478 AbstractCegarLoop]: Abstraction has 85 states and 86 transitions. [2022-04-08 14:16:45,174 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-08 14:16:45,174 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 85 states and 86 transitions. [2022-04-08 14:16:45,284 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 86 edges. 86 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 14:16:45,284 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 86 transitions. [2022-04-08 14:16:45,285 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2022-04-08 14:16:45,285 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 14:16:45,285 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-08 14:16:45,290 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Forceful destruction successful, exit code 0 [2022-04-08 14:16:45,490 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 14:16:45,490 INFO L403 AbstractCegarLoop]: === Iteration 20 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 14:16:45,491 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 14:16:45,491 INFO L85 PathProgramCache]: Analyzing trace with hash -1500110401, now seen corresponding path program 15 times [2022-04-08 14:16:45,491 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 14:16:45,491 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1718859135] [2022-04-08 14:16:45,579 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 14:16:45,579 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 14:16:45,579 INFO L85 PathProgramCache]: Analyzing trace with hash -1500110401, now seen corresponding path program 16 times [2022-04-08 14:16:45,579 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 14:16:45,579 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2125245391] [2022-04-08 14:16:45,579 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 14:16:45,579 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 14:16:45,590 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 14:16:45,590 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1202132103] [2022-04-08 14:16:45,590 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-08 14:16:45,590 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 14:16:45,591 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 14:16:45,591 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 14:16:45,601 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2022-04-08 14:16:46,214 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-08 14:16:46,214 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 14:16:46,215 INFO L263 TraceCheckSpWp]: Trace formula consists of 249 conjuncts, 40 conjunts are in the unsatisfiable core [2022-04-08 14:16:46,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 14:16:46,236 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 14:16:46,729 INFO L272 TraceCheckUtils]: 0: Hoare triple {10048#true} call ULTIMATE.init(); {10048#true} is VALID [2022-04-08 14:16:46,729 INFO L290 TraceCheckUtils]: 1: Hoare triple {10048#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; {10048#true} is VALID [2022-04-08 14:16:46,729 INFO L290 TraceCheckUtils]: 2: Hoare triple {10048#true} assume true; {10048#true} is VALID [2022-04-08 14:16:46,729 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {10048#true} {10048#true} #57#return; {10048#true} is VALID [2022-04-08 14:16:46,729 INFO L272 TraceCheckUtils]: 4: Hoare triple {10048#true} call #t~ret6 := main(); {10048#true} is VALID [2022-04-08 14:16:46,729 INFO L290 TraceCheckUtils]: 5: Hoare triple {10048#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; {10068#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-08 14:16:46,730 INFO L290 TraceCheckUtils]: 6: Hoare triple {10068#(and (= main_~c~0 0) (= main_~y~0 0))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {10068#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-08 14:16:46,730 INFO L290 TraceCheckUtils]: 7: Hoare triple {10068#(and (= main_~c~0 0) (= main_~y~0 0))} assume !!(#t~post5 < 100);havoc #t~post5; {10068#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-08 14:16:46,730 INFO L272 TraceCheckUtils]: 8: Hoare triple {10068#(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)); {10048#true} is VALID [2022-04-08 14:16:46,730 INFO L290 TraceCheckUtils]: 9: Hoare triple {10048#true} ~cond := #in~cond; {10048#true} is VALID [2022-04-08 14:16:46,730 INFO L290 TraceCheckUtils]: 10: Hoare triple {10048#true} assume !(0 == ~cond); {10048#true} is VALID [2022-04-08 14:16:46,730 INFO L290 TraceCheckUtils]: 11: Hoare triple {10048#true} assume true; {10048#true} is VALID [2022-04-08 14:16:46,731 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {10048#true} {10068#(and (= main_~c~0 0) (= main_~y~0 0))} #51#return; {10068#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-08 14:16:46,731 INFO L290 TraceCheckUtils]: 13: Hoare triple {10068#(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; {10093#(and (= main_~y~0 1) (= main_~c~0 1))} is VALID [2022-04-08 14:16:46,731 INFO L290 TraceCheckUtils]: 14: Hoare triple {10093#(and (= main_~y~0 1) (= main_~c~0 1))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {10093#(and (= main_~y~0 1) (= main_~c~0 1))} is VALID [2022-04-08 14:16:46,732 INFO L290 TraceCheckUtils]: 15: Hoare triple {10093#(and (= main_~y~0 1) (= main_~c~0 1))} assume !!(#t~post5 < 100);havoc #t~post5; {10093#(and (= main_~y~0 1) (= main_~c~0 1))} is VALID [2022-04-08 14:16:46,732 INFO L272 TraceCheckUtils]: 16: Hoare triple {10093#(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)); {10048#true} is VALID [2022-04-08 14:16:46,732 INFO L290 TraceCheckUtils]: 17: Hoare triple {10048#true} ~cond := #in~cond; {10048#true} is VALID [2022-04-08 14:16:46,732 INFO L290 TraceCheckUtils]: 18: Hoare triple {10048#true} assume !(0 == ~cond); {10048#true} is VALID [2022-04-08 14:16:46,732 INFO L290 TraceCheckUtils]: 19: Hoare triple {10048#true} assume true; {10048#true} is VALID [2022-04-08 14:16:46,732 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {10048#true} {10093#(and (= main_~y~0 1) (= main_~c~0 1))} #51#return; {10093#(and (= main_~y~0 1) (= main_~c~0 1))} is VALID [2022-04-08 14:16:46,733 INFO L290 TraceCheckUtils]: 21: Hoare triple {10093#(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; {10118#(and (= main_~y~0 2) (= (+ (- 1) main_~c~0) 1))} is VALID [2022-04-08 14:16:46,733 INFO L290 TraceCheckUtils]: 22: Hoare triple {10118#(and (= main_~y~0 2) (= (+ (- 1) main_~c~0) 1))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {10118#(and (= main_~y~0 2) (= (+ (- 1) main_~c~0) 1))} is VALID [2022-04-08 14:16:46,733 INFO L290 TraceCheckUtils]: 23: Hoare triple {10118#(and (= main_~y~0 2) (= (+ (- 1) main_~c~0) 1))} assume !!(#t~post5 < 100);havoc #t~post5; {10118#(and (= main_~y~0 2) (= (+ (- 1) main_~c~0) 1))} is VALID [2022-04-08 14:16:46,734 INFO L272 TraceCheckUtils]: 24: Hoare triple {10118#(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)); {10048#true} is VALID [2022-04-08 14:16:46,734 INFO L290 TraceCheckUtils]: 25: Hoare triple {10048#true} ~cond := #in~cond; {10048#true} is VALID [2022-04-08 14:16:46,734 INFO L290 TraceCheckUtils]: 26: Hoare triple {10048#true} assume !(0 == ~cond); {10048#true} is VALID [2022-04-08 14:16:46,734 INFO L290 TraceCheckUtils]: 27: Hoare triple {10048#true} assume true; {10048#true} is VALID [2022-04-08 14:16:46,734 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {10048#true} {10118#(and (= main_~y~0 2) (= (+ (- 1) main_~c~0) 1))} #51#return; {10118#(and (= main_~y~0 2) (= (+ (- 1) main_~c~0) 1))} is VALID [2022-04-08 14:16:46,735 INFO L290 TraceCheckUtils]: 29: Hoare triple {10118#(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; {10143#(and (= main_~y~0 3) (= main_~c~0 3))} is VALID [2022-04-08 14:16:46,735 INFO L290 TraceCheckUtils]: 30: Hoare triple {10143#(and (= main_~y~0 3) (= main_~c~0 3))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {10143#(and (= main_~y~0 3) (= main_~c~0 3))} is VALID [2022-04-08 14:16:46,735 INFO L290 TraceCheckUtils]: 31: Hoare triple {10143#(and (= main_~y~0 3) (= main_~c~0 3))} assume !!(#t~post5 < 100);havoc #t~post5; {10143#(and (= main_~y~0 3) (= main_~c~0 3))} is VALID [2022-04-08 14:16:46,735 INFO L272 TraceCheckUtils]: 32: Hoare triple {10143#(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)); {10048#true} is VALID [2022-04-08 14:16:46,735 INFO L290 TraceCheckUtils]: 33: Hoare triple {10048#true} ~cond := #in~cond; {10048#true} is VALID [2022-04-08 14:16:46,735 INFO L290 TraceCheckUtils]: 34: Hoare triple {10048#true} assume !(0 == ~cond); {10048#true} is VALID [2022-04-08 14:16:46,735 INFO L290 TraceCheckUtils]: 35: Hoare triple {10048#true} assume true; {10048#true} is VALID [2022-04-08 14:16:46,736 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {10048#true} {10143#(and (= main_~y~0 3) (= main_~c~0 3))} #51#return; {10143#(and (= main_~y~0 3) (= main_~c~0 3))} is VALID [2022-04-08 14:16:46,736 INFO L290 TraceCheckUtils]: 37: Hoare triple {10143#(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; {10168#(and (= 3 (+ (- 1) main_~y~0)) (= main_~c~0 4))} is VALID [2022-04-08 14:16:46,737 INFO L290 TraceCheckUtils]: 38: Hoare triple {10168#(and (= 3 (+ (- 1) main_~y~0)) (= main_~c~0 4))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {10168#(and (= 3 (+ (- 1) main_~y~0)) (= main_~c~0 4))} is VALID [2022-04-08 14:16:46,737 INFO L290 TraceCheckUtils]: 39: Hoare triple {10168#(and (= 3 (+ (- 1) main_~y~0)) (= main_~c~0 4))} assume !!(#t~post5 < 100);havoc #t~post5; {10168#(and (= 3 (+ (- 1) main_~y~0)) (= main_~c~0 4))} is VALID [2022-04-08 14:16:46,737 INFO L272 TraceCheckUtils]: 40: Hoare triple {10168#(and (= 3 (+ (- 1) main_~y~0)) (= 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)); {10048#true} is VALID [2022-04-08 14:16:46,737 INFO L290 TraceCheckUtils]: 41: Hoare triple {10048#true} ~cond := #in~cond; {10048#true} is VALID [2022-04-08 14:16:46,737 INFO L290 TraceCheckUtils]: 42: Hoare triple {10048#true} assume !(0 == ~cond); {10048#true} is VALID [2022-04-08 14:16:46,737 INFO L290 TraceCheckUtils]: 43: Hoare triple {10048#true} assume true; {10048#true} is VALID [2022-04-08 14:16:46,738 INFO L284 TraceCheckUtils]: 44: Hoare quadruple {10048#true} {10168#(and (= 3 (+ (- 1) main_~y~0)) (= main_~c~0 4))} #51#return; {10168#(and (= 3 (+ (- 1) main_~y~0)) (= main_~c~0 4))} is VALID [2022-04-08 14:16:46,738 INFO L290 TraceCheckUtils]: 45: Hoare triple {10168#(and (= 3 (+ (- 1) main_~y~0)) (= main_~c~0 4))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {10193#(and (= 5 main_~c~0) (= 5 main_~y~0))} is VALID [2022-04-08 14:16:46,738 INFO L290 TraceCheckUtils]: 46: Hoare triple {10193#(and (= 5 main_~c~0) (= 5 main_~y~0))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {10193#(and (= 5 main_~c~0) (= 5 main_~y~0))} is VALID [2022-04-08 14:16:46,739 INFO L290 TraceCheckUtils]: 47: Hoare triple {10193#(and (= 5 main_~c~0) (= 5 main_~y~0))} assume !!(#t~post5 < 100);havoc #t~post5; {10193#(and (= 5 main_~c~0) (= 5 main_~y~0))} is VALID [2022-04-08 14:16:46,739 INFO L272 TraceCheckUtils]: 48: Hoare triple {10193#(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)); {10048#true} is VALID [2022-04-08 14:16:46,739 INFO L290 TraceCheckUtils]: 49: Hoare triple {10048#true} ~cond := #in~cond; {10048#true} is VALID [2022-04-08 14:16:46,739 INFO L290 TraceCheckUtils]: 50: Hoare triple {10048#true} assume !(0 == ~cond); {10048#true} is VALID [2022-04-08 14:16:46,739 INFO L290 TraceCheckUtils]: 51: Hoare triple {10048#true} assume true; {10048#true} is VALID [2022-04-08 14:16:46,739 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {10048#true} {10193#(and (= 5 main_~c~0) (= 5 main_~y~0))} #51#return; {10193#(and (= 5 main_~c~0) (= 5 main_~y~0))} is VALID [2022-04-08 14:16:46,740 INFO L290 TraceCheckUtils]: 53: Hoare triple {10193#(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; {10218#(and (= main_~y~0 6) (= (+ (- 1) main_~c~0) 5))} is VALID [2022-04-08 14:16:46,740 INFO L290 TraceCheckUtils]: 54: Hoare triple {10218#(and (= main_~y~0 6) (= (+ (- 1) main_~c~0) 5))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {10218#(and (= main_~y~0 6) (= (+ (- 1) main_~c~0) 5))} is VALID [2022-04-08 14:16:46,740 INFO L290 TraceCheckUtils]: 55: Hoare triple {10218#(and (= main_~y~0 6) (= (+ (- 1) main_~c~0) 5))} assume !!(#t~post5 < 100);havoc #t~post5; {10218#(and (= main_~y~0 6) (= (+ (- 1) main_~c~0) 5))} is VALID [2022-04-08 14:16:46,740 INFO L272 TraceCheckUtils]: 56: Hoare triple {10218#(and (= main_~y~0 6) (= (+ (- 1) main_~c~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)); {10048#true} is VALID [2022-04-08 14:16:46,740 INFO L290 TraceCheckUtils]: 57: Hoare triple {10048#true} ~cond := #in~cond; {10048#true} is VALID [2022-04-08 14:16:46,740 INFO L290 TraceCheckUtils]: 58: Hoare triple {10048#true} assume !(0 == ~cond); {10048#true} is VALID [2022-04-08 14:16:46,741 INFO L290 TraceCheckUtils]: 59: Hoare triple {10048#true} assume true; {10048#true} is VALID [2022-04-08 14:16:46,741 INFO L284 TraceCheckUtils]: 60: Hoare quadruple {10048#true} {10218#(and (= main_~y~0 6) (= (+ (- 1) main_~c~0) 5))} #51#return; {10218#(and (= main_~y~0 6) (= (+ (- 1) main_~c~0) 5))} is VALID [2022-04-08 14:16:46,741 INFO L290 TraceCheckUtils]: 61: Hoare triple {10218#(and (= main_~y~0 6) (= (+ (- 1) main_~c~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; {10243#(and (= 7 main_~y~0) (= 5 (+ (- 2) main_~c~0)))} is VALID [2022-04-08 14:16:46,742 INFO L290 TraceCheckUtils]: 62: Hoare triple {10243#(and (= 7 main_~y~0) (= 5 (+ (- 2) main_~c~0)))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {10243#(and (= 7 main_~y~0) (= 5 (+ (- 2) main_~c~0)))} is VALID [2022-04-08 14:16:46,742 INFO L290 TraceCheckUtils]: 63: Hoare triple {10243#(and (= 7 main_~y~0) (= 5 (+ (- 2) main_~c~0)))} assume !!(#t~post5 < 100);havoc #t~post5; {10243#(and (= 7 main_~y~0) (= 5 (+ (- 2) main_~c~0)))} is VALID [2022-04-08 14:16:46,742 INFO L272 TraceCheckUtils]: 64: Hoare triple {10243#(and (= 7 main_~y~0) (= 5 (+ (- 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)); {10048#true} is VALID [2022-04-08 14:16:46,742 INFO L290 TraceCheckUtils]: 65: Hoare triple {10048#true} ~cond := #in~cond; {10048#true} is VALID [2022-04-08 14:16:46,742 INFO L290 TraceCheckUtils]: 66: Hoare triple {10048#true} assume !(0 == ~cond); {10048#true} is VALID [2022-04-08 14:16:46,742 INFO L290 TraceCheckUtils]: 67: Hoare triple {10048#true} assume true; {10048#true} is VALID [2022-04-08 14:16:46,743 INFO L284 TraceCheckUtils]: 68: Hoare quadruple {10048#true} {10243#(and (= 7 main_~y~0) (= 5 (+ (- 2) main_~c~0)))} #51#return; {10243#(and (= 7 main_~y~0) (= 5 (+ (- 2) main_~c~0)))} is VALID [2022-04-08 14:16:46,743 INFO L290 TraceCheckUtils]: 69: Hoare triple {10243#(and (= 7 main_~y~0) (= 5 (+ (- 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; {10268#(and (< 7 main_~k~0) (= 7 (+ (- 1) main_~y~0)) (<= main_~c~0 8))} is VALID [2022-04-08 14:16:46,743 INFO L290 TraceCheckUtils]: 70: Hoare triple {10268#(and (< 7 main_~k~0) (= 7 (+ (- 1) main_~y~0)) (<= main_~c~0 8))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {10268#(and (< 7 main_~k~0) (= 7 (+ (- 1) main_~y~0)) (<= main_~c~0 8))} is VALID [2022-04-08 14:16:46,744 INFO L290 TraceCheckUtils]: 71: Hoare triple {10268#(and (< 7 main_~k~0) (= 7 (+ (- 1) main_~y~0)) (<= main_~c~0 8))} assume !!(#t~post5 < 100);havoc #t~post5; {10268#(and (< 7 main_~k~0) (= 7 (+ (- 1) main_~y~0)) (<= main_~c~0 8))} is VALID [2022-04-08 14:16:46,744 INFO L272 TraceCheckUtils]: 72: Hoare triple {10268#(and (< 7 main_~k~0) (= 7 (+ (- 1) main_~y~0)) (<= 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)); {10048#true} is VALID [2022-04-08 14:16:46,744 INFO L290 TraceCheckUtils]: 73: Hoare triple {10048#true} ~cond := #in~cond; {10048#true} is VALID [2022-04-08 14:16:46,744 INFO L290 TraceCheckUtils]: 74: Hoare triple {10048#true} assume !(0 == ~cond); {10048#true} is VALID [2022-04-08 14:16:46,744 INFO L290 TraceCheckUtils]: 75: Hoare triple {10048#true} assume true; {10048#true} is VALID [2022-04-08 14:16:46,747 INFO L284 TraceCheckUtils]: 76: Hoare quadruple {10048#true} {10268#(and (< 7 main_~k~0) (= 7 (+ (- 1) main_~y~0)) (<= main_~c~0 8))} #51#return; {10268#(and (< 7 main_~k~0) (= 7 (+ (- 1) main_~y~0)) (<= main_~c~0 8))} is VALID [2022-04-08 14:16:46,748 INFO L290 TraceCheckUtils]: 77: Hoare triple {10268#(and (< 7 main_~k~0) (= 7 (+ (- 1) main_~y~0)) (<= main_~c~0 8))} assume !(~c~0 < ~k~0); {10293#(and (< 7 main_~k~0) (= 7 (+ (- 1) main_~y~0)) (<= main_~k~0 8))} is VALID [2022-04-08 14:16:46,749 INFO L272 TraceCheckUtils]: 78: Hoare triple {10293#(and (< 7 main_~k~0) (= 7 (+ (- 1) main_~y~0)) (<= main_~k~0 8))} call __VERIFIER_assert((if 0 == ~k~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {10297#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 14:16:46,750 INFO L290 TraceCheckUtils]: 79: Hoare triple {10297#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {10301#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 14:16:46,750 INFO L290 TraceCheckUtils]: 80: Hoare triple {10301#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {10049#false} is VALID [2022-04-08 14:16:46,750 INFO L290 TraceCheckUtils]: 81: Hoare triple {10049#false} assume !false; {10049#false} is VALID [2022-04-08 14:16:46,751 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-08 14:16:46,751 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 14:16:47,054 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 14:16:47,054 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2125245391] [2022-04-08 14:16:47,054 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 14:16:47,054 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1202132103] [2022-04-08 14:16:47,054 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1202132103] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 14:16:47,055 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-08 14:16:47,055 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2022-04-08 14:16:47,055 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 14:16:47,055 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1718859135] [2022-04-08 14:16:47,055 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1718859135] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 14:16:47,055 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 14:16:47,055 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-04-08 14:16:47,055 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1770137989] [2022-04-08 14:16:47,055 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 14:16:47,056 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-08 14:16:47,056 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 14:16:47,056 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-08 14:16:47,103 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-08 14:16:47,103 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-04-08 14:16:47,103 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 14:16:47,104 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-04-08 14:16:47,104 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=227, Unknown=0, NotChecked=0, Total=272 [2022-04-08 14:16:47,104 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-08 14:16:48,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:16:48,025 INFO L93 Difference]: Finished difference Result 92 states and 94 transitions. [2022-04-08 14:16:48,025 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-04-08 14:16:48,026 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-08 14:16:48,026 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 14:16:48,026 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-08 14:16:48,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 69 transitions. [2022-04-08 14:16:48,027 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-08 14:16:48,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 69 transitions. [2022-04-08 14:16:48,029 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 14 states and 69 transitions. [2022-04-08 14:16:48,090 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 69 edges. 69 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 14:16:48,091 INFO L225 Difference]: With dead ends: 92 [2022-04-08 14:16:48,091 INFO L226 Difference]: Without dead ends: 87 [2022-04-08 14:16:48,091 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-08 14:16:48,092 INFO L913 BasicCegarLoop]: 50 mSDtfsCounter, 2 mSDsluCounter, 358 mSDsCounter, 0 mSdLazyCounter, 347 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s 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.3s IncrementalHoareTripleChecker+Time [2022-04-08 14:16:48,092 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.3s Time] [2022-04-08 14:16:48,092 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2022-04-08 14:16:48,197 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 87. [2022-04-08 14:16:48,197 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 14:16:48,197 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-08 14:16:48,198 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-08 14:16:48,198 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-08 14:16:48,199 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:16:48,199 INFO L93 Difference]: Finished difference Result 87 states and 89 transitions. [2022-04-08 14:16:48,199 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 89 transitions. [2022-04-08 14:16:48,200 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 14:16:48,200 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 14:16:48,200 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-08 14:16:48,200 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-08 14:16:48,202 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:16:48,202 INFO L93 Difference]: Finished difference Result 87 states and 89 transitions. [2022-04-08 14:16:48,202 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 89 transitions. [2022-04-08 14:16:48,202 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 14:16:48,202 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 14:16:48,202 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 14:16:48,202 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 14:16:48,203 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-08 14:16:48,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 89 transitions. [2022-04-08 14:16:48,204 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 89 transitions. Word has length 82 [2022-04-08 14:16:48,204 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 14:16:48,204 INFO L478 AbstractCegarLoop]: Abstraction has 87 states and 89 transitions. [2022-04-08 14:16:48,204 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-08 14:16:48,205 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 87 states and 89 transitions. [2022-04-08 14:16:48,313 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-08 14:16:48,313 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 89 transitions. [2022-04-08 14:16:48,314 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2022-04-08 14:16:48,314 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 14:16:48,314 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-08 14:16:48,323 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Forceful destruction successful, exit code 0 [2022-04-08 14:16:48,522 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 14:16:48,522 INFO L403 AbstractCegarLoop]: === Iteration 21 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 14:16:48,523 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 14:16:48,523 INFO L85 PathProgramCache]: Analyzing trace with hash -2095421916, now seen corresponding path program 17 times [2022-04-08 14:16:48,523 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 14:16:48,523 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1297738868] [2022-04-08 14:16:48,617 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 14:16:48,617 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 14:16:48,617 INFO L85 PathProgramCache]: Analyzing trace with hash -2095421916, now seen corresponding path program 18 times [2022-04-08 14:16:48,618 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 14:16:48,618 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1771600863] [2022-04-08 14:16:48,618 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 14:16:48,618 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 14:16:48,628 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 14:16:48,628 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [906320242] [2022-04-08 14:16:48,628 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-08 14:16:48,628 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 14:16:48,628 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 14:16:48,635 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 14:16:48,646 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process