/usr/bin/java -ea -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data --core.log.level.for.class de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationQvasr_64.epf -i ../../../trunk/examples/svcomp/nla-digbench-scaling/ps5-ll_valuebound10.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-34549b5 [2022-04-08 14:23:02,511 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-08 14:23:02,513 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-08 14:23:02,553 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-08 14:23:02,554 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-08 14:23:02,555 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-08 14:23:02,558 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-08 14:23:02,563 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-08 14:23:02,565 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-08 14:23:02,570 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-08 14:23:02,571 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-08 14:23:02,572 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-08 14:23:02,573 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-08 14:23:02,575 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-08 14:23:02,576 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-08 14:23:02,579 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-08 14:23:02,580 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-08 14:23:02,580 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-08 14:23:02,583 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-08 14:23:02,587 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-08 14:23:02,589 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-08 14:23:02,591 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-08 14:23:02,591 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-08 14:23:02,592 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-08 14:23:02,594 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-08 14:23:02,596 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-08 14:23:02,596 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-08 14:23:02,596 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-08 14:23:02,597 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-08 14:23:02,597 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-08 14:23:02,598 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-08 14:23:02,598 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-08 14:23:02,600 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-08 14:23:02,601 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-08 14:23:02,601 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-08 14:23:02,602 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-08 14:23:02,602 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-08 14:23:02,603 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-08 14:23:02,603 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-08 14:23:02,603 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-08 14:23:02,604 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-08 14:23:02,605 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-08 14:23:02,606 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationQvasr_64.epf [2022-04-08 14:23:02,618 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-08 14:23:02,618 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-08 14:23:02,619 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-08 14:23:02,620 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-08 14:23:02,620 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-08 14:23:02,620 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-08 14:23:02,620 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-08 14:23:02,620 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-08 14:23:02,620 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-08 14:23:02,621 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-08 14:23:02,621 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-08 14:23:02,622 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-08 14:23:02,622 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-08 14:23:02,622 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-08 14:23:02,622 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-08 14:23:02,622 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-08 14:23:02,622 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-08 14:23:02,622 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-04-08 14:23:02,622 INFO L138 SettingsManager]: * Trace refinement strategy=ACCELERATED_INTERPOLATION [2022-04-08 14:23:02,622 INFO L138 SettingsManager]: * Trace refinement strategy used in Accelerated Interpolation=CAMEL [2022-04-08 14:23:02,623 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-08 14:23:02,623 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=QVASR [2022-04-08 14:23:02,623 INFO L138 SettingsManager]: * Use separate solver for trace checks=false WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.core: Log level for class -> de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN; [2022-04-08 14:23:02,890 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-08 14:23:02,922 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-08 14:23:02,924 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-08 14:23:02,925 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-08 14:23:02,926 INFO L275 PluginConnector]: CDTParser initialized [2022-04-08 14:23:02,927 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/nla-digbench-scaling/ps5-ll_valuebound10.c [2022-04-08 14:23:02,987 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/85aaca288/25e2704575294820b3a6e0fc3d8e32bf/FLAG56d3ad1d5 [2022-04-08 14:23:03,432 INFO L306 CDTParser]: Found 1 translation units. [2022-04-08 14:23:03,432 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/ps5-ll_valuebound10.c [2022-04-08 14:23:03,440 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/85aaca288/25e2704575294820b3a6e0fc3d8e32bf/FLAG56d3ad1d5 [2022-04-08 14:23:03,457 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/85aaca288/25e2704575294820b3a6e0fc3d8e32bf [2022-04-08 14:23:03,459 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-08 14:23:03,460 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-08 14:23:03,462 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-08 14:23:03,462 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-08 14:23:03,465 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-08 14:23:03,466 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.04 02:23:03" (1/1) ... [2022-04-08 14:23:03,467 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@e855ef6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 02:23:03, skipping insertion in model container [2022-04-08 14:23:03,467 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.04 02:23:03" (1/1) ... [2022-04-08 14:23:03,473 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-08 14:23:03,485 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-08 14:23:03,618 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/ps5-ll_valuebound10.c[458,471] [2022-04-08 14:23:03,636 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-08 14:23:03,644 INFO L203 MainTranslator]: Completed pre-run [2022-04-08 14:23:03,654 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/ps5-ll_valuebound10.c[458,471] [2022-04-08 14:23:03,662 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-08 14:23:03,674 INFO L208 MainTranslator]: Completed translation [2022-04-08 14:23:03,675 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 02:23:03 WrapperNode [2022-04-08 14:23:03,675 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-08 14:23:03,676 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-08 14:23:03,676 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-08 14:23:03,676 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-08 14:23:03,686 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 02:23:03" (1/1) ... [2022-04-08 14:23:03,686 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 02:23:03" (1/1) ... [2022-04-08 14:23:03,693 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 02:23:03" (1/1) ... [2022-04-08 14:23:03,693 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 02:23:03" (1/1) ... [2022-04-08 14:23:03,707 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 02:23:03" (1/1) ... [2022-04-08 14:23:03,713 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 02:23:03" (1/1) ... [2022-04-08 14:23:03,714 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 02:23:03" (1/1) ... [2022-04-08 14:23:03,716 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-08 14:23:03,716 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-08 14:23:03,716 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-08 14:23:03,717 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-08 14:23:03,719 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 02:23:03" (1/1) ... [2022-04-08 14:23:03,724 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-08 14:23:03,734 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 14:23:03,749 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-04-08 14:23:03,774 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-04-08 14:23:03,801 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-08 14:23:03,801 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-08 14:23:03,801 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-08 14:23:03,802 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-08 14:23:03,802 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-08 14:23:03,803 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-08 14:23:03,803 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-08 14:23:03,803 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-08 14:23:03,803 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-08 14:23:03,803 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-08 14:23:03,803 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_short [2022-04-08 14:23:03,803 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-08 14:23:03,804 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-08 14:23:03,804 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-08 14:23:03,804 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-08 14:23:03,805 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-08 14:23:03,805 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-08 14:23:03,805 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-08 14:23:03,805 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-08 14:23:03,805 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-08 14:23:03,868 INFO L234 CfgBuilder]: Building ICFG [2022-04-08 14:23:03,870 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-08 14:23:03,992 INFO L275 CfgBuilder]: Performing block encoding [2022-04-08 14:23:03,999 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-08 14:23:03,999 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-08 14:23:04,000 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.04 02:23:04 BoogieIcfgContainer [2022-04-08 14:23:04,001 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-08 14:23:04,002 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-08 14:23:04,002 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-08 14:23:04,005 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-08 14:23:04,006 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.04 02:23:03" (1/3) ... [2022-04-08 14:23:04,006 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@226a8aee and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.04 02:23:04, skipping insertion in model container [2022-04-08 14:23:04,006 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 02:23:03" (2/3) ... [2022-04-08 14:23:04,007 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@226a8aee and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.04 02:23:04, skipping insertion in model container [2022-04-08 14:23:04,007 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.04 02:23:04" (3/3) ... [2022-04-08 14:23:04,008 INFO L111 eAbstractionObserver]: Analyzing ICFG ps5-ll_valuebound10.c [2022-04-08 14:23:04,012 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-04-08 14:23:04,013 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-08 14:23:04,062 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-08 14:23:04,078 INFO L340 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=Craig_NestedInterpolation, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP [2022-04-08 14:23:04,078 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-08 14:23:04,110 INFO L276 IsEmpty]: Start isEmpty. Operand has 29 states, 16 states have (on average 1.375) internal successors, (22), 17 states have internal predecessors, (22), 7 states have call successors, (7), 4 states have call predecessors, (7), 4 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-08 14:23:04,116 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-04-08 14:23:04,117 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 14:23:04,117 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 14:23:04,118 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 14:23:04,122 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 14:23:04,122 INFO L85 PathProgramCache]: Analyzing trace with hash 1098891495, now seen corresponding path program 1 times [2022-04-08 14:23:04,129 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 14:23:04,130 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1931544299] [2022-04-08 14:23:04,141 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 14:23:04,142 INFO L85 PathProgramCache]: Analyzing trace with hash 1098891495, now seen corresponding path program 2 times [2022-04-08 14:23:04,145 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 14:23:04,145 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1538523385] [2022-04-08 14:23:04,145 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 14:23:04,146 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 14:23:04,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 14:23:04,344 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 14:23:04,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 14:23:04,363 INFO L290 TraceCheckUtils]: 0: Hoare triple {45#(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); {32#true} is VALID [2022-04-08 14:23:04,364 INFO L290 TraceCheckUtils]: 1: Hoare triple {32#true} assume true; {32#true} is VALID [2022-04-08 14:23:04,364 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {32#true} {32#true} #63#return; {32#true} is VALID [2022-04-08 14:23:04,365 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-08 14:23:04,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 14:23:04,377 INFO L290 TraceCheckUtils]: 0: Hoare triple {32#true} ~cond := #in~cond; {32#true} is VALID [2022-04-08 14:23:04,378 INFO L290 TraceCheckUtils]: 1: Hoare triple {32#true} assume 0 == ~cond;assume false; {33#false} is VALID [2022-04-08 14:23:04,378 INFO L290 TraceCheckUtils]: 2: Hoare triple {33#false} assume true; {33#false} is VALID [2022-04-08 14:23:04,378 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {33#false} {32#true} #53#return; {33#false} is VALID [2022-04-08 14:23:04,379 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-04-08 14:23:04,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 14:23:04,391 INFO L290 TraceCheckUtils]: 0: Hoare triple {32#true} ~cond := #in~cond; {32#true} is VALID [2022-04-08 14:23:04,391 INFO L290 TraceCheckUtils]: 1: Hoare triple {32#true} assume 0 == ~cond;assume false; {33#false} is VALID [2022-04-08 14:23:04,391 INFO L290 TraceCheckUtils]: 2: Hoare triple {33#false} assume true; {33#false} is VALID [2022-04-08 14:23:04,392 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {33#false} {33#false} #55#return; {33#false} is VALID [2022-04-08 14:23:04,394 INFO L272 TraceCheckUtils]: 0: Hoare triple {32#true} call ULTIMATE.init(); {45#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 14:23:04,394 INFO L290 TraceCheckUtils]: 1: Hoare triple {45#(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); {32#true} is VALID [2022-04-08 14:23:04,394 INFO L290 TraceCheckUtils]: 2: Hoare triple {32#true} assume true; {32#true} is VALID [2022-04-08 14:23:04,394 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {32#true} {32#true} #63#return; {32#true} is VALID [2022-04-08 14:23:04,395 INFO L272 TraceCheckUtils]: 4: Hoare triple {32#true} call #t~ret5 := main(); {32#true} is VALID [2022-04-08 14:23:04,395 INFO L290 TraceCheckUtils]: 5: Hoare triple {32#true} havoc ~k~0;havoc ~y~0;havoc ~x~0;havoc ~c~0;assume -32768 <= #t~nondet4 && #t~nondet4 <= 32767;~k~0 := #t~nondet4;havoc #t~nondet4; {32#true} is VALID [2022-04-08 14:23:04,395 INFO L272 TraceCheckUtils]: 6: Hoare triple {32#true} call assume_abort_if_not((if ~k~0 >= 0 && ~k~0 <= 10 then 1 else 0)); {32#true} is VALID [2022-04-08 14:23:04,395 INFO L290 TraceCheckUtils]: 7: Hoare triple {32#true} ~cond := #in~cond; {32#true} is VALID [2022-04-08 14:23:04,397 INFO L290 TraceCheckUtils]: 8: Hoare triple {32#true} assume 0 == ~cond;assume false; {33#false} is VALID [2022-04-08 14:23:04,397 INFO L290 TraceCheckUtils]: 9: Hoare triple {33#false} assume true; {33#false} is VALID [2022-04-08 14:23:04,398 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {33#false} {32#true} #53#return; {33#false} is VALID [2022-04-08 14:23:04,398 INFO L272 TraceCheckUtils]: 11: Hoare triple {33#false} call assume_abort_if_not((if ~k~0 <= 256 then 1 else 0)); {32#true} is VALID [2022-04-08 14:23:04,398 INFO L290 TraceCheckUtils]: 12: Hoare triple {32#true} ~cond := #in~cond; {32#true} is VALID [2022-04-08 14:23:04,399 INFO L290 TraceCheckUtils]: 13: Hoare triple {32#true} assume 0 == ~cond;assume false; {33#false} is VALID [2022-04-08 14:23:04,399 INFO L290 TraceCheckUtils]: 14: Hoare triple {33#false} assume true; {33#false} is VALID [2022-04-08 14:23:04,399 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {33#false} {33#false} #55#return; {33#false} is VALID [2022-04-08 14:23:04,399 INFO L290 TraceCheckUtils]: 16: Hoare triple {33#false} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {33#false} is VALID [2022-04-08 14:23:04,400 INFO L290 TraceCheckUtils]: 17: Hoare triple {33#false} assume false; {33#false} is VALID [2022-04-08 14:23:04,400 INFO L272 TraceCheckUtils]: 18: Hoare triple {33#false} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {33#false} is VALID [2022-04-08 14:23:04,400 INFO L290 TraceCheckUtils]: 19: Hoare triple {33#false} ~cond := #in~cond; {33#false} is VALID [2022-04-08 14:23:04,400 INFO L290 TraceCheckUtils]: 20: Hoare triple {33#false} assume 0 == ~cond; {33#false} is VALID [2022-04-08 14:23:04,401 INFO L290 TraceCheckUtils]: 21: Hoare triple {33#false} assume !false; {33#false} is VALID [2022-04-08 14:23:04,401 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-08 14:23:04,402 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 14:23:04,402 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1538523385] [2022-04-08 14:23:04,404 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1538523385] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 14:23:04,404 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 14:23:04,404 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-08 14:23:04,407 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 14:23:04,407 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1931544299] [2022-04-08 14:23:04,407 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1931544299] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 14:23:04,407 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 14:23:04,408 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-08 14:23:04,408 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [925852081] [2022-04-08 14:23:04,408 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 14:23:04,413 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, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 22 [2022-04-08 14:23:04,415 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 14:23:04,421 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, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-08 14:23:04,459 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 19 edges. 19 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 14:23:04,459 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-08 14:23:04,459 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 14:23:04,477 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-08 14:23:04,478 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-08 14:23:04,480 INFO L87 Difference]: Start difference. First operand has 29 states, 16 states have (on average 1.375) internal successors, (22), 17 states have internal predecessors, (22), 7 states have call successors, (7), 4 states have call predecessors, (7), 4 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) 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, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-08 14:23:04,656 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:23:04,657 INFO L93 Difference]: Finished difference Result 51 states and 69 transitions. [2022-04-08 14:23:04,657 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-08 14:23:04,657 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, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 22 [2022-04-08 14:23:04,658 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 14:23:04,659 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, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-08 14:23:04,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 69 transitions. [2022-04-08 14:23:04,678 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, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-08 14:23:04,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 69 transitions. [2022-04-08 14:23:04,686 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 69 transitions. [2022-04-08 14:23:04,775 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 69 edges. 69 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 14:23:04,785 INFO L225 Difference]: With dead ends: 51 [2022-04-08 14:23:04,785 INFO L226 Difference]: Without dead ends: 24 [2022-04-08 14:23:04,787 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-08 14:23:04,793 INFO L913 BasicCegarLoop]: 27 mSDtfsCounter, 15 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 30 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-08 14:23:04,795 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [20 Valid, 30 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-08 14:23:04,809 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2022-04-08 14:23:04,834 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2022-04-08 14:23:04,834 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 14:23:04,835 INFO L82 GeneralOperation]: Start isEquivalent. First operand 24 states. Second operand has 24 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 14 states have internal predecessors, (15), 7 states have call successors, (7), 4 states have call predecessors, (7), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-08 14:23:04,837 INFO L74 IsIncluded]: Start isIncluded. First operand 24 states. Second operand has 24 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 14 states have internal predecessors, (15), 7 states have call successors, (7), 4 states have call predecessors, (7), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-08 14:23:04,837 INFO L87 Difference]: Start difference. First operand 24 states. Second operand has 24 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 14 states have internal predecessors, (15), 7 states have call successors, (7), 4 states have call predecessors, (7), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-08 14:23:04,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:23:04,848 INFO L93 Difference]: Finished difference Result 24 states and 27 transitions. [2022-04-08 14:23:04,848 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 27 transitions. [2022-04-08 14:23:04,849 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 14:23:04,849 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 14:23:04,849 INFO L74 IsIncluded]: Start isIncluded. First operand has 24 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 14 states have internal predecessors, (15), 7 states have call successors, (7), 4 states have call predecessors, (7), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand 24 states. [2022-04-08 14:23:04,850 INFO L87 Difference]: Start difference. First operand has 24 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 14 states have internal predecessors, (15), 7 states have call successors, (7), 4 states have call predecessors, (7), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand 24 states. [2022-04-08 14:23:04,852 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:23:04,852 INFO L93 Difference]: Finished difference Result 24 states and 27 transitions. [2022-04-08 14:23:04,852 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 27 transitions. [2022-04-08 14:23:04,853 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 14:23:04,853 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 14:23:04,853 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 14:23:04,853 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 14:23:04,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 14 states have internal predecessors, (15), 7 states have call successors, (7), 4 states have call predecessors, (7), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-08 14:23:04,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 27 transitions. [2022-04-08 14:23:04,856 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 27 transitions. Word has length 22 [2022-04-08 14:23:04,857 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 14:23:04,857 INFO L478 AbstractCegarLoop]: Abstraction has 24 states and 27 transitions. [2022-04-08 14:23:04,857 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, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-08 14:23:04,857 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 24 states and 27 transitions. [2022-04-08 14:23:04,893 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 27 edges. 27 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 14:23:04,893 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 27 transitions. [2022-04-08 14:23:04,894 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-04-08 14:23:04,895 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 14:23:04,895 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 14:23:04,895 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-08 14:23:04,895 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 14:23:04,897 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 14:23:04,898 INFO L85 PathProgramCache]: Analyzing trace with hash 769620075, now seen corresponding path program 1 times [2022-04-08 14:23:04,898 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 14:23:04,898 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [560678080] [2022-04-08 14:23:04,902 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 14:23:04,902 INFO L85 PathProgramCache]: Analyzing trace with hash 769620075, now seen corresponding path program 2 times [2022-04-08 14:23:04,902 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 14:23:04,902 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [460413848] [2022-04-08 14:23:04,903 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 14:23:04,903 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 14:23:04,940 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 14:23:04,940 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1192412457] [2022-04-08 14:23:04,941 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 14:23:04,941 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 14:23:04,941 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 14:23:04,948 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 14:23:04,997 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-04-08 14:23:05,015 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-04-08 14:23:05,015 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 14:23:05,017 INFO L263 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-08 14:23:05,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 14:23:05,038 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 14:23:05,189 INFO L272 TraceCheckUtils]: 0: Hoare triple {246#true} call ULTIMATE.init(); {246#true} is VALID [2022-04-08 14:23:05,189 INFO L290 TraceCheckUtils]: 1: Hoare triple {246#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); {246#true} is VALID [2022-04-08 14:23:05,189 INFO L290 TraceCheckUtils]: 2: Hoare triple {246#true} assume true; {246#true} is VALID [2022-04-08 14:23:05,190 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {246#true} {246#true} #63#return; {246#true} is VALID [2022-04-08 14:23:05,190 INFO L272 TraceCheckUtils]: 4: Hoare triple {246#true} call #t~ret5 := main(); {246#true} is VALID [2022-04-08 14:23:05,190 INFO L290 TraceCheckUtils]: 5: Hoare triple {246#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; {246#true} is VALID [2022-04-08 14:23:05,190 INFO L272 TraceCheckUtils]: 6: Hoare triple {246#true} call assume_abort_if_not((if ~k~0 >= 0 && ~k~0 <= 10 then 1 else 0)); {246#true} is VALID [2022-04-08 14:23:05,191 INFO L290 TraceCheckUtils]: 7: Hoare triple {246#true} ~cond := #in~cond; {246#true} is VALID [2022-04-08 14:23:05,191 INFO L290 TraceCheckUtils]: 8: Hoare triple {246#true} assume !(0 == ~cond); {246#true} is VALID [2022-04-08 14:23:05,191 INFO L290 TraceCheckUtils]: 9: Hoare triple {246#true} assume true; {246#true} is VALID [2022-04-08 14:23:05,191 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {246#true} {246#true} #53#return; {246#true} is VALID [2022-04-08 14:23:05,192 INFO L272 TraceCheckUtils]: 11: Hoare triple {246#true} call assume_abort_if_not((if ~k~0 <= 256 then 1 else 0)); {246#true} is VALID [2022-04-08 14:23:05,192 INFO L290 TraceCheckUtils]: 12: Hoare triple {246#true} ~cond := #in~cond; {246#true} is VALID [2022-04-08 14:23:05,192 INFO L290 TraceCheckUtils]: 13: Hoare triple {246#true} assume !(0 == ~cond); {246#true} is VALID [2022-04-08 14:23:05,192 INFO L290 TraceCheckUtils]: 14: Hoare triple {246#true} assume true; {246#true} is VALID [2022-04-08 14:23:05,193 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {246#true} {246#true} #55#return; {246#true} is VALID [2022-04-08 14:23:05,194 INFO L290 TraceCheckUtils]: 16: Hoare triple {246#true} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {299#(and (= main_~x~0 0) (= main_~y~0 0))} is VALID [2022-04-08 14:23:05,194 INFO L290 TraceCheckUtils]: 17: Hoare triple {299#(and (= main_~x~0 0) (= main_~y~0 0))} assume !false; {299#(and (= main_~x~0 0) (= main_~y~0 0))} is VALID [2022-04-08 14:23:05,195 INFO L272 TraceCheckUtils]: 18: Hoare triple {299#(and (= main_~x~0 0) (= main_~y~0 0))} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {306#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 14:23:05,196 INFO L290 TraceCheckUtils]: 19: Hoare triple {306#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {310#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 14:23:05,197 INFO L290 TraceCheckUtils]: 20: Hoare triple {310#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {247#false} is VALID [2022-04-08 14:23:05,197 INFO L290 TraceCheckUtils]: 21: Hoare triple {247#false} assume !false; {247#false} is VALID [2022-04-08 14:23:05,197 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-08 14:23:05,197 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-08 14:23:05,198 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 14:23:05,198 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [460413848] [2022-04-08 14:23:05,198 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 14:23:05,198 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1192412457] [2022-04-08 14:23:05,199 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1192412457] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 14:23:05,199 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 14:23:05,199 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 14:23:05,200 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 14:23:05,200 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [560678080] [2022-04-08 14:23:05,200 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [560678080] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 14:23:05,201 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 14:23:05,201 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 14:23:05,201 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1234338970] [2022-04-08 14:23:05,201 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 14:23:05,202 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, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 22 [2022-04-08 14:23:05,202 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 14:23:05,202 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, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-08 14:23:05,236 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 19 edges. 19 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 14:23:05,237 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-08 14:23:05,237 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 14:23:05,238 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-08 14:23:05,238 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-08 14:23:05,239 INFO L87 Difference]: Start difference. First operand 24 states and 27 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, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-08 14:23:05,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:23:05,397 INFO L93 Difference]: Finished difference Result 35 states and 40 transitions. [2022-04-08 14:23:05,397 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-08 14:23:05,398 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, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 22 [2022-04-08 14:23:05,398 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 14:23:05,400 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, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-08 14:23:05,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 40 transitions. [2022-04-08 14:23:05,403 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, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-08 14:23:05,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 40 transitions. [2022-04-08 14:23:05,406 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 40 transitions. [2022-04-08 14:23:05,444 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 40 edges. 40 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 14:23:05,448 INFO L225 Difference]: With dead ends: 35 [2022-04-08 14:23:05,448 INFO L226 Difference]: Without dead ends: 31 [2022-04-08 14:23:05,448 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-08 14:23:05,450 INFO L913 BasicCegarLoop]: 24 mSDtfsCounter, 6 mSDsluCounter, 61 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 85 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-08 14:23:05,450 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [8 Valid, 85 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-08 14:23:05,451 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2022-04-08 14:23:05,463 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2022-04-08 14:23:05,463 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 14:23:05,464 INFO L82 GeneralOperation]: Start isEquivalent. First operand 31 states. Second operand has 31 states, 18 states have (on average 1.1111111111111112) internal successors, (20), 19 states have internal predecessors, (20), 8 states have call successors, (8), 5 states have call predecessors, (8), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-08 14:23:05,464 INFO L74 IsIncluded]: Start isIncluded. First operand 31 states. Second operand has 31 states, 18 states have (on average 1.1111111111111112) internal successors, (20), 19 states have internal predecessors, (20), 8 states have call successors, (8), 5 states have call predecessors, (8), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-08 14:23:05,465 INFO L87 Difference]: Start difference. First operand 31 states. Second operand has 31 states, 18 states have (on average 1.1111111111111112) internal successors, (20), 19 states have internal predecessors, (20), 8 states have call successors, (8), 5 states have call predecessors, (8), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-08 14:23:05,467 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:23:05,467 INFO L93 Difference]: Finished difference Result 31 states and 34 transitions. [2022-04-08 14:23:05,467 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 34 transitions. [2022-04-08 14:23:05,468 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 14:23:05,468 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 14:23:05,468 INFO L74 IsIncluded]: Start isIncluded. First operand has 31 states, 18 states have (on average 1.1111111111111112) internal successors, (20), 19 states have internal predecessors, (20), 8 states have call successors, (8), 5 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 31 states. [2022-04-08 14:23:05,469 INFO L87 Difference]: Start difference. First operand has 31 states, 18 states have (on average 1.1111111111111112) internal successors, (20), 19 states have internal predecessors, (20), 8 states have call successors, (8), 5 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 31 states. [2022-04-08 14:23:05,471 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:23:05,472 INFO L93 Difference]: Finished difference Result 31 states and 34 transitions. [2022-04-08 14:23:05,472 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 34 transitions. [2022-04-08 14:23:05,476 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 14:23:05,476 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 14:23:05,479 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 14:23:05,479 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 14:23:05,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 18 states have (on average 1.1111111111111112) internal successors, (20), 19 states have internal predecessors, (20), 8 states have call successors, (8), 5 states have call predecessors, (8), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-08 14:23:05,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 34 transitions. [2022-04-08 14:23:05,484 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 34 transitions. Word has length 22 [2022-04-08 14:23:05,484 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 14:23:05,484 INFO L478 AbstractCegarLoop]: Abstraction has 31 states and 34 transitions. [2022-04-08 14:23:05,485 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, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-08 14:23:05,485 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 31 states and 34 transitions. [2022-04-08 14:23:05,527 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 34 edges. 34 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 14:23:05,527 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 34 transitions. [2022-04-08 14:23:05,528 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-04-08 14:23:05,528 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 14:23:05,528 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 14:23:05,553 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-04-08 14:23:05,743 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 14:23:05,744 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 14:23:05,744 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 14:23:05,744 INFO L85 PathProgramCache]: Analyzing trace with hash 645812411, now seen corresponding path program 1 times [2022-04-08 14:23:05,745 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 14:23:05,745 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1521290144] [2022-04-08 14:23:05,745 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 14:23:05,745 INFO L85 PathProgramCache]: Analyzing trace with hash 645812411, now seen corresponding path program 2 times [2022-04-08 14:23:05,745 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 14:23:05,745 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1854235465] [2022-04-08 14:23:05,746 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 14:23:05,746 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 14:23:05,779 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 14:23:05,779 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2079005762] [2022-04-08 14:23:05,779 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 14:23:05,780 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 14:23:05,780 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 14:23:05,783 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 14:23:05,784 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-04-08 14:23:05,834 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 14:23:05,834 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 14:23:05,835 INFO L263 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 11 conjunts are in the unsatisfiable core [2022-04-08 14:23:05,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 14:23:05,853 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 14:23:06,011 INFO L272 TraceCheckUtils]: 0: Hoare triple {512#true} call ULTIMATE.init(); {512#true} is VALID [2022-04-08 14:23:06,012 INFO L290 TraceCheckUtils]: 1: Hoare triple {512#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); {512#true} is VALID [2022-04-08 14:23:06,012 INFO L290 TraceCheckUtils]: 2: Hoare triple {512#true} assume true; {512#true} is VALID [2022-04-08 14:23:06,012 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {512#true} {512#true} #63#return; {512#true} is VALID [2022-04-08 14:23:06,012 INFO L272 TraceCheckUtils]: 4: Hoare triple {512#true} call #t~ret5 := main(); {512#true} is VALID [2022-04-08 14:23:06,013 INFO L290 TraceCheckUtils]: 5: Hoare triple {512#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; {512#true} is VALID [2022-04-08 14:23:06,013 INFO L272 TraceCheckUtils]: 6: Hoare triple {512#true} call assume_abort_if_not((if ~k~0 >= 0 && ~k~0 <= 10 then 1 else 0)); {512#true} is VALID [2022-04-08 14:23:06,013 INFO L290 TraceCheckUtils]: 7: Hoare triple {512#true} ~cond := #in~cond; {512#true} is VALID [2022-04-08 14:23:06,013 INFO L290 TraceCheckUtils]: 8: Hoare triple {512#true} assume !(0 == ~cond); {512#true} is VALID [2022-04-08 14:23:06,013 INFO L290 TraceCheckUtils]: 9: Hoare triple {512#true} assume true; {512#true} is VALID [2022-04-08 14:23:06,013 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {512#true} {512#true} #53#return; {512#true} is VALID [2022-04-08 14:23:06,014 INFO L272 TraceCheckUtils]: 11: Hoare triple {512#true} call assume_abort_if_not((if ~k~0 <= 256 then 1 else 0)); {512#true} is VALID [2022-04-08 14:23:06,014 INFO L290 TraceCheckUtils]: 12: Hoare triple {512#true} ~cond := #in~cond; {512#true} is VALID [2022-04-08 14:23:06,014 INFO L290 TraceCheckUtils]: 13: Hoare triple {512#true} assume !(0 == ~cond); {512#true} is VALID [2022-04-08 14:23:06,014 INFO L290 TraceCheckUtils]: 14: Hoare triple {512#true} assume true; {512#true} is VALID [2022-04-08 14:23:06,014 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {512#true} {512#true} #55#return; {512#true} is VALID [2022-04-08 14:23:06,015 INFO L290 TraceCheckUtils]: 16: Hoare triple {512#true} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {565#(and (= main_~x~0 0) (= main_~y~0 0))} is VALID [2022-04-08 14:23:06,015 INFO L290 TraceCheckUtils]: 17: Hoare triple {565#(and (= main_~x~0 0) (= main_~y~0 0))} assume !false; {565#(and (= main_~x~0 0) (= main_~y~0 0))} is VALID [2022-04-08 14:23:06,016 INFO L272 TraceCheckUtils]: 18: Hoare triple {565#(and (= main_~x~0 0) (= main_~y~0 0))} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {512#true} is VALID [2022-04-08 14:23:06,016 INFO L290 TraceCheckUtils]: 19: Hoare triple {512#true} ~cond := #in~cond; {512#true} is VALID [2022-04-08 14:23:06,016 INFO L290 TraceCheckUtils]: 20: Hoare triple {512#true} assume !(0 == ~cond); {512#true} is VALID [2022-04-08 14:23:06,016 INFO L290 TraceCheckUtils]: 21: Hoare triple {512#true} assume true; {512#true} is VALID [2022-04-08 14:23:06,017 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {512#true} {565#(and (= main_~x~0 0) (= main_~y~0 0))} #57#return; {565#(and (= main_~x~0 0) (= main_~y~0 0))} is VALID [2022-04-08 14:23:06,018 INFO L290 TraceCheckUtils]: 23: Hoare triple {565#(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 + ~x~0; {587#(and (= (+ main_~x~0 (* (- 1) main_~y~0 main_~y~0 main_~y~0 main_~y~0)) 0) (= (+ (- 1) main_~y~0) 0))} is VALID [2022-04-08 14:23:06,018 INFO L290 TraceCheckUtils]: 24: Hoare triple {587#(and (= (+ main_~x~0 (* (- 1) main_~y~0 main_~y~0 main_~y~0 main_~y~0)) 0) (= (+ (- 1) main_~y~0) 0))} assume !false; {587#(and (= (+ main_~x~0 (* (- 1) main_~y~0 main_~y~0 main_~y~0 main_~y~0)) 0) (= (+ (- 1) main_~y~0) 0))} is VALID [2022-04-08 14:23:06,019 INFO L272 TraceCheckUtils]: 25: Hoare triple {587#(and (= (+ main_~x~0 (* (- 1) main_~y~0 main_~y~0 main_~y~0 main_~y~0)) 0) (= (+ (- 1) main_~y~0) 0))} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {594#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 14:23:06,020 INFO L290 TraceCheckUtils]: 26: Hoare triple {594#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {598#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 14:23:06,020 INFO L290 TraceCheckUtils]: 27: Hoare triple {598#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {513#false} is VALID [2022-04-08 14:23:06,020 INFO L290 TraceCheckUtils]: 28: Hoare triple {513#false} assume !false; {513#false} is VALID [2022-04-08 14:23:06,021 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-08 14:23:06,021 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 14:23:08,347 INFO L290 TraceCheckUtils]: 28: Hoare triple {513#false} assume !false; {513#false} is VALID [2022-04-08 14:23:08,347 INFO L290 TraceCheckUtils]: 27: Hoare triple {598#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {513#false} is VALID [2022-04-08 14:23:08,348 INFO L290 TraceCheckUtils]: 26: Hoare triple {594#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {598#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 14:23:08,349 INFO L272 TraceCheckUtils]: 25: Hoare triple {614#(= (+ main_~y~0 (* 30 main_~x~0)) (+ (* (* main_~y~0 main_~y~0 main_~y~0 main_~y~0) 15) (* 6 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (* (* main_~y~0 main_~y~0 main_~y~0) 10)))} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {594#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 14:23:08,350 INFO L290 TraceCheckUtils]: 24: Hoare triple {614#(= (+ main_~y~0 (* 30 main_~x~0)) (+ (* (* main_~y~0 main_~y~0 main_~y~0 main_~y~0) 15) (* 6 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (* (* main_~y~0 main_~y~0 main_~y~0) 10)))} assume !false; {614#(= (+ main_~y~0 (* 30 main_~x~0)) (+ (* (* main_~y~0 main_~y~0 main_~y~0 main_~y~0) 15) (* 6 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (* (* main_~y~0 main_~y~0 main_~y~0) 10)))} is VALID [2022-04-08 14:24:32,824 WARN L290 TraceCheckUtils]: 23: Hoare triple {614#(= (+ main_~y~0 (* 30 main_~x~0)) (+ (* (* main_~y~0 main_~y~0 main_~y~0 main_~y~0) 15) (* 6 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (* (* main_~y~0 main_~y~0 main_~y~0) 10)))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {614#(= (+ main_~y~0 (* 30 main_~x~0)) (+ (* (* main_~y~0 main_~y~0 main_~y~0 main_~y~0) 15) (* 6 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (* (* main_~y~0 main_~y~0 main_~y~0) 10)))} is UNKNOWN [2022-04-08 14:24:32,826 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {512#true} {614#(= (+ main_~y~0 (* 30 main_~x~0)) (+ (* (* main_~y~0 main_~y~0 main_~y~0 main_~y~0) 15) (* 6 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (* (* main_~y~0 main_~y~0 main_~y~0) 10)))} #57#return; {614#(= (+ main_~y~0 (* 30 main_~x~0)) (+ (* (* main_~y~0 main_~y~0 main_~y~0 main_~y~0) 15) (* 6 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (* (* main_~y~0 main_~y~0 main_~y~0) 10)))} is VALID [2022-04-08 14:24:32,826 INFO L290 TraceCheckUtils]: 21: Hoare triple {512#true} assume true; {512#true} is VALID [2022-04-08 14:24:32,826 INFO L290 TraceCheckUtils]: 20: Hoare triple {512#true} assume !(0 == ~cond); {512#true} is VALID [2022-04-08 14:24:32,826 INFO L290 TraceCheckUtils]: 19: Hoare triple {512#true} ~cond := #in~cond; {512#true} is VALID [2022-04-08 14:24:32,827 INFO L272 TraceCheckUtils]: 18: Hoare triple {614#(= (+ main_~y~0 (* 30 main_~x~0)) (+ (* (* main_~y~0 main_~y~0 main_~y~0 main_~y~0) 15) (* 6 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (* (* main_~y~0 main_~y~0 main_~y~0) 10)))} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {512#true} is VALID [2022-04-08 14:24:32,829 INFO L290 TraceCheckUtils]: 17: Hoare triple {614#(= (+ main_~y~0 (* 30 main_~x~0)) (+ (* (* main_~y~0 main_~y~0 main_~y~0 main_~y~0) 15) (* 6 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (* (* main_~y~0 main_~y~0 main_~y~0) 10)))} assume !false; {614#(= (+ main_~y~0 (* 30 main_~x~0)) (+ (* (* main_~y~0 main_~y~0 main_~y~0 main_~y~0) 15) (* 6 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (* (* main_~y~0 main_~y~0 main_~y~0) 10)))} is VALID [2022-04-08 14:24:32,830 INFO L290 TraceCheckUtils]: 16: Hoare triple {512#true} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {614#(= (+ main_~y~0 (* 30 main_~x~0)) (+ (* (* main_~y~0 main_~y~0 main_~y~0 main_~y~0) 15) (* 6 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (* (* main_~y~0 main_~y~0 main_~y~0) 10)))} is VALID [2022-04-08 14:24:32,830 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {512#true} {512#true} #55#return; {512#true} is VALID [2022-04-08 14:24:32,830 INFO L290 TraceCheckUtils]: 14: Hoare triple {512#true} assume true; {512#true} is VALID [2022-04-08 14:24:32,830 INFO L290 TraceCheckUtils]: 13: Hoare triple {512#true} assume !(0 == ~cond); {512#true} is VALID [2022-04-08 14:24:32,830 INFO L290 TraceCheckUtils]: 12: Hoare triple {512#true} ~cond := #in~cond; {512#true} is VALID [2022-04-08 14:24:32,831 INFO L272 TraceCheckUtils]: 11: Hoare triple {512#true} call assume_abort_if_not((if ~k~0 <= 256 then 1 else 0)); {512#true} is VALID [2022-04-08 14:24:32,831 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {512#true} {512#true} #53#return; {512#true} is VALID [2022-04-08 14:24:32,831 INFO L290 TraceCheckUtils]: 9: Hoare triple {512#true} assume true; {512#true} is VALID [2022-04-08 14:24:32,831 INFO L290 TraceCheckUtils]: 8: Hoare triple {512#true} assume !(0 == ~cond); {512#true} is VALID [2022-04-08 14:24:32,831 INFO L290 TraceCheckUtils]: 7: Hoare triple {512#true} ~cond := #in~cond; {512#true} is VALID [2022-04-08 14:24:32,831 INFO L272 TraceCheckUtils]: 6: Hoare triple {512#true} call assume_abort_if_not((if ~k~0 >= 0 && ~k~0 <= 10 then 1 else 0)); {512#true} is VALID [2022-04-08 14:24:32,832 INFO L290 TraceCheckUtils]: 5: Hoare triple {512#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; {512#true} is VALID [2022-04-08 14:24:32,832 INFO L272 TraceCheckUtils]: 4: Hoare triple {512#true} call #t~ret5 := main(); {512#true} is VALID [2022-04-08 14:24:32,832 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {512#true} {512#true} #63#return; {512#true} is VALID [2022-04-08 14:24:32,832 INFO L290 TraceCheckUtils]: 2: Hoare triple {512#true} assume true; {512#true} is VALID [2022-04-08 14:24:32,832 INFO L290 TraceCheckUtils]: 1: Hoare triple {512#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); {512#true} is VALID [2022-04-08 14:24:32,832 INFO L272 TraceCheckUtils]: 0: Hoare triple {512#true} call ULTIMATE.init(); {512#true} is VALID [2022-04-08 14:24:32,833 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-04-08 14:24:32,833 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 14:24:32,833 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1854235465] [2022-04-08 14:24:32,833 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 14:24:32,833 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2079005762] [2022-04-08 14:24:32,834 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2079005762] provided 1 perfect and 1 imperfect interpolant sequences [2022-04-08 14:24:32,834 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-04-08 14:24:32,834 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 7 [2022-04-08 14:24:32,834 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 14:24:32,834 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1521290144] [2022-04-08 14:24:32,834 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1521290144] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 14:24:32,835 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 14:24:32,835 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 14:24:32,835 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1195412861] [2022-04-08 14:24:32,835 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 14:24:32,840 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, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 29 [2022-04-08 14:24:32,840 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 14:24:32,840 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, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-08 14:24:33,443 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 14:24:33,443 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-08 14:24:33,444 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 14:24:33,444 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-08 14:24:33,444 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=28, Unknown=1, NotChecked=0, Total=42 [2022-04-08 14:24:33,444 INFO L87 Difference]: Start difference. First operand 31 states and 34 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, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-08 14:24:33,633 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:24:33,633 INFO L93 Difference]: Finished difference Result 37 states and 39 transitions. [2022-04-08 14:24:33,633 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-08 14:24:33,634 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, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 29 [2022-04-08 14:24:33,634 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 14:24:33,634 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, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-08 14:24:33,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 32 transitions. [2022-04-08 14:24:33,635 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, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-08 14:24:33,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 32 transitions. [2022-04-08 14:24:33,636 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 32 transitions. [2022-04-08 14:24:33,929 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 32 edges. 32 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 14:24:33,931 INFO L225 Difference]: With dead ends: 37 [2022-04-08 14:24:33,931 INFO L226 Difference]: Without dead ends: 33 [2022-04-08 14:24:33,931 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 50 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=17, Invalid=38, Unknown=1, NotChecked=0, Total=56 [2022-04-08 14:24:33,932 INFO L913 BasicCegarLoop]: 22 mSDtfsCounter, 6 mSDsluCounter, 53 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 75 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-08 14:24:33,933 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [7 Valid, 75 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-08 14:24:33,933 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2022-04-08 14:24:33,960 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2022-04-08 14:24:33,961 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 14:24:33,962 INFO L82 GeneralOperation]: Start isEquivalent. First operand 33 states. Second operand has 33 states, 20 states have (on average 1.05) internal successors, (21), 20 states have internal predecessors, (21), 8 states have call successors, (8), 6 states have call predecessors, (8), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-08 14:24:33,962 INFO L74 IsIncluded]: Start isIncluded. First operand 33 states. Second operand has 33 states, 20 states have (on average 1.05) internal successors, (21), 20 states have internal predecessors, (21), 8 states have call successors, (8), 6 states have call predecessors, (8), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-08 14:24:33,962 INFO L87 Difference]: Start difference. First operand 33 states. Second operand has 33 states, 20 states have (on average 1.05) internal successors, (21), 20 states have internal predecessors, (21), 8 states have call successors, (8), 6 states have call predecessors, (8), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-08 14:24:33,968 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:24:33,968 INFO L93 Difference]: Finished difference Result 33 states and 35 transitions. [2022-04-08 14:24:33,968 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 35 transitions. [2022-04-08 14:24:33,969 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 14:24:33,969 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 14:24:33,971 INFO L74 IsIncluded]: Start isIncluded. First operand has 33 states, 20 states have (on average 1.05) internal successors, (21), 20 states have internal predecessors, (21), 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 33 states. [2022-04-08 14:24:33,972 INFO L87 Difference]: Start difference. First operand has 33 states, 20 states have (on average 1.05) internal successors, (21), 20 states have internal predecessors, (21), 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 33 states. [2022-04-08 14:24:33,977 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:24:33,977 INFO L93 Difference]: Finished difference Result 33 states and 35 transitions. [2022-04-08 14:24:33,977 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 35 transitions. [2022-04-08 14:24:33,977 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 14:24:33,977 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 14:24:33,978 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 14:24:33,978 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 14:24:33,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 20 states have (on average 1.05) internal successors, (21), 20 states have internal predecessors, (21), 8 states have call successors, (8), 6 states have call predecessors, (8), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-08 14:24:33,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 35 transitions. [2022-04-08 14:24:33,979 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 35 transitions. Word has length 29 [2022-04-08 14:24:33,980 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 14:24:33,980 INFO L478 AbstractCegarLoop]: Abstraction has 33 states and 35 transitions. [2022-04-08 14:24:33,980 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, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-08 14:24:33,980 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 33 states and 35 transitions. [2022-04-08 14:24:34,238 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 35 edges. 35 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 14:24:34,238 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 35 transitions. [2022-04-08 14:24:34,239 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2022-04-08 14:24:34,239 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 14:24:34,239 INFO L499 BasicCegarLoop]: trace histogram [4, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 14:24:34,266 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-04-08 14:24:34,439 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2022-04-08 14:24:34,440 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 14:24:34,440 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 14:24:34,440 INFO L85 PathProgramCache]: Analyzing trace with hash 463554397, now seen corresponding path program 1 times [2022-04-08 14:24:34,440 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 14:24:34,440 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [299313114] [2022-04-08 14:24:34,441 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 14:24:34,441 INFO L85 PathProgramCache]: Analyzing trace with hash 463554397, now seen corresponding path program 2 times [2022-04-08 14:24:34,441 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 14:24:34,441 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1000936249] [2022-04-08 14:24:34,441 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 14:24:34,442 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 14:24:34,465 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 14:24:34,469 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [617068921] [2022-04-08 14:24:34,469 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 14:24:34,469 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 14:24:34,470 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 14:24:34,472 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 14:24:34,473 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-04-08 14:24:34,521 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 14:24:34,521 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 14:24:34,522 INFO L263 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 12 conjunts are in the unsatisfiable core [2022-04-08 14:24:34,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 14:24:34,542 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 14:24:34,948 INFO L272 TraceCheckUtils]: 0: Hoare triple {900#true} call ULTIMATE.init(); {900#true} is VALID [2022-04-08 14:24:34,949 INFO L290 TraceCheckUtils]: 1: Hoare triple {900#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); {900#true} is VALID [2022-04-08 14:24:34,950 INFO L290 TraceCheckUtils]: 2: Hoare triple {900#true} assume true; {900#true} is VALID [2022-04-08 14:24:34,950 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {900#true} {900#true} #63#return; {900#true} is VALID [2022-04-08 14:24:34,952 INFO L272 TraceCheckUtils]: 4: Hoare triple {900#true} call #t~ret5 := main(); {900#true} is VALID [2022-04-08 14:24:34,953 INFO L290 TraceCheckUtils]: 5: Hoare triple {900#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; {900#true} is VALID [2022-04-08 14:24:34,966 INFO L272 TraceCheckUtils]: 6: Hoare triple {900#true} call assume_abort_if_not((if ~k~0 >= 0 && ~k~0 <= 10 then 1 else 0)); {900#true} is VALID [2022-04-08 14:24:34,966 INFO L290 TraceCheckUtils]: 7: Hoare triple {900#true} ~cond := #in~cond; {900#true} is VALID [2022-04-08 14:24:34,966 INFO L290 TraceCheckUtils]: 8: Hoare triple {900#true} assume !(0 == ~cond); {900#true} is VALID [2022-04-08 14:24:34,967 INFO L290 TraceCheckUtils]: 9: Hoare triple {900#true} assume true; {900#true} is VALID [2022-04-08 14:24:34,967 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {900#true} {900#true} #53#return; {900#true} is VALID [2022-04-08 14:24:34,967 INFO L272 TraceCheckUtils]: 11: Hoare triple {900#true} call assume_abort_if_not((if ~k~0 <= 256 then 1 else 0)); {900#true} is VALID [2022-04-08 14:24:34,967 INFO L290 TraceCheckUtils]: 12: Hoare triple {900#true} ~cond := #in~cond; {900#true} is VALID [2022-04-08 14:24:34,967 INFO L290 TraceCheckUtils]: 13: Hoare triple {900#true} assume !(0 == ~cond); {900#true} is VALID [2022-04-08 14:24:34,967 INFO L290 TraceCheckUtils]: 14: Hoare triple {900#true} assume true; {900#true} is VALID [2022-04-08 14:24:34,968 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {900#true} {900#true} #55#return; {900#true} is VALID [2022-04-08 14:24:34,974 INFO L290 TraceCheckUtils]: 16: Hoare triple {900#true} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {953#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-08 14:24:34,975 INFO L290 TraceCheckUtils]: 17: Hoare triple {953#(and (= main_~c~0 0) (= main_~y~0 0))} assume !false; {953#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-08 14:24:34,975 INFO L272 TraceCheckUtils]: 18: Hoare triple {953#(and (= main_~c~0 0) (= main_~y~0 0))} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {900#true} is VALID [2022-04-08 14:24:34,975 INFO L290 TraceCheckUtils]: 19: Hoare triple {900#true} ~cond := #in~cond; {900#true} is VALID [2022-04-08 14:24:34,975 INFO L290 TraceCheckUtils]: 20: Hoare triple {900#true} assume !(0 == ~cond); {900#true} is VALID [2022-04-08 14:24:34,975 INFO L290 TraceCheckUtils]: 21: Hoare triple {900#true} assume true; {900#true} is VALID [2022-04-08 14:24:34,976 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {900#true} {953#(and (= main_~c~0 0) (= main_~y~0 0))} #57#return; {953#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-08 14:24:34,977 INFO L290 TraceCheckUtils]: 23: Hoare triple {953#(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 + ~x~0; {975#(and (= (+ (- 1) main_~y~0) 0) (< 0 main_~k~0) (<= main_~c~0 1))} is VALID [2022-04-08 14:24:34,977 INFO L290 TraceCheckUtils]: 24: Hoare triple {975#(and (= (+ (- 1) main_~y~0) 0) (< 0 main_~k~0) (<= main_~c~0 1))} assume !false; {975#(and (= (+ (- 1) main_~y~0) 0) (< 0 main_~k~0) (<= main_~c~0 1))} is VALID [2022-04-08 14:24:34,977 INFO L272 TraceCheckUtils]: 25: Hoare triple {975#(and (= (+ (- 1) main_~y~0) 0) (< 0 main_~k~0) (<= main_~c~0 1))} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {900#true} is VALID [2022-04-08 14:24:34,977 INFO L290 TraceCheckUtils]: 26: Hoare triple {900#true} ~cond := #in~cond; {900#true} is VALID [2022-04-08 14:24:34,977 INFO L290 TraceCheckUtils]: 27: Hoare triple {900#true} assume !(0 == ~cond); {900#true} is VALID [2022-04-08 14:24:34,978 INFO L290 TraceCheckUtils]: 28: Hoare triple {900#true} assume true; {900#true} is VALID [2022-04-08 14:24:34,979 INFO L284 TraceCheckUtils]: 29: Hoare quadruple {900#true} {975#(and (= (+ (- 1) main_~y~0) 0) (< 0 main_~k~0) (<= main_~c~0 1))} #57#return; {975#(and (= (+ (- 1) main_~y~0) 0) (< 0 main_~k~0) (<= main_~c~0 1))} is VALID [2022-04-08 14:24:34,980 INFO L290 TraceCheckUtils]: 30: Hoare triple {975#(and (= (+ (- 1) main_~y~0) 0) (< 0 main_~k~0) (<= main_~c~0 1))} assume !(~c~0 < ~k~0); {997#(and (= (+ (- 1) main_~y~0) 0) (<= main_~k~0 1) (< 0 main_~k~0))} is VALID [2022-04-08 14:24:34,980 INFO L272 TraceCheckUtils]: 31: Hoare triple {997#(and (= (+ (- 1) main_~y~0) 0) (<= main_~k~0 1) (< 0 main_~k~0))} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {900#true} is VALID [2022-04-08 14:24:34,980 INFO L290 TraceCheckUtils]: 32: Hoare triple {900#true} ~cond := #in~cond; {900#true} is VALID [2022-04-08 14:24:34,980 INFO L290 TraceCheckUtils]: 33: Hoare triple {900#true} assume !(0 == ~cond); {900#true} is VALID [2022-04-08 14:24:34,981 INFO L290 TraceCheckUtils]: 34: Hoare triple {900#true} assume true; {900#true} is VALID [2022-04-08 14:24:34,981 INFO L284 TraceCheckUtils]: 35: Hoare quadruple {900#true} {997#(and (= (+ (- 1) main_~y~0) 0) (<= main_~k~0 1) (< 0 main_~k~0))} #59#return; {997#(and (= (+ (- 1) main_~y~0) 0) (<= main_~k~0 1) (< 0 main_~k~0))} is VALID [2022-04-08 14:24:34,982 INFO L272 TraceCheckUtils]: 36: Hoare triple {997#(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)); {1016#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 14:24:34,983 INFO L290 TraceCheckUtils]: 37: Hoare triple {1016#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1020#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 14:24:34,983 INFO L290 TraceCheckUtils]: 38: Hoare triple {1020#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {901#false} is VALID [2022-04-08 14:24:34,983 INFO L290 TraceCheckUtils]: 39: Hoare triple {901#false} assume !false; {901#false} is VALID [2022-04-08 14:24:34,983 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-04-08 14:24:34,984 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 14:24:35,328 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 14:24:35,328 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1000936249] [2022-04-08 14:24:35,328 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 14:24:35,328 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [617068921] [2022-04-08 14:24:35,329 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [617068921] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 14:24:35,329 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-08 14:24:35,329 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2022-04-08 14:24:35,329 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 14:24:35,329 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [299313114] [2022-04-08 14:24:35,330 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [299313114] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 14:24:35,330 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 14:24:35,330 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-08 14:24:35,330 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1790686403] [2022-04-08 14:24:35,330 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 14:24:35,330 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, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) Word has length 40 [2022-04-08 14:24:35,331 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 14:24:35,331 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, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2022-04-08 14:24:35,364 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 31 edges. 31 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 14:24:35,365 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-08 14:24:35,365 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 14:24:35,365 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-08 14:24:35,366 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2022-04-08 14:24:35,366 INFO L87 Difference]: Start difference. First operand 33 states and 35 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, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2022-04-08 14:24:35,688 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:24:35,688 INFO L93 Difference]: Finished difference Result 42 states and 46 transitions. [2022-04-08 14:24:35,688 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-08 14:24:35,689 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, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) Word has length 40 [2022-04-08 14:24:35,689 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 14:24:35,689 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, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2022-04-08 14:24:35,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 42 transitions. [2022-04-08 14:24:35,691 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, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2022-04-08 14:24:35,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 42 transitions. [2022-04-08 14:24:35,692 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 42 transitions. [2022-04-08 14:24:35,728 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 42 edges. 42 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 14:24:35,730 INFO L225 Difference]: With dead ends: 42 [2022-04-08 14:24:35,730 INFO L226 Difference]: Without dead ends: 36 [2022-04-08 14:24:35,730 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 48 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2022-04-08 14:24:35,731 INFO L913 BasicCegarLoop]: 30 mSDtfsCounter, 2 mSDsluCounter, 105 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 135 SdHoareTripleChecker+Invalid, 60 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 59 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-08 14:24:35,731 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [2 Valid, 135 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 59 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-08 14:24:35,732 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2022-04-08 14:24:35,749 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2022-04-08 14:24:35,749 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 14:24:35,749 INFO L82 GeneralOperation]: Start isEquivalent. First operand 36 states. Second operand has 36 states, 22 states have (on average 1.0454545454545454) internal successors, (23), 22 states have internal predecessors, (23), 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 14:24:35,750 INFO L74 IsIncluded]: Start isIncluded. First operand 36 states. Second operand has 36 states, 22 states have (on average 1.0454545454545454) internal successors, (23), 22 states have internal predecessors, (23), 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 14:24:35,750 INFO L87 Difference]: Start difference. First operand 36 states. Second operand has 36 states, 22 states have (on average 1.0454545454545454) internal successors, (23), 22 states have internal predecessors, (23), 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 14:24:35,752 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:24:35,752 INFO L93 Difference]: Finished difference Result 36 states and 39 transitions. [2022-04-08 14:24:35,752 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 39 transitions. [2022-04-08 14:24:35,752 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 14:24:35,752 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 14:24:35,753 INFO L74 IsIncluded]: Start isIncluded. First operand has 36 states, 22 states have (on average 1.0454545454545454) internal successors, (23), 22 states have internal predecessors, (23), 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 36 states. [2022-04-08 14:24:35,753 INFO L87 Difference]: Start difference. First operand has 36 states, 22 states have (on average 1.0454545454545454) internal successors, (23), 22 states have internal predecessors, (23), 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 36 states. [2022-04-08 14:24:35,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:24:35,755 INFO L93 Difference]: Finished difference Result 36 states and 39 transitions. [2022-04-08 14:24:35,755 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 39 transitions. [2022-04-08 14:24:35,755 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 14:24:35,755 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 14:24:35,755 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 14:24:35,755 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 14:24:35,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 22 states have (on average 1.0454545454545454) internal successors, (23), 22 states have internal predecessors, (23), 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 14:24:35,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 39 transitions. [2022-04-08 14:24:35,757 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 39 transitions. Word has length 40 [2022-04-08 14:24:35,758 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 14:24:35,758 INFO L478 AbstractCegarLoop]: Abstraction has 36 states and 39 transitions. [2022-04-08 14:24:35,758 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, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2022-04-08 14:24:35,758 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 36 states and 39 transitions. [2022-04-08 14:24:36,080 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 39 edges. 39 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 14:24:36,080 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 39 transitions. [2022-04-08 14:24:36,081 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2022-04-08 14:24:36,081 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 14:24:36,081 INFO L499 BasicCegarLoop]: trace histogram [5, 4, 4, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 14:24:36,106 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-04-08 14:24:36,281 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 14:24:36,282 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 14:24:36,282 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 14:24:36,282 INFO L85 PathProgramCache]: Analyzing trace with hash 1886956461, now seen corresponding path program 3 times [2022-04-08 14:24:36,282 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 14:24:36,283 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [823959895] [2022-04-08 14:24:36,283 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 14:24:36,283 INFO L85 PathProgramCache]: Analyzing trace with hash 1886956461, now seen corresponding path program 4 times [2022-04-08 14:24:36,283 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 14:24:36,283 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1579061174] [2022-04-08 14:24:36,283 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 14:24:36,284 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 14:24:36,308 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 14:24:36,308 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1009601151] [2022-04-08 14:24:36,308 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-08 14:24:36,308 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 14:24:36,309 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 14:24:36,323 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 14:24:36,352 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-04-08 14:24:36,393 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-08 14:24:36,393 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 14:24:36,394 INFO L263 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 17 conjunts are in the unsatisfiable core [2022-04-08 14:24:36,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 14:24:36,408 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 14:24:36,789 INFO L272 TraceCheckUtils]: 0: Hoare triple {1315#true} call ULTIMATE.init(); {1315#true} is VALID [2022-04-08 14:24:36,789 INFO L290 TraceCheckUtils]: 1: Hoare triple {1315#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); {1315#true} is VALID [2022-04-08 14:24:36,790 INFO L290 TraceCheckUtils]: 2: Hoare triple {1315#true} assume true; {1315#true} is VALID [2022-04-08 14:24:36,790 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1315#true} {1315#true} #63#return; {1315#true} is VALID [2022-04-08 14:24:36,790 INFO L272 TraceCheckUtils]: 4: Hoare triple {1315#true} call #t~ret5 := main(); {1315#true} is VALID [2022-04-08 14:24:36,790 INFO L290 TraceCheckUtils]: 5: Hoare triple {1315#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; {1315#true} is VALID [2022-04-08 14:24:36,790 INFO L272 TraceCheckUtils]: 6: Hoare triple {1315#true} call assume_abort_if_not((if ~k~0 >= 0 && ~k~0 <= 10 then 1 else 0)); {1315#true} is VALID [2022-04-08 14:24:36,790 INFO L290 TraceCheckUtils]: 7: Hoare triple {1315#true} ~cond := #in~cond; {1315#true} is VALID [2022-04-08 14:24:36,791 INFO L290 TraceCheckUtils]: 8: Hoare triple {1315#true} assume !(0 == ~cond); {1315#true} is VALID [2022-04-08 14:24:36,791 INFO L290 TraceCheckUtils]: 9: Hoare triple {1315#true} assume true; {1315#true} is VALID [2022-04-08 14:24:36,791 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1315#true} {1315#true} #53#return; {1315#true} is VALID [2022-04-08 14:24:36,791 INFO L272 TraceCheckUtils]: 11: Hoare triple {1315#true} call assume_abort_if_not((if ~k~0 <= 256 then 1 else 0)); {1315#true} is VALID [2022-04-08 14:24:36,791 INFO L290 TraceCheckUtils]: 12: Hoare triple {1315#true} ~cond := #in~cond; {1315#true} is VALID [2022-04-08 14:24:36,791 INFO L290 TraceCheckUtils]: 13: Hoare triple {1315#true} assume !(0 == ~cond); {1315#true} is VALID [2022-04-08 14:24:36,792 INFO L290 TraceCheckUtils]: 14: Hoare triple {1315#true} assume true; {1315#true} is VALID [2022-04-08 14:24:36,792 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {1315#true} {1315#true} #55#return; {1315#true} is VALID [2022-04-08 14:24:36,792 INFO L290 TraceCheckUtils]: 16: Hoare triple {1315#true} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {1368#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-08 14:24:36,793 INFO L290 TraceCheckUtils]: 17: Hoare triple {1368#(and (= main_~c~0 0) (= main_~y~0 0))} assume !false; {1368#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-08 14:24:36,793 INFO L272 TraceCheckUtils]: 18: Hoare triple {1368#(and (= main_~c~0 0) (= main_~y~0 0))} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {1315#true} is VALID [2022-04-08 14:24:36,793 INFO L290 TraceCheckUtils]: 19: Hoare triple {1315#true} ~cond := #in~cond; {1315#true} is VALID [2022-04-08 14:24:36,794 INFO L290 TraceCheckUtils]: 20: Hoare triple {1315#true} assume !(0 == ~cond); {1315#true} is VALID [2022-04-08 14:24:36,794 INFO L290 TraceCheckUtils]: 21: Hoare triple {1315#true} assume true; {1315#true} is VALID [2022-04-08 14:24:36,795 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {1315#true} {1368#(and (= main_~c~0 0) (= main_~y~0 0))} #57#return; {1368#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-08 14:24:36,795 INFO L290 TraceCheckUtils]: 23: Hoare triple {1368#(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 + ~x~0; {1390#(and (= main_~y~0 1) (< 0 main_~k~0) (= main_~c~0 1))} is VALID [2022-04-08 14:24:36,797 INFO L290 TraceCheckUtils]: 24: Hoare triple {1390#(and (= main_~y~0 1) (< 0 main_~k~0) (= main_~c~0 1))} assume !false; {1390#(and (= main_~y~0 1) (< 0 main_~k~0) (= main_~c~0 1))} is VALID [2022-04-08 14:24:36,797 INFO L272 TraceCheckUtils]: 25: Hoare triple {1390#(and (= main_~y~0 1) (< 0 main_~k~0) (= main_~c~0 1))} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {1315#true} is VALID [2022-04-08 14:24:36,797 INFO L290 TraceCheckUtils]: 26: Hoare triple {1315#true} ~cond := #in~cond; {1315#true} is VALID [2022-04-08 14:24:36,797 INFO L290 TraceCheckUtils]: 27: Hoare triple {1315#true} assume !(0 == ~cond); {1315#true} is VALID [2022-04-08 14:24:36,797 INFO L290 TraceCheckUtils]: 28: Hoare triple {1315#true} assume true; {1315#true} is VALID [2022-04-08 14:24:36,799 INFO L284 TraceCheckUtils]: 29: Hoare quadruple {1315#true} {1390#(and (= main_~y~0 1) (< 0 main_~k~0) (= main_~c~0 1))} #57#return; {1390#(and (= main_~y~0 1) (< 0 main_~k~0) (= main_~c~0 1))} is VALID [2022-04-08 14:24:36,800 INFO L290 TraceCheckUtils]: 30: Hoare triple {1390#(and (= main_~y~0 1) (< 0 main_~k~0) (= main_~c~0 1))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {1412#(and (= main_~y~0 2) (< 1 main_~k~0) (<= main_~c~0 2))} is VALID [2022-04-08 14:24:36,801 INFO L290 TraceCheckUtils]: 31: Hoare triple {1412#(and (= main_~y~0 2) (< 1 main_~k~0) (<= main_~c~0 2))} assume !false; {1412#(and (= main_~y~0 2) (< 1 main_~k~0) (<= main_~c~0 2))} is VALID [2022-04-08 14:24:36,801 INFO L272 TraceCheckUtils]: 32: Hoare triple {1412#(and (= main_~y~0 2) (< 1 main_~k~0) (<= main_~c~0 2))} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {1315#true} is VALID [2022-04-08 14:24:36,801 INFO L290 TraceCheckUtils]: 33: Hoare triple {1315#true} ~cond := #in~cond; {1315#true} is VALID [2022-04-08 14:24:36,801 INFO L290 TraceCheckUtils]: 34: Hoare triple {1315#true} assume !(0 == ~cond); {1315#true} is VALID [2022-04-08 14:24:36,801 INFO L290 TraceCheckUtils]: 35: Hoare triple {1315#true} assume true; {1315#true} is VALID [2022-04-08 14:24:36,802 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {1315#true} {1412#(and (= main_~y~0 2) (< 1 main_~k~0) (<= main_~c~0 2))} #57#return; {1412#(and (= main_~y~0 2) (< 1 main_~k~0) (<= main_~c~0 2))} is VALID [2022-04-08 14:24:36,803 INFO L290 TraceCheckUtils]: 37: Hoare triple {1412#(and (= main_~y~0 2) (< 1 main_~k~0) (<= main_~c~0 2))} assume !(~c~0 < ~k~0); {1434#(and (= main_~y~0 2) (< 1 main_~k~0) (<= main_~k~0 2))} is VALID [2022-04-08 14:24:36,803 INFO L272 TraceCheckUtils]: 38: Hoare triple {1434#(and (= main_~y~0 2) (< 1 main_~k~0) (<= main_~k~0 2))} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {1315#true} is VALID [2022-04-08 14:24:36,804 INFO L290 TraceCheckUtils]: 39: Hoare triple {1315#true} ~cond := #in~cond; {1315#true} is VALID [2022-04-08 14:24:36,804 INFO L290 TraceCheckUtils]: 40: Hoare triple {1315#true} assume !(0 == ~cond); {1315#true} is VALID [2022-04-08 14:24:36,804 INFO L290 TraceCheckUtils]: 41: Hoare triple {1315#true} assume true; {1315#true} is VALID [2022-04-08 14:24:36,805 INFO L284 TraceCheckUtils]: 42: Hoare quadruple {1315#true} {1434#(and (= main_~y~0 2) (< 1 main_~k~0) (<= main_~k~0 2))} #59#return; {1434#(and (= main_~y~0 2) (< 1 main_~k~0) (<= main_~k~0 2))} is VALID [2022-04-08 14:24:36,805 INFO L272 TraceCheckUtils]: 43: Hoare triple {1434#(and (= main_~y~0 2) (< 1 main_~k~0) (<= main_~k~0 2))} call __VERIFIER_assert((if ~k~0 * ~y~0 == ~y~0 * ~y~0 then 1 else 0)); {1453#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 14:24:36,806 INFO L290 TraceCheckUtils]: 44: Hoare triple {1453#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1457#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 14:24:36,806 INFO L290 TraceCheckUtils]: 45: Hoare triple {1457#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1316#false} is VALID [2022-04-08 14:24:36,806 INFO L290 TraceCheckUtils]: 46: Hoare triple {1316#false} assume !false; {1316#false} is VALID [2022-04-08 14:24:36,807 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 8 proven. 9 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2022-04-08 14:24:36,807 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 14:24:37,283 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 14:24:37,283 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1579061174] [2022-04-08 14:24:37,283 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 14:24:37,283 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1009601151] [2022-04-08 14:24:37,283 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1009601151] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 14:24:37,283 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-08 14:24:37,284 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2022-04-08 14:24:37,284 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 14:24:37,284 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [823959895] [2022-04-08 14:24:37,284 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [823959895] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 14:24:37,284 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 14:24:37,284 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-08 14:24:37,284 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2104602482] [2022-04-08 14:24:37,284 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 14:24:37,285 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, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 5 states have call predecessors, (7), 5 states have call successors, (7) Word has length 47 [2022-04-08 14:24:37,285 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 14:24:37,285 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, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 5 states have call predecessors, (7), 5 states have call successors, (7) [2022-04-08 14:24:37,315 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 35 edges. 35 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 14:24:37,316 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-08 14:24:37,316 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 14:24:37,316 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-08 14:24:37,316 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2022-04-08 14:24:37,317 INFO L87 Difference]: Start difference. First operand 36 states and 39 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, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 5 states have call predecessors, (7), 5 states have call successors, (7) [2022-04-08 14:24:37,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:24:37,723 INFO L93 Difference]: Finished difference Result 45 states and 50 transitions. [2022-04-08 14:24:37,723 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-08 14:24:37,723 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, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 5 states have call predecessors, (7), 5 states have call successors, (7) Word has length 47 [2022-04-08 14:24:37,724 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 14:24:37,724 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, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 5 states have call predecessors, (7), 5 states have call successors, (7) [2022-04-08 14:24:37,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 46 transitions. [2022-04-08 14:24:37,725 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, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 5 states have call predecessors, (7), 5 states have call successors, (7) [2022-04-08 14:24:37,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 46 transitions. [2022-04-08 14:24:37,727 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 46 transitions. [2022-04-08 14:24:37,769 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 46 edges. 46 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 14:24:37,770 INFO L225 Difference]: With dead ends: 45 [2022-04-08 14:24:37,771 INFO L226 Difference]: Without dead ends: 39 [2022-04-08 14:24:37,771 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 60 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=42, Invalid=140, Unknown=0, NotChecked=0, Total=182 [2022-04-08 14:24:37,772 INFO L913 BasicCegarLoop]: 33 mSDtfsCounter, 2 mSDsluCounter, 131 mSDsCounter, 0 mSdLazyCounter, 89 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 164 SdHoareTripleChecker+Invalid, 90 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 89 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-08 14:24:37,772 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [2 Valid, 164 Invalid, 90 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 89 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-08 14:24:37,773 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2022-04-08 14:24:37,793 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2022-04-08 14:24:37,793 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 14:24:37,793 INFO L82 GeneralOperation]: Start isEquivalent. First operand 39 states. Second operand has 39 states, 24 states have (on average 1.0416666666666667) internal successors, (25), 24 states have internal predecessors, (25), 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 14:24:37,793 INFO L74 IsIncluded]: Start isIncluded. First operand 39 states. Second operand has 39 states, 24 states have (on average 1.0416666666666667) internal successors, (25), 24 states have internal predecessors, (25), 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 14:24:37,794 INFO L87 Difference]: Start difference. First operand 39 states. Second operand has 39 states, 24 states have (on average 1.0416666666666667) internal successors, (25), 24 states have internal predecessors, (25), 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 14:24:37,795 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:24:37,795 INFO L93 Difference]: Finished difference Result 39 states and 43 transitions. [2022-04-08 14:24:37,795 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 43 transitions. [2022-04-08 14:24:37,796 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 14:24:37,796 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 14:24:37,796 INFO L74 IsIncluded]: Start isIncluded. First operand has 39 states, 24 states have (on average 1.0416666666666667) internal successors, (25), 24 states have internal predecessors, (25), 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 39 states. [2022-04-08 14:24:37,796 INFO L87 Difference]: Start difference. First operand has 39 states, 24 states have (on average 1.0416666666666667) internal successors, (25), 24 states have internal predecessors, (25), 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 39 states. [2022-04-08 14:24:37,798 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:24:37,798 INFO L93 Difference]: Finished difference Result 39 states and 43 transitions. [2022-04-08 14:24:37,798 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 43 transitions. [2022-04-08 14:24:37,798 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 14:24:37,798 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 14:24:37,799 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 14:24:37,799 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 14:24:37,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 24 states have (on average 1.0416666666666667) internal successors, (25), 24 states have internal predecessors, (25), 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 14:24:37,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 43 transitions. [2022-04-08 14:24:37,800 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 43 transitions. Word has length 47 [2022-04-08 14:24:37,801 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 14:24:37,801 INFO L478 AbstractCegarLoop]: Abstraction has 39 states and 43 transitions. [2022-04-08 14:24:37,801 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, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 5 states have call predecessors, (7), 5 states have call successors, (7) [2022-04-08 14:24:37,801 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 39 states and 43 transitions. [2022-04-08 14:24:39,076 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 43 edges. 43 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 14:24:39,076 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 43 transitions. [2022-04-08 14:24:39,077 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2022-04-08 14:24:39,077 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 14:24:39,077 INFO L499 BasicCegarLoop]: trace histogram [6, 5, 5, 4, 4, 4, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 14:24:39,106 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-04-08 14:24:39,278 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 14:24:39,278 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 14:24:39,279 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 14:24:39,279 INFO L85 PathProgramCache]: Analyzing trace with hash -1213805219, now seen corresponding path program 5 times [2022-04-08 14:24:39,279 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 14:24:39,279 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2145012601] [2022-04-08 14:24:39,279 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 14:24:39,279 INFO L85 PathProgramCache]: Analyzing trace with hash -1213805219, now seen corresponding path program 6 times [2022-04-08 14:24:39,280 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 14:24:39,280 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [442321043] [2022-04-08 14:24:39,280 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 14:24:39,280 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 14:24:39,301 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 14:24:39,301 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1397568692] [2022-04-08 14:24:39,301 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-08 14:24:39,301 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 14:24:39,302 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 14:24:39,306 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 14:24:39,328 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-04-08 14:24:39,659 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2022-04-08 14:24:39,660 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 14:24:39,661 INFO L263 TraceCheckSpWp]: Trace formula consists of 147 conjuncts, 20 conjunts are in the unsatisfiable core [2022-04-08 14:24:39,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 14:24:39,686 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 14:24:40,146 INFO L272 TraceCheckUtils]: 0: Hoare triple {1792#true} call ULTIMATE.init(); {1792#true} is VALID [2022-04-08 14:24:40,146 INFO L290 TraceCheckUtils]: 1: Hoare triple {1792#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); {1792#true} is VALID [2022-04-08 14:24:40,146 INFO L290 TraceCheckUtils]: 2: Hoare triple {1792#true} assume true; {1792#true} is VALID [2022-04-08 14:24:40,147 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1792#true} {1792#true} #63#return; {1792#true} is VALID [2022-04-08 14:24:40,147 INFO L272 TraceCheckUtils]: 4: Hoare triple {1792#true} call #t~ret5 := main(); {1792#true} is VALID [2022-04-08 14:24:40,147 INFO L290 TraceCheckUtils]: 5: Hoare triple {1792#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; {1792#true} is VALID [2022-04-08 14:24:40,147 INFO L272 TraceCheckUtils]: 6: Hoare triple {1792#true} call assume_abort_if_not((if ~k~0 >= 0 && ~k~0 <= 10 then 1 else 0)); {1792#true} is VALID [2022-04-08 14:24:40,147 INFO L290 TraceCheckUtils]: 7: Hoare triple {1792#true} ~cond := #in~cond; {1792#true} is VALID [2022-04-08 14:24:40,147 INFO L290 TraceCheckUtils]: 8: Hoare triple {1792#true} assume !(0 == ~cond); {1792#true} is VALID [2022-04-08 14:24:40,147 INFO L290 TraceCheckUtils]: 9: Hoare triple {1792#true} assume true; {1792#true} is VALID [2022-04-08 14:24:40,148 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1792#true} {1792#true} #53#return; {1792#true} is VALID [2022-04-08 14:24:40,148 INFO L272 TraceCheckUtils]: 11: Hoare triple {1792#true} call assume_abort_if_not((if ~k~0 <= 256 then 1 else 0)); {1792#true} is VALID [2022-04-08 14:24:40,148 INFO L290 TraceCheckUtils]: 12: Hoare triple {1792#true} ~cond := #in~cond; {1792#true} is VALID [2022-04-08 14:24:40,148 INFO L290 TraceCheckUtils]: 13: Hoare triple {1792#true} assume !(0 == ~cond); {1792#true} is VALID [2022-04-08 14:24:40,148 INFO L290 TraceCheckUtils]: 14: Hoare triple {1792#true} assume true; {1792#true} is VALID [2022-04-08 14:24:40,148 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {1792#true} {1792#true} #55#return; {1792#true} is VALID [2022-04-08 14:24:40,149 INFO L290 TraceCheckUtils]: 16: Hoare triple {1792#true} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {1845#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-08 14:24:40,149 INFO L290 TraceCheckUtils]: 17: Hoare triple {1845#(and (= main_~c~0 0) (= main_~y~0 0))} assume !false; {1845#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-08 14:24:40,150 INFO L272 TraceCheckUtils]: 18: Hoare triple {1845#(and (= main_~c~0 0) (= main_~y~0 0))} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {1792#true} is VALID [2022-04-08 14:24:40,150 INFO L290 TraceCheckUtils]: 19: Hoare triple {1792#true} ~cond := #in~cond; {1792#true} is VALID [2022-04-08 14:24:40,150 INFO L290 TraceCheckUtils]: 20: Hoare triple {1792#true} assume !(0 == ~cond); {1792#true} is VALID [2022-04-08 14:24:40,150 INFO L290 TraceCheckUtils]: 21: Hoare triple {1792#true} assume true; {1792#true} is VALID [2022-04-08 14:24:40,151 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {1792#true} {1845#(and (= main_~c~0 0) (= main_~y~0 0))} #57#return; {1845#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-08 14:24:40,151 INFO L290 TraceCheckUtils]: 23: Hoare triple {1845#(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 + ~x~0; {1867#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} is VALID [2022-04-08 14:24:40,152 INFO L290 TraceCheckUtils]: 24: Hoare triple {1867#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} assume !false; {1867#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} is VALID [2022-04-08 14:24:40,152 INFO L272 TraceCheckUtils]: 25: Hoare triple {1867#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {1792#true} is VALID [2022-04-08 14:24:40,152 INFO L290 TraceCheckUtils]: 26: Hoare triple {1792#true} ~cond := #in~cond; {1792#true} is VALID [2022-04-08 14:24:40,152 INFO L290 TraceCheckUtils]: 27: Hoare triple {1792#true} assume !(0 == ~cond); {1792#true} is VALID [2022-04-08 14:24:40,152 INFO L290 TraceCheckUtils]: 28: Hoare triple {1792#true} assume true; {1792#true} is VALID [2022-04-08 14:24:40,153 INFO L284 TraceCheckUtils]: 29: Hoare quadruple {1792#true} {1867#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} #57#return; {1867#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} is VALID [2022-04-08 14:24:40,154 INFO L290 TraceCheckUtils]: 30: Hoare triple {1867#(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 + ~x~0; {1889#(and (= (+ (- 2) main_~y~0) 0) (= main_~c~0 2))} is VALID [2022-04-08 14:24:40,154 INFO L290 TraceCheckUtils]: 31: Hoare triple {1889#(and (= (+ (- 2) main_~y~0) 0) (= main_~c~0 2))} assume !false; {1889#(and (= (+ (- 2) main_~y~0) 0) (= main_~c~0 2))} is VALID [2022-04-08 14:24:40,154 INFO L272 TraceCheckUtils]: 32: Hoare triple {1889#(and (= (+ (- 2) main_~y~0) 0) (= main_~c~0 2))} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {1792#true} is VALID [2022-04-08 14:24:40,154 INFO L290 TraceCheckUtils]: 33: Hoare triple {1792#true} ~cond := #in~cond; {1792#true} is VALID [2022-04-08 14:24:40,155 INFO L290 TraceCheckUtils]: 34: Hoare triple {1792#true} assume !(0 == ~cond); {1792#true} is VALID [2022-04-08 14:24:40,155 INFO L290 TraceCheckUtils]: 35: Hoare triple {1792#true} assume true; {1792#true} is VALID [2022-04-08 14:24:40,155 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {1792#true} {1889#(and (= (+ (- 2) main_~y~0) 0) (= main_~c~0 2))} #57#return; {1889#(and (= (+ (- 2) main_~y~0) 0) (= main_~c~0 2))} is VALID [2022-04-08 14:24:40,156 INFO L290 TraceCheckUtils]: 37: Hoare triple {1889#(and (= (+ (- 2) main_~y~0) 0) (= main_~c~0 2))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {1911#(and (<= main_~c~0 3) (= main_~y~0 3) (< 2 main_~k~0))} is VALID [2022-04-08 14:24:40,156 INFO L290 TraceCheckUtils]: 38: Hoare triple {1911#(and (<= main_~c~0 3) (= main_~y~0 3) (< 2 main_~k~0))} assume !false; {1911#(and (<= main_~c~0 3) (= main_~y~0 3) (< 2 main_~k~0))} is VALID [2022-04-08 14:24:40,157 INFO L272 TraceCheckUtils]: 39: Hoare triple {1911#(and (<= main_~c~0 3) (= main_~y~0 3) (< 2 main_~k~0))} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {1792#true} is VALID [2022-04-08 14:24:40,157 INFO L290 TraceCheckUtils]: 40: Hoare triple {1792#true} ~cond := #in~cond; {1792#true} is VALID [2022-04-08 14:24:40,157 INFO L290 TraceCheckUtils]: 41: Hoare triple {1792#true} assume !(0 == ~cond); {1792#true} is VALID [2022-04-08 14:24:40,157 INFO L290 TraceCheckUtils]: 42: Hoare triple {1792#true} assume true; {1792#true} is VALID [2022-04-08 14:24:40,158 INFO L284 TraceCheckUtils]: 43: Hoare quadruple {1792#true} {1911#(and (<= main_~c~0 3) (= main_~y~0 3) (< 2 main_~k~0))} #57#return; {1911#(and (<= main_~c~0 3) (= main_~y~0 3) (< 2 main_~k~0))} is VALID [2022-04-08 14:24:40,158 INFO L290 TraceCheckUtils]: 44: Hoare triple {1911#(and (<= main_~c~0 3) (= main_~y~0 3) (< 2 main_~k~0))} assume !(~c~0 < ~k~0); {1933#(and (= main_~y~0 3) (<= main_~k~0 3) (< 2 main_~k~0))} is VALID [2022-04-08 14:24:40,159 INFO L272 TraceCheckUtils]: 45: Hoare triple {1933#(and (= main_~y~0 3) (<= main_~k~0 3) (< 2 main_~k~0))} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {1792#true} is VALID [2022-04-08 14:24:40,159 INFO L290 TraceCheckUtils]: 46: Hoare triple {1792#true} ~cond := #in~cond; {1792#true} is VALID [2022-04-08 14:24:40,159 INFO L290 TraceCheckUtils]: 47: Hoare triple {1792#true} assume !(0 == ~cond); {1792#true} is VALID [2022-04-08 14:24:40,159 INFO L290 TraceCheckUtils]: 48: Hoare triple {1792#true} assume true; {1792#true} is VALID [2022-04-08 14:24:40,160 INFO L284 TraceCheckUtils]: 49: Hoare quadruple {1792#true} {1933#(and (= main_~y~0 3) (<= main_~k~0 3) (< 2 main_~k~0))} #59#return; {1933#(and (= main_~y~0 3) (<= main_~k~0 3) (< 2 main_~k~0))} is VALID [2022-04-08 14:24:40,160 INFO L272 TraceCheckUtils]: 50: Hoare triple {1933#(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)); {1952#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 14:24:40,161 INFO L290 TraceCheckUtils]: 51: Hoare triple {1952#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1956#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 14:24:40,161 INFO L290 TraceCheckUtils]: 52: Hoare triple {1956#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1793#false} is VALID [2022-04-08 14:24:40,161 INFO L290 TraceCheckUtils]: 53: Hoare triple {1793#false} assume !false; {1793#false} is VALID [2022-04-08 14:24:40,162 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 10 proven. 18 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2022-04-08 14:24:40,162 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 14:24:40,526 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 14:24:40,527 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [442321043] [2022-04-08 14:24:40,527 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 14:24:40,527 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1397568692] [2022-04-08 14:24:40,527 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1397568692] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 14:24:40,527 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-08 14:24:40,527 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2022-04-08 14:24:40,528 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 14:24:40,528 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2145012601] [2022-04-08 14:24:40,528 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2145012601] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 14:24:40,528 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 14:24:40,528 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-04-08 14:24:40,528 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1684982570] [2022-04-08 14:24:40,528 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 14:24:40,529 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, (10), 2 states have call predecessors, (10), 1 states have return successors, (8), 6 states have call predecessors, (8), 6 states have call successors, (8) Word has length 54 [2022-04-08 14:24:40,529 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 14:24:40,529 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, (10), 2 states have call predecessors, (10), 1 states have return successors, (8), 6 states have call predecessors, (8), 6 states have call successors, (8) [2022-04-08 14:24:40,561 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 39 edges. 39 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 14:24:40,562 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-04-08 14:24:40,562 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 14:24:40,562 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-04-08 14:24:40,562 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2022-04-08 14:24:40,563 INFO L87 Difference]: Start difference. First operand 39 states and 43 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, (10), 2 states have call predecessors, (10), 1 states have return successors, (8), 6 states have call predecessors, (8), 6 states have call successors, (8) [2022-04-08 14:24:40,976 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:24:40,976 INFO L93 Difference]: Finished difference Result 48 states and 54 transitions. [2022-04-08 14:24:40,976 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-08 14:24:40,977 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, (10), 2 states have call predecessors, (10), 1 states have return successors, (8), 6 states have call predecessors, (8), 6 states have call successors, (8) Word has length 54 [2022-04-08 14:24:40,977 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 14:24:40,977 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, (10), 2 states have call predecessors, (10), 1 states have return successors, (8), 6 states have call predecessors, (8), 6 states have call successors, (8) [2022-04-08 14:24:40,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 50 transitions. [2022-04-08 14:24:40,979 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, (10), 2 states have call predecessors, (10), 1 states have return successors, (8), 6 states have call predecessors, (8), 6 states have call successors, (8) [2022-04-08 14:24:40,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 50 transitions. [2022-04-08 14:24:40,980 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 9 states and 50 transitions. [2022-04-08 14:24:41,020 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 50 edges. 50 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 14:24:41,021 INFO L225 Difference]: With dead ends: 48 [2022-04-08 14:24:41,021 INFO L226 Difference]: Without dead ends: 42 [2022-04-08 14:24:41,022 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 60 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=40, Invalid=142, Unknown=0, NotChecked=0, Total=182 [2022-04-08 14:24:41,023 INFO L913 BasicCegarLoop]: 36 mSDtfsCounter, 2 mSDsluCounter, 163 mSDsCounter, 0 mSdLazyCounter, 121 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 199 SdHoareTripleChecker+Invalid, 122 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 121 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-08 14:24:41,023 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [2 Valid, 199 Invalid, 122 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 121 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-08 14:24:41,023 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2022-04-08 14:24:41,055 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2022-04-08 14:24:41,055 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 14:24:41,056 INFO L82 GeneralOperation]: Start isEquivalent. First operand 42 states. Second operand has 42 states, 26 states have (on average 1.0384615384615385) internal successors, (27), 26 states have internal predecessors, (27), 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 14:24:41,056 INFO L74 IsIncluded]: Start isIncluded. First operand 42 states. Second operand has 42 states, 26 states have (on average 1.0384615384615385) internal successors, (27), 26 states have internal predecessors, (27), 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 14:24:41,056 INFO L87 Difference]: Start difference. First operand 42 states. Second operand has 42 states, 26 states have (on average 1.0384615384615385) internal successors, (27), 26 states have internal predecessors, (27), 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 14:24:41,058 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:24:41,058 INFO L93 Difference]: Finished difference Result 42 states and 47 transitions. [2022-04-08 14:24:41,058 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 47 transitions. [2022-04-08 14:24:41,058 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 14:24:41,059 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 14:24:41,059 INFO L74 IsIncluded]: Start isIncluded. First operand has 42 states, 26 states have (on average 1.0384615384615385) internal successors, (27), 26 states have internal predecessors, (27), 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 42 states. [2022-04-08 14:24:41,059 INFO L87 Difference]: Start difference. First operand has 42 states, 26 states have (on average 1.0384615384615385) internal successors, (27), 26 states have internal predecessors, (27), 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 42 states. [2022-04-08 14:24:41,060 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:24:41,061 INFO L93 Difference]: Finished difference Result 42 states and 47 transitions. [2022-04-08 14:24:41,061 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 47 transitions. [2022-04-08 14:24:41,061 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 14:24:41,061 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 14:24:41,061 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 14:24:41,061 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 14:24:41,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 26 states have (on average 1.0384615384615385) internal successors, (27), 26 states have internal predecessors, (27), 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 14:24:41,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 47 transitions. [2022-04-08 14:24:41,063 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 47 transitions. Word has length 54 [2022-04-08 14:24:41,063 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 14:24:41,064 INFO L478 AbstractCegarLoop]: Abstraction has 42 states and 47 transitions. [2022-04-08 14:24:41,064 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, (10), 2 states have call predecessors, (10), 1 states have return successors, (8), 6 states have call predecessors, (8), 6 states have call successors, (8) [2022-04-08 14:24:41,064 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 42 states and 47 transitions. [2022-04-08 14:24:41,509 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 47 edges. 47 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 14:24:41,510 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 47 transitions. [2022-04-08 14:24:41,510 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2022-04-08 14:24:41,510 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 14:24:41,510 INFO L499 BasicCegarLoop]: trace histogram [7, 6, 6, 5, 5, 5, 4, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 14:24:41,515 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2022-04-08 14:24:41,715 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 14:24:41,715 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 14:24:41,716 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 14:24:41,716 INFO L85 PathProgramCache]: Analyzing trace with hash 307258797, now seen corresponding path program 7 times [2022-04-08 14:24:41,716 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 14:24:41,716 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1720832060] [2022-04-08 14:24:41,716 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 14:24:41,717 INFO L85 PathProgramCache]: Analyzing trace with hash 307258797, now seen corresponding path program 8 times [2022-04-08 14:24:41,717 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 14:24:41,717 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1996506784] [2022-04-08 14:24:41,717 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 14:24:41,717 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 14:24:41,734 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 14:24:41,735 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [173443317] [2022-04-08 14:24:41,735 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 14:24:41,735 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 14:24:41,735 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 14:24:41,736 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 14:24:41,737 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-04-08 14:24:42,561 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 14:24:42,562 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 14:24:42,563 INFO L263 TraceCheckSpWp]: Trace formula consists of 164 conjuncts, 24 conjunts are in the unsatisfiable core [2022-04-08 14:24:42,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 14:24:42,578 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 14:24:43,002 INFO L272 TraceCheckUtils]: 0: Hoare triple {2287#true} call ULTIMATE.init(); {2287#true} is VALID [2022-04-08 14:24:43,006 INFO L290 TraceCheckUtils]: 1: Hoare triple {2287#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); {2287#true} is VALID [2022-04-08 14:24:43,007 INFO L290 TraceCheckUtils]: 2: Hoare triple {2287#true} assume true; {2287#true} is VALID [2022-04-08 14:24:43,007 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2287#true} {2287#true} #63#return; {2287#true} is VALID [2022-04-08 14:24:43,007 INFO L272 TraceCheckUtils]: 4: Hoare triple {2287#true} call #t~ret5 := main(); {2287#true} is VALID [2022-04-08 14:24:43,007 INFO L290 TraceCheckUtils]: 5: Hoare triple {2287#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; {2287#true} is VALID [2022-04-08 14:24:43,007 INFO L272 TraceCheckUtils]: 6: Hoare triple {2287#true} call assume_abort_if_not((if ~k~0 >= 0 && ~k~0 <= 10 then 1 else 0)); {2287#true} is VALID [2022-04-08 14:24:43,007 INFO L290 TraceCheckUtils]: 7: Hoare triple {2287#true} ~cond := #in~cond; {2287#true} is VALID [2022-04-08 14:24:43,007 INFO L290 TraceCheckUtils]: 8: Hoare triple {2287#true} assume !(0 == ~cond); {2287#true} is VALID [2022-04-08 14:24:43,007 INFO L290 TraceCheckUtils]: 9: Hoare triple {2287#true} assume true; {2287#true} is VALID [2022-04-08 14:24:43,008 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {2287#true} {2287#true} #53#return; {2287#true} is VALID [2022-04-08 14:24:43,008 INFO L272 TraceCheckUtils]: 11: Hoare triple {2287#true} call assume_abort_if_not((if ~k~0 <= 256 then 1 else 0)); {2287#true} is VALID [2022-04-08 14:24:43,008 INFO L290 TraceCheckUtils]: 12: Hoare triple {2287#true} ~cond := #in~cond; {2287#true} is VALID [2022-04-08 14:24:43,008 INFO L290 TraceCheckUtils]: 13: Hoare triple {2287#true} assume !(0 == ~cond); {2287#true} is VALID [2022-04-08 14:24:43,008 INFO L290 TraceCheckUtils]: 14: Hoare triple {2287#true} assume true; {2287#true} is VALID [2022-04-08 14:24:43,008 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {2287#true} {2287#true} #55#return; {2287#true} is VALID [2022-04-08 14:24:43,009 INFO L290 TraceCheckUtils]: 16: Hoare triple {2287#true} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {2340#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-08 14:24:43,009 INFO L290 TraceCheckUtils]: 17: Hoare triple {2340#(and (= main_~c~0 0) (= main_~y~0 0))} assume !false; {2340#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-08 14:24:43,009 INFO L272 TraceCheckUtils]: 18: Hoare triple {2340#(and (= main_~c~0 0) (= main_~y~0 0))} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {2287#true} is VALID [2022-04-08 14:24:43,009 INFO L290 TraceCheckUtils]: 19: Hoare triple {2287#true} ~cond := #in~cond; {2287#true} is VALID [2022-04-08 14:24:43,010 INFO L290 TraceCheckUtils]: 20: Hoare triple {2287#true} assume !(0 == ~cond); {2287#true} is VALID [2022-04-08 14:24:43,010 INFO L290 TraceCheckUtils]: 21: Hoare triple {2287#true} assume true; {2287#true} is VALID [2022-04-08 14:24:43,010 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {2287#true} {2340#(and (= main_~c~0 0) (= main_~y~0 0))} #57#return; {2340#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-08 14:24:43,011 INFO L290 TraceCheckUtils]: 23: Hoare triple {2340#(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 + ~x~0; {2362#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} is VALID [2022-04-08 14:24:43,011 INFO L290 TraceCheckUtils]: 24: Hoare triple {2362#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} assume !false; {2362#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} is VALID [2022-04-08 14:24:43,011 INFO L272 TraceCheckUtils]: 25: Hoare triple {2362#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {2287#true} is VALID [2022-04-08 14:24:43,011 INFO L290 TraceCheckUtils]: 26: Hoare triple {2287#true} ~cond := #in~cond; {2287#true} is VALID [2022-04-08 14:24:43,012 INFO L290 TraceCheckUtils]: 27: Hoare triple {2287#true} assume !(0 == ~cond); {2287#true} is VALID [2022-04-08 14:24:43,012 INFO L290 TraceCheckUtils]: 28: Hoare triple {2287#true} assume true; {2287#true} is VALID [2022-04-08 14:24:43,012 INFO L284 TraceCheckUtils]: 29: Hoare quadruple {2287#true} {2362#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} #57#return; {2362#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} is VALID [2022-04-08 14:24:43,013 INFO L290 TraceCheckUtils]: 30: Hoare triple {2362#(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 + ~x~0; {2384#(and (= (+ (- 1) main_~y~0) 1) (= main_~c~0 2))} is VALID [2022-04-08 14:24:43,013 INFO L290 TraceCheckUtils]: 31: Hoare triple {2384#(and (= (+ (- 1) main_~y~0) 1) (= main_~c~0 2))} assume !false; {2384#(and (= (+ (- 1) main_~y~0) 1) (= main_~c~0 2))} is VALID [2022-04-08 14:24:43,013 INFO L272 TraceCheckUtils]: 32: Hoare triple {2384#(and (= (+ (- 1) main_~y~0) 1) (= main_~c~0 2))} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {2287#true} is VALID [2022-04-08 14:24:43,013 INFO L290 TraceCheckUtils]: 33: Hoare triple {2287#true} ~cond := #in~cond; {2287#true} is VALID [2022-04-08 14:24:43,014 INFO L290 TraceCheckUtils]: 34: Hoare triple {2287#true} assume !(0 == ~cond); {2287#true} is VALID [2022-04-08 14:24:43,014 INFO L290 TraceCheckUtils]: 35: Hoare triple {2287#true} assume true; {2287#true} is VALID [2022-04-08 14:24:43,014 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {2287#true} {2384#(and (= (+ (- 1) main_~y~0) 1) (= main_~c~0 2))} #57#return; {2384#(and (= (+ (- 1) main_~y~0) 1) (= main_~c~0 2))} is VALID [2022-04-08 14:24:43,015 INFO L290 TraceCheckUtils]: 37: Hoare triple {2384#(and (= (+ (- 1) main_~y~0) 1) (= main_~c~0 2))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {2406#(and (= main_~y~0 3) (= main_~c~0 3))} is VALID [2022-04-08 14:24:43,015 INFO L290 TraceCheckUtils]: 38: Hoare triple {2406#(and (= main_~y~0 3) (= main_~c~0 3))} assume !false; {2406#(and (= main_~y~0 3) (= main_~c~0 3))} is VALID [2022-04-08 14:24:43,015 INFO L272 TraceCheckUtils]: 39: Hoare triple {2406#(and (= main_~y~0 3) (= main_~c~0 3))} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {2287#true} is VALID [2022-04-08 14:24:43,015 INFO L290 TraceCheckUtils]: 40: Hoare triple {2287#true} ~cond := #in~cond; {2287#true} is VALID [2022-04-08 14:24:43,016 INFO L290 TraceCheckUtils]: 41: Hoare triple {2287#true} assume !(0 == ~cond); {2287#true} is VALID [2022-04-08 14:24:43,016 INFO L290 TraceCheckUtils]: 42: Hoare triple {2287#true} assume true; {2287#true} is VALID [2022-04-08 14:24:43,016 INFO L284 TraceCheckUtils]: 43: Hoare quadruple {2287#true} {2406#(and (= main_~y~0 3) (= main_~c~0 3))} #57#return; {2406#(and (= main_~y~0 3) (= main_~c~0 3))} is VALID [2022-04-08 14:24:43,017 INFO L290 TraceCheckUtils]: 44: Hoare triple {2406#(and (= main_~y~0 3) (= main_~c~0 3))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {2428#(and (= 3 (+ (- 1) main_~y~0)) (< 3 main_~k~0) (<= main_~c~0 4))} is VALID [2022-04-08 14:24:43,017 INFO L290 TraceCheckUtils]: 45: Hoare triple {2428#(and (= 3 (+ (- 1) main_~y~0)) (< 3 main_~k~0) (<= main_~c~0 4))} assume !false; {2428#(and (= 3 (+ (- 1) main_~y~0)) (< 3 main_~k~0) (<= main_~c~0 4))} is VALID [2022-04-08 14:24:43,017 INFO L272 TraceCheckUtils]: 46: Hoare triple {2428#(and (= 3 (+ (- 1) main_~y~0)) (< 3 main_~k~0) (<= main_~c~0 4))} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {2287#true} is VALID [2022-04-08 14:24:43,017 INFO L290 TraceCheckUtils]: 47: Hoare triple {2287#true} ~cond := #in~cond; {2287#true} is VALID [2022-04-08 14:24:43,018 INFO L290 TraceCheckUtils]: 48: Hoare triple {2287#true} assume !(0 == ~cond); {2287#true} is VALID [2022-04-08 14:24:43,018 INFO L290 TraceCheckUtils]: 49: Hoare triple {2287#true} assume true; {2287#true} is VALID [2022-04-08 14:24:43,019 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {2287#true} {2428#(and (= 3 (+ (- 1) main_~y~0)) (< 3 main_~k~0) (<= main_~c~0 4))} #57#return; {2428#(and (= 3 (+ (- 1) main_~y~0)) (< 3 main_~k~0) (<= main_~c~0 4))} is VALID [2022-04-08 14:24:43,021 INFO L290 TraceCheckUtils]: 51: Hoare triple {2428#(and (= 3 (+ (- 1) main_~y~0)) (< 3 main_~k~0) (<= main_~c~0 4))} assume !(~c~0 < ~k~0); {2450#(and (= 3 (+ (- 1) main_~y~0)) (< 3 main_~k~0) (<= main_~k~0 4))} is VALID [2022-04-08 14:24:43,021 INFO L272 TraceCheckUtils]: 52: Hoare triple {2450#(and (= 3 (+ (- 1) main_~y~0)) (< 3 main_~k~0) (<= main_~k~0 4))} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {2287#true} is VALID [2022-04-08 14:24:43,021 INFO L290 TraceCheckUtils]: 53: Hoare triple {2287#true} ~cond := #in~cond; {2287#true} is VALID [2022-04-08 14:24:43,021 INFO L290 TraceCheckUtils]: 54: Hoare triple {2287#true} assume !(0 == ~cond); {2287#true} is VALID [2022-04-08 14:24:43,022 INFO L290 TraceCheckUtils]: 55: Hoare triple {2287#true} assume true; {2287#true} is VALID [2022-04-08 14:24:43,022 INFO L284 TraceCheckUtils]: 56: Hoare quadruple {2287#true} {2450#(and (= 3 (+ (- 1) main_~y~0)) (< 3 main_~k~0) (<= main_~k~0 4))} #59#return; {2450#(and (= 3 (+ (- 1) main_~y~0)) (< 3 main_~k~0) (<= main_~k~0 4))} is VALID [2022-04-08 14:24:43,023 INFO L272 TraceCheckUtils]: 57: Hoare triple {2450#(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)); {2469#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 14:24:43,023 INFO L290 TraceCheckUtils]: 58: Hoare triple {2469#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {2473#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 14:24:43,024 INFO L290 TraceCheckUtils]: 59: Hoare triple {2473#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {2288#false} is VALID [2022-04-08 14:24:43,024 INFO L290 TraceCheckUtils]: 60: Hoare triple {2288#false} assume !false; {2288#false} is VALID [2022-04-08 14:24:43,027 INFO L134 CoverageAnalysis]: Checked inductivity of 106 backedges. 12 proven. 30 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2022-04-08 14:24:43,027 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 14:24:43,367 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 14:24:43,367 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1996506784] [2022-04-08 14:24:43,367 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 14:24:43,367 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [173443317] [2022-04-08 14:24:43,367 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [173443317] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 14:24:43,367 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-08 14:24:43,367 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2022-04-08 14:24:43,368 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 14:24:43,368 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1720832060] [2022-04-08 14:24:43,368 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1720832060] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 14:24:43,368 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 14:24:43,368 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-04-08 14:24:43,368 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1912195287] [2022-04-08 14:24:43,368 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 14:24:43,368 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, (11), 2 states have call predecessors, (11), 1 states have return successors, (9), 7 states have call predecessors, (9), 7 states have call successors, (9) Word has length 61 [2022-04-08 14:24:43,369 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 14:24:43,369 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, (11), 2 states have call predecessors, (11), 1 states have return successors, (9), 7 states have call predecessors, (9), 7 states have call successors, (9) [2022-04-08 14:24:43,399 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 43 edges. 43 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 14:24:43,400 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-04-08 14:24:43,400 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 14:24:43,400 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-04-08 14:24:43,400 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2022-04-08 14:24:43,400 INFO L87 Difference]: Start difference. First operand 42 states and 47 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, (11), 2 states have call predecessors, (11), 1 states have return successors, (9), 7 states have call predecessors, (9), 7 states have call successors, (9) [2022-04-08 14:24:44,000 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:24:44,000 INFO L93 Difference]: Finished difference Result 51 states and 58 transitions. [2022-04-08 14:24:44,000 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-04-08 14:24:44,001 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, (11), 2 states have call predecessors, (11), 1 states have return successors, (9), 7 states have call predecessors, (9), 7 states have call successors, (9) Word has length 61 [2022-04-08 14:24:44,001 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 14:24:44,001 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, (11), 2 states have call predecessors, (11), 1 states have return successors, (9), 7 states have call predecessors, (9), 7 states have call successors, (9) [2022-04-08 14:24:44,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 54 transitions. [2022-04-08 14:24:44,003 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, (11), 2 states have call predecessors, (11), 1 states have return successors, (9), 7 states have call predecessors, (9), 7 states have call successors, (9) [2022-04-08 14:24:44,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 54 transitions. [2022-04-08 14:24:44,005 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 10 states and 54 transitions. [2022-04-08 14:24:44,045 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 54 edges. 54 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 14:24:44,046 INFO L225 Difference]: With dead ends: 51 [2022-04-08 14:24:44,046 INFO L226 Difference]: Without dead ends: 45 [2022-04-08 14:24:44,047 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 66 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=167, Unknown=0, NotChecked=0, Total=210 [2022-04-08 14:24:44,047 INFO L913 BasicCegarLoop]: 39 mSDtfsCounter, 2 mSDsluCounter, 195 mSDsCounter, 0 mSdLazyCounter, 161 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 234 SdHoareTripleChecker+Invalid, 162 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 161 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-08 14:24:44,047 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [2 Valid, 234 Invalid, 162 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 161 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-08 14:24:44,048 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2022-04-08 14:24:44,075 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2022-04-08 14:24:44,075 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 14:24:44,075 INFO L82 GeneralOperation]: Start isEquivalent. First operand 45 states. Second operand has 45 states, 28 states have (on average 1.0357142857142858) internal successors, (29), 28 states have internal predecessors, (29), 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 14:24:44,076 INFO L74 IsIncluded]: Start isIncluded. First operand 45 states. Second operand has 45 states, 28 states have (on average 1.0357142857142858) internal successors, (29), 28 states have internal predecessors, (29), 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 14:24:44,076 INFO L87 Difference]: Start difference. First operand 45 states. Second operand has 45 states, 28 states have (on average 1.0357142857142858) internal successors, (29), 28 states have internal predecessors, (29), 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 14:24:44,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:24:44,078 INFO L93 Difference]: Finished difference Result 45 states and 51 transitions. [2022-04-08 14:24:44,078 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 51 transitions. [2022-04-08 14:24:44,078 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 14:24:44,078 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 14:24:44,078 INFO L74 IsIncluded]: Start isIncluded. First operand has 45 states, 28 states have (on average 1.0357142857142858) internal successors, (29), 28 states have internal predecessors, (29), 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 45 states. [2022-04-08 14:24:44,078 INFO L87 Difference]: Start difference. First operand has 45 states, 28 states have (on average 1.0357142857142858) internal successors, (29), 28 states have internal predecessors, (29), 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 45 states. [2022-04-08 14:24:44,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:24:44,080 INFO L93 Difference]: Finished difference Result 45 states and 51 transitions. [2022-04-08 14:24:44,080 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 51 transitions. [2022-04-08 14:24:44,080 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 14:24:44,081 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 14:24:44,081 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 14:24:44,081 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 14:24:44,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 28 states have (on average 1.0357142857142858) internal successors, (29), 28 states have internal predecessors, (29), 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 14:24:44,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 51 transitions. [2022-04-08 14:24:44,083 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 51 transitions. Word has length 61 [2022-04-08 14:24:44,083 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 14:24:44,083 INFO L478 AbstractCegarLoop]: Abstraction has 45 states and 51 transitions. [2022-04-08 14:24:44,083 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, (11), 2 states have call predecessors, (11), 1 states have return successors, (9), 7 states have call predecessors, (9), 7 states have call successors, (9) [2022-04-08 14:24:44,083 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 45 states and 51 transitions. [2022-04-08 14:24:44,642 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 51 edges. 51 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 14:24:44,643 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 51 transitions. [2022-04-08 14:24:44,643 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2022-04-08 14:24:44,643 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 14:24:44,643 INFO L499 BasicCegarLoop]: trace histogram [8, 7, 7, 6, 6, 6, 5, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 14:24:44,649 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-04-08 14:24:44,847 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 14:24:44,848 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 14:24:44,848 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 14:24:44,848 INFO L85 PathProgramCache]: Analyzing trace with hash 1082774365, now seen corresponding path program 9 times [2022-04-08 14:24:44,848 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 14:24:44,848 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [939457621] [2022-04-08 14:24:44,848 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 14:24:44,849 INFO L85 PathProgramCache]: Analyzing trace with hash 1082774365, now seen corresponding path program 10 times [2022-04-08 14:24:44,849 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 14:24:44,849 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1194425882] [2022-04-08 14:24:44,849 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 14:24:44,849 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 14:24:44,875 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 14:24:44,875 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2097208480] [2022-04-08 14:24:44,875 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-08 14:24:44,875 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 14:24:44,875 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 14:24:44,878 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 14:24:44,879 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-04-08 14:24:44,921 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-08 14:24:44,921 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 14:24:44,922 INFO L263 TraceCheckSpWp]: Trace formula consists of 122 conjuncts, 28 conjunts are in the unsatisfiable core [2022-04-08 14:24:44,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 14:24:44,940 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 14:24:45,463 INFO L272 TraceCheckUtils]: 0: Hoare triple {2822#true} call ULTIMATE.init(); {2822#true} is VALID [2022-04-08 14:24:45,463 INFO L290 TraceCheckUtils]: 1: Hoare triple {2822#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); {2822#true} is VALID [2022-04-08 14:24:45,463 INFO L290 TraceCheckUtils]: 2: Hoare triple {2822#true} assume true; {2822#true} is VALID [2022-04-08 14:24:45,463 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2822#true} {2822#true} #63#return; {2822#true} is VALID [2022-04-08 14:24:45,464 INFO L272 TraceCheckUtils]: 4: Hoare triple {2822#true} call #t~ret5 := main(); {2822#true} is VALID [2022-04-08 14:24:45,464 INFO L290 TraceCheckUtils]: 5: Hoare triple {2822#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; {2822#true} is VALID [2022-04-08 14:24:45,464 INFO L272 TraceCheckUtils]: 6: Hoare triple {2822#true} call assume_abort_if_not((if ~k~0 >= 0 && ~k~0 <= 10 then 1 else 0)); {2822#true} is VALID [2022-04-08 14:24:45,464 INFO L290 TraceCheckUtils]: 7: Hoare triple {2822#true} ~cond := #in~cond; {2822#true} is VALID [2022-04-08 14:24:45,464 INFO L290 TraceCheckUtils]: 8: Hoare triple {2822#true} assume !(0 == ~cond); {2822#true} is VALID [2022-04-08 14:24:45,464 INFO L290 TraceCheckUtils]: 9: Hoare triple {2822#true} assume true; {2822#true} is VALID [2022-04-08 14:24:45,464 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {2822#true} {2822#true} #53#return; {2822#true} is VALID [2022-04-08 14:24:45,464 INFO L272 TraceCheckUtils]: 11: Hoare triple {2822#true} call assume_abort_if_not((if ~k~0 <= 256 then 1 else 0)); {2822#true} is VALID [2022-04-08 14:24:45,464 INFO L290 TraceCheckUtils]: 12: Hoare triple {2822#true} ~cond := #in~cond; {2822#true} is VALID [2022-04-08 14:24:45,465 INFO L290 TraceCheckUtils]: 13: Hoare triple {2822#true} assume !(0 == ~cond); {2822#true} is VALID [2022-04-08 14:24:45,465 INFO L290 TraceCheckUtils]: 14: Hoare triple {2822#true} assume true; {2822#true} is VALID [2022-04-08 14:24:45,465 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {2822#true} {2822#true} #55#return; {2822#true} is VALID [2022-04-08 14:24:45,465 INFO L290 TraceCheckUtils]: 16: Hoare triple {2822#true} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {2875#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-08 14:24:45,466 INFO L290 TraceCheckUtils]: 17: Hoare triple {2875#(and (= main_~c~0 0) (= main_~y~0 0))} assume !false; {2875#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-08 14:24:45,466 INFO L272 TraceCheckUtils]: 18: Hoare triple {2875#(and (= main_~c~0 0) (= main_~y~0 0))} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {2822#true} is VALID [2022-04-08 14:24:45,466 INFO L290 TraceCheckUtils]: 19: Hoare triple {2822#true} ~cond := #in~cond; {2822#true} is VALID [2022-04-08 14:24:45,466 INFO L290 TraceCheckUtils]: 20: Hoare triple {2822#true} assume !(0 == ~cond); {2822#true} is VALID [2022-04-08 14:24:45,466 INFO L290 TraceCheckUtils]: 21: Hoare triple {2822#true} assume true; {2822#true} is VALID [2022-04-08 14:24:45,472 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {2822#true} {2875#(and (= main_~c~0 0) (= main_~y~0 0))} #57#return; {2875#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-08 14:24:45,473 INFO L290 TraceCheckUtils]: 23: Hoare triple {2875#(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 + ~x~0; {2897#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} is VALID [2022-04-08 14:24:45,474 INFO L290 TraceCheckUtils]: 24: Hoare triple {2897#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} assume !false; {2897#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} is VALID [2022-04-08 14:24:45,474 INFO L272 TraceCheckUtils]: 25: Hoare triple {2897#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {2822#true} is VALID [2022-04-08 14:24:45,474 INFO L290 TraceCheckUtils]: 26: Hoare triple {2822#true} ~cond := #in~cond; {2822#true} is VALID [2022-04-08 14:24:45,474 INFO L290 TraceCheckUtils]: 27: Hoare triple {2822#true} assume !(0 == ~cond); {2822#true} is VALID [2022-04-08 14:24:45,474 INFO L290 TraceCheckUtils]: 28: Hoare triple {2822#true} assume true; {2822#true} is VALID [2022-04-08 14:24:45,475 INFO L284 TraceCheckUtils]: 29: Hoare quadruple {2822#true} {2897#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} #57#return; {2897#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} is VALID [2022-04-08 14:24:45,475 INFO L290 TraceCheckUtils]: 30: Hoare triple {2897#(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 + ~x~0; {2919#(and (= main_~y~0 2) (= (+ (- 1) main_~c~0) 1))} is VALID [2022-04-08 14:24:45,476 INFO L290 TraceCheckUtils]: 31: Hoare triple {2919#(and (= main_~y~0 2) (= (+ (- 1) main_~c~0) 1))} assume !false; {2919#(and (= main_~y~0 2) (= (+ (- 1) main_~c~0) 1))} is VALID [2022-04-08 14:24:45,476 INFO L272 TraceCheckUtils]: 32: Hoare triple {2919#(and (= main_~y~0 2) (= (+ (- 1) main_~c~0) 1))} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {2822#true} is VALID [2022-04-08 14:24:45,476 INFO L290 TraceCheckUtils]: 33: Hoare triple {2822#true} ~cond := #in~cond; {2822#true} is VALID [2022-04-08 14:24:45,476 INFO L290 TraceCheckUtils]: 34: Hoare triple {2822#true} assume !(0 == ~cond); {2822#true} is VALID [2022-04-08 14:24:45,476 INFO L290 TraceCheckUtils]: 35: Hoare triple {2822#true} assume true; {2822#true} is VALID [2022-04-08 14:24:45,477 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {2822#true} {2919#(and (= main_~y~0 2) (= (+ (- 1) main_~c~0) 1))} #57#return; {2919#(and (= main_~y~0 2) (= (+ (- 1) main_~c~0) 1))} is VALID [2022-04-08 14:24:45,477 INFO L290 TraceCheckUtils]: 37: Hoare triple {2919#(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 + ~x~0; {2941#(and (= 2 (+ (- 1) main_~y~0)) (= main_~c~0 3))} is VALID [2022-04-08 14:24:45,478 INFO L290 TraceCheckUtils]: 38: Hoare triple {2941#(and (= 2 (+ (- 1) main_~y~0)) (= main_~c~0 3))} assume !false; {2941#(and (= 2 (+ (- 1) main_~y~0)) (= main_~c~0 3))} is VALID [2022-04-08 14:24:45,478 INFO L272 TraceCheckUtils]: 39: Hoare triple {2941#(and (= 2 (+ (- 1) main_~y~0)) (= main_~c~0 3))} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {2822#true} is VALID [2022-04-08 14:24:45,478 INFO L290 TraceCheckUtils]: 40: Hoare triple {2822#true} ~cond := #in~cond; {2822#true} is VALID [2022-04-08 14:24:45,478 INFO L290 TraceCheckUtils]: 41: Hoare triple {2822#true} assume !(0 == ~cond); {2822#true} is VALID [2022-04-08 14:24:45,478 INFO L290 TraceCheckUtils]: 42: Hoare triple {2822#true} assume true; {2822#true} is VALID [2022-04-08 14:24:45,479 INFO L284 TraceCheckUtils]: 43: Hoare quadruple {2822#true} {2941#(and (= 2 (+ (- 1) main_~y~0)) (= main_~c~0 3))} #57#return; {2941#(and (= 2 (+ (- 1) main_~y~0)) (= main_~c~0 3))} is VALID [2022-04-08 14:24:45,479 INFO L290 TraceCheckUtils]: 44: Hoare triple {2941#(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 + ~x~0; {2963#(and (= (+ (- 1) main_~c~0) 3) (= (+ (- 2) main_~y~0) 2))} is VALID [2022-04-08 14:24:45,480 INFO L290 TraceCheckUtils]: 45: Hoare triple {2963#(and (= (+ (- 1) main_~c~0) 3) (= (+ (- 2) main_~y~0) 2))} assume !false; {2963#(and (= (+ (- 1) main_~c~0) 3) (= (+ (- 2) main_~y~0) 2))} is VALID [2022-04-08 14:24:45,480 INFO L272 TraceCheckUtils]: 46: Hoare triple {2963#(and (= (+ (- 1) main_~c~0) 3) (= (+ (- 2) main_~y~0) 2))} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {2822#true} is VALID [2022-04-08 14:24:45,480 INFO L290 TraceCheckUtils]: 47: Hoare triple {2822#true} ~cond := #in~cond; {2822#true} is VALID [2022-04-08 14:24:45,480 INFO L290 TraceCheckUtils]: 48: Hoare triple {2822#true} assume !(0 == ~cond); {2822#true} is VALID [2022-04-08 14:24:45,480 INFO L290 TraceCheckUtils]: 49: Hoare triple {2822#true} assume true; {2822#true} is VALID [2022-04-08 14:24:45,481 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {2822#true} {2963#(and (= (+ (- 1) main_~c~0) 3) (= (+ (- 2) main_~y~0) 2))} #57#return; {2963#(and (= (+ (- 1) main_~c~0) 3) (= (+ (- 2) main_~y~0) 2))} is VALID [2022-04-08 14:24:45,481 INFO L290 TraceCheckUtils]: 51: Hoare triple {2963#(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 + ~x~0; {2985#(and (<= main_~c~0 5) (= 5 main_~y~0) (< 4 main_~k~0))} is VALID [2022-04-08 14:24:45,482 INFO L290 TraceCheckUtils]: 52: Hoare triple {2985#(and (<= main_~c~0 5) (= 5 main_~y~0) (< 4 main_~k~0))} assume !false; {2985#(and (<= main_~c~0 5) (= 5 main_~y~0) (< 4 main_~k~0))} is VALID [2022-04-08 14:24:45,482 INFO L272 TraceCheckUtils]: 53: Hoare triple {2985#(and (<= main_~c~0 5) (= 5 main_~y~0) (< 4 main_~k~0))} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {2822#true} is VALID [2022-04-08 14:24:45,482 INFO L290 TraceCheckUtils]: 54: Hoare triple {2822#true} ~cond := #in~cond; {2822#true} is VALID [2022-04-08 14:24:45,483 INFO L290 TraceCheckUtils]: 55: Hoare triple {2822#true} assume !(0 == ~cond); {2822#true} is VALID [2022-04-08 14:24:45,483 INFO L290 TraceCheckUtils]: 56: Hoare triple {2822#true} assume true; {2822#true} is VALID [2022-04-08 14:24:45,484 INFO L284 TraceCheckUtils]: 57: Hoare quadruple {2822#true} {2985#(and (<= main_~c~0 5) (= 5 main_~y~0) (< 4 main_~k~0))} #57#return; {2985#(and (<= main_~c~0 5) (= 5 main_~y~0) (< 4 main_~k~0))} is VALID [2022-04-08 14:24:45,486 INFO L290 TraceCheckUtils]: 58: Hoare triple {2985#(and (<= main_~c~0 5) (= 5 main_~y~0) (< 4 main_~k~0))} assume !(~c~0 < ~k~0); {3007#(and (<= main_~k~0 5) (= 5 main_~y~0) (< 4 main_~k~0))} is VALID [2022-04-08 14:24:45,489 INFO L272 TraceCheckUtils]: 59: Hoare triple {3007#(and (<= main_~k~0 5) (= 5 main_~y~0) (< 4 main_~k~0))} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {2822#true} is VALID [2022-04-08 14:24:45,489 INFO L290 TraceCheckUtils]: 60: Hoare triple {2822#true} ~cond := #in~cond; {2822#true} is VALID [2022-04-08 14:24:45,489 INFO L290 TraceCheckUtils]: 61: Hoare triple {2822#true} assume !(0 == ~cond); {2822#true} is VALID [2022-04-08 14:24:45,490 INFO L290 TraceCheckUtils]: 62: Hoare triple {2822#true} assume true; {2822#true} is VALID [2022-04-08 14:24:45,496 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {2822#true} {3007#(and (<= main_~k~0 5) (= 5 main_~y~0) (< 4 main_~k~0))} #59#return; {3007#(and (<= main_~k~0 5) (= 5 main_~y~0) (< 4 main_~k~0))} is VALID [2022-04-08 14:24:45,497 INFO L272 TraceCheckUtils]: 64: Hoare triple {3007#(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)); {3026#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 14:24:45,499 INFO L290 TraceCheckUtils]: 65: Hoare triple {3026#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {3030#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 14:24:45,499 INFO L290 TraceCheckUtils]: 66: Hoare triple {3030#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {2823#false} is VALID [2022-04-08 14:24:45,499 INFO L290 TraceCheckUtils]: 67: Hoare triple {2823#false} assume !false; {2823#false} is VALID [2022-04-08 14:24:45,500 INFO L134 CoverageAnalysis]: Checked inductivity of 147 backedges. 14 proven. 45 refuted. 0 times theorem prover too weak. 88 trivial. 0 not checked. [2022-04-08 14:24:45,500 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 14:24:45,831 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 14:24:45,831 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1194425882] [2022-04-08 14:24:45,831 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 14:24:45,831 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2097208480] [2022-04-08 14:24:45,831 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2097208480] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 14:24:45,831 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-08 14:24:45,832 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2022-04-08 14:24:45,832 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 14:24:45,832 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [939457621] [2022-04-08 14:24:45,832 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [939457621] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 14:24:45,832 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 14:24:45,832 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-04-08 14:24:45,832 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1859941439] [2022-04-08 14:24:45,832 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 14:24:45,833 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, (12), 2 states have call predecessors, (12), 1 states have return successors, (10), 8 states have call predecessors, (10), 8 states have call successors, (10) Word has length 68 [2022-04-08 14:24:45,833 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 14:24:45,833 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, (12), 2 states have call predecessors, (12), 1 states have return successors, (10), 8 states have call predecessors, (10), 8 states have call successors, (10) [2022-04-08 14:24:45,870 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 47 edges. 47 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 14:24:45,870 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-04-08 14:24:45,871 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 14:24:45,871 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-04-08 14:24:45,871 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=146, Unknown=0, NotChecked=0, Total=182 [2022-04-08 14:24:45,872 INFO L87 Difference]: Start difference. First operand 45 states and 51 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, (12), 2 states have call predecessors, (12), 1 states have return successors, (10), 8 states have call predecessors, (10), 8 states have call successors, (10) [2022-04-08 14:24:46,560 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:24:46,560 INFO L93 Difference]: Finished difference Result 54 states and 62 transitions. [2022-04-08 14:24:46,560 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-04-08 14:24:46,560 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, (12), 2 states have call predecessors, (12), 1 states have return successors, (10), 8 states have call predecessors, (10), 8 states have call successors, (10) Word has length 68 [2022-04-08 14:24:46,561 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 14:24:46,561 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, (12), 2 states have call predecessors, (12), 1 states have return successors, (10), 8 states have call predecessors, (10), 8 states have call successors, (10) [2022-04-08 14:24:46,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 58 transitions. [2022-04-08 14:24:46,563 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, (12), 2 states have call predecessors, (12), 1 states have return successors, (10), 8 states have call predecessors, (10), 8 states have call successors, (10) [2022-04-08 14:24:46,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 58 transitions. [2022-04-08 14:24:46,565 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 11 states and 58 transitions. [2022-04-08 14:24:46,623 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 58 edges. 58 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 14:24:46,624 INFO L225 Difference]: With dead ends: 54 [2022-04-08 14:24:46,625 INFO L226 Difference]: Without dead ends: 48 [2022-04-08 14:24:46,625 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 72 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=46, Invalid=194, Unknown=0, NotChecked=0, Total=240 [2022-04-08 14:24:46,626 INFO L913 BasicCegarLoop]: 42 mSDtfsCounter, 2 mSDsluCounter, 229 mSDsCounter, 0 mSdLazyCounter, 207 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 271 SdHoareTripleChecker+Invalid, 208 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 207 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-04-08 14:24:46,626 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [2 Valid, 271 Invalid, 208 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 207 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-04-08 14:24:46,626 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2022-04-08 14:24:46,663 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2022-04-08 14:24:46,663 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 14:24:46,663 INFO L82 GeneralOperation]: Start isEquivalent. First operand 48 states. Second operand has 48 states, 30 states have (on average 1.0333333333333334) internal successors, (31), 30 states have internal predecessors, (31), 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 14:24:46,663 INFO L74 IsIncluded]: Start isIncluded. First operand 48 states. Second operand has 48 states, 30 states have (on average 1.0333333333333334) internal successors, (31), 30 states have internal predecessors, (31), 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 14:24:46,664 INFO L87 Difference]: Start difference. First operand 48 states. Second operand has 48 states, 30 states have (on average 1.0333333333333334) internal successors, (31), 30 states have internal predecessors, (31), 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 14:24:46,666 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:24:46,666 INFO L93 Difference]: Finished difference Result 48 states and 55 transitions. [2022-04-08 14:24:46,666 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 55 transitions. [2022-04-08 14:24:46,666 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 14:24:46,666 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 14:24:46,667 INFO L74 IsIncluded]: Start isIncluded. First operand has 48 states, 30 states have (on average 1.0333333333333334) internal successors, (31), 30 states have internal predecessors, (31), 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 48 states. [2022-04-08 14:24:46,667 INFO L87 Difference]: Start difference. First operand has 48 states, 30 states have (on average 1.0333333333333334) internal successors, (31), 30 states have internal predecessors, (31), 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 48 states. [2022-04-08 14:24:46,669 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:24:46,669 INFO L93 Difference]: Finished difference Result 48 states and 55 transitions. [2022-04-08 14:24:46,669 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 55 transitions. [2022-04-08 14:24:46,669 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 14:24:46,669 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 14:24:46,669 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 14:24:46,669 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 14:24:46,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 30 states have (on average 1.0333333333333334) internal successors, (31), 30 states have internal predecessors, (31), 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 14:24:46,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 55 transitions. [2022-04-08 14:24:46,671 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 55 transitions. Word has length 68 [2022-04-08 14:24:46,672 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 14:24:46,672 INFO L478 AbstractCegarLoop]: Abstraction has 48 states and 55 transitions. [2022-04-08 14:24:46,673 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, (12), 2 states have call predecessors, (12), 1 states have return successors, (10), 8 states have call predecessors, (10), 8 states have call successors, (10) [2022-04-08 14:24:46,673 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 48 states and 55 transitions. [2022-04-08 14:24:47,236 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 55 edges. 55 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 14:24:47,237 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 55 transitions. [2022-04-08 14:24:47,237 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2022-04-08 14:24:47,237 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 14:24:47,237 INFO L499 BasicCegarLoop]: trace histogram [9, 8, 8, 7, 7, 7, 6, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 14:24:47,255 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2022-04-08 14:24:47,438 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 14:24:47,438 INFO L403 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 14:24:47,439 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 14:24:47,439 INFO L85 PathProgramCache]: Analyzing trace with hash -1692754003, now seen corresponding path program 11 times [2022-04-08 14:24:47,439 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 14:24:47,439 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1254288850] [2022-04-08 14:24:47,439 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 14:24:47,439 INFO L85 PathProgramCache]: Analyzing trace with hash -1692754003, now seen corresponding path program 12 times [2022-04-08 14:24:47,439 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 14:24:47,440 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1021680599] [2022-04-08 14:24:47,440 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 14:24:47,440 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 14:24:47,461 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 14:24:47,461 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [997885025] [2022-04-08 14:24:47,461 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-08 14:24:47,461 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 14:24:47,462 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 14:24:47,462 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 14:24:47,470 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-04-08 14:24:49,264 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2022-04-08 14:24:49,265 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 14:24:49,269 INFO L263 TraceCheckSpWp]: Trace formula consists of 198 conjuncts, 33 conjunts are in the unsatisfiable core [2022-04-08 14:24:49,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 14:24:49,282 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 14:24:49,836 INFO L272 TraceCheckUtils]: 0: Hoare triple {3397#true} call ULTIMATE.init(); {3397#true} is VALID [2022-04-08 14:24:49,836 INFO L290 TraceCheckUtils]: 1: Hoare triple {3397#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); {3397#true} is VALID [2022-04-08 14:24:49,836 INFO L290 TraceCheckUtils]: 2: Hoare triple {3397#true} assume true; {3397#true} is VALID [2022-04-08 14:24:49,836 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3397#true} {3397#true} #63#return; {3397#true} is VALID [2022-04-08 14:24:49,836 INFO L272 TraceCheckUtils]: 4: Hoare triple {3397#true} call #t~ret5 := main(); {3397#true} is VALID [2022-04-08 14:24:49,837 INFO L290 TraceCheckUtils]: 5: Hoare triple {3397#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; {3397#true} is VALID [2022-04-08 14:24:49,837 INFO L272 TraceCheckUtils]: 6: Hoare triple {3397#true} call assume_abort_if_not((if ~k~0 >= 0 && ~k~0 <= 10 then 1 else 0)); {3397#true} is VALID [2022-04-08 14:24:49,837 INFO L290 TraceCheckUtils]: 7: Hoare triple {3397#true} ~cond := #in~cond; {3397#true} is VALID [2022-04-08 14:24:49,837 INFO L290 TraceCheckUtils]: 8: Hoare triple {3397#true} assume !(0 == ~cond); {3397#true} is VALID [2022-04-08 14:24:49,837 INFO L290 TraceCheckUtils]: 9: Hoare triple {3397#true} assume true; {3397#true} is VALID [2022-04-08 14:24:49,837 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {3397#true} {3397#true} #53#return; {3397#true} is VALID [2022-04-08 14:24:49,837 INFO L272 TraceCheckUtils]: 11: Hoare triple {3397#true} call assume_abort_if_not((if ~k~0 <= 256 then 1 else 0)); {3397#true} is VALID [2022-04-08 14:24:49,837 INFO L290 TraceCheckUtils]: 12: Hoare triple {3397#true} ~cond := #in~cond; {3397#true} is VALID [2022-04-08 14:24:49,838 INFO L290 TraceCheckUtils]: 13: Hoare triple {3397#true} assume !(0 == ~cond); {3397#true} is VALID [2022-04-08 14:24:49,838 INFO L290 TraceCheckUtils]: 14: Hoare triple {3397#true} assume true; {3397#true} is VALID [2022-04-08 14:24:49,838 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {3397#true} {3397#true} #55#return; {3397#true} is VALID [2022-04-08 14:24:49,838 INFO L290 TraceCheckUtils]: 16: Hoare triple {3397#true} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {3450#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-08 14:24:49,839 INFO L290 TraceCheckUtils]: 17: Hoare triple {3450#(and (= main_~c~0 0) (= main_~y~0 0))} assume !false; {3450#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-08 14:24:49,839 INFO L272 TraceCheckUtils]: 18: Hoare triple {3450#(and (= main_~c~0 0) (= main_~y~0 0))} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {3397#true} is VALID [2022-04-08 14:24:49,839 INFO L290 TraceCheckUtils]: 19: Hoare triple {3397#true} ~cond := #in~cond; {3397#true} is VALID [2022-04-08 14:24:49,840 INFO L290 TraceCheckUtils]: 20: Hoare triple {3397#true} assume !(0 == ~cond); {3397#true} is VALID [2022-04-08 14:24:49,840 INFO L290 TraceCheckUtils]: 21: Hoare triple {3397#true} assume true; {3397#true} is VALID [2022-04-08 14:24:49,840 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {3397#true} {3450#(and (= main_~c~0 0) (= main_~y~0 0))} #57#return; {3450#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-08 14:24:49,841 INFO L290 TraceCheckUtils]: 23: Hoare triple {3450#(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 + ~x~0; {3472#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} is VALID [2022-04-08 14:24:49,842 INFO L290 TraceCheckUtils]: 24: Hoare triple {3472#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} assume !false; {3472#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} is VALID [2022-04-08 14:24:49,842 INFO L272 TraceCheckUtils]: 25: Hoare triple {3472#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {3397#true} is VALID [2022-04-08 14:24:49,842 INFO L290 TraceCheckUtils]: 26: Hoare triple {3397#true} ~cond := #in~cond; {3397#true} is VALID [2022-04-08 14:24:49,842 INFO L290 TraceCheckUtils]: 27: Hoare triple {3397#true} assume !(0 == ~cond); {3397#true} is VALID [2022-04-08 14:24:49,842 INFO L290 TraceCheckUtils]: 28: Hoare triple {3397#true} assume true; {3397#true} is VALID [2022-04-08 14:24:49,843 INFO L284 TraceCheckUtils]: 29: Hoare quadruple {3397#true} {3472#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} #57#return; {3472#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} is VALID [2022-04-08 14:24:49,843 INFO L290 TraceCheckUtils]: 30: Hoare triple {3472#(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 + ~x~0; {3494#(and (= main_~y~0 2) (= 0 (+ (- 2) main_~c~0)) (< main_~c~0 (+ main_~k~0 1)))} is VALID [2022-04-08 14:24:49,844 INFO L290 TraceCheckUtils]: 31: Hoare triple {3494#(and (= main_~y~0 2) (= 0 (+ (- 2) main_~c~0)) (< main_~c~0 (+ main_~k~0 1)))} assume !false; {3494#(and (= main_~y~0 2) (= 0 (+ (- 2) main_~c~0)) (< main_~c~0 (+ main_~k~0 1)))} is VALID [2022-04-08 14:24:49,844 INFO L272 TraceCheckUtils]: 32: Hoare triple {3494#(and (= main_~y~0 2) (= 0 (+ (- 2) main_~c~0)) (< main_~c~0 (+ main_~k~0 1)))} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {3397#true} is VALID [2022-04-08 14:24:49,844 INFO L290 TraceCheckUtils]: 33: Hoare triple {3397#true} ~cond := #in~cond; {3397#true} is VALID [2022-04-08 14:24:49,844 INFO L290 TraceCheckUtils]: 34: Hoare triple {3397#true} assume !(0 == ~cond); {3397#true} is VALID [2022-04-08 14:24:49,844 INFO L290 TraceCheckUtils]: 35: Hoare triple {3397#true} assume true; {3397#true} is VALID [2022-04-08 14:24:49,845 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {3397#true} {3494#(and (= main_~y~0 2) (= 0 (+ (- 2) main_~c~0)) (< main_~c~0 (+ main_~k~0 1)))} #57#return; {3494#(and (= main_~y~0 2) (= 0 (+ (- 2) main_~c~0)) (< main_~c~0 (+ main_~k~0 1)))} is VALID [2022-04-08 14:24:49,846 INFO L290 TraceCheckUtils]: 37: Hoare triple {3494#(and (= main_~y~0 2) (= 0 (+ (- 2) main_~c~0)) (< main_~c~0 (+ main_~k~0 1)))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {3516#(and (= (+ main_~c~0 (- 3)) 0) (= main_~y~0 3) (< main_~c~0 (+ main_~k~0 2)))} is VALID [2022-04-08 14:24:49,847 INFO L290 TraceCheckUtils]: 38: Hoare triple {3516#(and (= (+ main_~c~0 (- 3)) 0) (= main_~y~0 3) (< main_~c~0 (+ main_~k~0 2)))} assume !false; {3516#(and (= (+ main_~c~0 (- 3)) 0) (= main_~y~0 3) (< main_~c~0 (+ main_~k~0 2)))} is VALID [2022-04-08 14:24:49,847 INFO L272 TraceCheckUtils]: 39: Hoare triple {3516#(and (= (+ main_~c~0 (- 3)) 0) (= main_~y~0 3) (< main_~c~0 (+ main_~k~0 2)))} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {3397#true} is VALID [2022-04-08 14:24:49,847 INFO L290 TraceCheckUtils]: 40: Hoare triple {3397#true} ~cond := #in~cond; {3397#true} is VALID [2022-04-08 14:24:49,847 INFO L290 TraceCheckUtils]: 41: Hoare triple {3397#true} assume !(0 == ~cond); {3397#true} is VALID [2022-04-08 14:24:49,847 INFO L290 TraceCheckUtils]: 42: Hoare triple {3397#true} assume true; {3397#true} is VALID [2022-04-08 14:24:49,848 INFO L284 TraceCheckUtils]: 43: Hoare quadruple {3397#true} {3516#(and (= (+ main_~c~0 (- 3)) 0) (= main_~y~0 3) (< main_~c~0 (+ main_~k~0 2)))} #57#return; {3516#(and (= (+ main_~c~0 (- 3)) 0) (= main_~y~0 3) (< main_~c~0 (+ main_~k~0 2)))} is VALID [2022-04-08 14:24:49,848 INFO L290 TraceCheckUtils]: 44: Hoare triple {3516#(and (= (+ main_~c~0 (- 3)) 0) (= main_~y~0 3) (< main_~c~0 (+ main_~k~0 2)))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {3538#(and (< main_~c~0 (+ main_~k~0 3)) (= 3 (+ (- 1) main_~y~0)) (= (+ main_~c~0 (- 4)) 0))} is VALID [2022-04-08 14:24:49,849 INFO L290 TraceCheckUtils]: 45: Hoare triple {3538#(and (< main_~c~0 (+ main_~k~0 3)) (= 3 (+ (- 1) main_~y~0)) (= (+ main_~c~0 (- 4)) 0))} assume !false; {3538#(and (< main_~c~0 (+ main_~k~0 3)) (= 3 (+ (- 1) main_~y~0)) (= (+ main_~c~0 (- 4)) 0))} is VALID [2022-04-08 14:24:49,849 INFO L272 TraceCheckUtils]: 46: Hoare triple {3538#(and (< main_~c~0 (+ main_~k~0 3)) (= 3 (+ (- 1) main_~y~0)) (= (+ main_~c~0 (- 4)) 0))} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {3397#true} is VALID [2022-04-08 14:24:49,849 INFO L290 TraceCheckUtils]: 47: Hoare triple {3397#true} ~cond := #in~cond; {3397#true} is VALID [2022-04-08 14:24:49,849 INFO L290 TraceCheckUtils]: 48: Hoare triple {3397#true} assume !(0 == ~cond); {3397#true} is VALID [2022-04-08 14:24:49,849 INFO L290 TraceCheckUtils]: 49: Hoare triple {3397#true} assume true; {3397#true} is VALID [2022-04-08 14:24:49,850 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {3397#true} {3538#(and (< main_~c~0 (+ main_~k~0 3)) (= 3 (+ (- 1) main_~y~0)) (= (+ main_~c~0 (- 4)) 0))} #57#return; {3538#(and (< main_~c~0 (+ main_~k~0 3)) (= 3 (+ (- 1) main_~y~0)) (= (+ main_~c~0 (- 4)) 0))} is VALID [2022-04-08 14:24:49,850 INFO L290 TraceCheckUtils]: 51: Hoare triple {3538#(and (< main_~c~0 (+ main_~k~0 3)) (= 3 (+ (- 1) main_~y~0)) (= (+ main_~c~0 (- 4)) 0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {3560#(and (< 1 main_~k~0) (= (+ (- 2) main_~y~0) 3) (= 5 main_~c~0))} is VALID [2022-04-08 14:24:49,851 INFO L290 TraceCheckUtils]: 52: Hoare triple {3560#(and (< 1 main_~k~0) (= (+ (- 2) main_~y~0) 3) (= 5 main_~c~0))} assume !false; {3560#(and (< 1 main_~k~0) (= (+ (- 2) main_~y~0) 3) (= 5 main_~c~0))} is VALID [2022-04-08 14:24:49,851 INFO L272 TraceCheckUtils]: 53: Hoare triple {3560#(and (< 1 main_~k~0) (= (+ (- 2) main_~y~0) 3) (= 5 main_~c~0))} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {3397#true} is VALID [2022-04-08 14:24:49,851 INFO L290 TraceCheckUtils]: 54: Hoare triple {3397#true} ~cond := #in~cond; {3397#true} is VALID [2022-04-08 14:24:49,851 INFO L290 TraceCheckUtils]: 55: Hoare triple {3397#true} assume !(0 == ~cond); {3397#true} is VALID [2022-04-08 14:24:49,851 INFO L290 TraceCheckUtils]: 56: Hoare triple {3397#true} assume true; {3397#true} is VALID [2022-04-08 14:24:49,852 INFO L284 TraceCheckUtils]: 57: Hoare quadruple {3397#true} {3560#(and (< 1 main_~k~0) (= (+ (- 2) main_~y~0) 3) (= 5 main_~c~0))} #57#return; {3560#(and (< 1 main_~k~0) (= (+ (- 2) main_~y~0) 3) (= 5 main_~c~0))} is VALID [2022-04-08 14:24:49,852 INFO L290 TraceCheckUtils]: 58: Hoare triple {3560#(and (< 1 main_~k~0) (= (+ (- 2) main_~y~0) 3) (= 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 + ~x~0; {3582#(and (= main_~y~0 6) (< 5 main_~k~0) (<= main_~c~0 6))} is VALID [2022-04-08 14:24:49,852 INFO L290 TraceCheckUtils]: 59: Hoare triple {3582#(and (= main_~y~0 6) (< 5 main_~k~0) (<= main_~c~0 6))} assume !false; {3582#(and (= main_~y~0 6) (< 5 main_~k~0) (<= main_~c~0 6))} is VALID [2022-04-08 14:24:49,852 INFO L272 TraceCheckUtils]: 60: Hoare triple {3582#(and (= main_~y~0 6) (< 5 main_~k~0) (<= main_~c~0 6))} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {3397#true} is VALID [2022-04-08 14:24:49,853 INFO L290 TraceCheckUtils]: 61: Hoare triple {3397#true} ~cond := #in~cond; {3397#true} is VALID [2022-04-08 14:24:49,853 INFO L290 TraceCheckUtils]: 62: Hoare triple {3397#true} assume !(0 == ~cond); {3397#true} is VALID [2022-04-08 14:24:49,853 INFO L290 TraceCheckUtils]: 63: Hoare triple {3397#true} assume true; {3397#true} is VALID [2022-04-08 14:24:49,853 INFO L284 TraceCheckUtils]: 64: Hoare quadruple {3397#true} {3582#(and (= main_~y~0 6) (< 5 main_~k~0) (<= main_~c~0 6))} #57#return; {3582#(and (= main_~y~0 6) (< 5 main_~k~0) (<= main_~c~0 6))} is VALID [2022-04-08 14:24:49,854 INFO L290 TraceCheckUtils]: 65: Hoare triple {3582#(and (= main_~y~0 6) (< 5 main_~k~0) (<= main_~c~0 6))} assume !(~c~0 < ~k~0); {3604#(and (= main_~y~0 6) (<= main_~k~0 6) (< 5 main_~k~0))} is VALID [2022-04-08 14:24:49,854 INFO L272 TraceCheckUtils]: 66: Hoare triple {3604#(and (= main_~y~0 6) (<= main_~k~0 6) (< 5 main_~k~0))} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {3397#true} is VALID [2022-04-08 14:24:49,854 INFO L290 TraceCheckUtils]: 67: Hoare triple {3397#true} ~cond := #in~cond; {3397#true} is VALID [2022-04-08 14:24:49,854 INFO L290 TraceCheckUtils]: 68: Hoare triple {3397#true} assume !(0 == ~cond); {3397#true} is VALID [2022-04-08 14:24:49,854 INFO L290 TraceCheckUtils]: 69: Hoare triple {3397#true} assume true; {3397#true} is VALID [2022-04-08 14:24:49,855 INFO L284 TraceCheckUtils]: 70: Hoare quadruple {3397#true} {3604#(and (= main_~y~0 6) (<= main_~k~0 6) (< 5 main_~k~0))} #59#return; {3604#(and (= main_~y~0 6) (<= main_~k~0 6) (< 5 main_~k~0))} is VALID [2022-04-08 14:24:49,856 INFO L272 TraceCheckUtils]: 71: Hoare triple {3604#(and (= main_~y~0 6) (<= main_~k~0 6) (< 5 main_~k~0))} call __VERIFIER_assert((if ~k~0 * ~y~0 == ~y~0 * ~y~0 then 1 else 0)); {3623#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 14:24:49,857 INFO L290 TraceCheckUtils]: 72: Hoare triple {3623#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {3627#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 14:24:49,857 INFO L290 TraceCheckUtils]: 73: Hoare triple {3627#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {3398#false} is VALID [2022-04-08 14:24:49,857 INFO L290 TraceCheckUtils]: 74: Hoare triple {3398#false} assume !false; {3398#false} is VALID [2022-04-08 14:24:49,858 INFO L134 CoverageAnalysis]: Checked inductivity of 195 backedges. 16 proven. 63 refuted. 0 times theorem prover too weak. 116 trivial. 0 not checked. [2022-04-08 14:24:49,858 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 14:24:50,525 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 14:24:50,526 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1021680599] [2022-04-08 14:24:50,526 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 14:24:50,526 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [997885025] [2022-04-08 14:24:50,526 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [997885025] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 14:24:50,526 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-08 14:24:50,526 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2022-04-08 14:24:50,526 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 14:24:50,526 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1254288850] [2022-04-08 14:24:50,527 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1254288850] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 14:24:50,527 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 14:24:50,527 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-04-08 14:24:50,527 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [814057910] [2022-04-08 14:24:50,527 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 14:24:50,527 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, (13), 2 states have call predecessors, (13), 1 states have return successors, (11), 9 states have call predecessors, (11), 9 states have call successors, (11) Word has length 75 [2022-04-08 14:24:50,528 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 14:24:50,528 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, (13), 2 states have call predecessors, (13), 1 states have return successors, (11), 9 states have call predecessors, (11), 9 states have call successors, (11) [2022-04-08 14:24:50,575 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 51 edges. 51 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 14:24:50,575 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-04-08 14:24:50,575 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 14:24:50,575 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-04-08 14:24:50,576 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=270, Unknown=0, NotChecked=0, Total=342 [2022-04-08 14:24:50,576 INFO L87 Difference]: Start difference. First operand 48 states and 55 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, (13), 2 states have call predecessors, (13), 1 states have return successors, (11), 9 states have call predecessors, (11), 9 states have call successors, (11) [2022-04-08 14:24:51,490 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:24:51,490 INFO L93 Difference]: Finished difference Result 57 states and 66 transitions. [2022-04-08 14:24:51,490 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-04-08 14:24:51,491 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, (13), 2 states have call predecessors, (13), 1 states have return successors, (11), 9 states have call predecessors, (11), 9 states have call successors, (11) Word has length 75 [2022-04-08 14:24:51,491 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 14:24:51,491 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, (13), 2 states have call predecessors, (13), 1 states have return successors, (11), 9 states have call predecessors, (11), 9 states have call successors, (11) [2022-04-08 14:24:51,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 62 transitions. [2022-04-08 14:24:51,493 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, (13), 2 states have call predecessors, (13), 1 states have return successors, (11), 9 states have call predecessors, (11), 9 states have call successors, (11) [2022-04-08 14:24:51,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 62 transitions. [2022-04-08 14:24:51,495 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 12 states and 62 transitions. [2022-04-08 14:24:51,555 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 62 edges. 62 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 14:24:51,556 INFO L225 Difference]: With dead ends: 57 [2022-04-08 14:24:51,557 INFO L226 Difference]: Without dead ends: 51 [2022-04-08 14:24:51,557 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 102 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=82, Invalid=338, Unknown=0, NotChecked=0, Total=420 [2022-04-08 14:24:51,558 INFO L913 BasicCegarLoop]: 45 mSDtfsCounter, 2 mSDsluCounter, 257 mSDsCounter, 0 mSdLazyCounter, 267 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 302 SdHoareTripleChecker+Invalid, 268 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 267 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-04-08 14:24:51,558 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [2 Valid, 302 Invalid, 268 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 267 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-04-08 14:24:51,558 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2022-04-08 14:24:51,605 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2022-04-08 14:24:51,605 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 14:24:51,606 INFO L82 GeneralOperation]: Start isEquivalent. First operand 51 states. Second operand has 51 states, 32 states have (on average 1.03125) internal successors, (33), 32 states have internal predecessors, (33), 14 states have call successors, (14), 6 states have call predecessors, (14), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2022-04-08 14:24:51,608 INFO L74 IsIncluded]: Start isIncluded. First operand 51 states. Second operand has 51 states, 32 states have (on average 1.03125) internal successors, (33), 32 states have internal predecessors, (33), 14 states have call successors, (14), 6 states have call predecessors, (14), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2022-04-08 14:24:51,608 INFO L87 Difference]: Start difference. First operand 51 states. Second operand has 51 states, 32 states have (on average 1.03125) internal successors, (33), 32 states have internal predecessors, (33), 14 states have call successors, (14), 6 states have call predecessors, (14), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2022-04-08 14:24:51,610 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:24:51,610 INFO L93 Difference]: Finished difference Result 51 states and 59 transitions. [2022-04-08 14:24:51,610 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 59 transitions. [2022-04-08 14:24:51,611 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 14:24:51,611 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 14:24:51,611 INFO L74 IsIncluded]: Start isIncluded. First operand has 51 states, 32 states have (on average 1.03125) internal successors, (33), 32 states have internal predecessors, (33), 14 states have call successors, (14), 6 states have call predecessors, (14), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) Second operand 51 states. [2022-04-08 14:24:51,611 INFO L87 Difference]: Start difference. First operand has 51 states, 32 states have (on average 1.03125) internal successors, (33), 32 states have internal predecessors, (33), 14 states have call successors, (14), 6 states have call predecessors, (14), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) Second operand 51 states. [2022-04-08 14:24:51,613 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:24:51,613 INFO L93 Difference]: Finished difference Result 51 states and 59 transitions. [2022-04-08 14:24:51,613 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 59 transitions. [2022-04-08 14:24:51,614 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 14:24:51,614 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 14:24:51,614 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 14:24:51,614 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 14:24:51,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 32 states have (on average 1.03125) internal successors, (33), 32 states have internal predecessors, (33), 14 states have call successors, (14), 6 states have call predecessors, (14), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2022-04-08 14:24:51,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 59 transitions. [2022-04-08 14:24:51,616 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 59 transitions. Word has length 75 [2022-04-08 14:24:51,616 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 14:24:51,616 INFO L478 AbstractCegarLoop]: Abstraction has 51 states and 59 transitions. [2022-04-08 14:24:51,617 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, (13), 2 states have call predecessors, (13), 1 states have return successors, (11), 9 states have call predecessors, (11), 9 states have call successors, (11) [2022-04-08 14:24:51,617 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 51 states and 59 transitions. [2022-04-08 14:24:52,026 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 59 edges. 59 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 14:24:52,026 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 59 transitions. [2022-04-08 14:24:52,028 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2022-04-08 14:24:52,028 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 14:24:52,028 INFO L499 BasicCegarLoop]: trace histogram [10, 9, 9, 8, 8, 8, 7, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 14:24:52,043 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-04-08 14:24:52,236 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable8 [2022-04-08 14:24:52,236 INFO L403 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 14:24:52,236 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 14:24:52,236 INFO L85 PathProgramCache]: Analyzing trace with hash 615143773, now seen corresponding path program 13 times [2022-04-08 14:24:52,237 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 14:24:52,237 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1726754455] [2022-04-08 14:24:52,237 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 14:24:52,237 INFO L85 PathProgramCache]: Analyzing trace with hash 615143773, now seen corresponding path program 14 times [2022-04-08 14:24:52,237 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 14:24:52,237 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [84644993] [2022-04-08 14:24:52,237 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 14:24:52,237 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 14:24:52,259 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 14:24:52,259 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [474669206] [2022-04-08 14:24:52,259 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 14:24:52,259 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 14:24:52,260 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 14:24:52,263 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 14:24:52,273 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-04-08 14:25:00,486 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 14:25:00,486 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 14:25:00,493 INFO L263 TraceCheckSpWp]: Trace formula consists of 215 conjuncts, 36 conjunts are in the unsatisfiable core [2022-04-08 14:25:00,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 14:25:00,508 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 14:25:00,977 INFO L272 TraceCheckUtils]: 0: Hoare triple {4100#true} call ULTIMATE.init(); {4100#true} is VALID [2022-04-08 14:25:00,977 INFO L290 TraceCheckUtils]: 1: Hoare triple {4100#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); {4100#true} is VALID [2022-04-08 14:25:00,977 INFO L290 TraceCheckUtils]: 2: Hoare triple {4100#true} assume true; {4100#true} is VALID [2022-04-08 14:25:00,977 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4100#true} {4100#true} #63#return; {4100#true} is VALID [2022-04-08 14:25:00,977 INFO L272 TraceCheckUtils]: 4: Hoare triple {4100#true} call #t~ret5 := main(); {4100#true} is VALID [2022-04-08 14:25:00,978 INFO L290 TraceCheckUtils]: 5: Hoare triple {4100#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; {4100#true} is VALID [2022-04-08 14:25:00,978 INFO L272 TraceCheckUtils]: 6: Hoare triple {4100#true} call assume_abort_if_not((if ~k~0 >= 0 && ~k~0 <= 10 then 1 else 0)); {4100#true} is VALID [2022-04-08 14:25:00,978 INFO L290 TraceCheckUtils]: 7: Hoare triple {4100#true} ~cond := #in~cond; {4100#true} is VALID [2022-04-08 14:25:00,978 INFO L290 TraceCheckUtils]: 8: Hoare triple {4100#true} assume !(0 == ~cond); {4100#true} is VALID [2022-04-08 14:25:00,978 INFO L290 TraceCheckUtils]: 9: Hoare triple {4100#true} assume true; {4100#true} is VALID [2022-04-08 14:25:00,978 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {4100#true} {4100#true} #53#return; {4100#true} is VALID [2022-04-08 14:25:00,978 INFO L272 TraceCheckUtils]: 11: Hoare triple {4100#true} call assume_abort_if_not((if ~k~0 <= 256 then 1 else 0)); {4100#true} is VALID [2022-04-08 14:25:00,978 INFO L290 TraceCheckUtils]: 12: Hoare triple {4100#true} ~cond := #in~cond; {4100#true} is VALID [2022-04-08 14:25:00,978 INFO L290 TraceCheckUtils]: 13: Hoare triple {4100#true} assume !(0 == ~cond); {4100#true} is VALID [2022-04-08 14:25:00,978 INFO L290 TraceCheckUtils]: 14: Hoare triple {4100#true} assume true; {4100#true} is VALID [2022-04-08 14:25:00,978 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {4100#true} {4100#true} #55#return; {4100#true} is VALID [2022-04-08 14:25:00,979 INFO L290 TraceCheckUtils]: 16: Hoare triple {4100#true} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {4153#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-08 14:25:00,979 INFO L290 TraceCheckUtils]: 17: Hoare triple {4153#(and (= main_~c~0 0) (= main_~y~0 0))} assume !false; {4153#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-08 14:25:00,979 INFO L272 TraceCheckUtils]: 18: Hoare triple {4153#(and (= main_~c~0 0) (= main_~y~0 0))} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {4100#true} is VALID [2022-04-08 14:25:00,979 INFO L290 TraceCheckUtils]: 19: Hoare triple {4100#true} ~cond := #in~cond; {4100#true} is VALID [2022-04-08 14:25:00,980 INFO L290 TraceCheckUtils]: 20: Hoare triple {4100#true} assume !(0 == ~cond); {4100#true} is VALID [2022-04-08 14:25:00,980 INFO L290 TraceCheckUtils]: 21: Hoare triple {4100#true} assume true; {4100#true} is VALID [2022-04-08 14:25:00,980 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {4100#true} {4153#(and (= main_~c~0 0) (= main_~y~0 0))} #57#return; {4153#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-08 14:25:00,981 INFO L290 TraceCheckUtils]: 23: Hoare triple {4153#(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 + ~x~0; {4175#(and (= main_~y~0 1) (= main_~c~0 1))} is VALID [2022-04-08 14:25:00,981 INFO L290 TraceCheckUtils]: 24: Hoare triple {4175#(and (= main_~y~0 1) (= main_~c~0 1))} assume !false; {4175#(and (= main_~y~0 1) (= main_~c~0 1))} is VALID [2022-04-08 14:25:00,981 INFO L272 TraceCheckUtils]: 25: Hoare triple {4175#(and (= main_~y~0 1) (= main_~c~0 1))} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {4100#true} is VALID [2022-04-08 14:25:00,981 INFO L290 TraceCheckUtils]: 26: Hoare triple {4100#true} ~cond := #in~cond; {4100#true} is VALID [2022-04-08 14:25:00,981 INFO L290 TraceCheckUtils]: 27: Hoare triple {4100#true} assume !(0 == ~cond); {4100#true} is VALID [2022-04-08 14:25:00,981 INFO L290 TraceCheckUtils]: 28: Hoare triple {4100#true} assume true; {4100#true} is VALID [2022-04-08 14:25:00,982 INFO L284 TraceCheckUtils]: 29: Hoare quadruple {4100#true} {4175#(and (= main_~y~0 1) (= main_~c~0 1))} #57#return; {4175#(and (= main_~y~0 1) (= main_~c~0 1))} is VALID [2022-04-08 14:25:00,982 INFO L290 TraceCheckUtils]: 30: Hoare triple {4175#(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 + ~x~0; {4197#(and (= (+ (- 1) main_~y~0) 1) (= main_~c~0 2))} is VALID [2022-04-08 14:25:00,983 INFO L290 TraceCheckUtils]: 31: Hoare triple {4197#(and (= (+ (- 1) main_~y~0) 1) (= main_~c~0 2))} assume !false; {4197#(and (= (+ (- 1) main_~y~0) 1) (= main_~c~0 2))} is VALID [2022-04-08 14:25:00,983 INFO L272 TraceCheckUtils]: 32: Hoare triple {4197#(and (= (+ (- 1) main_~y~0) 1) (= main_~c~0 2))} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {4100#true} is VALID [2022-04-08 14:25:00,983 INFO L290 TraceCheckUtils]: 33: Hoare triple {4100#true} ~cond := #in~cond; {4100#true} is VALID [2022-04-08 14:25:00,983 INFO L290 TraceCheckUtils]: 34: Hoare triple {4100#true} assume !(0 == ~cond); {4100#true} is VALID [2022-04-08 14:25:00,983 INFO L290 TraceCheckUtils]: 35: Hoare triple {4100#true} assume true; {4100#true} is VALID [2022-04-08 14:25:00,983 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {4100#true} {4197#(and (= (+ (- 1) main_~y~0) 1) (= main_~c~0 2))} #57#return; {4197#(and (= (+ (- 1) main_~y~0) 1) (= main_~c~0 2))} is VALID [2022-04-08 14:25:00,984 INFO L290 TraceCheckUtils]: 37: Hoare triple {4197#(and (= (+ (- 1) main_~y~0) 1) (= main_~c~0 2))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {4219#(and (= main_~y~0 3) (= (+ (- 1) main_~c~0) 2))} is VALID [2022-04-08 14:25:00,984 INFO L290 TraceCheckUtils]: 38: Hoare triple {4219#(and (= main_~y~0 3) (= (+ (- 1) main_~c~0) 2))} assume !false; {4219#(and (= main_~y~0 3) (= (+ (- 1) main_~c~0) 2))} is VALID [2022-04-08 14:25:00,984 INFO L272 TraceCheckUtils]: 39: Hoare triple {4219#(and (= main_~y~0 3) (= (+ (- 1) main_~c~0) 2))} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {4100#true} is VALID [2022-04-08 14:25:00,984 INFO L290 TraceCheckUtils]: 40: Hoare triple {4100#true} ~cond := #in~cond; {4100#true} is VALID [2022-04-08 14:25:00,984 INFO L290 TraceCheckUtils]: 41: Hoare triple {4100#true} assume !(0 == ~cond); {4100#true} is VALID [2022-04-08 14:25:00,985 INFO L290 TraceCheckUtils]: 42: Hoare triple {4100#true} assume true; {4100#true} is VALID [2022-04-08 14:25:00,986 INFO L284 TraceCheckUtils]: 43: Hoare quadruple {4100#true} {4219#(and (= main_~y~0 3) (= (+ (- 1) main_~c~0) 2))} #57#return; {4219#(and (= main_~y~0 3) (= (+ (- 1) main_~c~0) 2))} is VALID [2022-04-08 14:25:00,987 INFO L290 TraceCheckUtils]: 44: Hoare triple {4219#(and (= main_~y~0 3) (= (+ (- 1) main_~c~0) 2))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {4241#(and (= 2 (+ (- 2) main_~c~0)) (= 3 (+ (- 1) main_~y~0)))} is VALID [2022-04-08 14:25:00,988 INFO L290 TraceCheckUtils]: 45: Hoare triple {4241#(and (= 2 (+ (- 2) main_~c~0)) (= 3 (+ (- 1) main_~y~0)))} assume !false; {4241#(and (= 2 (+ (- 2) main_~c~0)) (= 3 (+ (- 1) main_~y~0)))} is VALID [2022-04-08 14:25:00,988 INFO L272 TraceCheckUtils]: 46: Hoare triple {4241#(and (= 2 (+ (- 2) main_~c~0)) (= 3 (+ (- 1) main_~y~0)))} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {4100#true} is VALID [2022-04-08 14:25:00,988 INFO L290 TraceCheckUtils]: 47: Hoare triple {4100#true} ~cond := #in~cond; {4100#true} is VALID [2022-04-08 14:25:00,988 INFO L290 TraceCheckUtils]: 48: Hoare triple {4100#true} assume !(0 == ~cond); {4100#true} is VALID [2022-04-08 14:25:00,989 INFO L290 TraceCheckUtils]: 49: Hoare triple {4100#true} assume true; {4100#true} is VALID [2022-04-08 14:25:00,989 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {4100#true} {4241#(and (= 2 (+ (- 2) main_~c~0)) (= 3 (+ (- 1) main_~y~0)))} #57#return; {4241#(and (= 2 (+ (- 2) main_~c~0)) (= 3 (+ (- 1) main_~y~0)))} is VALID [2022-04-08 14:25:00,990 INFO L290 TraceCheckUtils]: 51: Hoare triple {4241#(and (= 2 (+ (- 2) main_~c~0)) (= 3 (+ (- 1) main_~y~0)))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {4263#(and (= 2 (+ main_~c~0 (- 3))) (= 5 main_~y~0))} is VALID [2022-04-08 14:25:00,991 INFO L290 TraceCheckUtils]: 52: Hoare triple {4263#(and (= 2 (+ main_~c~0 (- 3))) (= 5 main_~y~0))} assume !false; {4263#(and (= 2 (+ main_~c~0 (- 3))) (= 5 main_~y~0))} is VALID [2022-04-08 14:25:00,991 INFO L272 TraceCheckUtils]: 53: Hoare triple {4263#(and (= 2 (+ main_~c~0 (- 3))) (= 5 main_~y~0))} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {4100#true} is VALID [2022-04-08 14:25:00,991 INFO L290 TraceCheckUtils]: 54: Hoare triple {4100#true} ~cond := #in~cond; {4100#true} is VALID [2022-04-08 14:25:00,991 INFO L290 TraceCheckUtils]: 55: Hoare triple {4100#true} assume !(0 == ~cond); {4100#true} is VALID [2022-04-08 14:25:00,991 INFO L290 TraceCheckUtils]: 56: Hoare triple {4100#true} assume true; {4100#true} is VALID [2022-04-08 14:25:00,992 INFO L284 TraceCheckUtils]: 57: Hoare quadruple {4100#true} {4263#(and (= 2 (+ main_~c~0 (- 3))) (= 5 main_~y~0))} #57#return; {4263#(and (= 2 (+ main_~c~0 (- 3))) (= 5 main_~y~0))} is VALID [2022-04-08 14:25:00,992 INFO L290 TraceCheckUtils]: 58: Hoare triple {4263#(and (= 2 (+ main_~c~0 (- 3))) (= 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 + ~x~0; {4285#(and (= main_~y~0 6) (= main_~c~0 6))} is VALID [2022-04-08 14:25:00,993 INFO L290 TraceCheckUtils]: 59: Hoare triple {4285#(and (= main_~y~0 6) (= main_~c~0 6))} assume !false; {4285#(and (= main_~y~0 6) (= main_~c~0 6))} is VALID [2022-04-08 14:25:00,993 INFO L272 TraceCheckUtils]: 60: Hoare triple {4285#(and (= main_~y~0 6) (= main_~c~0 6))} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {4100#true} is VALID [2022-04-08 14:25:00,993 INFO L290 TraceCheckUtils]: 61: Hoare triple {4100#true} ~cond := #in~cond; {4100#true} is VALID [2022-04-08 14:25:00,993 INFO L290 TraceCheckUtils]: 62: Hoare triple {4100#true} assume !(0 == ~cond); {4100#true} is VALID [2022-04-08 14:25:00,993 INFO L290 TraceCheckUtils]: 63: Hoare triple {4100#true} assume true; {4100#true} is VALID [2022-04-08 14:25:00,994 INFO L284 TraceCheckUtils]: 64: Hoare quadruple {4100#true} {4285#(and (= main_~y~0 6) (= main_~c~0 6))} #57#return; {4285#(and (= main_~y~0 6) (= main_~c~0 6))} is VALID [2022-04-08 14:25:00,994 INFO L290 TraceCheckUtils]: 65: Hoare triple {4285#(and (= main_~y~0 6) (= main_~c~0 6))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {4307#(and (<= main_~c~0 7) (= 7 main_~y~0) (< 6 main_~k~0))} is VALID [2022-04-08 14:25:00,994 INFO L290 TraceCheckUtils]: 66: Hoare triple {4307#(and (<= main_~c~0 7) (= 7 main_~y~0) (< 6 main_~k~0))} assume !false; {4307#(and (<= main_~c~0 7) (= 7 main_~y~0) (< 6 main_~k~0))} is VALID [2022-04-08 14:25:00,994 INFO L272 TraceCheckUtils]: 67: Hoare triple {4307#(and (<= main_~c~0 7) (= 7 main_~y~0) (< 6 main_~k~0))} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {4100#true} is VALID [2022-04-08 14:25:00,995 INFO L290 TraceCheckUtils]: 68: Hoare triple {4100#true} ~cond := #in~cond; {4100#true} is VALID [2022-04-08 14:25:00,995 INFO L290 TraceCheckUtils]: 69: Hoare triple {4100#true} assume !(0 == ~cond); {4100#true} is VALID [2022-04-08 14:25:00,995 INFO L290 TraceCheckUtils]: 70: Hoare triple {4100#true} assume true; {4100#true} is VALID [2022-04-08 14:25:00,995 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {4100#true} {4307#(and (<= main_~c~0 7) (= 7 main_~y~0) (< 6 main_~k~0))} #57#return; {4307#(and (<= main_~c~0 7) (= 7 main_~y~0) (< 6 main_~k~0))} is VALID [2022-04-08 14:25:00,996 INFO L290 TraceCheckUtils]: 72: Hoare triple {4307#(and (<= main_~c~0 7) (= 7 main_~y~0) (< 6 main_~k~0))} assume !(~c~0 < ~k~0); {4329#(and (<= main_~k~0 7) (= 7 main_~y~0) (< 6 main_~k~0))} is VALID [2022-04-08 14:25:00,996 INFO L272 TraceCheckUtils]: 73: Hoare triple {4329#(and (<= main_~k~0 7) (= 7 main_~y~0) (< 6 main_~k~0))} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {4100#true} is VALID [2022-04-08 14:25:00,996 INFO L290 TraceCheckUtils]: 74: Hoare triple {4100#true} ~cond := #in~cond; {4100#true} is VALID [2022-04-08 14:25:00,996 INFO L290 TraceCheckUtils]: 75: Hoare triple {4100#true} assume !(0 == ~cond); {4100#true} is VALID [2022-04-08 14:25:00,996 INFO L290 TraceCheckUtils]: 76: Hoare triple {4100#true} assume true; {4100#true} is VALID [2022-04-08 14:25:00,997 INFO L284 TraceCheckUtils]: 77: Hoare quadruple {4100#true} {4329#(and (<= main_~k~0 7) (= 7 main_~y~0) (< 6 main_~k~0))} #59#return; {4329#(and (<= main_~k~0 7) (= 7 main_~y~0) (< 6 main_~k~0))} is VALID [2022-04-08 14:25:00,997 INFO L272 TraceCheckUtils]: 78: Hoare triple {4329#(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)); {4348#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 14:25:00,998 INFO L290 TraceCheckUtils]: 79: Hoare triple {4348#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {4352#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 14:25:00,998 INFO L290 TraceCheckUtils]: 80: Hoare triple {4352#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {4101#false} is VALID [2022-04-08 14:25:00,998 INFO L290 TraceCheckUtils]: 81: Hoare triple {4101#false} assume !false; {4101#false} is VALID [2022-04-08 14:25:00,999 INFO L134 CoverageAnalysis]: Checked inductivity of 250 backedges. 18 proven. 84 refuted. 0 times theorem prover too weak. 148 trivial. 0 not checked. [2022-04-08 14:25:00,999 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 14:25:01,354 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 14:25:01,354 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [84644993] [2022-04-08 14:25:01,354 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 14:25:01,354 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [474669206] [2022-04-08 14:25:01,354 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [474669206] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 14:25:01,354 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-08 14:25:01,354 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2022-04-08 14:25:01,355 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 14:25:01,355 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1726754455] [2022-04-08 14:25:01,355 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1726754455] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 14:25:01,355 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 14:25:01,355 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-04-08 14:25:01,355 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [920324914] [2022-04-08 14:25:01,355 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 14:25:01,356 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 2.4166666666666665) internal successors, (29), 12 states have internal predecessors, (29), 10 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (12), 10 states have call predecessors, (12), 10 states have call successors, (12) Word has length 82 [2022-04-08 14:25:01,357 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 14:25:01,357 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 13 states, 12 states have (on average 2.4166666666666665) internal successors, (29), 12 states have internal predecessors, (29), 10 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (12), 10 states have call predecessors, (12), 10 states have call successors, (12) [2022-04-08 14:25:01,407 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 55 edges. 55 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 14:25:01,408 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-04-08 14:25:01,408 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 14:25:01,408 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-04-08 14:25:01,408 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=198, Unknown=0, NotChecked=0, Total=240 [2022-04-08 14:25:01,409 INFO L87 Difference]: Start difference. First operand 51 states and 59 transitions. Second operand has 13 states, 12 states have (on average 2.4166666666666665) internal successors, (29), 12 states have internal predecessors, (29), 10 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (12), 10 states have call predecessors, (12), 10 states have call successors, (12) [2022-04-08 14:25:02,401 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:25:02,401 INFO L93 Difference]: Finished difference Result 60 states and 70 transitions. [2022-04-08 14:25:02,402 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-04-08 14:25:02,402 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 2.4166666666666665) internal successors, (29), 12 states have internal predecessors, (29), 10 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (12), 10 states have call predecessors, (12), 10 states have call successors, (12) Word has length 82 [2022-04-08 14:25:02,402 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 14:25:02,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 12 states have (on average 2.4166666666666665) internal successors, (29), 12 states have internal predecessors, (29), 10 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (12), 10 states have call predecessors, (12), 10 states have call successors, (12) [2022-04-08 14:25:02,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 66 transitions. [2022-04-08 14:25:02,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 12 states have (on average 2.4166666666666665) internal successors, (29), 12 states have internal predecessors, (29), 10 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (12), 10 states have call predecessors, (12), 10 states have call successors, (12) [2022-04-08 14:25:02,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 66 transitions. [2022-04-08 14:25:02,406 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 13 states and 66 transitions. [2022-04-08 14:25:02,457 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 66 edges. 66 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 14:25:02,459 INFO L225 Difference]: With dead ends: 60 [2022-04-08 14:25:02,460 INFO L226 Difference]: Without dead ends: 54 [2022-04-08 14:25:02,460 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 84 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=52, Invalid=254, Unknown=0, NotChecked=0, Total=306 [2022-04-08 14:25:02,460 INFO L913 BasicCegarLoop]: 48 mSDtfsCounter, 2 mSDsluCounter, 303 mSDsCounter, 0 mSdLazyCounter, 317 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 351 SdHoareTripleChecker+Invalid, 318 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 317 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-04-08 14:25:02,461 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [2 Valid, 351 Invalid, 318 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 317 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-04-08 14:25:02,461 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2022-04-08 14:25:02,507 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2022-04-08 14:25:02,507 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 14:25:02,507 INFO L82 GeneralOperation]: Start isEquivalent. First operand 54 states. Second operand has 54 states, 34 states have (on average 1.0294117647058822) internal successors, (35), 34 states have internal predecessors, (35), 15 states have call successors, (15), 6 states have call predecessors, (15), 4 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2022-04-08 14:25:02,507 INFO L74 IsIncluded]: Start isIncluded. First operand 54 states. Second operand has 54 states, 34 states have (on average 1.0294117647058822) internal successors, (35), 34 states have internal predecessors, (35), 15 states have call successors, (15), 6 states have call predecessors, (15), 4 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2022-04-08 14:25:02,508 INFO L87 Difference]: Start difference. First operand 54 states. Second operand has 54 states, 34 states have (on average 1.0294117647058822) internal successors, (35), 34 states have internal predecessors, (35), 15 states have call successors, (15), 6 states have call predecessors, (15), 4 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2022-04-08 14:25:02,516 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:25:02,516 INFO L93 Difference]: Finished difference Result 54 states and 63 transitions. [2022-04-08 14:25:02,516 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 63 transitions. [2022-04-08 14:25:02,516 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 14:25:02,516 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 14:25:02,517 INFO L74 IsIncluded]: Start isIncluded. First operand has 54 states, 34 states have (on average 1.0294117647058822) internal successors, (35), 34 states have internal predecessors, (35), 15 states have call successors, (15), 6 states have call predecessors, (15), 4 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) Second operand 54 states. [2022-04-08 14:25:02,517 INFO L87 Difference]: Start difference. First operand has 54 states, 34 states have (on average 1.0294117647058822) internal successors, (35), 34 states have internal predecessors, (35), 15 states have call successors, (15), 6 states have call predecessors, (15), 4 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) Second operand 54 states. [2022-04-08 14:25:02,520 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:25:02,520 INFO L93 Difference]: Finished difference Result 54 states and 63 transitions. [2022-04-08 14:25:02,521 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 63 transitions. [2022-04-08 14:25:02,521 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 14:25:02,521 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 14:25:02,521 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 14:25:02,522 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 14:25:02,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 34 states have (on average 1.0294117647058822) internal successors, (35), 34 states have internal predecessors, (35), 15 states have call successors, (15), 6 states have call predecessors, (15), 4 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2022-04-08 14:25:02,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 63 transitions. [2022-04-08 14:25:02,524 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 63 transitions. Word has length 82 [2022-04-08 14:25:02,524 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 14:25:02,524 INFO L478 AbstractCegarLoop]: Abstraction has 54 states and 63 transitions. [2022-04-08 14:25:02,524 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 2.4166666666666665) internal successors, (29), 12 states have internal predecessors, (29), 10 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (12), 10 states have call predecessors, (12), 10 states have call successors, (12) [2022-04-08 14:25:02,524 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 54 states and 63 transitions. [2022-04-08 14:25:02,859 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 63 edges. 63 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 14:25:02,860 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 63 transitions. [2022-04-08 14:25:02,860 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2022-04-08 14:25:02,860 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 14:25:02,860 INFO L499 BasicCegarLoop]: trace histogram [11, 10, 10, 9, 9, 9, 8, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 14:25:02,868 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-04-08 14:25:03,061 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2022-04-08 14:25:03,062 INFO L403 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 14:25:03,062 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 14:25:03,062 INFO L85 PathProgramCache]: Analyzing trace with hash -1334355539, now seen corresponding path program 15 times [2022-04-08 14:25:03,062 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 14:25:03,062 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [428184475] [2022-04-08 14:25:03,063 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 14:25:03,063 INFO L85 PathProgramCache]: Analyzing trace with hash -1334355539, now seen corresponding path program 16 times [2022-04-08 14:25:03,063 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 14:25:03,063 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [416557742] [2022-04-08 14:25:03,063 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 14:25:03,063 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 14:25:03,085 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 14:25:03,085 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1603160715] [2022-04-08 14:25:03,086 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-08 14:25:03,086 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 14:25:03,086 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 14:25:03,087 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 14:25:03,093 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-04-08 14:25:03,131 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-08 14:25:03,131 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 14:25:03,132 INFO L263 TraceCheckSpWp]: Trace formula consists of 161 conjuncts, 40 conjunts are in the unsatisfiable core [2022-04-08 14:25:03,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 14:25:03,153 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 14:25:03,705 INFO L272 TraceCheckUtils]: 0: Hoare triple {4755#true} call ULTIMATE.init(); {4755#true} is VALID [2022-04-08 14:25:03,706 INFO L290 TraceCheckUtils]: 1: Hoare triple {4755#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); {4755#true} is VALID [2022-04-08 14:25:03,706 INFO L290 TraceCheckUtils]: 2: Hoare triple {4755#true} assume true; {4755#true} is VALID [2022-04-08 14:25:03,706 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4755#true} {4755#true} #63#return; {4755#true} is VALID [2022-04-08 14:25:03,706 INFO L272 TraceCheckUtils]: 4: Hoare triple {4755#true} call #t~ret5 := main(); {4755#true} is VALID [2022-04-08 14:25:03,706 INFO L290 TraceCheckUtils]: 5: Hoare triple {4755#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; {4755#true} is VALID [2022-04-08 14:25:03,706 INFO L272 TraceCheckUtils]: 6: Hoare triple {4755#true} call assume_abort_if_not((if ~k~0 >= 0 && ~k~0 <= 10 then 1 else 0)); {4755#true} is VALID [2022-04-08 14:25:03,706 INFO L290 TraceCheckUtils]: 7: Hoare triple {4755#true} ~cond := #in~cond; {4755#true} is VALID [2022-04-08 14:25:03,706 INFO L290 TraceCheckUtils]: 8: Hoare triple {4755#true} assume !(0 == ~cond); {4755#true} is VALID [2022-04-08 14:25:03,707 INFO L290 TraceCheckUtils]: 9: Hoare triple {4755#true} assume true; {4755#true} is VALID [2022-04-08 14:25:03,707 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {4755#true} {4755#true} #53#return; {4755#true} is VALID [2022-04-08 14:25:03,707 INFO L272 TraceCheckUtils]: 11: Hoare triple {4755#true} call assume_abort_if_not((if ~k~0 <= 256 then 1 else 0)); {4755#true} is VALID [2022-04-08 14:25:03,707 INFO L290 TraceCheckUtils]: 12: Hoare triple {4755#true} ~cond := #in~cond; {4755#true} is VALID [2022-04-08 14:25:03,707 INFO L290 TraceCheckUtils]: 13: Hoare triple {4755#true} assume !(0 == ~cond); {4755#true} is VALID [2022-04-08 14:25:03,707 INFO L290 TraceCheckUtils]: 14: Hoare triple {4755#true} assume true; {4755#true} is VALID [2022-04-08 14:25:03,707 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {4755#true} {4755#true} #55#return; {4755#true} is VALID [2022-04-08 14:25:03,708 INFO L290 TraceCheckUtils]: 16: Hoare triple {4755#true} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {4808#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-08 14:25:03,708 INFO L290 TraceCheckUtils]: 17: Hoare triple {4808#(and (= main_~c~0 0) (= main_~y~0 0))} assume !false; {4808#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-08 14:25:03,708 INFO L272 TraceCheckUtils]: 18: Hoare triple {4808#(and (= main_~c~0 0) (= main_~y~0 0))} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {4755#true} is VALID [2022-04-08 14:25:03,708 INFO L290 TraceCheckUtils]: 19: Hoare triple {4755#true} ~cond := #in~cond; {4755#true} is VALID [2022-04-08 14:25:03,709 INFO L290 TraceCheckUtils]: 20: Hoare triple {4755#true} assume !(0 == ~cond); {4755#true} is VALID [2022-04-08 14:25:03,709 INFO L290 TraceCheckUtils]: 21: Hoare triple {4755#true} assume true; {4755#true} is VALID [2022-04-08 14:25:03,709 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {4755#true} {4808#(and (= main_~c~0 0) (= main_~y~0 0))} #57#return; {4808#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-08 14:25:03,710 INFO L290 TraceCheckUtils]: 23: Hoare triple {4808#(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 + ~x~0; {4830#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} is VALID [2022-04-08 14:25:03,710 INFO L290 TraceCheckUtils]: 24: Hoare triple {4830#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} assume !false; {4830#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} is VALID [2022-04-08 14:25:03,710 INFO L272 TraceCheckUtils]: 25: Hoare triple {4830#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {4755#true} is VALID [2022-04-08 14:25:03,710 INFO L290 TraceCheckUtils]: 26: Hoare triple {4755#true} ~cond := #in~cond; {4755#true} is VALID [2022-04-08 14:25:03,711 INFO L290 TraceCheckUtils]: 27: Hoare triple {4755#true} assume !(0 == ~cond); {4755#true} is VALID [2022-04-08 14:25:03,711 INFO L290 TraceCheckUtils]: 28: Hoare triple {4755#true} assume true; {4755#true} is VALID [2022-04-08 14:25:03,711 INFO L284 TraceCheckUtils]: 29: Hoare quadruple {4755#true} {4830#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} #57#return; {4830#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} is VALID [2022-04-08 14:25:03,712 INFO L290 TraceCheckUtils]: 30: Hoare triple {4830#(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 + ~x~0; {4852#(and (= main_~y~0 2) (= 0 (+ (- 2) main_~c~0)))} is VALID [2022-04-08 14:25:03,712 INFO L290 TraceCheckUtils]: 31: Hoare triple {4852#(and (= main_~y~0 2) (= 0 (+ (- 2) main_~c~0)))} assume !false; {4852#(and (= main_~y~0 2) (= 0 (+ (- 2) main_~c~0)))} is VALID [2022-04-08 14:25:03,712 INFO L272 TraceCheckUtils]: 32: Hoare triple {4852#(and (= main_~y~0 2) (= 0 (+ (- 2) main_~c~0)))} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {4755#true} is VALID [2022-04-08 14:25:03,712 INFO L290 TraceCheckUtils]: 33: Hoare triple {4755#true} ~cond := #in~cond; {4755#true} is VALID [2022-04-08 14:25:03,713 INFO L290 TraceCheckUtils]: 34: Hoare triple {4755#true} assume !(0 == ~cond); {4755#true} is VALID [2022-04-08 14:25:03,713 INFO L290 TraceCheckUtils]: 35: Hoare triple {4755#true} assume true; {4755#true} is VALID [2022-04-08 14:25:03,713 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {4755#true} {4852#(and (= main_~y~0 2) (= 0 (+ (- 2) main_~c~0)))} #57#return; {4852#(and (= main_~y~0 2) (= 0 (+ (- 2) main_~c~0)))} is VALID [2022-04-08 14:25:03,714 INFO L290 TraceCheckUtils]: 37: Hoare triple {4852#(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 + ~x~0; {4874#(and (= main_~y~0 3) (= main_~c~0 3))} is VALID [2022-04-08 14:25:03,714 INFO L290 TraceCheckUtils]: 38: Hoare triple {4874#(and (= main_~y~0 3) (= main_~c~0 3))} assume !false; {4874#(and (= main_~y~0 3) (= main_~c~0 3))} is VALID [2022-04-08 14:25:03,714 INFO L272 TraceCheckUtils]: 39: Hoare triple {4874#(and (= main_~y~0 3) (= main_~c~0 3))} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {4755#true} is VALID [2022-04-08 14:25:03,715 INFO L290 TraceCheckUtils]: 40: Hoare triple {4755#true} ~cond := #in~cond; {4755#true} is VALID [2022-04-08 14:25:03,715 INFO L290 TraceCheckUtils]: 41: Hoare triple {4755#true} assume !(0 == ~cond); {4755#true} is VALID [2022-04-08 14:25:03,715 INFO L290 TraceCheckUtils]: 42: Hoare triple {4755#true} assume true; {4755#true} is VALID [2022-04-08 14:25:03,715 INFO L284 TraceCheckUtils]: 43: Hoare quadruple {4755#true} {4874#(and (= main_~y~0 3) (= main_~c~0 3))} #57#return; {4874#(and (= main_~y~0 3) (= main_~c~0 3))} is VALID [2022-04-08 14:25:03,716 INFO L290 TraceCheckUtils]: 44: Hoare triple {4874#(and (= main_~y~0 3) (= main_~c~0 3))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {4896#(and (= (+ (- 1) main_~c~0) 3) (= main_~y~0 4))} is VALID [2022-04-08 14:25:03,716 INFO L290 TraceCheckUtils]: 45: Hoare triple {4896#(and (= (+ (- 1) main_~c~0) 3) (= main_~y~0 4))} assume !false; {4896#(and (= (+ (- 1) main_~c~0) 3) (= main_~y~0 4))} is VALID [2022-04-08 14:25:03,717 INFO L272 TraceCheckUtils]: 46: Hoare triple {4896#(and (= (+ (- 1) main_~c~0) 3) (= main_~y~0 4))} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {4755#true} is VALID [2022-04-08 14:25:03,717 INFO L290 TraceCheckUtils]: 47: Hoare triple {4755#true} ~cond := #in~cond; {4755#true} is VALID [2022-04-08 14:25:03,717 INFO L290 TraceCheckUtils]: 48: Hoare triple {4755#true} assume !(0 == ~cond); {4755#true} is VALID [2022-04-08 14:25:03,717 INFO L290 TraceCheckUtils]: 49: Hoare triple {4755#true} assume true; {4755#true} is VALID [2022-04-08 14:25:03,718 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {4755#true} {4896#(and (= (+ (- 1) main_~c~0) 3) (= main_~y~0 4))} #57#return; {4896#(and (= (+ (- 1) main_~c~0) 3) (= main_~y~0 4))} is VALID [2022-04-08 14:25:03,718 INFO L290 TraceCheckUtils]: 51: Hoare triple {4896#(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 + ~x~0; {4918#(and (= 3 (+ (- 2) main_~c~0)) (= (+ (- 1) main_~y~0) 4))} is VALID [2022-04-08 14:25:03,719 INFO L290 TraceCheckUtils]: 52: Hoare triple {4918#(and (= 3 (+ (- 2) main_~c~0)) (= (+ (- 1) main_~y~0) 4))} assume !false; {4918#(and (= 3 (+ (- 2) main_~c~0)) (= (+ (- 1) main_~y~0) 4))} is VALID [2022-04-08 14:25:03,719 INFO L272 TraceCheckUtils]: 53: Hoare triple {4918#(and (= 3 (+ (- 2) main_~c~0)) (= (+ (- 1) main_~y~0) 4))} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {4755#true} is VALID [2022-04-08 14:25:03,719 INFO L290 TraceCheckUtils]: 54: Hoare triple {4755#true} ~cond := #in~cond; {4755#true} is VALID [2022-04-08 14:25:03,719 INFO L290 TraceCheckUtils]: 55: Hoare triple {4755#true} assume !(0 == ~cond); {4755#true} is VALID [2022-04-08 14:25:03,719 INFO L290 TraceCheckUtils]: 56: Hoare triple {4755#true} assume true; {4755#true} is VALID [2022-04-08 14:25:03,720 INFO L284 TraceCheckUtils]: 57: Hoare quadruple {4755#true} {4918#(and (= 3 (+ (- 2) main_~c~0)) (= (+ (- 1) main_~y~0) 4))} #57#return; {4918#(and (= 3 (+ (- 2) main_~c~0)) (= (+ (- 1) main_~y~0) 4))} is VALID [2022-04-08 14:25:03,720 INFO L290 TraceCheckUtils]: 58: Hoare triple {4918#(and (= 3 (+ (- 2) main_~c~0)) (= (+ (- 1) main_~y~0) 4))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {4940#(and (= main_~y~0 6) (= (+ main_~c~0 (- 3)) 3))} is VALID [2022-04-08 14:25:03,721 INFO L290 TraceCheckUtils]: 59: Hoare triple {4940#(and (= main_~y~0 6) (= (+ main_~c~0 (- 3)) 3))} assume !false; {4940#(and (= main_~y~0 6) (= (+ main_~c~0 (- 3)) 3))} is VALID [2022-04-08 14:25:03,721 INFO L272 TraceCheckUtils]: 60: Hoare triple {4940#(and (= main_~y~0 6) (= (+ main_~c~0 (- 3)) 3))} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {4755#true} is VALID [2022-04-08 14:25:03,721 INFO L290 TraceCheckUtils]: 61: Hoare triple {4755#true} ~cond := #in~cond; {4755#true} is VALID [2022-04-08 14:25:03,721 INFO L290 TraceCheckUtils]: 62: Hoare triple {4755#true} assume !(0 == ~cond); {4755#true} is VALID [2022-04-08 14:25:03,721 INFO L290 TraceCheckUtils]: 63: Hoare triple {4755#true} assume true; {4755#true} is VALID [2022-04-08 14:25:03,722 INFO L284 TraceCheckUtils]: 64: Hoare quadruple {4755#true} {4940#(and (= main_~y~0 6) (= (+ main_~c~0 (- 3)) 3))} #57#return; {4940#(and (= main_~y~0 6) (= (+ main_~c~0 (- 3)) 3))} is VALID [2022-04-08 14:25:03,722 INFO L290 TraceCheckUtils]: 65: Hoare triple {4940#(and (= main_~y~0 6) (= (+ main_~c~0 (- 3)) 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 + ~x~0; {4962#(and (= 7 main_~y~0) (= 7 main_~c~0))} is VALID [2022-04-08 14:25:03,723 INFO L290 TraceCheckUtils]: 66: Hoare triple {4962#(and (= 7 main_~y~0) (= 7 main_~c~0))} assume !false; {4962#(and (= 7 main_~y~0) (= 7 main_~c~0))} is VALID [2022-04-08 14:25:03,723 INFO L272 TraceCheckUtils]: 67: Hoare triple {4962#(and (= 7 main_~y~0) (= 7 main_~c~0))} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {4755#true} is VALID [2022-04-08 14:25:03,723 INFO L290 TraceCheckUtils]: 68: Hoare triple {4755#true} ~cond := #in~cond; {4755#true} is VALID [2022-04-08 14:25:03,723 INFO L290 TraceCheckUtils]: 69: Hoare triple {4755#true} assume !(0 == ~cond); {4755#true} is VALID [2022-04-08 14:25:03,723 INFO L290 TraceCheckUtils]: 70: Hoare triple {4755#true} assume true; {4755#true} is VALID [2022-04-08 14:25:03,724 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {4755#true} {4962#(and (= 7 main_~y~0) (= 7 main_~c~0))} #57#return; {4962#(and (= 7 main_~y~0) (= 7 main_~c~0))} is VALID [2022-04-08 14:25:03,725 INFO L290 TraceCheckUtils]: 72: Hoare triple {4962#(and (= 7 main_~y~0) (= 7 main_~c~0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {4984#(and (< 7 main_~k~0) (= main_~y~0 8) (<= main_~c~0 8))} is VALID [2022-04-08 14:25:03,725 INFO L290 TraceCheckUtils]: 73: Hoare triple {4984#(and (< 7 main_~k~0) (= main_~y~0 8) (<= main_~c~0 8))} assume !false; {4984#(and (< 7 main_~k~0) (= main_~y~0 8) (<= main_~c~0 8))} is VALID [2022-04-08 14:25:03,725 INFO L272 TraceCheckUtils]: 74: Hoare triple {4984#(and (< 7 main_~k~0) (= main_~y~0 8) (<= main_~c~0 8))} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {4755#true} is VALID [2022-04-08 14:25:03,725 INFO L290 TraceCheckUtils]: 75: Hoare triple {4755#true} ~cond := #in~cond; {4755#true} is VALID [2022-04-08 14:25:03,725 INFO L290 TraceCheckUtils]: 76: Hoare triple {4755#true} assume !(0 == ~cond); {4755#true} is VALID [2022-04-08 14:25:03,726 INFO L290 TraceCheckUtils]: 77: Hoare triple {4755#true} assume true; {4755#true} is VALID [2022-04-08 14:25:03,726 INFO L284 TraceCheckUtils]: 78: Hoare quadruple {4755#true} {4984#(and (< 7 main_~k~0) (= main_~y~0 8) (<= main_~c~0 8))} #57#return; {4984#(and (< 7 main_~k~0) (= main_~y~0 8) (<= main_~c~0 8))} is VALID [2022-04-08 14:25:03,727 INFO L290 TraceCheckUtils]: 79: Hoare triple {4984#(and (< 7 main_~k~0) (= main_~y~0 8) (<= main_~c~0 8))} assume !(~c~0 < ~k~0); {5006#(and (< 7 main_~k~0) (= main_~y~0 8) (<= main_~k~0 8))} is VALID [2022-04-08 14:25:03,727 INFO L272 TraceCheckUtils]: 80: Hoare triple {5006#(and (< 7 main_~k~0) (= main_~y~0 8) (<= main_~k~0 8))} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {4755#true} is VALID [2022-04-08 14:25:03,727 INFO L290 TraceCheckUtils]: 81: Hoare triple {4755#true} ~cond := #in~cond; {4755#true} is VALID [2022-04-08 14:25:03,727 INFO L290 TraceCheckUtils]: 82: Hoare triple {4755#true} assume !(0 == ~cond); {4755#true} is VALID [2022-04-08 14:25:03,727 INFO L290 TraceCheckUtils]: 83: Hoare triple {4755#true} assume true; {4755#true} is VALID [2022-04-08 14:25:03,728 INFO L284 TraceCheckUtils]: 84: Hoare quadruple {4755#true} {5006#(and (< 7 main_~k~0) (= main_~y~0 8) (<= main_~k~0 8))} #59#return; {5006#(and (< 7 main_~k~0) (= main_~y~0 8) (<= main_~k~0 8))} is VALID [2022-04-08 14:25:03,729 INFO L272 TraceCheckUtils]: 85: Hoare triple {5006#(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)); {5025#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 14:25:03,729 INFO L290 TraceCheckUtils]: 86: Hoare triple {5025#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {5029#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 14:25:03,729 INFO L290 TraceCheckUtils]: 87: Hoare triple {5029#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {4756#false} is VALID [2022-04-08 14:25:03,730 INFO L290 TraceCheckUtils]: 88: Hoare triple {4756#false} assume !false; {4756#false} is VALID [2022-04-08 14:25:03,730 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 20 proven. 108 refuted. 0 times theorem prover too weak. 184 trivial. 0 not checked. [2022-04-08 14:25:03,730 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 14:25:04,082 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 14:25:04,082 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [416557742] [2022-04-08 14:25:04,082 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 14:25:04,083 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1603160715] [2022-04-08 14:25:04,083 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1603160715] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 14:25:04,083 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-08 14:25:04,083 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2022-04-08 14:25:04,083 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 14:25:04,083 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [428184475] [2022-04-08 14:25:04,083 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [428184475] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 14:25:04,084 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 14:25:04,084 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-04-08 14:25:04,084 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1598424401] [2022-04-08 14:25:04,084 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 14:25:04,084 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, (15), 2 states have call predecessors, (15), 1 states have return successors, (13), 11 states have call predecessors, (13), 11 states have call successors, (13) Word has length 89 [2022-04-08 14:25:04,085 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 14:25:04,085 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, (15), 2 states have call predecessors, (15), 1 states have return successors, (13), 11 states have call predecessors, (13), 11 states have call successors, (13) [2022-04-08 14:25:04,139 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 59 edges. 59 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 14:25:04,139 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-04-08 14:25:04,139 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 14:25:04,140 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-04-08 14:25:04,140 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=227, Unknown=0, NotChecked=0, Total=272 [2022-04-08 14:25:04,140 INFO L87 Difference]: Start difference. First operand 54 states and 63 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, (15), 2 states have call predecessors, (15), 1 states have return successors, (13), 11 states have call predecessors, (13), 11 states have call successors, (13) [2022-04-08 14:25:05,297 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:25:05,298 INFO L93 Difference]: Finished difference Result 63 states and 74 transitions. [2022-04-08 14:25:05,298 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-04-08 14:25:05,298 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, (15), 2 states have call predecessors, (15), 1 states have return successors, (13), 11 states have call predecessors, (13), 11 states have call successors, (13) Word has length 89 [2022-04-08 14:25:05,298 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 14:25:05,298 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, (15), 2 states have call predecessors, (15), 1 states have return successors, (13), 11 states have call predecessors, (13), 11 states have call successors, (13) [2022-04-08 14:25:05,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 70 transitions. [2022-04-08 14:25:05,300 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, (15), 2 states have call predecessors, (15), 1 states have return successors, (13), 11 states have call predecessors, (13), 11 states have call successors, (13) [2022-04-08 14:25:05,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 70 transitions. [2022-04-08 14:25:05,302 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 14 states and 70 transitions. [2022-04-08 14:25:05,372 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 70 edges. 70 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 14:25:05,373 INFO L225 Difference]: With dead ends: 63 [2022-04-08 14:25:05,373 INFO L226 Difference]: Without dead ends: 57 [2022-04-08 14:25:05,373 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 90 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=55, Invalid=287, Unknown=0, NotChecked=0, Total=342 [2022-04-08 14:25:05,374 INFO L913 BasicCegarLoop]: 51 mSDtfsCounter, 2 mSDsluCounter, 343 mSDsCounter, 0 mSdLazyCounter, 381 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 394 SdHoareTripleChecker+Invalid, 382 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 381 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-04-08 14:25:05,374 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [2 Valid, 394 Invalid, 382 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 381 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-04-08 14:25:05,374 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2022-04-08 14:25:05,412 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2022-04-08 14:25:05,412 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 14:25:05,412 INFO L82 GeneralOperation]: Start isEquivalent. First operand 57 states. Second operand has 57 states, 36 states have (on average 1.0277777777777777) internal successors, (37), 36 states have internal predecessors, (37), 16 states have call successors, (16), 6 states have call predecessors, (16), 4 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2022-04-08 14:25:05,412 INFO L74 IsIncluded]: Start isIncluded. First operand 57 states. Second operand has 57 states, 36 states have (on average 1.0277777777777777) internal successors, (37), 36 states have internal predecessors, (37), 16 states have call successors, (16), 6 states have call predecessors, (16), 4 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2022-04-08 14:25:05,413 INFO L87 Difference]: Start difference. First operand 57 states. Second operand has 57 states, 36 states have (on average 1.0277777777777777) internal successors, (37), 36 states have internal predecessors, (37), 16 states have call successors, (16), 6 states have call predecessors, (16), 4 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2022-04-08 14:25:05,414 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:25:05,415 INFO L93 Difference]: Finished difference Result 57 states and 67 transitions. [2022-04-08 14:25:05,415 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 67 transitions. [2022-04-08 14:25:05,415 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 14:25:05,415 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 14:25:05,416 INFO L74 IsIncluded]: Start isIncluded. First operand has 57 states, 36 states have (on average 1.0277777777777777) internal successors, (37), 36 states have internal predecessors, (37), 16 states have call successors, (16), 6 states have call predecessors, (16), 4 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) Second operand 57 states. [2022-04-08 14:25:05,416 INFO L87 Difference]: Start difference. First operand has 57 states, 36 states have (on average 1.0277777777777777) internal successors, (37), 36 states have internal predecessors, (37), 16 states have call successors, (16), 6 states have call predecessors, (16), 4 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) Second operand 57 states. [2022-04-08 14:25:05,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:25:05,418 INFO L93 Difference]: Finished difference Result 57 states and 67 transitions. [2022-04-08 14:25:05,418 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 67 transitions. [2022-04-08 14:25:05,418 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 14:25:05,418 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 14:25:05,418 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 14:25:05,418 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 14:25:05,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 36 states have (on average 1.0277777777777777) internal successors, (37), 36 states have internal predecessors, (37), 16 states have call successors, (16), 6 states have call predecessors, (16), 4 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2022-04-08 14:25:05,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 67 transitions. [2022-04-08 14:25:05,420 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 67 transitions. Word has length 89 [2022-04-08 14:25:05,420 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 14:25:05,420 INFO L478 AbstractCegarLoop]: Abstraction has 57 states and 67 transitions. [2022-04-08 14:25:05,421 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, (15), 2 states have call predecessors, (15), 1 states have return successors, (13), 11 states have call predecessors, (13), 11 states have call successors, (13) [2022-04-08 14:25:05,421 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 57 states and 67 transitions. [2022-04-08 14:25:05,827 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 67 edges. 67 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 14:25:05,827 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 67 transitions. [2022-04-08 14:25:05,828 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2022-04-08 14:25:05,828 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 14:25:05,828 INFO L499 BasicCegarLoop]: trace histogram [12, 11, 11, 10, 10, 10, 9, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 14:25:05,848 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2022-04-08 14:25:06,039 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2022-04-08 14:25:06,040 INFO L403 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 14:25:06,040 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 14:25:06,040 INFO L85 PathProgramCache]: Analyzing trace with hash 711483229, now seen corresponding path program 17 times [2022-04-08 14:25:06,040 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 14:25:06,040 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [351997134] [2022-04-08 14:25:06,041 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 14:25:06,041 INFO L85 PathProgramCache]: Analyzing trace with hash 711483229, now seen corresponding path program 18 times [2022-04-08 14:25:06,041 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 14:25:06,041 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1024295951] [2022-04-08 14:25:06,041 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 14:25:06,041 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 14:25:06,063 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 14:25:06,063 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [502943073] [2022-04-08 14:25:06,063 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-08 14:25:06,063 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 14:25:06,064 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 14:25:06,064 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 14:25:06,097 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process