/usr/bin/java -ea -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data --core.log.level.for.class de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationJordan_32.epf -i ../../../trunk/examples/svcomp/nla-digbench/ps6-ll.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-34549b5 [2022-04-08 04:35:00,829 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-08 04:35:00,831 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-08 04:35:00,865 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-08 04:35:00,865 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-08 04:35:00,866 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-08 04:35:00,868 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-08 04:35:00,872 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-08 04:35:00,874 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-08 04:35:00,877 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-08 04:35:00,878 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-08 04:35:00,880 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-08 04:35:00,881 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-08 04:35:00,882 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-08 04:35:00,883 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-08 04:35:00,885 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-08 04:35:00,885 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-08 04:35:00,886 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-08 04:35:00,888 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-08 04:35:00,892 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-08 04:35:00,893 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-08 04:35:00,894 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-08 04:35:00,894 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-08 04:35:00,895 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-08 04:35:00,896 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-08 04:35:00,900 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-08 04:35:00,901 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-08 04:35:00,901 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-08 04:35:00,902 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-08 04:35:00,902 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-08 04:35:00,903 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-08 04:35:00,903 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-08 04:35:00,905 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-08 04:35:00,905 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-08 04:35:00,905 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-08 04:35:00,906 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-08 04:35:00,906 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-08 04:35:00,906 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-08 04:35:00,906 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-08 04:35:00,907 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-08 04:35:00,907 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-08 04:35:00,908 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-08 04:35:00,909 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationJordan_32.epf [2022-04-08 04:35:00,918 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-08 04:35:00,918 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-08 04:35:00,919 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-08 04:35:00,919 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-08 04:35:00,919 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-08 04:35:00,919 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-08 04:35:00,919 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-08 04:35:00,919 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-08 04:35:00,920 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-08 04:35:00,920 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-08 04:35:00,920 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-08 04:35:00,920 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-08 04:35:00,920 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-08 04:35:00,921 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-08 04:35:00,921 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-08 04:35:00,921 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-08 04:35:00,921 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-08 04:35:00,921 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-08 04:35:00,921 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-08 04:35:00,921 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-08 04:35:00,921 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-04-08 04:35:00,921 INFO L138 SettingsManager]: * Trace refinement strategy=ACCELERATED_INTERPOLATION [2022-04-08 04:35:00,921 INFO L138 SettingsManager]: * Trace refinement strategy used in Accelerated Interpolation=CAMEL [2022-04-08 04:35:00,921 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-08 04:35:00,922 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=JORDAN [2022-04-08 04:35:00,922 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 04:35:01,116 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-08 04:35:01,136 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-08 04:35:01,138 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-08 04:35:01,138 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-08 04:35:01,139 INFO L275 PluginConnector]: CDTParser initialized [2022-04-08 04:35:01,140 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/nla-digbench/ps6-ll.c [2022-04-08 04:35:01,205 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b4a7174af/e94da03aeeb146788bd8c92d06aa893c/FLAG4e13c262c [2022-04-08 04:35:01,572 INFO L306 CDTParser]: Found 1 translation units. [2022-04-08 04:35:01,572 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench/ps6-ll.c [2022-04-08 04:35:01,576 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b4a7174af/e94da03aeeb146788bd8c92d06aa893c/FLAG4e13c262c [2022-04-08 04:35:01,587 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b4a7174af/e94da03aeeb146788bd8c92d06aa893c [2022-04-08 04:35:01,589 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-08 04:35:01,590 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-08 04:35:01,592 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-08 04:35:01,593 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-08 04:35:01,595 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-08 04:35:01,596 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.04 04:35:01" (1/1) ... [2022-04-08 04:35:01,598 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@108c69ab and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 04:35:01, skipping insertion in model container [2022-04-08 04:35:01,598 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.04 04:35:01" (1/1) ... [2022-04-08 04:35:01,604 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-08 04:35:01,618 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-08 04:35:01,748 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/ps6-ll.c[458,471] [2022-04-08 04:35:01,760 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-08 04:35:01,771 INFO L203 MainTranslator]: Completed pre-run [2022-04-08 04:35:01,779 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/ps6-ll.c[458,471] [2022-04-08 04:35:01,785 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-08 04:35:01,796 INFO L208 MainTranslator]: Completed translation [2022-04-08 04:35:01,796 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 04:35:01 WrapperNode [2022-04-08 04:35:01,797 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-08 04:35:01,797 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-08 04:35:01,797 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-08 04:35:01,797 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-08 04:35:01,804 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 04:35:01" (1/1) ... [2022-04-08 04:35:01,805 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 04:35:01" (1/1) ... [2022-04-08 04:35:01,809 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 04:35:01" (1/1) ... [2022-04-08 04:35:01,809 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 04:35:01" (1/1) ... [2022-04-08 04:35:01,813 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 04:35:01" (1/1) ... [2022-04-08 04:35:01,816 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 04:35:01" (1/1) ... [2022-04-08 04:35:01,817 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 04:35:01" (1/1) ... [2022-04-08 04:35:01,818 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-08 04:35:01,819 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-08 04:35:01,819 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-08 04:35:01,819 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-08 04:35:01,820 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 04:35:01" (1/1) ... [2022-04-08 04:35:01,825 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-08 04:35:01,832 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 04:35:01,847 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 04:35:01,849 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 04:35:01,889 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-08 04:35:01,889 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-08 04:35:01,889 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-08 04:35:01,889 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-08 04:35:01,889 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-08 04:35:01,889 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-08 04:35:01,890 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-08 04:35:01,890 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-08 04:35:01,890 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-08 04:35:01,890 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-08 04:35:01,891 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_short [2022-04-08 04:35:01,891 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-08 04:35:01,892 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-08 04:35:01,892 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-08 04:35:01,892 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-08 04:35:01,892 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-08 04:35:01,892 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-08 04:35:01,892 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-08 04:35:01,893 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-08 04:35:01,893 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-08 04:35:01,938 INFO L234 CfgBuilder]: Building ICFG [2022-04-08 04:35:01,939 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-08 04:35:02,100 INFO L275 CfgBuilder]: Performing block encoding [2022-04-08 04:35:02,105 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-08 04:35:02,105 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-08 04:35:02,106 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.04 04:35:02 BoogieIcfgContainer [2022-04-08 04:35:02,106 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-08 04:35:02,107 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-08 04:35:02,107 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-08 04:35:02,128 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-08 04:35:02,128 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.04 04:35:01" (1/3) ... [2022-04-08 04:35:02,129 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4ac888a7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.04 04:35:02, skipping insertion in model container [2022-04-08 04:35:02,129 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 04:35:01" (2/3) ... [2022-04-08 04:35:02,129 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4ac888a7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.04 04:35:02, skipping insertion in model container [2022-04-08 04:35:02,129 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.04 04:35:02" (3/3) ... [2022-04-08 04:35:02,130 INFO L111 eAbstractionObserver]: Analyzing ICFG ps6-ll.c [2022-04-08 04:35:02,134 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-04-08 04:35:02,134 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-08 04:35:02,211 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-08 04:35:02,221 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 04:35:02,222 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-08 04:35:02,255 INFO L276 IsEmpty]: Start isEmpty. Operand has 28 states, 16 states have (on average 1.375) internal successors, (22), 17 states have internal predecessors, (22), 6 states have call successors, (6), 4 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-08 04:35:02,260 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-04-08 04:35:02,260 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 04:35:02,261 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 04:35:02,261 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 04:35:02,268 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 04:35:02,268 INFO L85 PathProgramCache]: Analyzing trace with hash -630235283, now seen corresponding path program 1 times [2022-04-08 04:35:02,275 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 04:35:02,276 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [963197380] [2022-04-08 04:35:02,284 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 04:35:02,284 INFO L85 PathProgramCache]: Analyzing trace with hash -630235283, now seen corresponding path program 2 times [2022-04-08 04:35:02,287 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 04:35:02,288 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [721617666] [2022-04-08 04:35:02,288 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 04:35:02,289 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 04:35:02,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 04:35:02,444 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 04:35:02,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 04:35:02,477 INFO L290 TraceCheckUtils]: 0: Hoare triple {40#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3); {31#true} is VALID [2022-04-08 04:35:02,478 INFO L290 TraceCheckUtils]: 1: Hoare triple {31#true} assume true; {31#true} is VALID [2022-04-08 04:35:02,478 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {31#true} {31#true} #60#return; {31#true} is VALID [2022-04-08 04:35:02,479 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-08 04:35:02,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 04:35:02,495 INFO L290 TraceCheckUtils]: 0: Hoare triple {31#true} ~cond := #in~cond; {31#true} is VALID [2022-04-08 04:35:02,496 INFO L290 TraceCheckUtils]: 1: Hoare triple {31#true} assume 0 == ~cond;assume false; {32#false} is VALID [2022-04-08 04:35:02,496 INFO L290 TraceCheckUtils]: 2: Hoare triple {32#false} assume true; {32#false} is VALID [2022-04-08 04:35:02,496 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {32#false} {31#true} #52#return; {32#false} is VALID [2022-04-08 04:35:02,498 INFO L272 TraceCheckUtils]: 0: Hoare triple {31#true} call ULTIMATE.init(); {40#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 04:35:02,498 INFO L290 TraceCheckUtils]: 1: Hoare triple {40#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3); {31#true} is VALID [2022-04-08 04:35:02,499 INFO L290 TraceCheckUtils]: 2: Hoare triple {31#true} assume true; {31#true} is VALID [2022-04-08 04:35:02,499 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {31#true} {31#true} #60#return; {31#true} is VALID [2022-04-08 04:35:02,499 INFO L272 TraceCheckUtils]: 4: Hoare triple {31#true} call #t~ret5 := main(); {31#true} is VALID [2022-04-08 04:35:02,500 INFO L290 TraceCheckUtils]: 5: Hoare triple {31#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; {31#true} is VALID [2022-04-08 04:35:02,500 INFO L272 TraceCheckUtils]: 6: Hoare triple {31#true} call assume_abort_if_not((if ~k~0 <= 256 then 1 else 0)); {31#true} is VALID [2022-04-08 04:35:02,500 INFO L290 TraceCheckUtils]: 7: Hoare triple {31#true} ~cond := #in~cond; {31#true} is VALID [2022-04-08 04:35:02,501 INFO L290 TraceCheckUtils]: 8: Hoare triple {31#true} assume 0 == ~cond;assume false; {32#false} is VALID [2022-04-08 04:35:02,501 INFO L290 TraceCheckUtils]: 9: Hoare triple {32#false} assume true; {32#false} is VALID [2022-04-08 04:35:02,501 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {32#false} {31#true} #52#return; {32#false} is VALID [2022-04-08 04:35:02,502 INFO L290 TraceCheckUtils]: 11: Hoare triple {32#false} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {32#false} is VALID [2022-04-08 04:35:02,503 INFO L290 TraceCheckUtils]: 12: Hoare triple {32#false} assume false; {32#false} is VALID [2022-04-08 04:35:02,503 INFO L272 TraceCheckUtils]: 13: Hoare triple {32#false} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {32#false} is VALID [2022-04-08 04:35:02,503 INFO L290 TraceCheckUtils]: 14: Hoare triple {32#false} ~cond := #in~cond; {32#false} is VALID [2022-04-08 04:35:02,503 INFO L290 TraceCheckUtils]: 15: Hoare triple {32#false} assume 0 == ~cond; {32#false} is VALID [2022-04-08 04:35:02,504 INFO L290 TraceCheckUtils]: 16: Hoare triple {32#false} assume !false; {32#false} is VALID [2022-04-08 04:35:02,504 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 04:35:02,505 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 04:35:02,505 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [721617666] [2022-04-08 04:35:02,506 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [721617666] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 04:35:02,506 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 04:35:02,506 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-08 04:35:02,509 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 04:35:02,509 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [963197380] [2022-04-08 04:35:02,509 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [963197380] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 04:35:02,510 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 04:35:02,510 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-08 04:35:02,510 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1092998013] [2022-04-08 04:35:02,511 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 04:35:02,516 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 17 [2022-04-08 04:35:02,518 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 04:35:02,521 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-08 04:35:02,555 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 17 edges. 17 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 04:35:02,555 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-08 04:35:02,556 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 04:35:02,578 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-08 04:35:02,579 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-08 04:35:02,582 INFO L87 Difference]: Start difference. First operand has 28 states, 16 states have (on average 1.375) internal successors, (22), 17 states have internal predecessors, (22), 6 states have call successors, (6), 4 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-08 04:35:03,010 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 04:35:03,011 INFO L93 Difference]: Finished difference Result 47 states and 61 transitions. [2022-04-08 04:35:03,011 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-08 04:35:03,011 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 17 [2022-04-08 04:35:03,012 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 04:35:03,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-08 04:35:03,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 61 transitions. [2022-04-08 04:35:03,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-08 04:35:03,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 61 transitions. [2022-04-08 04:35:03,026 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 61 transitions. [2022-04-08 04:35:03,120 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 61 edges. 61 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 04:35:03,128 INFO L225 Difference]: With dead ends: 47 [2022-04-08 04:35:03,129 INFO L226 Difference]: Without dead ends: 23 [2022-04-08 04:35:03,131 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-08 04:35:03,133 INFO L913 BasicCegarLoop]: 26 mSDtfsCounter, 15 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 29 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-08 04:35:03,135 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [19 Valid, 29 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-08 04:35:03,146 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2022-04-08 04:35:03,156 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2022-04-08 04:35:03,156 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 04:35:03,157 INFO L82 GeneralOperation]: Start isEquivalent. First operand 23 states. Second operand has 23 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 14 states have internal predecessors, (15), 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 04:35:03,157 INFO L74 IsIncluded]: Start isIncluded. First operand 23 states. Second operand has 23 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 14 states have internal predecessors, (15), 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 04:35:03,158 INFO L87 Difference]: Start difference. First operand 23 states. Second operand has 23 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 14 states have internal predecessors, (15), 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 04:35:03,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 04:35:03,160 INFO L93 Difference]: Finished difference Result 23 states and 25 transitions. [2022-04-08 04:35:03,160 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 25 transitions. [2022-04-08 04:35:03,161 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 04:35:03,161 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 04:35:03,161 INFO L74 IsIncluded]: Start isIncluded. First operand has 23 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 14 states have internal predecessors, (15), 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 23 states. [2022-04-08 04:35:03,161 INFO L87 Difference]: Start difference. First operand has 23 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 14 states have internal predecessors, (15), 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 23 states. [2022-04-08 04:35:03,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 04:35:03,164 INFO L93 Difference]: Finished difference Result 23 states and 25 transitions. [2022-04-08 04:35:03,164 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 25 transitions. [2022-04-08 04:35:03,165 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 04:35:03,165 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 04:35:03,165 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 04:35:03,165 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 04:35:03,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 14 states have internal predecessors, (15), 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 04:35:03,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 25 transitions. [2022-04-08 04:35:03,168 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 25 transitions. Word has length 17 [2022-04-08 04:35:03,168 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 04:35:03,168 INFO L478 AbstractCegarLoop]: Abstraction has 23 states and 25 transitions. [2022-04-08 04:35:03,169 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-08 04:35:03,169 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 23 states and 25 transitions. [2022-04-08 04:35:03,201 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 25 edges. 25 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 04:35:03,202 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 25 transitions. [2022-04-08 04:35:03,202 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-04-08 04:35:03,202 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 04:35:03,202 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 04:35:03,203 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-08 04:35:03,203 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 04:35:03,203 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 04:35:03,204 INFO L85 PathProgramCache]: Analyzing trace with hash 51610547, now seen corresponding path program 1 times [2022-04-08 04:35:03,204 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 04:35:03,204 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1517808299] [2022-04-08 04:35:03,207 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 04:35:03,207 INFO L85 PathProgramCache]: Analyzing trace with hash 51610547, now seen corresponding path program 2 times [2022-04-08 04:35:03,208 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 04:35:03,208 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1456743778] [2022-04-08 04:35:03,208 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 04:35:03,208 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 04:35:03,241 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 04:35:03,242 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1365771663] [2022-04-08 04:35:03,242 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 04:35:03,242 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 04:35:03,242 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 04:35:03,244 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 04:35:03,260 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 04:35:03,291 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-04-08 04:35:03,291 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 04:35:03,304 INFO L263 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-08 04:35:03,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 04:35:03,315 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 04:35:03,467 INFO L272 TraceCheckUtils]: 0: Hoare triple {229#true} call ULTIMATE.init(); {229#true} is VALID [2022-04-08 04:35:03,467 INFO L290 TraceCheckUtils]: 1: Hoare triple {229#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); {229#true} is VALID [2022-04-08 04:35:03,468 INFO L290 TraceCheckUtils]: 2: Hoare triple {229#true} assume true; {229#true} is VALID [2022-04-08 04:35:03,468 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {229#true} {229#true} #60#return; {229#true} is VALID [2022-04-08 04:35:03,468 INFO L272 TraceCheckUtils]: 4: Hoare triple {229#true} call #t~ret5 := main(); {229#true} is VALID [2022-04-08 04:35:03,468 INFO L290 TraceCheckUtils]: 5: Hoare triple {229#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; {229#true} is VALID [2022-04-08 04:35:03,468 INFO L272 TraceCheckUtils]: 6: Hoare triple {229#true} call assume_abort_if_not((if ~k~0 <= 256 then 1 else 0)); {229#true} is VALID [2022-04-08 04:35:03,468 INFO L290 TraceCheckUtils]: 7: Hoare triple {229#true} ~cond := #in~cond; {229#true} is VALID [2022-04-08 04:35:03,469 INFO L290 TraceCheckUtils]: 8: Hoare triple {229#true} assume !(0 == ~cond); {229#true} is VALID [2022-04-08 04:35:03,469 INFO L290 TraceCheckUtils]: 9: Hoare triple {229#true} assume true; {229#true} is VALID [2022-04-08 04:35:03,469 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {229#true} {229#true} #52#return; {229#true} is VALID [2022-04-08 04:35:03,470 INFO L290 TraceCheckUtils]: 11: Hoare triple {229#true} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {267#(and (= main_~x~0 0) (= main_~y~0 0))} is VALID [2022-04-08 04:35:03,470 INFO L290 TraceCheckUtils]: 12: Hoare triple {267#(and (= main_~x~0 0) (= main_~y~0 0))} assume !false; {267#(and (= main_~x~0 0) (= main_~y~0 0))} is VALID [2022-04-08 04:35:03,472 INFO L272 TraceCheckUtils]: 13: Hoare triple {267#(and (= main_~x~0 0) (= main_~y~0 0))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {274#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 04:35:03,472 INFO L290 TraceCheckUtils]: 14: Hoare triple {274#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {278#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 04:35:03,473 INFO L290 TraceCheckUtils]: 15: Hoare triple {278#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {230#false} is VALID [2022-04-08 04:35:03,473 INFO L290 TraceCheckUtils]: 16: Hoare triple {230#false} assume !false; {230#false} is VALID [2022-04-08 04:35:03,473 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 04:35:03,473 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-08 04:35:03,474 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 04:35:03,474 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1456743778] [2022-04-08 04:35:03,474 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 04:35:03,474 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1365771663] [2022-04-08 04:35:03,475 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1365771663] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 04:35:03,475 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 04:35:03,475 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 04:35:03,476 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 04:35:03,476 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1517808299] [2022-04-08 04:35:03,476 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1517808299] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 04:35:03,476 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 04:35:03,476 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 04:35:03,476 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2077866912] [2022-04-08 04:35:03,476 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 04:35:03,478 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 17 [2022-04-08 04:35:03,479 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 04:35:03,479 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-08 04:35:03,492 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 17 edges. 17 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 04:35:03,492 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-08 04:35:03,492 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 04:35:03,493 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-08 04:35:03,493 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-08 04:35:03,494 INFO L87 Difference]: Start difference. First operand 23 states and 25 transitions. Second operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-08 04:35:03,628 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 04:35:03,628 INFO L93 Difference]: Finished difference Result 34 states and 38 transitions. [2022-04-08 04:35:03,629 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-08 04:35:03,629 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 17 [2022-04-08 04:35:03,629 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 04:35:03,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-08 04:35:03,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 38 transitions. [2022-04-08 04:35:03,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-08 04:35:03,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 38 transitions. [2022-04-08 04:35:03,644 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 38 transitions. [2022-04-08 04:35:03,676 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 04:35:03,678 INFO L225 Difference]: With dead ends: 34 [2022-04-08 04:35:03,679 INFO L226 Difference]: Without dead ends: 30 [2022-04-08 04:35:03,680 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 13 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 04:35:03,681 INFO L913 BasicCegarLoop]: 22 mSDtfsCounter, 6 mSDsluCounter, 55 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 77 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 04:35:03,684 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [8 Valid, 77 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-08 04:35:03,686 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2022-04-08 04:35:03,698 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2022-04-08 04:35:03,699 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 04:35:03,699 INFO L82 GeneralOperation]: Start isEquivalent. First operand 30 states. Second operand has 30 states, 18 states have (on average 1.1111111111111112) internal successors, (20), 19 states have internal predecessors, (20), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-08 04:35:03,700 INFO L74 IsIncluded]: Start isIncluded. First operand 30 states. Second operand has 30 states, 18 states have (on average 1.1111111111111112) internal successors, (20), 19 states have internal predecessors, (20), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-08 04:35:03,701 INFO L87 Difference]: Start difference. First operand 30 states. Second operand has 30 states, 18 states have (on average 1.1111111111111112) internal successors, (20), 19 states have internal predecessors, (20), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-08 04:35:03,705 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 04:35:03,705 INFO L93 Difference]: Finished difference Result 30 states and 32 transitions. [2022-04-08 04:35:03,705 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 32 transitions. [2022-04-08 04:35:03,706 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 04:35:03,706 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 04:35:03,706 INFO L74 IsIncluded]: Start isIncluded. First operand has 30 states, 18 states have (on average 1.1111111111111112) internal successors, (20), 19 states have internal predecessors, (20), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand 30 states. [2022-04-08 04:35:03,707 INFO L87 Difference]: Start difference. First operand has 30 states, 18 states have (on average 1.1111111111111112) internal successors, (20), 19 states have internal predecessors, (20), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand 30 states. [2022-04-08 04:35:03,709 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 04:35:03,710 INFO L93 Difference]: Finished difference Result 30 states and 32 transitions. [2022-04-08 04:35:03,710 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 32 transitions. [2022-04-08 04:35:03,711 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 04:35:03,711 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 04:35:03,711 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 04:35:03,711 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 04:35:03,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 18 states have (on average 1.1111111111111112) internal successors, (20), 19 states have internal predecessors, (20), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-08 04:35:03,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 32 transitions. [2022-04-08 04:35:03,719 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 32 transitions. Word has length 17 [2022-04-08 04:35:03,720 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 04:35:03,720 INFO L478 AbstractCegarLoop]: Abstraction has 30 states and 32 transitions. [2022-04-08 04:35:03,720 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-08 04:35:03,721 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 30 states and 32 transitions. [2022-04-08 04:35:03,751 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 04:35:03,752 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 32 transitions. [2022-04-08 04:35:03,755 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-04-08 04:35:03,755 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 04:35:03,759 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 04:35:03,778 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 04:35:03,967 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 04:35:03,968 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 04:35:03,968 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 04:35:03,968 INFO L85 PathProgramCache]: Analyzing trace with hash 311787922, now seen corresponding path program 1 times [2022-04-08 04:35:03,968 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 04:35:03,968 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1613537463] [2022-04-08 04:35:04,203 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 3 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-08 04:35:04,203 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONLINEAR_UPDATE [2022-04-08 04:35:04,203 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 04:35:04,203 INFO L85 PathProgramCache]: Analyzing trace with hash 311787922, now seen corresponding path program 2 times [2022-04-08 04:35:04,204 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 04:35:04,204 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [864185361] [2022-04-08 04:35:04,204 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 04:35:04,204 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 04:35:04,214 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 04:35:04,214 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [493345525] [2022-04-08 04:35:04,214 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 04:35:04,214 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 04:35:04,214 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 04:35:04,219 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 04:35:04,222 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 04:35:04,257 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 04:35:04,258 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 04:35:04,259 INFO L263 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 11 conjunts are in the unsatisfiable core [2022-04-08 04:35:04,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 04:35:04,267 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 04:35:04,388 INFO L272 TraceCheckUtils]: 0: Hoare triple {474#true} call ULTIMATE.init(); {474#true} is VALID [2022-04-08 04:35:04,389 INFO L290 TraceCheckUtils]: 1: Hoare triple {474#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); {474#true} is VALID [2022-04-08 04:35:04,389 INFO L290 TraceCheckUtils]: 2: Hoare triple {474#true} assume true; {474#true} is VALID [2022-04-08 04:35:04,389 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {474#true} {474#true} #60#return; {474#true} is VALID [2022-04-08 04:35:04,389 INFO L272 TraceCheckUtils]: 4: Hoare triple {474#true} call #t~ret5 := main(); {474#true} is VALID [2022-04-08 04:35:04,389 INFO L290 TraceCheckUtils]: 5: Hoare triple {474#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; {474#true} is VALID [2022-04-08 04:35:04,389 INFO L272 TraceCheckUtils]: 6: Hoare triple {474#true} call assume_abort_if_not((if ~k~0 <= 256 then 1 else 0)); {474#true} is VALID [2022-04-08 04:35:04,389 INFO L290 TraceCheckUtils]: 7: Hoare triple {474#true} ~cond := #in~cond; {474#true} is VALID [2022-04-08 04:35:04,389 INFO L290 TraceCheckUtils]: 8: Hoare triple {474#true} assume !(0 == ~cond); {474#true} is VALID [2022-04-08 04:35:04,390 INFO L290 TraceCheckUtils]: 9: Hoare triple {474#true} assume true; {474#true} is VALID [2022-04-08 04:35:04,390 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {474#true} {474#true} #52#return; {474#true} is VALID [2022-04-08 04:35:04,390 INFO L290 TraceCheckUtils]: 11: Hoare triple {474#true} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {512#(and (= main_~x~0 0) (= main_~y~0 0))} is VALID [2022-04-08 04:35:04,390 INFO L290 TraceCheckUtils]: 12: Hoare triple {512#(and (= main_~x~0 0) (= main_~y~0 0))} assume !false; {512#(and (= main_~x~0 0) (= main_~y~0 0))} is VALID [2022-04-08 04:35:04,391 INFO L272 TraceCheckUtils]: 13: Hoare triple {512#(and (= main_~x~0 0) (= main_~y~0 0))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {474#true} is VALID [2022-04-08 04:35:04,391 INFO L290 TraceCheckUtils]: 14: Hoare triple {474#true} ~cond := #in~cond; {474#true} is VALID [2022-04-08 04:35:04,391 INFO L290 TraceCheckUtils]: 15: Hoare triple {474#true} assume !(0 == ~cond); {474#true} is VALID [2022-04-08 04:35:04,391 INFO L290 TraceCheckUtils]: 16: Hoare triple {474#true} assume true; {474#true} is VALID [2022-04-08 04:35:04,392 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {474#true} {512#(and (= main_~x~0 0) (= main_~y~0 0))} #54#return; {512#(and (= main_~x~0 0) (= main_~y~0 0))} is VALID [2022-04-08 04:35:04,392 INFO L290 TraceCheckUtils]: 18: Hoare triple {512#(and (= main_~x~0 0) (= main_~y~0 0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {534#(and (= main_~y~0 1) (= main_~x~0 (* main_~y~0 (* (* main_~y~0 (* main_~y~0 main_~y~0)) main_~y~0))))} is VALID [2022-04-08 04:35:04,393 INFO L290 TraceCheckUtils]: 19: Hoare triple {534#(and (= main_~y~0 1) (= main_~x~0 (* main_~y~0 (* (* main_~y~0 (* main_~y~0 main_~y~0)) main_~y~0))))} assume !false; {534#(and (= main_~y~0 1) (= main_~x~0 (* main_~y~0 (* (* main_~y~0 (* main_~y~0 main_~y~0)) main_~y~0))))} is VALID [2022-04-08 04:35:04,393 INFO L272 TraceCheckUtils]: 20: Hoare triple {534#(and (= main_~y~0 1) (= main_~x~0 (* main_~y~0 (* (* main_~y~0 (* main_~y~0 main_~y~0)) main_~y~0))))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {541#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 04:35:04,394 INFO L290 TraceCheckUtils]: 21: Hoare triple {541#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {545#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 04:35:04,394 INFO L290 TraceCheckUtils]: 22: Hoare triple {545#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {475#false} is VALID [2022-04-08 04:35:04,394 INFO L290 TraceCheckUtils]: 23: Hoare triple {475#false} assume !false; {475#false} is VALID [2022-04-08 04:35:04,395 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 04:35:04,395 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 04:35:04,541 INFO L290 TraceCheckUtils]: 23: Hoare triple {475#false} assume !false; {475#false} is VALID [2022-04-08 04:35:04,541 INFO L290 TraceCheckUtils]: 22: Hoare triple {545#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {475#false} is VALID [2022-04-08 04:35:04,542 INFO L290 TraceCheckUtils]: 21: Hoare triple {541#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {545#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 04:35:04,543 INFO L272 TraceCheckUtils]: 20: Hoare triple {561#(= (+ (* 2 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (* 6 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (* 5 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0))) (+ (* main_~x~0 12) (* main_~y~0 main_~y~0)))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {541#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 04:35:04,543 INFO L290 TraceCheckUtils]: 19: Hoare triple {561#(= (+ (* 2 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (* 6 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (* 5 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0))) (+ (* main_~x~0 12) (* main_~y~0 main_~y~0)))} assume !false; {561#(= (+ (* 2 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (* 6 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (* 5 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0))) (+ (* main_~x~0 12) (* main_~y~0 main_~y~0)))} is VALID [2022-04-08 04:35:04,660 INFO L290 TraceCheckUtils]: 18: Hoare triple {561#(= (+ (* 2 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (* 6 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (* 5 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0))) (+ (* main_~x~0 12) (* main_~y~0 main_~y~0)))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {561#(= (+ (* 2 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (* 6 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (* 5 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0))) (+ (* main_~x~0 12) (* main_~y~0 main_~y~0)))} is VALID [2022-04-08 04:35:04,661 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {474#true} {561#(= (+ (* 2 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (* 6 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (* 5 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0))) (+ (* main_~x~0 12) (* main_~y~0 main_~y~0)))} #54#return; {561#(= (+ (* 2 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (* 6 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (* 5 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0))) (+ (* main_~x~0 12) (* main_~y~0 main_~y~0)))} is VALID [2022-04-08 04:35:04,661 INFO L290 TraceCheckUtils]: 16: Hoare triple {474#true} assume true; {474#true} is VALID [2022-04-08 04:35:04,662 INFO L290 TraceCheckUtils]: 15: Hoare triple {474#true} assume !(0 == ~cond); {474#true} is VALID [2022-04-08 04:35:04,662 INFO L290 TraceCheckUtils]: 14: Hoare triple {474#true} ~cond := #in~cond; {474#true} is VALID [2022-04-08 04:35:04,662 INFO L272 TraceCheckUtils]: 13: Hoare triple {561#(= (+ (* 2 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (* 6 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (* 5 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0))) (+ (* main_~x~0 12) (* main_~y~0 main_~y~0)))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {474#true} is VALID [2022-04-08 04:35:04,663 INFO L290 TraceCheckUtils]: 12: Hoare triple {561#(= (+ (* 2 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (* 6 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (* 5 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0))) (+ (* main_~x~0 12) (* main_~y~0 main_~y~0)))} assume !false; {561#(= (+ (* 2 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (* 6 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (* 5 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0))) (+ (* main_~x~0 12) (* main_~y~0 main_~y~0)))} is VALID [2022-04-08 04:35:04,664 INFO L290 TraceCheckUtils]: 11: Hoare triple {474#true} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {561#(= (+ (* 2 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (* 6 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (* 5 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0))) (+ (* main_~x~0 12) (* main_~y~0 main_~y~0)))} is VALID [2022-04-08 04:35:04,664 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {474#true} {474#true} #52#return; {474#true} is VALID [2022-04-08 04:35:04,664 INFO L290 TraceCheckUtils]: 9: Hoare triple {474#true} assume true; {474#true} is VALID [2022-04-08 04:35:04,664 INFO L290 TraceCheckUtils]: 8: Hoare triple {474#true} assume !(0 == ~cond); {474#true} is VALID [2022-04-08 04:35:04,664 INFO L290 TraceCheckUtils]: 7: Hoare triple {474#true} ~cond := #in~cond; {474#true} is VALID [2022-04-08 04:35:04,664 INFO L272 TraceCheckUtils]: 6: Hoare triple {474#true} call assume_abort_if_not((if ~k~0 <= 256 then 1 else 0)); {474#true} is VALID [2022-04-08 04:35:04,664 INFO L290 TraceCheckUtils]: 5: Hoare triple {474#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; {474#true} is VALID [2022-04-08 04:35:04,664 INFO L272 TraceCheckUtils]: 4: Hoare triple {474#true} call #t~ret5 := main(); {474#true} is VALID [2022-04-08 04:35:04,665 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {474#true} {474#true} #60#return; {474#true} is VALID [2022-04-08 04:35:04,665 INFO L290 TraceCheckUtils]: 2: Hoare triple {474#true} assume true; {474#true} is VALID [2022-04-08 04:35:04,665 INFO L290 TraceCheckUtils]: 1: Hoare triple {474#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); {474#true} is VALID [2022-04-08 04:35:04,665 INFO L272 TraceCheckUtils]: 0: Hoare triple {474#true} call ULTIMATE.init(); {474#true} is VALID [2022-04-08 04:35:04,665 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-08 04:35:04,665 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 04:35:04,665 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [864185361] [2022-04-08 04:35:04,666 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 04:35:04,666 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [493345525] [2022-04-08 04:35:04,666 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [493345525] provided 1 perfect and 1 imperfect interpolant sequences [2022-04-08 04:35:04,666 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-04-08 04:35:04,666 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 7 [2022-04-08 04:35:04,666 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 04:35:04,666 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1613537463] [2022-04-08 04:35:04,666 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1613537463] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 04:35:04,666 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 04:35:04,667 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 04:35:04,667 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1751264150] [2022-04-08 04:35:04,667 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 04:35:04,667 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 24 [2022-04-08 04:35:04,667 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 04:35:04,668 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-08 04:35:04,857 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 04:35:04,858 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-08 04:35:04,858 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 04:35:04,858 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-08 04:35:04,858 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-04-08 04:35:04,858 INFO L87 Difference]: Start difference. First operand 30 states and 32 transitions. Second operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-08 04:35:04,977 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 04:35:04,977 INFO L93 Difference]: Finished difference Result 36 states and 37 transitions. [2022-04-08 04:35:04,977 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-08 04:35:04,977 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 24 [2022-04-08 04:35:04,977 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 04:35:04,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-08 04:35:04,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 30 transitions. [2022-04-08 04:35:04,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-08 04:35:04,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 30 transitions. [2022-04-08 04:35:04,979 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 30 transitions. [2022-04-08 04:35:05,084 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 04:35:05,085 INFO L225 Difference]: With dead ends: 36 [2022-04-08 04:35:05,085 INFO L226 Difference]: Without dead ends: 32 [2022-04-08 04:35:05,086 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 40 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-04-08 04:35:05,086 INFO L913 BasicCegarLoop]: 20 mSDtfsCounter, 6 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 67 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-08 04:35:05,087 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [7 Valid, 67 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-08 04:35:05,087 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2022-04-08 04:35:05,098 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2022-04-08 04:35:05,098 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 04:35:05,099 INFO L82 GeneralOperation]: Start isEquivalent. First operand 32 states. Second operand has 32 states, 20 states have (on average 1.05) internal successors, (21), 20 states have internal predecessors, (21), 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 04:35:05,099 INFO L74 IsIncluded]: Start isIncluded. First operand 32 states. Second operand has 32 states, 20 states have (on average 1.05) internal successors, (21), 20 states have internal predecessors, (21), 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 04:35:05,099 INFO L87 Difference]: Start difference. First operand 32 states. Second operand has 32 states, 20 states have (on average 1.05) internal successors, (21), 20 states have internal predecessors, (21), 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 04:35:05,100 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 04:35:05,100 INFO L93 Difference]: Finished difference Result 32 states and 33 transitions. [2022-04-08 04:35:05,101 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 33 transitions. [2022-04-08 04:35:05,101 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 04:35:05,101 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 04:35:05,101 INFO L74 IsIncluded]: Start isIncluded. First operand has 32 states, 20 states have (on average 1.05) internal successors, (21), 20 states have internal predecessors, (21), 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 32 states. [2022-04-08 04:35:05,101 INFO L87 Difference]: Start difference. First operand has 32 states, 20 states have (on average 1.05) internal successors, (21), 20 states have internal predecessors, (21), 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 32 states. [2022-04-08 04:35:05,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 04:35:05,102 INFO L93 Difference]: Finished difference Result 32 states and 33 transitions. [2022-04-08 04:35:05,102 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 33 transitions. [2022-04-08 04:35:05,103 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 04:35:05,103 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 04:35:05,103 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 04:35:05,103 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 04:35:05,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 20 states have (on average 1.05) internal successors, (21), 20 states have internal predecessors, (21), 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 04:35:05,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 33 transitions. [2022-04-08 04:35:05,104 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 33 transitions. Word has length 24 [2022-04-08 04:35:05,104 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 04:35:05,104 INFO L478 AbstractCegarLoop]: Abstraction has 32 states and 33 transitions. [2022-04-08 04:35:05,104 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-08 04:35:05,104 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 32 states and 33 transitions. [2022-04-08 04:35:05,216 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 04:35:05,216 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 33 transitions. [2022-04-08 04:35:05,217 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-04-08 04:35:05,217 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 04:35:05,217 INFO L499 BasicCegarLoop]: trace histogram [4, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 04:35:05,233 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2022-04-08 04:35:05,417 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 04:35:05,418 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 04:35:05,418 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 04:35:05,418 INFO L85 PathProgramCache]: Analyzing trace with hash 1106328449, now seen corresponding path program 1 times [2022-04-08 04:35:05,418 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 04:35:05,418 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [240326228] [2022-04-08 04:35:05,592 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 3 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-08 04:35:05,592 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONLINEAR_UPDATE [2022-04-08 04:35:05,592 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 04:35:05,592 INFO L85 PathProgramCache]: Analyzing trace with hash 1106328449, now seen corresponding path program 2 times [2022-04-08 04:35:05,592 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 04:35:05,593 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1024986585] [2022-04-08 04:35:05,593 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 04:35:05,593 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 04:35:05,605 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 04:35:05,606 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [370431184] [2022-04-08 04:35:05,606 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 04:35:05,606 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 04:35:05,606 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 04:35:05,612 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 04:35:05,612 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 04:35:05,647 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 04:35:05,647 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 04:35:05,648 INFO L263 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 12 conjunts are in the unsatisfiable core [2022-04-08 04:35:05,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 04:35:05,660 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 04:35:05,939 INFO L272 TraceCheckUtils]: 0: Hoare triple {826#true} call ULTIMATE.init(); {826#true} is VALID [2022-04-08 04:35:05,939 INFO L290 TraceCheckUtils]: 1: Hoare triple {826#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); {826#true} is VALID [2022-04-08 04:35:05,940 INFO L290 TraceCheckUtils]: 2: Hoare triple {826#true} assume true; {826#true} is VALID [2022-04-08 04:35:05,940 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {826#true} {826#true} #60#return; {826#true} is VALID [2022-04-08 04:35:05,940 INFO L272 TraceCheckUtils]: 4: Hoare triple {826#true} call #t~ret5 := main(); {826#true} is VALID [2022-04-08 04:35:05,940 INFO L290 TraceCheckUtils]: 5: Hoare triple {826#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; {826#true} is VALID [2022-04-08 04:35:05,940 INFO L272 TraceCheckUtils]: 6: Hoare triple {826#true} call assume_abort_if_not((if ~k~0 <= 256 then 1 else 0)); {826#true} is VALID [2022-04-08 04:35:05,940 INFO L290 TraceCheckUtils]: 7: Hoare triple {826#true} ~cond := #in~cond; {826#true} is VALID [2022-04-08 04:35:05,940 INFO L290 TraceCheckUtils]: 8: Hoare triple {826#true} assume !(0 == ~cond); {826#true} is VALID [2022-04-08 04:35:05,940 INFO L290 TraceCheckUtils]: 9: Hoare triple {826#true} assume true; {826#true} is VALID [2022-04-08 04:35:05,940 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {826#true} {826#true} #52#return; {826#true} is VALID [2022-04-08 04:35:05,941 INFO L290 TraceCheckUtils]: 11: Hoare triple {826#true} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {864#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-08 04:35:05,941 INFO L290 TraceCheckUtils]: 12: Hoare triple {864#(and (= main_~c~0 0) (= main_~y~0 0))} assume !false; {864#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-08 04:35:05,941 INFO L272 TraceCheckUtils]: 13: Hoare triple {864#(and (= main_~c~0 0) (= main_~y~0 0))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {826#true} is VALID [2022-04-08 04:35:05,942 INFO L290 TraceCheckUtils]: 14: Hoare triple {826#true} ~cond := #in~cond; {826#true} is VALID [2022-04-08 04:35:05,942 INFO L290 TraceCheckUtils]: 15: Hoare triple {826#true} assume !(0 == ~cond); {826#true} is VALID [2022-04-08 04:35:05,942 INFO L290 TraceCheckUtils]: 16: Hoare triple {826#true} assume true; {826#true} is VALID [2022-04-08 04:35:05,944 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {826#true} {864#(and (= main_~c~0 0) (= main_~y~0 0))} #54#return; {864#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-08 04:35:05,945 INFO L290 TraceCheckUtils]: 18: Hoare triple {864#(and (= main_~c~0 0) (= main_~y~0 0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {886#(and (= (+ (- 1) main_~y~0) 0) (< 0 main_~k~0) (<= main_~c~0 1))} is VALID [2022-04-08 04:35:05,946 INFO L290 TraceCheckUtils]: 19: Hoare triple {886#(and (= (+ (- 1) main_~y~0) 0) (< 0 main_~k~0) (<= main_~c~0 1))} assume !false; {886#(and (= (+ (- 1) main_~y~0) 0) (< 0 main_~k~0) (<= main_~c~0 1))} is VALID [2022-04-08 04:35:05,946 INFO L272 TraceCheckUtils]: 20: Hoare triple {886#(and (= (+ (- 1) main_~y~0) 0) (< 0 main_~k~0) (<= main_~c~0 1))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {826#true} is VALID [2022-04-08 04:35:05,946 INFO L290 TraceCheckUtils]: 21: Hoare triple {826#true} ~cond := #in~cond; {826#true} is VALID [2022-04-08 04:35:05,946 INFO L290 TraceCheckUtils]: 22: Hoare triple {826#true} assume !(0 == ~cond); {826#true} is VALID [2022-04-08 04:35:05,946 INFO L290 TraceCheckUtils]: 23: Hoare triple {826#true} assume true; {826#true} is VALID [2022-04-08 04:35:05,946 INFO L284 TraceCheckUtils]: 24: Hoare quadruple {826#true} {886#(and (= (+ (- 1) main_~y~0) 0) (< 0 main_~k~0) (<= main_~c~0 1))} #54#return; {886#(and (= (+ (- 1) main_~y~0) 0) (< 0 main_~k~0) (<= main_~c~0 1))} is VALID [2022-04-08 04:35:05,947 INFO L290 TraceCheckUtils]: 25: Hoare triple {886#(and (= (+ (- 1) main_~y~0) 0) (< 0 main_~k~0) (<= main_~c~0 1))} assume !(~c~0 < ~k~0); {908#(and (= (+ (- 1) main_~y~0) 0) (<= main_~k~0 1) (< 0 main_~k~0))} is VALID [2022-04-08 04:35:05,947 INFO L272 TraceCheckUtils]: 26: Hoare triple {908#(and (= (+ (- 1) main_~y~0) 0) (<= main_~k~0 1) (< 0 main_~k~0))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {826#true} is VALID [2022-04-08 04:35:05,947 INFO L290 TraceCheckUtils]: 27: Hoare triple {826#true} ~cond := #in~cond; {826#true} is VALID [2022-04-08 04:35:05,947 INFO L290 TraceCheckUtils]: 28: Hoare triple {826#true} assume !(0 == ~cond); {826#true} is VALID [2022-04-08 04:35:05,947 INFO L290 TraceCheckUtils]: 29: Hoare triple {826#true} assume true; {826#true} is VALID [2022-04-08 04:35:05,949 INFO L284 TraceCheckUtils]: 30: Hoare quadruple {826#true} {908#(and (= (+ (- 1) main_~y~0) 0) (<= main_~k~0 1) (< 0 main_~k~0))} #56#return; {908#(and (= (+ (- 1) main_~y~0) 0) (<= main_~k~0 1) (< 0 main_~k~0))} is VALID [2022-04-08 04:35:05,960 INFO L272 TraceCheckUtils]: 31: Hoare triple {908#(and (= (+ (- 1) main_~y~0) 0) (<= main_~k~0 1) (< 0 main_~k~0))} call __VERIFIER_assert((if ~k~0 * ~y~0 == ~y~0 * ~y~0 then 1 else 0)); {927#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 04:35:05,961 INFO L290 TraceCheckUtils]: 32: Hoare triple {927#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {931#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 04:35:05,961 INFO L290 TraceCheckUtils]: 33: Hoare triple {931#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {827#false} is VALID [2022-04-08 04:35:05,961 INFO L290 TraceCheckUtils]: 34: Hoare triple {827#false} assume !false; {827#false} is VALID [2022-04-08 04:35:05,961 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-04-08 04:35:05,961 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 04:35:06,285 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 04:35:06,285 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1024986585] [2022-04-08 04:35:06,285 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 04:35:06,285 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [370431184] [2022-04-08 04:35:06,285 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [370431184] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 04:35:06,285 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-08 04:35:06,285 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2022-04-08 04:35:06,286 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 04:35:06,286 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [240326228] [2022-04-08 04:35:06,286 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [240326228] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 04:35:06,286 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 04:35:06,286 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-08 04:35:06,286 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1573393607] [2022-04-08 04:35:06,286 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 04:35:06,286 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 states have internal predecessors, (17), 4 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) Word has length 35 [2022-04-08 04:35:06,287 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 04:35:06,287 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 7 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 states have internal predecessors, (17), 4 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) [2022-04-08 04:35:06,312 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 04:35:06,312 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-08 04:35:06,312 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 04:35:06,313 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-08 04:35:06,313 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2022-04-08 04:35:06,313 INFO L87 Difference]: Start difference. First operand 32 states and 33 transitions. Second operand has 7 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 states have internal predecessors, (17), 4 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) [2022-04-08 04:35:06,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 04:35:06,535 INFO L93 Difference]: Finished difference Result 41 states and 44 transitions. [2022-04-08 04:35:06,535 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-08 04:35:06,535 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 states have internal predecessors, (17), 4 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) Word has length 35 [2022-04-08 04:35:06,535 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 04:35:06,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 states have internal predecessors, (17), 4 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) [2022-04-08 04:35:06,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 40 transitions. [2022-04-08 04:35:06,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 states have internal predecessors, (17), 4 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) [2022-04-08 04:35:06,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 40 transitions. [2022-04-08 04:35:06,538 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 40 transitions. [2022-04-08 04:35:06,569 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 04:35:06,570 INFO L225 Difference]: With dead ends: 41 [2022-04-08 04:35:06,571 INFO L226 Difference]: Without dead ends: 35 [2022-04-08 04:35:06,571 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 43 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 04:35:06,572 INFO L913 BasicCegarLoop]: 28 mSDtfsCounter, 2 mSDsluCounter, 97 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 125 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 57 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-08 04:35:06,572 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [2 Valid, 125 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-08 04:35:06,573 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2022-04-08 04:35:06,589 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2022-04-08 04:35:06,589 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 04:35:06,590 INFO L82 GeneralOperation]: Start isEquivalent. First operand 35 states. Second operand has 35 states, 22 states have (on average 1.0454545454545454) internal successors, (23), 22 states have internal predecessors, (23), 8 states have call successors, (8), 6 states have call predecessors, (8), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-08 04:35:06,590 INFO L74 IsIncluded]: Start isIncluded. First operand 35 states. Second operand has 35 states, 22 states have (on average 1.0454545454545454) internal successors, (23), 22 states have internal predecessors, (23), 8 states have call successors, (8), 6 states have call predecessors, (8), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-08 04:35:06,590 INFO L87 Difference]: Start difference. First operand 35 states. Second operand has 35 states, 22 states have (on average 1.0454545454545454) internal successors, (23), 22 states have internal predecessors, (23), 8 states have call successors, (8), 6 states have call predecessors, (8), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-08 04:35:06,591 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 04:35:06,592 INFO L93 Difference]: Finished difference Result 35 states and 37 transitions. [2022-04-08 04:35:06,592 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 37 transitions. [2022-04-08 04:35:06,592 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 04:35:06,592 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 04:35:06,592 INFO L74 IsIncluded]: Start isIncluded. First operand has 35 states, 22 states have (on average 1.0454545454545454) internal successors, (23), 22 states have internal predecessors, (23), 8 states have call successors, (8), 6 states have call predecessors, (8), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand 35 states. [2022-04-08 04:35:06,592 INFO L87 Difference]: Start difference. First operand has 35 states, 22 states have (on average 1.0454545454545454) internal successors, (23), 22 states have internal predecessors, (23), 8 states have call successors, (8), 6 states have call predecessors, (8), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand 35 states. [2022-04-08 04:35:06,594 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 04:35:06,594 INFO L93 Difference]: Finished difference Result 35 states and 37 transitions. [2022-04-08 04:35:06,594 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 37 transitions. [2022-04-08 04:35:06,594 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 04:35:06,594 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 04:35:06,594 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 04:35:06,595 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 04:35:06,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 22 states have (on average 1.0454545454545454) internal successors, (23), 22 states have internal predecessors, (23), 8 states have call successors, (8), 6 states have call predecessors, (8), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-08 04:35:06,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 37 transitions. [2022-04-08 04:35:06,596 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 37 transitions. Word has length 35 [2022-04-08 04:35:06,596 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 04:35:06,596 INFO L478 AbstractCegarLoop]: Abstraction has 35 states and 37 transitions. [2022-04-08 04:35:06,596 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 states have internal predecessors, (17), 4 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) [2022-04-08 04:35:06,597 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 35 states and 37 transitions. [2022-04-08 04:35:06,783 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 37 edges. 37 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 04:35:06,783 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 37 transitions. [2022-04-08 04:35:06,784 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2022-04-08 04:35:06,784 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 04:35:06,784 INFO L499 BasicCegarLoop]: trace histogram [5, 4, 4, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 04:35:06,805 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 04:35:06,984 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 04:35:06,985 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 04:35:06,985 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 04:35:06,985 INFO L85 PathProgramCache]: Analyzing trace with hash 1564024736, now seen corresponding path program 3 times [2022-04-08 04:35:06,985 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 04:35:06,985 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1372914936] [2022-04-08 04:35:07,092 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 3 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-08 04:35:07,092 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONLINEAR_UPDATE [2022-04-08 04:35:07,093 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 04:35:07,093 INFO L85 PathProgramCache]: Analyzing trace with hash 1564024736, now seen corresponding path program 4 times [2022-04-08 04:35:07,093 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 04:35:07,093 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [680396501] [2022-04-08 04:35:07,093 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 04:35:07,093 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 04:35:07,108 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 04:35:07,108 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [92963405] [2022-04-08 04:35:07,108 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-08 04:35:07,108 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 04:35:07,108 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 04:35:07,109 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 04:35:07,110 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 04:35:07,139 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-08 04:35:07,139 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 04:35:07,140 INFO L263 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 16 conjunts are in the unsatisfiable core [2022-04-08 04:35:07,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 04:35:07,149 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 04:35:07,444 INFO L272 TraceCheckUtils]: 0: Hoare triple {1220#true} call ULTIMATE.init(); {1220#true} is VALID [2022-04-08 04:35:07,444 INFO L290 TraceCheckUtils]: 1: Hoare triple {1220#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); {1220#true} is VALID [2022-04-08 04:35:07,444 INFO L290 TraceCheckUtils]: 2: Hoare triple {1220#true} assume true; {1220#true} is VALID [2022-04-08 04:35:07,445 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1220#true} {1220#true} #60#return; {1220#true} is VALID [2022-04-08 04:35:07,445 INFO L272 TraceCheckUtils]: 4: Hoare triple {1220#true} call #t~ret5 := main(); {1220#true} is VALID [2022-04-08 04:35:07,445 INFO L290 TraceCheckUtils]: 5: Hoare triple {1220#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; {1220#true} is VALID [2022-04-08 04:35:07,445 INFO L272 TraceCheckUtils]: 6: Hoare triple {1220#true} call assume_abort_if_not((if ~k~0 <= 256 then 1 else 0)); {1220#true} is VALID [2022-04-08 04:35:07,445 INFO L290 TraceCheckUtils]: 7: Hoare triple {1220#true} ~cond := #in~cond; {1220#true} is VALID [2022-04-08 04:35:07,445 INFO L290 TraceCheckUtils]: 8: Hoare triple {1220#true} assume !(0 == ~cond); {1220#true} is VALID [2022-04-08 04:35:07,445 INFO L290 TraceCheckUtils]: 9: Hoare triple {1220#true} assume true; {1220#true} is VALID [2022-04-08 04:35:07,445 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1220#true} {1220#true} #52#return; {1220#true} is VALID [2022-04-08 04:35:07,445 INFO L290 TraceCheckUtils]: 11: Hoare triple {1220#true} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {1258#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-08 04:35:07,446 INFO L290 TraceCheckUtils]: 12: Hoare triple {1258#(and (= main_~c~0 0) (= main_~y~0 0))} assume !false; {1258#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-08 04:35:07,446 INFO L272 TraceCheckUtils]: 13: Hoare triple {1258#(and (= main_~c~0 0) (= main_~y~0 0))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {1220#true} is VALID [2022-04-08 04:35:07,446 INFO L290 TraceCheckUtils]: 14: Hoare triple {1220#true} ~cond := #in~cond; {1220#true} is VALID [2022-04-08 04:35:07,446 INFO L290 TraceCheckUtils]: 15: Hoare triple {1220#true} assume !(0 == ~cond); {1220#true} is VALID [2022-04-08 04:35:07,446 INFO L290 TraceCheckUtils]: 16: Hoare triple {1220#true} assume true; {1220#true} is VALID [2022-04-08 04:35:07,447 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {1220#true} {1258#(and (= main_~c~0 0) (= main_~y~0 0))} #54#return; {1258#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-08 04:35:07,447 INFO L290 TraceCheckUtils]: 18: Hoare triple {1258#(and (= main_~c~0 0) (= main_~y~0 0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {1280#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} is VALID [2022-04-08 04:35:07,448 INFO L290 TraceCheckUtils]: 19: Hoare triple {1280#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} assume !false; {1280#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} is VALID [2022-04-08 04:35:07,448 INFO L272 TraceCheckUtils]: 20: Hoare triple {1280#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {1220#true} is VALID [2022-04-08 04:35:07,448 INFO L290 TraceCheckUtils]: 21: Hoare triple {1220#true} ~cond := #in~cond; {1220#true} is VALID [2022-04-08 04:35:07,448 INFO L290 TraceCheckUtils]: 22: Hoare triple {1220#true} assume !(0 == ~cond); {1220#true} is VALID [2022-04-08 04:35:07,448 INFO L290 TraceCheckUtils]: 23: Hoare triple {1220#true} assume true; {1220#true} is VALID [2022-04-08 04:35:07,448 INFO L284 TraceCheckUtils]: 24: Hoare quadruple {1220#true} {1280#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} #54#return; {1280#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} is VALID [2022-04-08 04:35:07,449 INFO L290 TraceCheckUtils]: 25: Hoare triple {1280#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {1302#(and (< 1 main_~k~0) (= (+ (- 2) main_~y~0) 0) (<= main_~c~0 2))} is VALID [2022-04-08 04:35:07,449 INFO L290 TraceCheckUtils]: 26: Hoare triple {1302#(and (< 1 main_~k~0) (= (+ (- 2) main_~y~0) 0) (<= main_~c~0 2))} assume !false; {1302#(and (< 1 main_~k~0) (= (+ (- 2) main_~y~0) 0) (<= main_~c~0 2))} is VALID [2022-04-08 04:35:07,449 INFO L272 TraceCheckUtils]: 27: Hoare triple {1302#(and (< 1 main_~k~0) (= (+ (- 2) main_~y~0) 0) (<= main_~c~0 2))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {1220#true} is VALID [2022-04-08 04:35:07,449 INFO L290 TraceCheckUtils]: 28: Hoare triple {1220#true} ~cond := #in~cond; {1220#true} is VALID [2022-04-08 04:35:07,450 INFO L290 TraceCheckUtils]: 29: Hoare triple {1220#true} assume !(0 == ~cond); {1220#true} is VALID [2022-04-08 04:35:07,450 INFO L290 TraceCheckUtils]: 30: Hoare triple {1220#true} assume true; {1220#true} is VALID [2022-04-08 04:35:07,450 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {1220#true} {1302#(and (< 1 main_~k~0) (= (+ (- 2) main_~y~0) 0) (<= main_~c~0 2))} #54#return; {1302#(and (< 1 main_~k~0) (= (+ (- 2) main_~y~0) 0) (<= main_~c~0 2))} is VALID [2022-04-08 04:35:07,450 INFO L290 TraceCheckUtils]: 32: Hoare triple {1302#(and (< 1 main_~k~0) (= (+ (- 2) main_~y~0) 0) (<= main_~c~0 2))} assume !(~c~0 < ~k~0); {1324#(and (< 1 main_~k~0) (= (+ (- 2) main_~y~0) 0) (<= main_~k~0 2))} is VALID [2022-04-08 04:35:07,451 INFO L272 TraceCheckUtils]: 33: Hoare triple {1324#(and (< 1 main_~k~0) (= (+ (- 2) main_~y~0) 0) (<= main_~k~0 2))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {1220#true} is VALID [2022-04-08 04:35:07,451 INFO L290 TraceCheckUtils]: 34: Hoare triple {1220#true} ~cond := #in~cond; {1220#true} is VALID [2022-04-08 04:35:07,451 INFO L290 TraceCheckUtils]: 35: Hoare triple {1220#true} assume !(0 == ~cond); {1220#true} is VALID [2022-04-08 04:35:07,451 INFO L290 TraceCheckUtils]: 36: Hoare triple {1220#true} assume true; {1220#true} is VALID [2022-04-08 04:35:07,451 INFO L284 TraceCheckUtils]: 37: Hoare quadruple {1220#true} {1324#(and (< 1 main_~k~0) (= (+ (- 2) main_~y~0) 0) (<= main_~k~0 2))} #56#return; {1324#(and (< 1 main_~k~0) (= (+ (- 2) main_~y~0) 0) (<= main_~k~0 2))} is VALID [2022-04-08 04:35:07,452 INFO L272 TraceCheckUtils]: 38: Hoare triple {1324#(and (< 1 main_~k~0) (= (+ (- 2) main_~y~0) 0) (<= main_~k~0 2))} call __VERIFIER_assert((if ~k~0 * ~y~0 == ~y~0 * ~y~0 then 1 else 0)); {1343#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 04:35:07,452 INFO L290 TraceCheckUtils]: 39: Hoare triple {1343#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1347#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 04:35:07,452 INFO L290 TraceCheckUtils]: 40: Hoare triple {1347#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1221#false} is VALID [2022-04-08 04:35:07,452 INFO L290 TraceCheckUtils]: 41: Hoare triple {1221#false} assume !false; {1221#false} is VALID [2022-04-08 04:35:07,453 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 8 proven. 9 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-04-08 04:35:07,453 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 04:35:07,721 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 04:35:07,721 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [680396501] [2022-04-08 04:35:07,721 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 04:35:07,721 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [92963405] [2022-04-08 04:35:07,721 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [92963405] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 04:35:07,721 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-08 04:35:07,721 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2022-04-08 04:35:07,721 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 04:35:07,721 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1372914936] [2022-04-08 04:35:07,721 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1372914936] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 04:35:07,722 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 04:35:07,722 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-08 04:35:07,722 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1933652491] [2022-04-08 04:35:07,722 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 04:35:07,722 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 5 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) Word has length 42 [2022-04-08 04:35:07,722 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 04:35:07,723 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 8 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 5 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) [2022-04-08 04:35:07,745 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 04:35:07,745 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-08 04:35:07,745 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 04:35:07,746 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-08 04:35:07,746 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2022-04-08 04:35:07,746 INFO L87 Difference]: Start difference. First operand 35 states and 37 transitions. Second operand has 8 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 5 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) [2022-04-08 04:35:08,000 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 04:35:08,000 INFO L93 Difference]: Finished difference Result 44 states and 48 transitions. [2022-04-08 04:35:08,000 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-08 04:35:08,000 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 5 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) Word has length 42 [2022-04-08 04:35:08,001 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 04:35:08,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 5 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) [2022-04-08 04:35:08,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 44 transitions. [2022-04-08 04:35:08,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 5 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) [2022-04-08 04:35:08,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 44 transitions. [2022-04-08 04:35:08,003 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 44 transitions. [2022-04-08 04:35:08,029 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 04:35:08,030 INFO L225 Difference]: With dead ends: 44 [2022-04-08 04:35:08,030 INFO L226 Difference]: Without dead ends: 38 [2022-04-08 04:35:08,030 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 49 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=119, Unknown=0, NotChecked=0, Total=156 [2022-04-08 04:35:08,030 INFO L913 BasicCegarLoop]: 31 mSDtfsCounter, 2 mSDsluCounter, 123 mSDsCounter, 0 mSdLazyCounter, 85 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 154 SdHoareTripleChecker+Invalid, 86 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 85 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-08 04:35:08,031 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [2 Valid, 154 Invalid, 86 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 85 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-08 04:35:08,031 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2022-04-08 04:35:08,044 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2022-04-08 04:35:08,044 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 04:35:08,045 INFO L82 GeneralOperation]: Start isEquivalent. First operand 38 states. Second operand has 38 states, 24 states have (on average 1.0416666666666667) internal successors, (25), 24 states have internal predecessors, (25), 9 states have call successors, (9), 6 states have call predecessors, (9), 4 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-08 04:35:08,045 INFO L74 IsIncluded]: Start isIncluded. First operand 38 states. Second operand has 38 states, 24 states have (on average 1.0416666666666667) internal successors, (25), 24 states have internal predecessors, (25), 9 states have call successors, (9), 6 states have call predecessors, (9), 4 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-08 04:35:08,045 INFO L87 Difference]: Start difference. First operand 38 states. Second operand has 38 states, 24 states have (on average 1.0416666666666667) internal successors, (25), 24 states have internal predecessors, (25), 9 states have call successors, (9), 6 states have call predecessors, (9), 4 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-08 04:35:08,046 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 04:35:08,046 INFO L93 Difference]: Finished difference Result 38 states and 41 transitions. [2022-04-08 04:35:08,046 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 41 transitions. [2022-04-08 04:35:08,046 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 04:35:08,046 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 04:35:08,047 INFO L74 IsIncluded]: Start isIncluded. First operand has 38 states, 24 states have (on average 1.0416666666666667) internal successors, (25), 24 states have internal predecessors, (25), 9 states have call successors, (9), 6 states have call predecessors, (9), 4 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Second operand 38 states. [2022-04-08 04:35:08,047 INFO L87 Difference]: Start difference. First operand has 38 states, 24 states have (on average 1.0416666666666667) internal successors, (25), 24 states have internal predecessors, (25), 9 states have call successors, (9), 6 states have call predecessors, (9), 4 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Second operand 38 states. [2022-04-08 04:35:08,048 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 04:35:08,048 INFO L93 Difference]: Finished difference Result 38 states and 41 transitions. [2022-04-08 04:35:08,048 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 41 transitions. [2022-04-08 04:35:08,048 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 04:35:08,048 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 04:35:08,048 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 04:35:08,048 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 04:35:08,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 24 states have (on average 1.0416666666666667) internal successors, (25), 24 states have internal predecessors, (25), 9 states have call successors, (9), 6 states have call predecessors, (9), 4 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-08 04:35:08,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 41 transitions. [2022-04-08 04:35:08,049 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 41 transitions. Word has length 42 [2022-04-08 04:35:08,050 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 04:35:08,050 INFO L478 AbstractCegarLoop]: Abstraction has 38 states and 41 transitions. [2022-04-08 04:35:08,050 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 5 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) [2022-04-08 04:35:08,050 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 38 states and 41 transitions. [2022-04-08 04:35:08,270 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 04:35:08,270 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 41 transitions. [2022-04-08 04:35:08,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2022-04-08 04:35:08,271 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 04:35:08,271 INFO L499 BasicCegarLoop]: trace histogram [6, 5, 5, 4, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 04:35:08,288 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 04:35:08,471 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 04:35:08,472 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 04:35:08,472 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 04:35:08,472 INFO L85 PathProgramCache]: Analyzing trace with hash 1951214241, now seen corresponding path program 5 times [2022-04-08 04:35:08,472 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 04:35:08,472 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1867315122] [2022-04-08 04:35:08,571 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 3 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-08 04:35:08,572 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONLINEAR_UPDATE [2022-04-08 04:35:08,572 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 04:35:08,572 INFO L85 PathProgramCache]: Analyzing trace with hash 1951214241, now seen corresponding path program 6 times [2022-04-08 04:35:08,572 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 04:35:08,572 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1357498259] [2022-04-08 04:35:08,572 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 04:35:08,572 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 04:35:08,597 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 04:35:08,597 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [864982620] [2022-04-08 04:35:08,597 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-08 04:35:08,597 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 04:35:08,597 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 04:35:08,612 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 04:35:08,612 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 04:35:09,205 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2022-04-08 04:35:09,205 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 04:35:09,208 INFO L263 TraceCheckSpWp]: Trace formula consists of 138 conjuncts, 20 conjunts are in the unsatisfiable core [2022-04-08 04:35:09,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 04:35:09,231 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 04:35:09,527 INFO L272 TraceCheckUtils]: 0: Hoare triple {1654#true} call ULTIMATE.init(); {1654#true} is VALID [2022-04-08 04:35:09,527 INFO L290 TraceCheckUtils]: 1: Hoare triple {1654#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); {1654#true} is VALID [2022-04-08 04:35:09,527 INFO L290 TraceCheckUtils]: 2: Hoare triple {1654#true} assume true; {1654#true} is VALID [2022-04-08 04:35:09,527 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1654#true} {1654#true} #60#return; {1654#true} is VALID [2022-04-08 04:35:09,527 INFO L272 TraceCheckUtils]: 4: Hoare triple {1654#true} call #t~ret5 := main(); {1654#true} is VALID [2022-04-08 04:35:09,527 INFO L290 TraceCheckUtils]: 5: Hoare triple {1654#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; {1654#true} is VALID [2022-04-08 04:35:09,527 INFO L272 TraceCheckUtils]: 6: Hoare triple {1654#true} call assume_abort_if_not((if ~k~0 <= 256 then 1 else 0)); {1654#true} is VALID [2022-04-08 04:35:09,528 INFO L290 TraceCheckUtils]: 7: Hoare triple {1654#true} ~cond := #in~cond; {1654#true} is VALID [2022-04-08 04:35:09,528 INFO L290 TraceCheckUtils]: 8: Hoare triple {1654#true} assume !(0 == ~cond); {1654#true} is VALID [2022-04-08 04:35:09,528 INFO L290 TraceCheckUtils]: 9: Hoare triple {1654#true} assume true; {1654#true} is VALID [2022-04-08 04:35:09,528 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1654#true} {1654#true} #52#return; {1654#true} is VALID [2022-04-08 04:35:09,529 INFO L290 TraceCheckUtils]: 11: Hoare triple {1654#true} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {1692#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-08 04:35:09,529 INFO L290 TraceCheckUtils]: 12: Hoare triple {1692#(and (= main_~c~0 0) (= main_~y~0 0))} assume !false; {1692#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-08 04:35:09,529 INFO L272 TraceCheckUtils]: 13: Hoare triple {1692#(and (= main_~c~0 0) (= main_~y~0 0))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {1654#true} is VALID [2022-04-08 04:35:09,529 INFO L290 TraceCheckUtils]: 14: Hoare triple {1654#true} ~cond := #in~cond; {1654#true} is VALID [2022-04-08 04:35:09,529 INFO L290 TraceCheckUtils]: 15: Hoare triple {1654#true} assume !(0 == ~cond); {1654#true} is VALID [2022-04-08 04:35:09,529 INFO L290 TraceCheckUtils]: 16: Hoare triple {1654#true} assume true; {1654#true} is VALID [2022-04-08 04:35:09,531 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {1654#true} {1692#(and (= main_~c~0 0) (= main_~y~0 0))} #54#return; {1692#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-08 04:35:09,532 INFO L290 TraceCheckUtils]: 18: Hoare triple {1692#(and (= main_~c~0 0) (= main_~y~0 0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {1714#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} is VALID [2022-04-08 04:35:09,532 INFO L290 TraceCheckUtils]: 19: Hoare triple {1714#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} assume !false; {1714#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} is VALID [2022-04-08 04:35:09,533 INFO L272 TraceCheckUtils]: 20: Hoare triple {1714#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {1654#true} is VALID [2022-04-08 04:35:09,533 INFO L290 TraceCheckUtils]: 21: Hoare triple {1654#true} ~cond := #in~cond; {1654#true} is VALID [2022-04-08 04:35:09,533 INFO L290 TraceCheckUtils]: 22: Hoare triple {1654#true} assume !(0 == ~cond); {1654#true} is VALID [2022-04-08 04:35:09,533 INFO L290 TraceCheckUtils]: 23: Hoare triple {1654#true} assume true; {1654#true} is VALID [2022-04-08 04:35:09,533 INFO L284 TraceCheckUtils]: 24: Hoare quadruple {1654#true} {1714#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} #54#return; {1714#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} is VALID [2022-04-08 04:35:09,534 INFO L290 TraceCheckUtils]: 25: Hoare triple {1714#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {1736#(and (= main_~y~0 2) (= 0 (+ (- 2) main_~c~0)))} is VALID [2022-04-08 04:35:09,534 INFO L290 TraceCheckUtils]: 26: Hoare triple {1736#(and (= main_~y~0 2) (= 0 (+ (- 2) main_~c~0)))} assume !false; {1736#(and (= main_~y~0 2) (= 0 (+ (- 2) main_~c~0)))} is VALID [2022-04-08 04:35:09,534 INFO L272 TraceCheckUtils]: 27: Hoare triple {1736#(and (= main_~y~0 2) (= 0 (+ (- 2) main_~c~0)))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {1654#true} is VALID [2022-04-08 04:35:09,534 INFO L290 TraceCheckUtils]: 28: Hoare triple {1654#true} ~cond := #in~cond; {1654#true} is VALID [2022-04-08 04:35:09,534 INFO L290 TraceCheckUtils]: 29: Hoare triple {1654#true} assume !(0 == ~cond); {1654#true} is VALID [2022-04-08 04:35:09,534 INFO L290 TraceCheckUtils]: 30: Hoare triple {1654#true} assume true; {1654#true} is VALID [2022-04-08 04:35:09,535 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {1654#true} {1736#(and (= main_~y~0 2) (= 0 (+ (- 2) main_~c~0)))} #54#return; {1736#(and (= main_~y~0 2) (= 0 (+ (- 2) main_~c~0)))} is VALID [2022-04-08 04:35:09,536 INFO L290 TraceCheckUtils]: 32: Hoare triple {1736#(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 * ~y~0 * ~y~0 + ~x~0; {1758#(and (<= main_~c~0 3) (= main_~y~0 3) (< 2 main_~k~0))} is VALID [2022-04-08 04:35:09,539 INFO L290 TraceCheckUtils]: 33: Hoare triple {1758#(and (<= main_~c~0 3) (= main_~y~0 3) (< 2 main_~k~0))} assume !false; {1758#(and (<= main_~c~0 3) (= main_~y~0 3) (< 2 main_~k~0))} is VALID [2022-04-08 04:35:09,539 INFO L272 TraceCheckUtils]: 34: Hoare triple {1758#(and (<= main_~c~0 3) (= main_~y~0 3) (< 2 main_~k~0))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {1654#true} is VALID [2022-04-08 04:35:09,539 INFO L290 TraceCheckUtils]: 35: Hoare triple {1654#true} ~cond := #in~cond; {1654#true} is VALID [2022-04-08 04:35:09,540 INFO L290 TraceCheckUtils]: 36: Hoare triple {1654#true} assume !(0 == ~cond); {1654#true} is VALID [2022-04-08 04:35:09,540 INFO L290 TraceCheckUtils]: 37: Hoare triple {1654#true} assume true; {1654#true} is VALID [2022-04-08 04:35:09,540 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {1654#true} {1758#(and (<= main_~c~0 3) (= main_~y~0 3) (< 2 main_~k~0))} #54#return; {1758#(and (<= main_~c~0 3) (= main_~y~0 3) (< 2 main_~k~0))} is VALID [2022-04-08 04:35:09,541 INFO L290 TraceCheckUtils]: 39: Hoare triple {1758#(and (<= main_~c~0 3) (= main_~y~0 3) (< 2 main_~k~0))} assume !(~c~0 < ~k~0); {1780#(and (= main_~y~0 3) (<= main_~k~0 3) (< 2 main_~k~0))} is VALID [2022-04-08 04:35:09,541 INFO L272 TraceCheckUtils]: 40: Hoare triple {1780#(and (= main_~y~0 3) (<= main_~k~0 3) (< 2 main_~k~0))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {1654#true} is VALID [2022-04-08 04:35:09,541 INFO L290 TraceCheckUtils]: 41: Hoare triple {1654#true} ~cond := #in~cond; {1654#true} is VALID [2022-04-08 04:35:09,541 INFO L290 TraceCheckUtils]: 42: Hoare triple {1654#true} assume !(0 == ~cond); {1654#true} is VALID [2022-04-08 04:35:09,541 INFO L290 TraceCheckUtils]: 43: Hoare triple {1654#true} assume true; {1654#true} is VALID [2022-04-08 04:35:09,541 INFO L284 TraceCheckUtils]: 44: Hoare quadruple {1654#true} {1780#(and (= main_~y~0 3) (<= main_~k~0 3) (< 2 main_~k~0))} #56#return; {1780#(and (= main_~y~0 3) (<= main_~k~0 3) (< 2 main_~k~0))} is VALID [2022-04-08 04:35:09,542 INFO L272 TraceCheckUtils]: 45: Hoare triple {1780#(and (= main_~y~0 3) (<= main_~k~0 3) (< 2 main_~k~0))} call __VERIFIER_assert((if ~k~0 * ~y~0 == ~y~0 * ~y~0 then 1 else 0)); {1799#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 04:35:09,543 INFO L290 TraceCheckUtils]: 46: Hoare triple {1799#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1803#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 04:35:09,543 INFO L290 TraceCheckUtils]: 47: Hoare triple {1803#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1655#false} is VALID [2022-04-08 04:35:09,543 INFO L290 TraceCheckUtils]: 48: Hoare triple {1655#false} assume !false; {1655#false} is VALID [2022-04-08 04:35:09,543 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 10 proven. 18 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2022-04-08 04:35:09,543 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 04:35:09,905 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 04:35:09,905 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1357498259] [2022-04-08 04:35:09,905 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 04:35:09,905 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [864982620] [2022-04-08 04:35:09,905 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [864982620] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 04:35:09,905 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-08 04:35:09,905 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2022-04-08 04:35:09,905 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 04:35:09,905 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1867315122] [2022-04-08 04:35:09,905 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1867315122] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 04:35:09,905 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 04:35:09,905 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-04-08 04:35:09,906 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1259324147] [2022-04-08 04:35:09,906 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 04:35:09,906 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, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 6 states have call predecessors, (7), 6 states have call successors, (7) Word has length 49 [2022-04-08 04:35:09,906 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 04:35:09,906 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, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 6 states have call predecessors, (7), 6 states have call successors, (7) [2022-04-08 04:35:09,940 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 37 edges. 37 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 04:35:09,940 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-04-08 04:35:09,940 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 04:35:09,941 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-04-08 04:35:09,941 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2022-04-08 04:35:09,941 INFO L87 Difference]: Start difference. First operand 38 states and 41 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, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 6 states have call predecessors, (7), 6 states have call successors, (7) [2022-04-08 04:35:10,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 04:35:10,386 INFO L93 Difference]: Finished difference Result 47 states and 52 transitions. [2022-04-08 04:35:10,387 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-08 04:35:10,387 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, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 6 states have call predecessors, (7), 6 states have call successors, (7) Word has length 49 [2022-04-08 04:35:10,387 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 04:35:10,387 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, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 6 states have call predecessors, (7), 6 states have call successors, (7) [2022-04-08 04:35:10,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 48 transitions. [2022-04-08 04:35:10,388 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, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 6 states have call predecessors, (7), 6 states have call successors, (7) [2022-04-08 04:35:10,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 48 transitions. [2022-04-08 04:35:10,390 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 9 states and 48 transitions. [2022-04-08 04:35:10,437 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 04:35:10,438 INFO L225 Difference]: With dead ends: 47 [2022-04-08 04:35:10,438 INFO L226 Difference]: Without dead ends: 41 [2022-04-08 04:35:10,438 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 55 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=40, Invalid=142, Unknown=0, NotChecked=0, Total=182 [2022-04-08 04:35:10,439 INFO L913 BasicCegarLoop]: 34 mSDtfsCounter, 2 mSDsluCounter, 151 mSDsCounter, 0 mSdLazyCounter, 119 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 185 SdHoareTripleChecker+Invalid, 120 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 119 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-08 04:35:10,439 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [2 Valid, 185 Invalid, 120 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 119 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-08 04:35:10,439 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2022-04-08 04:35:10,456 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2022-04-08 04:35:10,456 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 04:35:10,456 INFO L82 GeneralOperation]: Start isEquivalent. First operand 41 states. Second operand has 41 states, 26 states have (on average 1.0384615384615385) internal successors, (27), 26 states have internal predecessors, (27), 10 states have call successors, (10), 6 states have call predecessors, (10), 4 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-08 04:35:10,456 INFO L74 IsIncluded]: Start isIncluded. First operand 41 states. Second operand has 41 states, 26 states have (on average 1.0384615384615385) internal successors, (27), 26 states have internal predecessors, (27), 10 states have call successors, (10), 6 states have call predecessors, (10), 4 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-08 04:35:10,456 INFO L87 Difference]: Start difference. First operand 41 states. Second operand has 41 states, 26 states have (on average 1.0384615384615385) internal successors, (27), 26 states have internal predecessors, (27), 10 states have call successors, (10), 6 states have call predecessors, (10), 4 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-08 04:35:10,458 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 04:35:10,458 INFO L93 Difference]: Finished difference Result 41 states and 45 transitions. [2022-04-08 04:35:10,458 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 45 transitions. [2022-04-08 04:35:10,458 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 04:35:10,458 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 04:35:10,458 INFO L74 IsIncluded]: Start isIncluded. First operand has 41 states, 26 states have (on average 1.0384615384615385) internal successors, (27), 26 states have internal predecessors, (27), 10 states have call successors, (10), 6 states have call predecessors, (10), 4 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Second operand 41 states. [2022-04-08 04:35:10,458 INFO L87 Difference]: Start difference. First operand has 41 states, 26 states have (on average 1.0384615384615385) internal successors, (27), 26 states have internal predecessors, (27), 10 states have call successors, (10), 6 states have call predecessors, (10), 4 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Second operand 41 states. [2022-04-08 04:35:10,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 04:35:10,459 INFO L93 Difference]: Finished difference Result 41 states and 45 transitions. [2022-04-08 04:35:10,459 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 45 transitions. [2022-04-08 04:35:10,460 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 04:35:10,460 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 04:35:10,460 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 04:35:10,460 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 04:35:10,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 26 states have (on average 1.0384615384615385) internal successors, (27), 26 states have internal predecessors, (27), 10 states have call successors, (10), 6 states have call predecessors, (10), 4 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-08 04:35:10,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 45 transitions. [2022-04-08 04:35:10,461 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 45 transitions. Word has length 49 [2022-04-08 04:35:10,461 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 04:35:10,461 INFO L478 AbstractCegarLoop]: Abstraction has 41 states and 45 transitions. [2022-04-08 04:35:10,461 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, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 6 states have call predecessors, (7), 6 states have call successors, (7) [2022-04-08 04:35:10,461 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 41 states and 45 transitions. [2022-04-08 04:35:10,596 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 45 edges. 45 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 04:35:10,597 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 45 transitions. [2022-04-08 04:35:10,597 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2022-04-08 04:35:10,597 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 04:35:10,597 INFO L499 BasicCegarLoop]: trace histogram [7, 6, 6, 5, 5, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 04:35:10,602 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 04:35:10,797 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 04:35:10,798 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 04:35:10,798 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 04:35:10,799 INFO L85 PathProgramCache]: Analyzing trace with hash 327675008, now seen corresponding path program 7 times [2022-04-08 04:35:10,799 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 04:35:10,799 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1825030323] [2022-04-08 04:35:10,912 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 3 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-08 04:35:10,913 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONLINEAR_UPDATE [2022-04-08 04:35:10,913 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 04:35:10,913 INFO L85 PathProgramCache]: Analyzing trace with hash 327675008, now seen corresponding path program 8 times [2022-04-08 04:35:10,913 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 04:35:10,913 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1013253661] [2022-04-08 04:35:10,913 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 04:35:10,913 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 04:35:10,923 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 04:35:10,923 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1995793445] [2022-04-08 04:35:10,923 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 04:35:10,923 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 04:35:10,923 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 04:35:10,924 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 04:35:10,942 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 04:35:11,334 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 04:35:11,334 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 04:35:11,335 INFO L263 TraceCheckSpWp]: Trace formula consists of 155 conjuncts, 24 conjunts are in the unsatisfiable core [2022-04-08 04:35:11,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 04:35:11,361 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 04:35:11,737 INFO L272 TraceCheckUtils]: 0: Hoare triple {2128#true} call ULTIMATE.init(); {2128#true} is VALID [2022-04-08 04:35:11,737 INFO L290 TraceCheckUtils]: 1: Hoare triple {2128#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); {2128#true} is VALID [2022-04-08 04:35:11,738 INFO L290 TraceCheckUtils]: 2: Hoare triple {2128#true} assume true; {2128#true} is VALID [2022-04-08 04:35:11,738 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2128#true} {2128#true} #60#return; {2128#true} is VALID [2022-04-08 04:35:11,738 INFO L272 TraceCheckUtils]: 4: Hoare triple {2128#true} call #t~ret5 := main(); {2128#true} is VALID [2022-04-08 04:35:11,738 INFO L290 TraceCheckUtils]: 5: Hoare triple {2128#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; {2128#true} is VALID [2022-04-08 04:35:11,738 INFO L272 TraceCheckUtils]: 6: Hoare triple {2128#true} call assume_abort_if_not((if ~k~0 <= 256 then 1 else 0)); {2128#true} is VALID [2022-04-08 04:35:11,738 INFO L290 TraceCheckUtils]: 7: Hoare triple {2128#true} ~cond := #in~cond; {2128#true} is VALID [2022-04-08 04:35:11,738 INFO L290 TraceCheckUtils]: 8: Hoare triple {2128#true} assume !(0 == ~cond); {2128#true} is VALID [2022-04-08 04:35:11,738 INFO L290 TraceCheckUtils]: 9: Hoare triple {2128#true} assume true; {2128#true} is VALID [2022-04-08 04:35:11,738 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {2128#true} {2128#true} #52#return; {2128#true} is VALID [2022-04-08 04:35:11,739 INFO L290 TraceCheckUtils]: 11: Hoare triple {2128#true} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {2166#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-08 04:35:11,739 INFO L290 TraceCheckUtils]: 12: Hoare triple {2166#(and (= main_~c~0 0) (= main_~y~0 0))} assume !false; {2166#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-08 04:35:11,739 INFO L272 TraceCheckUtils]: 13: Hoare triple {2166#(and (= main_~c~0 0) (= main_~y~0 0))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {2128#true} is VALID [2022-04-08 04:35:11,739 INFO L290 TraceCheckUtils]: 14: Hoare triple {2128#true} ~cond := #in~cond; {2128#true} is VALID [2022-04-08 04:35:11,739 INFO L290 TraceCheckUtils]: 15: Hoare triple {2128#true} assume !(0 == ~cond); {2128#true} is VALID [2022-04-08 04:35:11,739 INFO L290 TraceCheckUtils]: 16: Hoare triple {2128#true} assume true; {2128#true} is VALID [2022-04-08 04:35:11,740 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {2128#true} {2166#(and (= main_~c~0 0) (= main_~y~0 0))} #54#return; {2166#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-08 04:35:11,741 INFO L290 TraceCheckUtils]: 18: Hoare triple {2166#(and (= main_~c~0 0) (= main_~y~0 0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {2188#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} is VALID [2022-04-08 04:35:11,741 INFO L290 TraceCheckUtils]: 19: Hoare triple {2188#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} assume !false; {2188#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} is VALID [2022-04-08 04:35:11,741 INFO L272 TraceCheckUtils]: 20: Hoare triple {2188#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {2128#true} is VALID [2022-04-08 04:35:11,741 INFO L290 TraceCheckUtils]: 21: Hoare triple {2128#true} ~cond := #in~cond; {2128#true} is VALID [2022-04-08 04:35:11,742 INFO L290 TraceCheckUtils]: 22: Hoare triple {2128#true} assume !(0 == ~cond); {2128#true} is VALID [2022-04-08 04:35:11,742 INFO L290 TraceCheckUtils]: 23: Hoare triple {2128#true} assume true; {2128#true} is VALID [2022-04-08 04:35:11,742 INFO L284 TraceCheckUtils]: 24: Hoare quadruple {2128#true} {2188#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} #54#return; {2188#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} is VALID [2022-04-08 04:35:11,743 INFO L290 TraceCheckUtils]: 25: Hoare triple {2188#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {2210#(and (= main_~y~0 2) (= 0 (+ (- 2) main_~c~0)))} is VALID [2022-04-08 04:35:11,743 INFO L290 TraceCheckUtils]: 26: Hoare triple {2210#(and (= main_~y~0 2) (= 0 (+ (- 2) main_~c~0)))} assume !false; {2210#(and (= main_~y~0 2) (= 0 (+ (- 2) main_~c~0)))} is VALID [2022-04-08 04:35:11,743 INFO L272 TraceCheckUtils]: 27: Hoare triple {2210#(and (= main_~y~0 2) (= 0 (+ (- 2) main_~c~0)))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {2128#true} is VALID [2022-04-08 04:35:11,743 INFO L290 TraceCheckUtils]: 28: Hoare triple {2128#true} ~cond := #in~cond; {2128#true} is VALID [2022-04-08 04:35:11,743 INFO L290 TraceCheckUtils]: 29: Hoare triple {2128#true} assume !(0 == ~cond); {2128#true} is VALID [2022-04-08 04:35:11,743 INFO L290 TraceCheckUtils]: 30: Hoare triple {2128#true} assume true; {2128#true} is VALID [2022-04-08 04:35:11,756 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {2128#true} {2210#(and (= main_~y~0 2) (= 0 (+ (- 2) main_~c~0)))} #54#return; {2210#(and (= main_~y~0 2) (= 0 (+ (- 2) main_~c~0)))} is VALID [2022-04-08 04:35:11,758 INFO L290 TraceCheckUtils]: 32: Hoare triple {2210#(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 * ~y~0 * ~y~0 + ~x~0; {2232#(and (= (+ main_~c~0 (- 3)) 0) (= main_~y~0 3))} is VALID [2022-04-08 04:35:11,760 INFO L290 TraceCheckUtils]: 33: Hoare triple {2232#(and (= (+ main_~c~0 (- 3)) 0) (= main_~y~0 3))} assume !false; {2232#(and (= (+ main_~c~0 (- 3)) 0) (= main_~y~0 3))} is VALID [2022-04-08 04:35:11,760 INFO L272 TraceCheckUtils]: 34: Hoare triple {2232#(and (= (+ main_~c~0 (- 3)) 0) (= main_~y~0 3))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {2128#true} is VALID [2022-04-08 04:35:11,760 INFO L290 TraceCheckUtils]: 35: Hoare triple {2128#true} ~cond := #in~cond; {2128#true} is VALID [2022-04-08 04:35:11,760 INFO L290 TraceCheckUtils]: 36: Hoare triple {2128#true} assume !(0 == ~cond); {2128#true} is VALID [2022-04-08 04:35:11,760 INFO L290 TraceCheckUtils]: 37: Hoare triple {2128#true} assume true; {2128#true} is VALID [2022-04-08 04:35:11,762 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {2128#true} {2232#(and (= (+ main_~c~0 (- 3)) 0) (= main_~y~0 3))} #54#return; {2232#(and (= (+ main_~c~0 (- 3)) 0) (= main_~y~0 3))} is VALID [2022-04-08 04:35:11,764 INFO L290 TraceCheckUtils]: 39: Hoare triple {2232#(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 * ~y~0 * ~y~0 + ~x~0; {2254#(and (= 3 (+ (- 1) main_~y~0)) (< 3 main_~k~0) (<= main_~c~0 4))} is VALID [2022-04-08 04:35:11,767 INFO L290 TraceCheckUtils]: 40: Hoare triple {2254#(and (= 3 (+ (- 1) main_~y~0)) (< 3 main_~k~0) (<= main_~c~0 4))} assume !false; {2254#(and (= 3 (+ (- 1) main_~y~0)) (< 3 main_~k~0) (<= main_~c~0 4))} is VALID [2022-04-08 04:35:11,767 INFO L272 TraceCheckUtils]: 41: Hoare triple {2254#(and (= 3 (+ (- 1) main_~y~0)) (< 3 main_~k~0) (<= main_~c~0 4))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {2128#true} is VALID [2022-04-08 04:35:11,767 INFO L290 TraceCheckUtils]: 42: Hoare triple {2128#true} ~cond := #in~cond; {2128#true} is VALID [2022-04-08 04:35:11,767 INFO L290 TraceCheckUtils]: 43: Hoare triple {2128#true} assume !(0 == ~cond); {2128#true} is VALID [2022-04-08 04:35:11,767 INFO L290 TraceCheckUtils]: 44: Hoare triple {2128#true} assume true; {2128#true} is VALID [2022-04-08 04:35:11,768 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {2128#true} {2254#(and (= 3 (+ (- 1) main_~y~0)) (< 3 main_~k~0) (<= main_~c~0 4))} #54#return; {2254#(and (= 3 (+ (- 1) main_~y~0)) (< 3 main_~k~0) (<= main_~c~0 4))} is VALID [2022-04-08 04:35:11,769 INFO L290 TraceCheckUtils]: 46: Hoare triple {2254#(and (= 3 (+ (- 1) main_~y~0)) (< 3 main_~k~0) (<= main_~c~0 4))} assume !(~c~0 < ~k~0); {2276#(and (= 3 (+ (- 1) main_~y~0)) (< 3 main_~k~0) (<= main_~k~0 4))} is VALID [2022-04-08 04:35:11,769 INFO L272 TraceCheckUtils]: 47: Hoare triple {2276#(and (= 3 (+ (- 1) main_~y~0)) (< 3 main_~k~0) (<= main_~k~0 4))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {2128#true} is VALID [2022-04-08 04:35:11,769 INFO L290 TraceCheckUtils]: 48: Hoare triple {2128#true} ~cond := #in~cond; {2128#true} is VALID [2022-04-08 04:35:11,769 INFO L290 TraceCheckUtils]: 49: Hoare triple {2128#true} assume !(0 == ~cond); {2128#true} is VALID [2022-04-08 04:35:11,769 INFO L290 TraceCheckUtils]: 50: Hoare triple {2128#true} assume true; {2128#true} is VALID [2022-04-08 04:35:11,770 INFO L284 TraceCheckUtils]: 51: Hoare quadruple {2128#true} {2276#(and (= 3 (+ (- 1) main_~y~0)) (< 3 main_~k~0) (<= main_~k~0 4))} #56#return; {2276#(and (= 3 (+ (- 1) main_~y~0)) (< 3 main_~k~0) (<= main_~k~0 4))} is VALID [2022-04-08 04:35:11,771 INFO L272 TraceCheckUtils]: 52: Hoare triple {2276#(and (= 3 (+ (- 1) main_~y~0)) (< 3 main_~k~0) (<= main_~k~0 4))} call __VERIFIER_assert((if ~k~0 * ~y~0 == ~y~0 * ~y~0 then 1 else 0)); {2295#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 04:35:11,771 INFO L290 TraceCheckUtils]: 53: Hoare triple {2295#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {2299#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 04:35:11,772 INFO L290 TraceCheckUtils]: 54: Hoare triple {2299#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {2129#false} is VALID [2022-04-08 04:35:11,772 INFO L290 TraceCheckUtils]: 55: Hoare triple {2129#false} assume !false; {2129#false} is VALID [2022-04-08 04:35:11,774 INFO L134 CoverageAnalysis]: Checked inductivity of 102 backedges. 12 proven. 30 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2022-04-08 04:35:11,774 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 04:35:12,064 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 04:35:12,064 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1013253661] [2022-04-08 04:35:12,064 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 04:35:12,064 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1995793445] [2022-04-08 04:35:12,064 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1995793445] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 04:35:12,064 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-08 04:35:12,064 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2022-04-08 04:35:12,064 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 04:35:12,065 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1825030323] [2022-04-08 04:35:12,065 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1825030323] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 04:35:12,065 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 04:35:12,065 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-04-08 04:35:12,065 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [792785356] [2022-04-08 04:35:12,065 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 04:35:12,065 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 2.5555555555555554) internal successors, (23), 9 states have internal predecessors, (23), 7 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (8), 7 states have call predecessors, (8), 7 states have call successors, (8) Word has length 56 [2022-04-08 04:35:12,065 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 04:35:12,066 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 10 states, 9 states have (on average 2.5555555555555554) internal successors, (23), 9 states have internal predecessors, (23), 7 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (8), 7 states have call predecessors, (8), 7 states have call successors, (8) [2022-04-08 04:35:12,096 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 04:35:12,096 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-04-08 04:35:12,096 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 04:35:12,097 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-04-08 04:35:12,097 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2022-04-08 04:35:12,097 INFO L87 Difference]: Start difference. First operand 41 states and 45 transitions. Second operand has 10 states, 9 states have (on average 2.5555555555555554) internal successors, (23), 9 states have internal predecessors, (23), 7 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (8), 7 states have call predecessors, (8), 7 states have call successors, (8) [2022-04-08 04:35:12,566 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 04:35:12,567 INFO L93 Difference]: Finished difference Result 50 states and 56 transitions. [2022-04-08 04:35:12,567 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-04-08 04:35:12,567 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 2.5555555555555554) internal successors, (23), 9 states have internal predecessors, (23), 7 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (8), 7 states have call predecessors, (8), 7 states have call successors, (8) Word has length 56 [2022-04-08 04:35:12,567 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 04:35:12,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 9 states have (on average 2.5555555555555554) internal successors, (23), 9 states have internal predecessors, (23), 7 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (8), 7 states have call predecessors, (8), 7 states have call successors, (8) [2022-04-08 04:35:12,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 52 transitions. [2022-04-08 04:35:12,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 9 states have (on average 2.5555555555555554) internal successors, (23), 9 states have internal predecessors, (23), 7 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (8), 7 states have call predecessors, (8), 7 states have call successors, (8) [2022-04-08 04:35:12,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 52 transitions. [2022-04-08 04:35:12,569 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 10 states and 52 transitions. [2022-04-08 04:35:12,618 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 04:35:12,619 INFO L225 Difference]: With dead ends: 50 [2022-04-08 04:35:12,619 INFO L226 Difference]: Without dead ends: 44 [2022-04-08 04:35:12,620 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 61 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 04:35:12,620 INFO L913 BasicCegarLoop]: 37 mSDtfsCounter, 2 mSDsluCounter, 181 mSDsCounter, 0 mSdLazyCounter, 159 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 218 SdHoareTripleChecker+Invalid, 160 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 159 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-08 04:35:12,620 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [2 Valid, 218 Invalid, 160 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 159 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-08 04:35:12,621 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2022-04-08 04:35:12,644 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2022-04-08 04:35:12,644 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 04:35:12,644 INFO L82 GeneralOperation]: Start isEquivalent. First operand 44 states. Second operand has 44 states, 28 states have (on average 1.0357142857142858) internal successors, (29), 28 states have internal predecessors, (29), 11 states have call successors, (11), 6 states have call predecessors, (11), 4 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-08 04:35:12,644 INFO L74 IsIncluded]: Start isIncluded. First operand 44 states. Second operand has 44 states, 28 states have (on average 1.0357142857142858) internal successors, (29), 28 states have internal predecessors, (29), 11 states have call successors, (11), 6 states have call predecessors, (11), 4 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-08 04:35:12,645 INFO L87 Difference]: Start difference. First operand 44 states. Second operand has 44 states, 28 states have (on average 1.0357142857142858) internal successors, (29), 28 states have internal predecessors, (29), 11 states have call successors, (11), 6 states have call predecessors, (11), 4 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-08 04:35:12,646 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 04:35:12,646 INFO L93 Difference]: Finished difference Result 44 states and 49 transitions. [2022-04-08 04:35:12,646 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 49 transitions. [2022-04-08 04:35:12,646 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 04:35:12,646 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 04:35:12,646 INFO L74 IsIncluded]: Start isIncluded. First operand has 44 states, 28 states have (on average 1.0357142857142858) internal successors, (29), 28 states have internal predecessors, (29), 11 states have call successors, (11), 6 states have call predecessors, (11), 4 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) Second operand 44 states. [2022-04-08 04:35:12,647 INFO L87 Difference]: Start difference. First operand has 44 states, 28 states have (on average 1.0357142857142858) internal successors, (29), 28 states have internal predecessors, (29), 11 states have call successors, (11), 6 states have call predecessors, (11), 4 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) Second operand 44 states. [2022-04-08 04:35:12,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 04:35:12,648 INFO L93 Difference]: Finished difference Result 44 states and 49 transitions. [2022-04-08 04:35:12,648 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 49 transitions. [2022-04-08 04:35:12,648 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 04:35:12,648 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 04:35:12,648 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 04:35:12,648 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 04:35:12,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 28 states have (on average 1.0357142857142858) internal successors, (29), 28 states have internal predecessors, (29), 11 states have call successors, (11), 6 states have call predecessors, (11), 4 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-08 04:35:12,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 49 transitions. [2022-04-08 04:35:12,649 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 49 transitions. Word has length 56 [2022-04-08 04:35:12,649 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 04:35:12,649 INFO L478 AbstractCegarLoop]: Abstraction has 44 states and 49 transitions. [2022-04-08 04:35:12,650 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 2.5555555555555554) internal successors, (23), 9 states have internal predecessors, (23), 7 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (8), 7 states have call predecessors, (8), 7 states have call successors, (8) [2022-04-08 04:35:12,650 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 44 states and 49 transitions. [2022-04-08 04:35:12,786 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 04:35:12,787 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 49 transitions. [2022-04-08 04:35:12,787 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2022-04-08 04:35:12,787 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 04:35:12,787 INFO L499 BasicCegarLoop]: trace histogram [8, 7, 7, 6, 6, 6, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 04:35:12,794 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 04:35:12,988 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 04:35:12,988 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 04:35:12,989 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 04:35:12,989 INFO L85 PathProgramCache]: Analyzing trace with hash -16244287, now seen corresponding path program 9 times [2022-04-08 04:35:12,989 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 04:35:12,989 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1570625422] [2022-04-08 04:35:13,107 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 3 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-08 04:35:13,108 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONLINEAR_UPDATE [2022-04-08 04:35:13,108 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 04:35:13,108 INFO L85 PathProgramCache]: Analyzing trace with hash -16244287, now seen corresponding path program 10 times [2022-04-08 04:35:13,108 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 04:35:13,108 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [115011791] [2022-04-08 04:35:13,108 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 04:35:13,108 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 04:35:13,117 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 04:35:13,117 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1401506252] [2022-04-08 04:35:13,117 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-08 04:35:13,117 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 04:35:13,117 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 04:35:13,118 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 04:35:13,130 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 04:35:13,165 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-08 04:35:13,165 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 04:35:13,166 INFO L263 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 28 conjunts are in the unsatisfiable core [2022-04-08 04:35:13,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 04:35:13,177 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 04:35:13,537 INFO L272 TraceCheckUtils]: 0: Hoare triple {2642#true} call ULTIMATE.init(); {2642#true} is VALID [2022-04-08 04:35:13,537 INFO L290 TraceCheckUtils]: 1: Hoare triple {2642#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); {2642#true} is VALID [2022-04-08 04:35:13,537 INFO L290 TraceCheckUtils]: 2: Hoare triple {2642#true} assume true; {2642#true} is VALID [2022-04-08 04:35:13,537 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2642#true} {2642#true} #60#return; {2642#true} is VALID [2022-04-08 04:35:13,538 INFO L272 TraceCheckUtils]: 4: Hoare triple {2642#true} call #t~ret5 := main(); {2642#true} is VALID [2022-04-08 04:35:13,538 INFO L290 TraceCheckUtils]: 5: Hoare triple {2642#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; {2642#true} is VALID [2022-04-08 04:35:13,538 INFO L272 TraceCheckUtils]: 6: Hoare triple {2642#true} call assume_abort_if_not((if ~k~0 <= 256 then 1 else 0)); {2642#true} is VALID [2022-04-08 04:35:13,538 INFO L290 TraceCheckUtils]: 7: Hoare triple {2642#true} ~cond := #in~cond; {2642#true} is VALID [2022-04-08 04:35:13,538 INFO L290 TraceCheckUtils]: 8: Hoare triple {2642#true} assume !(0 == ~cond); {2642#true} is VALID [2022-04-08 04:35:13,538 INFO L290 TraceCheckUtils]: 9: Hoare triple {2642#true} assume true; {2642#true} is VALID [2022-04-08 04:35:13,538 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {2642#true} {2642#true} #52#return; {2642#true} is VALID [2022-04-08 04:35:13,538 INFO L290 TraceCheckUtils]: 11: Hoare triple {2642#true} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {2680#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-08 04:35:13,539 INFO L290 TraceCheckUtils]: 12: Hoare triple {2680#(and (= main_~c~0 0) (= main_~y~0 0))} assume !false; {2680#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-08 04:35:13,539 INFO L272 TraceCheckUtils]: 13: Hoare triple {2680#(and (= main_~c~0 0) (= main_~y~0 0))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {2642#true} is VALID [2022-04-08 04:35:13,539 INFO L290 TraceCheckUtils]: 14: Hoare triple {2642#true} ~cond := #in~cond; {2642#true} is VALID [2022-04-08 04:35:13,539 INFO L290 TraceCheckUtils]: 15: Hoare triple {2642#true} assume !(0 == ~cond); {2642#true} is VALID [2022-04-08 04:35:13,539 INFO L290 TraceCheckUtils]: 16: Hoare triple {2642#true} assume true; {2642#true} is VALID [2022-04-08 04:35:13,540 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {2642#true} {2680#(and (= main_~c~0 0) (= main_~y~0 0))} #54#return; {2680#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-08 04:35:13,541 INFO L290 TraceCheckUtils]: 18: Hoare triple {2680#(and (= main_~c~0 0) (= main_~y~0 0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {2702#(and (= main_~y~0 1) (= main_~c~0 1))} is VALID [2022-04-08 04:35:13,541 INFO L290 TraceCheckUtils]: 19: Hoare triple {2702#(and (= main_~y~0 1) (= main_~c~0 1))} assume !false; {2702#(and (= main_~y~0 1) (= main_~c~0 1))} is VALID [2022-04-08 04:35:13,541 INFO L272 TraceCheckUtils]: 20: Hoare triple {2702#(and (= main_~y~0 1) (= main_~c~0 1))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {2642#true} is VALID [2022-04-08 04:35:13,541 INFO L290 TraceCheckUtils]: 21: Hoare triple {2642#true} ~cond := #in~cond; {2642#true} is VALID [2022-04-08 04:35:13,541 INFO L290 TraceCheckUtils]: 22: Hoare triple {2642#true} assume !(0 == ~cond); {2642#true} is VALID [2022-04-08 04:35:13,541 INFO L290 TraceCheckUtils]: 23: Hoare triple {2642#true} assume true; {2642#true} is VALID [2022-04-08 04:35:13,542 INFO L284 TraceCheckUtils]: 24: Hoare quadruple {2642#true} {2702#(and (= main_~y~0 1) (= main_~c~0 1))} #54#return; {2702#(and (= main_~y~0 1) (= main_~c~0 1))} is VALID [2022-04-08 04:35:13,542 INFO L290 TraceCheckUtils]: 25: Hoare triple {2702#(and (= main_~y~0 1) (= main_~c~0 1))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {2724#(and (= main_~y~0 2) (= main_~c~0 2))} is VALID [2022-04-08 04:35:13,544 INFO L290 TraceCheckUtils]: 26: Hoare triple {2724#(and (= main_~y~0 2) (= main_~c~0 2))} assume !false; {2724#(and (= main_~y~0 2) (= main_~c~0 2))} is VALID [2022-04-08 04:35:13,544 INFO L272 TraceCheckUtils]: 27: Hoare triple {2724#(and (= main_~y~0 2) (= main_~c~0 2))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {2642#true} is VALID [2022-04-08 04:35:13,544 INFO L290 TraceCheckUtils]: 28: Hoare triple {2642#true} ~cond := #in~cond; {2642#true} is VALID [2022-04-08 04:35:13,544 INFO L290 TraceCheckUtils]: 29: Hoare triple {2642#true} assume !(0 == ~cond); {2642#true} is VALID [2022-04-08 04:35:13,544 INFO L290 TraceCheckUtils]: 30: Hoare triple {2642#true} assume true; {2642#true} is VALID [2022-04-08 04:35:13,544 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {2642#true} {2724#(and (= main_~y~0 2) (= main_~c~0 2))} #54#return; {2724#(and (= main_~y~0 2) (= main_~c~0 2))} is VALID [2022-04-08 04:35:13,545 INFO L290 TraceCheckUtils]: 32: Hoare triple {2724#(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 * ~y~0 * ~y~0 + ~x~0; {2746#(and (= 2 (+ (- 1) main_~y~0)) (= main_~c~0 3))} is VALID [2022-04-08 04:35:13,545 INFO L290 TraceCheckUtils]: 33: Hoare triple {2746#(and (= 2 (+ (- 1) main_~y~0)) (= main_~c~0 3))} assume !false; {2746#(and (= 2 (+ (- 1) main_~y~0)) (= main_~c~0 3))} is VALID [2022-04-08 04:35:13,545 INFO L272 TraceCheckUtils]: 34: Hoare triple {2746#(and (= 2 (+ (- 1) main_~y~0)) (= main_~c~0 3))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {2642#true} is VALID [2022-04-08 04:35:13,545 INFO L290 TraceCheckUtils]: 35: Hoare triple {2642#true} ~cond := #in~cond; {2642#true} is VALID [2022-04-08 04:35:13,546 INFO L290 TraceCheckUtils]: 36: Hoare triple {2642#true} assume !(0 == ~cond); {2642#true} is VALID [2022-04-08 04:35:13,546 INFO L290 TraceCheckUtils]: 37: Hoare triple {2642#true} assume true; {2642#true} is VALID [2022-04-08 04:35:13,547 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {2642#true} {2746#(and (= 2 (+ (- 1) main_~y~0)) (= main_~c~0 3))} #54#return; {2746#(and (= 2 (+ (- 1) main_~y~0)) (= main_~c~0 3))} is VALID [2022-04-08 04:35:13,548 INFO L290 TraceCheckUtils]: 39: Hoare triple {2746#(and (= 2 (+ (- 1) main_~y~0)) (= 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 * ~y~0 * ~y~0 + ~x~0; {2768#(and (= (+ (- 1) main_~c~0) 3) (= main_~y~0 4))} is VALID [2022-04-08 04:35:13,548 INFO L290 TraceCheckUtils]: 40: Hoare triple {2768#(and (= (+ (- 1) main_~c~0) 3) (= main_~y~0 4))} assume !false; {2768#(and (= (+ (- 1) main_~c~0) 3) (= main_~y~0 4))} is VALID [2022-04-08 04:35:13,548 INFO L272 TraceCheckUtils]: 41: Hoare triple {2768#(and (= (+ (- 1) main_~c~0) 3) (= main_~y~0 4))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {2642#true} is VALID [2022-04-08 04:35:13,548 INFO L290 TraceCheckUtils]: 42: Hoare triple {2642#true} ~cond := #in~cond; {2642#true} is VALID [2022-04-08 04:35:13,548 INFO L290 TraceCheckUtils]: 43: Hoare triple {2642#true} assume !(0 == ~cond); {2642#true} is VALID [2022-04-08 04:35:13,549 INFO L290 TraceCheckUtils]: 44: Hoare triple {2642#true} assume true; {2642#true} is VALID [2022-04-08 04:35:13,549 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {2642#true} {2768#(and (= (+ (- 1) main_~c~0) 3) (= main_~y~0 4))} #54#return; {2768#(and (= (+ (- 1) main_~c~0) 3) (= main_~y~0 4))} is VALID [2022-04-08 04:35:13,550 INFO L290 TraceCheckUtils]: 46: Hoare triple {2768#(and (= (+ (- 1) main_~c~0) 3) (= main_~y~0 4))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {2790#(and (<= main_~c~0 5) (= 5 main_~y~0) (< 4 main_~k~0))} is VALID [2022-04-08 04:35:13,550 INFO L290 TraceCheckUtils]: 47: Hoare triple {2790#(and (<= main_~c~0 5) (= 5 main_~y~0) (< 4 main_~k~0))} assume !false; {2790#(and (<= main_~c~0 5) (= 5 main_~y~0) (< 4 main_~k~0))} is VALID [2022-04-08 04:35:13,550 INFO L272 TraceCheckUtils]: 48: Hoare triple {2790#(and (<= main_~c~0 5) (= 5 main_~y~0) (< 4 main_~k~0))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {2642#true} is VALID [2022-04-08 04:35:13,550 INFO L290 TraceCheckUtils]: 49: Hoare triple {2642#true} ~cond := #in~cond; {2642#true} is VALID [2022-04-08 04:35:13,550 INFO L290 TraceCheckUtils]: 50: Hoare triple {2642#true} assume !(0 == ~cond); {2642#true} is VALID [2022-04-08 04:35:13,550 INFO L290 TraceCheckUtils]: 51: Hoare triple {2642#true} assume true; {2642#true} is VALID [2022-04-08 04:35:13,551 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {2642#true} {2790#(and (<= main_~c~0 5) (= 5 main_~y~0) (< 4 main_~k~0))} #54#return; {2790#(and (<= main_~c~0 5) (= 5 main_~y~0) (< 4 main_~k~0))} is VALID [2022-04-08 04:35:13,551 INFO L290 TraceCheckUtils]: 53: Hoare triple {2790#(and (<= main_~c~0 5) (= 5 main_~y~0) (< 4 main_~k~0))} assume !(~c~0 < ~k~0); {2812#(and (<= main_~k~0 5) (= 5 main_~y~0) (< 4 main_~k~0))} is VALID [2022-04-08 04:35:13,551 INFO L272 TraceCheckUtils]: 54: Hoare triple {2812#(and (<= main_~k~0 5) (= 5 main_~y~0) (< 4 main_~k~0))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {2642#true} is VALID [2022-04-08 04:35:13,551 INFO L290 TraceCheckUtils]: 55: Hoare triple {2642#true} ~cond := #in~cond; {2642#true} is VALID [2022-04-08 04:35:13,551 INFO L290 TraceCheckUtils]: 56: Hoare triple {2642#true} assume !(0 == ~cond); {2642#true} is VALID [2022-04-08 04:35:13,552 INFO L290 TraceCheckUtils]: 57: Hoare triple {2642#true} assume true; {2642#true} is VALID [2022-04-08 04:35:13,552 INFO L284 TraceCheckUtils]: 58: Hoare quadruple {2642#true} {2812#(and (<= main_~k~0 5) (= 5 main_~y~0) (< 4 main_~k~0))} #56#return; {2812#(and (<= main_~k~0 5) (= 5 main_~y~0) (< 4 main_~k~0))} is VALID [2022-04-08 04:35:13,555 INFO L272 TraceCheckUtils]: 59: Hoare triple {2812#(and (<= main_~k~0 5) (= 5 main_~y~0) (< 4 main_~k~0))} call __VERIFIER_assert((if ~k~0 * ~y~0 == ~y~0 * ~y~0 then 1 else 0)); {2831#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 04:35:13,556 INFO L290 TraceCheckUtils]: 60: Hoare triple {2831#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {2835#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 04:35:13,556 INFO L290 TraceCheckUtils]: 61: Hoare triple {2835#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {2643#false} is VALID [2022-04-08 04:35:13,556 INFO L290 TraceCheckUtils]: 62: Hoare triple {2643#false} assume !false; {2643#false} is VALID [2022-04-08 04:35:13,556 INFO L134 CoverageAnalysis]: Checked inductivity of 143 backedges. 14 proven. 45 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2022-04-08 04:35:13,556 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 04:35:13,886 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 04:35:13,886 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [115011791] [2022-04-08 04:35:13,886 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 04:35:13,886 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1401506252] [2022-04-08 04:35:13,886 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1401506252] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 04:35:13,886 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-08 04:35:13,886 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2022-04-08 04:35:13,887 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 04:35:13,887 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1570625422] [2022-04-08 04:35:13,887 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1570625422] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 04:35:13,887 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 04:35:13,887 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-04-08 04:35:13,887 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1883591794] [2022-04-08 04:35:13,887 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 04:35:13,887 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 2.5) internal successors, (25), 10 states have internal predecessors, (25), 8 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (9), 8 states have call predecessors, (9), 8 states have call successors, (9) Word has length 63 [2022-04-08 04:35:13,888 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 04:35:13,888 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 11 states, 10 states have (on average 2.5) internal successors, (25), 10 states have internal predecessors, (25), 8 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (9), 8 states have call predecessors, (9), 8 states have call successors, (9) [2022-04-08 04:35:13,924 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 45 edges. 45 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 04:35:13,924 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-04-08 04:35:13,924 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 04:35:13,924 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-04-08 04:35:13,924 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=146, Unknown=0, NotChecked=0, Total=182 [2022-04-08 04:35:13,925 INFO L87 Difference]: Start difference. First operand 44 states and 49 transitions. Second operand has 11 states, 10 states have (on average 2.5) internal successors, (25), 10 states have internal predecessors, (25), 8 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (9), 8 states have call predecessors, (9), 8 states have call successors, (9) [2022-04-08 04:35:14,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 04:35:14,506 INFO L93 Difference]: Finished difference Result 53 states and 60 transitions. [2022-04-08 04:35:14,506 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-04-08 04:35:14,507 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 2.5) internal successors, (25), 10 states have internal predecessors, (25), 8 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (9), 8 states have call predecessors, (9), 8 states have call successors, (9) Word has length 63 [2022-04-08 04:35:14,507 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 04:35:14,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 10 states have (on average 2.5) internal successors, (25), 10 states have internal predecessors, (25), 8 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (9), 8 states have call predecessors, (9), 8 states have call successors, (9) [2022-04-08 04:35:14,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 56 transitions. [2022-04-08 04:35:14,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 10 states have (on average 2.5) internal successors, (25), 10 states have internal predecessors, (25), 8 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (9), 8 states have call predecessors, (9), 8 states have call successors, (9) [2022-04-08 04:35:14,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 56 transitions. [2022-04-08 04:35:14,509 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 11 states and 56 transitions. [2022-04-08 04:35:14,557 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 56 edges. 56 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 04:35:14,558 INFO L225 Difference]: With dead ends: 53 [2022-04-08 04:35:14,558 INFO L226 Difference]: Without dead ends: 47 [2022-04-08 04:35:14,559 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 67 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=46, Invalid=194, Unknown=0, NotChecked=0, Total=240 [2022-04-08 04:35:14,559 INFO L913 BasicCegarLoop]: 40 mSDtfsCounter, 2 mSDsluCounter, 213 mSDsCounter, 0 mSdLazyCounter, 205 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 253 SdHoareTripleChecker+Invalid, 206 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 205 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-08 04:35:14,559 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [2 Valid, 253 Invalid, 206 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 205 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-08 04:35:14,560 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2022-04-08 04:35:14,592 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2022-04-08 04:35:14,592 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 04:35:14,593 INFO L82 GeneralOperation]: Start isEquivalent. First operand 47 states. Second operand has 47 states, 30 states have (on average 1.0333333333333334) internal successors, (31), 30 states have internal predecessors, (31), 12 states have call successors, (12), 6 states have call predecessors, (12), 4 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-08 04:35:14,593 INFO L74 IsIncluded]: Start isIncluded. First operand 47 states. Second operand has 47 states, 30 states have (on average 1.0333333333333334) internal successors, (31), 30 states have internal predecessors, (31), 12 states have call successors, (12), 6 states have call predecessors, (12), 4 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-08 04:35:14,593 INFO L87 Difference]: Start difference. First operand 47 states. Second operand has 47 states, 30 states have (on average 1.0333333333333334) internal successors, (31), 30 states have internal predecessors, (31), 12 states have call successors, (12), 6 states have call predecessors, (12), 4 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-08 04:35:14,595 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 04:35:14,595 INFO L93 Difference]: Finished difference Result 47 states and 53 transitions. [2022-04-08 04:35:14,596 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 53 transitions. [2022-04-08 04:35:14,596 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 04:35:14,596 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 04:35:14,596 INFO L74 IsIncluded]: Start isIncluded. First operand has 47 states, 30 states have (on average 1.0333333333333334) internal successors, (31), 30 states have internal predecessors, (31), 12 states have call successors, (12), 6 states have call predecessors, (12), 4 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) Second operand 47 states. [2022-04-08 04:35:14,596 INFO L87 Difference]: Start difference. First operand has 47 states, 30 states have (on average 1.0333333333333334) internal successors, (31), 30 states have internal predecessors, (31), 12 states have call successors, (12), 6 states have call predecessors, (12), 4 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) Second operand 47 states. [2022-04-08 04:35:14,597 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 04:35:14,597 INFO L93 Difference]: Finished difference Result 47 states and 53 transitions. [2022-04-08 04:35:14,597 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 53 transitions. [2022-04-08 04:35:14,598 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 04:35:14,598 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 04:35:14,598 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 04:35:14,598 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 04:35:14,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 30 states have (on average 1.0333333333333334) internal successors, (31), 30 states have internal predecessors, (31), 12 states have call successors, (12), 6 states have call predecessors, (12), 4 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-08 04:35:14,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 53 transitions. [2022-04-08 04:35:14,599 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 53 transitions. Word has length 63 [2022-04-08 04:35:14,599 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 04:35:14,599 INFO L478 AbstractCegarLoop]: Abstraction has 47 states and 53 transitions. [2022-04-08 04:35:14,599 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 2.5) internal successors, (25), 10 states have internal predecessors, (25), 8 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (9), 8 states have call predecessors, (9), 8 states have call successors, (9) [2022-04-08 04:35:14,599 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 47 states and 53 transitions. [2022-04-08 04:35:14,786 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 04:35:14,786 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 53 transitions. [2022-04-08 04:35:14,787 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2022-04-08 04:35:14,787 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 04:35:14,787 INFO L499 BasicCegarLoop]: trace histogram [9, 8, 8, 7, 7, 7, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 04:35:14,807 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-04-08 04:35:14,987 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 04:35:14,987 INFO L403 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 04:35:14,988 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 04:35:14,988 INFO L85 PathProgramCache]: Analyzing trace with hash 570339680, now seen corresponding path program 11 times [2022-04-08 04:35:14,988 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 04:35:14,988 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [777219168] [2022-04-08 04:35:15,080 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 3 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-08 04:35:15,081 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONLINEAR_UPDATE [2022-04-08 04:35:15,081 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 04:35:15,081 INFO L85 PathProgramCache]: Analyzing trace with hash 570339680, now seen corresponding path program 12 times [2022-04-08 04:35:15,081 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 04:35:15,081 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1587528975] [2022-04-08 04:35:15,081 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 04:35:15,081 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 04:35:15,111 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 04:35:15,111 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1979441449] [2022-04-08 04:35:15,111 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-08 04:35:15,111 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 04:35:15,112 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 04:35:15,112 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 04:35:15,114 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 04:35:15,889 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2022-04-08 04:35:15,890 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 04:35:15,892 INFO L263 TraceCheckSpWp]: Trace formula consists of 189 conjuncts, 32 conjunts are in the unsatisfiable core [2022-04-08 04:35:15,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 04:35:15,911 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 04:35:16,288 INFO L272 TraceCheckUtils]: 0: Hoare triple {3196#true} call ULTIMATE.init(); {3196#true} is VALID [2022-04-08 04:35:16,289 INFO L290 TraceCheckUtils]: 1: Hoare triple {3196#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); {3196#true} is VALID [2022-04-08 04:35:16,289 INFO L290 TraceCheckUtils]: 2: Hoare triple {3196#true} assume true; {3196#true} is VALID [2022-04-08 04:35:16,289 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3196#true} {3196#true} #60#return; {3196#true} is VALID [2022-04-08 04:35:16,289 INFO L272 TraceCheckUtils]: 4: Hoare triple {3196#true} call #t~ret5 := main(); {3196#true} is VALID [2022-04-08 04:35:16,289 INFO L290 TraceCheckUtils]: 5: Hoare triple {3196#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; {3196#true} is VALID [2022-04-08 04:35:16,289 INFO L272 TraceCheckUtils]: 6: Hoare triple {3196#true} call assume_abort_if_not((if ~k~0 <= 256 then 1 else 0)); {3196#true} is VALID [2022-04-08 04:35:16,289 INFO L290 TraceCheckUtils]: 7: Hoare triple {3196#true} ~cond := #in~cond; {3196#true} is VALID [2022-04-08 04:35:16,289 INFO L290 TraceCheckUtils]: 8: Hoare triple {3196#true} assume !(0 == ~cond); {3196#true} is VALID [2022-04-08 04:35:16,289 INFO L290 TraceCheckUtils]: 9: Hoare triple {3196#true} assume true; {3196#true} is VALID [2022-04-08 04:35:16,289 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {3196#true} {3196#true} #52#return; {3196#true} is VALID [2022-04-08 04:35:16,290 INFO L290 TraceCheckUtils]: 11: Hoare triple {3196#true} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {3234#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-08 04:35:16,290 INFO L290 TraceCheckUtils]: 12: Hoare triple {3234#(and (= main_~c~0 0) (= main_~y~0 0))} assume !false; {3234#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-08 04:35:16,290 INFO L272 TraceCheckUtils]: 13: Hoare triple {3234#(and (= main_~c~0 0) (= main_~y~0 0))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {3196#true} is VALID [2022-04-08 04:35:16,290 INFO L290 TraceCheckUtils]: 14: Hoare triple {3196#true} ~cond := #in~cond; {3196#true} is VALID [2022-04-08 04:35:16,290 INFO L290 TraceCheckUtils]: 15: Hoare triple {3196#true} assume !(0 == ~cond); {3196#true} is VALID [2022-04-08 04:35:16,290 INFO L290 TraceCheckUtils]: 16: Hoare triple {3196#true} assume true; {3196#true} is VALID [2022-04-08 04:35:16,291 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {3196#true} {3234#(and (= main_~c~0 0) (= main_~y~0 0))} #54#return; {3234#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-08 04:35:16,292 INFO L290 TraceCheckUtils]: 18: Hoare triple {3234#(and (= main_~c~0 0) (= main_~y~0 0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {3256#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} is VALID [2022-04-08 04:35:16,292 INFO L290 TraceCheckUtils]: 19: Hoare triple {3256#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} assume !false; {3256#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} is VALID [2022-04-08 04:35:16,292 INFO L272 TraceCheckUtils]: 20: Hoare triple {3256#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {3196#true} is VALID [2022-04-08 04:35:16,292 INFO L290 TraceCheckUtils]: 21: Hoare triple {3196#true} ~cond := #in~cond; {3196#true} is VALID [2022-04-08 04:35:16,292 INFO L290 TraceCheckUtils]: 22: Hoare triple {3196#true} assume !(0 == ~cond); {3196#true} is VALID [2022-04-08 04:35:16,292 INFO L290 TraceCheckUtils]: 23: Hoare triple {3196#true} assume true; {3196#true} is VALID [2022-04-08 04:35:16,293 INFO L284 TraceCheckUtils]: 24: Hoare quadruple {3196#true} {3256#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} #54#return; {3256#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} is VALID [2022-04-08 04:35:16,293 INFO L290 TraceCheckUtils]: 25: Hoare triple {3256#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {3278#(and (= main_~y~0 2) (= main_~c~0 2))} is VALID [2022-04-08 04:35:16,294 INFO L290 TraceCheckUtils]: 26: Hoare triple {3278#(and (= main_~y~0 2) (= main_~c~0 2))} assume !false; {3278#(and (= main_~y~0 2) (= main_~c~0 2))} is VALID [2022-04-08 04:35:16,294 INFO L272 TraceCheckUtils]: 27: Hoare triple {3278#(and (= main_~y~0 2) (= main_~c~0 2))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {3196#true} is VALID [2022-04-08 04:35:16,294 INFO L290 TraceCheckUtils]: 28: Hoare triple {3196#true} ~cond := #in~cond; {3196#true} is VALID [2022-04-08 04:35:16,294 INFO L290 TraceCheckUtils]: 29: Hoare triple {3196#true} assume !(0 == ~cond); {3196#true} is VALID [2022-04-08 04:35:16,294 INFO L290 TraceCheckUtils]: 30: Hoare triple {3196#true} assume true; {3196#true} is VALID [2022-04-08 04:35:16,294 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {3196#true} {3278#(and (= main_~y~0 2) (= main_~c~0 2))} #54#return; {3278#(and (= main_~y~0 2) (= main_~c~0 2))} is VALID [2022-04-08 04:35:16,295 INFO L290 TraceCheckUtils]: 32: Hoare triple {3278#(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 * ~y~0 * ~y~0 + ~x~0; {3300#(and (= 2 (+ (- 1) main_~y~0)) (= (+ (- 1) main_~c~0) 2))} is VALID [2022-04-08 04:35:16,295 INFO L290 TraceCheckUtils]: 33: Hoare triple {3300#(and (= 2 (+ (- 1) main_~y~0)) (= (+ (- 1) main_~c~0) 2))} assume !false; {3300#(and (= 2 (+ (- 1) main_~y~0)) (= (+ (- 1) main_~c~0) 2))} is VALID [2022-04-08 04:35:16,295 INFO L272 TraceCheckUtils]: 34: Hoare triple {3300#(and (= 2 (+ (- 1) main_~y~0)) (= (+ (- 1) main_~c~0) 2))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {3196#true} is VALID [2022-04-08 04:35:16,295 INFO L290 TraceCheckUtils]: 35: Hoare triple {3196#true} ~cond := #in~cond; {3196#true} is VALID [2022-04-08 04:35:16,295 INFO L290 TraceCheckUtils]: 36: Hoare triple {3196#true} assume !(0 == ~cond); {3196#true} is VALID [2022-04-08 04:35:16,296 INFO L290 TraceCheckUtils]: 37: Hoare triple {3196#true} assume true; {3196#true} is VALID [2022-04-08 04:35:16,296 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {3196#true} {3300#(and (= 2 (+ (- 1) main_~y~0)) (= (+ (- 1) main_~c~0) 2))} #54#return; {3300#(and (= 2 (+ (- 1) main_~y~0)) (= (+ (- 1) main_~c~0) 2))} is VALID [2022-04-08 04:35:16,298 INFO L290 TraceCheckUtils]: 39: Hoare triple {3300#(and (= 2 (+ (- 1) main_~y~0)) (= (+ (- 1) main_~c~0) 2))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {3322#(and (= main_~c~0 4) (= (+ (- 2) main_~y~0) 2))} is VALID [2022-04-08 04:35:16,298 INFO L290 TraceCheckUtils]: 40: Hoare triple {3322#(and (= main_~c~0 4) (= (+ (- 2) main_~y~0) 2))} assume !false; {3322#(and (= main_~c~0 4) (= (+ (- 2) main_~y~0) 2))} is VALID [2022-04-08 04:35:16,298 INFO L272 TraceCheckUtils]: 41: Hoare triple {3322#(and (= main_~c~0 4) (= (+ (- 2) main_~y~0) 2))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {3196#true} is VALID [2022-04-08 04:35:16,298 INFO L290 TraceCheckUtils]: 42: Hoare triple {3196#true} ~cond := #in~cond; {3196#true} is VALID [2022-04-08 04:35:16,298 INFO L290 TraceCheckUtils]: 43: Hoare triple {3196#true} assume !(0 == ~cond); {3196#true} is VALID [2022-04-08 04:35:16,298 INFO L290 TraceCheckUtils]: 44: Hoare triple {3196#true} assume true; {3196#true} is VALID [2022-04-08 04:35:16,303 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {3196#true} {3322#(and (= main_~c~0 4) (= (+ (- 2) main_~y~0) 2))} #54#return; {3322#(and (= main_~c~0 4) (= (+ (- 2) main_~y~0) 2))} is VALID [2022-04-08 04:35:16,304 INFO L290 TraceCheckUtils]: 46: Hoare triple {3322#(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 * ~y~0 * ~y~0 + ~x~0; {3344#(and (= 5 main_~c~0) (= 5 main_~y~0))} is VALID [2022-04-08 04:35:16,306 INFO L290 TraceCheckUtils]: 47: Hoare triple {3344#(and (= 5 main_~c~0) (= 5 main_~y~0))} assume !false; {3344#(and (= 5 main_~c~0) (= 5 main_~y~0))} is VALID [2022-04-08 04:35:16,306 INFO L272 TraceCheckUtils]: 48: Hoare triple {3344#(and (= 5 main_~c~0) (= 5 main_~y~0))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {3196#true} is VALID [2022-04-08 04:35:16,306 INFO L290 TraceCheckUtils]: 49: Hoare triple {3196#true} ~cond := #in~cond; {3196#true} is VALID [2022-04-08 04:35:16,306 INFO L290 TraceCheckUtils]: 50: Hoare triple {3196#true} assume !(0 == ~cond); {3196#true} is VALID [2022-04-08 04:35:16,306 INFO L290 TraceCheckUtils]: 51: Hoare triple {3196#true} assume true; {3196#true} is VALID [2022-04-08 04:35:16,306 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {3196#true} {3344#(and (= 5 main_~c~0) (= 5 main_~y~0))} #54#return; {3344#(and (= 5 main_~c~0) (= 5 main_~y~0))} is VALID [2022-04-08 04:35:16,307 INFO L290 TraceCheckUtils]: 53: Hoare triple {3344#(and (= 5 main_~c~0) (= 5 main_~y~0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {3366#(and (< 5 main_~k~0) (<= main_~c~0 6) (= 5 (+ (- 1) main_~y~0)))} is VALID [2022-04-08 04:35:16,307 INFO L290 TraceCheckUtils]: 54: Hoare triple {3366#(and (< 5 main_~k~0) (<= main_~c~0 6) (= 5 (+ (- 1) main_~y~0)))} assume !false; {3366#(and (< 5 main_~k~0) (<= main_~c~0 6) (= 5 (+ (- 1) main_~y~0)))} is VALID [2022-04-08 04:35:16,307 INFO L272 TraceCheckUtils]: 55: Hoare triple {3366#(and (< 5 main_~k~0) (<= main_~c~0 6) (= 5 (+ (- 1) main_~y~0)))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {3196#true} is VALID [2022-04-08 04:35:16,307 INFO L290 TraceCheckUtils]: 56: Hoare triple {3196#true} ~cond := #in~cond; {3196#true} is VALID [2022-04-08 04:35:16,307 INFO L290 TraceCheckUtils]: 57: Hoare triple {3196#true} assume !(0 == ~cond); {3196#true} is VALID [2022-04-08 04:35:16,307 INFO L290 TraceCheckUtils]: 58: Hoare triple {3196#true} assume true; {3196#true} is VALID [2022-04-08 04:35:16,308 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {3196#true} {3366#(and (< 5 main_~k~0) (<= main_~c~0 6) (= 5 (+ (- 1) main_~y~0)))} #54#return; {3366#(and (< 5 main_~k~0) (<= main_~c~0 6) (= 5 (+ (- 1) main_~y~0)))} is VALID [2022-04-08 04:35:16,308 INFO L290 TraceCheckUtils]: 60: Hoare triple {3366#(and (< 5 main_~k~0) (<= main_~c~0 6) (= 5 (+ (- 1) main_~y~0)))} assume !(~c~0 < ~k~0); {3388#(and (<= main_~k~0 6) (< 5 main_~k~0) (= 5 (+ (- 1) main_~y~0)))} is VALID [2022-04-08 04:35:16,308 INFO L272 TraceCheckUtils]: 61: Hoare triple {3388#(and (<= main_~k~0 6) (< 5 main_~k~0) (= 5 (+ (- 1) main_~y~0)))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {3196#true} is VALID [2022-04-08 04:35:16,308 INFO L290 TraceCheckUtils]: 62: Hoare triple {3196#true} ~cond := #in~cond; {3196#true} is VALID [2022-04-08 04:35:16,308 INFO L290 TraceCheckUtils]: 63: Hoare triple {3196#true} assume !(0 == ~cond); {3196#true} is VALID [2022-04-08 04:35:16,309 INFO L290 TraceCheckUtils]: 64: Hoare triple {3196#true} assume true; {3196#true} is VALID [2022-04-08 04:35:16,309 INFO L284 TraceCheckUtils]: 65: Hoare quadruple {3196#true} {3388#(and (<= main_~k~0 6) (< 5 main_~k~0) (= 5 (+ (- 1) main_~y~0)))} #56#return; {3388#(and (<= main_~k~0 6) (< 5 main_~k~0) (= 5 (+ (- 1) main_~y~0)))} is VALID [2022-04-08 04:35:16,309 INFO L272 TraceCheckUtils]: 66: Hoare triple {3388#(and (<= main_~k~0 6) (< 5 main_~k~0) (= 5 (+ (- 1) main_~y~0)))} call __VERIFIER_assert((if ~k~0 * ~y~0 == ~y~0 * ~y~0 then 1 else 0)); {3407#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 04:35:16,310 INFO L290 TraceCheckUtils]: 67: Hoare triple {3407#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {3411#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 04:35:16,310 INFO L290 TraceCheckUtils]: 68: Hoare triple {3411#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {3197#false} is VALID [2022-04-08 04:35:16,310 INFO L290 TraceCheckUtils]: 69: Hoare triple {3197#false} assume !false; {3197#false} is VALID [2022-04-08 04:35:16,310 INFO L134 CoverageAnalysis]: Checked inductivity of 191 backedges. 16 proven. 63 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2022-04-08 04:35:16,310 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 04:35:16,582 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 04:35:16,582 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1587528975] [2022-04-08 04:35:16,582 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 04:35:16,582 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1979441449] [2022-04-08 04:35:16,582 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1979441449] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 04:35:16,582 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-08 04:35:16,582 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2022-04-08 04:35:16,585 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 04:35:16,585 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [777219168] [2022-04-08 04:35:16,585 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [777219168] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 04:35:16,585 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 04:35:16,585 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-04-08 04:35:16,585 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [638409053] [2022-04-08 04:35:16,585 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 04:35:16,586 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 2.4545454545454546) internal successors, (27), 11 states have internal predecessors, (27), 9 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (10), 9 states have call predecessors, (10), 9 states have call successors, (10) Word has length 70 [2022-04-08 04:35:16,587 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 04:35:16,587 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 12 states, 11 states have (on average 2.4545454545454546) internal successors, (27), 11 states have internal predecessors, (27), 9 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (10), 9 states have call predecessors, (10), 9 states have call successors, (10) [2022-04-08 04:35:16,630 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 04:35:16,630 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-04-08 04:35:16,630 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 04:35:16,631 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-04-08 04:35:16,631 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=171, Unknown=0, NotChecked=0, Total=210 [2022-04-08 04:35:16,631 INFO L87 Difference]: Start difference. First operand 47 states and 53 transitions. Second operand has 12 states, 11 states have (on average 2.4545454545454546) internal successors, (27), 11 states have internal predecessors, (27), 9 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (10), 9 states have call predecessors, (10), 9 states have call successors, (10) [2022-04-08 04:35:17,346 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 04:35:17,346 INFO L93 Difference]: Finished difference Result 56 states and 64 transitions. [2022-04-08 04:35:17,347 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-04-08 04:35:17,347 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 2.4545454545454546) internal successors, (27), 11 states have internal predecessors, (27), 9 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (10), 9 states have call predecessors, (10), 9 states have call successors, (10) Word has length 70 [2022-04-08 04:35:17,347 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 04:35:17,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 11 states have (on average 2.4545454545454546) internal successors, (27), 11 states have internal predecessors, (27), 9 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (10), 9 states have call predecessors, (10), 9 states have call successors, (10) [2022-04-08 04:35:17,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 60 transitions. [2022-04-08 04:35:17,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 11 states have (on average 2.4545454545454546) internal successors, (27), 11 states have internal predecessors, (27), 9 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (10), 9 states have call predecessors, (10), 9 states have call successors, (10) [2022-04-08 04:35:17,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 60 transitions. [2022-04-08 04:35:17,350 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 12 states and 60 transitions. [2022-04-08 04:35:17,402 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 04:35:17,403 INFO L225 Difference]: With dead ends: 56 [2022-04-08 04:35:17,403 INFO L226 Difference]: Without dead ends: 50 [2022-04-08 04:35:17,404 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 73 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 04:35:17,404 INFO L913 BasicCegarLoop]: 43 mSDtfsCounter, 2 mSDsluCounter, 247 mSDsCounter, 0 mSdLazyCounter, 257 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 290 SdHoareTripleChecker+Invalid, 258 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 257 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-04-08 04:35:17,404 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [2 Valid, 290 Invalid, 258 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 257 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-04-08 04:35:17,405 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2022-04-08 04:35:17,445 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2022-04-08 04:35:17,445 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 04:35:17,446 INFO L82 GeneralOperation]: Start isEquivalent. First operand 50 states. Second operand has 50 states, 32 states have (on average 1.03125) internal successors, (33), 32 states have internal predecessors, (33), 13 states have call successors, (13), 6 states have call predecessors, (13), 4 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-08 04:35:17,446 INFO L74 IsIncluded]: Start isIncluded. First operand 50 states. Second operand has 50 states, 32 states have (on average 1.03125) internal successors, (33), 32 states have internal predecessors, (33), 13 states have call successors, (13), 6 states have call predecessors, (13), 4 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-08 04:35:17,446 INFO L87 Difference]: Start difference. First operand 50 states. Second operand has 50 states, 32 states have (on average 1.03125) internal successors, (33), 32 states have internal predecessors, (33), 13 states have call successors, (13), 6 states have call predecessors, (13), 4 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-08 04:35:17,448 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 04:35:17,448 INFO L93 Difference]: Finished difference Result 50 states and 57 transitions. [2022-04-08 04:35:17,448 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 57 transitions. [2022-04-08 04:35:17,448 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 04:35:17,448 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 04:35:17,448 INFO L74 IsIncluded]: Start isIncluded. First operand has 50 states, 32 states have (on average 1.03125) internal successors, (33), 32 states have internal predecessors, (33), 13 states have call successors, (13), 6 states have call predecessors, (13), 4 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) Second operand 50 states. [2022-04-08 04:35:17,448 INFO L87 Difference]: Start difference. First operand has 50 states, 32 states have (on average 1.03125) internal successors, (33), 32 states have internal predecessors, (33), 13 states have call successors, (13), 6 states have call predecessors, (13), 4 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) Second operand 50 states. [2022-04-08 04:35:17,449 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 04:35:17,450 INFO L93 Difference]: Finished difference Result 50 states and 57 transitions. [2022-04-08 04:35:17,450 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 57 transitions. [2022-04-08 04:35:17,450 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 04:35:17,450 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 04:35:17,450 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 04:35:17,450 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 04:35:17,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 32 states have (on average 1.03125) internal successors, (33), 32 states have internal predecessors, (33), 13 states have call successors, (13), 6 states have call predecessors, (13), 4 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-08 04:35:17,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 57 transitions. [2022-04-08 04:35:17,451 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 57 transitions. Word has length 70 [2022-04-08 04:35:17,451 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 04:35:17,451 INFO L478 AbstractCegarLoop]: Abstraction has 50 states and 57 transitions. [2022-04-08 04:35:17,452 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 2.4545454545454546) internal successors, (27), 11 states have internal predecessors, (27), 9 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (10), 9 states have call predecessors, (10), 9 states have call successors, (10) [2022-04-08 04:35:17,452 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 50 states and 57 transitions. [2022-04-08 04:35:17,638 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 04:35:17,639 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 57 transitions. [2022-04-08 04:35:17,640 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2022-04-08 04:35:17,640 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 04:35:17,640 INFO L499 BasicCegarLoop]: trace histogram [10, 9, 9, 8, 8, 8, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 04:35:17,648 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2022-04-08 04:35:17,840 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 04:35:17,841 INFO L403 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 04:35:17,841 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 04:35:17,841 INFO L85 PathProgramCache]: Analyzing trace with hash 724836577, now seen corresponding path program 13 times [2022-04-08 04:35:17,841 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 04:35:17,841 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1537056627] [2022-04-08 04:35:17,925 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 3 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-08 04:35:17,926 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONLINEAR_UPDATE [2022-04-08 04:35:17,926 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 04:35:17,926 INFO L85 PathProgramCache]: Analyzing trace with hash 724836577, now seen corresponding path program 14 times [2022-04-08 04:35:17,926 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 04:35:17,926 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [770879875] [2022-04-08 04:35:17,926 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 04:35:17,926 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 04:35:17,935 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 04:35:17,935 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [600853314] [2022-04-08 04:35:17,935 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 04:35:17,935 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 04:35:17,936 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 04:35:17,936 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 04:35:17,937 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 04:35:18,567 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 04:35:18,567 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 04:35:18,569 INFO L263 TraceCheckSpWp]: Trace formula consists of 206 conjuncts, 53 conjunts are in the unsatisfiable core [2022-04-08 04:35:18,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 04:35:18,584 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 04:35:19,217 INFO L272 TraceCheckUtils]: 0: Hoare triple {3790#true} call ULTIMATE.init(); {3790#true} is VALID [2022-04-08 04:35:19,217 INFO L290 TraceCheckUtils]: 1: Hoare triple {3790#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); {3790#true} is VALID [2022-04-08 04:35:19,218 INFO L290 TraceCheckUtils]: 2: Hoare triple {3790#true} assume true; {3790#true} is VALID [2022-04-08 04:35:19,218 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3790#true} {3790#true} #60#return; {3790#true} is VALID [2022-04-08 04:35:19,218 INFO L272 TraceCheckUtils]: 4: Hoare triple {3790#true} call #t~ret5 := main(); {3790#true} is VALID [2022-04-08 04:35:19,218 INFO L290 TraceCheckUtils]: 5: Hoare triple {3790#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; {3790#true} is VALID [2022-04-08 04:35:19,218 INFO L272 TraceCheckUtils]: 6: Hoare triple {3790#true} call assume_abort_if_not((if ~k~0 <= 256 then 1 else 0)); {3790#true} is VALID [2022-04-08 04:35:19,218 INFO L290 TraceCheckUtils]: 7: Hoare triple {3790#true} ~cond := #in~cond; {3790#true} is VALID [2022-04-08 04:35:19,218 INFO L290 TraceCheckUtils]: 8: Hoare triple {3790#true} assume !(0 == ~cond); {3790#true} is VALID [2022-04-08 04:35:19,218 INFO L290 TraceCheckUtils]: 9: Hoare triple {3790#true} assume true; {3790#true} is VALID [2022-04-08 04:35:19,218 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {3790#true} {3790#true} #52#return; {3790#true} is VALID [2022-04-08 04:35:19,221 INFO L290 TraceCheckUtils]: 11: Hoare triple {3790#true} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {3828#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-08 04:35:19,221 INFO L290 TraceCheckUtils]: 12: Hoare triple {3828#(and (= main_~c~0 0) (= main_~y~0 0))} assume !false; {3828#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-08 04:35:19,221 INFO L272 TraceCheckUtils]: 13: Hoare triple {3828#(and (= main_~c~0 0) (= main_~y~0 0))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {3790#true} is VALID [2022-04-08 04:35:19,221 INFO L290 TraceCheckUtils]: 14: Hoare triple {3790#true} ~cond := #in~cond; {3790#true} is VALID [2022-04-08 04:35:19,221 INFO L290 TraceCheckUtils]: 15: Hoare triple {3790#true} assume !(0 == ~cond); {3790#true} is VALID [2022-04-08 04:35:19,221 INFO L290 TraceCheckUtils]: 16: Hoare triple {3790#true} assume true; {3790#true} is VALID [2022-04-08 04:35:19,222 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {3790#true} {3828#(and (= main_~c~0 0) (= main_~y~0 0))} #54#return; {3828#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-08 04:35:19,223 INFO L290 TraceCheckUtils]: 18: Hoare triple {3828#(and (= main_~c~0 0) (= main_~y~0 0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {3850#(and (= main_~y~0 1) (= main_~c~0 1))} is VALID [2022-04-08 04:35:19,223 INFO L290 TraceCheckUtils]: 19: Hoare triple {3850#(and (= main_~y~0 1) (= main_~c~0 1))} assume !false; {3850#(and (= main_~y~0 1) (= main_~c~0 1))} is VALID [2022-04-08 04:35:19,223 INFO L272 TraceCheckUtils]: 20: Hoare triple {3850#(and (= main_~y~0 1) (= main_~c~0 1))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {3790#true} is VALID [2022-04-08 04:35:19,223 INFO L290 TraceCheckUtils]: 21: Hoare triple {3790#true} ~cond := #in~cond; {3790#true} is VALID [2022-04-08 04:35:19,223 INFO L290 TraceCheckUtils]: 22: Hoare triple {3790#true} assume !(0 == ~cond); {3790#true} is VALID [2022-04-08 04:35:19,223 INFO L290 TraceCheckUtils]: 23: Hoare triple {3790#true} assume true; {3790#true} is VALID [2022-04-08 04:35:19,224 INFO L284 TraceCheckUtils]: 24: Hoare quadruple {3790#true} {3850#(and (= main_~y~0 1) (= main_~c~0 1))} #54#return; {3850#(and (= main_~y~0 1) (= main_~c~0 1))} is VALID [2022-04-08 04:35:19,224 INFO L290 TraceCheckUtils]: 25: Hoare triple {3850#(and (= main_~y~0 1) (= main_~c~0 1))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {3872#(and (= main_~y~0 2) (= (+ (- 1) main_~c~0) 1))} is VALID [2022-04-08 04:35:19,225 INFO L290 TraceCheckUtils]: 26: Hoare triple {3872#(and (= main_~y~0 2) (= (+ (- 1) main_~c~0) 1))} assume !false; {3872#(and (= main_~y~0 2) (= (+ (- 1) main_~c~0) 1))} is VALID [2022-04-08 04:35:19,225 INFO L272 TraceCheckUtils]: 27: Hoare triple {3872#(and (= main_~y~0 2) (= (+ (- 1) main_~c~0) 1))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {3790#true} is VALID [2022-04-08 04:35:19,225 INFO L290 TraceCheckUtils]: 28: Hoare triple {3790#true} ~cond := #in~cond; {3790#true} is VALID [2022-04-08 04:35:19,225 INFO L290 TraceCheckUtils]: 29: Hoare triple {3790#true} assume !(0 == ~cond); {3790#true} is VALID [2022-04-08 04:35:19,225 INFO L290 TraceCheckUtils]: 30: Hoare triple {3790#true} assume true; {3790#true} is VALID [2022-04-08 04:35:19,225 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {3790#true} {3872#(and (= main_~y~0 2) (= (+ (- 1) main_~c~0) 1))} #54#return; {3872#(and (= main_~y~0 2) (= (+ (- 1) main_~c~0) 1))} is VALID [2022-04-08 04:35:19,226 INFO L290 TraceCheckUtils]: 32: Hoare triple {3872#(and (= main_~y~0 2) (= (+ (- 1) main_~c~0) 1))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {3894#(and (= (+ (- 2) main_~c~0) 1) (= main_~y~0 3))} is VALID [2022-04-08 04:35:19,226 INFO L290 TraceCheckUtils]: 33: Hoare triple {3894#(and (= (+ (- 2) main_~c~0) 1) (= main_~y~0 3))} assume !false; {3894#(and (= (+ (- 2) main_~c~0) 1) (= main_~y~0 3))} is VALID [2022-04-08 04:35:19,226 INFO L272 TraceCheckUtils]: 34: Hoare triple {3894#(and (= (+ (- 2) main_~c~0) 1) (= main_~y~0 3))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {3790#true} is VALID [2022-04-08 04:35:19,226 INFO L290 TraceCheckUtils]: 35: Hoare triple {3790#true} ~cond := #in~cond; {3790#true} is VALID [2022-04-08 04:35:19,226 INFO L290 TraceCheckUtils]: 36: Hoare triple {3790#true} assume !(0 == ~cond); {3790#true} is VALID [2022-04-08 04:35:19,226 INFO L290 TraceCheckUtils]: 37: Hoare triple {3790#true} assume true; {3790#true} is VALID [2022-04-08 04:35:19,227 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {3790#true} {3894#(and (= (+ (- 2) main_~c~0) 1) (= main_~y~0 3))} #54#return; {3894#(and (= (+ (- 2) main_~c~0) 1) (= main_~y~0 3))} is VALID [2022-04-08 04:35:19,227 INFO L290 TraceCheckUtils]: 39: Hoare triple {3894#(and (= (+ (- 2) main_~c~0) 1) (= main_~y~0 3))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {3916#(and (= 3 (+ (- 1) main_~y~0)) (= main_~c~0 4))} is VALID [2022-04-08 04:35:19,227 INFO L290 TraceCheckUtils]: 40: Hoare triple {3916#(and (= 3 (+ (- 1) main_~y~0)) (= main_~c~0 4))} assume !false; {3916#(and (= 3 (+ (- 1) main_~y~0)) (= main_~c~0 4))} is VALID [2022-04-08 04:35:19,228 INFO L272 TraceCheckUtils]: 41: Hoare triple {3916#(and (= 3 (+ (- 1) main_~y~0)) (= main_~c~0 4))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {3790#true} is VALID [2022-04-08 04:35:19,228 INFO L290 TraceCheckUtils]: 42: Hoare triple {3790#true} ~cond := #in~cond; {3790#true} is VALID [2022-04-08 04:35:19,228 INFO L290 TraceCheckUtils]: 43: Hoare triple {3790#true} assume !(0 == ~cond); {3790#true} is VALID [2022-04-08 04:35:19,228 INFO L290 TraceCheckUtils]: 44: Hoare triple {3790#true} assume true; {3790#true} is VALID [2022-04-08 04:35:19,228 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {3790#true} {3916#(and (= 3 (+ (- 1) main_~y~0)) (= main_~c~0 4))} #54#return; {3916#(and (= 3 (+ (- 1) main_~y~0)) (= main_~c~0 4))} is VALID [2022-04-08 04:35:19,229 INFO L290 TraceCheckUtils]: 46: Hoare triple {3916#(and (= 3 (+ (- 1) main_~y~0)) (= main_~c~0 4))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {3938#(and (= (+ (- 2) main_~y~0) 3) (= (+ (- 1) main_~c~0) 4))} is VALID [2022-04-08 04:35:19,229 INFO L290 TraceCheckUtils]: 47: Hoare triple {3938#(and (= (+ (- 2) main_~y~0) 3) (= (+ (- 1) main_~c~0) 4))} assume !false; {3938#(and (= (+ (- 2) main_~y~0) 3) (= (+ (- 1) main_~c~0) 4))} is VALID [2022-04-08 04:35:19,229 INFO L272 TraceCheckUtils]: 48: Hoare triple {3938#(and (= (+ (- 2) main_~y~0) 3) (= (+ (- 1) main_~c~0) 4))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {3790#true} is VALID [2022-04-08 04:35:19,229 INFO L290 TraceCheckUtils]: 49: Hoare triple {3790#true} ~cond := #in~cond; {3948#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-08 04:35:19,230 INFO L290 TraceCheckUtils]: 50: Hoare triple {3948#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {3952#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 04:35:19,230 INFO L290 TraceCheckUtils]: 51: Hoare triple {3952#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {3952#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 04:35:19,231 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {3952#(not (= |__VERIFIER_assert_#in~cond| 0))} {3938#(and (= (+ (- 2) main_~y~0) 3) (= (+ (- 1) main_~c~0) 4))} #54#return; {3959#(and (= (+ (- 2) main_~y~0) 3) (= (+ (* 2 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (* 6 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (* 5 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0))) (+ (* main_~x~0 12) (* main_~y~0 main_~y~0))) (= (+ (- 1) main_~c~0) 4))} is VALID [2022-04-08 04:35:19,231 INFO L290 TraceCheckUtils]: 53: Hoare triple {3959#(and (= (+ (- 2) main_~y~0) 3) (= (+ (* 2 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (* 6 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (* 5 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0))) (+ (* main_~x~0 12) (* main_~y~0 main_~y~0))) (= (+ (- 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 * ~y~0 * ~y~0 + ~x~0; {3963#(and (= main_~y~0 6) (<= main_~x~0 (+ 4425 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0))) (= 4 (+ (- 2) main_~c~0)))} is VALID [2022-04-08 04:35:19,231 INFO L290 TraceCheckUtils]: 54: Hoare triple {3963#(and (= main_~y~0 6) (<= main_~x~0 (+ 4425 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0))) (= 4 (+ (- 2) main_~c~0)))} assume !false; {3963#(and (= main_~y~0 6) (<= main_~x~0 (+ 4425 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0))) (= 4 (+ (- 2) main_~c~0)))} is VALID [2022-04-08 04:35:19,231 INFO L272 TraceCheckUtils]: 55: Hoare triple {3963#(and (= main_~y~0 6) (<= main_~x~0 (+ 4425 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0))) (= 4 (+ (- 2) main_~c~0)))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {3790#true} is VALID [2022-04-08 04:35:19,232 INFO L290 TraceCheckUtils]: 56: Hoare triple {3790#true} ~cond := #in~cond; {3948#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-08 04:35:19,232 INFO L290 TraceCheckUtils]: 57: Hoare triple {3948#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {3952#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 04:35:19,232 INFO L290 TraceCheckUtils]: 58: Hoare triple {3952#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {3952#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 04:35:19,233 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {3952#(not (= |__VERIFIER_assert_#in~cond| 0))} {3963#(and (= main_~y~0 6) (<= main_~x~0 (+ 4425 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0))) (= 4 (+ (- 2) main_~c~0)))} #54#return; {3982#(and (= main_~y~0 6) (= main_~c~0 6) (= (+ (* 2 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (* 6 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (* 5 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0))) (+ (* main_~x~0 12) (* main_~y~0 main_~y~0))))} is VALID [2022-04-08 04:35:19,234 INFO L290 TraceCheckUtils]: 60: Hoare triple {3982#(and (= main_~y~0 6) (= main_~c~0 6) (= (+ (* 2 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (* 6 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (* 5 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0))) (+ (* main_~x~0 12) (* main_~y~0 main_~y~0))))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {3986#(and (<= main_~c~0 7) (= 7 main_~y~0) (<= (+ (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0) 12201) main_~x~0) (< 6 main_~k~0))} is VALID [2022-04-08 04:35:19,234 INFO L290 TraceCheckUtils]: 61: Hoare triple {3986#(and (<= main_~c~0 7) (= 7 main_~y~0) (<= (+ (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0) 12201) main_~x~0) (< 6 main_~k~0))} assume !false; {3986#(and (<= main_~c~0 7) (= 7 main_~y~0) (<= (+ (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0) 12201) main_~x~0) (< 6 main_~k~0))} is VALID [2022-04-08 04:35:19,234 INFO L272 TraceCheckUtils]: 62: Hoare triple {3986#(and (<= main_~c~0 7) (= 7 main_~y~0) (<= (+ (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0) 12201) main_~x~0) (< 6 main_~k~0))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {3790#true} is VALID [2022-04-08 04:35:19,234 INFO L290 TraceCheckUtils]: 63: Hoare triple {3790#true} ~cond := #in~cond; {3790#true} is VALID [2022-04-08 04:35:19,234 INFO L290 TraceCheckUtils]: 64: Hoare triple {3790#true} assume !(0 == ~cond); {3790#true} is VALID [2022-04-08 04:35:19,234 INFO L290 TraceCheckUtils]: 65: Hoare triple {3790#true} assume true; {3790#true} is VALID [2022-04-08 04:35:19,236 INFO L284 TraceCheckUtils]: 66: Hoare quadruple {3790#true} {3986#(and (<= main_~c~0 7) (= 7 main_~y~0) (<= (+ (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0) 12201) main_~x~0) (< 6 main_~k~0))} #54#return; {3986#(and (<= main_~c~0 7) (= 7 main_~y~0) (<= (+ (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0) 12201) main_~x~0) (< 6 main_~k~0))} is VALID [2022-04-08 04:35:19,236 INFO L290 TraceCheckUtils]: 67: Hoare triple {3986#(and (<= main_~c~0 7) (= 7 main_~y~0) (<= (+ (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0) 12201) main_~x~0) (< 6 main_~k~0))} assume !(~c~0 < ~k~0); {4008#(and (<= main_~k~0 7) (= 7 main_~y~0) (<= (+ (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0) 12201) main_~x~0) (< 6 main_~k~0))} is VALID [2022-04-08 04:35:19,236 INFO L272 TraceCheckUtils]: 68: Hoare triple {4008#(and (<= main_~k~0 7) (= 7 main_~y~0) (<= (+ (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0) 12201) main_~x~0) (< 6 main_~k~0))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {3790#true} is VALID [2022-04-08 04:35:19,237 INFO L290 TraceCheckUtils]: 69: Hoare triple {3790#true} ~cond := #in~cond; {3948#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-08 04:35:19,237 INFO L290 TraceCheckUtils]: 70: Hoare triple {3948#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {3952#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 04:35:19,237 INFO L290 TraceCheckUtils]: 71: Hoare triple {3952#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {3952#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 04:35:19,238 INFO L284 TraceCheckUtils]: 72: Hoare quadruple {3952#(not (= |__VERIFIER_assert_#in~cond| 0))} {4008#(and (<= main_~k~0 7) (= 7 main_~y~0) (<= (+ (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0) 12201) main_~x~0) (< 6 main_~k~0))} #56#return; {4024#(and (<= main_~k~0 7) (= 7 main_~y~0) (< 6 main_~k~0))} is VALID [2022-04-08 04:35:19,238 INFO L272 TraceCheckUtils]: 73: Hoare triple {4024#(and (<= main_~k~0 7) (= 7 main_~y~0) (< 6 main_~k~0))} call __VERIFIER_assert((if ~k~0 * ~y~0 == ~y~0 * ~y~0 then 1 else 0)); {4028#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 04:35:19,239 INFO L290 TraceCheckUtils]: 74: Hoare triple {4028#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {4032#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 04:35:19,239 INFO L290 TraceCheckUtils]: 75: Hoare triple {4032#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {3791#false} is VALID [2022-04-08 04:35:19,239 INFO L290 TraceCheckUtils]: 76: Hoare triple {3791#false} assume !false; {3791#false} is VALID [2022-04-08 04:35:19,239 INFO L134 CoverageAnalysis]: Checked inductivity of 246 backedges. 63 proven. 93 refuted. 0 times theorem prover too weak. 90 trivial. 0 not checked. [2022-04-08 04:35:19,239 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 04:35:46,444 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 04:35:46,444 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [770879875] [2022-04-08 04:35:46,444 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 04:35:46,444 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [600853314] [2022-04-08 04:35:46,444 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [600853314] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 04:35:46,444 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-08 04:35:46,444 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2022-04-08 04:35:46,445 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 04:35:46,445 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1537056627] [2022-04-08 04:35:46,445 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1537056627] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 04:35:46,445 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 04:35:46,445 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2022-04-08 04:35:46,445 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [935963191] [2022-04-08 04:35:46,445 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 04:35:46,445 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 16 states have (on average 2.0) internal successors, (32), 14 states have internal predecessors, (32), 11 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (11), 10 states have call predecessors, (11), 10 states have call successors, (11) Word has length 77 [2022-04-08 04:35:46,445 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 04:35:46,446 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 18 states, 16 states have (on average 2.0) internal successors, (32), 14 states have internal predecessors, (32), 11 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (11), 10 states have call predecessors, (11), 10 states have call successors, (11) [2022-04-08 04:35:46,491 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 56 edges. 56 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 04:35:46,491 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-04-08 04:35:46,491 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 04:35:46,492 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-04-08 04:35:46,492 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=464, Unknown=4, NotChecked=0, Total=552 [2022-04-08 04:35:46,492 INFO L87 Difference]: Start difference. First operand 50 states and 57 transitions. Second operand has 18 states, 16 states have (on average 2.0) internal successors, (32), 14 states have internal predecessors, (32), 11 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (11), 10 states have call predecessors, (11), 10 states have call successors, (11) [2022-04-08 04:35:47,627 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 04:35:47,627 INFO L93 Difference]: Finished difference Result 63 states and 71 transitions. [2022-04-08 04:35:47,627 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-04-08 04:35:47,627 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 16 states have (on average 2.0) internal successors, (32), 14 states have internal predecessors, (32), 11 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (11), 10 states have call predecessors, (11), 10 states have call successors, (11) Word has length 77 [2022-04-08 04:35:47,628 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 04:35:47,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 16 states have (on average 2.0) internal successors, (32), 14 states have internal predecessors, (32), 11 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (11), 10 states have call predecessors, (11), 10 states have call successors, (11) [2022-04-08 04:35:47,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 66 transitions. [2022-04-08 04:35:47,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 16 states have (on average 2.0) internal successors, (32), 14 states have internal predecessors, (32), 11 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (11), 10 states have call predecessors, (11), 10 states have call successors, (11) [2022-04-08 04:35:47,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 66 transitions. [2022-04-08 04:35:47,630 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 16 states and 66 transitions. [2022-04-08 04:35:47,685 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 04:35:47,686 INFO L225 Difference]: With dead ends: 63 [2022-04-08 04:35:47,686 INFO L226 Difference]: Without dead ends: 57 [2022-04-08 04:35:47,686 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 71 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 66 ImplicationChecksByTransitivity, 14.7s TimeCoverageRelationStatistics Valid=105, Invalid=593, Unknown=4, NotChecked=0, Total=702 [2022-04-08 04:35:47,687 INFO L913 BasicCegarLoop]: 34 mSDtfsCounter, 12 mSDsluCounter, 274 mSDsCounter, 0 mSdLazyCounter, 464 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 308 SdHoareTripleChecker+Invalid, 472 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 464 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-04-08 04:35:47,687 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [13 Valid, 308 Invalid, 472 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 464 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-04-08 04:35:47,687 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2022-04-08 04:35:47,734 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2022-04-08 04:35:47,735 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 04:35:47,735 INFO L82 GeneralOperation]: Start isEquivalent. First operand 57 states. Second operand has 57 states, 37 states have (on average 1.027027027027027) internal successors, (38), 37 states have internal predecessors, (38), 14 states have call successors, (14), 7 states have call predecessors, (14), 5 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2022-04-08 04:35:47,735 INFO L74 IsIncluded]: Start isIncluded. First operand 57 states. Second operand has 57 states, 37 states have (on average 1.027027027027027) internal successors, (38), 37 states have internal predecessors, (38), 14 states have call successors, (14), 7 states have call predecessors, (14), 5 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2022-04-08 04:35:47,735 INFO L87 Difference]: Start difference. First operand 57 states. Second operand has 57 states, 37 states have (on average 1.027027027027027) internal successors, (38), 37 states have internal predecessors, (38), 14 states have call successors, (14), 7 states have call predecessors, (14), 5 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2022-04-08 04:35:47,736 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 04:35:47,736 INFO L93 Difference]: Finished difference Result 57 states and 64 transitions. [2022-04-08 04:35:47,737 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 64 transitions. [2022-04-08 04:35:47,737 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 04:35:47,737 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 04:35:47,737 INFO L74 IsIncluded]: Start isIncluded. First operand has 57 states, 37 states have (on average 1.027027027027027) internal successors, (38), 37 states have internal predecessors, (38), 14 states have call successors, (14), 7 states have call predecessors, (14), 5 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) Second operand 57 states. [2022-04-08 04:35:47,737 INFO L87 Difference]: Start difference. First operand has 57 states, 37 states have (on average 1.027027027027027) internal successors, (38), 37 states have internal predecessors, (38), 14 states have call successors, (14), 7 states have call predecessors, (14), 5 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) Second operand 57 states. [2022-04-08 04:35:47,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 04:35:47,738 INFO L93 Difference]: Finished difference Result 57 states and 64 transitions. [2022-04-08 04:35:47,738 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 64 transitions. [2022-04-08 04:35:47,738 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 04:35:47,739 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 04:35:47,739 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 04:35:47,739 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 04:35:47,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 37 states have (on average 1.027027027027027) internal successors, (38), 37 states have internal predecessors, (38), 14 states have call successors, (14), 7 states have call predecessors, (14), 5 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2022-04-08 04:35:47,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 64 transitions. [2022-04-08 04:35:47,740 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 64 transitions. Word has length 77 [2022-04-08 04:35:47,740 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 04:35:47,740 INFO L478 AbstractCegarLoop]: Abstraction has 57 states and 64 transitions. [2022-04-08 04:35:47,740 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 16 states have (on average 2.0) internal successors, (32), 14 states have internal predecessors, (32), 11 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (11), 10 states have call predecessors, (11), 10 states have call successors, (11) [2022-04-08 04:35:47,740 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 57 states and 64 transitions. [2022-04-08 04:35:47,913 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 04:35:47,913 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 64 transitions. [2022-04-08 04:35:47,914 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2022-04-08 04:35:47,914 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 04:35:47,914 INFO L499 BasicCegarLoop]: trace histogram [11, 10, 10, 9, 9, 9, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 04:35:47,919 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 04:35:48,119 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 04:35:48,119 INFO L403 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 04:35:48,119 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 04:35:48,120 INFO L85 PathProgramCache]: Analyzing trace with hash 1196125760, now seen corresponding path program 15 times [2022-04-08 04:35:48,120 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 04:35:48,120 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [397339261] [2022-04-08 04:35:48,211 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 3 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-08 04:35:48,211 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONLINEAR_UPDATE [2022-04-08 04:35:48,211 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 04:35:48,211 INFO L85 PathProgramCache]: Analyzing trace with hash 1196125760, now seen corresponding path program 16 times [2022-04-08 04:35:48,212 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 04:35:48,212 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1654175040] [2022-04-08 04:35:48,212 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 04:35:48,212 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 04:35:48,221 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 04:35:48,221 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [245178281] [2022-04-08 04:35:48,221 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-08 04:35:48,221 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 04:35:48,222 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 04:35:48,223 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 04:35:48,226 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 04:35:48,265 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-08 04:35:48,265 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 04:35:48,266 INFO L263 TraceCheckSpWp]: Trace formula consists of 152 conjuncts, 40 conjunts are in the unsatisfiable core [2022-04-08 04:35:48,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 04:35:48,282 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 04:35:48,737 INFO L272 TraceCheckUtils]: 0: Hoare triple {4458#true} call ULTIMATE.init(); {4458#true} is VALID [2022-04-08 04:35:48,737 INFO L290 TraceCheckUtils]: 1: Hoare triple {4458#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); {4458#true} is VALID [2022-04-08 04:35:48,737 INFO L290 TraceCheckUtils]: 2: Hoare triple {4458#true} assume true; {4458#true} is VALID [2022-04-08 04:35:48,737 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4458#true} {4458#true} #60#return; {4458#true} is VALID [2022-04-08 04:35:48,737 INFO L272 TraceCheckUtils]: 4: Hoare triple {4458#true} call #t~ret5 := main(); {4458#true} is VALID [2022-04-08 04:35:48,738 INFO L290 TraceCheckUtils]: 5: Hoare triple {4458#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; {4458#true} is VALID [2022-04-08 04:35:48,738 INFO L272 TraceCheckUtils]: 6: Hoare triple {4458#true} call assume_abort_if_not((if ~k~0 <= 256 then 1 else 0)); {4458#true} is VALID [2022-04-08 04:35:48,738 INFO L290 TraceCheckUtils]: 7: Hoare triple {4458#true} ~cond := #in~cond; {4458#true} is VALID [2022-04-08 04:35:48,738 INFO L290 TraceCheckUtils]: 8: Hoare triple {4458#true} assume !(0 == ~cond); {4458#true} is VALID [2022-04-08 04:35:48,738 INFO L290 TraceCheckUtils]: 9: Hoare triple {4458#true} assume true; {4458#true} is VALID [2022-04-08 04:35:48,738 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {4458#true} {4458#true} #52#return; {4458#true} is VALID [2022-04-08 04:35:48,738 INFO L290 TraceCheckUtils]: 11: Hoare triple {4458#true} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {4496#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-08 04:35:48,738 INFO L290 TraceCheckUtils]: 12: Hoare triple {4496#(and (= main_~c~0 0) (= main_~y~0 0))} assume !false; {4496#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-08 04:35:48,739 INFO L272 TraceCheckUtils]: 13: Hoare triple {4496#(and (= main_~c~0 0) (= main_~y~0 0))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {4458#true} is VALID [2022-04-08 04:35:48,739 INFO L290 TraceCheckUtils]: 14: Hoare triple {4458#true} ~cond := #in~cond; {4458#true} is VALID [2022-04-08 04:35:48,739 INFO L290 TraceCheckUtils]: 15: Hoare triple {4458#true} assume !(0 == ~cond); {4458#true} is VALID [2022-04-08 04:35:48,739 INFO L290 TraceCheckUtils]: 16: Hoare triple {4458#true} assume true; {4458#true} is VALID [2022-04-08 04:35:48,739 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {4458#true} {4496#(and (= main_~c~0 0) (= main_~y~0 0))} #54#return; {4496#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-08 04:35:48,740 INFO L290 TraceCheckUtils]: 18: Hoare triple {4496#(and (= main_~c~0 0) (= main_~y~0 0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {4518#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} is VALID [2022-04-08 04:35:48,740 INFO L290 TraceCheckUtils]: 19: Hoare triple {4518#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} assume !false; {4518#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} is VALID [2022-04-08 04:35:48,741 INFO L272 TraceCheckUtils]: 20: Hoare triple {4518#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {4458#true} is VALID [2022-04-08 04:35:48,741 INFO L290 TraceCheckUtils]: 21: Hoare triple {4458#true} ~cond := #in~cond; {4458#true} is VALID [2022-04-08 04:35:48,741 INFO L290 TraceCheckUtils]: 22: Hoare triple {4458#true} assume !(0 == ~cond); {4458#true} is VALID [2022-04-08 04:35:48,741 INFO L290 TraceCheckUtils]: 23: Hoare triple {4458#true} assume true; {4458#true} is VALID [2022-04-08 04:35:48,742 INFO L284 TraceCheckUtils]: 24: Hoare quadruple {4458#true} {4518#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} #54#return; {4518#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} is VALID [2022-04-08 04:35:48,743 INFO L290 TraceCheckUtils]: 25: Hoare triple {4518#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {4540#(and (= main_~y~0 2) (= main_~c~0 2))} is VALID [2022-04-08 04:35:48,743 INFO L290 TraceCheckUtils]: 26: Hoare triple {4540#(and (= main_~y~0 2) (= main_~c~0 2))} assume !false; {4540#(and (= main_~y~0 2) (= main_~c~0 2))} is VALID [2022-04-08 04:35:48,743 INFO L272 TraceCheckUtils]: 27: Hoare triple {4540#(and (= main_~y~0 2) (= main_~c~0 2))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {4458#true} is VALID [2022-04-08 04:35:48,743 INFO L290 TraceCheckUtils]: 28: Hoare triple {4458#true} ~cond := #in~cond; {4458#true} is VALID [2022-04-08 04:35:48,743 INFO L290 TraceCheckUtils]: 29: Hoare triple {4458#true} assume !(0 == ~cond); {4458#true} is VALID [2022-04-08 04:35:48,744 INFO L290 TraceCheckUtils]: 30: Hoare triple {4458#true} assume true; {4458#true} is VALID [2022-04-08 04:35:48,744 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {4458#true} {4540#(and (= main_~y~0 2) (= main_~c~0 2))} #54#return; {4540#(and (= main_~y~0 2) (= main_~c~0 2))} is VALID [2022-04-08 04:35:48,744 INFO L290 TraceCheckUtils]: 32: Hoare triple {4540#(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 * ~y~0 * ~y~0 + ~x~0; {4562#(and (= 2 (+ (- 1) main_~y~0)) (= main_~c~0 3))} is VALID [2022-04-08 04:35:48,745 INFO L290 TraceCheckUtils]: 33: Hoare triple {4562#(and (= 2 (+ (- 1) main_~y~0)) (= main_~c~0 3))} assume !false; {4562#(and (= 2 (+ (- 1) main_~y~0)) (= main_~c~0 3))} is VALID [2022-04-08 04:35:48,745 INFO L272 TraceCheckUtils]: 34: Hoare triple {4562#(and (= 2 (+ (- 1) main_~y~0)) (= main_~c~0 3))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {4458#true} is VALID [2022-04-08 04:35:48,745 INFO L290 TraceCheckUtils]: 35: Hoare triple {4458#true} ~cond := #in~cond; {4458#true} is VALID [2022-04-08 04:35:48,745 INFO L290 TraceCheckUtils]: 36: Hoare triple {4458#true} assume !(0 == ~cond); {4458#true} is VALID [2022-04-08 04:35:48,745 INFO L290 TraceCheckUtils]: 37: Hoare triple {4458#true} assume true; {4458#true} is VALID [2022-04-08 04:35:48,745 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {4458#true} {4562#(and (= 2 (+ (- 1) main_~y~0)) (= main_~c~0 3))} #54#return; {4562#(and (= 2 (+ (- 1) main_~y~0)) (= main_~c~0 3))} is VALID [2022-04-08 04:35:48,746 INFO L290 TraceCheckUtils]: 39: Hoare triple {4562#(and (= 2 (+ (- 1) main_~y~0)) (= 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 * ~y~0 * ~y~0 + ~x~0; {4584#(and (= (+ (- 1) main_~c~0) 3) (= (+ (- 2) main_~y~0) 2))} is VALID [2022-04-08 04:35:48,746 INFO L290 TraceCheckUtils]: 40: Hoare triple {4584#(and (= (+ (- 1) main_~c~0) 3) (= (+ (- 2) main_~y~0) 2))} assume !false; {4584#(and (= (+ (- 1) main_~c~0) 3) (= (+ (- 2) main_~y~0) 2))} is VALID [2022-04-08 04:35:48,746 INFO L272 TraceCheckUtils]: 41: Hoare triple {4584#(and (= (+ (- 1) main_~c~0) 3) (= (+ (- 2) main_~y~0) 2))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {4458#true} is VALID [2022-04-08 04:35:48,746 INFO L290 TraceCheckUtils]: 42: Hoare triple {4458#true} ~cond := #in~cond; {4458#true} is VALID [2022-04-08 04:35:48,747 INFO L290 TraceCheckUtils]: 43: Hoare triple {4458#true} assume !(0 == ~cond); {4458#true} is VALID [2022-04-08 04:35:48,747 INFO L290 TraceCheckUtils]: 44: Hoare triple {4458#true} assume true; {4458#true} is VALID [2022-04-08 04:35:48,747 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {4458#true} {4584#(and (= (+ (- 1) main_~c~0) 3) (= (+ (- 2) main_~y~0) 2))} #54#return; {4584#(and (= (+ (- 1) main_~c~0) 3) (= (+ (- 2) main_~y~0) 2))} is VALID [2022-04-08 04:35:48,748 INFO L290 TraceCheckUtils]: 46: Hoare triple {4584#(and (= (+ (- 1) main_~c~0) 3) (= (+ (- 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 * ~y~0 * ~y~0 + ~x~0; {4606#(and (= (+ main_~y~0 (- 3)) 2) (= 5 main_~c~0))} is VALID [2022-04-08 04:35:48,748 INFO L290 TraceCheckUtils]: 47: Hoare triple {4606#(and (= (+ main_~y~0 (- 3)) 2) (= 5 main_~c~0))} assume !false; {4606#(and (= (+ main_~y~0 (- 3)) 2) (= 5 main_~c~0))} is VALID [2022-04-08 04:35:48,748 INFO L272 TraceCheckUtils]: 48: Hoare triple {4606#(and (= (+ main_~y~0 (- 3)) 2) (= 5 main_~c~0))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {4458#true} is VALID [2022-04-08 04:35:48,748 INFO L290 TraceCheckUtils]: 49: Hoare triple {4458#true} ~cond := #in~cond; {4458#true} is VALID [2022-04-08 04:35:48,748 INFO L290 TraceCheckUtils]: 50: Hoare triple {4458#true} assume !(0 == ~cond); {4458#true} is VALID [2022-04-08 04:35:48,748 INFO L290 TraceCheckUtils]: 51: Hoare triple {4458#true} assume true; {4458#true} is VALID [2022-04-08 04:35:48,749 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {4458#true} {4606#(and (= (+ main_~y~0 (- 3)) 2) (= 5 main_~c~0))} #54#return; {4606#(and (= (+ main_~y~0 (- 3)) 2) (= 5 main_~c~0))} is VALID [2022-04-08 04:35:48,749 INFO L290 TraceCheckUtils]: 53: Hoare triple {4606#(and (= (+ main_~y~0 (- 3)) 2) (= 5 main_~c~0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {4628#(and (= (+ main_~y~0 (- 4)) 2) (= (+ (- 1) main_~c~0) 5))} is VALID [2022-04-08 04:35:48,749 INFO L290 TraceCheckUtils]: 54: Hoare triple {4628#(and (= (+ main_~y~0 (- 4)) 2) (= (+ (- 1) main_~c~0) 5))} assume !false; {4628#(and (= (+ main_~y~0 (- 4)) 2) (= (+ (- 1) main_~c~0) 5))} is VALID [2022-04-08 04:35:48,750 INFO L272 TraceCheckUtils]: 55: Hoare triple {4628#(and (= (+ main_~y~0 (- 4)) 2) (= (+ (- 1) main_~c~0) 5))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {4458#true} is VALID [2022-04-08 04:35:48,750 INFO L290 TraceCheckUtils]: 56: Hoare triple {4458#true} ~cond := #in~cond; {4458#true} is VALID [2022-04-08 04:35:48,750 INFO L290 TraceCheckUtils]: 57: Hoare triple {4458#true} assume !(0 == ~cond); {4458#true} is VALID [2022-04-08 04:35:48,750 INFO L290 TraceCheckUtils]: 58: Hoare triple {4458#true} assume true; {4458#true} is VALID [2022-04-08 04:35:48,750 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {4458#true} {4628#(and (= (+ main_~y~0 (- 4)) 2) (= (+ (- 1) main_~c~0) 5))} #54#return; {4628#(and (= (+ main_~y~0 (- 4)) 2) (= (+ (- 1) main_~c~0) 5))} is VALID [2022-04-08 04:35:48,751 INFO L290 TraceCheckUtils]: 60: Hoare triple {4628#(and (= (+ main_~y~0 (- 4)) 2) (= (+ (- 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 * ~y~0 * ~y~0 + ~x~0; {4650#(and (= 5 (+ (- 2) main_~c~0)) (= 2 (+ main_~y~0 (- 5))))} is VALID [2022-04-08 04:35:48,751 INFO L290 TraceCheckUtils]: 61: Hoare triple {4650#(and (= 5 (+ (- 2) main_~c~0)) (= 2 (+ main_~y~0 (- 5))))} assume !false; {4650#(and (= 5 (+ (- 2) main_~c~0)) (= 2 (+ main_~y~0 (- 5))))} is VALID [2022-04-08 04:35:48,751 INFO L272 TraceCheckUtils]: 62: Hoare triple {4650#(and (= 5 (+ (- 2) main_~c~0)) (= 2 (+ main_~y~0 (- 5))))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {4458#true} is VALID [2022-04-08 04:35:48,751 INFO L290 TraceCheckUtils]: 63: Hoare triple {4458#true} ~cond := #in~cond; {4458#true} is VALID [2022-04-08 04:35:48,751 INFO L290 TraceCheckUtils]: 64: Hoare triple {4458#true} assume !(0 == ~cond); {4458#true} is VALID [2022-04-08 04:35:48,751 INFO L290 TraceCheckUtils]: 65: Hoare triple {4458#true} assume true; {4458#true} is VALID [2022-04-08 04:35:48,752 INFO L284 TraceCheckUtils]: 66: Hoare quadruple {4458#true} {4650#(and (= 5 (+ (- 2) main_~c~0)) (= 2 (+ main_~y~0 (- 5))))} #54#return; {4650#(and (= 5 (+ (- 2) main_~c~0)) (= 2 (+ main_~y~0 (- 5))))} is VALID [2022-04-08 04:35:48,752 INFO L290 TraceCheckUtils]: 67: Hoare triple {4650#(and (= 5 (+ (- 2) main_~c~0)) (= 2 (+ main_~y~0 (- 5))))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {4672#(and (< 7 main_~k~0) (= main_~y~0 8) (<= main_~c~0 8))} is VALID [2022-04-08 04:35:48,753 INFO L290 TraceCheckUtils]: 68: Hoare triple {4672#(and (< 7 main_~k~0) (= main_~y~0 8) (<= main_~c~0 8))} assume !false; {4672#(and (< 7 main_~k~0) (= main_~y~0 8) (<= main_~c~0 8))} is VALID [2022-04-08 04:35:48,753 INFO L272 TraceCheckUtils]: 69: Hoare triple {4672#(and (< 7 main_~k~0) (= main_~y~0 8) (<= main_~c~0 8))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {4458#true} is VALID [2022-04-08 04:35:48,753 INFO L290 TraceCheckUtils]: 70: Hoare triple {4458#true} ~cond := #in~cond; {4458#true} is VALID [2022-04-08 04:35:48,753 INFO L290 TraceCheckUtils]: 71: Hoare triple {4458#true} assume !(0 == ~cond); {4458#true} is VALID [2022-04-08 04:35:48,753 INFO L290 TraceCheckUtils]: 72: Hoare triple {4458#true} assume true; {4458#true} is VALID [2022-04-08 04:35:48,754 INFO L284 TraceCheckUtils]: 73: Hoare quadruple {4458#true} {4672#(and (< 7 main_~k~0) (= main_~y~0 8) (<= main_~c~0 8))} #54#return; {4672#(and (< 7 main_~k~0) (= main_~y~0 8) (<= main_~c~0 8))} is VALID [2022-04-08 04:35:48,754 INFO L290 TraceCheckUtils]: 74: Hoare triple {4672#(and (< 7 main_~k~0) (= main_~y~0 8) (<= main_~c~0 8))} assume !(~c~0 < ~k~0); {4694#(and (< 7 main_~k~0) (= main_~y~0 8) (<= main_~k~0 8))} is VALID [2022-04-08 04:35:48,754 INFO L272 TraceCheckUtils]: 75: Hoare triple {4694#(and (< 7 main_~k~0) (= main_~y~0 8) (<= main_~k~0 8))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {4458#true} is VALID [2022-04-08 04:35:48,754 INFO L290 TraceCheckUtils]: 76: Hoare triple {4458#true} ~cond := #in~cond; {4458#true} is VALID [2022-04-08 04:35:48,754 INFO L290 TraceCheckUtils]: 77: Hoare triple {4458#true} assume !(0 == ~cond); {4458#true} is VALID [2022-04-08 04:35:48,754 INFO L290 TraceCheckUtils]: 78: Hoare triple {4458#true} assume true; {4458#true} is VALID [2022-04-08 04:35:48,755 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {4458#true} {4694#(and (< 7 main_~k~0) (= main_~y~0 8) (<= main_~k~0 8))} #56#return; {4694#(and (< 7 main_~k~0) (= main_~y~0 8) (<= main_~k~0 8))} is VALID [2022-04-08 04:35:48,755 INFO L272 TraceCheckUtils]: 80: Hoare triple {4694#(and (< 7 main_~k~0) (= main_~y~0 8) (<= main_~k~0 8))} call __VERIFIER_assert((if ~k~0 * ~y~0 == ~y~0 * ~y~0 then 1 else 0)); {4713#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 04:35:48,756 INFO L290 TraceCheckUtils]: 81: Hoare triple {4713#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {4717#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 04:35:48,756 INFO L290 TraceCheckUtils]: 82: Hoare triple {4717#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {4459#false} is VALID [2022-04-08 04:35:48,756 INFO L290 TraceCheckUtils]: 83: Hoare triple {4459#false} assume !false; {4459#false} is VALID [2022-04-08 04:35:48,756 INFO L134 CoverageAnalysis]: Checked inductivity of 308 backedges. 20 proven. 108 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2022-04-08 04:35:48,756 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 04:35:49,174 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 04:35:49,174 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1654175040] [2022-04-08 04:35:49,174 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 04:35:49,174 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [245178281] [2022-04-08 04:35:49,174 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [245178281] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 04:35:49,174 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-08 04:35:49,174 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2022-04-08 04:35:49,175 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 04:35:49,175 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [397339261] [2022-04-08 04:35:49,175 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [397339261] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 04:35:49,175 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 04:35:49,175 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-04-08 04:35:49,175 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [430658508] [2022-04-08 04:35:49,175 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 04:35:49,175 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 2.3846153846153846) internal successors, (31), 13 states have internal predecessors, (31), 11 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (12), 11 states have call predecessors, (12), 11 states have call successors, (12) Word has length 84 [2022-04-08 04:35:49,176 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 04:35:49,176 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 14 states, 13 states have (on average 2.3846153846153846) internal successors, (31), 13 states have internal predecessors, (31), 11 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (12), 11 states have call predecessors, (12), 11 states have call successors, (12) [2022-04-08 04:35:49,222 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 04:35:49,222 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-04-08 04:35:49,223 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 04:35:49,223 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-04-08 04:35:49,227 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=227, Unknown=0, NotChecked=0, Total=272 [2022-04-08 04:35:49,227 INFO L87 Difference]: Start difference. First operand 57 states and 64 transitions. Second operand has 14 states, 13 states have (on average 2.3846153846153846) internal successors, (31), 13 states have internal predecessors, (31), 11 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (12), 11 states have call predecessors, (12), 11 states have call successors, (12) [2022-04-08 04:35:50,307 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 04:35:50,307 INFO L93 Difference]: Finished difference Result 66 states and 75 transitions. [2022-04-08 04:35:50,307 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-04-08 04:35:50,308 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 2.3846153846153846) internal successors, (31), 13 states have internal predecessors, (31), 11 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (12), 11 states have call predecessors, (12), 11 states have call successors, (12) Word has length 84 [2022-04-08 04:35:50,308 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 04:35:50,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 13 states have (on average 2.3846153846153846) internal successors, (31), 13 states have internal predecessors, (31), 11 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (12), 11 states have call predecessors, (12), 11 states have call successors, (12) [2022-04-08 04:35:50,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 68 transitions. [2022-04-08 04:35:50,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 13 states have (on average 2.3846153846153846) internal successors, (31), 13 states have internal predecessors, (31), 11 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (12), 11 states have call predecessors, (12), 11 states have call successors, (12) [2022-04-08 04:35:50,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 68 transitions. [2022-04-08 04:35:50,312 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 14 states and 68 transitions. [2022-04-08 04:35:50,364 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 04:35:50,365 INFO L225 Difference]: With dead ends: 66 [2022-04-08 04:35:50,365 INFO L226 Difference]: Without dead ends: 60 [2022-04-08 04:35:50,365 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 85 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=55, Invalid=287, Unknown=0, NotChecked=0, Total=342 [2022-04-08 04:35:50,366 INFO L913 BasicCegarLoop]: 49 mSDtfsCounter, 2 mSDsluCounter, 321 mSDsCounter, 0 mSdLazyCounter, 379 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 370 SdHoareTripleChecker+Invalid, 380 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 379 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-04-08 04:35:50,366 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [2 Valid, 370 Invalid, 380 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 379 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-04-08 04:35:50,366 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2022-04-08 04:35:50,404 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 60. [2022-04-08 04:35:50,404 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 04:35:50,405 INFO L82 GeneralOperation]: Start isEquivalent. First operand 60 states. Second operand has 60 states, 39 states have (on average 1.0256410256410255) internal successors, (40), 39 states have internal predecessors, (40), 15 states have call successors, (15), 7 states have call predecessors, (15), 5 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2022-04-08 04:35:50,405 INFO L74 IsIncluded]: Start isIncluded. First operand 60 states. Second operand has 60 states, 39 states have (on average 1.0256410256410255) internal successors, (40), 39 states have internal predecessors, (40), 15 states have call successors, (15), 7 states have call predecessors, (15), 5 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2022-04-08 04:35:50,405 INFO L87 Difference]: Start difference. First operand 60 states. Second operand has 60 states, 39 states have (on average 1.0256410256410255) internal successors, (40), 39 states have internal predecessors, (40), 15 states have call successors, (15), 7 states have call predecessors, (15), 5 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2022-04-08 04:35:50,407 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 04:35:50,407 INFO L93 Difference]: Finished difference Result 60 states and 68 transitions. [2022-04-08 04:35:50,407 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 68 transitions. [2022-04-08 04:35:50,407 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 04:35:50,407 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 04:35:50,407 INFO L74 IsIncluded]: Start isIncluded. First operand has 60 states, 39 states have (on average 1.0256410256410255) internal successors, (40), 39 states have internal predecessors, (40), 15 states have call successors, (15), 7 states have call predecessors, (15), 5 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) Second operand 60 states. [2022-04-08 04:35:50,408 INFO L87 Difference]: Start difference. First operand has 60 states, 39 states have (on average 1.0256410256410255) internal successors, (40), 39 states have internal predecessors, (40), 15 states have call successors, (15), 7 states have call predecessors, (15), 5 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) Second operand 60 states. [2022-04-08 04:35:50,409 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 04:35:50,409 INFO L93 Difference]: Finished difference Result 60 states and 68 transitions. [2022-04-08 04:35:50,409 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 68 transitions. [2022-04-08 04:35:50,409 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 04:35:50,409 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 04:35:50,410 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 04:35:50,410 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 04:35:50,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 39 states have (on average 1.0256410256410255) internal successors, (40), 39 states have internal predecessors, (40), 15 states have call successors, (15), 7 states have call predecessors, (15), 5 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2022-04-08 04:35:50,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 68 transitions. [2022-04-08 04:35:50,419 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 68 transitions. Word has length 84 [2022-04-08 04:35:50,420 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 04:35:50,420 INFO L478 AbstractCegarLoop]: Abstraction has 60 states and 68 transitions. [2022-04-08 04:35:50,420 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 2.3846153846153846) internal successors, (31), 13 states have internal predecessors, (31), 11 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (12), 11 states have call predecessors, (12), 11 states have call successors, (12) [2022-04-08 04:35:50,420 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 60 states and 68 transitions. [2022-04-08 04:35:50,604 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 04:35:50,604 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 68 transitions. [2022-04-08 04:35:50,605 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2022-04-08 04:35:50,605 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 04:35:50,605 INFO L499 BasicCegarLoop]: trace histogram [12, 11, 11, 10, 10, 10, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 04:35:50,621 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 04:35:50,805 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 04:35:50,806 INFO L403 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 04:35:50,806 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 04:35:50,806 INFO L85 PathProgramCache]: Analyzing trace with hash -94164991, now seen corresponding path program 17 times [2022-04-08 04:35:50,806 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 04:35:50,806 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1719652911] [2022-04-08 04:35:50,895 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 3 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-08 04:35:50,895 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONLINEAR_UPDATE [2022-04-08 04:35:50,896 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 04:35:50,896 INFO L85 PathProgramCache]: Analyzing trace with hash -94164991, now seen corresponding path program 18 times [2022-04-08 04:35:50,896 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 04:35:50,896 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [510673544] [2022-04-08 04:35:50,896 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 04:35:50,896 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 04:35:50,943 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 04:35:50,944 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1052055383] [2022-04-08 04:35:50,944 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-08 04:35:50,944 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 04:35:50,944 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 04:35:50,945 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 04:35:50,946 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 04:35:51,551 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 10 check-sat command(s) [2022-04-08 04:35:51,551 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 04:35:51,553 INFO L263 TraceCheckSpWp]: Trace formula consists of 240 conjuncts, 55 conjunts are in the unsatisfiable core [2022-04-08 04:35:51,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 04:35:51,570 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 04:35:52,181 INFO L272 TraceCheckUtils]: 0: Hoare triple {5156#true} call ULTIMATE.init(); {5156#true} is VALID [2022-04-08 04:35:52,181 INFO L290 TraceCheckUtils]: 1: Hoare triple {5156#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); {5156#true} is VALID [2022-04-08 04:35:52,182 INFO L290 TraceCheckUtils]: 2: Hoare triple {5156#true} assume true; {5156#true} is VALID [2022-04-08 04:35:52,182 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5156#true} {5156#true} #60#return; {5156#true} is VALID [2022-04-08 04:35:52,182 INFO L272 TraceCheckUtils]: 4: Hoare triple {5156#true} call #t~ret5 := main(); {5156#true} is VALID [2022-04-08 04:35:52,182 INFO L290 TraceCheckUtils]: 5: Hoare triple {5156#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; {5156#true} is VALID [2022-04-08 04:35:52,182 INFO L272 TraceCheckUtils]: 6: Hoare triple {5156#true} call assume_abort_if_not((if ~k~0 <= 256 then 1 else 0)); {5156#true} is VALID [2022-04-08 04:35:52,182 INFO L290 TraceCheckUtils]: 7: Hoare triple {5156#true} ~cond := #in~cond; {5156#true} is VALID [2022-04-08 04:35:52,182 INFO L290 TraceCheckUtils]: 8: Hoare triple {5156#true} assume !(0 == ~cond); {5156#true} is VALID [2022-04-08 04:35:52,182 INFO L290 TraceCheckUtils]: 9: Hoare triple {5156#true} assume true; {5156#true} is VALID [2022-04-08 04:35:52,182 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {5156#true} {5156#true} #52#return; {5156#true} is VALID [2022-04-08 04:35:52,182 INFO L290 TraceCheckUtils]: 11: Hoare triple {5156#true} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {5194#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-08 04:35:52,183 INFO L290 TraceCheckUtils]: 12: Hoare triple {5194#(and (= main_~c~0 0) (= main_~y~0 0))} assume !false; {5194#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-08 04:35:52,183 INFO L272 TraceCheckUtils]: 13: Hoare triple {5194#(and (= main_~c~0 0) (= main_~y~0 0))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {5156#true} is VALID [2022-04-08 04:35:52,183 INFO L290 TraceCheckUtils]: 14: Hoare triple {5156#true} ~cond := #in~cond; {5156#true} is VALID [2022-04-08 04:35:52,183 INFO L290 TraceCheckUtils]: 15: Hoare triple {5156#true} assume !(0 == ~cond); {5156#true} is VALID [2022-04-08 04:35:52,183 INFO L290 TraceCheckUtils]: 16: Hoare triple {5156#true} assume true; {5156#true} is VALID [2022-04-08 04:35:52,184 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {5156#true} {5194#(and (= main_~c~0 0) (= main_~y~0 0))} #54#return; {5194#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-08 04:35:52,185 INFO L290 TraceCheckUtils]: 18: Hoare triple {5194#(and (= main_~c~0 0) (= main_~y~0 0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {5216#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} is VALID [2022-04-08 04:35:52,185 INFO L290 TraceCheckUtils]: 19: Hoare triple {5216#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} assume !false; {5216#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} is VALID [2022-04-08 04:35:52,185 INFO L272 TraceCheckUtils]: 20: Hoare triple {5216#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {5156#true} is VALID [2022-04-08 04:35:52,185 INFO L290 TraceCheckUtils]: 21: Hoare triple {5156#true} ~cond := #in~cond; {5156#true} is VALID [2022-04-08 04:35:52,185 INFO L290 TraceCheckUtils]: 22: Hoare triple {5156#true} assume !(0 == ~cond); {5156#true} is VALID [2022-04-08 04:35:52,185 INFO L290 TraceCheckUtils]: 23: Hoare triple {5156#true} assume true; {5156#true} is VALID [2022-04-08 04:35:52,186 INFO L284 TraceCheckUtils]: 24: Hoare quadruple {5156#true} {5216#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} #54#return; {5216#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} is VALID [2022-04-08 04:35:52,186 INFO L290 TraceCheckUtils]: 25: Hoare triple {5216#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {5238#(and (= main_~y~0 2) (= main_~c~0 2))} is VALID [2022-04-08 04:35:52,187 INFO L290 TraceCheckUtils]: 26: Hoare triple {5238#(and (= main_~y~0 2) (= main_~c~0 2))} assume !false; {5238#(and (= main_~y~0 2) (= main_~c~0 2))} is VALID [2022-04-08 04:35:52,187 INFO L272 TraceCheckUtils]: 27: Hoare triple {5238#(and (= main_~y~0 2) (= main_~c~0 2))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {5156#true} is VALID [2022-04-08 04:35:52,187 INFO L290 TraceCheckUtils]: 28: Hoare triple {5156#true} ~cond := #in~cond; {5156#true} is VALID [2022-04-08 04:35:52,187 INFO L290 TraceCheckUtils]: 29: Hoare triple {5156#true} assume !(0 == ~cond); {5156#true} is VALID [2022-04-08 04:35:52,187 INFO L290 TraceCheckUtils]: 30: Hoare triple {5156#true} assume true; {5156#true} is VALID [2022-04-08 04:35:52,188 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {5156#true} {5238#(and (= main_~y~0 2) (= main_~c~0 2))} #54#return; {5238#(and (= main_~y~0 2) (= main_~c~0 2))} is VALID [2022-04-08 04:35:52,188 INFO L290 TraceCheckUtils]: 32: Hoare triple {5238#(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 * ~y~0 * ~y~0 + ~x~0; {5260#(and (= 2 (+ (- 1) main_~y~0)) (= (+ (- 1) main_~c~0) 2))} is VALID [2022-04-08 04:35:52,188 INFO L290 TraceCheckUtils]: 33: Hoare triple {5260#(and (= 2 (+ (- 1) main_~y~0)) (= (+ (- 1) main_~c~0) 2))} assume !false; {5260#(and (= 2 (+ (- 1) main_~y~0)) (= (+ (- 1) main_~c~0) 2))} is VALID [2022-04-08 04:35:52,188 INFO L272 TraceCheckUtils]: 34: Hoare triple {5260#(and (= 2 (+ (- 1) main_~y~0)) (= (+ (- 1) main_~c~0) 2))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {5156#true} is VALID [2022-04-08 04:35:52,189 INFO L290 TraceCheckUtils]: 35: Hoare triple {5156#true} ~cond := #in~cond; {5156#true} is VALID [2022-04-08 04:35:52,189 INFO L290 TraceCheckUtils]: 36: Hoare triple {5156#true} assume !(0 == ~cond); {5156#true} is VALID [2022-04-08 04:35:52,189 INFO L290 TraceCheckUtils]: 37: Hoare triple {5156#true} assume true; {5156#true} is VALID [2022-04-08 04:35:52,189 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {5156#true} {5260#(and (= 2 (+ (- 1) main_~y~0)) (= (+ (- 1) main_~c~0) 2))} #54#return; {5260#(and (= 2 (+ (- 1) main_~y~0)) (= (+ (- 1) main_~c~0) 2))} is VALID [2022-04-08 04:35:52,190 INFO L290 TraceCheckUtils]: 39: Hoare triple {5260#(and (= 2 (+ (- 1) main_~y~0)) (= (+ (- 1) main_~c~0) 2))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {5282#(and (= main_~y~0 4) (= main_~c~0 4))} is VALID [2022-04-08 04:35:52,190 INFO L290 TraceCheckUtils]: 40: Hoare triple {5282#(and (= main_~y~0 4) (= main_~c~0 4))} assume !false; {5282#(and (= main_~y~0 4) (= main_~c~0 4))} is VALID [2022-04-08 04:35:52,190 INFO L272 TraceCheckUtils]: 41: Hoare triple {5282#(and (= main_~y~0 4) (= main_~c~0 4))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {5156#true} is VALID [2022-04-08 04:35:52,190 INFO L290 TraceCheckUtils]: 42: Hoare triple {5156#true} ~cond := #in~cond; {5156#true} is VALID [2022-04-08 04:35:52,190 INFO L290 TraceCheckUtils]: 43: Hoare triple {5156#true} assume !(0 == ~cond); {5156#true} is VALID [2022-04-08 04:35:52,190 INFO L290 TraceCheckUtils]: 44: Hoare triple {5156#true} assume true; {5156#true} is VALID [2022-04-08 04:35:52,191 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {5156#true} {5282#(and (= main_~y~0 4) (= main_~c~0 4))} #54#return; {5282#(and (= main_~y~0 4) (= main_~c~0 4))} is VALID [2022-04-08 04:35:52,192 INFO L290 TraceCheckUtils]: 46: Hoare triple {5282#(and (= main_~y~0 4) (= main_~c~0 4))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {5304#(and (= (+ (- 1) main_~y~0) 4) (= (+ (- 1) main_~c~0) 4))} is VALID [2022-04-08 04:35:52,192 INFO L290 TraceCheckUtils]: 47: Hoare triple {5304#(and (= (+ (- 1) main_~y~0) 4) (= (+ (- 1) main_~c~0) 4))} assume !false; {5304#(and (= (+ (- 1) main_~y~0) 4) (= (+ (- 1) main_~c~0) 4))} is VALID [2022-04-08 04:35:52,192 INFO L272 TraceCheckUtils]: 48: Hoare triple {5304#(and (= (+ (- 1) main_~y~0) 4) (= (+ (- 1) main_~c~0) 4))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {5156#true} is VALID [2022-04-08 04:35:52,192 INFO L290 TraceCheckUtils]: 49: Hoare triple {5156#true} ~cond := #in~cond; {5156#true} is VALID [2022-04-08 04:35:52,192 INFO L290 TraceCheckUtils]: 50: Hoare triple {5156#true} assume !(0 == ~cond); {5156#true} is VALID [2022-04-08 04:35:52,192 INFO L290 TraceCheckUtils]: 51: Hoare triple {5156#true} assume true; {5156#true} is VALID [2022-04-08 04:35:52,193 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {5156#true} {5304#(and (= (+ (- 1) main_~y~0) 4) (= (+ (- 1) main_~c~0) 4))} #54#return; {5304#(and (= (+ (- 1) main_~y~0) 4) (= (+ (- 1) main_~c~0) 4))} is VALID [2022-04-08 04:35:52,193 INFO L290 TraceCheckUtils]: 53: Hoare triple {5304#(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 * ~y~0 * ~y~0 + ~x~0; {5326#(and (= main_~y~0 6) (= 4 (+ (- 2) main_~c~0)))} is VALID [2022-04-08 04:35:52,193 INFO L290 TraceCheckUtils]: 54: Hoare triple {5326#(and (= main_~y~0 6) (= 4 (+ (- 2) main_~c~0)))} assume !false; {5326#(and (= main_~y~0 6) (= 4 (+ (- 2) main_~c~0)))} is VALID [2022-04-08 04:35:52,194 INFO L272 TraceCheckUtils]: 55: Hoare triple {5326#(and (= main_~y~0 6) (= 4 (+ (- 2) main_~c~0)))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {5156#true} is VALID [2022-04-08 04:35:52,194 INFO L290 TraceCheckUtils]: 56: Hoare triple {5156#true} ~cond := #in~cond; {5156#true} is VALID [2022-04-08 04:35:52,194 INFO L290 TraceCheckUtils]: 57: Hoare triple {5156#true} assume !(0 == ~cond); {5156#true} is VALID [2022-04-08 04:35:52,194 INFO L290 TraceCheckUtils]: 58: Hoare triple {5156#true} assume true; {5156#true} is VALID [2022-04-08 04:35:52,194 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {5156#true} {5326#(and (= main_~y~0 6) (= 4 (+ (- 2) main_~c~0)))} #54#return; {5326#(and (= main_~y~0 6) (= 4 (+ (- 2) main_~c~0)))} is VALID [2022-04-08 04:35:52,195 INFO L290 TraceCheckUtils]: 60: Hoare triple {5326#(and (= main_~y~0 6) (= 4 (+ (- 2) main_~c~0)))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {5348#(and (= 7 main_~c~0) (= 6 (+ (- 1) main_~y~0)))} is VALID [2022-04-08 04:35:52,196 INFO L290 TraceCheckUtils]: 61: Hoare triple {5348#(and (= 7 main_~c~0) (= 6 (+ (- 1) main_~y~0)))} assume !false; {5348#(and (= 7 main_~c~0) (= 6 (+ (- 1) main_~y~0)))} is VALID [2022-04-08 04:35:52,196 INFO L272 TraceCheckUtils]: 62: Hoare triple {5348#(and (= 7 main_~c~0) (= 6 (+ (- 1) main_~y~0)))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {5156#true} is VALID [2022-04-08 04:35:52,196 INFO L290 TraceCheckUtils]: 63: Hoare triple {5156#true} ~cond := #in~cond; {5156#true} is VALID [2022-04-08 04:35:52,196 INFO L290 TraceCheckUtils]: 64: Hoare triple {5156#true} assume !(0 == ~cond); {5156#true} is VALID [2022-04-08 04:35:52,196 INFO L290 TraceCheckUtils]: 65: Hoare triple {5156#true} assume true; {5156#true} is VALID [2022-04-08 04:35:52,196 INFO L284 TraceCheckUtils]: 66: Hoare quadruple {5156#true} {5348#(and (= 7 main_~c~0) (= 6 (+ (- 1) main_~y~0)))} #54#return; {5348#(and (= 7 main_~c~0) (= 6 (+ (- 1) main_~y~0)))} is VALID [2022-04-08 04:35:52,197 INFO L290 TraceCheckUtils]: 67: Hoare triple {5348#(and (= 7 main_~c~0) (= 6 (+ (- 1) main_~y~0)))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {5370#(and (= (+ (- 2) main_~y~0) 6) (= main_~c~0 8))} is VALID [2022-04-08 04:35:52,197 INFO L290 TraceCheckUtils]: 68: Hoare triple {5370#(and (= (+ (- 2) main_~y~0) 6) (= main_~c~0 8))} assume !false; {5370#(and (= (+ (- 2) main_~y~0) 6) (= main_~c~0 8))} is VALID [2022-04-08 04:35:52,197 INFO L272 TraceCheckUtils]: 69: Hoare triple {5370#(and (= (+ (- 2) main_~y~0) 6) (= main_~c~0 8))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {5156#true} is VALID [2022-04-08 04:35:52,198 INFO L290 TraceCheckUtils]: 70: Hoare triple {5156#true} ~cond := #in~cond; {5380#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-08 04:35:52,198 INFO L290 TraceCheckUtils]: 71: Hoare triple {5380#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {5384#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 04:35:52,198 INFO L290 TraceCheckUtils]: 72: Hoare triple {5384#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {5384#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 04:35:52,199 INFO L284 TraceCheckUtils]: 73: Hoare quadruple {5384#(not (= |__VERIFIER_assert_#in~cond| 0))} {5370#(and (= (+ (- 2) main_~y~0) 6) (= main_~c~0 8))} #54#return; {5391#(and (= (+ (- 2) main_~y~0) 6) (= main_~c~0 8) (= (+ (* 2 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (* 6 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (* 5 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0))) (+ (* main_~x~0 12) (* main_~y~0 main_~y~0))))} is VALID [2022-04-08 04:35:52,200 INFO L290 TraceCheckUtils]: 74: Hoare triple {5391#(and (= (+ (- 2) main_~y~0) 6) (= main_~c~0 8) (= (+ (* 2 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (* 6 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (* 5 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0))) (+ (* main_~x~0 12) (* main_~y~0 main_~y~0))))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {5395#(and (<= (+ (div (+ (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 (- 5)) (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0 6) (* (- 2) main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0) (* main_~y~0 main_~y~0)) (- 12)) (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) main_~x~0) (= main_~y~0 9) (< 8 main_~k~0) (<= main_~c~0 9))} is VALID [2022-04-08 04:35:52,200 INFO L290 TraceCheckUtils]: 75: Hoare triple {5395#(and (<= (+ (div (+ (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 (- 5)) (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0 6) (* (- 2) main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0) (* main_~y~0 main_~y~0)) (- 12)) (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) main_~x~0) (= main_~y~0 9) (< 8 main_~k~0) (<= main_~c~0 9))} assume !false; {5395#(and (<= (+ (div (+ (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 (- 5)) (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0 6) (* (- 2) main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0) (* main_~y~0 main_~y~0)) (- 12)) (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) main_~x~0) (= main_~y~0 9) (< 8 main_~k~0) (<= main_~c~0 9))} is VALID [2022-04-08 04:35:52,200 INFO L272 TraceCheckUtils]: 76: Hoare triple {5395#(and (<= (+ (div (+ (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 (- 5)) (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0 6) (* (- 2) main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0) (* main_~y~0 main_~y~0)) (- 12)) (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) main_~x~0) (= main_~y~0 9) (< 8 main_~k~0) (<= main_~c~0 9))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {5156#true} is VALID [2022-04-08 04:35:52,201 INFO L290 TraceCheckUtils]: 77: Hoare triple {5156#true} ~cond := #in~cond; {5380#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-08 04:35:52,201 INFO L290 TraceCheckUtils]: 78: Hoare triple {5380#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {5384#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 04:35:52,201 INFO L290 TraceCheckUtils]: 79: Hoare triple {5384#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {5384#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 04:35:52,202 INFO L284 TraceCheckUtils]: 80: Hoare quadruple {5384#(not (= |__VERIFIER_assert_#in~cond| 0))} {5395#(and (<= (+ (div (+ (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 (- 5)) (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0 6) (* (- 2) main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0) (* main_~y~0 main_~y~0)) (- 12)) (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) main_~x~0) (= main_~y~0 9) (< 8 main_~k~0) (<= main_~c~0 9))} #54#return; {5414#(and (= main_~y~0 9) (< 8 main_~k~0) (<= main_~c~0 9))} is VALID [2022-04-08 04:35:52,203 INFO L290 TraceCheckUtils]: 81: Hoare triple {5414#(and (= main_~y~0 9) (< 8 main_~k~0) (<= main_~c~0 9))} assume !(~c~0 < ~k~0); {5418#(and (= main_~y~0 9) (<= main_~k~0 9) (< 8 main_~k~0))} is VALID [2022-04-08 04:35:52,203 INFO L272 TraceCheckUtils]: 82: Hoare triple {5418#(and (= main_~y~0 9) (<= main_~k~0 9) (< 8 main_~k~0))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {5156#true} is VALID [2022-04-08 04:35:52,203 INFO L290 TraceCheckUtils]: 83: Hoare triple {5156#true} ~cond := #in~cond; {5156#true} is VALID [2022-04-08 04:35:52,203 INFO L290 TraceCheckUtils]: 84: Hoare triple {5156#true} assume !(0 == ~cond); {5156#true} is VALID [2022-04-08 04:35:52,203 INFO L290 TraceCheckUtils]: 85: Hoare triple {5156#true} assume true; {5156#true} is VALID [2022-04-08 04:35:52,204 INFO L284 TraceCheckUtils]: 86: Hoare quadruple {5156#true} {5418#(and (= main_~y~0 9) (<= main_~k~0 9) (< 8 main_~k~0))} #56#return; {5418#(and (= main_~y~0 9) (<= main_~k~0 9) (< 8 main_~k~0))} is VALID [2022-04-08 04:35:52,205 INFO L272 TraceCheckUtils]: 87: Hoare triple {5418#(and (= main_~y~0 9) (<= main_~k~0 9) (< 8 main_~k~0))} call __VERIFIER_assert((if ~k~0 * ~y~0 == ~y~0 * ~y~0 then 1 else 0)); {5437#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 04:35:52,205 INFO L290 TraceCheckUtils]: 88: Hoare triple {5437#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {5441#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 04:35:52,205 INFO L290 TraceCheckUtils]: 89: Hoare triple {5441#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {5157#false} is VALID [2022-04-08 04:35:52,205 INFO L290 TraceCheckUtils]: 90: Hoare triple {5157#false} assume !false; {5157#false} is VALID [2022-04-08 04:35:52,206 INFO L134 CoverageAnalysis]: Checked inductivity of 377 backedges. 68 proven. 143 refuted. 0 times theorem prover too weak. 166 trivial. 0 not checked. [2022-04-08 04:35:52,206 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 04:36:28,908 WARN L833 $PredicateComparison]: unable to prove that (or (not (= (mod (+ (* (- 2) c_main_~y~0 c_main_~y~0 c_main_~y~0 c_main_~y~0 c_main_~y~0 c_main_~y~0) (* (- 5) c_main_~y~0 c_main_~y~0 c_main_~y~0 c_main_~y~0) (* (- 6) c_main_~y~0 c_main_~y~0 c_main_~y~0 c_main_~y~0 c_main_~y~0) (* c_main_~y~0 c_main_~y~0)) 12) 0)) (forall ((main_~k~0 Int)) (or (< (+ c_main_~c~0 1) main_~k~0) (not (< c_main_~c~0 main_~k~0)) (let ((.cse0 (+ c_main_~y~0 1))) (= (* .cse0 .cse0) (* main_~k~0 .cse0)))))) is different from false [2022-04-08 04:36:28,910 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 04:36:28,911 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [510673544] [2022-04-08 04:36:28,911 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 04:36:28,911 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1052055383] [2022-04-08 04:36:28,911 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1052055383] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 04:36:28,911 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-08 04:36:28,911 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2022-04-08 04:36:28,911 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 04:36:28,911 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1719652911] [2022-04-08 04:36:28,911 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1719652911] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 04:36:28,911 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 04:36:28,911 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2022-04-08 04:36:28,911 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2141907213] [2022-04-08 04:36:28,911 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 04:36:28,912 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 18 states have (on average 2.0) internal successors, (36), 16 states have internal predecessors, (36), 12 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (13), 12 states have call predecessors, (13), 12 states have call successors, (13) Word has length 91 [2022-04-08 04:36:28,912 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 04:36:28,912 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 19 states, 18 states have (on average 2.0) internal successors, (36), 16 states have internal predecessors, (36), 12 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (13), 12 states have call predecessors, (13), 12 states have call successors, (13) [2022-04-08 04:36:28,965 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 04:36:28,965 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-04-08 04:36:28,965 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 04:36:28,965 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-04-08 04:36:28,966 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=476, Unknown=4, NotChecked=44, Total=600 [2022-04-08 04:36:28,966 INFO L87 Difference]: Start difference. First operand 60 states and 68 transitions. Second operand has 19 states, 18 states have (on average 2.0) internal successors, (36), 16 states have internal predecessors, (36), 12 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (13), 12 states have call predecessors, (13), 12 states have call successors, (13) [2022-04-08 04:36:30,732 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 04:36:30,732 INFO L93 Difference]: Finished difference Result 69 states and 79 transitions. [2022-04-08 04:36:30,733 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-04-08 04:36:30,733 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 18 states have (on average 2.0) internal successors, (36), 16 states have internal predecessors, (36), 12 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (13), 12 states have call predecessors, (13), 12 states have call successors, (13) Word has length 91 [2022-04-08 04:36:30,733 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 04:36:30,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 18 states have (on average 2.0) internal successors, (36), 16 states have internal predecessors, (36), 12 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (13), 12 states have call predecessors, (13), 12 states have call successors, (13) [2022-04-08 04:36:30,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 72 transitions. [2022-04-08 04:36:30,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 18 states have (on average 2.0) internal successors, (36), 16 states have internal predecessors, (36), 12 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (13), 12 states have call predecessors, (13), 12 states have call successors, (13) [2022-04-08 04:36:30,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 72 transitions. [2022-04-08 04:36:30,735 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 18 states and 72 transitions. [2022-04-08 04:36:30,815 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 72 edges. 72 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 04:36:30,816 INFO L225 Difference]: With dead ends: 69 [2022-04-08 04:36:30,816 INFO L226 Difference]: Without dead ends: 63 [2022-04-08 04:36:30,816 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 84 SyntacticMatches, 1 SemanticMatches, 26 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 18.0s TimeCoverageRelationStatistics Valid=97, Invalid=605, Unknown=4, NotChecked=50, Total=756 [2022-04-08 04:36:30,817 INFO L913 BasicCegarLoop]: 37 mSDtfsCounter, 7 mSDsluCounter, 378 mSDsCounter, 0 mSdLazyCounter, 689 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 415 SdHoareTripleChecker+Invalid, 692 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 689 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-04-08 04:36:30,817 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [9 Valid, 415 Invalid, 692 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 689 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-04-08 04:36:30,817 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2022-04-08 04:36:30,868 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2022-04-08 04:36:30,868 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 04:36:30,868 INFO L82 GeneralOperation]: Start isEquivalent. First operand 63 states. Second operand has 63 states, 41 states have (on average 1.024390243902439) internal successors, (42), 41 states have internal predecessors, (42), 16 states have call successors, (16), 7 states have call predecessors, (16), 5 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2022-04-08 04:36:30,868 INFO L74 IsIncluded]: Start isIncluded. First operand 63 states. Second operand has 63 states, 41 states have (on average 1.024390243902439) internal successors, (42), 41 states have internal predecessors, (42), 16 states have call successors, (16), 7 states have call predecessors, (16), 5 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2022-04-08 04:36:30,869 INFO L87 Difference]: Start difference. First operand 63 states. Second operand has 63 states, 41 states have (on average 1.024390243902439) internal successors, (42), 41 states have internal predecessors, (42), 16 states have call successors, (16), 7 states have call predecessors, (16), 5 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2022-04-08 04:36:30,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 04:36:30,871 INFO L93 Difference]: Finished difference Result 63 states and 72 transitions. [2022-04-08 04:36:30,871 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 72 transitions. [2022-04-08 04:36:30,871 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 04:36:30,871 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 04:36:30,871 INFO L74 IsIncluded]: Start isIncluded. First operand has 63 states, 41 states have (on average 1.024390243902439) internal successors, (42), 41 states have internal predecessors, (42), 16 states have call successors, (16), 7 states have call predecessors, (16), 5 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) Second operand 63 states. [2022-04-08 04:36:30,871 INFO L87 Difference]: Start difference. First operand has 63 states, 41 states have (on average 1.024390243902439) internal successors, (42), 41 states have internal predecessors, (42), 16 states have call successors, (16), 7 states have call predecessors, (16), 5 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) Second operand 63 states. [2022-04-08 04:36:30,873 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 04:36:30,873 INFO L93 Difference]: Finished difference Result 63 states and 72 transitions. [2022-04-08 04:36:30,873 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 72 transitions. [2022-04-08 04:36:30,874 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 04:36:30,874 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 04:36:30,874 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 04:36:30,874 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 04:36:30,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 41 states have (on average 1.024390243902439) internal successors, (42), 41 states have internal predecessors, (42), 16 states have call successors, (16), 7 states have call predecessors, (16), 5 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2022-04-08 04:36:30,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 72 transitions. [2022-04-08 04:36:30,876 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 72 transitions. Word has length 91 [2022-04-08 04:36:30,876 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 04:36:30,876 INFO L478 AbstractCegarLoop]: Abstraction has 63 states and 72 transitions. [2022-04-08 04:36:30,876 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 18 states have (on average 2.0) internal successors, (36), 16 states have internal predecessors, (36), 12 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (13), 12 states have call predecessors, (13), 12 states have call successors, (13) [2022-04-08 04:36:30,876 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 63 states and 72 transitions. [2022-04-08 04:36:31,062 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 72 edges. 72 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 04:36:31,062 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 72 transitions. [2022-04-08 04:36:31,063 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2022-04-08 04:36:31,063 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 04:36:31,063 INFO L499 BasicCegarLoop]: trace histogram [13, 12, 12, 11, 11, 11, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 04:36:31,070 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2022-04-08 04:36:31,267 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 04:36:31,268 INFO L403 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 04:36:31,268 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 04:36:31,268 INFO L85 PathProgramCache]: Analyzing trace with hash -107207904, now seen corresponding path program 19 times [2022-04-08 04:36:31,268 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 04:36:31,268 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [187685206] [2022-04-08 04:36:31,365 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 3 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-08 04:36:31,366 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONLINEAR_UPDATE [2022-04-08 04:36:31,366 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 04:36:31,366 INFO L85 PathProgramCache]: Analyzing trace with hash -107207904, now seen corresponding path program 20 times [2022-04-08 04:36:31,366 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 04:36:31,366 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [290678835] [2022-04-08 04:36:31,366 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 04:36:31,366 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 04:36:31,378 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 04:36:31,379 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [764173666] [2022-04-08 04:36:31,379 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 04:36:31,379 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 04:36:31,379 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 04:36:31,380 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 04:36:31,389 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process