/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/ps6-ll.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-fb4f59a-m [2022-04-28 10:58:50,562 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-28 10:58:50,564 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-28 10:58:50,614 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-28 10:58:50,614 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-28 10:58:50,615 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-28 10:58:50,616 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-28 10:58:50,617 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-28 10:58:50,618 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-28 10:58:50,619 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-28 10:58:50,619 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-28 10:58:50,620 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-28 10:58:50,620 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-28 10:58:50,621 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-28 10:58:50,622 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-28 10:58:50,623 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-28 10:58:50,623 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-28 10:58:50,624 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-28 10:58:50,625 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-28 10:58:50,627 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-28 10:58:50,628 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-28 10:58:50,636 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-28 10:58:50,636 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-28 10:58:50,637 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-28 10:58:50,638 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-28 10:58:50,640 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-28 10:58:50,640 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-28 10:58:50,640 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-28 10:58:50,641 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-28 10:58:50,641 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-28 10:58:50,641 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-28 10:58:50,642 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-28 10:58:50,642 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-28 10:58:50,643 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-28 10:58:50,643 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-28 10:58:50,644 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-28 10:58:50,644 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-28 10:58:50,645 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-28 10:58:50,645 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-28 10:58:50,645 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-28 10:58:50,646 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-28 10:58:50,650 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-28 10:58:50,650 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationQvasr_64.epf [2022-04-28 10:58:50,657 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-28 10:58:50,657 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-28 10:58:50,658 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-28 10:58:50,658 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-28 10:58:50,658 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-28 10:58:50,658 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-28 10:58:50,658 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-28 10:58:50,658 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-28 10:58:50,658 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-28 10:58:50,659 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-28 10:58:50,659 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-28 10:58:50,659 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-28 10:58:50,659 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-28 10:58:50,659 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-28 10:58:50,659 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-28 10:58:50,659 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-28 10:58:50,659 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-28 10:58:50,660 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-04-28 10:58:50,660 INFO L138 SettingsManager]: * Trace refinement strategy=ACCELERATED_INTERPOLATION [2022-04-28 10:58:50,660 INFO L138 SettingsManager]: * Trace refinement strategy used in Accelerated Interpolation=CAMEL [2022-04-28 10:58:50,660 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-28 10:58:50,660 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=QVASR [2022-04-28 10:58:50,660 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-28 10:58:50,862 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-28 10:58:50,881 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-28 10:58:50,883 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-28 10:58:50,884 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-28 10:58:50,884 INFO L275 PluginConnector]: CDTParser initialized [2022-04-28 10:58:50,885 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/nla-digbench/ps6-ll.c [2022-04-28 10:58:50,927 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d562e98e7/10b2f43469b34f948d88c5b531bcfe85/FLAGd9a794259 [2022-04-28 10:58:51,313 INFO L306 CDTParser]: Found 1 translation units. [2022-04-28 10:58:51,314 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench/ps6-ll.c [2022-04-28 10:58:51,321 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d562e98e7/10b2f43469b34f948d88c5b531bcfe85/FLAGd9a794259 [2022-04-28 10:58:51,332 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d562e98e7/10b2f43469b34f948d88c5b531bcfe85 [2022-04-28 10:58:51,333 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-28 10:58:51,336 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-28 10:58:51,338 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-28 10:58:51,338 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-28 10:58:51,341 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-28 10:58:51,347 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.04 10:58:51" (1/1) ... [2022-04-28 10:58:51,348 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@548cd83e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 10:58:51, skipping insertion in model container [2022-04-28 10:58:51,348 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.04 10:58:51" (1/1) ... [2022-04-28 10:58:51,354 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-28 10:58:51,363 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-28 10:58:51,511 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench/ps6-ll.c[458,471] [2022-04-28 10:58:51,524 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-28 10:58:51,529 INFO L203 MainTranslator]: Completed pre-run [2022-04-28 10:58:51,536 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench/ps6-ll.c[458,471] [2022-04-28 10:58:51,540 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-28 10:58:51,548 INFO L208 MainTranslator]: Completed translation [2022-04-28 10:58:51,549 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 10:58:51 WrapperNode [2022-04-28 10:58:51,549 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-28 10:58:51,549 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-28 10:58:51,549 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-28 10:58:51,550 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-28 10:58:51,557 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 10:58:51" (1/1) ... [2022-04-28 10:58:51,557 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 10:58:51" (1/1) ... [2022-04-28 10:58:51,562 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 10:58:51" (1/1) ... [2022-04-28 10:58:51,562 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 10:58:51" (1/1) ... [2022-04-28 10:58:51,571 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 10:58:51" (1/1) ... [2022-04-28 10:58:51,576 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 10:58:51" (1/1) ... [2022-04-28 10:58:51,578 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 10:58:51" (1/1) ... [2022-04-28 10:58:51,583 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-28 10:58:51,584 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-28 10:58:51,584 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-28 10:58:51,584 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-28 10:58:51,585 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 10:58:51" (1/1) ... [2022-04-28 10:58:51,590 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-28 10:58:51,596 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:58:51,613 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-28 10:58:51,626 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-28 10:58:51,642 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-28 10:58:51,642 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-28 10:58:51,642 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-28 10:58:51,642 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-28 10:58:51,643 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-28 10:58:51,643 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-28 10:58:51,643 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-28 10:58:51,643 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-28 10:58:51,643 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-28 10:58:51,643 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-28 10:58:51,644 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_short [2022-04-28 10:58:51,644 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-28 10:58:51,644 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-28 10:58:51,644 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-28 10:58:51,645 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-28 10:58:51,646 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-28 10:58:51,646 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-28 10:58:51,646 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-28 10:58:51,646 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-28 10:58:51,646 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-28 10:58:51,695 INFO L234 CfgBuilder]: Building ICFG [2022-04-28 10:58:51,697 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-28 10:58:51,849 INFO L275 CfgBuilder]: Performing block encoding [2022-04-28 10:58:51,857 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-28 10:58:51,857 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-28 10:58:51,858 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.04 10:58:51 BoogieIcfgContainer [2022-04-28 10:58:51,858 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-28 10:58:51,859 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-28 10:58:51,860 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-28 10:58:51,864 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-28 10:58:51,865 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.04 10:58:51" (1/3) ... [2022-04-28 10:58:51,865 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@39cdc645 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.04 10:58:51, skipping insertion in model container [2022-04-28 10:58:51,865 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 10:58:51" (2/3) ... [2022-04-28 10:58:51,866 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@39cdc645 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.04 10:58:51, skipping insertion in model container [2022-04-28 10:58:51,866 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.04 10:58:51" (3/3) ... [2022-04-28 10:58:51,866 INFO L111 eAbstractionObserver]: Analyzing ICFG ps6-ll.c [2022-04-28 10:58:51,875 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-04-28 10:58:51,875 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-28 10:58:51,902 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-28 10:58:51,906 INFO L357 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, mPorIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@5bb91d6a, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@6ad11220 [2022-04-28 10:58:51,906 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-28 10:58:51,911 INFO L276 IsEmpty]: Start isEmpty. Operand has 28 states, 16 states have (on average 1.375) internal successors, (22), 17 states have internal predecessors, (22), 6 states have call successors, (6), 4 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-28 10:58:51,915 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-04-28 10:58:51,916 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:58:51,916 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:58:51,916 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:58:51,919 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:58:51,919 INFO L85 PathProgramCache]: Analyzing trace with hash -630235283, now seen corresponding path program 1 times [2022-04-28 10:58:51,924 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:58:51,924 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1387905939] [2022-04-28 10:58:51,931 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 10:58:51,931 INFO L85 PathProgramCache]: Analyzing trace with hash -630235283, now seen corresponding path program 2 times [2022-04-28 10:58:51,933 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:58:51,933 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [294001662] [2022-04-28 10:58:51,933 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:58:51,934 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:58:52,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:58:52,065 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:58:52,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:58:52,089 INFO L290 TraceCheckUtils]: 0: Hoare triple {40#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3); {31#true} is VALID [2022-04-28 10:58:52,090 INFO L290 TraceCheckUtils]: 1: Hoare triple {31#true} assume true; {31#true} is VALID [2022-04-28 10:58:52,090 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {31#true} {31#true} #60#return; {31#true} is VALID [2022-04-28 10:58:52,091 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-28 10:58:52,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:58:52,105 INFO L290 TraceCheckUtils]: 0: Hoare triple {31#true} ~cond := #in~cond; {31#true} is VALID [2022-04-28 10:58:52,106 INFO L290 TraceCheckUtils]: 1: Hoare triple {31#true} assume 0 == ~cond;assume false; {32#false} is VALID [2022-04-28 10:58:52,106 INFO L290 TraceCheckUtils]: 2: Hoare triple {32#false} assume true; {32#false} is VALID [2022-04-28 10:58:52,107 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {32#false} {31#true} #52#return; {32#false} is VALID [2022-04-28 10:58:52,108 INFO L272 TraceCheckUtils]: 0: Hoare triple {31#true} call ULTIMATE.init(); {40#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 10:58:52,108 INFO L290 TraceCheckUtils]: 1: Hoare triple {40#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3); {31#true} is VALID [2022-04-28 10:58:52,108 INFO L290 TraceCheckUtils]: 2: Hoare triple {31#true} assume true; {31#true} is VALID [2022-04-28 10:58:52,109 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {31#true} {31#true} #60#return; {31#true} is VALID [2022-04-28 10:58:52,109 INFO L272 TraceCheckUtils]: 4: Hoare triple {31#true} call #t~ret5 := main(); {31#true} is VALID [2022-04-28 10:58:52,110 INFO L290 TraceCheckUtils]: 5: Hoare triple {31#true} havoc ~k~0;havoc ~y~0;havoc ~x~0;havoc ~c~0;assume -32768 <= #t~nondet4 && #t~nondet4 <= 32767;~k~0 := #t~nondet4;havoc #t~nondet4; {31#true} is VALID [2022-04-28 10:58:52,110 INFO L272 TraceCheckUtils]: 6: Hoare triple {31#true} call assume_abort_if_not((if ~k~0 <= 256 then 1 else 0)); {31#true} is VALID [2022-04-28 10:58:52,110 INFO L290 TraceCheckUtils]: 7: Hoare triple {31#true} ~cond := #in~cond; {31#true} is VALID [2022-04-28 10:58:52,110 INFO L290 TraceCheckUtils]: 8: Hoare triple {31#true} assume 0 == ~cond;assume false; {32#false} is VALID [2022-04-28 10:58:52,110 INFO L290 TraceCheckUtils]: 9: Hoare triple {32#false} assume true; {32#false} is VALID [2022-04-28 10:58:52,111 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {32#false} {31#true} #52#return; {32#false} is VALID [2022-04-28 10:58:52,112 INFO L290 TraceCheckUtils]: 11: Hoare triple {32#false} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {32#false} is VALID [2022-04-28 10:58:52,112 INFO L290 TraceCheckUtils]: 12: Hoare triple {32#false} assume false; {32#false} is VALID [2022-04-28 10:58:52,112 INFO L272 TraceCheckUtils]: 13: Hoare triple {32#false} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {32#false} is VALID [2022-04-28 10:58:52,112 INFO L290 TraceCheckUtils]: 14: Hoare triple {32#false} ~cond := #in~cond; {32#false} is VALID [2022-04-28 10:58:52,112 INFO L290 TraceCheckUtils]: 15: Hoare triple {32#false} assume 0 == ~cond; {32#false} is VALID [2022-04-28 10:58:52,112 INFO L290 TraceCheckUtils]: 16: Hoare triple {32#false} assume !false; {32#false} is VALID [2022-04-28 10:58:52,113 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 10:58:52,113 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:58:52,113 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [294001662] [2022-04-28 10:58:52,114 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [294001662] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:58:52,114 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:58:52,114 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-28 10:58:52,118 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:58:52,119 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1387905939] [2022-04-28 10:58:52,119 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1387905939] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:58:52,119 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:58:52,119 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-28 10:58:52,120 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1371884298] [2022-04-28 10:58:52,120 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:58:52,124 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 17 [2022-04-28 10:58:52,125 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:58:52,128 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-28 10:58:52,153 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 17 edges. 17 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:58:52,153 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-28 10:58:52,154 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:58:52,170 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-28 10:58:52,171 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-28 10:58:52,173 INFO L87 Difference]: Start difference. First operand has 28 states, 16 states have (on average 1.375) internal successors, (22), 17 states have internal predecessors, (22), 6 states have call successors, (6), 4 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-28 10:58:52,589 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:58:52,590 INFO L93 Difference]: Finished difference Result 47 states and 61 transitions. [2022-04-28 10:58:52,590 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-28 10:58:52,590 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 17 [2022-04-28 10:58:52,590 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:58:52,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-28 10:58:52,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 61 transitions. [2022-04-28 10:58:52,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-28 10:58:52,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 61 transitions. [2022-04-28 10:58:52,602 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 61 transitions. [2022-04-28 10:58:52,689 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 61 edges. 61 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:58:52,695 INFO L225 Difference]: With dead ends: 47 [2022-04-28 10:58:52,695 INFO L226 Difference]: Without dead ends: 23 [2022-04-28 10:58:52,697 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-28 10:58:52,700 INFO L413 NwaCegarLoop]: 26 mSDtfsCounter, 15 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 29 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 10:58:52,701 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 29 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 10:58:52,717 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2022-04-28 10:58:52,725 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2022-04-28 10:58:52,726 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:58:52,726 INFO L82 GeneralOperation]: Start isEquivalent. First operand 23 states. Second operand has 23 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 14 states have internal predecessors, (15), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-28 10:58:52,727 INFO L74 IsIncluded]: Start isIncluded. First operand 23 states. Second operand has 23 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 14 states have internal predecessors, (15), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-28 10:58:52,727 INFO L87 Difference]: Start difference. First operand 23 states. Second operand has 23 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 14 states have internal predecessors, (15), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-28 10:58:52,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:58:52,730 INFO L93 Difference]: Finished difference Result 23 states and 25 transitions. [2022-04-28 10:58:52,730 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 25 transitions. [2022-04-28 10:58:52,730 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:58:52,731 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:58:52,731 INFO L74 IsIncluded]: Start isIncluded. First operand has 23 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 14 states have internal predecessors, (15), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand 23 states. [2022-04-28 10:58:52,731 INFO L87 Difference]: Start difference. First operand has 23 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 14 states have internal predecessors, (15), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand 23 states. [2022-04-28 10:58:52,737 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:58:52,737 INFO L93 Difference]: Finished difference Result 23 states and 25 transitions. [2022-04-28 10:58:52,737 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 25 transitions. [2022-04-28 10:58:52,737 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:58:52,737 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:58:52,737 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:58:52,738 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:58:52,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 14 states have internal predecessors, (15), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-28 10:58:52,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 25 transitions. [2022-04-28 10:58:52,740 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 25 transitions. Word has length 17 [2022-04-28 10:58:52,741 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:58:52,741 INFO L495 AbstractCegarLoop]: Abstraction has 23 states and 25 transitions. [2022-04-28 10:58:52,741 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-28 10:58:52,741 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 23 states and 25 transitions. [2022-04-28 10:58:52,774 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-28 10:58:52,774 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 25 transitions. [2022-04-28 10:58:52,774 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-04-28 10:58:52,774 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:58:52,775 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:58:52,775 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-28 10:58:52,775 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:58:52,776 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:58:52,776 INFO L85 PathProgramCache]: Analyzing trace with hash 51610547, now seen corresponding path program 1 times [2022-04-28 10:58:52,776 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:58:52,776 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1809308609] [2022-04-28 10:58:52,776 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 10:58:52,777 INFO L85 PathProgramCache]: Analyzing trace with hash 51610547, now seen corresponding path program 2 times [2022-04-28 10:58:52,777 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:58:52,777 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1648947054] [2022-04-28 10:58:52,777 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:58:52,777 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:58:52,802 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 10:58:52,802 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1411472656] [2022-04-28 10:58:52,803 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 10:58:52,803 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:58:52,803 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:58:52,822 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-28 10:58:52,835 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-28 10:58:52,894 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-04-28 10:58:52,894 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:58:52,899 INFO L263 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-28 10:58:52,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:58:52,918 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:58:53,055 INFO L272 TraceCheckUtils]: 0: Hoare triple {229#true} call ULTIMATE.init(); {229#true} is VALID [2022-04-28 10:58:53,055 INFO L290 TraceCheckUtils]: 1: Hoare triple {229#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3); {229#true} is VALID [2022-04-28 10:58:53,056 INFO L290 TraceCheckUtils]: 2: Hoare triple {229#true} assume true; {229#true} is VALID [2022-04-28 10:58:53,056 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {229#true} {229#true} #60#return; {229#true} is VALID [2022-04-28 10:58:53,056 INFO L272 TraceCheckUtils]: 4: Hoare triple {229#true} call #t~ret5 := main(); {229#true} is VALID [2022-04-28 10:58:53,056 INFO L290 TraceCheckUtils]: 5: Hoare triple {229#true} havoc ~k~0;havoc ~y~0;havoc ~x~0;havoc ~c~0;assume -32768 <= #t~nondet4 && #t~nondet4 <= 32767;~k~0 := #t~nondet4;havoc #t~nondet4; {229#true} is VALID [2022-04-28 10:58:53,056 INFO L272 TraceCheckUtils]: 6: Hoare triple {229#true} call assume_abort_if_not((if ~k~0 <= 256 then 1 else 0)); {229#true} is VALID [2022-04-28 10:58:53,056 INFO L290 TraceCheckUtils]: 7: Hoare triple {229#true} ~cond := #in~cond; {229#true} is VALID [2022-04-28 10:58:53,056 INFO L290 TraceCheckUtils]: 8: Hoare triple {229#true} assume !(0 == ~cond); {229#true} is VALID [2022-04-28 10:58:53,057 INFO L290 TraceCheckUtils]: 9: Hoare triple {229#true} assume true; {229#true} is VALID [2022-04-28 10:58:53,057 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {229#true} {229#true} #52#return; {229#true} is VALID [2022-04-28 10:58:53,058 INFO L290 TraceCheckUtils]: 11: Hoare triple {229#true} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {267#(and (= main_~x~0 0) (= main_~y~0 0))} is VALID [2022-04-28 10:58:53,058 INFO L290 TraceCheckUtils]: 12: Hoare triple {267#(and (= main_~x~0 0) (= main_~y~0 0))} assume !false; {267#(and (= main_~x~0 0) (= main_~y~0 0))} is VALID [2022-04-28 10:58:53,059 INFO L272 TraceCheckUtils]: 13: Hoare triple {267#(and (= main_~x~0 0) (= main_~y~0 0))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {274#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 10:58:53,059 INFO L290 TraceCheckUtils]: 14: Hoare triple {274#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {278#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 10:58:53,060 INFO L290 TraceCheckUtils]: 15: Hoare triple {278#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {230#false} is VALID [2022-04-28 10:58:53,060 INFO L290 TraceCheckUtils]: 16: Hoare triple {230#false} assume !false; {230#false} is VALID [2022-04-28 10:58:53,060 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 10:58:53,060 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-28 10:58:53,060 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:58:53,061 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1648947054] [2022-04-28 10:58:53,061 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 10:58:53,061 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1411472656] [2022-04-28 10:58:53,061 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1411472656] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:58:53,061 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:58:53,061 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 10:58:53,062 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:58:53,062 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1809308609] [2022-04-28 10:58:53,062 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1809308609] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:58:53,062 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:58:53,062 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 10:58:53,062 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1746436470] [2022-04-28 10:58:53,062 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:58:53,063 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 17 [2022-04-28 10:58:53,063 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:58:53,063 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-28 10:58:53,092 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 17 edges. 17 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:58:53,092 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 10:58:53,092 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:58:53,093 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 10:58:53,094 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-28 10:58:53,096 INFO L87 Difference]: Start difference. First operand 23 states and 25 transitions. Second operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-28 10:58:53,229 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:58:53,229 INFO L93 Difference]: Finished difference Result 34 states and 38 transitions. [2022-04-28 10:58:53,229 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 10:58:53,229 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 17 [2022-04-28 10:58:53,230 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:58:53,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-28 10:58:53,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 38 transitions. [2022-04-28 10:58:53,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-28 10:58:53,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 38 transitions. [2022-04-28 10:58:53,241 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 38 transitions. [2022-04-28 10:58:53,274 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 38 edges. 38 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:58:53,276 INFO L225 Difference]: With dead ends: 34 [2022-04-28 10:58:53,276 INFO L226 Difference]: Without dead ends: 30 [2022-04-28 10:58:53,277 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-28 10:58:53,279 INFO L413 NwaCegarLoop]: 22 mSDtfsCounter, 6 mSDsluCounter, 55 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 77 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 10:58:53,283 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 77 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 10:58:53,285 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2022-04-28 10:58:53,295 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2022-04-28 10:58:53,296 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:58:53,296 INFO L82 GeneralOperation]: Start isEquivalent. First operand 30 states. Second operand has 30 states, 18 states have (on average 1.1111111111111112) internal successors, (20), 19 states have internal predecessors, (20), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-28 10:58:53,297 INFO L74 IsIncluded]: Start isIncluded. First operand 30 states. Second operand has 30 states, 18 states have (on average 1.1111111111111112) internal successors, (20), 19 states have internal predecessors, (20), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-28 10:58:53,297 INFO L87 Difference]: Start difference. First operand 30 states. Second operand has 30 states, 18 states have (on average 1.1111111111111112) internal successors, (20), 19 states have internal predecessors, (20), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-28 10:58:53,305 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:58:53,305 INFO L93 Difference]: Finished difference Result 30 states and 32 transitions. [2022-04-28 10:58:53,306 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 32 transitions. [2022-04-28 10:58:53,306 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:58:53,307 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:58:53,307 INFO L74 IsIncluded]: Start isIncluded. First operand has 30 states, 18 states have (on average 1.1111111111111112) internal successors, (20), 19 states have internal predecessors, (20), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand 30 states. [2022-04-28 10:58:53,308 INFO L87 Difference]: Start difference. First operand has 30 states, 18 states have (on average 1.1111111111111112) internal successors, (20), 19 states have internal predecessors, (20), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand 30 states. [2022-04-28 10:58:53,310 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:58:53,310 INFO L93 Difference]: Finished difference Result 30 states and 32 transitions. [2022-04-28 10:58:53,310 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 32 transitions. [2022-04-28 10:58:53,311 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:58:53,311 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:58:53,311 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:58:53,311 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:58:53,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 18 states have (on average 1.1111111111111112) internal successors, (20), 19 states have internal predecessors, (20), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-28 10:58:53,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 32 transitions. [2022-04-28 10:58:53,319 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 32 transitions. Word has length 17 [2022-04-28 10:58:53,320 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:58:53,320 INFO L495 AbstractCegarLoop]: Abstraction has 30 states and 32 transitions. [2022-04-28 10:58:53,320 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-28 10:58:53,321 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 30 states and 32 transitions. [2022-04-28 10:58:53,349 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-28 10:58:53,349 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 32 transitions. [2022-04-28 10:58:53,351 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-04-28 10:58:53,351 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:58:53,352 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:58:53,372 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-28 10:58:53,569 WARN L477 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-28 10:58:53,570 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:58:53,570 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:58:53,570 INFO L85 PathProgramCache]: Analyzing trace with hash 311787922, now seen corresponding path program 1 times [2022-04-28 10:58:53,571 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:58:53,571 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1653552433] [2022-04-28 10:58:53,846 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:58:53,847 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:58:53,847 INFO L85 PathProgramCache]: Analyzing trace with hash 311787922, now seen corresponding path program 2 times [2022-04-28 10:58:53,847 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:58:53,847 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1447850601] [2022-04-28 10:58:53,847 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:58:53,848 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:58:53,863 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 10:58:53,863 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2065769361] [2022-04-28 10:58:53,863 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 10:58:53,863 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:58:53,864 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:58:53,864 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-28 10:58:53,866 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-28 10:58:53,901 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 10:58:53,902 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:58:53,902 INFO L263 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 11 conjunts are in the unsatisfiable core [2022-04-28 10:58:53,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:58:53,910 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:58:54,035 INFO L272 TraceCheckUtils]: 0: Hoare triple {474#true} call ULTIMATE.init(); {474#true} is VALID [2022-04-28 10:58:54,036 INFO L290 TraceCheckUtils]: 1: Hoare triple {474#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3); {474#true} is VALID [2022-04-28 10:58:54,037 INFO L290 TraceCheckUtils]: 2: Hoare triple {474#true} assume true; {474#true} is VALID [2022-04-28 10:58:54,037 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {474#true} {474#true} #60#return; {474#true} is VALID [2022-04-28 10:58:54,038 INFO L272 TraceCheckUtils]: 4: Hoare triple {474#true} call #t~ret5 := main(); {474#true} is VALID [2022-04-28 10:58:54,038 INFO L290 TraceCheckUtils]: 5: Hoare triple {474#true} havoc ~k~0;havoc ~y~0;havoc ~x~0;havoc ~c~0;assume -32768 <= #t~nondet4 && #t~nondet4 <= 32767;~k~0 := #t~nondet4;havoc #t~nondet4; {474#true} is VALID [2022-04-28 10:58:54,038 INFO L272 TraceCheckUtils]: 6: Hoare triple {474#true} call assume_abort_if_not((if ~k~0 <= 256 then 1 else 0)); {474#true} is VALID [2022-04-28 10:58:54,038 INFO L290 TraceCheckUtils]: 7: Hoare triple {474#true} ~cond := #in~cond; {474#true} is VALID [2022-04-28 10:58:54,042 INFO L290 TraceCheckUtils]: 8: Hoare triple {474#true} assume !(0 == ~cond); {474#true} is VALID [2022-04-28 10:58:54,042 INFO L290 TraceCheckUtils]: 9: Hoare triple {474#true} assume true; {474#true} is VALID [2022-04-28 10:58:54,042 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {474#true} {474#true} #52#return; {474#true} is VALID [2022-04-28 10:58:54,043 INFO L290 TraceCheckUtils]: 11: Hoare triple {474#true} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {512#(and (= main_~x~0 0) (= main_~y~0 0))} is VALID [2022-04-28 10:58:54,044 INFO L290 TraceCheckUtils]: 12: Hoare triple {512#(and (= main_~x~0 0) (= main_~y~0 0))} assume !false; {512#(and (= main_~x~0 0) (= main_~y~0 0))} is VALID [2022-04-28 10:58:54,044 INFO L272 TraceCheckUtils]: 13: Hoare triple {512#(and (= main_~x~0 0) (= main_~y~0 0))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {474#true} is VALID [2022-04-28 10:58:54,046 INFO L290 TraceCheckUtils]: 14: Hoare triple {474#true} ~cond := #in~cond; {474#true} is VALID [2022-04-28 10:58:54,046 INFO L290 TraceCheckUtils]: 15: Hoare triple {474#true} assume !(0 == ~cond); {474#true} is VALID [2022-04-28 10:58:54,047 INFO L290 TraceCheckUtils]: 16: Hoare triple {474#true} assume true; {474#true} is VALID [2022-04-28 10:58:54,047 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {474#true} {512#(and (= main_~x~0 0) (= main_~y~0 0))} #54#return; {512#(and (= main_~x~0 0) (= main_~y~0 0))} is VALID [2022-04-28 10:58:54,048 INFO L290 TraceCheckUtils]: 18: Hoare triple {512#(and (= main_~x~0 0) (= main_~y~0 0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {534#(and (= main_~y~0 1) (= main_~x~0 (* main_~y~0 (* (* main_~y~0 (* main_~y~0 main_~y~0)) main_~y~0))))} is VALID [2022-04-28 10:58:54,049 INFO L290 TraceCheckUtils]: 19: Hoare triple {534#(and (= main_~y~0 1) (= main_~x~0 (* main_~y~0 (* (* main_~y~0 (* main_~y~0 main_~y~0)) main_~y~0))))} assume !false; {534#(and (= main_~y~0 1) (= main_~x~0 (* main_~y~0 (* (* main_~y~0 (* main_~y~0 main_~y~0)) main_~y~0))))} is VALID [2022-04-28 10:58:54,049 INFO L272 TraceCheckUtils]: 20: Hoare triple {534#(and (= main_~y~0 1) (= main_~x~0 (* main_~y~0 (* (* main_~y~0 (* main_~y~0 main_~y~0)) main_~y~0))))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {541#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 10:58:54,050 INFO L290 TraceCheckUtils]: 21: Hoare triple {541#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {545#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 10:58:54,050 INFO L290 TraceCheckUtils]: 22: Hoare triple {545#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {475#false} is VALID [2022-04-28 10:58:54,051 INFO L290 TraceCheckUtils]: 23: Hoare triple {475#false} assume !false; {475#false} is VALID [2022-04-28 10:58:54,052 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 10:58:54,052 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:58:54,205 INFO L290 TraceCheckUtils]: 23: Hoare triple {475#false} assume !false; {475#false} is VALID [2022-04-28 10:58:54,206 INFO L290 TraceCheckUtils]: 22: Hoare triple {545#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {475#false} is VALID [2022-04-28 10:58:54,206 INFO L290 TraceCheckUtils]: 21: Hoare triple {541#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {545#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 10:58:54,207 INFO L272 TraceCheckUtils]: 20: Hoare triple {561#(= (+ (* 2 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (* 6 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (* 5 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0))) (+ (* main_~x~0 12) (* main_~y~0 main_~y~0)))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {541#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 10:58:54,208 INFO L290 TraceCheckUtils]: 19: Hoare triple {561#(= (+ (* 2 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (* 6 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (* 5 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0))) (+ (* main_~x~0 12) (* main_~y~0 main_~y~0)))} assume !false; {561#(= (+ (* 2 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (* 6 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (* 5 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0))) (+ (* main_~x~0 12) (* main_~y~0 main_~y~0)))} is VALID [2022-04-28 10:58:54,324 INFO L290 TraceCheckUtils]: 18: Hoare triple {561#(= (+ (* 2 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (* 6 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (* 5 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0))) (+ (* main_~x~0 12) (* main_~y~0 main_~y~0)))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {561#(= (+ (* 2 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (* 6 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (* 5 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0))) (+ (* main_~x~0 12) (* main_~y~0 main_~y~0)))} is VALID [2022-04-28 10:58:54,325 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {474#true} {561#(= (+ (* 2 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (* 6 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (* 5 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0))) (+ (* main_~x~0 12) (* main_~y~0 main_~y~0)))} #54#return; {561#(= (+ (* 2 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (* 6 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (* 5 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0))) (+ (* main_~x~0 12) (* main_~y~0 main_~y~0)))} is VALID [2022-04-28 10:58:54,325 INFO L290 TraceCheckUtils]: 16: Hoare triple {474#true} assume true; {474#true} is VALID [2022-04-28 10:58:54,325 INFO L290 TraceCheckUtils]: 15: Hoare triple {474#true} assume !(0 == ~cond); {474#true} is VALID [2022-04-28 10:58:54,325 INFO L290 TraceCheckUtils]: 14: Hoare triple {474#true} ~cond := #in~cond; {474#true} is VALID [2022-04-28 10:58:54,326 INFO L272 TraceCheckUtils]: 13: Hoare triple {561#(= (+ (* 2 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (* 6 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (* 5 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0))) (+ (* main_~x~0 12) (* main_~y~0 main_~y~0)))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {474#true} is VALID [2022-04-28 10:58:54,326 INFO L290 TraceCheckUtils]: 12: Hoare triple {561#(= (+ (* 2 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (* 6 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (* 5 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0))) (+ (* main_~x~0 12) (* main_~y~0 main_~y~0)))} assume !false; {561#(= (+ (* 2 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (* 6 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (* 5 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0))) (+ (* main_~x~0 12) (* main_~y~0 main_~y~0)))} is VALID [2022-04-28 10:58:54,327 INFO L290 TraceCheckUtils]: 11: Hoare triple {474#true} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {561#(= (+ (* 2 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (* 6 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (* 5 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0))) (+ (* main_~x~0 12) (* main_~y~0 main_~y~0)))} is VALID [2022-04-28 10:58:54,327 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {474#true} {474#true} #52#return; {474#true} is VALID [2022-04-28 10:58:54,327 INFO L290 TraceCheckUtils]: 9: Hoare triple {474#true} assume true; {474#true} is VALID [2022-04-28 10:58:54,327 INFO L290 TraceCheckUtils]: 8: Hoare triple {474#true} assume !(0 == ~cond); {474#true} is VALID [2022-04-28 10:58:54,327 INFO L290 TraceCheckUtils]: 7: Hoare triple {474#true} ~cond := #in~cond; {474#true} is VALID [2022-04-28 10:58:54,328 INFO L272 TraceCheckUtils]: 6: Hoare triple {474#true} call assume_abort_if_not((if ~k~0 <= 256 then 1 else 0)); {474#true} is VALID [2022-04-28 10:58:54,328 INFO L290 TraceCheckUtils]: 5: Hoare triple {474#true} havoc ~k~0;havoc ~y~0;havoc ~x~0;havoc ~c~0;assume -32768 <= #t~nondet4 && #t~nondet4 <= 32767;~k~0 := #t~nondet4;havoc #t~nondet4; {474#true} is VALID [2022-04-28 10:58:54,328 INFO L272 TraceCheckUtils]: 4: Hoare triple {474#true} call #t~ret5 := main(); {474#true} is VALID [2022-04-28 10:58:54,328 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {474#true} {474#true} #60#return; {474#true} is VALID [2022-04-28 10:58:54,328 INFO L290 TraceCheckUtils]: 2: Hoare triple {474#true} assume true; {474#true} is VALID [2022-04-28 10:58:54,328 INFO L290 TraceCheckUtils]: 1: Hoare triple {474#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3); {474#true} is VALID [2022-04-28 10:58:54,329 INFO L272 TraceCheckUtils]: 0: Hoare triple {474#true} call ULTIMATE.init(); {474#true} is VALID [2022-04-28 10:58:54,330 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-28 10:58:54,330 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:58:54,330 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1447850601] [2022-04-28 10:58:54,330 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 10:58:54,330 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2065769361] [2022-04-28 10:58:54,330 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2065769361] provided 1 perfect and 1 imperfect interpolant sequences [2022-04-28 10:58:54,331 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-04-28 10:58:54,331 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 7 [2022-04-28 10:58:54,331 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:58:54,331 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1653552433] [2022-04-28 10:58:54,331 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1653552433] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:58:54,331 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:58:54,331 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 10:58:54,332 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [813030459] [2022-04-28 10:58:54,332 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:58:54,332 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 24 [2022-04-28 10:58:54,332 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:58:54,333 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-28 10:58:54,519 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 23 edges. 23 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:58:54,520 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 10:58:54,520 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:58:54,520 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 10:58:54,520 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-04-28 10:58:54,521 INFO L87 Difference]: Start difference. First operand 30 states and 32 transitions. Second operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-28 10:58:54,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:58:54,660 INFO L93 Difference]: Finished difference Result 36 states and 37 transitions. [2022-04-28 10:58:54,660 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 10:58:54,660 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 24 [2022-04-28 10:58:54,660 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:58:54,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-28 10:58:54,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 30 transitions. [2022-04-28 10:58:54,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-28 10:58:54,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 30 transitions. [2022-04-28 10:58:54,663 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 30 transitions. [2022-04-28 10:58:54,786 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 30 edges. 30 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:58:54,787 INFO L225 Difference]: With dead ends: 36 [2022-04-28 10:58:54,787 INFO L226 Difference]: Without dead ends: 32 [2022-04-28 10:58:54,787 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 40 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-04-28 10:58:54,789 INFO L413 NwaCegarLoop]: 20 mSDtfsCounter, 6 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 67 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 10:58:54,789 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 67 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 10:58:54,790 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2022-04-28 10:58:54,801 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2022-04-28 10:58:54,801 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:58:54,801 INFO L82 GeneralOperation]: Start isEquivalent. First operand 32 states. Second operand has 32 states, 20 states have (on average 1.05) internal successors, (21), 20 states have internal predecessors, (21), 7 states have call successors, (7), 6 states have call predecessors, (7), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-28 10:58:54,801 INFO L74 IsIncluded]: Start isIncluded. First operand 32 states. Second operand has 32 states, 20 states have (on average 1.05) internal successors, (21), 20 states have internal predecessors, (21), 7 states have call successors, (7), 6 states have call predecessors, (7), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-28 10:58:54,802 INFO L87 Difference]: Start difference. First operand 32 states. Second operand has 32 states, 20 states have (on average 1.05) internal successors, (21), 20 states have internal predecessors, (21), 7 states have call successors, (7), 6 states have call predecessors, (7), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-28 10:58:54,803 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:58:54,803 INFO L93 Difference]: Finished difference Result 32 states and 33 transitions. [2022-04-28 10:58:54,803 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 33 transitions. [2022-04-28 10:58:54,803 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:58:54,803 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:58:54,804 INFO L74 IsIncluded]: Start isIncluded. First operand has 32 states, 20 states have (on average 1.05) internal successors, (21), 20 states have internal predecessors, (21), 7 states have call successors, (7), 6 states have call predecessors, (7), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand 32 states. [2022-04-28 10:58:54,804 INFO L87 Difference]: Start difference. First operand has 32 states, 20 states have (on average 1.05) internal successors, (21), 20 states have internal predecessors, (21), 7 states have call successors, (7), 6 states have call predecessors, (7), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand 32 states. [2022-04-28 10:58:54,805 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:58:54,805 INFO L93 Difference]: Finished difference Result 32 states and 33 transitions. [2022-04-28 10:58:54,805 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 33 transitions. [2022-04-28 10:58:54,805 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:58:54,806 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:58:54,806 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:58:54,806 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:58:54,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 20 states have (on average 1.05) internal successors, (21), 20 states have internal predecessors, (21), 7 states have call successors, (7), 6 states have call predecessors, (7), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-28 10:58:54,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 33 transitions. [2022-04-28 10:58:54,807 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 33 transitions. Word has length 24 [2022-04-28 10:58:54,807 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:58:54,807 INFO L495 AbstractCegarLoop]: Abstraction has 32 states and 33 transitions. [2022-04-28 10:58:54,807 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-28 10:58:54,808 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 32 states and 33 transitions. [2022-04-28 10:58:54,919 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 33 edges. 33 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:58:54,919 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 33 transitions. [2022-04-28 10:58:54,920 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-04-28 10:58:54,920 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:58:54,920 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:58:54,938 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-28 10:58:55,120 WARN L477 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-28 10:58:55,121 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:58:55,121 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:58:55,121 INFO L85 PathProgramCache]: Analyzing trace with hash 1106328449, now seen corresponding path program 1 times [2022-04-28 10:58:55,121 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:58:55,121 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1133911958] [2022-04-28 10:58:55,232 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:58:55,232 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:58:55,232 INFO L85 PathProgramCache]: Analyzing trace with hash 1106328449, now seen corresponding path program 2 times [2022-04-28 10:58:55,232 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:58:55,232 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1545269978] [2022-04-28 10:58:55,232 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:58:55,233 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:58:55,243 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 10:58:55,243 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [106616716] [2022-04-28 10:58:55,243 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 10:58:55,243 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:58:55,243 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:58:55,246 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-28 10:58:55,247 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-28 10:58:55,280 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 10:58:55,280 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:58:55,281 INFO L263 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 12 conjunts are in the unsatisfiable core [2022-04-28 10:58:55,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:58:55,291 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:58:55,526 INFO L272 TraceCheckUtils]: 0: Hoare triple {826#true} call ULTIMATE.init(); {826#true} is VALID [2022-04-28 10:58:55,526 INFO L290 TraceCheckUtils]: 1: Hoare triple {826#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3); {826#true} is VALID [2022-04-28 10:58:55,527 INFO L290 TraceCheckUtils]: 2: Hoare triple {826#true} assume true; {826#true} is VALID [2022-04-28 10:58:55,527 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {826#true} {826#true} #60#return; {826#true} is VALID [2022-04-28 10:58:55,527 INFO L272 TraceCheckUtils]: 4: Hoare triple {826#true} call #t~ret5 := main(); {826#true} is VALID [2022-04-28 10:58:55,527 INFO L290 TraceCheckUtils]: 5: Hoare triple {826#true} havoc ~k~0;havoc ~y~0;havoc ~x~0;havoc ~c~0;assume -32768 <= #t~nondet4 && #t~nondet4 <= 32767;~k~0 := #t~nondet4;havoc #t~nondet4; {826#true} is VALID [2022-04-28 10:58:55,527 INFO L272 TraceCheckUtils]: 6: Hoare triple {826#true} call assume_abort_if_not((if ~k~0 <= 256 then 1 else 0)); {826#true} is VALID [2022-04-28 10:58:55,527 INFO L290 TraceCheckUtils]: 7: Hoare triple {826#true} ~cond := #in~cond; {826#true} is VALID [2022-04-28 10:58:55,527 INFO L290 TraceCheckUtils]: 8: Hoare triple {826#true} assume !(0 == ~cond); {826#true} is VALID [2022-04-28 10:58:55,528 INFO L290 TraceCheckUtils]: 9: Hoare triple {826#true} assume true; {826#true} is VALID [2022-04-28 10:58:55,528 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {826#true} {826#true} #52#return; {826#true} is VALID [2022-04-28 10:58:55,528 INFO L290 TraceCheckUtils]: 11: Hoare triple {826#true} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {864#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-28 10:58:55,528 INFO L290 TraceCheckUtils]: 12: Hoare triple {864#(and (= main_~c~0 0) (= main_~y~0 0))} assume !false; {864#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-28 10:58:55,528 INFO L272 TraceCheckUtils]: 13: Hoare triple {864#(and (= main_~c~0 0) (= main_~y~0 0))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {826#true} is VALID [2022-04-28 10:58:55,529 INFO L290 TraceCheckUtils]: 14: Hoare triple {826#true} ~cond := #in~cond; {826#true} is VALID [2022-04-28 10:58:55,529 INFO L290 TraceCheckUtils]: 15: Hoare triple {826#true} assume !(0 == ~cond); {826#true} is VALID [2022-04-28 10:58:55,529 INFO L290 TraceCheckUtils]: 16: Hoare triple {826#true} assume true; {826#true} is VALID [2022-04-28 10:58:55,531 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {826#true} {864#(and (= main_~c~0 0) (= main_~y~0 0))} #54#return; {864#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-28 10:58:55,531 INFO L290 TraceCheckUtils]: 18: Hoare triple {864#(and (= main_~c~0 0) (= main_~y~0 0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {886#(and (= (+ (- 1) main_~y~0) 0) (< 0 main_~k~0) (<= main_~c~0 1))} is VALID [2022-04-28 10:58:55,532 INFO L290 TraceCheckUtils]: 19: Hoare triple {886#(and (= (+ (- 1) main_~y~0) 0) (< 0 main_~k~0) (<= main_~c~0 1))} assume !false; {886#(and (= (+ (- 1) main_~y~0) 0) (< 0 main_~k~0) (<= main_~c~0 1))} is VALID [2022-04-28 10:58:55,532 INFO L272 TraceCheckUtils]: 20: Hoare triple {886#(and (= (+ (- 1) main_~y~0) 0) (< 0 main_~k~0) (<= main_~c~0 1))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {826#true} is VALID [2022-04-28 10:58:55,532 INFO L290 TraceCheckUtils]: 21: Hoare triple {826#true} ~cond := #in~cond; {826#true} is VALID [2022-04-28 10:58:55,532 INFO L290 TraceCheckUtils]: 22: Hoare triple {826#true} assume !(0 == ~cond); {826#true} is VALID [2022-04-28 10:58:55,532 INFO L290 TraceCheckUtils]: 23: Hoare triple {826#true} assume true; {826#true} is VALID [2022-04-28 10:58:55,533 INFO L284 TraceCheckUtils]: 24: Hoare quadruple {826#true} {886#(and (= (+ (- 1) main_~y~0) 0) (< 0 main_~k~0) (<= main_~c~0 1))} #54#return; {886#(and (= (+ (- 1) main_~y~0) 0) (< 0 main_~k~0) (<= main_~c~0 1))} is VALID [2022-04-28 10:58:55,533 INFO L290 TraceCheckUtils]: 25: Hoare triple {886#(and (= (+ (- 1) main_~y~0) 0) (< 0 main_~k~0) (<= main_~c~0 1))} assume !(~c~0 < ~k~0); {908#(and (= (+ (- 1) main_~y~0) 0) (<= main_~k~0 1) (< 0 main_~k~0))} is VALID [2022-04-28 10:58:55,534 INFO L272 TraceCheckUtils]: 26: Hoare triple {908#(and (= (+ (- 1) main_~y~0) 0) (<= main_~k~0 1) (< 0 main_~k~0))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {826#true} is VALID [2022-04-28 10:58:55,534 INFO L290 TraceCheckUtils]: 27: Hoare triple {826#true} ~cond := #in~cond; {826#true} is VALID [2022-04-28 10:58:55,534 INFO L290 TraceCheckUtils]: 28: Hoare triple {826#true} assume !(0 == ~cond); {826#true} is VALID [2022-04-28 10:58:55,534 INFO L290 TraceCheckUtils]: 29: Hoare triple {826#true} assume true; {826#true} is VALID [2022-04-28 10:58:55,535 INFO L284 TraceCheckUtils]: 30: Hoare quadruple {826#true} {908#(and (= (+ (- 1) main_~y~0) 0) (<= main_~k~0 1) (< 0 main_~k~0))} #56#return; {908#(and (= (+ (- 1) main_~y~0) 0) (<= main_~k~0 1) (< 0 main_~k~0))} is VALID [2022-04-28 10:58:55,548 INFO L272 TraceCheckUtils]: 31: Hoare triple {908#(and (= (+ (- 1) main_~y~0) 0) (<= main_~k~0 1) (< 0 main_~k~0))} call __VERIFIER_assert((if ~k~0 * ~y~0 == ~y~0 * ~y~0 then 1 else 0)); {927#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 10:58:55,549 INFO L290 TraceCheckUtils]: 32: Hoare triple {927#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {931#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 10:58:55,549 INFO L290 TraceCheckUtils]: 33: Hoare triple {931#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {827#false} is VALID [2022-04-28 10:58:55,549 INFO L290 TraceCheckUtils]: 34: Hoare triple {827#false} assume !false; {827#false} is VALID [2022-04-28 10:58:55,549 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-04-28 10:58:55,549 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:58:55,841 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:58:55,841 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1545269978] [2022-04-28 10:58:55,841 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 10:58:55,841 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [106616716] [2022-04-28 10:58:55,842 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [106616716] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 10:58:55,842 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-28 10:58:55,842 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2022-04-28 10:58:55,842 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:58:55,842 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1133911958] [2022-04-28 10:58:55,842 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1133911958] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:58:55,842 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:58:55,842 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-28 10:58:55,842 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [341988693] [2022-04-28 10:58:55,842 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:58:55,843 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 states have internal predecessors, (17), 4 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) Word has length 35 [2022-04-28 10:58:55,843 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:58:55,843 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 7 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 states have internal predecessors, (17), 4 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) [2022-04-28 10:58:55,866 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 29 edges. 29 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:58:55,866 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-28 10:58:55,866 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:58:55,867 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-28 10:58:55,867 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2022-04-28 10:58:55,867 INFO L87 Difference]: Start difference. First operand 32 states and 33 transitions. Second operand has 7 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 states have internal predecessors, (17), 4 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) [2022-04-28 10:58:56,093 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:58:56,094 INFO L93 Difference]: Finished difference Result 41 states and 44 transitions. [2022-04-28 10:58:56,094 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-28 10:58:56,094 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 states have internal predecessors, (17), 4 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) Word has length 35 [2022-04-28 10:58:56,094 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:58:56,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 states have internal predecessors, (17), 4 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) [2022-04-28 10:58:56,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 40 transitions. [2022-04-28 10:58:56,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 states have internal predecessors, (17), 4 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) [2022-04-28 10:58:56,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 40 transitions. [2022-04-28 10:58:56,097 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 40 transitions. [2022-04-28 10:58:56,126 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-28 10:58:56,127 INFO L225 Difference]: With dead ends: 41 [2022-04-28 10:58:56,127 INFO L226 Difference]: Without dead ends: 35 [2022-04-28 10:58:56,127 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 43 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2022-04-28 10:58:56,128 INFO L413 NwaCegarLoop]: 28 mSDtfsCounter, 2 mSDsluCounter, 97 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 125 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 57 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 10:58:56,128 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 125 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 10:58:56,129 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2022-04-28 10:58:56,147 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2022-04-28 10:58:56,148 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:58:56,148 INFO L82 GeneralOperation]: Start isEquivalent. First operand 35 states. Second operand has 35 states, 22 states have (on average 1.0454545454545454) internal successors, (23), 22 states have internal predecessors, (23), 8 states have call successors, (8), 6 states have call predecessors, (8), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-28 10:58:56,148 INFO L74 IsIncluded]: Start isIncluded. First operand 35 states. Second operand has 35 states, 22 states have (on average 1.0454545454545454) internal successors, (23), 22 states have internal predecessors, (23), 8 states have call successors, (8), 6 states have call predecessors, (8), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-28 10:58:56,148 INFO L87 Difference]: Start difference. First operand 35 states. Second operand has 35 states, 22 states have (on average 1.0454545454545454) internal successors, (23), 22 states have internal predecessors, (23), 8 states have call successors, (8), 6 states have call predecessors, (8), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-28 10:58:56,150 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:58:56,150 INFO L93 Difference]: Finished difference Result 35 states and 37 transitions. [2022-04-28 10:58:56,150 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 37 transitions. [2022-04-28 10:58:56,150 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:58:56,150 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:58:56,150 INFO L74 IsIncluded]: Start isIncluded. First operand has 35 states, 22 states have (on average 1.0454545454545454) internal successors, (23), 22 states have internal predecessors, (23), 8 states have call successors, (8), 6 states have call predecessors, (8), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand 35 states. [2022-04-28 10:58:56,150 INFO L87 Difference]: Start difference. First operand has 35 states, 22 states have (on average 1.0454545454545454) internal successors, (23), 22 states have internal predecessors, (23), 8 states have call successors, (8), 6 states have call predecessors, (8), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand 35 states. [2022-04-28 10:58:56,152 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:58:56,152 INFO L93 Difference]: Finished difference Result 35 states and 37 transitions. [2022-04-28 10:58:56,152 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 37 transitions. [2022-04-28 10:58:56,152 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:58:56,152 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:58:56,152 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:58:56,152 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:58:56,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 22 states have (on average 1.0454545454545454) internal successors, (23), 22 states have internal predecessors, (23), 8 states have call successors, (8), 6 states have call predecessors, (8), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-28 10:58:56,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 37 transitions. [2022-04-28 10:58:56,153 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 37 transitions. Word has length 35 [2022-04-28 10:58:56,153 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:58:56,154 INFO L495 AbstractCegarLoop]: Abstraction has 35 states and 37 transitions. [2022-04-28 10:58:56,154 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 states have internal predecessors, (17), 4 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) [2022-04-28 10:58:56,154 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 35 states and 37 transitions. [2022-04-28 10:58:56,323 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 37 edges. 37 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:58:56,323 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 37 transitions. [2022-04-28 10:58:56,324 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2022-04-28 10:58:56,324 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:58:56,324 INFO L195 NwaCegarLoop]: trace histogram [5, 4, 4, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:58:56,340 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2022-04-28 10:58:56,539 WARN L477 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-28 10:58:56,540 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:58:56,540 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:58:56,540 INFO L85 PathProgramCache]: Analyzing trace with hash 1564024736, now seen corresponding path program 3 times [2022-04-28 10:58:56,540 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:58:56,540 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1691326318] [2022-04-28 10:58:56,648 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:58:56,648 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:58:56,648 INFO L85 PathProgramCache]: Analyzing trace with hash 1564024736, now seen corresponding path program 4 times [2022-04-28 10:58:56,648 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:58:56,648 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1180006853] [2022-04-28 10:58:56,648 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:58:56,649 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:58:56,669 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 10:58:56,669 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1259716893] [2022-04-28 10:58:56,669 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 10:58:56,670 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:58:56,670 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:58:56,671 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-28 10:58:56,672 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-28 10:58:56,699 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 10:58:56,699 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:58:56,700 INFO L263 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 16 conjunts are in the unsatisfiable core [2022-04-28 10:58:56,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:58:56,711 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:58:56,988 INFO L272 TraceCheckUtils]: 0: Hoare triple {1220#true} call ULTIMATE.init(); {1220#true} is VALID [2022-04-28 10:58:56,989 INFO L290 TraceCheckUtils]: 1: Hoare triple {1220#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3); {1220#true} is VALID [2022-04-28 10:58:56,989 INFO L290 TraceCheckUtils]: 2: Hoare triple {1220#true} assume true; {1220#true} is VALID [2022-04-28 10:58:56,989 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1220#true} {1220#true} #60#return; {1220#true} is VALID [2022-04-28 10:58:56,989 INFO L272 TraceCheckUtils]: 4: Hoare triple {1220#true} call #t~ret5 := main(); {1220#true} is VALID [2022-04-28 10:58:56,989 INFO L290 TraceCheckUtils]: 5: Hoare triple {1220#true} havoc ~k~0;havoc ~y~0;havoc ~x~0;havoc ~c~0;assume -32768 <= #t~nondet4 && #t~nondet4 <= 32767;~k~0 := #t~nondet4;havoc #t~nondet4; {1220#true} is VALID [2022-04-28 10:58:56,989 INFO L272 TraceCheckUtils]: 6: Hoare triple {1220#true} call assume_abort_if_not((if ~k~0 <= 256 then 1 else 0)); {1220#true} is VALID [2022-04-28 10:58:56,989 INFO L290 TraceCheckUtils]: 7: Hoare triple {1220#true} ~cond := #in~cond; {1220#true} is VALID [2022-04-28 10:58:56,989 INFO L290 TraceCheckUtils]: 8: Hoare triple {1220#true} assume !(0 == ~cond); {1220#true} is VALID [2022-04-28 10:58:56,990 INFO L290 TraceCheckUtils]: 9: Hoare triple {1220#true} assume true; {1220#true} is VALID [2022-04-28 10:58:56,990 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1220#true} {1220#true} #52#return; {1220#true} is VALID [2022-04-28 10:58:56,990 INFO L290 TraceCheckUtils]: 11: Hoare triple {1220#true} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {1258#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-28 10:58:56,990 INFO L290 TraceCheckUtils]: 12: Hoare triple {1258#(and (= main_~c~0 0) (= main_~y~0 0))} assume !false; {1258#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-28 10:58:56,990 INFO L272 TraceCheckUtils]: 13: Hoare triple {1258#(and (= main_~c~0 0) (= main_~y~0 0))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {1220#true} is VALID [2022-04-28 10:58:56,991 INFO L290 TraceCheckUtils]: 14: Hoare triple {1220#true} ~cond := #in~cond; {1220#true} is VALID [2022-04-28 10:58:56,991 INFO L290 TraceCheckUtils]: 15: Hoare triple {1220#true} assume !(0 == ~cond); {1220#true} is VALID [2022-04-28 10:58:56,991 INFO L290 TraceCheckUtils]: 16: Hoare triple {1220#true} assume true; {1220#true} is VALID [2022-04-28 10:58:56,991 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {1220#true} {1258#(and (= main_~c~0 0) (= main_~y~0 0))} #54#return; {1258#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-28 10:58:56,992 INFO L290 TraceCheckUtils]: 18: Hoare triple {1258#(and (= main_~c~0 0) (= main_~y~0 0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {1280#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} is VALID [2022-04-28 10:58:56,992 INFO L290 TraceCheckUtils]: 19: Hoare triple {1280#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} assume !false; {1280#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} is VALID [2022-04-28 10:58:56,992 INFO L272 TraceCheckUtils]: 20: Hoare triple {1280#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {1220#true} is VALID [2022-04-28 10:58:56,993 INFO L290 TraceCheckUtils]: 21: Hoare triple {1220#true} ~cond := #in~cond; {1220#true} is VALID [2022-04-28 10:58:56,993 INFO L290 TraceCheckUtils]: 22: Hoare triple {1220#true} assume !(0 == ~cond); {1220#true} is VALID [2022-04-28 10:58:56,993 INFO L290 TraceCheckUtils]: 23: Hoare triple {1220#true} assume true; {1220#true} is VALID [2022-04-28 10:58:56,993 INFO L284 TraceCheckUtils]: 24: Hoare quadruple {1220#true} {1280#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} #54#return; {1280#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} is VALID [2022-04-28 10:58:56,994 INFO L290 TraceCheckUtils]: 25: Hoare triple {1280#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {1302#(and (< 1 main_~k~0) (= (+ (- 2) main_~y~0) 0) (<= main_~c~0 2))} is VALID [2022-04-28 10:58:56,994 INFO L290 TraceCheckUtils]: 26: Hoare triple {1302#(and (< 1 main_~k~0) (= (+ (- 2) main_~y~0) 0) (<= main_~c~0 2))} assume !false; {1302#(and (< 1 main_~k~0) (= (+ (- 2) main_~y~0) 0) (<= main_~c~0 2))} is VALID [2022-04-28 10:58:56,994 INFO L272 TraceCheckUtils]: 27: Hoare triple {1302#(and (< 1 main_~k~0) (= (+ (- 2) main_~y~0) 0) (<= main_~c~0 2))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {1220#true} is VALID [2022-04-28 10:58:56,994 INFO L290 TraceCheckUtils]: 28: Hoare triple {1220#true} ~cond := #in~cond; {1220#true} is VALID [2022-04-28 10:58:56,995 INFO L290 TraceCheckUtils]: 29: Hoare triple {1220#true} assume !(0 == ~cond); {1220#true} is VALID [2022-04-28 10:58:56,995 INFO L290 TraceCheckUtils]: 30: Hoare triple {1220#true} assume true; {1220#true} is VALID [2022-04-28 10:58:56,995 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {1220#true} {1302#(and (< 1 main_~k~0) (= (+ (- 2) main_~y~0) 0) (<= main_~c~0 2))} #54#return; {1302#(and (< 1 main_~k~0) (= (+ (- 2) main_~y~0) 0) (<= main_~c~0 2))} is VALID [2022-04-28 10:58:56,996 INFO L290 TraceCheckUtils]: 32: Hoare triple {1302#(and (< 1 main_~k~0) (= (+ (- 2) main_~y~0) 0) (<= main_~c~0 2))} assume !(~c~0 < ~k~0); {1324#(and (< 1 main_~k~0) (= (+ (- 2) main_~y~0) 0) (<= main_~k~0 2))} is VALID [2022-04-28 10:58:56,996 INFO L272 TraceCheckUtils]: 33: Hoare triple {1324#(and (< 1 main_~k~0) (= (+ (- 2) main_~y~0) 0) (<= main_~k~0 2))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {1220#true} is VALID [2022-04-28 10:58:56,996 INFO L290 TraceCheckUtils]: 34: Hoare triple {1220#true} ~cond := #in~cond; {1220#true} is VALID [2022-04-28 10:58:56,996 INFO L290 TraceCheckUtils]: 35: Hoare triple {1220#true} assume !(0 == ~cond); {1220#true} is VALID [2022-04-28 10:58:56,996 INFO L290 TraceCheckUtils]: 36: Hoare triple {1220#true} assume true; {1220#true} is VALID [2022-04-28 10:58:56,996 INFO L284 TraceCheckUtils]: 37: Hoare quadruple {1220#true} {1324#(and (< 1 main_~k~0) (= (+ (- 2) main_~y~0) 0) (<= main_~k~0 2))} #56#return; {1324#(and (< 1 main_~k~0) (= (+ (- 2) main_~y~0) 0) (<= main_~k~0 2))} is VALID [2022-04-28 10:58:56,997 INFO L272 TraceCheckUtils]: 38: Hoare triple {1324#(and (< 1 main_~k~0) (= (+ (- 2) main_~y~0) 0) (<= main_~k~0 2))} call __VERIFIER_assert((if ~k~0 * ~y~0 == ~y~0 * ~y~0 then 1 else 0)); {1343#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 10:58:56,997 INFO L290 TraceCheckUtils]: 39: Hoare triple {1343#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1347#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 10:58:56,998 INFO L290 TraceCheckUtils]: 40: Hoare triple {1347#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1221#false} is VALID [2022-04-28 10:58:56,998 INFO L290 TraceCheckUtils]: 41: Hoare triple {1221#false} assume !false; {1221#false} is VALID [2022-04-28 10:58:56,998 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 8 proven. 9 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-04-28 10:58:56,998 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:58:57,240 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:58:57,240 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1180006853] [2022-04-28 10:58:57,251 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 10:58:57,251 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1259716893] [2022-04-28 10:58:57,251 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1259716893] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 10:58:57,251 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-28 10:58:57,251 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2022-04-28 10:58:57,251 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:58:57,251 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1691326318] [2022-04-28 10:58:57,252 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1691326318] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:58:57,252 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:58:57,252 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-28 10:58:57,252 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2106799175] [2022-04-28 10:58:57,252 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:58:57,254 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 5 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) Word has length 42 [2022-04-28 10:58:57,254 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:58:57,255 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 8 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 5 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) [2022-04-28 10:58:57,288 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 33 edges. 33 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:58:57,288 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-28 10:58:57,288 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:58:57,288 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-28 10:58:57,288 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2022-04-28 10:58:57,289 INFO L87 Difference]: Start difference. First operand 35 states and 37 transitions. Second operand has 8 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 5 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) [2022-04-28 10:58:57,513 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:58:57,513 INFO L93 Difference]: Finished difference Result 44 states and 48 transitions. [2022-04-28 10:58:57,513 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-28 10:58:57,513 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 5 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) Word has length 42 [2022-04-28 10:58:57,514 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:58:57,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 5 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) [2022-04-28 10:58:57,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 44 transitions. [2022-04-28 10:58:57,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 5 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) [2022-04-28 10:58:57,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 44 transitions. [2022-04-28 10:58:57,516 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 44 transitions. [2022-04-28 10:58:57,546 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 44 edges. 44 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:58:57,547 INFO L225 Difference]: With dead ends: 44 [2022-04-28 10:58:57,547 INFO L226 Difference]: Without dead ends: 38 [2022-04-28 10:58:57,547 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 49 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=119, Unknown=0, NotChecked=0, Total=156 [2022-04-28 10:58:57,548 INFO L413 NwaCegarLoop]: 31 mSDtfsCounter, 2 mSDsluCounter, 123 mSDsCounter, 0 mSdLazyCounter, 85 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 154 SdHoareTripleChecker+Invalid, 86 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 85 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 10:58:57,548 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 154 Invalid, 86 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 85 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 10:58:57,549 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2022-04-28 10:58:57,566 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2022-04-28 10:58:57,566 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:58:57,567 INFO L82 GeneralOperation]: Start isEquivalent. First operand 38 states. Second operand has 38 states, 24 states have (on average 1.0416666666666667) internal successors, (25), 24 states have internal predecessors, (25), 9 states have call successors, (9), 6 states have call predecessors, (9), 4 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-28 10:58:57,567 INFO L74 IsIncluded]: Start isIncluded. First operand 38 states. Second operand has 38 states, 24 states have (on average 1.0416666666666667) internal successors, (25), 24 states have internal predecessors, (25), 9 states have call successors, (9), 6 states have call predecessors, (9), 4 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-28 10:58:57,567 INFO L87 Difference]: Start difference. First operand 38 states. Second operand has 38 states, 24 states have (on average 1.0416666666666667) internal successors, (25), 24 states have internal predecessors, (25), 9 states have call successors, (9), 6 states have call predecessors, (9), 4 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-28 10:58:57,568 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:58:57,568 INFO L93 Difference]: Finished difference Result 38 states and 41 transitions. [2022-04-28 10:58:57,568 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 41 transitions. [2022-04-28 10:58:57,569 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:58:57,569 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:58:57,569 INFO L74 IsIncluded]: Start isIncluded. First operand has 38 states, 24 states have (on average 1.0416666666666667) internal successors, (25), 24 states have internal predecessors, (25), 9 states have call successors, (9), 6 states have call predecessors, (9), 4 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Second operand 38 states. [2022-04-28 10:58:57,569 INFO L87 Difference]: Start difference. First operand has 38 states, 24 states have (on average 1.0416666666666667) internal successors, (25), 24 states have internal predecessors, (25), 9 states have call successors, (9), 6 states have call predecessors, (9), 4 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Second operand 38 states. [2022-04-28 10:58:57,570 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:58:57,570 INFO L93 Difference]: Finished difference Result 38 states and 41 transitions. [2022-04-28 10:58:57,570 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 41 transitions. [2022-04-28 10:58:57,571 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:58:57,571 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:58:57,571 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:58:57,571 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:58:57,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 24 states have (on average 1.0416666666666667) internal successors, (25), 24 states have internal predecessors, (25), 9 states have call successors, (9), 6 states have call predecessors, (9), 4 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-28 10:58:57,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 41 transitions. [2022-04-28 10:58:57,572 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 41 transitions. Word has length 42 [2022-04-28 10:58:57,572 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:58:57,572 INFO L495 AbstractCegarLoop]: Abstraction has 38 states and 41 transitions. [2022-04-28 10:58:57,573 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 5 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) [2022-04-28 10:58:57,573 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 38 states and 41 transitions. [2022-04-28 10:58:57,693 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 41 edges. 41 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:58:57,693 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 41 transitions. [2022-04-28 10:58:57,694 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2022-04-28 10:58:57,694 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:58:57,694 INFO L195 NwaCegarLoop]: trace histogram [6, 5, 5, 4, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:58:57,720 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-28 10:58:57,895 WARN L477 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-28 10:58:57,895 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:58:57,895 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:58:57,895 INFO L85 PathProgramCache]: Analyzing trace with hash 1951214241, now seen corresponding path program 5 times [2022-04-28 10:58:57,896 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:58:57,896 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [907079723] [2022-04-28 10:58:57,984 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:58:57,985 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:58:57,985 INFO L85 PathProgramCache]: Analyzing trace with hash 1951214241, now seen corresponding path program 6 times [2022-04-28 10:58:57,985 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:58:57,985 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [7591333] [2022-04-28 10:58:57,985 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:58:57,985 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:58:57,993 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 10:58:57,993 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [142890881] [2022-04-28 10:58:57,993 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-28 10:58:57,993 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:58:57,993 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:58:57,994 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-28 10:58:58,015 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-28 10:58:58,585 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2022-04-28 10:58:58,586 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:58:58,588 INFO L263 TraceCheckSpWp]: Trace formula consists of 138 conjuncts, 20 conjunts are in the unsatisfiable core [2022-04-28 10:58:58,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:58:58,603 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:58:58,925 INFO L272 TraceCheckUtils]: 0: Hoare triple {1654#true} call ULTIMATE.init(); {1654#true} is VALID [2022-04-28 10:58:58,926 INFO L290 TraceCheckUtils]: 1: Hoare triple {1654#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3); {1654#true} is VALID [2022-04-28 10:58:58,926 INFO L290 TraceCheckUtils]: 2: Hoare triple {1654#true} assume true; {1654#true} is VALID [2022-04-28 10:58:58,926 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1654#true} {1654#true} #60#return; {1654#true} is VALID [2022-04-28 10:58:58,926 INFO L272 TraceCheckUtils]: 4: Hoare triple {1654#true} call #t~ret5 := main(); {1654#true} is VALID [2022-04-28 10:58:58,926 INFO L290 TraceCheckUtils]: 5: Hoare triple {1654#true} havoc ~k~0;havoc ~y~0;havoc ~x~0;havoc ~c~0;assume -32768 <= #t~nondet4 && #t~nondet4 <= 32767;~k~0 := #t~nondet4;havoc #t~nondet4; {1654#true} is VALID [2022-04-28 10:58:58,926 INFO L272 TraceCheckUtils]: 6: Hoare triple {1654#true} call assume_abort_if_not((if ~k~0 <= 256 then 1 else 0)); {1654#true} is VALID [2022-04-28 10:58:58,927 INFO L290 TraceCheckUtils]: 7: Hoare triple {1654#true} ~cond := #in~cond; {1654#true} is VALID [2022-04-28 10:58:58,927 INFO L290 TraceCheckUtils]: 8: Hoare triple {1654#true} assume !(0 == ~cond); {1654#true} is VALID [2022-04-28 10:58:58,927 INFO L290 TraceCheckUtils]: 9: Hoare triple {1654#true} assume true; {1654#true} is VALID [2022-04-28 10:58:58,927 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1654#true} {1654#true} #52#return; {1654#true} is VALID [2022-04-28 10:58:58,928 INFO L290 TraceCheckUtils]: 11: Hoare triple {1654#true} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {1692#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-28 10:58:58,928 INFO L290 TraceCheckUtils]: 12: Hoare triple {1692#(and (= main_~c~0 0) (= main_~y~0 0))} assume !false; {1692#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-28 10:58:58,928 INFO L272 TraceCheckUtils]: 13: Hoare triple {1692#(and (= main_~c~0 0) (= main_~y~0 0))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {1654#true} is VALID [2022-04-28 10:58:58,928 INFO L290 TraceCheckUtils]: 14: Hoare triple {1654#true} ~cond := #in~cond; {1654#true} is VALID [2022-04-28 10:58:58,928 INFO L290 TraceCheckUtils]: 15: Hoare triple {1654#true} assume !(0 == ~cond); {1654#true} is VALID [2022-04-28 10:58:58,929 INFO L290 TraceCheckUtils]: 16: Hoare triple {1654#true} assume true; {1654#true} is VALID [2022-04-28 10:58:58,929 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {1654#true} {1692#(and (= main_~c~0 0) (= main_~y~0 0))} #54#return; {1692#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-28 10:58:58,930 INFO L290 TraceCheckUtils]: 18: Hoare triple {1692#(and (= main_~c~0 0) (= main_~y~0 0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {1714#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} is VALID [2022-04-28 10:58:58,931 INFO L290 TraceCheckUtils]: 19: Hoare triple {1714#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} assume !false; {1714#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} is VALID [2022-04-28 10:58:58,931 INFO L272 TraceCheckUtils]: 20: Hoare triple {1714#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {1654#true} is VALID [2022-04-28 10:58:58,931 INFO L290 TraceCheckUtils]: 21: Hoare triple {1654#true} ~cond := #in~cond; {1654#true} is VALID [2022-04-28 10:58:58,931 INFO L290 TraceCheckUtils]: 22: Hoare triple {1654#true} assume !(0 == ~cond); {1654#true} is VALID [2022-04-28 10:58:58,931 INFO L290 TraceCheckUtils]: 23: Hoare triple {1654#true} assume true; {1654#true} is VALID [2022-04-28 10:58:58,932 INFO L284 TraceCheckUtils]: 24: Hoare quadruple {1654#true} {1714#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} #54#return; {1714#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} is VALID [2022-04-28 10:58:58,933 INFO L290 TraceCheckUtils]: 25: Hoare triple {1714#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {1736#(and (= main_~y~0 2) (= 0 (+ (- 2) main_~c~0)))} is VALID [2022-04-28 10:58:58,933 INFO L290 TraceCheckUtils]: 26: Hoare triple {1736#(and (= main_~y~0 2) (= 0 (+ (- 2) main_~c~0)))} assume !false; {1736#(and (= main_~y~0 2) (= 0 (+ (- 2) main_~c~0)))} is VALID [2022-04-28 10:58:58,933 INFO L272 TraceCheckUtils]: 27: Hoare triple {1736#(and (= main_~y~0 2) (= 0 (+ (- 2) main_~c~0)))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {1654#true} is VALID [2022-04-28 10:58:58,933 INFO L290 TraceCheckUtils]: 28: Hoare triple {1654#true} ~cond := #in~cond; {1654#true} is VALID [2022-04-28 10:58:58,934 INFO L290 TraceCheckUtils]: 29: Hoare triple {1654#true} assume !(0 == ~cond); {1654#true} is VALID [2022-04-28 10:58:58,934 INFO L290 TraceCheckUtils]: 30: Hoare triple {1654#true} assume true; {1654#true} is VALID [2022-04-28 10:58:58,934 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {1654#true} {1736#(and (= main_~y~0 2) (= 0 (+ (- 2) main_~c~0)))} #54#return; {1736#(and (= main_~y~0 2) (= 0 (+ (- 2) main_~c~0)))} is VALID [2022-04-28 10:58:58,935 INFO L290 TraceCheckUtils]: 32: Hoare triple {1736#(and (= main_~y~0 2) (= 0 (+ (- 2) main_~c~0)))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {1758#(and (<= main_~c~0 3) (= main_~y~0 3) (< 2 main_~k~0))} is VALID [2022-04-28 10:58:58,936 INFO L290 TraceCheckUtils]: 33: Hoare triple {1758#(and (<= main_~c~0 3) (= main_~y~0 3) (< 2 main_~k~0))} assume !false; {1758#(and (<= main_~c~0 3) (= main_~y~0 3) (< 2 main_~k~0))} is VALID [2022-04-28 10:58:58,936 INFO L272 TraceCheckUtils]: 34: Hoare triple {1758#(and (<= main_~c~0 3) (= main_~y~0 3) (< 2 main_~k~0))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {1654#true} is VALID [2022-04-28 10:58:58,936 INFO L290 TraceCheckUtils]: 35: Hoare triple {1654#true} ~cond := #in~cond; {1654#true} is VALID [2022-04-28 10:58:58,936 INFO L290 TraceCheckUtils]: 36: Hoare triple {1654#true} assume !(0 == ~cond); {1654#true} is VALID [2022-04-28 10:58:58,936 INFO L290 TraceCheckUtils]: 37: Hoare triple {1654#true} assume true; {1654#true} is VALID [2022-04-28 10:58:58,937 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {1654#true} {1758#(and (<= main_~c~0 3) (= main_~y~0 3) (< 2 main_~k~0))} #54#return; {1758#(and (<= main_~c~0 3) (= main_~y~0 3) (< 2 main_~k~0))} is VALID [2022-04-28 10:58:58,937 INFO L290 TraceCheckUtils]: 39: Hoare triple {1758#(and (<= main_~c~0 3) (= main_~y~0 3) (< 2 main_~k~0))} assume !(~c~0 < ~k~0); {1780#(and (= main_~y~0 3) (<= main_~k~0 3) (< 2 main_~k~0))} is VALID [2022-04-28 10:58:58,938 INFO L272 TraceCheckUtils]: 40: Hoare triple {1780#(and (= main_~y~0 3) (<= main_~k~0 3) (< 2 main_~k~0))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {1654#true} is VALID [2022-04-28 10:58:58,938 INFO L290 TraceCheckUtils]: 41: Hoare triple {1654#true} ~cond := #in~cond; {1654#true} is VALID [2022-04-28 10:58:58,938 INFO L290 TraceCheckUtils]: 42: Hoare triple {1654#true} assume !(0 == ~cond); {1654#true} is VALID [2022-04-28 10:58:58,938 INFO L290 TraceCheckUtils]: 43: Hoare triple {1654#true} assume true; {1654#true} is VALID [2022-04-28 10:58:58,938 INFO L284 TraceCheckUtils]: 44: Hoare quadruple {1654#true} {1780#(and (= main_~y~0 3) (<= main_~k~0 3) (< 2 main_~k~0))} #56#return; {1780#(and (= main_~y~0 3) (<= main_~k~0 3) (< 2 main_~k~0))} is VALID [2022-04-28 10:58:58,939 INFO L272 TraceCheckUtils]: 45: Hoare triple {1780#(and (= main_~y~0 3) (<= main_~k~0 3) (< 2 main_~k~0))} call __VERIFIER_assert((if ~k~0 * ~y~0 == ~y~0 * ~y~0 then 1 else 0)); {1799#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 10:58:58,940 INFO L290 TraceCheckUtils]: 46: Hoare triple {1799#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1803#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 10:58:58,940 INFO L290 TraceCheckUtils]: 47: Hoare triple {1803#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1655#false} is VALID [2022-04-28 10:58:58,940 INFO L290 TraceCheckUtils]: 48: Hoare triple {1655#false} assume !false; {1655#false} is VALID [2022-04-28 10:58:58,940 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 10 proven. 18 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2022-04-28 10:58:58,940 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:58:59,245 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:58:59,245 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [7591333] [2022-04-28 10:58:59,245 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 10:58:59,245 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [142890881] [2022-04-28 10:58:59,245 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [142890881] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 10:58:59,246 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-28 10:58:59,246 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2022-04-28 10:58:59,246 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:58:59,246 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [907079723] [2022-04-28 10:58:59,246 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [907079723] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:58:59,246 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:58:59,246 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-04-28 10:58:59,246 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [606658175] [2022-04-28 10:58:59,246 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:58:59,247 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 6 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 6 states have call predecessors, (7), 6 states have call successors, (7) Word has length 49 [2022-04-28 10:58:59,248 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:58:59,248 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 9 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 6 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 6 states have call predecessors, (7), 6 states have call successors, (7) [2022-04-28 10:58:59,273 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 37 edges. 37 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:58:59,273 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-04-28 10:58:59,273 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:58:59,274 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-04-28 10:58:59,274 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2022-04-28 10:58:59,274 INFO L87 Difference]: Start difference. First operand 38 states and 41 transitions. Second operand has 9 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 6 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 6 states have call predecessors, (7), 6 states have call successors, (7) [2022-04-28 10:58:59,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:58:59,611 INFO L93 Difference]: Finished difference Result 47 states and 52 transitions. [2022-04-28 10:58:59,611 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-28 10:58:59,612 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 6 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 6 states have call predecessors, (7), 6 states have call successors, (7) Word has length 49 [2022-04-28 10:58:59,612 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:58:59,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 6 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 6 states have call predecessors, (7), 6 states have call successors, (7) [2022-04-28 10:58:59,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 48 transitions. [2022-04-28 10:58:59,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 6 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 6 states have call predecessors, (7), 6 states have call successors, (7) [2022-04-28 10:58:59,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 48 transitions. [2022-04-28 10:58:59,617 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 9 states and 48 transitions. [2022-04-28 10:58:59,650 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 48 edges. 48 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:58:59,651 INFO L225 Difference]: With dead ends: 47 [2022-04-28 10:58:59,651 INFO L226 Difference]: Without dead ends: 41 [2022-04-28 10:58:59,652 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 55 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=142, Unknown=0, NotChecked=0, Total=182 [2022-04-28 10:58:59,653 INFO L413 NwaCegarLoop]: 34 mSDtfsCounter, 2 mSDsluCounter, 151 mSDsCounter, 0 mSdLazyCounter, 119 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 185 SdHoareTripleChecker+Invalid, 120 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 119 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 10:58:59,653 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 185 Invalid, 120 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 119 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 10:58:59,653 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2022-04-28 10:58:59,686 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2022-04-28 10:58:59,686 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:58:59,686 INFO L82 GeneralOperation]: Start isEquivalent. First operand 41 states. Second operand has 41 states, 26 states have (on average 1.0384615384615385) internal successors, (27), 26 states have internal predecessors, (27), 10 states have call successors, (10), 6 states have call predecessors, (10), 4 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-28 10:58:59,686 INFO L74 IsIncluded]: Start isIncluded. First operand 41 states. Second operand has 41 states, 26 states have (on average 1.0384615384615385) internal successors, (27), 26 states have internal predecessors, (27), 10 states have call successors, (10), 6 states have call predecessors, (10), 4 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-28 10:58:59,687 INFO L87 Difference]: Start difference. First operand 41 states. Second operand has 41 states, 26 states have (on average 1.0384615384615385) internal successors, (27), 26 states have internal predecessors, (27), 10 states have call successors, (10), 6 states have call predecessors, (10), 4 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-28 10:58:59,688 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:58:59,688 INFO L93 Difference]: Finished difference Result 41 states and 45 transitions. [2022-04-28 10:58:59,688 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 45 transitions. [2022-04-28 10:58:59,688 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:58:59,688 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:58:59,689 INFO L74 IsIncluded]: Start isIncluded. First operand has 41 states, 26 states have (on average 1.0384615384615385) internal successors, (27), 26 states have internal predecessors, (27), 10 states have call successors, (10), 6 states have call predecessors, (10), 4 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Second operand 41 states. [2022-04-28 10:58:59,689 INFO L87 Difference]: Start difference. First operand has 41 states, 26 states have (on average 1.0384615384615385) internal successors, (27), 26 states have internal predecessors, (27), 10 states have call successors, (10), 6 states have call predecessors, (10), 4 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Second operand 41 states. [2022-04-28 10:58:59,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:58:59,690 INFO L93 Difference]: Finished difference Result 41 states and 45 transitions. [2022-04-28 10:58:59,690 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 45 transitions. [2022-04-28 10:58:59,690 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:58:59,690 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:58:59,690 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:58:59,691 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:58:59,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 26 states have (on average 1.0384615384615385) internal successors, (27), 26 states have internal predecessors, (27), 10 states have call successors, (10), 6 states have call predecessors, (10), 4 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-28 10:58:59,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 45 transitions. [2022-04-28 10:58:59,692 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 45 transitions. Word has length 49 [2022-04-28 10:58:59,692 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:58:59,692 INFO L495 AbstractCegarLoop]: Abstraction has 41 states and 45 transitions. [2022-04-28 10:58:59,692 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 6 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 6 states have call predecessors, (7), 6 states have call successors, (7) [2022-04-28 10:58:59,692 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 41 states and 45 transitions. [2022-04-28 10:58:59,785 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 45 edges. 45 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:58:59,785 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 45 transitions. [2022-04-28 10:58:59,786 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2022-04-28 10:58:59,786 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:58:59,786 INFO L195 NwaCegarLoop]: trace histogram [7, 6, 6, 5, 5, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:58:59,792 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-04-28 10:58:59,986 WARN L477 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-28 10:58:59,987 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:58:59,987 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:58:59,987 INFO L85 PathProgramCache]: Analyzing trace with hash 327675008, now seen corresponding path program 7 times [2022-04-28 10:58:59,987 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:58:59,988 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1858800586] [2022-04-28 10:59:00,078 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:59:00,078 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:59:00,078 INFO L85 PathProgramCache]: Analyzing trace with hash 327675008, now seen corresponding path program 8 times [2022-04-28 10:59:00,078 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:59:00,078 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1805656272] [2022-04-28 10:59:00,078 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:59:00,079 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:59:00,093 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 10:59:00,093 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1818784610] [2022-04-28 10:59:00,093 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 10:59:00,093 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:59:00,093 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:59:00,094 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-28 10:59:00,095 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-28 10:59:00,423 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 10:59:00,423 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:59:00,424 INFO L263 TraceCheckSpWp]: Trace formula consists of 155 conjuncts, 24 conjunts are in the unsatisfiable core [2022-04-28 10:59:00,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:59:00,440 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:59:00,795 INFO L272 TraceCheckUtils]: 0: Hoare triple {2128#true} call ULTIMATE.init(); {2128#true} is VALID [2022-04-28 10:59:00,795 INFO L290 TraceCheckUtils]: 1: Hoare triple {2128#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3); {2128#true} is VALID [2022-04-28 10:59:00,795 INFO L290 TraceCheckUtils]: 2: Hoare triple {2128#true} assume true; {2128#true} is VALID [2022-04-28 10:59:00,795 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2128#true} {2128#true} #60#return; {2128#true} is VALID [2022-04-28 10:59:00,795 INFO L272 TraceCheckUtils]: 4: Hoare triple {2128#true} call #t~ret5 := main(); {2128#true} is VALID [2022-04-28 10:59:00,795 INFO L290 TraceCheckUtils]: 5: Hoare triple {2128#true} havoc ~k~0;havoc ~y~0;havoc ~x~0;havoc ~c~0;assume -32768 <= #t~nondet4 && #t~nondet4 <= 32767;~k~0 := #t~nondet4;havoc #t~nondet4; {2128#true} is VALID [2022-04-28 10:59:00,796 INFO L272 TraceCheckUtils]: 6: Hoare triple {2128#true} call assume_abort_if_not((if ~k~0 <= 256 then 1 else 0)); {2128#true} is VALID [2022-04-28 10:59:00,796 INFO L290 TraceCheckUtils]: 7: Hoare triple {2128#true} ~cond := #in~cond; {2128#true} is VALID [2022-04-28 10:59:00,796 INFO L290 TraceCheckUtils]: 8: Hoare triple {2128#true} assume !(0 == ~cond); {2128#true} is VALID [2022-04-28 10:59:00,796 INFO L290 TraceCheckUtils]: 9: Hoare triple {2128#true} assume true; {2128#true} is VALID [2022-04-28 10:59:00,796 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {2128#true} {2128#true} #52#return; {2128#true} is VALID [2022-04-28 10:59:00,796 INFO L290 TraceCheckUtils]: 11: Hoare triple {2128#true} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {2166#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-28 10:59:00,797 INFO L290 TraceCheckUtils]: 12: Hoare triple {2166#(and (= main_~c~0 0) (= main_~y~0 0))} assume !false; {2166#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-28 10:59:00,797 INFO L272 TraceCheckUtils]: 13: Hoare triple {2166#(and (= main_~c~0 0) (= main_~y~0 0))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {2128#true} is VALID [2022-04-28 10:59:00,797 INFO L290 TraceCheckUtils]: 14: Hoare triple {2128#true} ~cond := #in~cond; {2128#true} is VALID [2022-04-28 10:59:00,797 INFO L290 TraceCheckUtils]: 15: Hoare triple {2128#true} assume !(0 == ~cond); {2128#true} is VALID [2022-04-28 10:59:00,797 INFO L290 TraceCheckUtils]: 16: Hoare triple {2128#true} assume true; {2128#true} is VALID [2022-04-28 10:59:00,798 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {2128#true} {2166#(and (= main_~c~0 0) (= main_~y~0 0))} #54#return; {2166#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-28 10:59:00,798 INFO L290 TraceCheckUtils]: 18: Hoare triple {2166#(and (= main_~c~0 0) (= main_~y~0 0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {2188#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} is VALID [2022-04-28 10:59:00,799 INFO L290 TraceCheckUtils]: 19: Hoare triple {2188#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} assume !false; {2188#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} is VALID [2022-04-28 10:59:00,799 INFO L272 TraceCheckUtils]: 20: Hoare triple {2188#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {2128#true} is VALID [2022-04-28 10:59:00,799 INFO L290 TraceCheckUtils]: 21: Hoare triple {2128#true} ~cond := #in~cond; {2128#true} is VALID [2022-04-28 10:59:00,799 INFO L290 TraceCheckUtils]: 22: Hoare triple {2128#true} assume !(0 == ~cond); {2128#true} is VALID [2022-04-28 10:59:00,799 INFO L290 TraceCheckUtils]: 23: Hoare triple {2128#true} assume true; {2128#true} is VALID [2022-04-28 10:59:00,799 INFO L284 TraceCheckUtils]: 24: Hoare quadruple {2128#true} {2188#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} #54#return; {2188#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} is VALID [2022-04-28 10:59:00,800 INFO L290 TraceCheckUtils]: 25: Hoare triple {2188#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {2210#(and (= main_~y~0 2) (= 0 (+ (- 2) main_~c~0)))} is VALID [2022-04-28 10:59:00,800 INFO L290 TraceCheckUtils]: 26: Hoare triple {2210#(and (= main_~y~0 2) (= 0 (+ (- 2) main_~c~0)))} assume !false; {2210#(and (= main_~y~0 2) (= 0 (+ (- 2) main_~c~0)))} is VALID [2022-04-28 10:59:00,800 INFO L272 TraceCheckUtils]: 27: Hoare triple {2210#(and (= main_~y~0 2) (= 0 (+ (- 2) main_~c~0)))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {2128#true} is VALID [2022-04-28 10:59:00,801 INFO L290 TraceCheckUtils]: 28: Hoare triple {2128#true} ~cond := #in~cond; {2128#true} is VALID [2022-04-28 10:59:00,801 INFO L290 TraceCheckUtils]: 29: Hoare triple {2128#true} assume !(0 == ~cond); {2128#true} is VALID [2022-04-28 10:59:00,801 INFO L290 TraceCheckUtils]: 30: Hoare triple {2128#true} assume true; {2128#true} is VALID [2022-04-28 10:59:00,801 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {2128#true} {2210#(and (= main_~y~0 2) (= 0 (+ (- 2) main_~c~0)))} #54#return; {2210#(and (= main_~y~0 2) (= 0 (+ (- 2) main_~c~0)))} is VALID [2022-04-28 10:59:00,802 INFO L290 TraceCheckUtils]: 32: Hoare triple {2210#(and (= main_~y~0 2) (= 0 (+ (- 2) main_~c~0)))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {2232#(and (= (+ main_~c~0 (- 3)) 0) (= main_~y~0 3))} is VALID [2022-04-28 10:59:00,802 INFO L290 TraceCheckUtils]: 33: Hoare triple {2232#(and (= (+ main_~c~0 (- 3)) 0) (= main_~y~0 3))} assume !false; {2232#(and (= (+ main_~c~0 (- 3)) 0) (= main_~y~0 3))} is VALID [2022-04-28 10:59:00,802 INFO L272 TraceCheckUtils]: 34: Hoare triple {2232#(and (= (+ main_~c~0 (- 3)) 0) (= main_~y~0 3))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {2128#true} is VALID [2022-04-28 10:59:00,802 INFO L290 TraceCheckUtils]: 35: Hoare triple {2128#true} ~cond := #in~cond; {2128#true} is VALID [2022-04-28 10:59:00,803 INFO L290 TraceCheckUtils]: 36: Hoare triple {2128#true} assume !(0 == ~cond); {2128#true} is VALID [2022-04-28 10:59:00,803 INFO L290 TraceCheckUtils]: 37: Hoare triple {2128#true} assume true; {2128#true} is VALID [2022-04-28 10:59:00,803 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {2128#true} {2232#(and (= (+ main_~c~0 (- 3)) 0) (= main_~y~0 3))} #54#return; {2232#(and (= (+ main_~c~0 (- 3)) 0) (= main_~y~0 3))} is VALID [2022-04-28 10:59:00,804 INFO L290 TraceCheckUtils]: 39: Hoare triple {2232#(and (= (+ main_~c~0 (- 3)) 0) (= main_~y~0 3))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {2254#(and (= 3 (+ (- 1) main_~y~0)) (< 3 main_~k~0) (<= main_~c~0 4))} is VALID [2022-04-28 10:59:00,804 INFO L290 TraceCheckUtils]: 40: Hoare triple {2254#(and (= 3 (+ (- 1) main_~y~0)) (< 3 main_~k~0) (<= main_~c~0 4))} assume !false; {2254#(and (= 3 (+ (- 1) main_~y~0)) (< 3 main_~k~0) (<= main_~c~0 4))} is VALID [2022-04-28 10:59:00,804 INFO L272 TraceCheckUtils]: 41: Hoare triple {2254#(and (= 3 (+ (- 1) main_~y~0)) (< 3 main_~k~0) (<= main_~c~0 4))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {2128#true} is VALID [2022-04-28 10:59:00,805 INFO L290 TraceCheckUtils]: 42: Hoare triple {2128#true} ~cond := #in~cond; {2128#true} is VALID [2022-04-28 10:59:00,805 INFO L290 TraceCheckUtils]: 43: Hoare triple {2128#true} assume !(0 == ~cond); {2128#true} is VALID [2022-04-28 10:59:00,805 INFO L290 TraceCheckUtils]: 44: Hoare triple {2128#true} assume true; {2128#true} is VALID [2022-04-28 10:59:00,806 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {2128#true} {2254#(and (= 3 (+ (- 1) main_~y~0)) (< 3 main_~k~0) (<= main_~c~0 4))} #54#return; {2254#(and (= 3 (+ (- 1) main_~y~0)) (< 3 main_~k~0) (<= main_~c~0 4))} is VALID [2022-04-28 10:59:00,806 INFO L290 TraceCheckUtils]: 46: Hoare triple {2254#(and (= 3 (+ (- 1) main_~y~0)) (< 3 main_~k~0) (<= main_~c~0 4))} assume !(~c~0 < ~k~0); {2276#(and (= 3 (+ (- 1) main_~y~0)) (< 3 main_~k~0) (<= main_~k~0 4))} is VALID [2022-04-28 10:59:00,806 INFO L272 TraceCheckUtils]: 47: Hoare triple {2276#(and (= 3 (+ (- 1) main_~y~0)) (< 3 main_~k~0) (<= main_~k~0 4))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {2128#true} is VALID [2022-04-28 10:59:00,806 INFO L290 TraceCheckUtils]: 48: Hoare triple {2128#true} ~cond := #in~cond; {2128#true} is VALID [2022-04-28 10:59:00,807 INFO L290 TraceCheckUtils]: 49: Hoare triple {2128#true} assume !(0 == ~cond); {2128#true} is VALID [2022-04-28 10:59:00,807 INFO L290 TraceCheckUtils]: 50: Hoare triple {2128#true} assume true; {2128#true} is VALID [2022-04-28 10:59:00,807 INFO L284 TraceCheckUtils]: 51: Hoare quadruple {2128#true} {2276#(and (= 3 (+ (- 1) main_~y~0)) (< 3 main_~k~0) (<= main_~k~0 4))} #56#return; {2276#(and (= 3 (+ (- 1) main_~y~0)) (< 3 main_~k~0) (<= main_~k~0 4))} is VALID [2022-04-28 10:59:00,808 INFO L272 TraceCheckUtils]: 52: Hoare triple {2276#(and (= 3 (+ (- 1) main_~y~0)) (< 3 main_~k~0) (<= main_~k~0 4))} call __VERIFIER_assert((if ~k~0 * ~y~0 == ~y~0 * ~y~0 then 1 else 0)); {2295#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 10:59:00,808 INFO L290 TraceCheckUtils]: 53: Hoare triple {2295#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {2299#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 10:59:00,809 INFO L290 TraceCheckUtils]: 54: Hoare triple {2299#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {2129#false} is VALID [2022-04-28 10:59:00,809 INFO L290 TraceCheckUtils]: 55: Hoare triple {2129#false} assume !false; {2129#false} is VALID [2022-04-28 10:59:00,809 INFO L134 CoverageAnalysis]: Checked inductivity of 102 backedges. 12 proven. 30 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2022-04-28 10:59:00,809 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:59:01,066 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:59:01,066 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1805656272] [2022-04-28 10:59:01,066 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 10:59:01,067 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1818784610] [2022-04-28 10:59:01,067 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1818784610] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 10:59:01,067 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-28 10:59:01,067 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2022-04-28 10:59:01,067 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:59:01,067 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1858800586] [2022-04-28 10:59:01,067 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1858800586] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:59:01,067 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:59:01,067 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-04-28 10:59:01,067 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [605290407] [2022-04-28 10:59:01,067 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:59:01,068 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 2.5555555555555554) internal successors, (23), 9 states have internal predecessors, (23), 7 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (8), 7 states have call predecessors, (8), 7 states have call successors, (8) Word has length 56 [2022-04-28 10:59:01,068 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:59:01,068 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 10 states, 9 states have (on average 2.5555555555555554) internal successors, (23), 9 states have internal predecessors, (23), 7 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (8), 7 states have call predecessors, (8), 7 states have call successors, (8) [2022-04-28 10:59:01,098 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 41 edges. 41 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:59:01,098 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-04-28 10:59:01,098 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:59:01,098 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-04-28 10:59:01,099 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2022-04-28 10:59:01,099 INFO L87 Difference]: Start difference. First operand 41 states and 45 transitions. Second operand has 10 states, 9 states have (on average 2.5555555555555554) internal successors, (23), 9 states have internal predecessors, (23), 7 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (8), 7 states have call predecessors, (8), 7 states have call successors, (8) [2022-04-28 10:59:01,543 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:59:01,543 INFO L93 Difference]: Finished difference Result 50 states and 56 transitions. [2022-04-28 10:59:01,543 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-04-28 10:59:01,543 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 2.5555555555555554) internal successors, (23), 9 states have internal predecessors, (23), 7 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (8), 7 states have call predecessors, (8), 7 states have call successors, (8) Word has length 56 [2022-04-28 10:59:01,544 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:59:01,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 9 states have (on average 2.5555555555555554) internal successors, (23), 9 states have internal predecessors, (23), 7 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (8), 7 states have call predecessors, (8), 7 states have call successors, (8) [2022-04-28 10:59:01,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 52 transitions. [2022-04-28 10:59:01,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 9 states have (on average 2.5555555555555554) internal successors, (23), 9 states have internal predecessors, (23), 7 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (8), 7 states have call predecessors, (8), 7 states have call successors, (8) [2022-04-28 10:59:01,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 52 transitions. [2022-04-28 10:59:01,546 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 10 states and 52 transitions. [2022-04-28 10:59:01,586 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 52 edges. 52 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:59:01,587 INFO L225 Difference]: With dead ends: 50 [2022-04-28 10:59:01,587 INFO L226 Difference]: Without dead ends: 44 [2022-04-28 10:59:01,587 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 61 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=167, Unknown=0, NotChecked=0, Total=210 [2022-04-28 10:59:01,587 INFO L413 NwaCegarLoop]: 37 mSDtfsCounter, 2 mSDsluCounter, 181 mSDsCounter, 0 mSdLazyCounter, 159 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 218 SdHoareTripleChecker+Invalid, 160 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 159 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-28 10:59:01,588 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 218 Invalid, 160 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 159 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-28 10:59:01,588 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2022-04-28 10:59:01,613 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2022-04-28 10:59:01,613 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:59:01,614 INFO L82 GeneralOperation]: Start isEquivalent. First operand 44 states. Second operand has 44 states, 28 states have (on average 1.0357142857142858) internal successors, (29), 28 states have internal predecessors, (29), 11 states have call successors, (11), 6 states have call predecessors, (11), 4 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-28 10:59:01,615 INFO L74 IsIncluded]: Start isIncluded. First operand 44 states. Second operand has 44 states, 28 states have (on average 1.0357142857142858) internal successors, (29), 28 states have internal predecessors, (29), 11 states have call successors, (11), 6 states have call predecessors, (11), 4 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-28 10:59:01,615 INFO L87 Difference]: Start difference. First operand 44 states. Second operand has 44 states, 28 states have (on average 1.0357142857142858) internal successors, (29), 28 states have internal predecessors, (29), 11 states have call successors, (11), 6 states have call predecessors, (11), 4 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-28 10:59:01,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:59:01,617 INFO L93 Difference]: Finished difference Result 44 states and 49 transitions. [2022-04-28 10:59:01,617 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 49 transitions. [2022-04-28 10:59:01,617 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:59:01,617 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:59:01,618 INFO L74 IsIncluded]: Start isIncluded. First operand has 44 states, 28 states have (on average 1.0357142857142858) internal successors, (29), 28 states have internal predecessors, (29), 11 states have call successors, (11), 6 states have call predecessors, (11), 4 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) Second operand 44 states. [2022-04-28 10:59:01,618 INFO L87 Difference]: Start difference. First operand has 44 states, 28 states have (on average 1.0357142857142858) internal successors, (29), 28 states have internal predecessors, (29), 11 states have call successors, (11), 6 states have call predecessors, (11), 4 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) Second operand 44 states. [2022-04-28 10:59:01,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:59:01,619 INFO L93 Difference]: Finished difference Result 44 states and 49 transitions. [2022-04-28 10:59:01,619 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 49 transitions. [2022-04-28 10:59:01,619 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:59:01,619 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:59:01,619 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:59:01,619 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:59:01,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 28 states have (on average 1.0357142857142858) internal successors, (29), 28 states have internal predecessors, (29), 11 states have call successors, (11), 6 states have call predecessors, (11), 4 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-28 10:59:01,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 49 transitions. [2022-04-28 10:59:01,621 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 49 transitions. Word has length 56 [2022-04-28 10:59:01,621 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:59:01,621 INFO L495 AbstractCegarLoop]: Abstraction has 44 states and 49 transitions. [2022-04-28 10:59:01,621 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 2.5555555555555554) internal successors, (23), 9 states have internal predecessors, (23), 7 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (8), 7 states have call predecessors, (8), 7 states have call successors, (8) [2022-04-28 10:59:01,621 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 44 states and 49 transitions. [2022-04-28 10:59:01,714 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 49 edges. 49 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:59:01,714 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 49 transitions. [2022-04-28 10:59:01,715 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2022-04-28 10:59:01,715 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:59:01,715 INFO L195 NwaCegarLoop]: trace histogram [8, 7, 7, 6, 6, 6, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:59:01,722 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-28 10:59:01,915 WARN L477 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-28 10:59:01,916 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:59:01,916 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:59:01,916 INFO L85 PathProgramCache]: Analyzing trace with hash -16244287, now seen corresponding path program 9 times [2022-04-28 10:59:01,916 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:59:01,916 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [753919075] [2022-04-28 10:59:02,022 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:59:02,022 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:59:02,022 INFO L85 PathProgramCache]: Analyzing trace with hash -16244287, now seen corresponding path program 10 times [2022-04-28 10:59:02,022 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:59:02,022 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1059570267] [2022-04-28 10:59:02,022 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:59:02,022 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:59:02,041 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 10:59:02,042 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1132836405] [2022-04-28 10:59:02,042 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 10:59:02,042 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:59:02,042 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:59:02,051 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-28 10:59:02,052 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-28 10:59:02,085 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 10:59:02,085 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:59:02,086 INFO L263 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 28 conjunts are in the unsatisfiable core [2022-04-28 10:59:02,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:59:02,100 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:59:02,466 INFO L272 TraceCheckUtils]: 0: Hoare triple {2642#true} call ULTIMATE.init(); {2642#true} is VALID [2022-04-28 10:59:02,467 INFO L290 TraceCheckUtils]: 1: Hoare triple {2642#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3); {2642#true} is VALID [2022-04-28 10:59:02,467 INFO L290 TraceCheckUtils]: 2: Hoare triple {2642#true} assume true; {2642#true} is VALID [2022-04-28 10:59:02,467 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2642#true} {2642#true} #60#return; {2642#true} is VALID [2022-04-28 10:59:02,467 INFO L272 TraceCheckUtils]: 4: Hoare triple {2642#true} call #t~ret5 := main(); {2642#true} is VALID [2022-04-28 10:59:02,467 INFO L290 TraceCheckUtils]: 5: Hoare triple {2642#true} havoc ~k~0;havoc ~y~0;havoc ~x~0;havoc ~c~0;assume -32768 <= #t~nondet4 && #t~nondet4 <= 32767;~k~0 := #t~nondet4;havoc #t~nondet4; {2642#true} is VALID [2022-04-28 10:59:02,467 INFO L272 TraceCheckUtils]: 6: Hoare triple {2642#true} call assume_abort_if_not((if ~k~0 <= 256 then 1 else 0)); {2642#true} is VALID [2022-04-28 10:59:02,467 INFO L290 TraceCheckUtils]: 7: Hoare triple {2642#true} ~cond := #in~cond; {2642#true} is VALID [2022-04-28 10:59:02,467 INFO L290 TraceCheckUtils]: 8: Hoare triple {2642#true} assume !(0 == ~cond); {2642#true} is VALID [2022-04-28 10:59:02,467 INFO L290 TraceCheckUtils]: 9: Hoare triple {2642#true} assume true; {2642#true} is VALID [2022-04-28 10:59:02,467 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {2642#true} {2642#true} #52#return; {2642#true} is VALID [2022-04-28 10:59:02,468 INFO L290 TraceCheckUtils]: 11: Hoare triple {2642#true} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {2680#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-28 10:59:02,468 INFO L290 TraceCheckUtils]: 12: Hoare triple {2680#(and (= main_~c~0 0) (= main_~y~0 0))} assume !false; {2680#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-28 10:59:02,468 INFO L272 TraceCheckUtils]: 13: Hoare triple {2680#(and (= main_~c~0 0) (= main_~y~0 0))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {2642#true} is VALID [2022-04-28 10:59:02,468 INFO L290 TraceCheckUtils]: 14: Hoare triple {2642#true} ~cond := #in~cond; {2642#true} is VALID [2022-04-28 10:59:02,468 INFO L290 TraceCheckUtils]: 15: Hoare triple {2642#true} assume !(0 == ~cond); {2642#true} is VALID [2022-04-28 10:59:02,469 INFO L290 TraceCheckUtils]: 16: Hoare triple {2642#true} assume true; {2642#true} is VALID [2022-04-28 10:59:02,469 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {2642#true} {2680#(and (= main_~c~0 0) (= main_~y~0 0))} #54#return; {2680#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-28 10:59:02,470 INFO L290 TraceCheckUtils]: 18: Hoare triple {2680#(and (= main_~c~0 0) (= main_~y~0 0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {2702#(and (= main_~y~0 1) (= main_~c~0 1))} is VALID [2022-04-28 10:59:02,470 INFO L290 TraceCheckUtils]: 19: Hoare triple {2702#(and (= main_~y~0 1) (= main_~c~0 1))} assume !false; {2702#(and (= main_~y~0 1) (= main_~c~0 1))} is VALID [2022-04-28 10:59:02,470 INFO L272 TraceCheckUtils]: 20: Hoare triple {2702#(and (= main_~y~0 1) (= main_~c~0 1))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {2642#true} is VALID [2022-04-28 10:59:02,471 INFO L290 TraceCheckUtils]: 21: Hoare triple {2642#true} ~cond := #in~cond; {2642#true} is VALID [2022-04-28 10:59:02,471 INFO L290 TraceCheckUtils]: 22: Hoare triple {2642#true} assume !(0 == ~cond); {2642#true} is VALID [2022-04-28 10:59:02,471 INFO L290 TraceCheckUtils]: 23: Hoare triple {2642#true} assume true; {2642#true} is VALID [2022-04-28 10:59:02,471 INFO L284 TraceCheckUtils]: 24: Hoare quadruple {2642#true} {2702#(and (= main_~y~0 1) (= main_~c~0 1))} #54#return; {2702#(and (= main_~y~0 1) (= main_~c~0 1))} is VALID [2022-04-28 10:59:02,472 INFO L290 TraceCheckUtils]: 25: Hoare triple {2702#(and (= main_~y~0 1) (= main_~c~0 1))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {2724#(and (= main_~y~0 2) (= main_~c~0 2))} is VALID [2022-04-28 10:59:02,473 INFO L290 TraceCheckUtils]: 26: Hoare triple {2724#(and (= main_~y~0 2) (= main_~c~0 2))} assume !false; {2724#(and (= main_~y~0 2) (= main_~c~0 2))} is VALID [2022-04-28 10:59:02,473 INFO L272 TraceCheckUtils]: 27: Hoare triple {2724#(and (= main_~y~0 2) (= main_~c~0 2))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {2642#true} is VALID [2022-04-28 10:59:02,473 INFO L290 TraceCheckUtils]: 28: Hoare triple {2642#true} ~cond := #in~cond; {2642#true} is VALID [2022-04-28 10:59:02,473 INFO L290 TraceCheckUtils]: 29: Hoare triple {2642#true} assume !(0 == ~cond); {2642#true} is VALID [2022-04-28 10:59:02,473 INFO L290 TraceCheckUtils]: 30: Hoare triple {2642#true} assume true; {2642#true} is VALID [2022-04-28 10:59:02,473 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {2642#true} {2724#(and (= main_~y~0 2) (= main_~c~0 2))} #54#return; {2724#(and (= main_~y~0 2) (= main_~c~0 2))} is VALID [2022-04-28 10:59:02,474 INFO L290 TraceCheckUtils]: 32: Hoare triple {2724#(and (= main_~y~0 2) (= main_~c~0 2))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {2746#(and (= 2 (+ (- 1) main_~y~0)) (= main_~c~0 3))} is VALID [2022-04-28 10:59:02,475 INFO L290 TraceCheckUtils]: 33: Hoare triple {2746#(and (= 2 (+ (- 1) main_~y~0)) (= main_~c~0 3))} assume !false; {2746#(and (= 2 (+ (- 1) main_~y~0)) (= main_~c~0 3))} is VALID [2022-04-28 10:59:02,475 INFO L272 TraceCheckUtils]: 34: Hoare triple {2746#(and (= 2 (+ (- 1) main_~y~0)) (= main_~c~0 3))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {2642#true} is VALID [2022-04-28 10:59:02,475 INFO L290 TraceCheckUtils]: 35: Hoare triple {2642#true} ~cond := #in~cond; {2642#true} is VALID [2022-04-28 10:59:02,475 INFO L290 TraceCheckUtils]: 36: Hoare triple {2642#true} assume !(0 == ~cond); {2642#true} is VALID [2022-04-28 10:59:02,475 INFO L290 TraceCheckUtils]: 37: Hoare triple {2642#true} assume true; {2642#true} is VALID [2022-04-28 10:59:02,476 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {2642#true} {2746#(and (= 2 (+ (- 1) main_~y~0)) (= main_~c~0 3))} #54#return; {2746#(and (= 2 (+ (- 1) main_~y~0)) (= main_~c~0 3))} is VALID [2022-04-28 10:59:02,476 INFO L290 TraceCheckUtils]: 39: Hoare triple {2746#(and (= 2 (+ (- 1) main_~y~0)) (= main_~c~0 3))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {2768#(and (= (+ (- 1) main_~c~0) 3) (= main_~y~0 4))} is VALID [2022-04-28 10:59:02,477 INFO L290 TraceCheckUtils]: 40: Hoare triple {2768#(and (= (+ (- 1) main_~c~0) 3) (= main_~y~0 4))} assume !false; {2768#(and (= (+ (- 1) main_~c~0) 3) (= main_~y~0 4))} is VALID [2022-04-28 10:59:02,477 INFO L272 TraceCheckUtils]: 41: Hoare triple {2768#(and (= (+ (- 1) main_~c~0) 3) (= main_~y~0 4))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {2642#true} is VALID [2022-04-28 10:59:02,477 INFO L290 TraceCheckUtils]: 42: Hoare triple {2642#true} ~cond := #in~cond; {2642#true} is VALID [2022-04-28 10:59:02,477 INFO L290 TraceCheckUtils]: 43: Hoare triple {2642#true} assume !(0 == ~cond); {2642#true} is VALID [2022-04-28 10:59:02,477 INFO L290 TraceCheckUtils]: 44: Hoare triple {2642#true} assume true; {2642#true} is VALID [2022-04-28 10:59:02,478 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {2642#true} {2768#(and (= (+ (- 1) main_~c~0) 3) (= main_~y~0 4))} #54#return; {2768#(and (= (+ (- 1) main_~c~0) 3) (= main_~y~0 4))} is VALID [2022-04-28 10:59:02,478 INFO L290 TraceCheckUtils]: 46: Hoare triple {2768#(and (= (+ (- 1) main_~c~0) 3) (= main_~y~0 4))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {2790#(and (<= main_~c~0 5) (= 5 main_~y~0) (< 4 main_~k~0))} is VALID [2022-04-28 10:59:02,479 INFO L290 TraceCheckUtils]: 47: Hoare triple {2790#(and (<= main_~c~0 5) (= 5 main_~y~0) (< 4 main_~k~0))} assume !false; {2790#(and (<= main_~c~0 5) (= 5 main_~y~0) (< 4 main_~k~0))} is VALID [2022-04-28 10:59:02,479 INFO L272 TraceCheckUtils]: 48: Hoare triple {2790#(and (<= main_~c~0 5) (= 5 main_~y~0) (< 4 main_~k~0))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {2642#true} is VALID [2022-04-28 10:59:02,479 INFO L290 TraceCheckUtils]: 49: Hoare triple {2642#true} ~cond := #in~cond; {2642#true} is VALID [2022-04-28 10:59:02,479 INFO L290 TraceCheckUtils]: 50: Hoare triple {2642#true} assume !(0 == ~cond); {2642#true} is VALID [2022-04-28 10:59:02,479 INFO L290 TraceCheckUtils]: 51: Hoare triple {2642#true} assume true; {2642#true} is VALID [2022-04-28 10:59:02,479 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {2642#true} {2790#(and (<= main_~c~0 5) (= 5 main_~y~0) (< 4 main_~k~0))} #54#return; {2790#(and (<= main_~c~0 5) (= 5 main_~y~0) (< 4 main_~k~0))} is VALID [2022-04-28 10:59:02,480 INFO L290 TraceCheckUtils]: 53: Hoare triple {2790#(and (<= main_~c~0 5) (= 5 main_~y~0) (< 4 main_~k~0))} assume !(~c~0 < ~k~0); {2812#(and (<= main_~k~0 5) (= 5 main_~y~0) (< 4 main_~k~0))} is VALID [2022-04-28 10:59:02,480 INFO L272 TraceCheckUtils]: 54: Hoare triple {2812#(and (<= main_~k~0 5) (= 5 main_~y~0) (< 4 main_~k~0))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {2642#true} is VALID [2022-04-28 10:59:02,480 INFO L290 TraceCheckUtils]: 55: Hoare triple {2642#true} ~cond := #in~cond; {2642#true} is VALID [2022-04-28 10:59:02,480 INFO L290 TraceCheckUtils]: 56: Hoare triple {2642#true} assume !(0 == ~cond); {2642#true} is VALID [2022-04-28 10:59:02,481 INFO L290 TraceCheckUtils]: 57: Hoare triple {2642#true} assume true; {2642#true} is VALID [2022-04-28 10:59:02,481 INFO L284 TraceCheckUtils]: 58: Hoare quadruple {2642#true} {2812#(and (<= main_~k~0 5) (= 5 main_~y~0) (< 4 main_~k~0))} #56#return; {2812#(and (<= main_~k~0 5) (= 5 main_~y~0) (< 4 main_~k~0))} is VALID [2022-04-28 10:59:02,482 INFO L272 TraceCheckUtils]: 59: Hoare triple {2812#(and (<= main_~k~0 5) (= 5 main_~y~0) (< 4 main_~k~0))} call __VERIFIER_assert((if ~k~0 * ~y~0 == ~y~0 * ~y~0 then 1 else 0)); {2831#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 10:59:02,482 INFO L290 TraceCheckUtils]: 60: Hoare triple {2831#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {2835#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 10:59:02,482 INFO L290 TraceCheckUtils]: 61: Hoare triple {2835#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {2643#false} is VALID [2022-04-28 10:59:02,482 INFO L290 TraceCheckUtils]: 62: Hoare triple {2643#false} assume !false; {2643#false} is VALID [2022-04-28 10:59:02,483 INFO L134 CoverageAnalysis]: Checked inductivity of 143 backedges. 14 proven. 45 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2022-04-28 10:59:02,483 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:59:02,803 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:59:02,804 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1059570267] [2022-04-28 10:59:02,804 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 10:59:02,804 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1132836405] [2022-04-28 10:59:02,804 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1132836405] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 10:59:02,804 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-28 10:59:02,804 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2022-04-28 10:59:02,804 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:59:02,804 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [753919075] [2022-04-28 10:59:02,804 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [753919075] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:59:02,804 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:59:02,804 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-04-28 10:59:02,804 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [287321735] [2022-04-28 10:59:02,805 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:59:02,805 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 2.5) internal successors, (25), 10 states have internal predecessors, (25), 8 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (9), 8 states have call predecessors, (9), 8 states have call successors, (9) Word has length 63 [2022-04-28 10:59:02,805 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:59:02,805 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 11 states, 10 states have (on average 2.5) internal successors, (25), 10 states have internal predecessors, (25), 8 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (9), 8 states have call predecessors, (9), 8 states have call successors, (9) [2022-04-28 10:59:02,841 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 45 edges. 45 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:59:02,841 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-04-28 10:59:02,842 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:59:02,842 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-04-28 10:59:02,842 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=146, Unknown=0, NotChecked=0, Total=182 [2022-04-28 10:59:02,842 INFO L87 Difference]: Start difference. First operand 44 states and 49 transitions. Second operand has 11 states, 10 states have (on average 2.5) internal successors, (25), 10 states have internal predecessors, (25), 8 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (9), 8 states have call predecessors, (9), 8 states have call successors, (9) [2022-04-28 10:59:03,373 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:59:03,374 INFO L93 Difference]: Finished difference Result 53 states and 60 transitions. [2022-04-28 10:59:03,374 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-04-28 10:59:03,374 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 2.5) internal successors, (25), 10 states have internal predecessors, (25), 8 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (9), 8 states have call predecessors, (9), 8 states have call successors, (9) Word has length 63 [2022-04-28 10:59:03,374 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:59:03,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 10 states have (on average 2.5) internal successors, (25), 10 states have internal predecessors, (25), 8 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (9), 8 states have call predecessors, (9), 8 states have call successors, (9) [2022-04-28 10:59:03,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 56 transitions. [2022-04-28 10:59:03,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 10 states have (on average 2.5) internal successors, (25), 10 states have internal predecessors, (25), 8 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (9), 8 states have call predecessors, (9), 8 states have call successors, (9) [2022-04-28 10:59:03,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 56 transitions. [2022-04-28 10:59:03,377 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 11 states and 56 transitions. [2022-04-28 10:59:03,415 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 56 edges. 56 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:59:03,416 INFO L225 Difference]: With dead ends: 53 [2022-04-28 10:59:03,416 INFO L226 Difference]: Without dead ends: 47 [2022-04-28 10:59:03,416 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 67 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=46, Invalid=194, Unknown=0, NotChecked=0, Total=240 [2022-04-28 10:59:03,417 INFO L413 NwaCegarLoop]: 40 mSDtfsCounter, 2 mSDsluCounter, 213 mSDsCounter, 0 mSdLazyCounter, 205 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 253 SdHoareTripleChecker+Invalid, 206 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 205 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-28 10:59:03,417 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 253 Invalid, 206 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 205 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-28 10:59:03,417 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2022-04-28 10:59:03,441 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2022-04-28 10:59:03,441 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:59:03,441 INFO L82 GeneralOperation]: Start isEquivalent. First operand 47 states. Second operand has 47 states, 30 states have (on average 1.0333333333333334) internal successors, (31), 30 states have internal predecessors, (31), 12 states have call successors, (12), 6 states have call predecessors, (12), 4 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-28 10:59:03,441 INFO L74 IsIncluded]: Start isIncluded. First operand 47 states. Second operand has 47 states, 30 states have (on average 1.0333333333333334) internal successors, (31), 30 states have internal predecessors, (31), 12 states have call successors, (12), 6 states have call predecessors, (12), 4 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-28 10:59:03,441 INFO L87 Difference]: Start difference. First operand 47 states. Second operand has 47 states, 30 states have (on average 1.0333333333333334) internal successors, (31), 30 states have internal predecessors, (31), 12 states have call successors, (12), 6 states have call predecessors, (12), 4 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-28 10:59:03,442 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:59:03,442 INFO L93 Difference]: Finished difference Result 47 states and 53 transitions. [2022-04-28 10:59:03,443 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 53 transitions. [2022-04-28 10:59:03,443 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:59:03,443 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:59:03,443 INFO L74 IsIncluded]: Start isIncluded. First operand has 47 states, 30 states have (on average 1.0333333333333334) internal successors, (31), 30 states have internal predecessors, (31), 12 states have call successors, (12), 6 states have call predecessors, (12), 4 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) Second operand 47 states. [2022-04-28 10:59:03,443 INFO L87 Difference]: Start difference. First operand has 47 states, 30 states have (on average 1.0333333333333334) internal successors, (31), 30 states have internal predecessors, (31), 12 states have call successors, (12), 6 states have call predecessors, (12), 4 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) Second operand 47 states. [2022-04-28 10:59:03,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:59:03,444 INFO L93 Difference]: Finished difference Result 47 states and 53 transitions. [2022-04-28 10:59:03,444 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 53 transitions. [2022-04-28 10:59:03,445 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:59:03,445 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:59:03,445 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:59:03,445 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:59:03,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 30 states have (on average 1.0333333333333334) internal successors, (31), 30 states have internal predecessors, (31), 12 states have call successors, (12), 6 states have call predecessors, (12), 4 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-28 10:59:03,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 53 transitions. [2022-04-28 10:59:03,446 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 53 transitions. Word has length 63 [2022-04-28 10:59:03,446 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:59:03,446 INFO L495 AbstractCegarLoop]: Abstraction has 47 states and 53 transitions. [2022-04-28 10:59:03,446 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 2.5) internal successors, (25), 10 states have internal predecessors, (25), 8 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (9), 8 states have call predecessors, (9), 8 states have call successors, (9) [2022-04-28 10:59:03,446 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 47 states and 53 transitions. [2022-04-28 10:59:03,622 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 53 edges. 53 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:59:03,623 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 53 transitions. [2022-04-28 10:59:03,623 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2022-04-28 10:59:03,623 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:59:03,623 INFO L195 NwaCegarLoop]: trace histogram [9, 8, 8, 7, 7, 7, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:59:03,639 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-04-28 10:59:03,824 WARN L477 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-28 10:59:03,824 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:59:03,824 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:59:03,824 INFO L85 PathProgramCache]: Analyzing trace with hash 570339680, now seen corresponding path program 11 times [2022-04-28 10:59:03,824 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:59:03,825 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1953235735] [2022-04-28 10:59:03,915 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:59:03,915 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:59:03,915 INFO L85 PathProgramCache]: Analyzing trace with hash 570339680, now seen corresponding path program 12 times [2022-04-28 10:59:03,915 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:59:03,915 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1140475840] [2022-04-28 10:59:03,915 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:59:03,915 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:59:03,924 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 10:59:03,924 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1055762644] [2022-04-28 10:59:03,924 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-28 10:59:03,924 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:59:03,924 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:59:03,925 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-28 10:59:03,926 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-28 10:59:04,677 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2022-04-28 10:59:04,678 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:59:04,679 INFO L263 TraceCheckSpWp]: Trace formula consists of 189 conjuncts, 32 conjunts are in the unsatisfiable core [2022-04-28 10:59:04,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:59:04,691 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:59:05,070 INFO L272 TraceCheckUtils]: 0: Hoare triple {3196#true} call ULTIMATE.init(); {3196#true} is VALID [2022-04-28 10:59:05,071 INFO L290 TraceCheckUtils]: 1: Hoare triple {3196#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3); {3196#true} is VALID [2022-04-28 10:59:05,071 INFO L290 TraceCheckUtils]: 2: Hoare triple {3196#true} assume true; {3196#true} is VALID [2022-04-28 10:59:05,071 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3196#true} {3196#true} #60#return; {3196#true} is VALID [2022-04-28 10:59:05,071 INFO L272 TraceCheckUtils]: 4: Hoare triple {3196#true} call #t~ret5 := main(); {3196#true} is VALID [2022-04-28 10:59:05,071 INFO L290 TraceCheckUtils]: 5: Hoare triple {3196#true} havoc ~k~0;havoc ~y~0;havoc ~x~0;havoc ~c~0;assume -32768 <= #t~nondet4 && #t~nondet4 <= 32767;~k~0 := #t~nondet4;havoc #t~nondet4; {3196#true} is VALID [2022-04-28 10:59:05,071 INFO L272 TraceCheckUtils]: 6: Hoare triple {3196#true} call assume_abort_if_not((if ~k~0 <= 256 then 1 else 0)); {3196#true} is VALID [2022-04-28 10:59:05,072 INFO L290 TraceCheckUtils]: 7: Hoare triple {3196#true} ~cond := #in~cond; {3196#true} is VALID [2022-04-28 10:59:05,072 INFO L290 TraceCheckUtils]: 8: Hoare triple {3196#true} assume !(0 == ~cond); {3196#true} is VALID [2022-04-28 10:59:05,072 INFO L290 TraceCheckUtils]: 9: Hoare triple {3196#true} assume true; {3196#true} is VALID [2022-04-28 10:59:05,072 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {3196#true} {3196#true} #52#return; {3196#true} is VALID [2022-04-28 10:59:05,080 INFO L290 TraceCheckUtils]: 11: Hoare triple {3196#true} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {3234#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-28 10:59:05,080 INFO L290 TraceCheckUtils]: 12: Hoare triple {3234#(and (= main_~c~0 0) (= main_~y~0 0))} assume !false; {3234#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-28 10:59:05,080 INFO L272 TraceCheckUtils]: 13: Hoare triple {3234#(and (= main_~c~0 0) (= main_~y~0 0))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {3196#true} is VALID [2022-04-28 10:59:05,080 INFO L290 TraceCheckUtils]: 14: Hoare triple {3196#true} ~cond := #in~cond; {3196#true} is VALID [2022-04-28 10:59:05,081 INFO L290 TraceCheckUtils]: 15: Hoare triple {3196#true} assume !(0 == ~cond); {3196#true} is VALID [2022-04-28 10:59:05,081 INFO L290 TraceCheckUtils]: 16: Hoare triple {3196#true} assume true; {3196#true} is VALID [2022-04-28 10:59:05,081 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {3196#true} {3234#(and (= main_~c~0 0) (= main_~y~0 0))} #54#return; {3234#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-28 10:59:05,082 INFO L290 TraceCheckUtils]: 18: Hoare triple {3234#(and (= main_~c~0 0) (= main_~y~0 0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {3256#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} is VALID [2022-04-28 10:59:05,083 INFO L290 TraceCheckUtils]: 19: Hoare triple {3256#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} assume !false; {3256#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} is VALID [2022-04-28 10:59:05,083 INFO L272 TraceCheckUtils]: 20: Hoare triple {3256#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {3196#true} is VALID [2022-04-28 10:59:05,083 INFO L290 TraceCheckUtils]: 21: Hoare triple {3196#true} ~cond := #in~cond; {3196#true} is VALID [2022-04-28 10:59:05,083 INFO L290 TraceCheckUtils]: 22: Hoare triple {3196#true} assume !(0 == ~cond); {3196#true} is VALID [2022-04-28 10:59:05,083 INFO L290 TraceCheckUtils]: 23: Hoare triple {3196#true} assume true; {3196#true} is VALID [2022-04-28 10:59:05,084 INFO L284 TraceCheckUtils]: 24: Hoare quadruple {3196#true} {3256#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} #54#return; {3256#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} is VALID [2022-04-28 10:59:05,085 INFO L290 TraceCheckUtils]: 25: Hoare triple {3256#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {3278#(and (= main_~y~0 2) (= main_~c~0 2))} is VALID [2022-04-28 10:59:05,085 INFO L290 TraceCheckUtils]: 26: Hoare triple {3278#(and (= main_~y~0 2) (= main_~c~0 2))} assume !false; {3278#(and (= main_~y~0 2) (= main_~c~0 2))} is VALID [2022-04-28 10:59:05,085 INFO L272 TraceCheckUtils]: 27: Hoare triple {3278#(and (= main_~y~0 2) (= main_~c~0 2))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {3196#true} is VALID [2022-04-28 10:59:05,085 INFO L290 TraceCheckUtils]: 28: Hoare triple {3196#true} ~cond := #in~cond; {3196#true} is VALID [2022-04-28 10:59:05,085 INFO L290 TraceCheckUtils]: 29: Hoare triple {3196#true} assume !(0 == ~cond); {3196#true} is VALID [2022-04-28 10:59:05,086 INFO L290 TraceCheckUtils]: 30: Hoare triple {3196#true} assume true; {3196#true} is VALID [2022-04-28 10:59:05,086 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {3196#true} {3278#(and (= main_~y~0 2) (= main_~c~0 2))} #54#return; {3278#(and (= main_~y~0 2) (= main_~c~0 2))} is VALID [2022-04-28 10:59:05,087 INFO L290 TraceCheckUtils]: 32: Hoare triple {3278#(and (= main_~y~0 2) (= main_~c~0 2))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {3300#(and (= 2 (+ (- 1) main_~y~0)) (= (+ (- 1) main_~c~0) 2))} is VALID [2022-04-28 10:59:05,087 INFO L290 TraceCheckUtils]: 33: Hoare triple {3300#(and (= 2 (+ (- 1) main_~y~0)) (= (+ (- 1) main_~c~0) 2))} assume !false; {3300#(and (= 2 (+ (- 1) main_~y~0)) (= (+ (- 1) main_~c~0) 2))} is VALID [2022-04-28 10:59:05,087 INFO L272 TraceCheckUtils]: 34: Hoare triple {3300#(and (= 2 (+ (- 1) main_~y~0)) (= (+ (- 1) main_~c~0) 2))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {3196#true} is VALID [2022-04-28 10:59:05,087 INFO L290 TraceCheckUtils]: 35: Hoare triple {3196#true} ~cond := #in~cond; {3196#true} is VALID [2022-04-28 10:59:05,088 INFO L290 TraceCheckUtils]: 36: Hoare triple {3196#true} assume !(0 == ~cond); {3196#true} is VALID [2022-04-28 10:59:05,088 INFO L290 TraceCheckUtils]: 37: Hoare triple {3196#true} assume true; {3196#true} is VALID [2022-04-28 10:59:05,089 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {3196#true} {3300#(and (= 2 (+ (- 1) main_~y~0)) (= (+ (- 1) main_~c~0) 2))} #54#return; {3300#(and (= 2 (+ (- 1) main_~y~0)) (= (+ (- 1) main_~c~0) 2))} is VALID [2022-04-28 10:59:05,090 INFO L290 TraceCheckUtils]: 39: Hoare triple {3300#(and (= 2 (+ (- 1) main_~y~0)) (= (+ (- 1) main_~c~0) 2))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {3322#(and (= main_~c~0 4) (= (+ (- 2) main_~y~0) 2))} is VALID [2022-04-28 10:59:05,091 INFO L290 TraceCheckUtils]: 40: Hoare triple {3322#(and (= main_~c~0 4) (= (+ (- 2) main_~y~0) 2))} assume !false; {3322#(and (= main_~c~0 4) (= (+ (- 2) main_~y~0) 2))} is VALID [2022-04-28 10:59:05,091 INFO L272 TraceCheckUtils]: 41: Hoare triple {3322#(and (= main_~c~0 4) (= (+ (- 2) main_~y~0) 2))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {3196#true} is VALID [2022-04-28 10:59:05,091 INFO L290 TraceCheckUtils]: 42: Hoare triple {3196#true} ~cond := #in~cond; {3196#true} is VALID [2022-04-28 10:59:05,091 INFO L290 TraceCheckUtils]: 43: Hoare triple {3196#true} assume !(0 == ~cond); {3196#true} is VALID [2022-04-28 10:59:05,092 INFO L290 TraceCheckUtils]: 44: Hoare triple {3196#true} assume true; {3196#true} is VALID [2022-04-28 10:59:05,097 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {3196#true} {3322#(and (= main_~c~0 4) (= (+ (- 2) main_~y~0) 2))} #54#return; {3322#(and (= main_~c~0 4) (= (+ (- 2) main_~y~0) 2))} is VALID [2022-04-28 10:59:05,098 INFO L290 TraceCheckUtils]: 46: Hoare triple {3322#(and (= main_~c~0 4) (= (+ (- 2) main_~y~0) 2))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {3344#(and (= 5 main_~c~0) (= 5 main_~y~0))} is VALID [2022-04-28 10:59:05,099 INFO L290 TraceCheckUtils]: 47: Hoare triple {3344#(and (= 5 main_~c~0) (= 5 main_~y~0))} assume !false; {3344#(and (= 5 main_~c~0) (= 5 main_~y~0))} is VALID [2022-04-28 10:59:05,099 INFO L272 TraceCheckUtils]: 48: Hoare triple {3344#(and (= 5 main_~c~0) (= 5 main_~y~0))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {3196#true} is VALID [2022-04-28 10:59:05,099 INFO L290 TraceCheckUtils]: 49: Hoare triple {3196#true} ~cond := #in~cond; {3196#true} is VALID [2022-04-28 10:59:05,099 INFO L290 TraceCheckUtils]: 50: Hoare triple {3196#true} assume !(0 == ~cond); {3196#true} is VALID [2022-04-28 10:59:05,099 INFO L290 TraceCheckUtils]: 51: Hoare triple {3196#true} assume true; {3196#true} is VALID [2022-04-28 10:59:05,100 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {3196#true} {3344#(and (= 5 main_~c~0) (= 5 main_~y~0))} #54#return; {3344#(and (= 5 main_~c~0) (= 5 main_~y~0))} is VALID [2022-04-28 10:59:05,100 INFO L290 TraceCheckUtils]: 53: Hoare triple {3344#(and (= 5 main_~c~0) (= 5 main_~y~0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {3366#(and (< 5 main_~k~0) (<= main_~c~0 6) (= 5 (+ (- 1) main_~y~0)))} is VALID [2022-04-28 10:59:05,101 INFO L290 TraceCheckUtils]: 54: Hoare triple {3366#(and (< 5 main_~k~0) (<= main_~c~0 6) (= 5 (+ (- 1) main_~y~0)))} assume !false; {3366#(and (< 5 main_~k~0) (<= main_~c~0 6) (= 5 (+ (- 1) main_~y~0)))} is VALID [2022-04-28 10:59:05,101 INFO L272 TraceCheckUtils]: 55: Hoare triple {3366#(and (< 5 main_~k~0) (<= main_~c~0 6) (= 5 (+ (- 1) main_~y~0)))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {3196#true} is VALID [2022-04-28 10:59:05,101 INFO L290 TraceCheckUtils]: 56: Hoare triple {3196#true} ~cond := #in~cond; {3196#true} is VALID [2022-04-28 10:59:05,101 INFO L290 TraceCheckUtils]: 57: Hoare triple {3196#true} assume !(0 == ~cond); {3196#true} is VALID [2022-04-28 10:59:05,101 INFO L290 TraceCheckUtils]: 58: Hoare triple {3196#true} assume true; {3196#true} is VALID [2022-04-28 10:59:05,102 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {3196#true} {3366#(and (< 5 main_~k~0) (<= main_~c~0 6) (= 5 (+ (- 1) main_~y~0)))} #54#return; {3366#(and (< 5 main_~k~0) (<= main_~c~0 6) (= 5 (+ (- 1) main_~y~0)))} is VALID [2022-04-28 10:59:05,102 INFO L290 TraceCheckUtils]: 60: Hoare triple {3366#(and (< 5 main_~k~0) (<= main_~c~0 6) (= 5 (+ (- 1) main_~y~0)))} assume !(~c~0 < ~k~0); {3388#(and (<= main_~k~0 6) (< 5 main_~k~0) (= 5 (+ (- 1) main_~y~0)))} is VALID [2022-04-28 10:59:05,102 INFO L272 TraceCheckUtils]: 61: Hoare triple {3388#(and (<= main_~k~0 6) (< 5 main_~k~0) (= 5 (+ (- 1) main_~y~0)))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {3196#true} is VALID [2022-04-28 10:59:05,102 INFO L290 TraceCheckUtils]: 62: Hoare triple {3196#true} ~cond := #in~cond; {3196#true} is VALID [2022-04-28 10:59:05,103 INFO L290 TraceCheckUtils]: 63: Hoare triple {3196#true} assume !(0 == ~cond); {3196#true} is VALID [2022-04-28 10:59:05,103 INFO L290 TraceCheckUtils]: 64: Hoare triple {3196#true} assume true; {3196#true} is VALID [2022-04-28 10:59:05,103 INFO L284 TraceCheckUtils]: 65: Hoare quadruple {3196#true} {3388#(and (<= main_~k~0 6) (< 5 main_~k~0) (= 5 (+ (- 1) main_~y~0)))} #56#return; {3388#(and (<= main_~k~0 6) (< 5 main_~k~0) (= 5 (+ (- 1) main_~y~0)))} is VALID [2022-04-28 10:59:05,104 INFO L272 TraceCheckUtils]: 66: Hoare triple {3388#(and (<= main_~k~0 6) (< 5 main_~k~0) (= 5 (+ (- 1) main_~y~0)))} call __VERIFIER_assert((if ~k~0 * ~y~0 == ~y~0 * ~y~0 then 1 else 0)); {3407#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 10:59:05,104 INFO L290 TraceCheckUtils]: 67: Hoare triple {3407#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {3411#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 10:59:05,104 INFO L290 TraceCheckUtils]: 68: Hoare triple {3411#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {3197#false} is VALID [2022-04-28 10:59:05,105 INFO L290 TraceCheckUtils]: 69: Hoare triple {3197#false} assume !false; {3197#false} is VALID [2022-04-28 10:59:05,105 INFO L134 CoverageAnalysis]: Checked inductivity of 191 backedges. 16 proven. 63 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2022-04-28 10:59:05,105 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:59:05,354 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:59:05,354 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1140475840] [2022-04-28 10:59:05,354 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 10:59:05,354 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1055762644] [2022-04-28 10:59:05,354 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1055762644] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 10:59:05,354 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-28 10:59:05,355 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2022-04-28 10:59:05,355 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:59:05,355 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1953235735] [2022-04-28 10:59:05,355 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1953235735] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:59:05,355 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:59:05,355 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-04-28 10:59:05,355 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1396571582] [2022-04-28 10:59:05,355 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:59:05,356 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 2.4545454545454546) internal successors, (27), 11 states have internal predecessors, (27), 9 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (10), 9 states have call predecessors, (10), 9 states have call successors, (10) Word has length 70 [2022-04-28 10:59:05,356 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:59:05,356 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 12 states, 11 states have (on average 2.4545454545454546) internal successors, (27), 11 states have internal predecessors, (27), 9 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (10), 9 states have call predecessors, (10), 9 states have call successors, (10) [2022-04-28 10:59:05,391 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 49 edges. 49 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:59:05,391 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-04-28 10:59:05,391 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:59:05,392 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-04-28 10:59:05,392 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=171, Unknown=0, NotChecked=0, Total=210 [2022-04-28 10:59:05,392 INFO L87 Difference]: Start difference. First operand 47 states and 53 transitions. Second operand has 12 states, 11 states have (on average 2.4545454545454546) internal successors, (27), 11 states have internal predecessors, (27), 9 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (10), 9 states have call predecessors, (10), 9 states have call successors, (10) [2022-04-28 10:59:05,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:59:05,990 INFO L93 Difference]: Finished difference Result 56 states and 64 transitions. [2022-04-28 10:59:05,990 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-04-28 10:59:05,990 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 2.4545454545454546) internal successors, (27), 11 states have internal predecessors, (27), 9 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (10), 9 states have call predecessors, (10), 9 states have call successors, (10) Word has length 70 [2022-04-28 10:59:05,990 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:59:05,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 11 states have (on average 2.4545454545454546) internal successors, (27), 11 states have internal predecessors, (27), 9 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (10), 9 states have call predecessors, (10), 9 states have call successors, (10) [2022-04-28 10:59:05,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 60 transitions. [2022-04-28 10:59:05,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 11 states have (on average 2.4545454545454546) internal successors, (27), 11 states have internal predecessors, (27), 9 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (10), 9 states have call predecessors, (10), 9 states have call successors, (10) [2022-04-28 10:59:05,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 60 transitions. [2022-04-28 10:59:05,993 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 12 states and 60 transitions. [2022-04-28 10:59:06,036 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 60 edges. 60 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:59:06,037 INFO L225 Difference]: With dead ends: 56 [2022-04-28 10:59:06,037 INFO L226 Difference]: Without dead ends: 50 [2022-04-28 10:59:06,037 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 73 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=49, Invalid=223, Unknown=0, NotChecked=0, Total=272 [2022-04-28 10:59:06,038 INFO L413 NwaCegarLoop]: 43 mSDtfsCounter, 2 mSDsluCounter, 247 mSDsCounter, 0 mSdLazyCounter, 257 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 290 SdHoareTripleChecker+Invalid, 258 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 257 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-28 10:59:06,038 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 290 Invalid, 258 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 257 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-28 10:59:06,038 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2022-04-28 10:59:06,065 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2022-04-28 10:59:06,065 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:59:06,065 INFO L82 GeneralOperation]: Start isEquivalent. First operand 50 states. Second operand has 50 states, 32 states have (on average 1.03125) internal successors, (33), 32 states have internal predecessors, (33), 13 states have call successors, (13), 6 states have call predecessors, (13), 4 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-28 10:59:06,065 INFO L74 IsIncluded]: Start isIncluded. First operand 50 states. Second operand has 50 states, 32 states have (on average 1.03125) internal successors, (33), 32 states have internal predecessors, (33), 13 states have call successors, (13), 6 states have call predecessors, (13), 4 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-28 10:59:06,065 INFO L87 Difference]: Start difference. First operand 50 states. Second operand has 50 states, 32 states have (on average 1.03125) internal successors, (33), 32 states have internal predecessors, (33), 13 states have call successors, (13), 6 states have call predecessors, (13), 4 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-28 10:59:06,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:59:06,067 INFO L93 Difference]: Finished difference Result 50 states and 57 transitions. [2022-04-28 10:59:06,067 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 57 transitions. [2022-04-28 10:59:06,067 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:59:06,067 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:59:06,067 INFO L74 IsIncluded]: Start isIncluded. First operand has 50 states, 32 states have (on average 1.03125) internal successors, (33), 32 states have internal predecessors, (33), 13 states have call successors, (13), 6 states have call predecessors, (13), 4 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) Second operand 50 states. [2022-04-28 10:59:06,067 INFO L87 Difference]: Start difference. First operand has 50 states, 32 states have (on average 1.03125) internal successors, (33), 32 states have internal predecessors, (33), 13 states have call successors, (13), 6 states have call predecessors, (13), 4 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) Second operand 50 states. [2022-04-28 10:59:06,068 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:59:06,068 INFO L93 Difference]: Finished difference Result 50 states and 57 transitions. [2022-04-28 10:59:06,069 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 57 transitions. [2022-04-28 10:59:06,069 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:59:06,069 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:59:06,069 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:59:06,069 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:59:06,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 32 states have (on average 1.03125) internal successors, (33), 32 states have internal predecessors, (33), 13 states have call successors, (13), 6 states have call predecessors, (13), 4 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-28 10:59:06,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 57 transitions. [2022-04-28 10:59:06,070 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 57 transitions. Word has length 70 [2022-04-28 10:59:06,070 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:59:06,070 INFO L495 AbstractCegarLoop]: Abstraction has 50 states and 57 transitions. [2022-04-28 10:59:06,070 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 2.4545454545454546) internal successors, (27), 11 states have internal predecessors, (27), 9 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (10), 9 states have call predecessors, (10), 9 states have call successors, (10) [2022-04-28 10:59:06,071 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 50 states and 57 transitions. [2022-04-28 10:59:06,317 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 57 edges. 57 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:59:06,317 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 57 transitions. [2022-04-28 10:59:06,318 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2022-04-28 10:59:06,318 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:59:06,318 INFO L195 NwaCegarLoop]: trace histogram [10, 9, 9, 8, 8, 8, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:59:06,324 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-28 10:59:06,524 WARN L477 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-28 10:59:06,524 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:59:06,524 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:59:06,524 INFO L85 PathProgramCache]: Analyzing trace with hash 724836577, now seen corresponding path program 13 times [2022-04-28 10:59:06,525 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:59:06,525 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [463882380] [2022-04-28 10:59:06,607 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:59:06,607 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:59:06,607 INFO L85 PathProgramCache]: Analyzing trace with hash 724836577, now seen corresponding path program 14 times [2022-04-28 10:59:06,607 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:59:06,608 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1813211117] [2022-04-28 10:59:06,608 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:59:06,608 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:59:06,617 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 10:59:06,617 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [998918255] [2022-04-28 10:59:06,617 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 10:59:06,617 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:59:06,617 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:59:06,618 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-28 10:59:06,619 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-28 10:59:07,247 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 10:59:07,247 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:59:07,249 INFO L263 TraceCheckSpWp]: Trace formula consists of 206 conjuncts, 53 conjunts are in the unsatisfiable core [2022-04-28 10:59:07,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:59:07,264 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:59:07,876 INFO L272 TraceCheckUtils]: 0: Hoare triple {3790#true} call ULTIMATE.init(); {3790#true} is VALID [2022-04-28 10:59:07,877 INFO L290 TraceCheckUtils]: 1: Hoare triple {3790#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3); {3790#true} is VALID [2022-04-28 10:59:07,877 INFO L290 TraceCheckUtils]: 2: Hoare triple {3790#true} assume true; {3790#true} is VALID [2022-04-28 10:59:07,877 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3790#true} {3790#true} #60#return; {3790#true} is VALID [2022-04-28 10:59:07,877 INFO L272 TraceCheckUtils]: 4: Hoare triple {3790#true} call #t~ret5 := main(); {3790#true} is VALID [2022-04-28 10:59:07,877 INFO L290 TraceCheckUtils]: 5: Hoare triple {3790#true} havoc ~k~0;havoc ~y~0;havoc ~x~0;havoc ~c~0;assume -32768 <= #t~nondet4 && #t~nondet4 <= 32767;~k~0 := #t~nondet4;havoc #t~nondet4; {3790#true} is VALID [2022-04-28 10:59:07,877 INFO L272 TraceCheckUtils]: 6: Hoare triple {3790#true} call assume_abort_if_not((if ~k~0 <= 256 then 1 else 0)); {3790#true} is VALID [2022-04-28 10:59:07,877 INFO L290 TraceCheckUtils]: 7: Hoare triple {3790#true} ~cond := #in~cond; {3790#true} is VALID [2022-04-28 10:59:07,877 INFO L290 TraceCheckUtils]: 8: Hoare triple {3790#true} assume !(0 == ~cond); {3790#true} is VALID [2022-04-28 10:59:07,877 INFO L290 TraceCheckUtils]: 9: Hoare triple {3790#true} assume true; {3790#true} is VALID [2022-04-28 10:59:07,878 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {3790#true} {3790#true} #52#return; {3790#true} is VALID [2022-04-28 10:59:07,887 INFO L290 TraceCheckUtils]: 11: Hoare triple {3790#true} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {3828#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-28 10:59:07,888 INFO L290 TraceCheckUtils]: 12: Hoare triple {3828#(and (= main_~c~0 0) (= main_~y~0 0))} assume !false; {3828#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-28 10:59:07,888 INFO L272 TraceCheckUtils]: 13: Hoare triple {3828#(and (= main_~c~0 0) (= main_~y~0 0))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {3790#true} is VALID [2022-04-28 10:59:07,888 INFO L290 TraceCheckUtils]: 14: Hoare triple {3790#true} ~cond := #in~cond; {3790#true} is VALID [2022-04-28 10:59:07,888 INFO L290 TraceCheckUtils]: 15: Hoare triple {3790#true} assume !(0 == ~cond); {3790#true} is VALID [2022-04-28 10:59:07,888 INFO L290 TraceCheckUtils]: 16: Hoare triple {3790#true} assume true; {3790#true} is VALID [2022-04-28 10:59:07,889 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {3790#true} {3828#(and (= main_~c~0 0) (= main_~y~0 0))} #54#return; {3828#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-28 10:59:07,890 INFO L290 TraceCheckUtils]: 18: Hoare triple {3828#(and (= main_~c~0 0) (= main_~y~0 0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {3850#(and (= main_~y~0 1) (= main_~c~0 1))} is VALID [2022-04-28 10:59:07,890 INFO L290 TraceCheckUtils]: 19: Hoare triple {3850#(and (= main_~y~0 1) (= main_~c~0 1))} assume !false; {3850#(and (= main_~y~0 1) (= main_~c~0 1))} is VALID [2022-04-28 10:59:07,890 INFO L272 TraceCheckUtils]: 20: Hoare triple {3850#(and (= main_~y~0 1) (= main_~c~0 1))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {3790#true} is VALID [2022-04-28 10:59:07,891 INFO L290 TraceCheckUtils]: 21: Hoare triple {3790#true} ~cond := #in~cond; {3790#true} is VALID [2022-04-28 10:59:07,891 INFO L290 TraceCheckUtils]: 22: Hoare triple {3790#true} assume !(0 == ~cond); {3790#true} is VALID [2022-04-28 10:59:07,891 INFO L290 TraceCheckUtils]: 23: Hoare triple {3790#true} assume true; {3790#true} is VALID [2022-04-28 10:59:07,891 INFO L284 TraceCheckUtils]: 24: Hoare quadruple {3790#true} {3850#(and (= main_~y~0 1) (= main_~c~0 1))} #54#return; {3850#(and (= main_~y~0 1) (= main_~c~0 1))} is VALID [2022-04-28 10:59:07,892 INFO L290 TraceCheckUtils]: 25: Hoare triple {3850#(and (= main_~y~0 1) (= main_~c~0 1))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {3872#(and (= main_~y~0 2) (= (+ (- 1) main_~c~0) 1))} is VALID [2022-04-28 10:59:07,893 INFO L290 TraceCheckUtils]: 26: Hoare triple {3872#(and (= main_~y~0 2) (= (+ (- 1) main_~c~0) 1))} assume !false; {3872#(and (= main_~y~0 2) (= (+ (- 1) main_~c~0) 1))} is VALID [2022-04-28 10:59:07,893 INFO L272 TraceCheckUtils]: 27: Hoare triple {3872#(and (= main_~y~0 2) (= (+ (- 1) main_~c~0) 1))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {3790#true} is VALID [2022-04-28 10:59:07,893 INFO L290 TraceCheckUtils]: 28: Hoare triple {3790#true} ~cond := #in~cond; {3790#true} is VALID [2022-04-28 10:59:07,893 INFO L290 TraceCheckUtils]: 29: Hoare triple {3790#true} assume !(0 == ~cond); {3790#true} is VALID [2022-04-28 10:59:07,893 INFO L290 TraceCheckUtils]: 30: Hoare triple {3790#true} assume true; {3790#true} is VALID [2022-04-28 10:59:07,894 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {3790#true} {3872#(and (= main_~y~0 2) (= (+ (- 1) main_~c~0) 1))} #54#return; {3872#(and (= main_~y~0 2) (= (+ (- 1) main_~c~0) 1))} is VALID [2022-04-28 10:59:07,895 INFO L290 TraceCheckUtils]: 32: Hoare triple {3872#(and (= main_~y~0 2) (= (+ (- 1) main_~c~0) 1))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {3894#(and (= (+ (- 2) main_~c~0) 1) (= main_~y~0 3))} is VALID [2022-04-28 10:59:07,895 INFO L290 TraceCheckUtils]: 33: Hoare triple {3894#(and (= (+ (- 2) main_~c~0) 1) (= main_~y~0 3))} assume !false; {3894#(and (= (+ (- 2) main_~c~0) 1) (= main_~y~0 3))} is VALID [2022-04-28 10:59:07,895 INFO L272 TraceCheckUtils]: 34: Hoare triple {3894#(and (= (+ (- 2) main_~c~0) 1) (= main_~y~0 3))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {3790#true} is VALID [2022-04-28 10:59:07,895 INFO L290 TraceCheckUtils]: 35: Hoare triple {3790#true} ~cond := #in~cond; {3790#true} is VALID [2022-04-28 10:59:07,895 INFO L290 TraceCheckUtils]: 36: Hoare triple {3790#true} assume !(0 == ~cond); {3790#true} is VALID [2022-04-28 10:59:07,895 INFO L290 TraceCheckUtils]: 37: Hoare triple {3790#true} assume true; {3790#true} is VALID [2022-04-28 10:59:07,896 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {3790#true} {3894#(and (= (+ (- 2) main_~c~0) 1) (= main_~y~0 3))} #54#return; {3894#(and (= (+ (- 2) main_~c~0) 1) (= main_~y~0 3))} is VALID [2022-04-28 10:59:07,896 INFO L290 TraceCheckUtils]: 39: Hoare triple {3894#(and (= (+ (- 2) main_~c~0) 1) (= main_~y~0 3))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {3916#(and (= 3 (+ (- 1) main_~y~0)) (= main_~c~0 4))} is VALID [2022-04-28 10:59:07,896 INFO L290 TraceCheckUtils]: 40: Hoare triple {3916#(and (= 3 (+ (- 1) main_~y~0)) (= main_~c~0 4))} assume !false; {3916#(and (= 3 (+ (- 1) main_~y~0)) (= main_~c~0 4))} is VALID [2022-04-28 10:59:07,897 INFO L272 TraceCheckUtils]: 41: Hoare triple {3916#(and (= 3 (+ (- 1) main_~y~0)) (= main_~c~0 4))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {3790#true} is VALID [2022-04-28 10:59:07,897 INFO L290 TraceCheckUtils]: 42: Hoare triple {3790#true} ~cond := #in~cond; {3790#true} is VALID [2022-04-28 10:59:07,897 INFO L290 TraceCheckUtils]: 43: Hoare triple {3790#true} assume !(0 == ~cond); {3790#true} is VALID [2022-04-28 10:59:07,897 INFO L290 TraceCheckUtils]: 44: Hoare triple {3790#true} assume true; {3790#true} is VALID [2022-04-28 10:59:07,897 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {3790#true} {3916#(and (= 3 (+ (- 1) main_~y~0)) (= main_~c~0 4))} #54#return; {3916#(and (= 3 (+ (- 1) main_~y~0)) (= main_~c~0 4))} is VALID [2022-04-28 10:59:07,898 INFO L290 TraceCheckUtils]: 46: Hoare triple {3916#(and (= 3 (+ (- 1) main_~y~0)) (= main_~c~0 4))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {3938#(and (= (+ (- 2) main_~y~0) 3) (= (+ (- 1) main_~c~0) 4))} is VALID [2022-04-28 10:59:07,898 INFO L290 TraceCheckUtils]: 47: Hoare triple {3938#(and (= (+ (- 2) main_~y~0) 3) (= (+ (- 1) main_~c~0) 4))} assume !false; {3938#(and (= (+ (- 2) main_~y~0) 3) (= (+ (- 1) main_~c~0) 4))} is VALID [2022-04-28 10:59:07,898 INFO L272 TraceCheckUtils]: 48: Hoare triple {3938#(and (= (+ (- 2) main_~y~0) 3) (= (+ (- 1) main_~c~0) 4))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {3790#true} is VALID [2022-04-28 10:59:07,899 INFO L290 TraceCheckUtils]: 49: Hoare triple {3790#true} ~cond := #in~cond; {3948#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-28 10:59:07,899 INFO L290 TraceCheckUtils]: 50: Hoare triple {3948#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {3952#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 10:59:07,899 INFO L290 TraceCheckUtils]: 51: Hoare triple {3952#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {3952#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 10:59:07,900 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {3952#(not (= |__VERIFIER_assert_#in~cond| 0))} {3938#(and (= (+ (- 2) main_~y~0) 3) (= (+ (- 1) main_~c~0) 4))} #54#return; {3959#(and (= (+ (- 2) main_~y~0) 3) (= (+ (* 2 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (* 6 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (* 5 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0))) (+ (* main_~x~0 12) (* main_~y~0 main_~y~0))) (= (+ (- 1) main_~c~0) 4))} is VALID [2022-04-28 10:59:07,900 INFO L290 TraceCheckUtils]: 53: Hoare triple {3959#(and (= (+ (- 2) main_~y~0) 3) (= (+ (* 2 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (* 6 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (* 5 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0))) (+ (* main_~x~0 12) (* main_~y~0 main_~y~0))) (= (+ (- 1) main_~c~0) 4))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {3963#(and (= main_~y~0 6) (<= main_~x~0 (+ 4425 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0))) (= 4 (+ (- 2) main_~c~0)))} is VALID [2022-04-28 10:59:07,901 INFO L290 TraceCheckUtils]: 54: Hoare triple {3963#(and (= main_~y~0 6) (<= main_~x~0 (+ 4425 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0))) (= 4 (+ (- 2) main_~c~0)))} assume !false; {3963#(and (= main_~y~0 6) (<= main_~x~0 (+ 4425 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0))) (= 4 (+ (- 2) main_~c~0)))} is VALID [2022-04-28 10:59:07,901 INFO L272 TraceCheckUtils]: 55: Hoare triple {3963#(and (= main_~y~0 6) (<= main_~x~0 (+ 4425 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0))) (= 4 (+ (- 2) main_~c~0)))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {3790#true} is VALID [2022-04-28 10:59:07,901 INFO L290 TraceCheckUtils]: 56: Hoare triple {3790#true} ~cond := #in~cond; {3948#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-28 10:59:07,902 INFO L290 TraceCheckUtils]: 57: Hoare triple {3948#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {3952#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 10:59:07,902 INFO L290 TraceCheckUtils]: 58: Hoare triple {3952#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {3952#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 10:59:07,903 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {3952#(not (= |__VERIFIER_assert_#in~cond| 0))} {3963#(and (= main_~y~0 6) (<= main_~x~0 (+ 4425 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0))) (= 4 (+ (- 2) main_~c~0)))} #54#return; {3982#(and (= main_~y~0 6) (= main_~c~0 6) (= (+ (* 2 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (* 6 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (* 5 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0))) (+ (* main_~x~0 12) (* main_~y~0 main_~y~0))))} is VALID [2022-04-28 10:59:07,903 INFO L290 TraceCheckUtils]: 60: Hoare triple {3982#(and (= main_~y~0 6) (= main_~c~0 6) (= (+ (* 2 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (* 6 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (* 5 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0))) (+ (* main_~x~0 12) (* main_~y~0 main_~y~0))))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {3986#(and (<= main_~c~0 7) (= 7 main_~y~0) (<= (+ (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0) 12201) main_~x~0) (< 6 main_~k~0))} is VALID [2022-04-28 10:59:07,904 INFO L290 TraceCheckUtils]: 61: Hoare triple {3986#(and (<= main_~c~0 7) (= 7 main_~y~0) (<= (+ (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0) 12201) main_~x~0) (< 6 main_~k~0))} assume !false; {3986#(and (<= main_~c~0 7) (= 7 main_~y~0) (<= (+ (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0) 12201) main_~x~0) (< 6 main_~k~0))} is VALID [2022-04-28 10:59:07,904 INFO L272 TraceCheckUtils]: 62: Hoare triple {3986#(and (<= main_~c~0 7) (= 7 main_~y~0) (<= (+ (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0) 12201) main_~x~0) (< 6 main_~k~0))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {3790#true} is VALID [2022-04-28 10:59:07,904 INFO L290 TraceCheckUtils]: 63: Hoare triple {3790#true} ~cond := #in~cond; {3790#true} is VALID [2022-04-28 10:59:07,904 INFO L290 TraceCheckUtils]: 64: Hoare triple {3790#true} assume !(0 == ~cond); {3790#true} is VALID [2022-04-28 10:59:07,904 INFO L290 TraceCheckUtils]: 65: Hoare triple {3790#true} assume true; {3790#true} is VALID [2022-04-28 10:59:07,906 INFO L284 TraceCheckUtils]: 66: Hoare quadruple {3790#true} {3986#(and (<= main_~c~0 7) (= 7 main_~y~0) (<= (+ (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0) 12201) main_~x~0) (< 6 main_~k~0))} #54#return; {3986#(and (<= main_~c~0 7) (= 7 main_~y~0) (<= (+ (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0) 12201) main_~x~0) (< 6 main_~k~0))} is VALID [2022-04-28 10:59:07,906 INFO L290 TraceCheckUtils]: 67: Hoare triple {3986#(and (<= main_~c~0 7) (= 7 main_~y~0) (<= (+ (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0) 12201) main_~x~0) (< 6 main_~k~0))} assume !(~c~0 < ~k~0); {4008#(and (<= main_~k~0 7) (= 7 main_~y~0) (<= (+ (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0) 12201) main_~x~0) (< 6 main_~k~0))} is VALID [2022-04-28 10:59:07,906 INFO L272 TraceCheckUtils]: 68: Hoare triple {4008#(and (<= main_~k~0 7) (= 7 main_~y~0) (<= (+ (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0) 12201) main_~x~0) (< 6 main_~k~0))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {3790#true} is VALID [2022-04-28 10:59:07,906 INFO L290 TraceCheckUtils]: 69: Hoare triple {3790#true} ~cond := #in~cond; {3948#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-28 10:59:07,907 INFO L290 TraceCheckUtils]: 70: Hoare triple {3948#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {3952#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 10:59:07,907 INFO L290 TraceCheckUtils]: 71: Hoare triple {3952#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {3952#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 10:59:07,908 INFO L284 TraceCheckUtils]: 72: Hoare quadruple {3952#(not (= |__VERIFIER_assert_#in~cond| 0))} {4008#(and (<= main_~k~0 7) (= 7 main_~y~0) (<= (+ (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0) 12201) main_~x~0) (< 6 main_~k~0))} #56#return; {4024#(and (<= main_~k~0 7) (= 7 main_~y~0) (< 6 main_~k~0))} is VALID [2022-04-28 10:59:07,908 INFO L272 TraceCheckUtils]: 73: Hoare triple {4024#(and (<= main_~k~0 7) (= 7 main_~y~0) (< 6 main_~k~0))} call __VERIFIER_assert((if ~k~0 * ~y~0 == ~y~0 * ~y~0 then 1 else 0)); {4028#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 10:59:07,909 INFO L290 TraceCheckUtils]: 74: Hoare triple {4028#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {4032#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 10:59:07,909 INFO L290 TraceCheckUtils]: 75: Hoare triple {4032#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {3791#false} is VALID [2022-04-28 10:59:07,909 INFO L290 TraceCheckUtils]: 76: Hoare triple {3791#false} assume !false; {3791#false} is VALID [2022-04-28 10:59:07,909 INFO L134 CoverageAnalysis]: Checked inductivity of 246 backedges. 63 proven. 93 refuted. 0 times theorem prover too weak. 90 trivial. 0 not checked. [2022-04-28 10:59:07,909 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:59:40,132 WARN L232 SmtUtils]: Spent 5.07s on a formula simplification that was a NOOP. DAG size: 45 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-04-28 10:59:40,470 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:59:40,470 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1813211117] [2022-04-28 10:59:40,470 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 10:59:40,470 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [998918255] [2022-04-28 10:59:40,470 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [998918255] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 10:59:40,470 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-28 10:59:40,470 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2022-04-28 10:59:40,470 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:59:40,471 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [463882380] [2022-04-28 10:59:40,471 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [463882380] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:59:40,471 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:59:40,471 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2022-04-28 10:59:40,471 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1491234781] [2022-04-28 10:59:40,471 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:59:40,471 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 16 states have (on average 2.0) internal successors, (32), 14 states have internal predecessors, (32), 11 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (11), 10 states have call predecessors, (11), 10 states have call successors, (11) Word has length 77 [2022-04-28 10:59:40,471 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:59:40,472 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 18 states, 16 states have (on average 2.0) internal successors, (32), 14 states have internal predecessors, (32), 11 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (11), 10 states have call predecessors, (11), 10 states have call successors, (11) [2022-04-28 10:59:40,510 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 56 edges. 56 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:59:40,510 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-04-28 10:59:40,510 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:59:40,510 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-04-28 10:59:40,510 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=466, Unknown=2, NotChecked=0, Total=552 [2022-04-28 10:59:40,510 INFO L87 Difference]: Start difference. First operand 50 states and 57 transitions. Second operand has 18 states, 16 states have (on average 2.0) internal successors, (32), 14 states have internal predecessors, (32), 11 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (11), 10 states have call predecessors, (11), 10 states have call successors, (11) [2022-04-28 10:59:41,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:59:41,546 INFO L93 Difference]: Finished difference Result 63 states and 71 transitions. [2022-04-28 10:59:41,546 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-04-28 10:59:41,546 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 16 states have (on average 2.0) internal successors, (32), 14 states have internal predecessors, (32), 11 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (11), 10 states have call predecessors, (11), 10 states have call successors, (11) Word has length 77 [2022-04-28 10:59:41,547 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:59:41,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 16 states have (on average 2.0) internal successors, (32), 14 states have internal predecessors, (32), 11 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (11), 10 states have call predecessors, (11), 10 states have call successors, (11) [2022-04-28 10:59:41,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 66 transitions. [2022-04-28 10:59:41,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 16 states have (on average 2.0) internal successors, (32), 14 states have internal predecessors, (32), 11 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (11), 10 states have call predecessors, (11), 10 states have call successors, (11) [2022-04-28 10:59:41,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 66 transitions. [2022-04-28 10:59:41,550 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 16 states and 66 transitions. [2022-04-28 10:59:41,603 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-28 10:59:41,604 INFO L225 Difference]: With dead ends: 63 [2022-04-28 10:59:41,604 INFO L226 Difference]: Without dead ends: 57 [2022-04-28 10:59:41,604 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 71 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 66 ImplicationChecksByTransitivity, 20.1s TimeCoverageRelationStatistics Valid=105, Invalid=595, Unknown=2, NotChecked=0, Total=702 [2022-04-28 10:59:41,605 INFO L413 NwaCegarLoop]: 34 mSDtfsCounter, 12 mSDsluCounter, 274 mSDsCounter, 0 mSdLazyCounter, 464 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 308 SdHoareTripleChecker+Invalid, 472 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 464 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-04-28 10:59:41,605 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 308 Invalid, 472 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 464 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-04-28 10:59:41,605 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2022-04-28 10:59:41,654 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2022-04-28 10:59:41,654 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:59:41,654 INFO L82 GeneralOperation]: Start isEquivalent. First operand 57 states. Second operand has 57 states, 37 states have (on average 1.027027027027027) internal successors, (38), 37 states have internal predecessors, (38), 14 states have call successors, (14), 7 states have call predecessors, (14), 5 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2022-04-28 10:59:41,654 INFO L74 IsIncluded]: Start isIncluded. First operand 57 states. Second operand has 57 states, 37 states have (on average 1.027027027027027) internal successors, (38), 37 states have internal predecessors, (38), 14 states have call successors, (14), 7 states have call predecessors, (14), 5 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2022-04-28 10:59:41,655 INFO L87 Difference]: Start difference. First operand 57 states. Second operand has 57 states, 37 states have (on average 1.027027027027027) internal successors, (38), 37 states have internal predecessors, (38), 14 states have call successors, (14), 7 states have call predecessors, (14), 5 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2022-04-28 10:59:41,661 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:59:41,661 INFO L93 Difference]: Finished difference Result 57 states and 64 transitions. [2022-04-28 10:59:41,661 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 64 transitions. [2022-04-28 10:59:41,662 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:59:41,662 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:59:41,662 INFO L74 IsIncluded]: Start isIncluded. First operand has 57 states, 37 states have (on average 1.027027027027027) internal successors, (38), 37 states have internal predecessors, (38), 14 states have call successors, (14), 7 states have call predecessors, (14), 5 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) Second operand 57 states. [2022-04-28 10:59:41,662 INFO L87 Difference]: Start difference. First operand has 57 states, 37 states have (on average 1.027027027027027) internal successors, (38), 37 states have internal predecessors, (38), 14 states have call successors, (14), 7 states have call predecessors, (14), 5 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) Second operand 57 states. [2022-04-28 10:59:41,664 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:59:41,664 INFO L93 Difference]: Finished difference Result 57 states and 64 transitions. [2022-04-28 10:59:41,664 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 64 transitions. [2022-04-28 10:59:41,664 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:59:41,664 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:59:41,664 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:59:41,664 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:59:41,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 37 states have (on average 1.027027027027027) internal successors, (38), 37 states have internal predecessors, (38), 14 states have call successors, (14), 7 states have call predecessors, (14), 5 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2022-04-28 10:59:41,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 64 transitions. [2022-04-28 10:59:41,665 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 64 transitions. Word has length 77 [2022-04-28 10:59:41,666 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:59:41,666 INFO L495 AbstractCegarLoop]: Abstraction has 57 states and 64 transitions. [2022-04-28 10:59:41,666 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 16 states have (on average 2.0) internal successors, (32), 14 states have internal predecessors, (32), 11 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (11), 10 states have call predecessors, (11), 10 states have call successors, (11) [2022-04-28 10:59:41,666 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 57 states and 64 transitions. [2022-04-28 10:59:41,822 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 64 edges. 64 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:59:41,822 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 64 transitions. [2022-04-28 10:59:41,823 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2022-04-28 10:59:41,823 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:59:41,823 INFO L195 NwaCegarLoop]: trace histogram [11, 10, 10, 9, 9, 9, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:59:41,835 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-28 10:59:42,023 WARN L477 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-28 10:59:42,024 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:59:42,024 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:59:42,024 INFO L85 PathProgramCache]: Analyzing trace with hash 1196125760, now seen corresponding path program 15 times [2022-04-28 10:59:42,024 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:59:42,024 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1342735268] [2022-04-28 10:59:42,121 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:59:42,121 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:59:42,121 INFO L85 PathProgramCache]: Analyzing trace with hash 1196125760, now seen corresponding path program 16 times [2022-04-28 10:59:42,121 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:59:42,121 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1734121202] [2022-04-28 10:59:42,121 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:59:42,121 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:59:42,144 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 10:59:42,145 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [307453488] [2022-04-28 10:59:42,145 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 10:59:42,145 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:59:42,145 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:59:42,152 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-28 10:59:42,163 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-28 10:59:42,197 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 10:59:42,197 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:59:42,198 INFO L263 TraceCheckSpWp]: Trace formula consists of 152 conjuncts, 40 conjunts are in the unsatisfiable core [2022-04-28 10:59:42,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:59:42,215 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:59:42,690 INFO L272 TraceCheckUtils]: 0: Hoare triple {4458#true} call ULTIMATE.init(); {4458#true} is VALID [2022-04-28 10:59:42,690 INFO L290 TraceCheckUtils]: 1: Hoare triple {4458#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3); {4458#true} is VALID [2022-04-28 10:59:42,690 INFO L290 TraceCheckUtils]: 2: Hoare triple {4458#true} assume true; {4458#true} is VALID [2022-04-28 10:59:42,690 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4458#true} {4458#true} #60#return; {4458#true} is VALID [2022-04-28 10:59:42,690 INFO L272 TraceCheckUtils]: 4: Hoare triple {4458#true} call #t~ret5 := main(); {4458#true} is VALID [2022-04-28 10:59:42,690 INFO L290 TraceCheckUtils]: 5: Hoare triple {4458#true} havoc ~k~0;havoc ~y~0;havoc ~x~0;havoc ~c~0;assume -32768 <= #t~nondet4 && #t~nondet4 <= 32767;~k~0 := #t~nondet4;havoc #t~nondet4; {4458#true} is VALID [2022-04-28 10:59:42,690 INFO L272 TraceCheckUtils]: 6: Hoare triple {4458#true} call assume_abort_if_not((if ~k~0 <= 256 then 1 else 0)); {4458#true} is VALID [2022-04-28 10:59:42,690 INFO L290 TraceCheckUtils]: 7: Hoare triple {4458#true} ~cond := #in~cond; {4458#true} is VALID [2022-04-28 10:59:42,691 INFO L290 TraceCheckUtils]: 8: Hoare triple {4458#true} assume !(0 == ~cond); {4458#true} is VALID [2022-04-28 10:59:42,691 INFO L290 TraceCheckUtils]: 9: Hoare triple {4458#true} assume true; {4458#true} is VALID [2022-04-28 10:59:42,691 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {4458#true} {4458#true} #52#return; {4458#true} is VALID [2022-04-28 10:59:42,691 INFO L290 TraceCheckUtils]: 11: Hoare triple {4458#true} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {4496#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-28 10:59:42,691 INFO L290 TraceCheckUtils]: 12: Hoare triple {4496#(and (= main_~c~0 0) (= main_~y~0 0))} assume !false; {4496#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-28 10:59:42,692 INFO L272 TraceCheckUtils]: 13: Hoare triple {4496#(and (= main_~c~0 0) (= main_~y~0 0))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {4458#true} is VALID [2022-04-28 10:59:42,692 INFO L290 TraceCheckUtils]: 14: Hoare triple {4458#true} ~cond := #in~cond; {4458#true} is VALID [2022-04-28 10:59:42,692 INFO L290 TraceCheckUtils]: 15: Hoare triple {4458#true} assume !(0 == ~cond); {4458#true} is VALID [2022-04-28 10:59:42,692 INFO L290 TraceCheckUtils]: 16: Hoare triple {4458#true} assume true; {4458#true} is VALID [2022-04-28 10:59:42,692 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {4458#true} {4496#(and (= main_~c~0 0) (= main_~y~0 0))} #54#return; {4496#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-28 10:59:42,693 INFO L290 TraceCheckUtils]: 18: Hoare triple {4496#(and (= main_~c~0 0) (= main_~y~0 0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {4518#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} is VALID [2022-04-28 10:59:42,694 INFO L290 TraceCheckUtils]: 19: Hoare triple {4518#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} assume !false; {4518#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} is VALID [2022-04-28 10:59:42,694 INFO L272 TraceCheckUtils]: 20: Hoare triple {4518#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {4458#true} is VALID [2022-04-28 10:59:42,694 INFO L290 TraceCheckUtils]: 21: Hoare triple {4458#true} ~cond := #in~cond; {4458#true} is VALID [2022-04-28 10:59:42,695 INFO L290 TraceCheckUtils]: 22: Hoare triple {4458#true} assume !(0 == ~cond); {4458#true} is VALID [2022-04-28 10:59:42,695 INFO L290 TraceCheckUtils]: 23: Hoare triple {4458#true} assume true; {4458#true} is VALID [2022-04-28 10:59:42,698 INFO L284 TraceCheckUtils]: 24: Hoare quadruple {4458#true} {4518#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} #54#return; {4518#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} is VALID [2022-04-28 10:59:42,699 INFO L290 TraceCheckUtils]: 25: Hoare triple {4518#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {4540#(and (= main_~y~0 2) (= main_~c~0 2))} is VALID [2022-04-28 10:59:42,699 INFO L290 TraceCheckUtils]: 26: Hoare triple {4540#(and (= main_~y~0 2) (= main_~c~0 2))} assume !false; {4540#(and (= main_~y~0 2) (= main_~c~0 2))} is VALID [2022-04-28 10:59:42,699 INFO L272 TraceCheckUtils]: 27: Hoare triple {4540#(and (= main_~y~0 2) (= main_~c~0 2))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {4458#true} is VALID [2022-04-28 10:59:42,700 INFO L290 TraceCheckUtils]: 28: Hoare triple {4458#true} ~cond := #in~cond; {4458#true} is VALID [2022-04-28 10:59:42,700 INFO L290 TraceCheckUtils]: 29: Hoare triple {4458#true} assume !(0 == ~cond); {4458#true} is VALID [2022-04-28 10:59:42,700 INFO L290 TraceCheckUtils]: 30: Hoare triple {4458#true} assume true; {4458#true} is VALID [2022-04-28 10:59:42,700 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {4458#true} {4540#(and (= main_~y~0 2) (= main_~c~0 2))} #54#return; {4540#(and (= main_~y~0 2) (= main_~c~0 2))} is VALID [2022-04-28 10:59:42,701 INFO L290 TraceCheckUtils]: 32: Hoare triple {4540#(and (= main_~y~0 2) (= main_~c~0 2))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {4562#(and (= 2 (+ (- 1) main_~y~0)) (= main_~c~0 3))} is VALID [2022-04-28 10:59:42,701 INFO L290 TraceCheckUtils]: 33: Hoare triple {4562#(and (= 2 (+ (- 1) main_~y~0)) (= main_~c~0 3))} assume !false; {4562#(and (= 2 (+ (- 1) main_~y~0)) (= main_~c~0 3))} is VALID [2022-04-28 10:59:42,701 INFO L272 TraceCheckUtils]: 34: Hoare triple {4562#(and (= 2 (+ (- 1) main_~y~0)) (= main_~c~0 3))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {4458#true} is VALID [2022-04-28 10:59:42,701 INFO L290 TraceCheckUtils]: 35: Hoare triple {4458#true} ~cond := #in~cond; {4458#true} is VALID [2022-04-28 10:59:42,701 INFO L290 TraceCheckUtils]: 36: Hoare triple {4458#true} assume !(0 == ~cond); {4458#true} is VALID [2022-04-28 10:59:42,701 INFO L290 TraceCheckUtils]: 37: Hoare triple {4458#true} assume true; {4458#true} is VALID [2022-04-28 10:59:42,702 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {4458#true} {4562#(and (= 2 (+ (- 1) main_~y~0)) (= main_~c~0 3))} #54#return; {4562#(and (= 2 (+ (- 1) main_~y~0)) (= main_~c~0 3))} is VALID [2022-04-28 10:59:42,702 INFO L290 TraceCheckUtils]: 39: Hoare triple {4562#(and (= 2 (+ (- 1) main_~y~0)) (= main_~c~0 3))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {4584#(and (= (+ (- 1) main_~c~0) 3) (= (+ (- 2) main_~y~0) 2))} is VALID [2022-04-28 10:59:42,703 INFO L290 TraceCheckUtils]: 40: Hoare triple {4584#(and (= (+ (- 1) main_~c~0) 3) (= (+ (- 2) main_~y~0) 2))} assume !false; {4584#(and (= (+ (- 1) main_~c~0) 3) (= (+ (- 2) main_~y~0) 2))} is VALID [2022-04-28 10:59:42,703 INFO L272 TraceCheckUtils]: 41: Hoare triple {4584#(and (= (+ (- 1) main_~c~0) 3) (= (+ (- 2) main_~y~0) 2))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {4458#true} is VALID [2022-04-28 10:59:42,703 INFO L290 TraceCheckUtils]: 42: Hoare triple {4458#true} ~cond := #in~cond; {4458#true} is VALID [2022-04-28 10:59:42,703 INFO L290 TraceCheckUtils]: 43: Hoare triple {4458#true} assume !(0 == ~cond); {4458#true} is VALID [2022-04-28 10:59:42,703 INFO L290 TraceCheckUtils]: 44: Hoare triple {4458#true} assume true; {4458#true} is VALID [2022-04-28 10:59:42,704 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {4458#true} {4584#(and (= (+ (- 1) main_~c~0) 3) (= (+ (- 2) main_~y~0) 2))} #54#return; {4584#(and (= (+ (- 1) main_~c~0) 3) (= (+ (- 2) main_~y~0) 2))} is VALID [2022-04-28 10:59:42,704 INFO L290 TraceCheckUtils]: 46: Hoare triple {4584#(and (= (+ (- 1) main_~c~0) 3) (= (+ (- 2) main_~y~0) 2))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {4606#(and (= (+ main_~y~0 (- 3)) 2) (= 5 main_~c~0))} is VALID [2022-04-28 10:59:42,705 INFO L290 TraceCheckUtils]: 47: Hoare triple {4606#(and (= (+ main_~y~0 (- 3)) 2) (= 5 main_~c~0))} assume !false; {4606#(and (= (+ main_~y~0 (- 3)) 2) (= 5 main_~c~0))} is VALID [2022-04-28 10:59:42,705 INFO L272 TraceCheckUtils]: 48: Hoare triple {4606#(and (= (+ main_~y~0 (- 3)) 2) (= 5 main_~c~0))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {4458#true} is VALID [2022-04-28 10:59:42,705 INFO L290 TraceCheckUtils]: 49: Hoare triple {4458#true} ~cond := #in~cond; {4458#true} is VALID [2022-04-28 10:59:42,705 INFO L290 TraceCheckUtils]: 50: Hoare triple {4458#true} assume !(0 == ~cond); {4458#true} is VALID [2022-04-28 10:59:42,705 INFO L290 TraceCheckUtils]: 51: Hoare triple {4458#true} assume true; {4458#true} is VALID [2022-04-28 10:59:42,705 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {4458#true} {4606#(and (= (+ main_~y~0 (- 3)) 2) (= 5 main_~c~0))} #54#return; {4606#(and (= (+ main_~y~0 (- 3)) 2) (= 5 main_~c~0))} is VALID [2022-04-28 10:59:42,706 INFO L290 TraceCheckUtils]: 53: Hoare triple {4606#(and (= (+ main_~y~0 (- 3)) 2) (= 5 main_~c~0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {4628#(and (= (+ main_~y~0 (- 4)) 2) (= (+ (- 1) main_~c~0) 5))} is VALID [2022-04-28 10:59:42,706 INFO L290 TraceCheckUtils]: 54: Hoare triple {4628#(and (= (+ main_~y~0 (- 4)) 2) (= (+ (- 1) main_~c~0) 5))} assume !false; {4628#(and (= (+ main_~y~0 (- 4)) 2) (= (+ (- 1) main_~c~0) 5))} is VALID [2022-04-28 10:59:42,707 INFO L272 TraceCheckUtils]: 55: Hoare triple {4628#(and (= (+ main_~y~0 (- 4)) 2) (= (+ (- 1) main_~c~0) 5))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {4458#true} is VALID [2022-04-28 10:59:42,707 INFO L290 TraceCheckUtils]: 56: Hoare triple {4458#true} ~cond := #in~cond; {4458#true} is VALID [2022-04-28 10:59:42,707 INFO L290 TraceCheckUtils]: 57: Hoare triple {4458#true} assume !(0 == ~cond); {4458#true} is VALID [2022-04-28 10:59:42,707 INFO L290 TraceCheckUtils]: 58: Hoare triple {4458#true} assume true; {4458#true} is VALID [2022-04-28 10:59:42,707 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {4458#true} {4628#(and (= (+ main_~y~0 (- 4)) 2) (= (+ (- 1) main_~c~0) 5))} #54#return; {4628#(and (= (+ main_~y~0 (- 4)) 2) (= (+ (- 1) main_~c~0) 5))} is VALID [2022-04-28 10:59:42,708 INFO L290 TraceCheckUtils]: 60: Hoare triple {4628#(and (= (+ main_~y~0 (- 4)) 2) (= (+ (- 1) main_~c~0) 5))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {4650#(and (= 5 (+ (- 2) main_~c~0)) (= 2 (+ main_~y~0 (- 5))))} is VALID [2022-04-28 10:59:42,708 INFO L290 TraceCheckUtils]: 61: Hoare triple {4650#(and (= 5 (+ (- 2) main_~c~0)) (= 2 (+ main_~y~0 (- 5))))} assume !false; {4650#(and (= 5 (+ (- 2) main_~c~0)) (= 2 (+ main_~y~0 (- 5))))} is VALID [2022-04-28 10:59:42,708 INFO L272 TraceCheckUtils]: 62: Hoare triple {4650#(and (= 5 (+ (- 2) main_~c~0)) (= 2 (+ main_~y~0 (- 5))))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {4458#true} is VALID [2022-04-28 10:59:42,708 INFO L290 TraceCheckUtils]: 63: Hoare triple {4458#true} ~cond := #in~cond; {4458#true} is VALID [2022-04-28 10:59:42,708 INFO L290 TraceCheckUtils]: 64: Hoare triple {4458#true} assume !(0 == ~cond); {4458#true} is VALID [2022-04-28 10:59:42,709 INFO L290 TraceCheckUtils]: 65: Hoare triple {4458#true} assume true; {4458#true} is VALID [2022-04-28 10:59:42,709 INFO L284 TraceCheckUtils]: 66: Hoare quadruple {4458#true} {4650#(and (= 5 (+ (- 2) main_~c~0)) (= 2 (+ main_~y~0 (- 5))))} #54#return; {4650#(and (= 5 (+ (- 2) main_~c~0)) (= 2 (+ main_~y~0 (- 5))))} is VALID [2022-04-28 10:59:42,710 INFO L290 TraceCheckUtils]: 67: Hoare triple {4650#(and (= 5 (+ (- 2) main_~c~0)) (= 2 (+ main_~y~0 (- 5))))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {4672#(and (< 7 main_~k~0) (= main_~y~0 8) (<= main_~c~0 8))} is VALID [2022-04-28 10:59:42,710 INFO L290 TraceCheckUtils]: 68: Hoare triple {4672#(and (< 7 main_~k~0) (= main_~y~0 8) (<= main_~c~0 8))} assume !false; {4672#(and (< 7 main_~k~0) (= main_~y~0 8) (<= main_~c~0 8))} is VALID [2022-04-28 10:59:42,710 INFO L272 TraceCheckUtils]: 69: Hoare triple {4672#(and (< 7 main_~k~0) (= main_~y~0 8) (<= main_~c~0 8))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {4458#true} is VALID [2022-04-28 10:59:42,710 INFO L290 TraceCheckUtils]: 70: Hoare triple {4458#true} ~cond := #in~cond; {4458#true} is VALID [2022-04-28 10:59:42,710 INFO L290 TraceCheckUtils]: 71: Hoare triple {4458#true} assume !(0 == ~cond); {4458#true} is VALID [2022-04-28 10:59:42,710 INFO L290 TraceCheckUtils]: 72: Hoare triple {4458#true} assume true; {4458#true} is VALID [2022-04-28 10:59:42,711 INFO L284 TraceCheckUtils]: 73: Hoare quadruple {4458#true} {4672#(and (< 7 main_~k~0) (= main_~y~0 8) (<= main_~c~0 8))} #54#return; {4672#(and (< 7 main_~k~0) (= main_~y~0 8) (<= main_~c~0 8))} is VALID [2022-04-28 10:59:42,711 INFO L290 TraceCheckUtils]: 74: Hoare triple {4672#(and (< 7 main_~k~0) (= main_~y~0 8) (<= main_~c~0 8))} assume !(~c~0 < ~k~0); {4694#(and (< 7 main_~k~0) (= main_~y~0 8) (<= main_~k~0 8))} is VALID [2022-04-28 10:59:42,711 INFO L272 TraceCheckUtils]: 75: Hoare triple {4694#(and (< 7 main_~k~0) (= main_~y~0 8) (<= main_~k~0 8))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {4458#true} is VALID [2022-04-28 10:59:42,711 INFO L290 TraceCheckUtils]: 76: Hoare triple {4458#true} ~cond := #in~cond; {4458#true} is VALID [2022-04-28 10:59:42,712 INFO L290 TraceCheckUtils]: 77: Hoare triple {4458#true} assume !(0 == ~cond); {4458#true} is VALID [2022-04-28 10:59:42,712 INFO L290 TraceCheckUtils]: 78: Hoare triple {4458#true} assume true; {4458#true} is VALID [2022-04-28 10:59:42,712 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {4458#true} {4694#(and (< 7 main_~k~0) (= main_~y~0 8) (<= main_~k~0 8))} #56#return; {4694#(and (< 7 main_~k~0) (= main_~y~0 8) (<= main_~k~0 8))} is VALID [2022-04-28 10:59:42,713 INFO L272 TraceCheckUtils]: 80: Hoare triple {4694#(and (< 7 main_~k~0) (= main_~y~0 8) (<= main_~k~0 8))} call __VERIFIER_assert((if ~k~0 * ~y~0 == ~y~0 * ~y~0 then 1 else 0)); {4713#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 10:59:42,713 INFO L290 TraceCheckUtils]: 81: Hoare triple {4713#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {4717#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 10:59:42,713 INFO L290 TraceCheckUtils]: 82: Hoare triple {4717#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {4459#false} is VALID [2022-04-28 10:59:42,713 INFO L290 TraceCheckUtils]: 83: Hoare triple {4459#false} assume !false; {4459#false} is VALID [2022-04-28 10:59:42,714 INFO L134 CoverageAnalysis]: Checked inductivity of 308 backedges. 20 proven. 108 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2022-04-28 10:59:42,714 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:59:42,993 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:59:42,994 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1734121202] [2022-04-28 10:59:42,994 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 10:59:42,994 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [307453488] [2022-04-28 10:59:42,994 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [307453488] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 10:59:42,994 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-28 10:59:42,994 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2022-04-28 10:59:42,994 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:59:42,995 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1342735268] [2022-04-28 10:59:42,995 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1342735268] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:59:42,995 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:59:42,995 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-04-28 10:59:42,995 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1923283223] [2022-04-28 10:59:42,995 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:59:42,996 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 2.3846153846153846) internal successors, (31), 13 states have internal predecessors, (31), 11 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (12), 11 states have call predecessors, (12), 11 states have call successors, (12) Word has length 84 [2022-04-28 10:59:42,997 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:59:42,997 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 14 states, 13 states have (on average 2.3846153846153846) internal successors, (31), 13 states have internal predecessors, (31), 11 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (12), 11 states have call predecessors, (12), 11 states have call successors, (12) [2022-04-28 10:59:43,035 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 57 edges. 57 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:59:43,035 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-04-28 10:59:43,035 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:59:43,041 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-04-28 10:59:43,041 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=227, Unknown=0, NotChecked=0, Total=272 [2022-04-28 10:59:43,041 INFO L87 Difference]: Start difference. First operand 57 states and 64 transitions. Second operand has 14 states, 13 states have (on average 2.3846153846153846) internal successors, (31), 13 states have internal predecessors, (31), 11 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (12), 11 states have call predecessors, (12), 11 states have call successors, (12) [2022-04-28 10:59:43,950 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:59:43,950 INFO L93 Difference]: Finished difference Result 66 states and 75 transitions. [2022-04-28 10:59:43,950 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-04-28 10:59:43,950 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 2.3846153846153846) internal successors, (31), 13 states have internal predecessors, (31), 11 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (12), 11 states have call predecessors, (12), 11 states have call successors, (12) Word has length 84 [2022-04-28 10:59:43,951 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:59:43,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 13 states have (on average 2.3846153846153846) internal successors, (31), 13 states have internal predecessors, (31), 11 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (12), 11 states have call predecessors, (12), 11 states have call successors, (12) [2022-04-28 10:59:43,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 68 transitions. [2022-04-28 10:59:43,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 13 states have (on average 2.3846153846153846) internal successors, (31), 13 states have internal predecessors, (31), 11 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (12), 11 states have call predecessors, (12), 11 states have call successors, (12) [2022-04-28 10:59:43,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 68 transitions. [2022-04-28 10:59:43,956 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 14 states and 68 transitions. [2022-04-28 10:59:44,006 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 68 edges. 68 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:59:44,007 INFO L225 Difference]: With dead ends: 66 [2022-04-28 10:59:44,007 INFO L226 Difference]: Without dead ends: 60 [2022-04-28 10:59:44,008 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 85 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-28 10:59:44,008 INFO L413 NwaCegarLoop]: 49 mSDtfsCounter, 2 mSDsluCounter, 321 mSDsCounter, 0 mSdLazyCounter, 379 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 370 SdHoareTripleChecker+Invalid, 380 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 379 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-04-28 10:59:44,008 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 370 Invalid, 380 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 379 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-04-28 10:59:44,008 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2022-04-28 10:59:44,047 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 60. [2022-04-28 10:59:44,047 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:59:44,048 INFO L82 GeneralOperation]: Start isEquivalent. First operand 60 states. Second operand has 60 states, 39 states have (on average 1.0256410256410255) internal successors, (40), 39 states have internal predecessors, (40), 15 states have call successors, (15), 7 states have call predecessors, (15), 5 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2022-04-28 10:59:44,048 INFO L74 IsIncluded]: Start isIncluded. First operand 60 states. Second operand has 60 states, 39 states have (on average 1.0256410256410255) internal successors, (40), 39 states have internal predecessors, (40), 15 states have call successors, (15), 7 states have call predecessors, (15), 5 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2022-04-28 10:59:44,048 INFO L87 Difference]: Start difference. First operand 60 states. Second operand has 60 states, 39 states have (on average 1.0256410256410255) internal successors, (40), 39 states have internal predecessors, (40), 15 states have call successors, (15), 7 states have call predecessors, (15), 5 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2022-04-28 10:59:44,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:59:44,049 INFO L93 Difference]: Finished difference Result 60 states and 68 transitions. [2022-04-28 10:59:44,049 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 68 transitions. [2022-04-28 10:59:44,050 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:59:44,050 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:59:44,050 INFO L74 IsIncluded]: Start isIncluded. First operand has 60 states, 39 states have (on average 1.0256410256410255) internal successors, (40), 39 states have internal predecessors, (40), 15 states have call successors, (15), 7 states have call predecessors, (15), 5 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) Second operand 60 states. [2022-04-28 10:59:44,050 INFO L87 Difference]: Start difference. First operand has 60 states, 39 states have (on average 1.0256410256410255) internal successors, (40), 39 states have internal predecessors, (40), 15 states have call successors, (15), 7 states have call predecessors, (15), 5 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) Second operand 60 states. [2022-04-28 10:59:44,051 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:59:44,051 INFO L93 Difference]: Finished difference Result 60 states and 68 transitions. [2022-04-28 10:59:44,051 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 68 transitions. [2022-04-28 10:59:44,051 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:59:44,051 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:59:44,051 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:59:44,051 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:59:44,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 39 states have (on average 1.0256410256410255) internal successors, (40), 39 states have internal predecessors, (40), 15 states have call successors, (15), 7 states have call predecessors, (15), 5 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2022-04-28 10:59:44,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 68 transitions. [2022-04-28 10:59:44,053 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 68 transitions. Word has length 84 [2022-04-28 10:59:44,053 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:59:44,053 INFO L495 AbstractCegarLoop]: Abstraction has 60 states and 68 transitions. [2022-04-28 10:59:44,053 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 2.3846153846153846) internal successors, (31), 13 states have internal predecessors, (31), 11 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (12), 11 states have call predecessors, (12), 11 states have call successors, (12) [2022-04-28 10:59:44,053 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 60 states and 68 transitions. [2022-04-28 10:59:44,277 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 68 edges. 68 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:59:44,277 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 68 transitions. [2022-04-28 10:59:44,278 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2022-04-28 10:59:44,278 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:59:44,278 INFO L195 NwaCegarLoop]: trace histogram [12, 11, 11, 10, 10, 10, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:59:44,294 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-04-28 10:59:44,478 WARN L477 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-28 10:59:44,478 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:59:44,479 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:59:44,479 INFO L85 PathProgramCache]: Analyzing trace with hash -94164991, now seen corresponding path program 17 times [2022-04-28 10:59:44,479 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:59:44,479 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1646401893] [2022-04-28 10:59:44,573 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:59:44,573 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:59:44,573 INFO L85 PathProgramCache]: Analyzing trace with hash -94164991, now seen corresponding path program 18 times [2022-04-28 10:59:44,573 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:59:44,573 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1309982970] [2022-04-28 10:59:44,573 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:59:44,573 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:59:44,583 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 10:59:44,583 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [201931526] [2022-04-28 10:59:44,583 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-28 10:59:44,583 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:59:44,583 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:59:44,584 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-28 10:59:44,585 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-04-28 10:59:45,174 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 10 check-sat command(s) [2022-04-28 10:59:45,175 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:59:45,177 INFO L263 TraceCheckSpWp]: Trace formula consists of 240 conjuncts, 55 conjunts are in the unsatisfiable core [2022-04-28 10:59:45,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:59:45,192 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:59:45,762 INFO L272 TraceCheckUtils]: 0: Hoare triple {5156#true} call ULTIMATE.init(); {5156#true} is VALID [2022-04-28 10:59:45,763 INFO L290 TraceCheckUtils]: 1: Hoare triple {5156#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3); {5156#true} is VALID [2022-04-28 10:59:45,763 INFO L290 TraceCheckUtils]: 2: Hoare triple {5156#true} assume true; {5156#true} is VALID [2022-04-28 10:59:45,763 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5156#true} {5156#true} #60#return; {5156#true} is VALID [2022-04-28 10:59:45,763 INFO L272 TraceCheckUtils]: 4: Hoare triple {5156#true} call #t~ret5 := main(); {5156#true} is VALID [2022-04-28 10:59:45,763 INFO L290 TraceCheckUtils]: 5: Hoare triple {5156#true} havoc ~k~0;havoc ~y~0;havoc ~x~0;havoc ~c~0;assume -32768 <= #t~nondet4 && #t~nondet4 <= 32767;~k~0 := #t~nondet4;havoc #t~nondet4; {5156#true} is VALID [2022-04-28 10:59:45,763 INFO L272 TraceCheckUtils]: 6: Hoare triple {5156#true} call assume_abort_if_not((if ~k~0 <= 256 then 1 else 0)); {5156#true} is VALID [2022-04-28 10:59:45,763 INFO L290 TraceCheckUtils]: 7: Hoare triple {5156#true} ~cond := #in~cond; {5156#true} is VALID [2022-04-28 10:59:45,763 INFO L290 TraceCheckUtils]: 8: Hoare triple {5156#true} assume !(0 == ~cond); {5156#true} is VALID [2022-04-28 10:59:45,763 INFO L290 TraceCheckUtils]: 9: Hoare triple {5156#true} assume true; {5156#true} is VALID [2022-04-28 10:59:45,763 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {5156#true} {5156#true} #52#return; {5156#true} is VALID [2022-04-28 10:59:45,764 INFO L290 TraceCheckUtils]: 11: Hoare triple {5156#true} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {5194#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-28 10:59:45,764 INFO L290 TraceCheckUtils]: 12: Hoare triple {5194#(and (= main_~c~0 0) (= main_~y~0 0))} assume !false; {5194#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-28 10:59:45,764 INFO L272 TraceCheckUtils]: 13: Hoare triple {5194#(and (= main_~c~0 0) (= main_~y~0 0))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {5156#true} is VALID [2022-04-28 10:59:45,764 INFO L290 TraceCheckUtils]: 14: Hoare triple {5156#true} ~cond := #in~cond; {5156#true} is VALID [2022-04-28 10:59:45,765 INFO L290 TraceCheckUtils]: 15: Hoare triple {5156#true} assume !(0 == ~cond); {5156#true} is VALID [2022-04-28 10:59:45,765 INFO L290 TraceCheckUtils]: 16: Hoare triple {5156#true} assume true; {5156#true} is VALID [2022-04-28 10:59:45,765 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {5156#true} {5194#(and (= main_~c~0 0) (= main_~y~0 0))} #54#return; {5194#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-28 10:59:45,766 INFO L290 TraceCheckUtils]: 18: Hoare triple {5194#(and (= main_~c~0 0) (= main_~y~0 0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {5216#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} is VALID [2022-04-28 10:59:45,766 INFO L290 TraceCheckUtils]: 19: Hoare triple {5216#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} assume !false; {5216#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} is VALID [2022-04-28 10:59:45,766 INFO L272 TraceCheckUtils]: 20: Hoare triple {5216#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {5156#true} is VALID [2022-04-28 10:59:45,766 INFO L290 TraceCheckUtils]: 21: Hoare triple {5156#true} ~cond := #in~cond; {5156#true} is VALID [2022-04-28 10:59:45,766 INFO L290 TraceCheckUtils]: 22: Hoare triple {5156#true} assume !(0 == ~cond); {5156#true} is VALID [2022-04-28 10:59:45,766 INFO L290 TraceCheckUtils]: 23: Hoare triple {5156#true} assume true; {5156#true} is VALID [2022-04-28 10:59:45,767 INFO L284 TraceCheckUtils]: 24: Hoare quadruple {5156#true} {5216#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} #54#return; {5216#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} is VALID [2022-04-28 10:59:45,767 INFO L290 TraceCheckUtils]: 25: Hoare triple {5216#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {5238#(and (= main_~y~0 2) (= main_~c~0 2))} is VALID [2022-04-28 10:59:45,768 INFO L290 TraceCheckUtils]: 26: Hoare triple {5238#(and (= main_~y~0 2) (= main_~c~0 2))} assume !false; {5238#(and (= main_~y~0 2) (= main_~c~0 2))} is VALID [2022-04-28 10:59:45,768 INFO L272 TraceCheckUtils]: 27: Hoare triple {5238#(and (= main_~y~0 2) (= main_~c~0 2))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {5156#true} is VALID [2022-04-28 10:59:45,768 INFO L290 TraceCheckUtils]: 28: Hoare triple {5156#true} ~cond := #in~cond; {5156#true} is VALID [2022-04-28 10:59:45,768 INFO L290 TraceCheckUtils]: 29: Hoare triple {5156#true} assume !(0 == ~cond); {5156#true} is VALID [2022-04-28 10:59:45,768 INFO L290 TraceCheckUtils]: 30: Hoare triple {5156#true} assume true; {5156#true} is VALID [2022-04-28 10:59:45,768 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {5156#true} {5238#(and (= main_~y~0 2) (= main_~c~0 2))} #54#return; {5238#(and (= main_~y~0 2) (= main_~c~0 2))} is VALID [2022-04-28 10:59:45,769 INFO L290 TraceCheckUtils]: 32: Hoare triple {5238#(and (= main_~y~0 2) (= main_~c~0 2))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {5260#(and (= 2 (+ (- 1) main_~y~0)) (= (+ (- 1) main_~c~0) 2))} is VALID [2022-04-28 10:59:45,769 INFO L290 TraceCheckUtils]: 33: Hoare triple {5260#(and (= 2 (+ (- 1) main_~y~0)) (= (+ (- 1) main_~c~0) 2))} assume !false; {5260#(and (= 2 (+ (- 1) main_~y~0)) (= (+ (- 1) main_~c~0) 2))} is VALID [2022-04-28 10:59:45,769 INFO L272 TraceCheckUtils]: 34: Hoare triple {5260#(and (= 2 (+ (- 1) main_~y~0)) (= (+ (- 1) main_~c~0) 2))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {5156#true} is VALID [2022-04-28 10:59:45,769 INFO L290 TraceCheckUtils]: 35: Hoare triple {5156#true} ~cond := #in~cond; {5156#true} is VALID [2022-04-28 10:59:45,769 INFO L290 TraceCheckUtils]: 36: Hoare triple {5156#true} assume !(0 == ~cond); {5156#true} is VALID [2022-04-28 10:59:45,769 INFO L290 TraceCheckUtils]: 37: Hoare triple {5156#true} assume true; {5156#true} is VALID [2022-04-28 10:59:45,770 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {5156#true} {5260#(and (= 2 (+ (- 1) main_~y~0)) (= (+ (- 1) main_~c~0) 2))} #54#return; {5260#(and (= 2 (+ (- 1) main_~y~0)) (= (+ (- 1) main_~c~0) 2))} is VALID [2022-04-28 10:59:45,770 INFO L290 TraceCheckUtils]: 39: Hoare triple {5260#(and (= 2 (+ (- 1) main_~y~0)) (= (+ (- 1) main_~c~0) 2))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {5282#(and (= main_~y~0 4) (= main_~c~0 4))} is VALID [2022-04-28 10:59:45,771 INFO L290 TraceCheckUtils]: 40: Hoare triple {5282#(and (= main_~y~0 4) (= main_~c~0 4))} assume !false; {5282#(and (= main_~y~0 4) (= main_~c~0 4))} is VALID [2022-04-28 10:59:45,771 INFO L272 TraceCheckUtils]: 41: Hoare triple {5282#(and (= main_~y~0 4) (= main_~c~0 4))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {5156#true} is VALID [2022-04-28 10:59:45,771 INFO L290 TraceCheckUtils]: 42: Hoare triple {5156#true} ~cond := #in~cond; {5156#true} is VALID [2022-04-28 10:59:45,771 INFO L290 TraceCheckUtils]: 43: Hoare triple {5156#true} assume !(0 == ~cond); {5156#true} is VALID [2022-04-28 10:59:45,771 INFO L290 TraceCheckUtils]: 44: Hoare triple {5156#true} assume true; {5156#true} is VALID [2022-04-28 10:59:45,771 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {5156#true} {5282#(and (= main_~y~0 4) (= main_~c~0 4))} #54#return; {5282#(and (= main_~y~0 4) (= main_~c~0 4))} is VALID [2022-04-28 10:59:45,772 INFO L290 TraceCheckUtils]: 46: Hoare triple {5282#(and (= main_~y~0 4) (= main_~c~0 4))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {5304#(and (= (+ (- 1) main_~y~0) 4) (= (+ (- 1) main_~c~0) 4))} is VALID [2022-04-28 10:59:45,772 INFO L290 TraceCheckUtils]: 47: Hoare triple {5304#(and (= (+ (- 1) main_~y~0) 4) (= (+ (- 1) main_~c~0) 4))} assume !false; {5304#(and (= (+ (- 1) main_~y~0) 4) (= (+ (- 1) main_~c~0) 4))} is VALID [2022-04-28 10:59:45,772 INFO L272 TraceCheckUtils]: 48: Hoare triple {5304#(and (= (+ (- 1) main_~y~0) 4) (= (+ (- 1) main_~c~0) 4))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {5156#true} is VALID [2022-04-28 10:59:45,772 INFO L290 TraceCheckUtils]: 49: Hoare triple {5156#true} ~cond := #in~cond; {5156#true} is VALID [2022-04-28 10:59:45,772 INFO L290 TraceCheckUtils]: 50: Hoare triple {5156#true} assume !(0 == ~cond); {5156#true} is VALID [2022-04-28 10:59:45,772 INFO L290 TraceCheckUtils]: 51: Hoare triple {5156#true} assume true; {5156#true} is VALID [2022-04-28 10:59:45,773 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {5156#true} {5304#(and (= (+ (- 1) main_~y~0) 4) (= (+ (- 1) main_~c~0) 4))} #54#return; {5304#(and (= (+ (- 1) main_~y~0) 4) (= (+ (- 1) main_~c~0) 4))} is VALID [2022-04-28 10:59:45,773 INFO L290 TraceCheckUtils]: 53: Hoare triple {5304#(and (= (+ (- 1) main_~y~0) 4) (= (+ (- 1) main_~c~0) 4))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {5326#(and (= main_~y~0 6) (= 4 (+ (- 2) main_~c~0)))} is VALID [2022-04-28 10:59:45,774 INFO L290 TraceCheckUtils]: 54: Hoare triple {5326#(and (= main_~y~0 6) (= 4 (+ (- 2) main_~c~0)))} assume !false; {5326#(and (= main_~y~0 6) (= 4 (+ (- 2) main_~c~0)))} is VALID [2022-04-28 10:59:45,774 INFO L272 TraceCheckUtils]: 55: Hoare triple {5326#(and (= main_~y~0 6) (= 4 (+ (- 2) main_~c~0)))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {5156#true} is VALID [2022-04-28 10:59:45,774 INFO L290 TraceCheckUtils]: 56: Hoare triple {5156#true} ~cond := #in~cond; {5156#true} is VALID [2022-04-28 10:59:45,774 INFO L290 TraceCheckUtils]: 57: Hoare triple {5156#true} assume !(0 == ~cond); {5156#true} is VALID [2022-04-28 10:59:45,774 INFO L290 TraceCheckUtils]: 58: Hoare triple {5156#true} assume true; {5156#true} is VALID [2022-04-28 10:59:45,774 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {5156#true} {5326#(and (= main_~y~0 6) (= 4 (+ (- 2) main_~c~0)))} #54#return; {5326#(and (= main_~y~0 6) (= 4 (+ (- 2) main_~c~0)))} is VALID [2022-04-28 10:59:45,775 INFO L290 TraceCheckUtils]: 60: Hoare triple {5326#(and (= main_~y~0 6) (= 4 (+ (- 2) main_~c~0)))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {5348#(and (= 7 main_~c~0) (= 6 (+ (- 1) main_~y~0)))} is VALID [2022-04-28 10:59:45,775 INFO L290 TraceCheckUtils]: 61: Hoare triple {5348#(and (= 7 main_~c~0) (= 6 (+ (- 1) main_~y~0)))} assume !false; {5348#(and (= 7 main_~c~0) (= 6 (+ (- 1) main_~y~0)))} is VALID [2022-04-28 10:59:45,775 INFO L272 TraceCheckUtils]: 62: Hoare triple {5348#(and (= 7 main_~c~0) (= 6 (+ (- 1) main_~y~0)))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {5156#true} is VALID [2022-04-28 10:59:45,775 INFO L290 TraceCheckUtils]: 63: Hoare triple {5156#true} ~cond := #in~cond; {5156#true} is VALID [2022-04-28 10:59:45,775 INFO L290 TraceCheckUtils]: 64: Hoare triple {5156#true} assume !(0 == ~cond); {5156#true} is VALID [2022-04-28 10:59:45,775 INFO L290 TraceCheckUtils]: 65: Hoare triple {5156#true} assume true; {5156#true} is VALID [2022-04-28 10:59:45,776 INFO L284 TraceCheckUtils]: 66: Hoare quadruple {5156#true} {5348#(and (= 7 main_~c~0) (= 6 (+ (- 1) main_~y~0)))} #54#return; {5348#(and (= 7 main_~c~0) (= 6 (+ (- 1) main_~y~0)))} is VALID [2022-04-28 10:59:45,776 INFO L290 TraceCheckUtils]: 67: Hoare triple {5348#(and (= 7 main_~c~0) (= 6 (+ (- 1) main_~y~0)))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {5370#(and (= (+ (- 2) main_~y~0) 6) (= main_~c~0 8))} is VALID [2022-04-28 10:59:45,777 INFO L290 TraceCheckUtils]: 68: Hoare triple {5370#(and (= (+ (- 2) main_~y~0) 6) (= main_~c~0 8))} assume !false; {5370#(and (= (+ (- 2) main_~y~0) 6) (= main_~c~0 8))} is VALID [2022-04-28 10:59:45,777 INFO L272 TraceCheckUtils]: 69: Hoare triple {5370#(and (= (+ (- 2) main_~y~0) 6) (= main_~c~0 8))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {5156#true} is VALID [2022-04-28 10:59:45,777 INFO L290 TraceCheckUtils]: 70: Hoare triple {5156#true} ~cond := #in~cond; {5380#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-28 10:59:45,777 INFO L290 TraceCheckUtils]: 71: Hoare triple {5380#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {5384#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 10:59:45,778 INFO L290 TraceCheckUtils]: 72: Hoare triple {5384#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {5384#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 10:59:45,778 INFO L284 TraceCheckUtils]: 73: Hoare quadruple {5384#(not (= |__VERIFIER_assert_#in~cond| 0))} {5370#(and (= (+ (- 2) main_~y~0) 6) (= main_~c~0 8))} #54#return; {5391#(and (= (+ (- 2) main_~y~0) 6) (= main_~c~0 8) (= (+ (* 2 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (* 6 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (* 5 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0))) (+ (* main_~x~0 12) (* main_~y~0 main_~y~0))))} is VALID [2022-04-28 10:59:45,779 INFO L290 TraceCheckUtils]: 74: Hoare triple {5391#(and (= (+ (- 2) main_~y~0) 6) (= main_~c~0 8) (= (+ (* 2 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (* 6 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (* 5 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0))) (+ (* main_~x~0 12) (* main_~y~0 main_~y~0))))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {5395#(and (<= (+ (div (+ (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 (- 5)) (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0 6) (* (- 2) main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0) (* main_~y~0 main_~y~0)) (- 12)) (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) main_~x~0) (= main_~y~0 9) (< 8 main_~k~0) (<= main_~c~0 9))} is VALID [2022-04-28 10:59:45,780 INFO L290 TraceCheckUtils]: 75: Hoare triple {5395#(and (<= (+ (div (+ (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 (- 5)) (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0 6) (* (- 2) main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0) (* main_~y~0 main_~y~0)) (- 12)) (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) main_~x~0) (= main_~y~0 9) (< 8 main_~k~0) (<= main_~c~0 9))} assume !false; {5395#(and (<= (+ (div (+ (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 (- 5)) (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0 6) (* (- 2) main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0) (* main_~y~0 main_~y~0)) (- 12)) (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) main_~x~0) (= main_~y~0 9) (< 8 main_~k~0) (<= main_~c~0 9))} is VALID [2022-04-28 10:59:45,780 INFO L272 TraceCheckUtils]: 76: Hoare triple {5395#(and (<= (+ (div (+ (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 (- 5)) (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0 6) (* (- 2) main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0) (* main_~y~0 main_~y~0)) (- 12)) (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) main_~x~0) (= main_~y~0 9) (< 8 main_~k~0) (<= main_~c~0 9))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {5156#true} is VALID [2022-04-28 10:59:45,780 INFO L290 TraceCheckUtils]: 77: Hoare triple {5156#true} ~cond := #in~cond; {5380#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-28 10:59:45,780 INFO L290 TraceCheckUtils]: 78: Hoare triple {5380#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {5384#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 10:59:45,781 INFO L290 TraceCheckUtils]: 79: Hoare triple {5384#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {5384#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 10:59:45,781 INFO L284 TraceCheckUtils]: 80: Hoare quadruple {5384#(not (= |__VERIFIER_assert_#in~cond| 0))} {5395#(and (<= (+ (div (+ (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 (- 5)) (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0 6) (* (- 2) main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0) (* main_~y~0 main_~y~0)) (- 12)) (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) main_~x~0) (= main_~y~0 9) (< 8 main_~k~0) (<= main_~c~0 9))} #54#return; {5414#(and (= main_~y~0 9) (< 8 main_~k~0) (<= main_~c~0 9))} is VALID [2022-04-28 10:59:45,782 INFO L290 TraceCheckUtils]: 81: Hoare triple {5414#(and (= main_~y~0 9) (< 8 main_~k~0) (<= main_~c~0 9))} assume !(~c~0 < ~k~0); {5418#(and (= main_~y~0 9) (<= main_~k~0 9) (< 8 main_~k~0))} is VALID [2022-04-28 10:59:45,782 INFO L272 TraceCheckUtils]: 82: Hoare triple {5418#(and (= main_~y~0 9) (<= main_~k~0 9) (< 8 main_~k~0))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {5156#true} is VALID [2022-04-28 10:59:45,782 INFO L290 TraceCheckUtils]: 83: Hoare triple {5156#true} ~cond := #in~cond; {5156#true} is VALID [2022-04-28 10:59:45,782 INFO L290 TraceCheckUtils]: 84: Hoare triple {5156#true} assume !(0 == ~cond); {5156#true} is VALID [2022-04-28 10:59:45,782 INFO L290 TraceCheckUtils]: 85: Hoare triple {5156#true} assume true; {5156#true} is VALID [2022-04-28 10:59:45,787 INFO L284 TraceCheckUtils]: 86: Hoare quadruple {5156#true} {5418#(and (= main_~y~0 9) (<= main_~k~0 9) (< 8 main_~k~0))} #56#return; {5418#(and (= main_~y~0 9) (<= main_~k~0 9) (< 8 main_~k~0))} is VALID [2022-04-28 10:59:45,788 INFO L272 TraceCheckUtils]: 87: Hoare triple {5418#(and (= main_~y~0 9) (<= main_~k~0 9) (< 8 main_~k~0))} call __VERIFIER_assert((if ~k~0 * ~y~0 == ~y~0 * ~y~0 then 1 else 0)); {5437#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 10:59:45,788 INFO L290 TraceCheckUtils]: 88: Hoare triple {5437#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {5441#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 10:59:45,789 INFO L290 TraceCheckUtils]: 89: Hoare triple {5441#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {5157#false} is VALID [2022-04-28 10:59:45,789 INFO L290 TraceCheckUtils]: 90: Hoare triple {5157#false} assume !false; {5157#false} is VALID [2022-04-28 10:59:45,789 INFO L134 CoverageAnalysis]: Checked inductivity of 377 backedges. 68 proven. 143 refuted. 0 times theorem prover too weak. 166 trivial. 0 not checked. [2022-04-28 10:59:45,789 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 11:00:04,238 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (* (- 18) c_main_~y~0 c_main_~y~0 c_main_~y~0 c_main_~y~0 c_main_~y~0)) (.cse1 (* (- 2) c_main_~y~0 c_main_~y~0 c_main_~y~0 c_main_~y~0 c_main_~y~0 c_main_~y~0)) (.cse2 (* (- 119) c_main_~y~0 c_main_~y~0)) (.cse3 (* (- 65) c_main_~y~0 c_main_~y~0 c_main_~y~0 c_main_~y~0))) (or (not (= (mod (+ .cse0 .cse1 .cse2 (* (- 120) c_main_~y~0 c_main_~y~0 c_main_~y~0) .cse3) 12) 0)) (forall ((main_~k~0 Int)) (or (< (+ c_main_~c~0 1) main_~k~0) (not (< c_main_~c~0 main_~k~0)) (let ((.cse4 (+ c_main_~y~0 1))) (= (* .cse4 .cse4) (* main_~k~0 .cse4))))) (not (<= (+ (* 10 (* c_main_~y~0 c_main_~y~0)) (* 5 (* c_main_~y~0 c_main_~y~0 c_main_~y~0 c_main_~y~0)) (* c_main_~y~0 c_main_~y~0 c_main_~y~0 c_main_~y~0 c_main_~y~0) c_main_~x~0 1) (div (+ .cse0 .cse1 .cse2 (- 12) .cse3) (- 12)))))) is different from false [2022-04-28 11:00:08,473 WARN L833 $PredicateComparison]: unable to prove that (or (not (= (mod (+ (* (- 2) c_main_~y~0 c_main_~y~0 c_main_~y~0 c_main_~y~0 c_main_~y~0 c_main_~y~0) (* (- 5) c_main_~y~0 c_main_~y~0 c_main_~y~0 c_main_~y~0) (* (- 6) c_main_~y~0 c_main_~y~0 c_main_~y~0 c_main_~y~0 c_main_~y~0) (* c_main_~y~0 c_main_~y~0)) 12) 0)) (forall ((main_~k~0 Int)) (or (< (+ c_main_~c~0 1) main_~k~0) (not (< c_main_~c~0 main_~k~0)) (let ((.cse0 (+ c_main_~y~0 1))) (= (* .cse0 .cse0) (* main_~k~0 .cse0)))))) is different from false [2022-04-28 11:00:08,476 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 11:00:08,476 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1309982970] [2022-04-28 11:00:08,476 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 11:00:08,476 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [201931526] [2022-04-28 11:00:08,476 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [201931526] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 11:00:08,476 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-28 11:00:08,476 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2022-04-28 11:00:08,476 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 11:00:08,476 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1646401893] [2022-04-28 11:00:08,476 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1646401893] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 11:00:08,476 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 11:00:08,477 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2022-04-28 11:00:08,477 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1567735332] [2022-04-28 11:00:08,477 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 11:00:08,477 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 18 states have (on average 2.0) internal successors, (36), 16 states have internal predecessors, (36), 12 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (13), 12 states have call predecessors, (13), 12 states have call successors, (13) Word has length 91 [2022-04-28 11:00:08,477 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 11:00:08,477 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 19 states, 18 states have (on average 2.0) internal successors, (36), 16 states have internal predecessors, (36), 12 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (13), 12 states have call predecessors, (13), 12 states have call successors, (13) [2022-04-28 11:00:08,546 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 64 edges. 64 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 11:00:08,547 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-04-28 11:00:08,547 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 11:00:08,547 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-04-28 11:00:08,547 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=446, Unknown=2, NotChecked=86, Total=600 [2022-04-28 11:00:08,548 INFO L87 Difference]: Start difference. First operand 60 states and 68 transitions. Second operand has 19 states, 18 states have (on average 2.0) internal successors, (36), 16 states have internal predecessors, (36), 12 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (13), 12 states have call predecessors, (13), 12 states have call successors, (13) [2022-04-28 11:00:10,296 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:00:10,296 INFO L93 Difference]: Finished difference Result 69 states and 79 transitions. [2022-04-28 11:00:10,296 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-04-28 11:00:10,296 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 18 states have (on average 2.0) internal successors, (36), 16 states have internal predecessors, (36), 12 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (13), 12 states have call predecessors, (13), 12 states have call successors, (13) Word has length 91 [2022-04-28 11:00:10,296 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 11:00:10,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 18 states have (on average 2.0) internal successors, (36), 16 states have internal predecessors, (36), 12 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (13), 12 states have call predecessors, (13), 12 states have call successors, (13) [2022-04-28 11:00:10,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 72 transitions. [2022-04-28 11:00:10,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 18 states have (on average 2.0) internal successors, (36), 16 states have internal predecessors, (36), 12 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (13), 12 states have call predecessors, (13), 12 states have call successors, (13) [2022-04-28 11:00:10,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 72 transitions. [2022-04-28 11:00:10,299 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 18 states and 72 transitions. [2022-04-28 11:00:10,359 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 72 edges. 72 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 11:00:10,360 INFO L225 Difference]: With dead ends: 69 [2022-04-28 11:00:10,360 INFO L226 Difference]: Without dead ends: 63 [2022-04-28 11:00:10,360 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 84 SyntacticMatches, 1 SemanticMatches, 26 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 4.3s TimeCoverageRelationStatistics Valid=87, Invalid=569, Unknown=2, NotChecked=98, Total=756 [2022-04-28 11:00:10,361 INFO L413 NwaCegarLoop]: 37 mSDtfsCounter, 7 mSDsluCounter, 378 mSDsCounter, 0 mSdLazyCounter, 689 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 415 SdHoareTripleChecker+Invalid, 692 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 689 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-04-28 11:00:10,361 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 415 Invalid, 692 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 689 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-04-28 11:00:10,361 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2022-04-28 11:00:10,409 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2022-04-28 11:00:10,409 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 11:00:10,410 INFO L82 GeneralOperation]: Start isEquivalent. First operand 63 states. Second operand has 63 states, 41 states have (on average 1.024390243902439) internal successors, (42), 41 states have internal predecessors, (42), 16 states have call successors, (16), 7 states have call predecessors, (16), 5 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2022-04-28 11:00:10,410 INFO L74 IsIncluded]: Start isIncluded. First operand 63 states. Second operand has 63 states, 41 states have (on average 1.024390243902439) internal successors, (42), 41 states have internal predecessors, (42), 16 states have call successors, (16), 7 states have call predecessors, (16), 5 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2022-04-28 11:00:10,410 INFO L87 Difference]: Start difference. First operand 63 states. Second operand has 63 states, 41 states have (on average 1.024390243902439) internal successors, (42), 41 states have internal predecessors, (42), 16 states have call successors, (16), 7 states have call predecessors, (16), 5 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2022-04-28 11:00:10,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:00:10,412 INFO L93 Difference]: Finished difference Result 63 states and 72 transitions. [2022-04-28 11:00:10,412 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 72 transitions. [2022-04-28 11:00:10,412 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 11:00:10,412 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 11:00:10,412 INFO L74 IsIncluded]: Start isIncluded. First operand has 63 states, 41 states have (on average 1.024390243902439) internal successors, (42), 41 states have internal predecessors, (42), 16 states have call successors, (16), 7 states have call predecessors, (16), 5 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) Second operand 63 states. [2022-04-28 11:00:10,413 INFO L87 Difference]: Start difference. First operand has 63 states, 41 states have (on average 1.024390243902439) internal successors, (42), 41 states have internal predecessors, (42), 16 states have call successors, (16), 7 states have call predecessors, (16), 5 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) Second operand 63 states. [2022-04-28 11:00:10,414 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:00:10,414 INFO L93 Difference]: Finished difference Result 63 states and 72 transitions. [2022-04-28 11:00:10,414 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 72 transitions. [2022-04-28 11:00:10,414 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 11:00:10,414 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 11:00:10,414 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 11:00:10,414 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 11:00:10,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 41 states have (on average 1.024390243902439) internal successors, (42), 41 states have internal predecessors, (42), 16 states have call successors, (16), 7 states have call predecessors, (16), 5 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2022-04-28 11:00:10,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 72 transitions. [2022-04-28 11:00:10,416 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 72 transitions. Word has length 91 [2022-04-28 11:00:10,416 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 11:00:10,416 INFO L495 AbstractCegarLoop]: Abstraction has 63 states and 72 transitions. [2022-04-28 11:00:10,416 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 18 states have (on average 2.0) internal successors, (36), 16 states have internal predecessors, (36), 12 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (13), 12 states have call predecessors, (13), 12 states have call successors, (13) [2022-04-28 11:00:10,416 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 63 states and 72 transitions. [2022-04-28 11:00:10,619 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 72 edges. 72 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 11:00:10,619 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 72 transitions. [2022-04-28 11:00:10,623 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2022-04-28 11:00:10,623 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 11:00:10,623 INFO L195 NwaCegarLoop]: trace histogram [13, 12, 12, 11, 11, 11, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 11:00:10,628 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2022-04-28 11:00:10,830 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2022-04-28 11:00:10,830 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 11:00:10,831 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 11:00:10,831 INFO L85 PathProgramCache]: Analyzing trace with hash -107207904, now seen corresponding path program 19 times [2022-04-28 11:00:10,831 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 11:00:10,831 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1625423725] [2022-04-28 11:00:10,926 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 11:00:10,926 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 11:00:10,926 INFO L85 PathProgramCache]: Analyzing trace with hash -107207904, now seen corresponding path program 20 times [2022-04-28 11:00:10,926 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 11:00:10,926 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1350736709] [2022-04-28 11:00:10,926 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 11:00:10,926 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 11:00:10,937 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 11:00:10,937 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1797545770] [2022-04-28 11:00:10,937 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 11:00:10,937 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 11:00:10,937 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 11:00:10,938 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 11:00:10,948 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process