/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/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/nla-digbench-scaling/ps6-ll_valuebound20.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-e106359-m [2022-04-14 17:52:30,733 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-14 17:52:30,734 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-14 17:52:30,751 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-14 17:52:30,751 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-14 17:52:30,752 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-14 17:52:30,753 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-14 17:52:30,754 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-14 17:52:30,755 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-14 17:52:30,756 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-14 17:52:30,756 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-14 17:52:30,757 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-14 17:52:30,757 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-14 17:52:30,758 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-14 17:52:30,759 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-14 17:52:30,759 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-14 17:52:30,760 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-14 17:52:30,760 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-14 17:52:30,761 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-14 17:52:30,763 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-14 17:52:30,764 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-14 17:52:30,764 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-14 17:52:30,765 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-14 17:52:30,766 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-14 17:52:30,766 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-14 17:52:30,768 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-14 17:52:30,768 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-14 17:52:30,768 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-14 17:52:30,769 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-14 17:52:30,769 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-14 17:52:30,769 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-14 17:52:30,770 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-14 17:52:30,770 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-14 17:52:30,770 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-14 17:52:30,771 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-14 17:52:30,771 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-14 17:52:30,772 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-14 17:52:30,772 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-14 17:52:30,772 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-14 17:52:30,772 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-14 17:52:30,773 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-14 17:52:30,773 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-14 17:52:30,774 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2022-04-14 17:52:30,786 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-14 17:52:30,786 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-14 17:52:30,786 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-04-14 17:52:30,786 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-04-14 17:52:30,787 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-04-14 17:52:30,787 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-04-14 17:52:30,790 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-04-14 17:52:30,791 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-04-14 17:52:30,791 INFO L138 SettingsManager]: * Use SBE=true [2022-04-14 17:52:30,792 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-14 17:52:30,792 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-14 17:52:30,792 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-14 17:52:30,792 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-14 17:52:30,792 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-14 17:52:30,792 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-14 17:52:30,792 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-14 17:52:30,792 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-14 17:52:30,792 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-14 17:52:30,793 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-14 17:52:30,793 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-14 17:52:30,793 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-14 17:52:30,793 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-14 17:52:30,793 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-14 17:52:30,793 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-14 17:52:30,793 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-14 17:52:30,793 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-14 17:52:30,793 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-04-14 17:52:30,794 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-04-14 17:52:30,794 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-04-14 17:52:30,794 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-04-14 17:52:30,794 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-04-14 17:52:30,794 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-04-14 17:52:30,794 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-14 17:52:30,794 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode 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-14 17:52:30,929 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-14 17:52:30,941 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-14 17:52:30,942 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-14 17:52:30,943 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-14 17:52:30,943 INFO L275 PluginConnector]: CDTParser initialized [2022-04-14 17:52:30,944 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/nla-digbench-scaling/ps6-ll_valuebound20.c [2022-04-14 17:52:30,990 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ca24115dc/30a59eb4d93742d4adbcd304b2187407/FLAGe2a5cd224 [2022-04-14 17:52:31,330 INFO L306 CDTParser]: Found 1 translation units. [2022-04-14 17:52:31,331 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/ps6-ll_valuebound20.c [2022-04-14 17:52:31,334 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ca24115dc/30a59eb4d93742d4adbcd304b2187407/FLAGe2a5cd224 [2022-04-14 17:52:31,791 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ca24115dc/30a59eb4d93742d4adbcd304b2187407 [2022-04-14 17:52:31,793 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-14 17:52:31,793 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-14 17:52:31,794 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-14 17:52:31,795 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-14 17:52:31,797 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-14 17:52:31,797 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.04 05:52:31" (1/1) ... [2022-04-14 17:52:31,798 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@67fb1bad and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 05:52:31, skipping insertion in model container [2022-04-14 17:52:31,798 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.04 05:52:31" (1/1) ... [2022-04-14 17:52:31,802 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-14 17:52:31,809 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-14 17:52:31,940 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/ps6-ll_valuebound20.c[458,471] [2022-04-14 17:52:31,960 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-14 17:52:31,965 INFO L203 MainTranslator]: Completed pre-run [2022-04-14 17:52:31,972 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/ps6-ll_valuebound20.c[458,471] [2022-04-14 17:52:31,982 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-14 17:52:31,989 INFO L208 MainTranslator]: Completed translation [2022-04-14 17:52:31,989 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 05:52:31 WrapperNode [2022-04-14 17:52:31,989 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-14 17:52:31,990 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-14 17:52:31,990 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-14 17:52:31,990 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-14 17:52:31,997 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 05:52:31" (1/1) ... [2022-04-14 17:52:31,998 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 05:52:31" (1/1) ... [2022-04-14 17:52:32,001 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 05:52:31" (1/1) ... [2022-04-14 17:52:32,001 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 05:52:31" (1/1) ... [2022-04-14 17:52:32,004 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 05:52:31" (1/1) ... [2022-04-14 17:52:32,007 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 05:52:31" (1/1) ... [2022-04-14 17:52:32,007 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 05:52:31" (1/1) ... [2022-04-14 17:52:32,008 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-14 17:52:32,009 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-14 17:52:32,009 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-14 17:52:32,009 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-14 17:52:32,009 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 05:52:31" (1/1) ... [2022-04-14 17:52:32,014 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-14 17:52:32,021 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-14 17:52:32,028 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-14 17:52:32,033 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-14 17:52:32,056 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-14 17:52:32,056 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-14 17:52:32,057 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-14 17:52:32,057 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-14 17:52:32,058 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-14 17:52:32,058 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-14 17:52:32,059 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-14 17:52:32,059 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-14 17:52:32,059 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-14 17:52:32,059 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-14 17:52:32,059 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_short [2022-04-14 17:52:32,059 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-14 17:52:32,059 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-14 17:52:32,059 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-14 17:52:32,059 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-14 17:52:32,059 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-14 17:52:32,059 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-14 17:52:32,059 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-14 17:52:32,059 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-14 17:52:32,059 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-14 17:52:32,111 INFO L234 CfgBuilder]: Building ICFG [2022-04-14 17:52:32,113 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-14 17:52:32,241 INFO L275 CfgBuilder]: Performing block encoding [2022-04-14 17:52:32,258 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-14 17:52:32,259 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-14 17:52:32,260 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.04 05:52:32 BoogieIcfgContainer [2022-04-14 17:52:32,260 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-14 17:52:32,266 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-14 17:52:32,266 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-14 17:52:32,269 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-14 17:52:32,269 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.04 05:52:31" (1/3) ... [2022-04-14 17:52:32,271 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@381e86ec and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.04 05:52:32, skipping insertion in model container [2022-04-14 17:52:32,271 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 05:52:31" (2/3) ... [2022-04-14 17:52:32,271 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@381e86ec and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.04 05:52:32, skipping insertion in model container [2022-04-14 17:52:32,271 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.04 05:52:32" (3/3) ... [2022-04-14 17:52:32,272 INFO L111 eAbstractionObserver]: Analyzing ICFG ps6-ll_valuebound20.c [2022-04-14 17:52:32,283 INFO L202 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-04-14 17:52:32,284 INFO L161 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-14 17:52:32,313 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-14 17:52:32,317 INFO L340 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP [2022-04-14 17:52:32,317 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-14 17:52:32,331 INFO L276 IsEmpty]: Start isEmpty. Operand has 29 states, 16 states have (on average 1.375) internal successors, (22), 17 states have internal predecessors, (22), 7 states have call successors, (7), 4 states have call predecessors, (7), 4 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-14 17:52:32,334 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-04-14 17:52:32,334 INFO L491 BasicCegarLoop]: Found error trace [2022-04-14 17:52:32,335 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-14 17:52:32,335 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-14 17:52:32,338 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-14 17:52:32,339 INFO L85 PathProgramCache]: Analyzing trace with hash 1098891495, now seen corresponding path program 1 times [2022-04-14 17:52:32,345 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-14 17:52:32,345 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1173350872] [2022-04-14 17:52:32,345 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 17:52:32,346 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-14 17:52:32,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 17:52:32,447 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-14 17:52:32,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 17:52:32,467 INFO L290 TraceCheckUtils]: 0: Hoare triple {45#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3); {32#true} is VALID [2022-04-14 17:52:32,467 INFO L290 TraceCheckUtils]: 1: Hoare triple {32#true} assume true; {32#true} is VALID [2022-04-14 17:52:32,467 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {32#true} {32#true} #63#return; {32#true} is VALID [2022-04-14 17:52:32,468 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-14 17:52:32,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 17:52:32,479 INFO L290 TraceCheckUtils]: 0: Hoare triple {32#true} ~cond := #in~cond; {32#true} is VALID [2022-04-14 17:52:32,479 INFO L290 TraceCheckUtils]: 1: Hoare triple {32#true} assume 0 == ~cond;assume false; {33#false} is VALID [2022-04-14 17:52:32,480 INFO L290 TraceCheckUtils]: 2: Hoare triple {33#false} assume true; {33#false} is VALID [2022-04-14 17:52:32,480 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {33#false} {32#true} #53#return; {33#false} is VALID [2022-04-14 17:52:32,480 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-04-14 17:52:32,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 17:52:32,507 INFO L290 TraceCheckUtils]: 0: Hoare triple {32#true} ~cond := #in~cond; {32#true} is VALID [2022-04-14 17:52:32,508 INFO L290 TraceCheckUtils]: 1: Hoare triple {32#true} assume 0 == ~cond;assume false; {33#false} is VALID [2022-04-14 17:52:32,508 INFO L290 TraceCheckUtils]: 2: Hoare triple {33#false} assume true; {33#false} is VALID [2022-04-14 17:52:32,508 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {33#false} {33#false} #55#return; {33#false} is VALID [2022-04-14 17:52:32,509 INFO L272 TraceCheckUtils]: 0: Hoare triple {32#true} call ULTIMATE.init(); {45#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-14 17:52:32,510 INFO L290 TraceCheckUtils]: 1: Hoare triple {45#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3); {32#true} is VALID [2022-04-14 17:52:32,510 INFO L290 TraceCheckUtils]: 2: Hoare triple {32#true} assume true; {32#true} is VALID [2022-04-14 17:52:32,511 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {32#true} {32#true} #63#return; {32#true} is VALID [2022-04-14 17:52:32,511 INFO L272 TraceCheckUtils]: 4: Hoare triple {32#true} call #t~ret5 := main(); {32#true} is VALID [2022-04-14 17:52:32,511 INFO L290 TraceCheckUtils]: 5: Hoare triple {32#true} havoc ~k~0;havoc ~y~0;havoc ~x~0;havoc ~c~0;assume -32768 <= #t~nondet4 && #t~nondet4 <= 32767;~k~0 := #t~nondet4;havoc #t~nondet4; {32#true} is VALID [2022-04-14 17:52:32,511 INFO L272 TraceCheckUtils]: 6: Hoare triple {32#true} call assume_abort_if_not((if ~k~0 >= 0 && ~k~0 <= 20 then 1 else 0)); {32#true} is VALID [2022-04-14 17:52:32,511 INFO L290 TraceCheckUtils]: 7: Hoare triple {32#true} ~cond := #in~cond; {32#true} is VALID [2022-04-14 17:52:32,512 INFO L290 TraceCheckUtils]: 8: Hoare triple {32#true} assume 0 == ~cond;assume false; {33#false} is VALID [2022-04-14 17:52:32,512 INFO L290 TraceCheckUtils]: 9: Hoare triple {33#false} assume true; {33#false} is VALID [2022-04-14 17:52:32,512 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {33#false} {32#true} #53#return; {33#false} is VALID [2022-04-14 17:52:32,512 INFO L272 TraceCheckUtils]: 11: Hoare triple {33#false} call assume_abort_if_not((if ~k~0 <= 256 then 1 else 0)); {32#true} is VALID [2022-04-14 17:52:32,512 INFO L290 TraceCheckUtils]: 12: Hoare triple {32#true} ~cond := #in~cond; {32#true} is VALID [2022-04-14 17:52:32,513 INFO L290 TraceCheckUtils]: 13: Hoare triple {32#true} assume 0 == ~cond;assume false; {33#false} is VALID [2022-04-14 17:52:32,513 INFO L290 TraceCheckUtils]: 14: Hoare triple {33#false} assume true; {33#false} is VALID [2022-04-14 17:52:32,513 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {33#false} {33#false} #55#return; {33#false} is VALID [2022-04-14 17:52:32,513 INFO L290 TraceCheckUtils]: 16: Hoare triple {33#false} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {33#false} is VALID [2022-04-14 17:52:32,513 INFO L290 TraceCheckUtils]: 17: Hoare triple {33#false} assume false; {33#false} is VALID [2022-04-14 17:52:32,513 INFO L272 TraceCheckUtils]: 18: Hoare triple {33#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)); {33#false} is VALID [2022-04-14 17:52:32,513 INFO L290 TraceCheckUtils]: 19: Hoare triple {33#false} ~cond := #in~cond; {33#false} is VALID [2022-04-14 17:52:32,514 INFO L290 TraceCheckUtils]: 20: Hoare triple {33#false} assume 0 == ~cond; {33#false} is VALID [2022-04-14 17:52:32,514 INFO L290 TraceCheckUtils]: 21: Hoare triple {33#false} assume !false; {33#false} is VALID [2022-04-14 17:52:32,514 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-14 17:52:32,514 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-14 17:52:32,514 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1173350872] [2022-04-14 17:52:32,515 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1173350872] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-14 17:52:32,515 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-14 17:52:32,518 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-14 17:52:32,519 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1721150920] [2022-04-14 17:52:32,519 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-14 17:52:32,522 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 22 [2022-04-14 17:52:32,523 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-14 17:52:32,525 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-14 17:52:32,551 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 19 edges. 19 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-14 17:52:32,551 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-14 17:52:32,551 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-14 17:52:32,569 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-14 17:52:32,570 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-14 17:52:32,573 INFO L87 Difference]: Start difference. First operand has 29 states, 16 states have (on average 1.375) internal successors, (22), 17 states have internal predecessors, (22), 7 states have call successors, (7), 4 states have call predecessors, (7), 4 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-14 17:52:32,845 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 17:52:32,845 INFO L93 Difference]: Finished difference Result 51 states and 69 transitions. [2022-04-14 17:52:32,845 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-14 17:52:32,846 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 22 [2022-04-14 17:52:32,846 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-14 17:52:32,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-14 17:52:32,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 69 transitions. [2022-04-14 17:52:32,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-14 17:52:32,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 69 transitions. [2022-04-14 17:52:32,860 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 69 transitions. [2022-04-14 17:52:32,934 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 69 edges. 69 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-14 17:52:32,940 INFO L225 Difference]: With dead ends: 51 [2022-04-14 17:52:32,940 INFO L226 Difference]: Without dead ends: 24 [2022-04-14 17:52:32,942 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-14 17:52:32,945 INFO L913 BasicCegarLoop]: 27 mSDtfsCounter, 15 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 30 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-14 17:52:32,945 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [20 Valid, 30 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-14 17:52:32,956 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2022-04-14 17:52:32,966 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2022-04-14 17:52:32,966 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-14 17:52:32,967 INFO L82 GeneralOperation]: Start isEquivalent. First operand 24 states. Second operand has 24 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 14 states have internal predecessors, (15), 7 states have call successors, (7), 4 states have call predecessors, (7), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-14 17:52:32,977 INFO L74 IsIncluded]: Start isIncluded. First operand 24 states. Second operand has 24 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 14 states have internal predecessors, (15), 7 states have call successors, (7), 4 states have call predecessors, (7), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-14 17:52:32,979 INFO L87 Difference]: Start difference. First operand 24 states. Second operand has 24 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 14 states have internal predecessors, (15), 7 states have call successors, (7), 4 states have call predecessors, (7), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-14 17:52:32,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 17:52:32,992 INFO L93 Difference]: Finished difference Result 24 states and 27 transitions. [2022-04-14 17:52:32,992 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 27 transitions. [2022-04-14 17:52:32,993 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 17:52:32,993 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 17:52:32,993 INFO L74 IsIncluded]: Start isIncluded. First operand has 24 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 14 states have internal predecessors, (15), 7 states have call successors, (7), 4 states have call predecessors, (7), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand 24 states. [2022-04-14 17:52:32,993 INFO L87 Difference]: Start difference. First operand has 24 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 14 states have internal predecessors, (15), 7 states have call successors, (7), 4 states have call predecessors, (7), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand 24 states. [2022-04-14 17:52:32,995 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 17:52:32,996 INFO L93 Difference]: Finished difference Result 24 states and 27 transitions. [2022-04-14 17:52:32,996 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 27 transitions. [2022-04-14 17:52:32,996 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 17:52:32,996 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 17:52:32,996 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-14 17:52:32,996 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-14 17:52:32,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 14 states have internal predecessors, (15), 7 states have call successors, (7), 4 states have call predecessors, (7), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-14 17:52:32,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 27 transitions. [2022-04-14 17:52:32,999 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 27 transitions. Word has length 22 [2022-04-14 17:52:32,999 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-14 17:52:32,999 INFO L478 AbstractCegarLoop]: Abstraction has 24 states and 27 transitions. [2022-04-14 17:52:32,999 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-14 17:52:32,999 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 27 transitions. [2022-04-14 17:52:33,001 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-04-14 17:52:33,001 INFO L491 BasicCegarLoop]: Found error trace [2022-04-14 17:52:33,001 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-14 17:52:33,002 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-14 17:52:33,002 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-14 17:52:33,002 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-14 17:52:33,002 INFO L85 PathProgramCache]: Analyzing trace with hash 769620075, now seen corresponding path program 1 times [2022-04-14 17:52:33,003 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-14 17:52:33,003 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [735466423] [2022-04-14 17:52:33,003 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 17:52:33,003 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-14 17:52:33,018 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-14 17:52:33,019 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [65811151] [2022-04-14 17:52:33,019 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 17:52:33,019 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-14 17:52:33,019 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-14 17:52:33,020 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-14 17:52:33,021 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-14 17:52:33,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 17:52:33,056 INFO L263 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-14 17:52:33,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 17:52:33,087 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-14 17:52:33,199 INFO L272 TraceCheckUtils]: 0: Hoare triple {202#true} call ULTIMATE.init(); {202#true} is VALID [2022-04-14 17:52:33,199 INFO L290 TraceCheckUtils]: 1: Hoare triple {202#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); {202#true} is VALID [2022-04-14 17:52:33,199 INFO L290 TraceCheckUtils]: 2: Hoare triple {202#true} assume true; {202#true} is VALID [2022-04-14 17:52:33,200 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {202#true} {202#true} #63#return; {202#true} is VALID [2022-04-14 17:52:33,200 INFO L272 TraceCheckUtils]: 4: Hoare triple {202#true} call #t~ret5 := main(); {202#true} is VALID [2022-04-14 17:52:33,200 INFO L290 TraceCheckUtils]: 5: Hoare triple {202#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; {202#true} is VALID [2022-04-14 17:52:33,200 INFO L272 TraceCheckUtils]: 6: Hoare triple {202#true} call assume_abort_if_not((if ~k~0 >= 0 && ~k~0 <= 20 then 1 else 0)); {202#true} is VALID [2022-04-14 17:52:33,200 INFO L290 TraceCheckUtils]: 7: Hoare triple {202#true} ~cond := #in~cond; {202#true} is VALID [2022-04-14 17:52:33,200 INFO L290 TraceCheckUtils]: 8: Hoare triple {202#true} assume !(0 == ~cond); {202#true} is VALID [2022-04-14 17:52:33,200 INFO L290 TraceCheckUtils]: 9: Hoare triple {202#true} assume true; {202#true} is VALID [2022-04-14 17:52:33,200 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {202#true} {202#true} #53#return; {202#true} is VALID [2022-04-14 17:52:33,201 INFO L272 TraceCheckUtils]: 11: Hoare triple {202#true} call assume_abort_if_not((if ~k~0 <= 256 then 1 else 0)); {202#true} is VALID [2022-04-14 17:52:33,201 INFO L290 TraceCheckUtils]: 12: Hoare triple {202#true} ~cond := #in~cond; {202#true} is VALID [2022-04-14 17:52:33,201 INFO L290 TraceCheckUtils]: 13: Hoare triple {202#true} assume !(0 == ~cond); {202#true} is VALID [2022-04-14 17:52:33,201 INFO L290 TraceCheckUtils]: 14: Hoare triple {202#true} assume true; {202#true} is VALID [2022-04-14 17:52:33,201 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {202#true} {202#true} #55#return; {202#true} is VALID [2022-04-14 17:52:33,202 INFO L290 TraceCheckUtils]: 16: Hoare triple {202#true} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {255#(and (= main_~x~0 0) (= main_~y~0 0))} is VALID [2022-04-14 17:52:33,202 INFO L290 TraceCheckUtils]: 17: Hoare triple {255#(and (= main_~x~0 0) (= main_~y~0 0))} assume !false; {255#(and (= main_~x~0 0) (= main_~y~0 0))} is VALID [2022-04-14 17:52:33,203 INFO L272 TraceCheckUtils]: 18: Hoare triple {255#(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)); {262#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-14 17:52:33,203 INFO L290 TraceCheckUtils]: 19: Hoare triple {262#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {266#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-14 17:52:33,204 INFO L290 TraceCheckUtils]: 20: Hoare triple {266#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {203#false} is VALID [2022-04-14 17:52:33,204 INFO L290 TraceCheckUtils]: 21: Hoare triple {203#false} assume !false; {203#false} is VALID [2022-04-14 17:52:33,204 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-14 17:52:33,204 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-14 17:52:33,204 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-14 17:52:33,205 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [735466423] [2022-04-14 17:52:33,205 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-14 17:52:33,205 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [65811151] [2022-04-14 17:52:33,205 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [65811151] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-14 17:52:33,205 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-14 17:52:33,205 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-14 17:52:33,206 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1150116480] [2022-04-14 17:52:33,206 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-14 17:52:33,207 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 22 [2022-04-14 17:52:33,207 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-14 17:52:33,207 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-14 17:52:33,220 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 19 edges. 19 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-14 17:52:33,221 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-14 17:52:33,221 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-14 17:52:33,221 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-14 17:52:33,221 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-14 17:52:33,221 INFO L87 Difference]: Start difference. First operand 24 states and 27 transitions. Second operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-14 17:52:33,482 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 17:52:33,483 INFO L93 Difference]: Finished difference Result 35 states and 40 transitions. [2022-04-14 17:52:33,483 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-14 17:52:33,483 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 22 [2022-04-14 17:52:33,483 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-14 17:52:33,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-14 17:52:33,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 40 transitions. [2022-04-14 17:52:33,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-14 17:52:33,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 40 transitions. [2022-04-14 17:52:33,487 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 40 transitions. [2022-04-14 17:52:33,520 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-14 17:52:33,521 INFO L225 Difference]: With dead ends: 35 [2022-04-14 17:52:33,522 INFO L226 Difference]: Without dead ends: 31 [2022-04-14 17:52:33,522 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-14 17:52:33,523 INFO L913 BasicCegarLoop]: 24 mSDtfsCounter, 6 mSDsluCounter, 61 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 85 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-14 17:52:33,523 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [8 Valid, 85 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-14 17:52:33,525 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2022-04-14 17:52:33,543 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2022-04-14 17:52:33,544 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-14 17:52:33,544 INFO L82 GeneralOperation]: Start isEquivalent. First operand 31 states. Second operand has 31 states, 18 states have (on average 1.1111111111111112) internal successors, (20), 19 states have internal predecessors, (20), 8 states have call successors, (8), 5 states have call predecessors, (8), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-14 17:52:33,544 INFO L74 IsIncluded]: Start isIncluded. First operand 31 states. Second operand has 31 states, 18 states have (on average 1.1111111111111112) internal successors, (20), 19 states have internal predecessors, (20), 8 states have call successors, (8), 5 states have call predecessors, (8), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-14 17:52:33,545 INFO L87 Difference]: Start difference. First operand 31 states. Second operand has 31 states, 18 states have (on average 1.1111111111111112) internal successors, (20), 19 states have internal predecessors, (20), 8 states have call successors, (8), 5 states have call predecessors, (8), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-14 17:52:33,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 17:52:33,546 INFO L93 Difference]: Finished difference Result 31 states and 34 transitions. [2022-04-14 17:52:33,546 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 34 transitions. [2022-04-14 17:52:33,547 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 17:52:33,547 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 17:52:33,547 INFO L74 IsIncluded]: Start isIncluded. First operand has 31 states, 18 states have (on average 1.1111111111111112) internal successors, (20), 19 states have internal predecessors, (20), 8 states have call successors, (8), 5 states have call predecessors, (8), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand 31 states. [2022-04-14 17:52:33,547 INFO L87 Difference]: Start difference. First operand has 31 states, 18 states have (on average 1.1111111111111112) internal successors, (20), 19 states have internal predecessors, (20), 8 states have call successors, (8), 5 states have call predecessors, (8), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand 31 states. [2022-04-14 17:52:33,549 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 17:52:33,549 INFO L93 Difference]: Finished difference Result 31 states and 34 transitions. [2022-04-14 17:52:33,549 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 34 transitions. [2022-04-14 17:52:33,549 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 17:52:33,549 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 17:52:33,550 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-14 17:52:33,550 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-14 17:52:33,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 18 states have (on average 1.1111111111111112) internal successors, (20), 19 states have internal predecessors, (20), 8 states have call successors, (8), 5 states have call predecessors, (8), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-14 17:52:33,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 34 transitions. [2022-04-14 17:52:33,557 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 34 transitions. Word has length 22 [2022-04-14 17:52:33,557 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-14 17:52:33,558 INFO L478 AbstractCegarLoop]: Abstraction has 31 states and 34 transitions. [2022-04-14 17:52:33,561 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-14 17:52:33,561 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 34 transitions. [2022-04-14 17:52:33,561 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-04-14 17:52:33,561 INFO L491 BasicCegarLoop]: Found error trace [2022-04-14 17:52:33,562 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-14 17:52:33,594 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-04-14 17:52:33,779 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-14 17:52:33,780 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-14 17:52:33,780 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-14 17:52:33,780 INFO L85 PathProgramCache]: Analyzing trace with hash 645812411, now seen corresponding path program 1 times [2022-04-14 17:52:33,780 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-14 17:52:33,782 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1843082383] [2022-04-14 17:52:33,782 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 17:52:33,782 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-14 17:52:33,808 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-14 17:52:33,808 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1229637257] [2022-04-14 17:52:33,808 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 17:52:33,808 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-14 17:52:33,808 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-14 17:52:33,817 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-14 17:52:33,840 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-14 17:52:33,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 17:52:33,895 INFO L263 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 11 conjunts are in the unsatisfiable core [2022-04-14 17:52:33,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 17:52:33,905 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-14 17:52:34,033 INFO L272 TraceCheckUtils]: 0: Hoare triple {434#true} call ULTIMATE.init(); {434#true} is VALID [2022-04-14 17:52:34,034 INFO L290 TraceCheckUtils]: 1: Hoare triple {434#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); {434#true} is VALID [2022-04-14 17:52:34,034 INFO L290 TraceCheckUtils]: 2: Hoare triple {434#true} assume true; {434#true} is VALID [2022-04-14 17:52:34,034 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {434#true} {434#true} #63#return; {434#true} is VALID [2022-04-14 17:52:34,034 INFO L272 TraceCheckUtils]: 4: Hoare triple {434#true} call #t~ret5 := main(); {434#true} is VALID [2022-04-14 17:52:34,034 INFO L290 TraceCheckUtils]: 5: Hoare triple {434#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; {434#true} is VALID [2022-04-14 17:52:34,034 INFO L272 TraceCheckUtils]: 6: Hoare triple {434#true} call assume_abort_if_not((if ~k~0 >= 0 && ~k~0 <= 20 then 1 else 0)); {434#true} is VALID [2022-04-14 17:52:34,035 INFO L290 TraceCheckUtils]: 7: Hoare triple {434#true} ~cond := #in~cond; {434#true} is VALID [2022-04-14 17:52:34,035 INFO L290 TraceCheckUtils]: 8: Hoare triple {434#true} assume !(0 == ~cond); {434#true} is VALID [2022-04-14 17:52:34,035 INFO L290 TraceCheckUtils]: 9: Hoare triple {434#true} assume true; {434#true} is VALID [2022-04-14 17:52:34,035 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {434#true} {434#true} #53#return; {434#true} is VALID [2022-04-14 17:52:34,035 INFO L272 TraceCheckUtils]: 11: Hoare triple {434#true} call assume_abort_if_not((if ~k~0 <= 256 then 1 else 0)); {434#true} is VALID [2022-04-14 17:52:34,035 INFO L290 TraceCheckUtils]: 12: Hoare triple {434#true} ~cond := #in~cond; {434#true} is VALID [2022-04-14 17:52:34,035 INFO L290 TraceCheckUtils]: 13: Hoare triple {434#true} assume !(0 == ~cond); {434#true} is VALID [2022-04-14 17:52:34,035 INFO L290 TraceCheckUtils]: 14: Hoare triple {434#true} assume true; {434#true} is VALID [2022-04-14 17:52:34,036 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {434#true} {434#true} #55#return; {434#true} is VALID [2022-04-14 17:52:34,036 INFO L290 TraceCheckUtils]: 16: Hoare triple {434#true} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {487#(and (= main_~x~0 0) (= main_~y~0 0))} is VALID [2022-04-14 17:52:34,037 INFO L290 TraceCheckUtils]: 17: Hoare triple {487#(and (= main_~x~0 0) (= main_~y~0 0))} assume !false; {487#(and (= main_~x~0 0) (= main_~y~0 0))} is VALID [2022-04-14 17:52:34,037 INFO L272 TraceCheckUtils]: 18: Hoare triple {487#(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)); {434#true} is VALID [2022-04-14 17:52:34,037 INFO L290 TraceCheckUtils]: 19: Hoare triple {434#true} ~cond := #in~cond; {434#true} is VALID [2022-04-14 17:52:34,037 INFO L290 TraceCheckUtils]: 20: Hoare triple {434#true} assume !(0 == ~cond); {434#true} is VALID [2022-04-14 17:52:34,037 INFO L290 TraceCheckUtils]: 21: Hoare triple {434#true} assume true; {434#true} is VALID [2022-04-14 17:52:34,038 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {434#true} {487#(and (= main_~x~0 0) (= main_~y~0 0))} #57#return; {487#(and (= main_~x~0 0) (= main_~y~0 0))} is VALID [2022-04-14 17:52:34,038 INFO L290 TraceCheckUtils]: 23: Hoare triple {487#(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; {509#(and (= (+ (- 1) main_~y~0) 0) (= main_~x~0 (* main_~y~0 (* (* main_~y~0 (* main_~y~0 main_~y~0)) main_~y~0))))} is VALID [2022-04-14 17:52:34,039 INFO L290 TraceCheckUtils]: 24: Hoare triple {509#(and (= (+ (- 1) main_~y~0) 0) (= main_~x~0 (* main_~y~0 (* (* main_~y~0 (* main_~y~0 main_~y~0)) main_~y~0))))} assume !false; {509#(and (= (+ (- 1) main_~y~0) 0) (= main_~x~0 (* main_~y~0 (* (* main_~y~0 (* main_~y~0 main_~y~0)) main_~y~0))))} is VALID [2022-04-14 17:52:34,040 INFO L272 TraceCheckUtils]: 25: Hoare triple {509#(and (= (+ (- 1) main_~y~0) 0) (= 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)); {516#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-14 17:52:34,041 INFO L290 TraceCheckUtils]: 26: Hoare triple {516#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {520#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-14 17:52:34,041 INFO L290 TraceCheckUtils]: 27: Hoare triple {520#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {435#false} is VALID [2022-04-14 17:52:34,041 INFO L290 TraceCheckUtils]: 28: Hoare triple {435#false} assume !false; {435#false} is VALID [2022-04-14 17:52:34,042 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-14 17:52:34,042 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-14 17:52:34,187 INFO L290 TraceCheckUtils]: 28: Hoare triple {435#false} assume !false; {435#false} is VALID [2022-04-14 17:52:34,188 INFO L290 TraceCheckUtils]: 27: Hoare triple {520#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {435#false} is VALID [2022-04-14 17:52:34,188 INFO L290 TraceCheckUtils]: 26: Hoare triple {516#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {520#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-14 17:52:34,189 INFO L272 TraceCheckUtils]: 25: Hoare triple {536#(= (+ (* 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)); {516#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-14 17:52:34,189 INFO L290 TraceCheckUtils]: 24: Hoare triple {536#(= (+ (* 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; {536#(= (+ (* 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-14 17:52:34,233 INFO L290 TraceCheckUtils]: 23: Hoare triple {536#(= (+ (* 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; {536#(= (+ (* 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-14 17:52:34,234 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {434#true} {536#(= (+ (* 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)))} #57#return; {536#(= (+ (* 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-14 17:52:34,235 INFO L290 TraceCheckUtils]: 21: Hoare triple {434#true} assume true; {434#true} is VALID [2022-04-14 17:52:34,235 INFO L290 TraceCheckUtils]: 20: Hoare triple {434#true} assume !(0 == ~cond); {434#true} is VALID [2022-04-14 17:52:34,235 INFO L290 TraceCheckUtils]: 19: Hoare triple {434#true} ~cond := #in~cond; {434#true} is VALID [2022-04-14 17:52:34,235 INFO L272 TraceCheckUtils]: 18: Hoare triple {536#(= (+ (* 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)); {434#true} is VALID [2022-04-14 17:52:34,236 INFO L290 TraceCheckUtils]: 17: Hoare triple {536#(= (+ (* 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; {536#(= (+ (* 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-14 17:52:34,236 INFO L290 TraceCheckUtils]: 16: Hoare triple {434#true} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {536#(= (+ (* 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-14 17:52:34,236 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {434#true} {434#true} #55#return; {434#true} is VALID [2022-04-14 17:52:34,236 INFO L290 TraceCheckUtils]: 14: Hoare triple {434#true} assume true; {434#true} is VALID [2022-04-14 17:52:34,236 INFO L290 TraceCheckUtils]: 13: Hoare triple {434#true} assume !(0 == ~cond); {434#true} is VALID [2022-04-14 17:52:34,237 INFO L290 TraceCheckUtils]: 12: Hoare triple {434#true} ~cond := #in~cond; {434#true} is VALID [2022-04-14 17:52:34,237 INFO L272 TraceCheckUtils]: 11: Hoare triple {434#true} call assume_abort_if_not((if ~k~0 <= 256 then 1 else 0)); {434#true} is VALID [2022-04-14 17:52:34,237 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {434#true} {434#true} #53#return; {434#true} is VALID [2022-04-14 17:52:34,237 INFO L290 TraceCheckUtils]: 9: Hoare triple {434#true} assume true; {434#true} is VALID [2022-04-14 17:52:34,237 INFO L290 TraceCheckUtils]: 8: Hoare triple {434#true} assume !(0 == ~cond); {434#true} is VALID [2022-04-14 17:52:34,237 INFO L290 TraceCheckUtils]: 7: Hoare triple {434#true} ~cond := #in~cond; {434#true} is VALID [2022-04-14 17:52:34,237 INFO L272 TraceCheckUtils]: 6: Hoare triple {434#true} call assume_abort_if_not((if ~k~0 >= 0 && ~k~0 <= 20 then 1 else 0)); {434#true} is VALID [2022-04-14 17:52:34,237 INFO L290 TraceCheckUtils]: 5: Hoare triple {434#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; {434#true} is VALID [2022-04-14 17:52:34,238 INFO L272 TraceCheckUtils]: 4: Hoare triple {434#true} call #t~ret5 := main(); {434#true} is VALID [2022-04-14 17:52:34,238 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {434#true} {434#true} #63#return; {434#true} is VALID [2022-04-14 17:52:34,238 INFO L290 TraceCheckUtils]: 2: Hoare triple {434#true} assume true; {434#true} is VALID [2022-04-14 17:52:34,238 INFO L290 TraceCheckUtils]: 1: Hoare triple {434#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); {434#true} is VALID [2022-04-14 17:52:34,238 INFO L272 TraceCheckUtils]: 0: Hoare triple {434#true} call ULTIMATE.init(); {434#true} is VALID [2022-04-14 17:52:34,238 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-04-14 17:52:34,239 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-14 17:52:34,239 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1843082383] [2022-04-14 17:52:34,239 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-14 17:52:34,239 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1229637257] [2022-04-14 17:52:34,239 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1229637257] provided 1 perfect and 1 imperfect interpolant sequences [2022-04-14 17:52:34,239 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-04-14 17:52:34,239 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 7 [2022-04-14 17:52:34,239 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1444220763] [2022-04-14 17:52:34,239 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-14 17:52:34,240 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 29 [2022-04-14 17:52:34,240 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-14 17:52:34,240 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-14 17:52:34,302 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-14 17:52:34,302 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-14 17:52:34,303 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-14 17:52:34,303 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-14 17:52:34,303 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-04-14 17:52:34,303 INFO L87 Difference]: Start difference. First operand 31 states and 34 transitions. Second operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-14 17:52:34,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 17:52:34,402 INFO L93 Difference]: Finished difference Result 37 states and 39 transitions. [2022-04-14 17:52:34,402 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-14 17:52:34,402 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 29 [2022-04-14 17:52:34,402 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-14 17:52:34,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-14 17:52:34,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 32 transitions. [2022-04-14 17:52:34,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-14 17:52:34,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 32 transitions. [2022-04-14 17:52:34,405 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 32 transitions. [2022-04-14 17:52:34,506 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-14 17:52:34,507 INFO L225 Difference]: With dead ends: 37 [2022-04-14 17:52:34,508 INFO L226 Difference]: Without dead ends: 33 [2022-04-14 17:52:34,508 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 50 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-14 17:52:34,509 INFO L913 BasicCegarLoop]: 22 mSDtfsCounter, 6 mSDsluCounter, 53 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 75 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-14 17:52:34,509 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [7 Valid, 75 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-14 17:52:34,509 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2022-04-14 17:52:34,514 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2022-04-14 17:52:34,514 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-14 17:52:34,514 INFO L82 GeneralOperation]: Start isEquivalent. First operand 33 states. Second operand has 33 states, 20 states have (on average 1.05) internal successors, (21), 20 states have internal predecessors, (21), 8 states have call successors, (8), 6 states have call predecessors, (8), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-14 17:52:34,515 INFO L74 IsIncluded]: Start isIncluded. First operand 33 states. Second operand has 33 states, 20 states have (on average 1.05) internal successors, (21), 20 states have internal predecessors, (21), 8 states have call successors, (8), 6 states have call predecessors, (8), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-14 17:52:34,515 INFO L87 Difference]: Start difference. First operand 33 states. Second operand has 33 states, 20 states have (on average 1.05) internal successors, (21), 20 states have internal predecessors, (21), 8 states have call successors, (8), 6 states have call predecessors, (8), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-14 17:52:34,516 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 17:52:34,516 INFO L93 Difference]: Finished difference Result 33 states and 35 transitions. [2022-04-14 17:52:34,517 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 35 transitions. [2022-04-14 17:52:34,517 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 17:52:34,517 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 17:52:34,517 INFO L74 IsIncluded]: Start isIncluded. First operand has 33 states, 20 states have (on average 1.05) internal successors, (21), 20 states have internal predecessors, (21), 8 states have call successors, (8), 6 states have call predecessors, (8), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand 33 states. [2022-04-14 17:52:34,517 INFO L87 Difference]: Start difference. First operand has 33 states, 20 states have (on average 1.05) internal successors, (21), 20 states have internal predecessors, (21), 8 states have call successors, (8), 6 states have call predecessors, (8), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand 33 states. [2022-04-14 17:52:34,521 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 17:52:34,521 INFO L93 Difference]: Finished difference Result 33 states and 35 transitions. [2022-04-14 17:52:34,521 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 35 transitions. [2022-04-14 17:52:34,522 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 17:52:34,522 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 17:52:34,522 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-14 17:52:34,522 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-14 17:52:34,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 20 states have (on average 1.05) internal successors, (21), 20 states have internal predecessors, (21), 8 states have call successors, (8), 6 states have call predecessors, (8), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-14 17:52:34,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 35 transitions. [2022-04-14 17:52:34,523 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 35 transitions. Word has length 29 [2022-04-14 17:52:34,523 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-14 17:52:34,524 INFO L478 AbstractCegarLoop]: Abstraction has 33 states and 35 transitions. [2022-04-14 17:52:34,524 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-14 17:52:34,524 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 35 transitions. [2022-04-14 17:52:34,524 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2022-04-14 17:52:34,525 INFO L491 BasicCegarLoop]: Found error trace [2022-04-14 17:52:34,525 INFO L499 BasicCegarLoop]: trace histogram [4, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-14 17:52:34,542 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-14 17:52:34,731 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2022-04-14 17:52:34,731 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-14 17:52:34,732 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-14 17:52:34,732 INFO L85 PathProgramCache]: Analyzing trace with hash 463554397, now seen corresponding path program 1 times [2022-04-14 17:52:34,732 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-14 17:52:34,734 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [440924327] [2022-04-14 17:52:34,735 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 17:52:34,735 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-14 17:52:34,772 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-14 17:52:34,772 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1352108575] [2022-04-14 17:52:34,773 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 17:52:34,773 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-14 17:52:34,773 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-14 17:52:34,774 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-14 17:52:34,775 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-14 17:52:34,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 17:52:34,825 INFO L263 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 12 conjunts are in the unsatisfiable core [2022-04-14 17:52:34,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 17:52:34,837 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-14 17:52:35,097 INFO L272 TraceCheckUtils]: 0: Hoare triple {784#true} call ULTIMATE.init(); {784#true} is VALID [2022-04-14 17:52:35,098 INFO L290 TraceCheckUtils]: 1: Hoare triple {784#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); {784#true} is VALID [2022-04-14 17:52:35,098 INFO L290 TraceCheckUtils]: 2: Hoare triple {784#true} assume true; {784#true} is VALID [2022-04-14 17:52:35,098 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {784#true} {784#true} #63#return; {784#true} is VALID [2022-04-14 17:52:35,100 INFO L272 TraceCheckUtils]: 4: Hoare triple {784#true} call #t~ret5 := main(); {784#true} is VALID [2022-04-14 17:52:35,100 INFO L290 TraceCheckUtils]: 5: Hoare triple {784#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; {784#true} is VALID [2022-04-14 17:52:35,111 INFO L272 TraceCheckUtils]: 6: Hoare triple {784#true} call assume_abort_if_not((if ~k~0 >= 0 && ~k~0 <= 20 then 1 else 0)); {784#true} is VALID [2022-04-14 17:52:35,111 INFO L290 TraceCheckUtils]: 7: Hoare triple {784#true} ~cond := #in~cond; {784#true} is VALID [2022-04-14 17:52:35,111 INFO L290 TraceCheckUtils]: 8: Hoare triple {784#true} assume !(0 == ~cond); {784#true} is VALID [2022-04-14 17:52:35,111 INFO L290 TraceCheckUtils]: 9: Hoare triple {784#true} assume true; {784#true} is VALID [2022-04-14 17:52:35,111 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {784#true} {784#true} #53#return; {784#true} is VALID [2022-04-14 17:52:35,111 INFO L272 TraceCheckUtils]: 11: Hoare triple {784#true} call assume_abort_if_not((if ~k~0 <= 256 then 1 else 0)); {784#true} is VALID [2022-04-14 17:52:35,111 INFO L290 TraceCheckUtils]: 12: Hoare triple {784#true} ~cond := #in~cond; {784#true} is VALID [2022-04-14 17:52:35,112 INFO L290 TraceCheckUtils]: 13: Hoare triple {784#true} assume !(0 == ~cond); {784#true} is VALID [2022-04-14 17:52:35,112 INFO L290 TraceCheckUtils]: 14: Hoare triple {784#true} assume true; {784#true} is VALID [2022-04-14 17:52:35,112 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {784#true} {784#true} #55#return; {784#true} is VALID [2022-04-14 17:52:35,113 INFO L290 TraceCheckUtils]: 16: Hoare triple {784#true} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {837#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-14 17:52:35,113 INFO L290 TraceCheckUtils]: 17: Hoare triple {837#(and (= main_~c~0 0) (= main_~y~0 0))} assume !false; {837#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-14 17:52:35,113 INFO L272 TraceCheckUtils]: 18: Hoare triple {837#(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)); {784#true} is VALID [2022-04-14 17:52:35,113 INFO L290 TraceCheckUtils]: 19: Hoare triple {784#true} ~cond := #in~cond; {784#true} is VALID [2022-04-14 17:52:35,113 INFO L290 TraceCheckUtils]: 20: Hoare triple {784#true} assume !(0 == ~cond); {784#true} is VALID [2022-04-14 17:52:35,113 INFO L290 TraceCheckUtils]: 21: Hoare triple {784#true} assume true; {784#true} is VALID [2022-04-14 17:52:35,114 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {784#true} {837#(and (= main_~c~0 0) (= main_~y~0 0))} #57#return; {837#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-14 17:52:35,114 INFO L290 TraceCheckUtils]: 23: Hoare triple {837#(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; {859#(and (= (+ (- 1) main_~y~0) 0) (< 0 main_~k~0) (<= main_~c~0 1))} is VALID [2022-04-14 17:52:35,115 INFO L290 TraceCheckUtils]: 24: Hoare triple {859#(and (= (+ (- 1) main_~y~0) 0) (< 0 main_~k~0) (<= main_~c~0 1))} assume !false; {859#(and (= (+ (- 1) main_~y~0) 0) (< 0 main_~k~0) (<= main_~c~0 1))} is VALID [2022-04-14 17:52:35,115 INFO L272 TraceCheckUtils]: 25: Hoare triple {859#(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)); {784#true} is VALID [2022-04-14 17:52:35,115 INFO L290 TraceCheckUtils]: 26: Hoare triple {784#true} ~cond := #in~cond; {784#true} is VALID [2022-04-14 17:52:35,115 INFO L290 TraceCheckUtils]: 27: Hoare triple {784#true} assume !(0 == ~cond); {784#true} is VALID [2022-04-14 17:52:35,115 INFO L290 TraceCheckUtils]: 28: Hoare triple {784#true} assume true; {784#true} is VALID [2022-04-14 17:52:35,116 INFO L284 TraceCheckUtils]: 29: Hoare quadruple {784#true} {859#(and (= (+ (- 1) main_~y~0) 0) (< 0 main_~k~0) (<= main_~c~0 1))} #57#return; {859#(and (= (+ (- 1) main_~y~0) 0) (< 0 main_~k~0) (<= main_~c~0 1))} is VALID [2022-04-14 17:52:35,117 INFO L290 TraceCheckUtils]: 30: Hoare triple {859#(and (= (+ (- 1) main_~y~0) 0) (< 0 main_~k~0) (<= main_~c~0 1))} assume !(~c~0 < ~k~0); {881#(and (= (+ (- 1) main_~y~0) 0) (<= main_~k~0 1) (< 0 main_~k~0))} is VALID [2022-04-14 17:52:35,117 INFO L272 TraceCheckUtils]: 31: Hoare triple {881#(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)); {784#true} is VALID [2022-04-14 17:52:35,117 INFO L290 TraceCheckUtils]: 32: Hoare triple {784#true} ~cond := #in~cond; {784#true} is VALID [2022-04-14 17:52:35,117 INFO L290 TraceCheckUtils]: 33: Hoare triple {784#true} assume !(0 == ~cond); {784#true} is VALID [2022-04-14 17:52:35,117 INFO L290 TraceCheckUtils]: 34: Hoare triple {784#true} assume true; {784#true} is VALID [2022-04-14 17:52:35,118 INFO L284 TraceCheckUtils]: 35: Hoare quadruple {784#true} {881#(and (= (+ (- 1) main_~y~0) 0) (<= main_~k~0 1) (< 0 main_~k~0))} #59#return; {881#(and (= (+ (- 1) main_~y~0) 0) (<= main_~k~0 1) (< 0 main_~k~0))} is VALID [2022-04-14 17:52:35,118 INFO L272 TraceCheckUtils]: 36: Hoare triple {881#(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)); {900#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-14 17:52:35,119 INFO L290 TraceCheckUtils]: 37: Hoare triple {900#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {904#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-14 17:52:35,119 INFO L290 TraceCheckUtils]: 38: Hoare triple {904#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {785#false} is VALID [2022-04-14 17:52:35,119 INFO L290 TraceCheckUtils]: 39: Hoare triple {785#false} assume !false; {785#false} is VALID [2022-04-14 17:52:35,120 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-04-14 17:52:35,120 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-14 17:52:35,399 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-14 17:52:35,399 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [440924327] [2022-04-14 17:52:35,399 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-14 17:52:35,399 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1352108575] [2022-04-14 17:52:35,400 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1352108575] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-14 17:52:35,400 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-14 17:52:35,400 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2022-04-14 17:52:35,400 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1636546676] [2022-04-14 17:52:35,400 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2022-04-14 17:52:35,400 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 states have internal predecessors, (17), 4 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) Word has length 40 [2022-04-14 17:52:35,401 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-14 17:52:35,401 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 7 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 states have internal predecessors, (17), 4 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2022-04-14 17:52:35,427 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 31 edges. 31 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-14 17:52:35,427 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-14 17:52:35,428 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-14 17:52:35,428 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-14 17:52:35,428 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2022-04-14 17:52:35,428 INFO L87 Difference]: Start difference. First operand 33 states and 35 transitions. Second operand has 7 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 states have internal predecessors, (17), 4 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2022-04-14 17:52:35,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 17:52:35,617 INFO L93 Difference]: Finished difference Result 42 states and 46 transitions. [2022-04-14 17:52:35,617 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-14 17:52:35,617 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 states have internal predecessors, (17), 4 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) Word has length 40 [2022-04-14 17:52:35,617 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-14 17:52:35,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 states have internal predecessors, (17), 4 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2022-04-14 17:52:35,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 42 transitions. [2022-04-14 17:52:35,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 states have internal predecessors, (17), 4 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2022-04-14 17:52:35,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 42 transitions. [2022-04-14 17:52:35,620 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 42 transitions. [2022-04-14 17:52:35,661 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 42 edges. 42 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-14 17:52:35,662 INFO L225 Difference]: With dead ends: 42 [2022-04-14 17:52:35,662 INFO L226 Difference]: Without dead ends: 36 [2022-04-14 17:52:35,662 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 48 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2022-04-14 17:52:35,663 INFO L913 BasicCegarLoop]: 30 mSDtfsCounter, 2 mSDsluCounter, 105 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 135 SdHoareTripleChecker+Invalid, 60 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 59 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-14 17:52:35,663 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [2 Valid, 135 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 59 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-14 17:52:35,663 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2022-04-14 17:52:35,670 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2022-04-14 17:52:35,671 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-14 17:52:35,671 INFO L82 GeneralOperation]: Start isEquivalent. First operand 36 states. Second operand has 36 states, 22 states have (on average 1.0454545454545454) internal successors, (23), 22 states have internal predecessors, (23), 9 states have call successors, (9), 6 states have call predecessors, (9), 4 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-14 17:52:35,671 INFO L74 IsIncluded]: Start isIncluded. First operand 36 states. Second operand has 36 states, 22 states have (on average 1.0454545454545454) internal successors, (23), 22 states have internal predecessors, (23), 9 states have call successors, (9), 6 states have call predecessors, (9), 4 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-14 17:52:35,671 INFO L87 Difference]: Start difference. First operand 36 states. Second operand has 36 states, 22 states have (on average 1.0454545454545454) internal successors, (23), 22 states have internal predecessors, (23), 9 states have call successors, (9), 6 states have call predecessors, (9), 4 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-14 17:52:35,673 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 17:52:35,673 INFO L93 Difference]: Finished difference Result 36 states and 39 transitions. [2022-04-14 17:52:35,673 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 39 transitions. [2022-04-14 17:52:35,673 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 17:52:35,673 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 17:52:35,673 INFO L74 IsIncluded]: Start isIncluded. First operand has 36 states, 22 states have (on average 1.0454545454545454) internal successors, (23), 22 states have internal predecessors, (23), 9 states have call successors, (9), 6 states have call predecessors, (9), 4 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Second operand 36 states. [2022-04-14 17:52:35,674 INFO L87 Difference]: Start difference. First operand has 36 states, 22 states have (on average 1.0454545454545454) internal successors, (23), 22 states have internal predecessors, (23), 9 states have call successors, (9), 6 states have call predecessors, (9), 4 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Second operand 36 states. [2022-04-14 17:52:35,675 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 17:52:35,675 INFO L93 Difference]: Finished difference Result 36 states and 39 transitions. [2022-04-14 17:52:35,675 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 39 transitions. [2022-04-14 17:52:35,675 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 17:52:35,675 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 17:52:35,675 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-14 17:52:35,675 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-14 17:52:35,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 22 states have (on average 1.0454545454545454) internal successors, (23), 22 states have internal predecessors, (23), 9 states have call successors, (9), 6 states have call predecessors, (9), 4 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-14 17:52:35,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 39 transitions. [2022-04-14 17:52:35,677 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 39 transitions. Word has length 40 [2022-04-14 17:52:35,677 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-14 17:52:35,677 INFO L478 AbstractCegarLoop]: Abstraction has 36 states and 39 transitions. [2022-04-14 17:52:35,677 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 states have internal predecessors, (17), 4 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2022-04-14 17:52:35,677 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 39 transitions. [2022-04-14 17:52:35,678 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2022-04-14 17:52:35,678 INFO L491 BasicCegarLoop]: Found error trace [2022-04-14 17:52:35,678 INFO L499 BasicCegarLoop]: trace histogram [5, 4, 4, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-14 17:52:35,713 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-04-14 17:52:35,878 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-14 17:52:35,879 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-14 17:52:35,879 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-14 17:52:35,879 INFO L85 PathProgramCache]: Analyzing trace with hash 1886956461, now seen corresponding path program 2 times [2022-04-14 17:52:35,879 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-14 17:52:35,880 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1269765460] [2022-04-14 17:52:35,880 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 17:52:35,880 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-14 17:52:35,889 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-14 17:52:35,889 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1752257083] [2022-04-14 17:52:35,890 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-14 17:52:35,890 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-14 17:52:35,890 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-14 17:52:35,903 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-14 17:52:35,912 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-14 17:52:36,019 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-14 17:52:36,019 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-14 17:52:36,022 INFO L263 TraceCheckSpWp]: Trace formula consists of 130 conjuncts, 16 conjunts are in the unsatisfiable core [2022-04-14 17:52:36,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 17:52:36,039 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-14 17:52:36,315 INFO L272 TraceCheckUtils]: 0: Hoare triple {1160#true} call ULTIMATE.init(); {1160#true} is VALID [2022-04-14 17:52:36,316 INFO L290 TraceCheckUtils]: 1: Hoare triple {1160#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); {1160#true} is VALID [2022-04-14 17:52:36,316 INFO L290 TraceCheckUtils]: 2: Hoare triple {1160#true} assume true; {1160#true} is VALID [2022-04-14 17:52:36,316 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1160#true} {1160#true} #63#return; {1160#true} is VALID [2022-04-14 17:52:36,316 INFO L272 TraceCheckUtils]: 4: Hoare triple {1160#true} call #t~ret5 := main(); {1160#true} is VALID [2022-04-14 17:52:36,316 INFO L290 TraceCheckUtils]: 5: Hoare triple {1160#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; {1160#true} is VALID [2022-04-14 17:52:36,316 INFO L272 TraceCheckUtils]: 6: Hoare triple {1160#true} call assume_abort_if_not((if ~k~0 >= 0 && ~k~0 <= 20 then 1 else 0)); {1160#true} is VALID [2022-04-14 17:52:36,316 INFO L290 TraceCheckUtils]: 7: Hoare triple {1160#true} ~cond := #in~cond; {1160#true} is VALID [2022-04-14 17:52:36,316 INFO L290 TraceCheckUtils]: 8: Hoare triple {1160#true} assume !(0 == ~cond); {1160#true} is VALID [2022-04-14 17:52:36,316 INFO L290 TraceCheckUtils]: 9: Hoare triple {1160#true} assume true; {1160#true} is VALID [2022-04-14 17:52:36,316 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1160#true} {1160#true} #53#return; {1160#true} is VALID [2022-04-14 17:52:36,317 INFO L272 TraceCheckUtils]: 11: Hoare triple {1160#true} call assume_abort_if_not((if ~k~0 <= 256 then 1 else 0)); {1160#true} is VALID [2022-04-14 17:52:36,317 INFO L290 TraceCheckUtils]: 12: Hoare triple {1160#true} ~cond := #in~cond; {1160#true} is VALID [2022-04-14 17:52:36,317 INFO L290 TraceCheckUtils]: 13: Hoare triple {1160#true} assume !(0 == ~cond); {1160#true} is VALID [2022-04-14 17:52:36,317 INFO L290 TraceCheckUtils]: 14: Hoare triple {1160#true} assume true; {1160#true} is VALID [2022-04-14 17:52:36,317 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {1160#true} {1160#true} #55#return; {1160#true} is VALID [2022-04-14 17:52:36,318 INFO L290 TraceCheckUtils]: 16: Hoare triple {1160#true} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {1213#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-14 17:52:36,318 INFO L290 TraceCheckUtils]: 17: Hoare triple {1213#(and (= main_~c~0 0) (= main_~y~0 0))} assume !false; {1213#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-14 17:52:36,318 INFO L272 TraceCheckUtils]: 18: Hoare triple {1213#(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)); {1160#true} is VALID [2022-04-14 17:52:36,318 INFO L290 TraceCheckUtils]: 19: Hoare triple {1160#true} ~cond := #in~cond; {1160#true} is VALID [2022-04-14 17:52:36,318 INFO L290 TraceCheckUtils]: 20: Hoare triple {1160#true} assume !(0 == ~cond); {1160#true} is VALID [2022-04-14 17:52:36,319 INFO L290 TraceCheckUtils]: 21: Hoare triple {1160#true} assume true; {1160#true} is VALID [2022-04-14 17:52:36,319 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {1160#true} {1213#(and (= main_~c~0 0) (= main_~y~0 0))} #57#return; {1213#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-14 17:52:36,321 INFO L290 TraceCheckUtils]: 23: Hoare triple {1213#(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; {1235#(and (= main_~y~0 1) (= main_~c~0 1))} is VALID [2022-04-14 17:52:36,321 INFO L290 TraceCheckUtils]: 24: Hoare triple {1235#(and (= main_~y~0 1) (= main_~c~0 1))} assume !false; {1235#(and (= main_~y~0 1) (= main_~c~0 1))} is VALID [2022-04-14 17:52:36,321 INFO L272 TraceCheckUtils]: 25: Hoare triple {1235#(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)); {1160#true} is VALID [2022-04-14 17:52:36,322 INFO L290 TraceCheckUtils]: 26: Hoare triple {1160#true} ~cond := #in~cond; {1160#true} is VALID [2022-04-14 17:52:36,323 INFO L290 TraceCheckUtils]: 27: Hoare triple {1160#true} assume !(0 == ~cond); {1160#true} is VALID [2022-04-14 17:52:36,323 INFO L290 TraceCheckUtils]: 28: Hoare triple {1160#true} assume true; {1160#true} is VALID [2022-04-14 17:52:36,323 INFO L284 TraceCheckUtils]: 29: Hoare quadruple {1160#true} {1235#(and (= main_~y~0 1) (= main_~c~0 1))} #57#return; {1235#(and (= main_~y~0 1) (= main_~c~0 1))} is VALID [2022-04-14 17:52:36,324 INFO L290 TraceCheckUtils]: 30: Hoare triple {1235#(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; {1257#(and (< 1 main_~k~0) (= (+ (- 1) main_~y~0) 1) (<= main_~c~0 2))} is VALID [2022-04-14 17:52:36,327 INFO L290 TraceCheckUtils]: 31: Hoare triple {1257#(and (< 1 main_~k~0) (= (+ (- 1) main_~y~0) 1) (<= main_~c~0 2))} assume !false; {1257#(and (< 1 main_~k~0) (= (+ (- 1) main_~y~0) 1) (<= main_~c~0 2))} is VALID [2022-04-14 17:52:36,327 INFO L272 TraceCheckUtils]: 32: Hoare triple {1257#(and (< 1 main_~k~0) (= (+ (- 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)); {1160#true} is VALID [2022-04-14 17:52:36,327 INFO L290 TraceCheckUtils]: 33: Hoare triple {1160#true} ~cond := #in~cond; {1160#true} is VALID [2022-04-14 17:52:36,327 INFO L290 TraceCheckUtils]: 34: Hoare triple {1160#true} assume !(0 == ~cond); {1160#true} is VALID [2022-04-14 17:52:36,327 INFO L290 TraceCheckUtils]: 35: Hoare triple {1160#true} assume true; {1160#true} is VALID [2022-04-14 17:52:36,328 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {1160#true} {1257#(and (< 1 main_~k~0) (= (+ (- 1) main_~y~0) 1) (<= main_~c~0 2))} #57#return; {1257#(and (< 1 main_~k~0) (= (+ (- 1) main_~y~0) 1) (<= main_~c~0 2))} is VALID [2022-04-14 17:52:36,328 INFO L290 TraceCheckUtils]: 37: Hoare triple {1257#(and (< 1 main_~k~0) (= (+ (- 1) main_~y~0) 1) (<= main_~c~0 2))} assume !(~c~0 < ~k~0); {1279#(and (< 1 main_~k~0) (= (+ (- 1) main_~y~0) 1) (<= main_~k~0 2))} is VALID [2022-04-14 17:52:36,328 INFO L272 TraceCheckUtils]: 38: Hoare triple {1279#(and (< 1 main_~k~0) (= (+ (- 1) main_~y~0) 1) (<= 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)); {1160#true} is VALID [2022-04-14 17:52:36,328 INFO L290 TraceCheckUtils]: 39: Hoare triple {1160#true} ~cond := #in~cond; {1160#true} is VALID [2022-04-14 17:52:36,329 INFO L290 TraceCheckUtils]: 40: Hoare triple {1160#true} assume !(0 == ~cond); {1160#true} is VALID [2022-04-14 17:52:36,329 INFO L290 TraceCheckUtils]: 41: Hoare triple {1160#true} assume true; {1160#true} is VALID [2022-04-14 17:52:36,329 INFO L284 TraceCheckUtils]: 42: Hoare quadruple {1160#true} {1279#(and (< 1 main_~k~0) (= (+ (- 1) main_~y~0) 1) (<= main_~k~0 2))} #59#return; {1279#(and (< 1 main_~k~0) (= (+ (- 1) main_~y~0) 1) (<= main_~k~0 2))} is VALID [2022-04-14 17:52:36,330 INFO L272 TraceCheckUtils]: 43: Hoare triple {1279#(and (< 1 main_~k~0) (= (+ (- 1) main_~y~0) 1) (<= main_~k~0 2))} call __VERIFIER_assert((if ~k~0 * ~y~0 == ~y~0 * ~y~0 then 1 else 0)); {1298#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-14 17:52:36,333 INFO L290 TraceCheckUtils]: 44: Hoare triple {1298#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1302#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-14 17:52:36,333 INFO L290 TraceCheckUtils]: 45: Hoare triple {1302#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1161#false} is VALID [2022-04-14 17:52:36,334 INFO L290 TraceCheckUtils]: 46: Hoare triple {1161#false} assume !false; {1161#false} is VALID [2022-04-14 17:52:36,334 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 8 proven. 9 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2022-04-14 17:52:36,334 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-14 17:52:36,602 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-14 17:52:36,602 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1269765460] [2022-04-14 17:52:36,602 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-14 17:52:36,602 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1752257083] [2022-04-14 17:52:36,602 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1752257083] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-14 17:52:36,602 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-14 17:52:36,602 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2022-04-14 17:52:36,602 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1298245050] [2022-04-14 17:52:36,602 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2022-04-14 17:52:36,603 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 5 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 5 states have call predecessors, (7), 5 states have call successors, (7) Word has length 47 [2022-04-14 17:52:36,603 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-14 17:52:36,604 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 8 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 5 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 5 states have call predecessors, (7), 5 states have call successors, (7) [2022-04-14 17:52:36,631 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 35 edges. 35 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-14 17:52:36,631 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-14 17:52:36,631 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-14 17:52:36,631 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-14 17:52:36,631 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2022-04-14 17:52:36,632 INFO L87 Difference]: Start difference. First operand 36 states and 39 transitions. Second operand has 8 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 5 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 5 states have call predecessors, (7), 5 states have call successors, (7) [2022-04-14 17:52:36,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 17:52:36,890 INFO L93 Difference]: Finished difference Result 45 states and 50 transitions. [2022-04-14 17:52:36,890 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-14 17:52:36,890 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 5 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 5 states have call predecessors, (7), 5 states have call successors, (7) Word has length 47 [2022-04-14 17:52:36,891 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-14 17:52:36,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 5 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 5 states have call predecessors, (7), 5 states have call successors, (7) [2022-04-14 17:52:36,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 46 transitions. [2022-04-14 17:52:36,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 5 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 5 states have call predecessors, (7), 5 states have call successors, (7) [2022-04-14 17:52:36,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 46 transitions. [2022-04-14 17:52:36,893 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 46 transitions. [2022-04-14 17:52:36,927 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 46 edges. 46 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-14 17:52:36,928 INFO L225 Difference]: With dead ends: 45 [2022-04-14 17:52:36,928 INFO L226 Difference]: Without dead ends: 39 [2022-04-14 17:52:36,928 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 54 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-14 17:52:36,929 INFO L913 BasicCegarLoop]: 33 mSDtfsCounter, 2 mSDsluCounter, 133 mSDsCounter, 0 mSdLazyCounter, 87 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 166 SdHoareTripleChecker+Invalid, 88 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 87 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-14 17:52:36,929 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [2 Valid, 166 Invalid, 88 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 87 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-14 17:52:36,929 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2022-04-14 17:52:36,937 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2022-04-14 17:52:36,937 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-14 17:52:36,938 INFO L82 GeneralOperation]: Start isEquivalent. First operand 39 states. Second operand has 39 states, 24 states have (on average 1.0416666666666667) internal successors, (25), 24 states have internal predecessors, (25), 10 states have call successors, (10), 6 states have call predecessors, (10), 4 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-14 17:52:36,938 INFO L74 IsIncluded]: Start isIncluded. First operand 39 states. Second operand has 39 states, 24 states have (on average 1.0416666666666667) internal successors, (25), 24 states have internal predecessors, (25), 10 states have call successors, (10), 6 states have call predecessors, (10), 4 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-14 17:52:36,938 INFO L87 Difference]: Start difference. First operand 39 states. Second operand has 39 states, 24 states have (on average 1.0416666666666667) internal successors, (25), 24 states have internal predecessors, (25), 10 states have call successors, (10), 6 states have call predecessors, (10), 4 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-14 17:52:36,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 17:52:36,940 INFO L93 Difference]: Finished difference Result 39 states and 43 transitions. [2022-04-14 17:52:36,940 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 43 transitions. [2022-04-14 17:52:36,940 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 17:52:36,940 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 17:52:36,940 INFO L74 IsIncluded]: Start isIncluded. First operand has 39 states, 24 states have (on average 1.0416666666666667) internal successors, (25), 24 states have internal predecessors, (25), 10 states have call successors, (10), 6 states have call predecessors, (10), 4 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Second operand 39 states. [2022-04-14 17:52:36,940 INFO L87 Difference]: Start difference. First operand has 39 states, 24 states have (on average 1.0416666666666667) internal successors, (25), 24 states have internal predecessors, (25), 10 states have call successors, (10), 6 states have call predecessors, (10), 4 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Second operand 39 states. [2022-04-14 17:52:36,942 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 17:52:36,942 INFO L93 Difference]: Finished difference Result 39 states and 43 transitions. [2022-04-14 17:52:36,942 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 43 transitions. [2022-04-14 17:52:36,942 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 17:52:36,942 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 17:52:36,942 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-14 17:52:36,942 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-14 17:52:36,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 24 states have (on average 1.0416666666666667) internal successors, (25), 24 states have internal predecessors, (25), 10 states have call successors, (10), 6 states have call predecessors, (10), 4 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-14 17:52:36,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 43 transitions. [2022-04-14 17:52:36,943 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 43 transitions. Word has length 47 [2022-04-14 17:52:36,944 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-14 17:52:36,944 INFO L478 AbstractCegarLoop]: Abstraction has 39 states and 43 transitions. [2022-04-14 17:52:36,944 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 5 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 5 states have call predecessors, (7), 5 states have call successors, (7) [2022-04-14 17:52:36,944 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 43 transitions. [2022-04-14 17:52:36,945 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2022-04-14 17:52:36,945 INFO L491 BasicCegarLoop]: Found error trace [2022-04-14 17:52:36,945 INFO L499 BasicCegarLoop]: trace histogram [6, 5, 5, 4, 4, 4, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-14 17:52:36,955 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-14 17:52:37,149 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-14 17:52:37,151 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-14 17:52:37,151 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-14 17:52:37,151 INFO L85 PathProgramCache]: Analyzing trace with hash -1213805219, now seen corresponding path program 3 times [2022-04-14 17:52:37,151 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-14 17:52:37,151 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [753563130] [2022-04-14 17:52:37,152 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 17:52:37,152 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-14 17:52:37,162 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-14 17:52:37,162 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1316929114] [2022-04-14 17:52:37,162 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-04-14 17:52:37,162 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-14 17:52:37,162 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-14 17:52:37,163 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-14 17:52:37,164 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-14 17:52:37,250 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2022-04-14 17:52:37,250 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-14 17:52:37,251 INFO L263 TraceCheckSpWp]: Trace formula consists of 147 conjuncts, 20 conjunts are in the unsatisfiable core [2022-04-14 17:52:37,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 17:52:37,266 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-14 17:52:37,620 INFO L272 TraceCheckUtils]: 0: Hoare triple {1574#true} call ULTIMATE.init(); {1574#true} is VALID [2022-04-14 17:52:37,620 INFO L290 TraceCheckUtils]: 1: Hoare triple {1574#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); {1574#true} is VALID [2022-04-14 17:52:37,620 INFO L290 TraceCheckUtils]: 2: Hoare triple {1574#true} assume true; {1574#true} is VALID [2022-04-14 17:52:37,620 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1574#true} {1574#true} #63#return; {1574#true} is VALID [2022-04-14 17:52:37,620 INFO L272 TraceCheckUtils]: 4: Hoare triple {1574#true} call #t~ret5 := main(); {1574#true} is VALID [2022-04-14 17:52:37,620 INFO L290 TraceCheckUtils]: 5: Hoare triple {1574#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; {1574#true} is VALID [2022-04-14 17:52:37,621 INFO L272 TraceCheckUtils]: 6: Hoare triple {1574#true} call assume_abort_if_not((if ~k~0 >= 0 && ~k~0 <= 20 then 1 else 0)); {1574#true} is VALID [2022-04-14 17:52:37,621 INFO L290 TraceCheckUtils]: 7: Hoare triple {1574#true} ~cond := #in~cond; {1574#true} is VALID [2022-04-14 17:52:37,621 INFO L290 TraceCheckUtils]: 8: Hoare triple {1574#true} assume !(0 == ~cond); {1574#true} is VALID [2022-04-14 17:52:37,621 INFO L290 TraceCheckUtils]: 9: Hoare triple {1574#true} assume true; {1574#true} is VALID [2022-04-14 17:52:37,621 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1574#true} {1574#true} #53#return; {1574#true} is VALID [2022-04-14 17:52:37,621 INFO L272 TraceCheckUtils]: 11: Hoare triple {1574#true} call assume_abort_if_not((if ~k~0 <= 256 then 1 else 0)); {1574#true} is VALID [2022-04-14 17:52:37,621 INFO L290 TraceCheckUtils]: 12: Hoare triple {1574#true} ~cond := #in~cond; {1574#true} is VALID [2022-04-14 17:52:37,621 INFO L290 TraceCheckUtils]: 13: Hoare triple {1574#true} assume !(0 == ~cond); {1574#true} is VALID [2022-04-14 17:52:37,621 INFO L290 TraceCheckUtils]: 14: Hoare triple {1574#true} assume true; {1574#true} is VALID [2022-04-14 17:52:37,621 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {1574#true} {1574#true} #55#return; {1574#true} is VALID [2022-04-14 17:52:37,622 INFO L290 TraceCheckUtils]: 16: Hoare triple {1574#true} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {1627#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-14 17:52:37,622 INFO L290 TraceCheckUtils]: 17: Hoare triple {1627#(and (= main_~c~0 0) (= main_~y~0 0))} assume !false; {1627#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-14 17:52:37,622 INFO L272 TraceCheckUtils]: 18: Hoare triple {1627#(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)); {1574#true} is VALID [2022-04-14 17:52:37,622 INFO L290 TraceCheckUtils]: 19: Hoare triple {1574#true} ~cond := #in~cond; {1574#true} is VALID [2022-04-14 17:52:37,622 INFO L290 TraceCheckUtils]: 20: Hoare triple {1574#true} assume !(0 == ~cond); {1574#true} is VALID [2022-04-14 17:52:37,622 INFO L290 TraceCheckUtils]: 21: Hoare triple {1574#true} assume true; {1574#true} is VALID [2022-04-14 17:52:37,623 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {1574#true} {1627#(and (= main_~c~0 0) (= main_~y~0 0))} #57#return; {1627#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-14 17:52:37,624 INFO L290 TraceCheckUtils]: 23: Hoare triple {1627#(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; {1649#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} is VALID [2022-04-14 17:52:37,624 INFO L290 TraceCheckUtils]: 24: Hoare triple {1649#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} assume !false; {1649#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} is VALID [2022-04-14 17:52:37,624 INFO L272 TraceCheckUtils]: 25: Hoare triple {1649#(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)); {1574#true} is VALID [2022-04-14 17:52:37,624 INFO L290 TraceCheckUtils]: 26: Hoare triple {1574#true} ~cond := #in~cond; {1574#true} is VALID [2022-04-14 17:52:37,624 INFO L290 TraceCheckUtils]: 27: Hoare triple {1574#true} assume !(0 == ~cond); {1574#true} is VALID [2022-04-14 17:52:37,624 INFO L290 TraceCheckUtils]: 28: Hoare triple {1574#true} assume true; {1574#true} is VALID [2022-04-14 17:52:37,625 INFO L284 TraceCheckUtils]: 29: Hoare quadruple {1574#true} {1649#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} #57#return; {1649#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} is VALID [2022-04-14 17:52:37,625 INFO L290 TraceCheckUtils]: 30: Hoare triple {1649#(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; {1671#(and (= (+ (- 2) main_~y~0) 0) (= 0 (+ (- 2) main_~c~0)))} is VALID [2022-04-14 17:52:37,625 INFO L290 TraceCheckUtils]: 31: Hoare triple {1671#(and (= (+ (- 2) main_~y~0) 0) (= 0 (+ (- 2) main_~c~0)))} assume !false; {1671#(and (= (+ (- 2) main_~y~0) 0) (= 0 (+ (- 2) main_~c~0)))} is VALID [2022-04-14 17:52:37,626 INFO L272 TraceCheckUtils]: 32: Hoare triple {1671#(and (= (+ (- 2) main_~y~0) 0) (= 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)); {1574#true} is VALID [2022-04-14 17:52:37,626 INFO L290 TraceCheckUtils]: 33: Hoare triple {1574#true} ~cond := #in~cond; {1574#true} is VALID [2022-04-14 17:52:37,626 INFO L290 TraceCheckUtils]: 34: Hoare triple {1574#true} assume !(0 == ~cond); {1574#true} is VALID [2022-04-14 17:52:37,626 INFO L290 TraceCheckUtils]: 35: Hoare triple {1574#true} assume true; {1574#true} is VALID [2022-04-14 17:52:37,626 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {1574#true} {1671#(and (= (+ (- 2) main_~y~0) 0) (= 0 (+ (- 2) main_~c~0)))} #57#return; {1671#(and (= (+ (- 2) main_~y~0) 0) (= 0 (+ (- 2) main_~c~0)))} is VALID [2022-04-14 17:52:37,627 INFO L290 TraceCheckUtils]: 37: Hoare triple {1671#(and (= (+ (- 2) main_~y~0) 0) (= 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; {1693#(and (<= main_~c~0 3) (= (+ main_~y~0 (- 3)) 0) (< 2 main_~k~0))} is VALID [2022-04-14 17:52:37,627 INFO L290 TraceCheckUtils]: 38: Hoare triple {1693#(and (<= main_~c~0 3) (= (+ main_~y~0 (- 3)) 0) (< 2 main_~k~0))} assume !false; {1693#(and (<= main_~c~0 3) (= (+ main_~y~0 (- 3)) 0) (< 2 main_~k~0))} is VALID [2022-04-14 17:52:37,627 INFO L272 TraceCheckUtils]: 39: Hoare triple {1693#(and (<= main_~c~0 3) (= (+ main_~y~0 (- 3)) 0) (< 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)); {1574#true} is VALID [2022-04-14 17:52:37,627 INFO L290 TraceCheckUtils]: 40: Hoare triple {1574#true} ~cond := #in~cond; {1574#true} is VALID [2022-04-14 17:52:37,627 INFO L290 TraceCheckUtils]: 41: Hoare triple {1574#true} assume !(0 == ~cond); {1574#true} is VALID [2022-04-14 17:52:37,627 INFO L290 TraceCheckUtils]: 42: Hoare triple {1574#true} assume true; {1574#true} is VALID [2022-04-14 17:52:37,628 INFO L284 TraceCheckUtils]: 43: Hoare quadruple {1574#true} {1693#(and (<= main_~c~0 3) (= (+ main_~y~0 (- 3)) 0) (< 2 main_~k~0))} #57#return; {1693#(and (<= main_~c~0 3) (= (+ main_~y~0 (- 3)) 0) (< 2 main_~k~0))} is VALID [2022-04-14 17:52:37,628 INFO L290 TraceCheckUtils]: 44: Hoare triple {1693#(and (<= main_~c~0 3) (= (+ main_~y~0 (- 3)) 0) (< 2 main_~k~0))} assume !(~c~0 < ~k~0); {1715#(and (<= main_~k~0 3) (= (+ main_~y~0 (- 3)) 0) (< 2 main_~k~0))} is VALID [2022-04-14 17:52:37,628 INFO L272 TraceCheckUtils]: 45: Hoare triple {1715#(and (<= main_~k~0 3) (= (+ main_~y~0 (- 3)) 0) (< 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)); {1574#true} is VALID [2022-04-14 17:52:37,628 INFO L290 TraceCheckUtils]: 46: Hoare triple {1574#true} ~cond := #in~cond; {1574#true} is VALID [2022-04-14 17:52:37,629 INFO L290 TraceCheckUtils]: 47: Hoare triple {1574#true} assume !(0 == ~cond); {1574#true} is VALID [2022-04-14 17:52:37,629 INFO L290 TraceCheckUtils]: 48: Hoare triple {1574#true} assume true; {1574#true} is VALID [2022-04-14 17:52:37,629 INFO L284 TraceCheckUtils]: 49: Hoare quadruple {1574#true} {1715#(and (<= main_~k~0 3) (= (+ main_~y~0 (- 3)) 0) (< 2 main_~k~0))} #59#return; {1715#(and (<= main_~k~0 3) (= (+ main_~y~0 (- 3)) 0) (< 2 main_~k~0))} is VALID [2022-04-14 17:52:37,631 INFO L272 TraceCheckUtils]: 50: Hoare triple {1715#(and (<= main_~k~0 3) (= (+ main_~y~0 (- 3)) 0) (< 2 main_~k~0))} call __VERIFIER_assert((if ~k~0 * ~y~0 == ~y~0 * ~y~0 then 1 else 0)); {1734#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-14 17:52:37,631 INFO L290 TraceCheckUtils]: 51: Hoare triple {1734#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1738#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-14 17:52:37,631 INFO L290 TraceCheckUtils]: 52: Hoare triple {1738#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1575#false} is VALID [2022-04-14 17:52:37,631 INFO L290 TraceCheckUtils]: 53: Hoare triple {1575#false} assume !false; {1575#false} is VALID [2022-04-14 17:52:37,632 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 10 proven. 18 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2022-04-14 17:52:37,632 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-14 17:52:37,864 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-14 17:52:37,865 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [753563130] [2022-04-14 17:52:37,865 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-14 17:52:37,865 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1316929114] [2022-04-14 17:52:37,865 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1316929114] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-14 17:52:37,865 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-14 17:52:37,865 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2022-04-14 17:52:37,865 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1977753148] [2022-04-14 17:52:37,865 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2022-04-14 17:52:37,866 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 6 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (8), 6 states have call predecessors, (8), 6 states have call successors, (8) Word has length 54 [2022-04-14 17:52:37,866 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-14 17:52:37,866 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 9 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 6 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (8), 6 states have call predecessors, (8), 6 states have call successors, (8) [2022-04-14 17:52:37,892 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 39 edges. 39 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-14 17:52:37,892 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-04-14 17:52:37,892 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-14 17:52:37,893 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-04-14 17:52:37,893 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2022-04-14 17:52:37,893 INFO L87 Difference]: Start difference. First operand 39 states and 43 transitions. Second operand has 9 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 6 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (8), 6 states have call predecessors, (8), 6 states have call successors, (8) [2022-04-14 17:52:38,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 17:52:38,217 INFO L93 Difference]: Finished difference Result 48 states and 54 transitions. [2022-04-14 17:52:38,217 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-14 17:52:38,217 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 6 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (8), 6 states have call predecessors, (8), 6 states have call successors, (8) Word has length 54 [2022-04-14 17:52:38,218 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-14 17:52:38,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 6 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (8), 6 states have call predecessors, (8), 6 states have call successors, (8) [2022-04-14 17:52:38,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 50 transitions. [2022-04-14 17:52:38,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 6 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (8), 6 states have call predecessors, (8), 6 states have call successors, (8) [2022-04-14 17:52:38,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 50 transitions. [2022-04-14 17:52:38,220 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 9 states and 50 transitions. [2022-04-14 17:52:38,258 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 50 edges. 50 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-14 17:52:38,259 INFO L225 Difference]: With dead ends: 48 [2022-04-14 17:52:38,259 INFO L226 Difference]: Without dead ends: 42 [2022-04-14 17:52:38,260 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 60 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-14 17:52:38,260 INFO L913 BasicCegarLoop]: 36 mSDtfsCounter, 2 mSDsluCounter, 163 mSDsCounter, 0 mSdLazyCounter, 121 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 199 SdHoareTripleChecker+Invalid, 122 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 121 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-14 17:52:38,261 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [2 Valid, 199 Invalid, 122 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 121 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-14 17:52:38,261 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2022-04-14 17:52:38,271 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2022-04-14 17:52:38,271 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-14 17:52:38,272 INFO L82 GeneralOperation]: Start isEquivalent. First operand 42 states. Second operand has 42 states, 26 states have (on average 1.0384615384615385) internal successors, (27), 26 states have internal predecessors, (27), 11 states have call successors, (11), 6 states have call predecessors, (11), 4 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-14 17:52:38,272 INFO L74 IsIncluded]: Start isIncluded. First operand 42 states. Second operand has 42 states, 26 states have (on average 1.0384615384615385) internal successors, (27), 26 states have internal predecessors, (27), 11 states have call successors, (11), 6 states have call predecessors, (11), 4 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-14 17:52:38,272 INFO L87 Difference]: Start difference. First operand 42 states. Second operand has 42 states, 26 states have (on average 1.0384615384615385) internal successors, (27), 26 states have internal predecessors, (27), 11 states have call successors, (11), 6 states have call predecessors, (11), 4 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-14 17:52:38,273 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 17:52:38,273 INFO L93 Difference]: Finished difference Result 42 states and 47 transitions. [2022-04-14 17:52:38,274 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 47 transitions. [2022-04-14 17:52:38,274 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 17:52:38,274 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 17:52:38,274 INFO L74 IsIncluded]: Start isIncluded. First operand has 42 states, 26 states have (on average 1.0384615384615385) internal successors, (27), 26 states have internal predecessors, (27), 11 states have call successors, (11), 6 states have call predecessors, (11), 4 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) Second operand 42 states. [2022-04-14 17:52:38,274 INFO L87 Difference]: Start difference. First operand has 42 states, 26 states have (on average 1.0384615384615385) internal successors, (27), 26 states have internal predecessors, (27), 11 states have call successors, (11), 6 states have call predecessors, (11), 4 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) Second operand 42 states. [2022-04-14 17:52:38,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 17:52:38,276 INFO L93 Difference]: Finished difference Result 42 states and 47 transitions. [2022-04-14 17:52:38,276 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 47 transitions. [2022-04-14 17:52:38,276 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 17:52:38,276 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 17:52:38,276 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-14 17:52:38,276 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-14 17:52:38,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 26 states have (on average 1.0384615384615385) internal successors, (27), 26 states have internal predecessors, (27), 11 states have call successors, (11), 6 states have call predecessors, (11), 4 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-14 17:52:38,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 47 transitions. [2022-04-14 17:52:38,278 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 47 transitions. Word has length 54 [2022-04-14 17:52:38,278 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-14 17:52:38,278 INFO L478 AbstractCegarLoop]: Abstraction has 42 states and 47 transitions. [2022-04-14 17:52:38,278 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 6 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (8), 6 states have call predecessors, (8), 6 states have call successors, (8) [2022-04-14 17:52:38,278 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 47 transitions. [2022-04-14 17:52:38,278 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2022-04-14 17:52:38,279 INFO L491 BasicCegarLoop]: Found error trace [2022-04-14 17:52:38,279 INFO L499 BasicCegarLoop]: trace histogram [7, 6, 6, 5, 5, 5, 4, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-14 17:52:38,283 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-14 17:52:38,483 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-14 17:52:38,483 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-14 17:52:38,483 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-14 17:52:38,483 INFO L85 PathProgramCache]: Analyzing trace with hash 307258797, now seen corresponding path program 4 times [2022-04-14 17:52:38,483 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-14 17:52:38,483 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1559378450] [2022-04-14 17:52:38,484 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 17:52:38,484 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-14 17:52:38,493 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-14 17:52:38,493 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [179322914] [2022-04-14 17:52:38,494 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-14 17:52:38,494 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-14 17:52:38,494 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-14 17:52:38,495 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-14 17:52:38,496 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-14 17:52:38,527 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-14 17:52:38,527 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-14 17:52:38,528 INFO L263 TraceCheckSpWp]: Trace formula consists of 105 conjuncts, 24 conjunts are in the unsatisfiable core [2022-04-14 17:52:38,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 17:52:38,539 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-14 17:52:38,857 INFO L272 TraceCheckUtils]: 0: Hoare triple {2026#true} call ULTIMATE.init(); {2026#true} is VALID [2022-04-14 17:52:38,857 INFO L290 TraceCheckUtils]: 1: Hoare triple {2026#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); {2026#true} is VALID [2022-04-14 17:52:38,857 INFO L290 TraceCheckUtils]: 2: Hoare triple {2026#true} assume true; {2026#true} is VALID [2022-04-14 17:52:38,857 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2026#true} {2026#true} #63#return; {2026#true} is VALID [2022-04-14 17:52:38,857 INFO L272 TraceCheckUtils]: 4: Hoare triple {2026#true} call #t~ret5 := main(); {2026#true} is VALID [2022-04-14 17:52:38,857 INFO L290 TraceCheckUtils]: 5: Hoare triple {2026#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; {2026#true} is VALID [2022-04-14 17:52:38,857 INFO L272 TraceCheckUtils]: 6: Hoare triple {2026#true} call assume_abort_if_not((if ~k~0 >= 0 && ~k~0 <= 20 then 1 else 0)); {2026#true} is VALID [2022-04-14 17:52:38,857 INFO L290 TraceCheckUtils]: 7: Hoare triple {2026#true} ~cond := #in~cond; {2026#true} is VALID [2022-04-14 17:52:38,858 INFO L290 TraceCheckUtils]: 8: Hoare triple {2026#true} assume !(0 == ~cond); {2026#true} is VALID [2022-04-14 17:52:38,858 INFO L290 TraceCheckUtils]: 9: Hoare triple {2026#true} assume true; {2026#true} is VALID [2022-04-14 17:52:38,858 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {2026#true} {2026#true} #53#return; {2026#true} is VALID [2022-04-14 17:52:38,858 INFO L272 TraceCheckUtils]: 11: Hoare triple {2026#true} call assume_abort_if_not((if ~k~0 <= 256 then 1 else 0)); {2026#true} is VALID [2022-04-14 17:52:38,858 INFO L290 TraceCheckUtils]: 12: Hoare triple {2026#true} ~cond := #in~cond; {2026#true} is VALID [2022-04-14 17:52:38,858 INFO L290 TraceCheckUtils]: 13: Hoare triple {2026#true} assume !(0 == ~cond); {2026#true} is VALID [2022-04-14 17:52:38,858 INFO L290 TraceCheckUtils]: 14: Hoare triple {2026#true} assume true; {2026#true} is VALID [2022-04-14 17:52:38,858 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {2026#true} {2026#true} #55#return; {2026#true} is VALID [2022-04-14 17:52:38,860 INFO L290 TraceCheckUtils]: 16: Hoare triple {2026#true} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {2079#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-14 17:52:38,860 INFO L290 TraceCheckUtils]: 17: Hoare triple {2079#(and (= main_~c~0 0) (= main_~y~0 0))} assume !false; {2079#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-14 17:52:38,860 INFO L272 TraceCheckUtils]: 18: Hoare triple {2079#(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)); {2026#true} is VALID [2022-04-14 17:52:38,860 INFO L290 TraceCheckUtils]: 19: Hoare triple {2026#true} ~cond := #in~cond; {2026#true} is VALID [2022-04-14 17:52:38,860 INFO L290 TraceCheckUtils]: 20: Hoare triple {2026#true} assume !(0 == ~cond); {2026#true} is VALID [2022-04-14 17:52:38,860 INFO L290 TraceCheckUtils]: 21: Hoare triple {2026#true} assume true; {2026#true} is VALID [2022-04-14 17:52:38,861 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {2026#true} {2079#(and (= main_~c~0 0) (= main_~y~0 0))} #57#return; {2079#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-14 17:52:38,862 INFO L290 TraceCheckUtils]: 23: Hoare triple {2079#(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; {2101#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} is VALID [2022-04-14 17:52:38,862 INFO L290 TraceCheckUtils]: 24: Hoare triple {2101#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} assume !false; {2101#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} is VALID [2022-04-14 17:52:38,862 INFO L272 TraceCheckUtils]: 25: Hoare triple {2101#(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)); {2026#true} is VALID [2022-04-14 17:52:38,862 INFO L290 TraceCheckUtils]: 26: Hoare triple {2026#true} ~cond := #in~cond; {2026#true} is VALID [2022-04-14 17:52:38,862 INFO L290 TraceCheckUtils]: 27: Hoare triple {2026#true} assume !(0 == ~cond); {2026#true} is VALID [2022-04-14 17:52:38,862 INFO L290 TraceCheckUtils]: 28: Hoare triple {2026#true} assume true; {2026#true} is VALID [2022-04-14 17:52:38,863 INFO L284 TraceCheckUtils]: 29: Hoare quadruple {2026#true} {2101#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} #57#return; {2101#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} is VALID [2022-04-14 17:52:38,863 INFO L290 TraceCheckUtils]: 30: Hoare triple {2101#(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; {2123#(and (= (+ (- 1) main_~y~0) 1) (= 0 (+ (- 2) main_~c~0)))} is VALID [2022-04-14 17:52:38,863 INFO L290 TraceCheckUtils]: 31: Hoare triple {2123#(and (= (+ (- 1) main_~y~0) 1) (= 0 (+ (- 2) main_~c~0)))} assume !false; {2123#(and (= (+ (- 1) main_~y~0) 1) (= 0 (+ (- 2) main_~c~0)))} is VALID [2022-04-14 17:52:38,864 INFO L272 TraceCheckUtils]: 32: Hoare triple {2123#(and (= (+ (- 1) main_~y~0) 1) (= 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)); {2026#true} is VALID [2022-04-14 17:52:38,864 INFO L290 TraceCheckUtils]: 33: Hoare triple {2026#true} ~cond := #in~cond; {2026#true} is VALID [2022-04-14 17:52:38,864 INFO L290 TraceCheckUtils]: 34: Hoare triple {2026#true} assume !(0 == ~cond); {2026#true} is VALID [2022-04-14 17:52:38,864 INFO L290 TraceCheckUtils]: 35: Hoare triple {2026#true} assume true; {2026#true} is VALID [2022-04-14 17:52:38,864 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {2026#true} {2123#(and (= (+ (- 1) main_~y~0) 1) (= 0 (+ (- 2) main_~c~0)))} #57#return; {2123#(and (= (+ (- 1) main_~y~0) 1) (= 0 (+ (- 2) main_~c~0)))} is VALID [2022-04-14 17:52:38,865 INFO L290 TraceCheckUtils]: 37: Hoare triple {2123#(and (= (+ (- 1) main_~y~0) 1) (= 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; {2145#(and (= (+ (- 2) main_~y~0) 1) (= (+ main_~c~0 (- 3)) 0))} is VALID [2022-04-14 17:52:38,865 INFO L290 TraceCheckUtils]: 38: Hoare triple {2145#(and (= (+ (- 2) main_~y~0) 1) (= (+ main_~c~0 (- 3)) 0))} assume !false; {2145#(and (= (+ (- 2) main_~y~0) 1) (= (+ main_~c~0 (- 3)) 0))} is VALID [2022-04-14 17:52:38,865 INFO L272 TraceCheckUtils]: 39: Hoare triple {2145#(and (= (+ (- 2) main_~y~0) 1) (= (+ main_~c~0 (- 3)) 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)); {2026#true} is VALID [2022-04-14 17:52:38,865 INFO L290 TraceCheckUtils]: 40: Hoare triple {2026#true} ~cond := #in~cond; {2026#true} is VALID [2022-04-14 17:52:38,865 INFO L290 TraceCheckUtils]: 41: Hoare triple {2026#true} assume !(0 == ~cond); {2026#true} is VALID [2022-04-14 17:52:38,865 INFO L290 TraceCheckUtils]: 42: Hoare triple {2026#true} assume true; {2026#true} is VALID [2022-04-14 17:52:38,866 INFO L284 TraceCheckUtils]: 43: Hoare quadruple {2026#true} {2145#(and (= (+ (- 2) main_~y~0) 1) (= (+ main_~c~0 (- 3)) 0))} #57#return; {2145#(and (= (+ (- 2) main_~y~0) 1) (= (+ main_~c~0 (- 3)) 0))} is VALID [2022-04-14 17:52:38,866 INFO L290 TraceCheckUtils]: 44: Hoare triple {2145#(and (= (+ (- 2) main_~y~0) 1) (= (+ main_~c~0 (- 3)) 0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {2167#(and (= main_~y~0 4) (< 3 main_~k~0) (<= main_~c~0 4))} is VALID [2022-04-14 17:52:38,867 INFO L290 TraceCheckUtils]: 45: Hoare triple {2167#(and (= main_~y~0 4) (< 3 main_~k~0) (<= main_~c~0 4))} assume !false; {2167#(and (= main_~y~0 4) (< 3 main_~k~0) (<= main_~c~0 4))} is VALID [2022-04-14 17:52:38,867 INFO L272 TraceCheckUtils]: 46: Hoare triple {2167#(and (= main_~y~0 4) (< 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)); {2026#true} is VALID [2022-04-14 17:52:38,867 INFO L290 TraceCheckUtils]: 47: Hoare triple {2026#true} ~cond := #in~cond; {2026#true} is VALID [2022-04-14 17:52:38,867 INFO L290 TraceCheckUtils]: 48: Hoare triple {2026#true} assume !(0 == ~cond); {2026#true} is VALID [2022-04-14 17:52:38,867 INFO L290 TraceCheckUtils]: 49: Hoare triple {2026#true} assume true; {2026#true} is VALID [2022-04-14 17:52:38,867 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {2026#true} {2167#(and (= main_~y~0 4) (< 3 main_~k~0) (<= main_~c~0 4))} #57#return; {2167#(and (= main_~y~0 4) (< 3 main_~k~0) (<= main_~c~0 4))} is VALID [2022-04-14 17:52:38,869 INFO L290 TraceCheckUtils]: 51: Hoare triple {2167#(and (= main_~y~0 4) (< 3 main_~k~0) (<= main_~c~0 4))} assume !(~c~0 < ~k~0); {2189#(and (= main_~y~0 4) (< 3 main_~k~0) (<= main_~k~0 4))} is VALID [2022-04-14 17:52:38,869 INFO L272 TraceCheckUtils]: 52: Hoare triple {2189#(and (= main_~y~0 4) (< 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)); {2026#true} is VALID [2022-04-14 17:52:38,869 INFO L290 TraceCheckUtils]: 53: Hoare triple {2026#true} ~cond := #in~cond; {2026#true} is VALID [2022-04-14 17:52:38,869 INFO L290 TraceCheckUtils]: 54: Hoare triple {2026#true} assume !(0 == ~cond); {2026#true} is VALID [2022-04-14 17:52:38,869 INFO L290 TraceCheckUtils]: 55: Hoare triple {2026#true} assume true; {2026#true} is VALID [2022-04-14 17:52:38,869 INFO L284 TraceCheckUtils]: 56: Hoare quadruple {2026#true} {2189#(and (= main_~y~0 4) (< 3 main_~k~0) (<= main_~k~0 4))} #59#return; {2189#(and (= main_~y~0 4) (< 3 main_~k~0) (<= main_~k~0 4))} is VALID [2022-04-14 17:52:38,870 INFO L272 TraceCheckUtils]: 57: Hoare triple {2189#(and (= main_~y~0 4) (< 3 main_~k~0) (<= main_~k~0 4))} call __VERIFIER_assert((if ~k~0 * ~y~0 == ~y~0 * ~y~0 then 1 else 0)); {2208#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-14 17:52:38,870 INFO L290 TraceCheckUtils]: 58: Hoare triple {2208#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {2212#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-14 17:52:38,871 INFO L290 TraceCheckUtils]: 59: Hoare triple {2212#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {2027#false} is VALID [2022-04-14 17:52:38,871 INFO L290 TraceCheckUtils]: 60: Hoare triple {2027#false} assume !false; {2027#false} is VALID [2022-04-14 17:52:38,871 INFO L134 CoverageAnalysis]: Checked inductivity of 106 backedges. 12 proven. 30 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2022-04-14 17:52:38,871 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-14 17:52:39,115 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-14 17:52:39,115 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1559378450] [2022-04-14 17:52:39,115 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-14 17:52:39,115 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [179322914] [2022-04-14 17:52:39,115 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [179322914] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-14 17:52:39,115 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-14 17:52:39,115 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2022-04-14 17:52:39,115 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [25820900] [2022-04-14 17:52:39,115 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2022-04-14 17:52:39,116 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 2.5555555555555554) internal successors, (23), 9 states have internal predecessors, (23), 7 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (9), 7 states have call predecessors, (9), 7 states have call successors, (9) Word has length 61 [2022-04-14 17:52:39,116 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-14 17:52:39,116 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 10 states, 9 states have (on average 2.5555555555555554) internal successors, (23), 9 states have internal predecessors, (23), 7 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (9), 7 states have call predecessors, (9), 7 states have call successors, (9) [2022-04-14 17:52:39,146 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 43 edges. 43 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-14 17:52:39,147 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-04-14 17:52:39,147 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-14 17:52:39,147 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-04-14 17:52:39,147 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2022-04-14 17:52:39,147 INFO L87 Difference]: Start difference. First operand 42 states and 47 transitions. Second operand has 10 states, 9 states have (on average 2.5555555555555554) internal successors, (23), 9 states have internal predecessors, (23), 7 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (9), 7 states have call predecessors, (9), 7 states have call successors, (9) [2022-04-14 17:52:39,539 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 17:52:39,539 INFO L93 Difference]: Finished difference Result 51 states and 58 transitions. [2022-04-14 17:52:39,539 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-04-14 17:52:39,539 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 2.5555555555555554) internal successors, (23), 9 states have internal predecessors, (23), 7 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (9), 7 states have call predecessors, (9), 7 states have call successors, (9) Word has length 61 [2022-04-14 17:52:39,539 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-14 17:52:39,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 9 states have (on average 2.5555555555555554) internal successors, (23), 9 states have internal predecessors, (23), 7 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (9), 7 states have call predecessors, (9), 7 states have call successors, (9) [2022-04-14 17:52:39,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 54 transitions. [2022-04-14 17:52:39,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 9 states have (on average 2.5555555555555554) internal successors, (23), 9 states have internal predecessors, (23), 7 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (9), 7 states have call predecessors, (9), 7 states have call successors, (9) [2022-04-14 17:52:39,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 54 transitions. [2022-04-14 17:52:39,542 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 10 states and 54 transitions. [2022-04-14 17:52:39,588 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 54 edges. 54 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-14 17:52:39,589 INFO L225 Difference]: With dead ends: 51 [2022-04-14 17:52:39,589 INFO L226 Difference]: Without dead ends: 45 [2022-04-14 17:52:39,589 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 66 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=167, Unknown=0, NotChecked=0, Total=210 [2022-04-14 17:52:39,590 INFO L913 BasicCegarLoop]: 39 mSDtfsCounter, 2 mSDsluCounter, 195 mSDsCounter, 0 mSdLazyCounter, 161 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 234 SdHoareTripleChecker+Invalid, 162 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 161 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-14 17:52:39,590 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [2 Valid, 234 Invalid, 162 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 161 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-14 17:52:39,590 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2022-04-14 17:52:39,602 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2022-04-14 17:52:39,603 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-14 17:52:39,603 INFO L82 GeneralOperation]: Start isEquivalent. First operand 45 states. Second operand has 45 states, 28 states have (on average 1.0357142857142858) internal successors, (29), 28 states have internal predecessors, (29), 12 states have call successors, (12), 6 states have call predecessors, (12), 4 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-14 17:52:39,603 INFO L74 IsIncluded]: Start isIncluded. First operand 45 states. Second operand has 45 states, 28 states have (on average 1.0357142857142858) internal successors, (29), 28 states have internal predecessors, (29), 12 states have call successors, (12), 6 states have call predecessors, (12), 4 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-14 17:52:39,603 INFO L87 Difference]: Start difference. First operand 45 states. Second operand has 45 states, 28 states have (on average 1.0357142857142858) internal successors, (29), 28 states have internal predecessors, (29), 12 states have call successors, (12), 6 states have call predecessors, (12), 4 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-14 17:52:39,604 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 17:52:39,605 INFO L93 Difference]: Finished difference Result 45 states and 51 transitions. [2022-04-14 17:52:39,605 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 51 transitions. [2022-04-14 17:52:39,605 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 17:52:39,605 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 17:52:39,605 INFO L74 IsIncluded]: Start isIncluded. First operand has 45 states, 28 states have (on average 1.0357142857142858) internal successors, (29), 28 states have internal predecessors, (29), 12 states have call successors, (12), 6 states have call predecessors, (12), 4 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) Second operand 45 states. [2022-04-14 17:52:39,605 INFO L87 Difference]: Start difference. First operand has 45 states, 28 states have (on average 1.0357142857142858) internal successors, (29), 28 states have internal predecessors, (29), 12 states have call successors, (12), 6 states have call predecessors, (12), 4 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) Second operand 45 states. [2022-04-14 17:52:39,606 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 17:52:39,606 INFO L93 Difference]: Finished difference Result 45 states and 51 transitions. [2022-04-14 17:52:39,606 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 51 transitions. [2022-04-14 17:52:39,607 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 17:52:39,607 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 17:52:39,607 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-14 17:52:39,607 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-14 17:52:39,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 28 states have (on average 1.0357142857142858) internal successors, (29), 28 states have internal predecessors, (29), 12 states have call successors, (12), 6 states have call predecessors, (12), 4 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-14 17:52:39,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 51 transitions. [2022-04-14 17:52:39,608 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 51 transitions. Word has length 61 [2022-04-14 17:52:39,608 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-14 17:52:39,608 INFO L478 AbstractCegarLoop]: Abstraction has 45 states and 51 transitions. [2022-04-14 17:52:39,608 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 2.5555555555555554) internal successors, (23), 9 states have internal predecessors, (23), 7 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (9), 7 states have call predecessors, (9), 7 states have call successors, (9) [2022-04-14 17:52:39,608 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 51 transitions. [2022-04-14 17:52:39,609 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2022-04-14 17:52:39,609 INFO L491 BasicCegarLoop]: Found error trace [2022-04-14 17:52:39,609 INFO L499 BasicCegarLoop]: trace histogram [8, 7, 7, 6, 6, 6, 5, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-14 17:52:39,632 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-14 17:52:39,825 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-14 17:52:39,826 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-14 17:52:39,826 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-14 17:52:39,826 INFO L85 PathProgramCache]: Analyzing trace with hash 1082774365, now seen corresponding path program 5 times [2022-04-14 17:52:39,826 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-14 17:52:39,826 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1830965420] [2022-04-14 17:52:39,826 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 17:52:39,827 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-14 17:52:39,836 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-14 17:52:39,836 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1556949188] [2022-04-14 17:52:39,836 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-04-14 17:52:39,836 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-14 17:52:39,837 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-14 17:52:39,837 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-14 17:52:39,838 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-14 17:52:40,337 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2022-04-14 17:52:40,337 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-14 17:52:40,339 INFO L263 TraceCheckSpWp]: Trace formula consists of 181 conjuncts, 28 conjunts are in the unsatisfiable core [2022-04-14 17:52:40,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 17:52:40,352 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-14 17:52:40,710 INFO L272 TraceCheckUtils]: 0: Hoare triple {2516#true} call ULTIMATE.init(); {2516#true} is VALID [2022-04-14 17:52:40,711 INFO L290 TraceCheckUtils]: 1: Hoare triple {2516#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); {2516#true} is VALID [2022-04-14 17:52:40,711 INFO L290 TraceCheckUtils]: 2: Hoare triple {2516#true} assume true; {2516#true} is VALID [2022-04-14 17:52:40,711 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2516#true} {2516#true} #63#return; {2516#true} is VALID [2022-04-14 17:52:40,711 INFO L272 TraceCheckUtils]: 4: Hoare triple {2516#true} call #t~ret5 := main(); {2516#true} is VALID [2022-04-14 17:52:40,711 INFO L290 TraceCheckUtils]: 5: Hoare triple {2516#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; {2516#true} is VALID [2022-04-14 17:52:40,711 INFO L272 TraceCheckUtils]: 6: Hoare triple {2516#true} call assume_abort_if_not((if ~k~0 >= 0 && ~k~0 <= 20 then 1 else 0)); {2516#true} is VALID [2022-04-14 17:52:40,711 INFO L290 TraceCheckUtils]: 7: Hoare triple {2516#true} ~cond := #in~cond; {2516#true} is VALID [2022-04-14 17:52:40,711 INFO L290 TraceCheckUtils]: 8: Hoare triple {2516#true} assume !(0 == ~cond); {2516#true} is VALID [2022-04-14 17:52:40,711 INFO L290 TraceCheckUtils]: 9: Hoare triple {2516#true} assume true; {2516#true} is VALID [2022-04-14 17:52:40,711 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {2516#true} {2516#true} #53#return; {2516#true} is VALID [2022-04-14 17:52:40,711 INFO L272 TraceCheckUtils]: 11: Hoare triple {2516#true} call assume_abort_if_not((if ~k~0 <= 256 then 1 else 0)); {2516#true} is VALID [2022-04-14 17:52:40,711 INFO L290 TraceCheckUtils]: 12: Hoare triple {2516#true} ~cond := #in~cond; {2516#true} is VALID [2022-04-14 17:52:40,711 INFO L290 TraceCheckUtils]: 13: Hoare triple {2516#true} assume !(0 == ~cond); {2516#true} is VALID [2022-04-14 17:52:40,712 INFO L290 TraceCheckUtils]: 14: Hoare triple {2516#true} assume true; {2516#true} is VALID [2022-04-14 17:52:40,712 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {2516#true} {2516#true} #55#return; {2516#true} is VALID [2022-04-14 17:52:40,712 INFO L290 TraceCheckUtils]: 16: Hoare triple {2516#true} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {2569#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-14 17:52:40,712 INFO L290 TraceCheckUtils]: 17: Hoare triple {2569#(and (= main_~c~0 0) (= main_~y~0 0))} assume !false; {2569#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-14 17:52:40,712 INFO L272 TraceCheckUtils]: 18: Hoare triple {2569#(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)); {2516#true} is VALID [2022-04-14 17:52:40,712 INFO L290 TraceCheckUtils]: 19: Hoare triple {2516#true} ~cond := #in~cond; {2516#true} is VALID [2022-04-14 17:52:40,713 INFO L290 TraceCheckUtils]: 20: Hoare triple {2516#true} assume !(0 == ~cond); {2516#true} is VALID [2022-04-14 17:52:40,713 INFO L290 TraceCheckUtils]: 21: Hoare triple {2516#true} assume true; {2516#true} is VALID [2022-04-14 17:52:40,713 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {2516#true} {2569#(and (= main_~c~0 0) (= main_~y~0 0))} #57#return; {2569#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-14 17:52:40,714 INFO L290 TraceCheckUtils]: 23: Hoare triple {2569#(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; {2591#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} is VALID [2022-04-14 17:52:40,714 INFO L290 TraceCheckUtils]: 24: Hoare triple {2591#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} assume !false; {2591#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} is VALID [2022-04-14 17:52:40,714 INFO L272 TraceCheckUtils]: 25: Hoare triple {2591#(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)); {2516#true} is VALID [2022-04-14 17:52:40,714 INFO L290 TraceCheckUtils]: 26: Hoare triple {2516#true} ~cond := #in~cond; {2516#true} is VALID [2022-04-14 17:52:40,715 INFO L290 TraceCheckUtils]: 27: Hoare triple {2516#true} assume !(0 == ~cond); {2516#true} is VALID [2022-04-14 17:52:40,715 INFO L290 TraceCheckUtils]: 28: Hoare triple {2516#true} assume true; {2516#true} is VALID [2022-04-14 17:52:40,715 INFO L284 TraceCheckUtils]: 29: Hoare quadruple {2516#true} {2591#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} #57#return; {2591#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} is VALID [2022-04-14 17:52:40,716 INFO L290 TraceCheckUtils]: 30: Hoare triple {2591#(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; {2613#(and (= (+ (- 2) main_~y~0) 0) (= main_~c~0 2))} is VALID [2022-04-14 17:52:40,716 INFO L290 TraceCheckUtils]: 31: Hoare triple {2613#(and (= (+ (- 2) main_~y~0) 0) (= main_~c~0 2))} assume !false; {2613#(and (= (+ (- 2) main_~y~0) 0) (= main_~c~0 2))} is VALID [2022-04-14 17:52:40,716 INFO L272 TraceCheckUtils]: 32: Hoare triple {2613#(and (= (+ (- 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)); {2516#true} is VALID [2022-04-14 17:52:40,716 INFO L290 TraceCheckUtils]: 33: Hoare triple {2516#true} ~cond := #in~cond; {2516#true} is VALID [2022-04-14 17:52:40,716 INFO L290 TraceCheckUtils]: 34: Hoare triple {2516#true} assume !(0 == ~cond); {2516#true} is VALID [2022-04-14 17:52:40,716 INFO L290 TraceCheckUtils]: 35: Hoare triple {2516#true} assume true; {2516#true} is VALID [2022-04-14 17:52:40,717 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {2516#true} {2613#(and (= (+ (- 2) main_~y~0) 0) (= main_~c~0 2))} #57#return; {2613#(and (= (+ (- 2) main_~y~0) 0) (= main_~c~0 2))} is VALID [2022-04-14 17:52:40,717 INFO L290 TraceCheckUtils]: 37: Hoare triple {2613#(and (= (+ (- 2) main_~y~0) 0) (= main_~c~0 2))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {2635#(and (= main_~y~0 3) (= (+ (- 1) main_~c~0) 2))} is VALID [2022-04-14 17:52:40,718 INFO L290 TraceCheckUtils]: 38: Hoare triple {2635#(and (= main_~y~0 3) (= (+ (- 1) main_~c~0) 2))} assume !false; {2635#(and (= main_~y~0 3) (= (+ (- 1) main_~c~0) 2))} is VALID [2022-04-14 17:52:40,718 INFO L272 TraceCheckUtils]: 39: Hoare triple {2635#(and (= main_~y~0 3) (= (+ (- 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)); {2516#true} is VALID [2022-04-14 17:52:40,718 INFO L290 TraceCheckUtils]: 40: Hoare triple {2516#true} ~cond := #in~cond; {2516#true} is VALID [2022-04-14 17:52:40,718 INFO L290 TraceCheckUtils]: 41: Hoare triple {2516#true} assume !(0 == ~cond); {2516#true} is VALID [2022-04-14 17:52:40,718 INFO L290 TraceCheckUtils]: 42: Hoare triple {2516#true} assume true; {2516#true} is VALID [2022-04-14 17:52:40,719 INFO L284 TraceCheckUtils]: 43: Hoare quadruple {2516#true} {2635#(and (= main_~y~0 3) (= (+ (- 1) main_~c~0) 2))} #57#return; {2635#(and (= main_~y~0 3) (= (+ (- 1) main_~c~0) 2))} is VALID [2022-04-14 17:52:40,719 INFO L290 TraceCheckUtils]: 44: Hoare triple {2635#(and (= main_~y~0 3) (= (+ (- 1) main_~c~0) 2))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {2657#(and (= 2 (+ (- 2) main_~c~0)) (= 3 (+ (- 1) main_~y~0)))} is VALID [2022-04-14 17:52:40,719 INFO L290 TraceCheckUtils]: 45: Hoare triple {2657#(and (= 2 (+ (- 2) main_~c~0)) (= 3 (+ (- 1) main_~y~0)))} assume !false; {2657#(and (= 2 (+ (- 2) main_~c~0)) (= 3 (+ (- 1) main_~y~0)))} is VALID [2022-04-14 17:52:40,720 INFO L272 TraceCheckUtils]: 46: Hoare triple {2657#(and (= 2 (+ (- 2) main_~c~0)) (= 3 (+ (- 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)); {2516#true} is VALID [2022-04-14 17:52:40,720 INFO L290 TraceCheckUtils]: 47: Hoare triple {2516#true} ~cond := #in~cond; {2516#true} is VALID [2022-04-14 17:52:40,720 INFO L290 TraceCheckUtils]: 48: Hoare triple {2516#true} assume !(0 == ~cond); {2516#true} is VALID [2022-04-14 17:52:40,720 INFO L290 TraceCheckUtils]: 49: Hoare triple {2516#true} assume true; {2516#true} is VALID [2022-04-14 17:52:40,720 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {2516#true} {2657#(and (= 2 (+ (- 2) main_~c~0)) (= 3 (+ (- 1) main_~y~0)))} #57#return; {2657#(and (= 2 (+ (- 2) main_~c~0)) (= 3 (+ (- 1) main_~y~0)))} is VALID [2022-04-14 17:52:40,721 INFO L290 TraceCheckUtils]: 51: Hoare triple {2657#(and (= 2 (+ (- 2) main_~c~0)) (= 3 (+ (- 1) main_~y~0)))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {2679#(and (<= main_~c~0 5) (= (+ (- 2) main_~y~0) 3) (< 4 main_~k~0))} is VALID [2022-04-14 17:52:40,721 INFO L290 TraceCheckUtils]: 52: Hoare triple {2679#(and (<= main_~c~0 5) (= (+ (- 2) main_~y~0) 3) (< 4 main_~k~0))} assume !false; {2679#(and (<= main_~c~0 5) (= (+ (- 2) main_~y~0) 3) (< 4 main_~k~0))} is VALID [2022-04-14 17:52:40,721 INFO L272 TraceCheckUtils]: 53: Hoare triple {2679#(and (<= main_~c~0 5) (= (+ (- 2) main_~y~0) 3) (< 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)); {2516#true} is VALID [2022-04-14 17:52:40,721 INFO L290 TraceCheckUtils]: 54: Hoare triple {2516#true} ~cond := #in~cond; {2516#true} is VALID [2022-04-14 17:52:40,722 INFO L290 TraceCheckUtils]: 55: Hoare triple {2516#true} assume !(0 == ~cond); {2516#true} is VALID [2022-04-14 17:52:40,722 INFO L290 TraceCheckUtils]: 56: Hoare triple {2516#true} assume true; {2516#true} is VALID [2022-04-14 17:52:40,722 INFO L284 TraceCheckUtils]: 57: Hoare quadruple {2516#true} {2679#(and (<= main_~c~0 5) (= (+ (- 2) main_~y~0) 3) (< 4 main_~k~0))} #57#return; {2679#(and (<= main_~c~0 5) (= (+ (- 2) main_~y~0) 3) (< 4 main_~k~0))} is VALID [2022-04-14 17:52:40,723 INFO L290 TraceCheckUtils]: 58: Hoare triple {2679#(and (<= main_~c~0 5) (= (+ (- 2) main_~y~0) 3) (< 4 main_~k~0))} assume !(~c~0 < ~k~0); {2701#(and (<= main_~k~0 5) (= (+ (- 2) main_~y~0) 3) (< 4 main_~k~0))} is VALID [2022-04-14 17:52:40,723 INFO L272 TraceCheckUtils]: 59: Hoare triple {2701#(and (<= main_~k~0 5) (= (+ (- 2) main_~y~0) 3) (< 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)); {2516#true} is VALID [2022-04-14 17:52:40,723 INFO L290 TraceCheckUtils]: 60: Hoare triple {2516#true} ~cond := #in~cond; {2516#true} is VALID [2022-04-14 17:52:40,723 INFO L290 TraceCheckUtils]: 61: Hoare triple {2516#true} assume !(0 == ~cond); {2516#true} is VALID [2022-04-14 17:52:40,723 INFO L290 TraceCheckUtils]: 62: Hoare triple {2516#true} assume true; {2516#true} is VALID [2022-04-14 17:52:40,723 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {2516#true} {2701#(and (<= main_~k~0 5) (= (+ (- 2) main_~y~0) 3) (< 4 main_~k~0))} #59#return; {2701#(and (<= main_~k~0 5) (= (+ (- 2) main_~y~0) 3) (< 4 main_~k~0))} is VALID [2022-04-14 17:52:40,724 INFO L272 TraceCheckUtils]: 64: Hoare triple {2701#(and (<= main_~k~0 5) (= (+ (- 2) main_~y~0) 3) (< 4 main_~k~0))} call __VERIFIER_assert((if ~k~0 * ~y~0 == ~y~0 * ~y~0 then 1 else 0)); {2720#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-14 17:52:40,724 INFO L290 TraceCheckUtils]: 65: Hoare triple {2720#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {2724#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-14 17:52:40,725 INFO L290 TraceCheckUtils]: 66: Hoare triple {2724#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {2517#false} is VALID [2022-04-14 17:52:40,725 INFO L290 TraceCheckUtils]: 67: Hoare triple {2517#false} assume !false; {2517#false} is VALID [2022-04-14 17:52:40,725 INFO L134 CoverageAnalysis]: Checked inductivity of 147 backedges. 14 proven. 45 refuted. 0 times theorem prover too weak. 88 trivial. 0 not checked. [2022-04-14 17:52:40,725 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-14 17:52:40,965 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-14 17:52:40,965 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1830965420] [2022-04-14 17:52:40,965 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-14 17:52:40,965 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1556949188] [2022-04-14 17:52:40,965 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1556949188] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-14 17:52:40,966 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-14 17:52:40,966 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2022-04-14 17:52:40,966 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [941944914] [2022-04-14 17:52:40,966 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2022-04-14 17:52:40,966 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 2.5) internal successors, (25), 10 states have internal predecessors, (25), 8 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (10), 8 states have call predecessors, (10), 8 states have call successors, (10) Word has length 68 [2022-04-14 17:52:40,967 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-14 17:52:40,967 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 11 states, 10 states have (on average 2.5) internal successors, (25), 10 states have internal predecessors, (25), 8 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (10), 8 states have call predecessors, (10), 8 states have call successors, (10) [2022-04-14 17:52:40,996 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 47 edges. 47 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-14 17:52:40,996 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-04-14 17:52:40,996 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-14 17:52:40,996 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-04-14 17:52:40,996 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=146, Unknown=0, NotChecked=0, Total=182 [2022-04-14 17:52:40,997 INFO L87 Difference]: Start difference. First operand 45 states and 51 transitions. Second operand has 11 states, 10 states have (on average 2.5) internal successors, (25), 10 states have internal predecessors, (25), 8 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (10), 8 states have call predecessors, (10), 8 states have call successors, (10) [2022-04-14 17:52:41,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 17:52:41,464 INFO L93 Difference]: Finished difference Result 54 states and 62 transitions. [2022-04-14 17:52:41,464 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-04-14 17:52:41,464 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 2.5) internal successors, (25), 10 states have internal predecessors, (25), 8 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (10), 8 states have call predecessors, (10), 8 states have call successors, (10) Word has length 68 [2022-04-14 17:52:41,464 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-14 17:52:41,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 10 states have (on average 2.5) internal successors, (25), 10 states have internal predecessors, (25), 8 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (10), 8 states have call predecessors, (10), 8 states have call successors, (10) [2022-04-14 17:52:41,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 58 transitions. [2022-04-14 17:52:41,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 10 states have (on average 2.5) internal successors, (25), 10 states have internal predecessors, (25), 8 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (10), 8 states have call predecessors, (10), 8 states have call successors, (10) [2022-04-14 17:52:41,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 58 transitions. [2022-04-14 17:52:41,467 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 11 states and 58 transitions. [2022-04-14 17:52:41,512 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 58 edges. 58 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-14 17:52:41,513 INFO L225 Difference]: With dead ends: 54 [2022-04-14 17:52:41,513 INFO L226 Difference]: Without dead ends: 48 [2022-04-14 17:52:41,513 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 72 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=194, Unknown=0, NotChecked=0, Total=240 [2022-04-14 17:52:41,513 INFO L913 BasicCegarLoop]: 42 mSDtfsCounter, 2 mSDsluCounter, 229 mSDsCounter, 0 mSdLazyCounter, 207 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 271 SdHoareTripleChecker+Invalid, 208 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 207 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-14 17:52:41,513 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [2 Valid, 271 Invalid, 208 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 207 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-14 17:52:41,514 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2022-04-14 17:52:41,529 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2022-04-14 17:52:41,529 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-14 17:52:41,529 INFO L82 GeneralOperation]: Start isEquivalent. First operand 48 states. Second operand has 48 states, 30 states have (on average 1.0333333333333334) internal successors, (31), 30 states have internal predecessors, (31), 13 states have call successors, (13), 6 states have call predecessors, (13), 4 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-14 17:52:41,529 INFO L74 IsIncluded]: Start isIncluded. First operand 48 states. Second operand has 48 states, 30 states have (on average 1.0333333333333334) internal successors, (31), 30 states have internal predecessors, (31), 13 states have call successors, (13), 6 states have call predecessors, (13), 4 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-14 17:52:41,530 INFO L87 Difference]: Start difference. First operand 48 states. Second operand has 48 states, 30 states have (on average 1.0333333333333334) internal successors, (31), 30 states have internal predecessors, (31), 13 states have call successors, (13), 6 states have call predecessors, (13), 4 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-14 17:52:41,531 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 17:52:41,531 INFO L93 Difference]: Finished difference Result 48 states and 55 transitions. [2022-04-14 17:52:41,531 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 55 transitions. [2022-04-14 17:52:41,531 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 17:52:41,531 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 17:52:41,531 INFO L74 IsIncluded]: Start isIncluded. First operand has 48 states, 30 states have (on average 1.0333333333333334) internal successors, (31), 30 states have internal predecessors, (31), 13 states have call successors, (13), 6 states have call predecessors, (13), 4 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) Second operand 48 states. [2022-04-14 17:52:41,532 INFO L87 Difference]: Start difference. First operand has 48 states, 30 states have (on average 1.0333333333333334) internal successors, (31), 30 states have internal predecessors, (31), 13 states have call successors, (13), 6 states have call predecessors, (13), 4 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) Second operand 48 states. [2022-04-14 17:52:41,533 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 17:52:41,533 INFO L93 Difference]: Finished difference Result 48 states and 55 transitions. [2022-04-14 17:52:41,533 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 55 transitions. [2022-04-14 17:52:41,533 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 17:52:41,533 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 17:52:41,533 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-14 17:52:41,533 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-14 17:52:41,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 30 states have (on average 1.0333333333333334) internal successors, (31), 30 states have internal predecessors, (31), 13 states have call successors, (13), 6 states have call predecessors, (13), 4 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-14 17:52:41,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 55 transitions. [2022-04-14 17:52:41,535 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 55 transitions. Word has length 68 [2022-04-14 17:52:41,535 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-14 17:52:41,535 INFO L478 AbstractCegarLoop]: Abstraction has 48 states and 55 transitions. [2022-04-14 17:52:41,535 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 2.5) internal successors, (25), 10 states have internal predecessors, (25), 8 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (10), 8 states have call predecessors, (10), 8 states have call successors, (10) [2022-04-14 17:52:41,536 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 55 transitions. [2022-04-14 17:52:41,536 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2022-04-14 17:52:41,536 INFO L491 BasicCegarLoop]: Found error trace [2022-04-14 17:52:41,536 INFO L499 BasicCegarLoop]: trace histogram [9, 8, 8, 7, 7, 7, 6, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-14 17:52:41,545 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-14 17:52:41,742 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-14 17:52:41,742 INFO L403 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-14 17:52:41,743 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-14 17:52:41,743 INFO L85 PathProgramCache]: Analyzing trace with hash -1692754003, now seen corresponding path program 6 times [2022-04-14 17:52:41,743 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-14 17:52:41,743 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [492820621] [2022-04-14 17:52:41,743 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 17:52:41,743 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-14 17:52:41,753 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-14 17:52:41,753 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1929368066] [2022-04-14 17:52:41,753 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-14 17:52:41,753 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-14 17:52:41,753 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-14 17:52:41,754 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-14 17:52:41,755 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-14 17:52:42,079 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2022-04-14 17:52:42,079 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-14 17:52:42,080 INFO L263 TraceCheckSpWp]: Trace formula consists of 198 conjuncts, 33 conjunts are in the unsatisfiable core [2022-04-14 17:52:42,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 17:52:42,094 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-14 17:52:42,593 INFO L272 TraceCheckUtils]: 0: Hoare triple {3044#true} call ULTIMATE.init(); {3044#true} is VALID [2022-04-14 17:52:42,593 INFO L290 TraceCheckUtils]: 1: Hoare triple {3044#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); {3044#true} is VALID [2022-04-14 17:52:42,593 INFO L290 TraceCheckUtils]: 2: Hoare triple {3044#true} assume true; {3044#true} is VALID [2022-04-14 17:52:42,594 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3044#true} {3044#true} #63#return; {3044#true} is VALID [2022-04-14 17:52:42,594 INFO L272 TraceCheckUtils]: 4: Hoare triple {3044#true} call #t~ret5 := main(); {3044#true} is VALID [2022-04-14 17:52:42,594 INFO L290 TraceCheckUtils]: 5: Hoare triple {3044#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; {3044#true} is VALID [2022-04-14 17:52:42,594 INFO L272 TraceCheckUtils]: 6: Hoare triple {3044#true} call assume_abort_if_not((if ~k~0 >= 0 && ~k~0 <= 20 then 1 else 0)); {3044#true} is VALID [2022-04-14 17:52:42,594 INFO L290 TraceCheckUtils]: 7: Hoare triple {3044#true} ~cond := #in~cond; {3044#true} is VALID [2022-04-14 17:52:42,594 INFO L290 TraceCheckUtils]: 8: Hoare triple {3044#true} assume !(0 == ~cond); {3044#true} is VALID [2022-04-14 17:52:42,594 INFO L290 TraceCheckUtils]: 9: Hoare triple {3044#true} assume true; {3044#true} is VALID [2022-04-14 17:52:42,594 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {3044#true} {3044#true} #53#return; {3044#true} is VALID [2022-04-14 17:52:42,594 INFO L272 TraceCheckUtils]: 11: Hoare triple {3044#true} call assume_abort_if_not((if ~k~0 <= 256 then 1 else 0)); {3044#true} is VALID [2022-04-14 17:52:42,594 INFO L290 TraceCheckUtils]: 12: Hoare triple {3044#true} ~cond := #in~cond; {3044#true} is VALID [2022-04-14 17:52:42,594 INFO L290 TraceCheckUtils]: 13: Hoare triple {3044#true} assume !(0 == ~cond); {3044#true} is VALID [2022-04-14 17:52:42,594 INFO L290 TraceCheckUtils]: 14: Hoare triple {3044#true} assume true; {3044#true} is VALID [2022-04-14 17:52:42,594 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {3044#true} {3044#true} #55#return; {3044#true} is VALID [2022-04-14 17:52:42,595 INFO L290 TraceCheckUtils]: 16: Hoare triple {3044#true} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {3097#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-14 17:52:42,611 INFO L290 TraceCheckUtils]: 17: Hoare triple {3097#(and (= main_~c~0 0) (= main_~y~0 0))} assume !false; {3097#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-14 17:52:42,611 INFO L272 TraceCheckUtils]: 18: Hoare triple {3097#(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)); {3044#true} is VALID [2022-04-14 17:52:42,611 INFO L290 TraceCheckUtils]: 19: Hoare triple {3044#true} ~cond := #in~cond; {3044#true} is VALID [2022-04-14 17:52:42,611 INFO L290 TraceCheckUtils]: 20: Hoare triple {3044#true} assume !(0 == ~cond); {3044#true} is VALID [2022-04-14 17:52:42,611 INFO L290 TraceCheckUtils]: 21: Hoare triple {3044#true} assume true; {3044#true} is VALID [2022-04-14 17:52:42,612 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {3044#true} {3097#(and (= main_~c~0 0) (= main_~y~0 0))} #57#return; {3097#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-14 17:52:42,613 INFO L290 TraceCheckUtils]: 23: Hoare triple {3097#(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; {3119#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} is VALID [2022-04-14 17:52:42,613 INFO L290 TraceCheckUtils]: 24: Hoare triple {3119#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} assume !false; {3119#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} is VALID [2022-04-14 17:52:42,613 INFO L272 TraceCheckUtils]: 25: Hoare triple {3119#(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)); {3044#true} is VALID [2022-04-14 17:52:42,613 INFO L290 TraceCheckUtils]: 26: Hoare triple {3044#true} ~cond := #in~cond; {3044#true} is VALID [2022-04-14 17:52:42,613 INFO L290 TraceCheckUtils]: 27: Hoare triple {3044#true} assume !(0 == ~cond); {3044#true} is VALID [2022-04-14 17:52:42,613 INFO L290 TraceCheckUtils]: 28: Hoare triple {3044#true} assume true; {3044#true} is VALID [2022-04-14 17:52:42,614 INFO L284 TraceCheckUtils]: 29: Hoare quadruple {3044#true} {3119#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} #57#return; {3119#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} is VALID [2022-04-14 17:52:42,614 INFO L290 TraceCheckUtils]: 30: Hoare triple {3119#(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; {3141#(and (= main_~y~0 2) (= (+ (- 1) main_~c~0) 1))} is VALID [2022-04-14 17:52:42,614 INFO L290 TraceCheckUtils]: 31: Hoare triple {3141#(and (= main_~y~0 2) (= (+ (- 1) main_~c~0) 1))} assume !false; {3141#(and (= main_~y~0 2) (= (+ (- 1) main_~c~0) 1))} is VALID [2022-04-14 17:52:42,615 INFO L272 TraceCheckUtils]: 32: Hoare triple {3141#(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)); {3044#true} is VALID [2022-04-14 17:52:42,615 INFO L290 TraceCheckUtils]: 33: Hoare triple {3044#true} ~cond := #in~cond; {3044#true} is VALID [2022-04-14 17:52:42,615 INFO L290 TraceCheckUtils]: 34: Hoare triple {3044#true} assume !(0 == ~cond); {3044#true} is VALID [2022-04-14 17:52:42,615 INFO L290 TraceCheckUtils]: 35: Hoare triple {3044#true} assume true; {3044#true} is VALID [2022-04-14 17:52:42,615 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {3044#true} {3141#(and (= main_~y~0 2) (= (+ (- 1) main_~c~0) 1))} #57#return; {3141#(and (= main_~y~0 2) (= (+ (- 1) main_~c~0) 1))} is VALID [2022-04-14 17:52:42,616 INFO L290 TraceCheckUtils]: 37: Hoare triple {3141#(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; {3163#(and (= (+ (- 2) main_~c~0) 1) (= main_~y~0 3) (< main_~c~0 (+ main_~k~0 1)))} is VALID [2022-04-14 17:52:42,616 INFO L290 TraceCheckUtils]: 38: Hoare triple {3163#(and (= (+ (- 2) main_~c~0) 1) (= main_~y~0 3) (< main_~c~0 (+ main_~k~0 1)))} assume !false; {3163#(and (= (+ (- 2) main_~c~0) 1) (= main_~y~0 3) (< main_~c~0 (+ main_~k~0 1)))} is VALID [2022-04-14 17:52:42,616 INFO L272 TraceCheckUtils]: 39: Hoare triple {3163#(and (= (+ (- 2) main_~c~0) 1) (= main_~y~0 3) (< main_~c~0 (+ main_~k~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)); {3044#true} is VALID [2022-04-14 17:52:42,616 INFO L290 TraceCheckUtils]: 40: Hoare triple {3044#true} ~cond := #in~cond; {3044#true} is VALID [2022-04-14 17:52:42,616 INFO L290 TraceCheckUtils]: 41: Hoare triple {3044#true} assume !(0 == ~cond); {3044#true} is VALID [2022-04-14 17:52:42,616 INFO L290 TraceCheckUtils]: 42: Hoare triple {3044#true} assume true; {3044#true} is VALID [2022-04-14 17:52:42,617 INFO L284 TraceCheckUtils]: 43: Hoare quadruple {3044#true} {3163#(and (= (+ (- 2) main_~c~0) 1) (= main_~y~0 3) (< main_~c~0 (+ main_~k~0 1)))} #57#return; {3163#(and (= (+ (- 2) main_~c~0) 1) (= main_~y~0 3) (< main_~c~0 (+ main_~k~0 1)))} is VALID [2022-04-14 17:52:42,617 INFO L290 TraceCheckUtils]: 44: Hoare triple {3163#(and (= (+ (- 2) main_~c~0) 1) (= main_~y~0 3) (< main_~c~0 (+ main_~k~0 1)))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {3185#(and (= main_~y~0 4) (= main_~c~0 4) (< 2 main_~k~0))} is VALID [2022-04-14 17:52:42,617 INFO L290 TraceCheckUtils]: 45: Hoare triple {3185#(and (= main_~y~0 4) (= main_~c~0 4) (< 2 main_~k~0))} assume !false; {3185#(and (= main_~y~0 4) (= main_~c~0 4) (< 2 main_~k~0))} is VALID [2022-04-14 17:52:42,618 INFO L272 TraceCheckUtils]: 46: Hoare triple {3185#(and (= main_~y~0 4) (= main_~c~0 4) (< 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)); {3044#true} is VALID [2022-04-14 17:52:42,618 INFO L290 TraceCheckUtils]: 47: Hoare triple {3044#true} ~cond := #in~cond; {3044#true} is VALID [2022-04-14 17:52:42,618 INFO L290 TraceCheckUtils]: 48: Hoare triple {3044#true} assume !(0 == ~cond); {3044#true} is VALID [2022-04-14 17:52:42,618 INFO L290 TraceCheckUtils]: 49: Hoare triple {3044#true} assume true; {3044#true} is VALID [2022-04-14 17:52:42,618 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {3044#true} {3185#(and (= main_~y~0 4) (= main_~c~0 4) (< 2 main_~k~0))} #57#return; {3185#(and (= main_~y~0 4) (= main_~c~0 4) (< 2 main_~k~0))} is VALID [2022-04-14 17:52:42,619 INFO L290 TraceCheckUtils]: 51: Hoare triple {3185#(and (= main_~y~0 4) (= main_~c~0 4) (< 2 main_~k~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; {3207#(and (= 5 main_~c~0) (= 5 main_~y~0) (< 2 main_~k~0))} is VALID [2022-04-14 17:52:42,619 INFO L290 TraceCheckUtils]: 52: Hoare triple {3207#(and (= 5 main_~c~0) (= 5 main_~y~0) (< 2 main_~k~0))} assume !false; {3207#(and (= 5 main_~c~0) (= 5 main_~y~0) (< 2 main_~k~0))} is VALID [2022-04-14 17:52:42,619 INFO L272 TraceCheckUtils]: 53: Hoare triple {3207#(and (= 5 main_~c~0) (= 5 main_~y~0) (< 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)); {3044#true} is VALID [2022-04-14 17:52:42,619 INFO L290 TraceCheckUtils]: 54: Hoare triple {3044#true} ~cond := #in~cond; {3044#true} is VALID [2022-04-14 17:52:42,620 INFO L290 TraceCheckUtils]: 55: Hoare triple {3044#true} assume !(0 == ~cond); {3044#true} is VALID [2022-04-14 17:52:42,620 INFO L290 TraceCheckUtils]: 56: Hoare triple {3044#true} assume true; {3044#true} is VALID [2022-04-14 17:52:42,620 INFO L284 TraceCheckUtils]: 57: Hoare quadruple {3044#true} {3207#(and (= 5 main_~c~0) (= 5 main_~y~0) (< 2 main_~k~0))} #57#return; {3207#(and (= 5 main_~c~0) (= 5 main_~y~0) (< 2 main_~k~0))} is VALID [2022-04-14 17:52:42,621 INFO L290 TraceCheckUtils]: 58: Hoare triple {3207#(and (= 5 main_~c~0) (= 5 main_~y~0) (< 2 main_~k~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; {3229#(and (= main_~y~0 6) (< 5 main_~k~0) (<= main_~c~0 6))} is VALID [2022-04-14 17:52:42,621 INFO L290 TraceCheckUtils]: 59: Hoare triple {3229#(and (= main_~y~0 6) (< 5 main_~k~0) (<= main_~c~0 6))} assume !false; {3229#(and (= main_~y~0 6) (< 5 main_~k~0) (<= main_~c~0 6))} is VALID [2022-04-14 17:52:42,621 INFO L272 TraceCheckUtils]: 60: Hoare triple {3229#(and (= main_~y~0 6) (< 5 main_~k~0) (<= main_~c~0 6))} 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)); {3044#true} is VALID [2022-04-14 17:52:42,621 INFO L290 TraceCheckUtils]: 61: Hoare triple {3044#true} ~cond := #in~cond; {3044#true} is VALID [2022-04-14 17:52:42,621 INFO L290 TraceCheckUtils]: 62: Hoare triple {3044#true} assume !(0 == ~cond); {3044#true} is VALID [2022-04-14 17:52:42,621 INFO L290 TraceCheckUtils]: 63: Hoare triple {3044#true} assume true; {3044#true} is VALID [2022-04-14 17:52:42,622 INFO L284 TraceCheckUtils]: 64: Hoare quadruple {3044#true} {3229#(and (= main_~y~0 6) (< 5 main_~k~0) (<= main_~c~0 6))} #57#return; {3229#(and (= main_~y~0 6) (< 5 main_~k~0) (<= main_~c~0 6))} is VALID [2022-04-14 17:52:42,622 INFO L290 TraceCheckUtils]: 65: Hoare triple {3229#(and (= main_~y~0 6) (< 5 main_~k~0) (<= main_~c~0 6))} assume !(~c~0 < ~k~0); {3251#(and (= main_~y~0 6) (<= main_~k~0 6) (< 5 main_~k~0))} is VALID [2022-04-14 17:52:42,622 INFO L272 TraceCheckUtils]: 66: Hoare triple {3251#(and (= main_~y~0 6) (<= main_~k~0 6) (< 5 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)); {3044#true} is VALID [2022-04-14 17:52:42,622 INFO L290 TraceCheckUtils]: 67: Hoare triple {3044#true} ~cond := #in~cond; {3044#true} is VALID [2022-04-14 17:52:42,622 INFO L290 TraceCheckUtils]: 68: Hoare triple {3044#true} assume !(0 == ~cond); {3044#true} is VALID [2022-04-14 17:52:42,622 INFO L290 TraceCheckUtils]: 69: Hoare triple {3044#true} assume true; {3044#true} is VALID [2022-04-14 17:52:42,623 INFO L284 TraceCheckUtils]: 70: Hoare quadruple {3044#true} {3251#(and (= main_~y~0 6) (<= main_~k~0 6) (< 5 main_~k~0))} #59#return; {3251#(and (= main_~y~0 6) (<= main_~k~0 6) (< 5 main_~k~0))} is VALID [2022-04-14 17:52:42,623 INFO L272 TraceCheckUtils]: 71: Hoare triple {3251#(and (= main_~y~0 6) (<= main_~k~0 6) (< 5 main_~k~0))} call __VERIFIER_assert((if ~k~0 * ~y~0 == ~y~0 * ~y~0 then 1 else 0)); {3270#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-14 17:52:42,624 INFO L290 TraceCheckUtils]: 72: Hoare triple {3270#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {3274#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-14 17:52:42,624 INFO L290 TraceCheckUtils]: 73: Hoare triple {3274#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {3045#false} is VALID [2022-04-14 17:52:42,624 INFO L290 TraceCheckUtils]: 74: Hoare triple {3045#false} assume !false; {3045#false} is VALID [2022-04-14 17:52:42,624 INFO L134 CoverageAnalysis]: Checked inductivity of 195 backedges. 16 proven. 63 refuted. 0 times theorem prover too weak. 116 trivial. 0 not checked. [2022-04-14 17:52:42,624 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-14 17:52:43,106 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-14 17:52:43,106 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [492820621] [2022-04-14 17:52:43,106 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-14 17:52:43,106 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1929368066] [2022-04-14 17:52:43,106 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1929368066] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-14 17:52:43,107 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-14 17:52:43,107 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2022-04-14 17:52:43,107 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [13404767] [2022-04-14 17:52:43,107 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2022-04-14 17:52:43,107 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 2.4545454545454546) internal successors, (27), 11 states have internal predecessors, (27), 9 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (11), 9 states have call predecessors, (11), 9 states have call successors, (11) Word has length 75 [2022-04-14 17:52:43,107 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-14 17:52:43,108 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 12 states, 11 states have (on average 2.4545454545454546) internal successors, (27), 11 states have internal predecessors, (27), 9 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (11), 9 states have call predecessors, (11), 9 states have call successors, (11) [2022-04-14 17:52:43,141 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 51 edges. 51 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-14 17:52:43,141 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-04-14 17:52:43,141 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-14 17:52:43,142 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-04-14 17:52:43,142 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=242, Unknown=0, NotChecked=0, Total=306 [2022-04-14 17:52:43,142 INFO L87 Difference]: Start difference. First operand 48 states and 55 transitions. Second operand has 12 states, 11 states have (on average 2.4545454545454546) internal successors, (27), 11 states have internal predecessors, (27), 9 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (11), 9 states have call predecessors, (11), 9 states have call successors, (11) [2022-04-14 17:52:43,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 17:52:43,719 INFO L93 Difference]: Finished difference Result 57 states and 66 transitions. [2022-04-14 17:52:43,719 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-04-14 17:52:43,719 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 2.4545454545454546) internal successors, (27), 11 states have internal predecessors, (27), 9 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (11), 9 states have call predecessors, (11), 9 states have call successors, (11) Word has length 75 [2022-04-14 17:52:43,720 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-14 17:52:43,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 11 states have (on average 2.4545454545454546) internal successors, (27), 11 states have internal predecessors, (27), 9 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (11), 9 states have call predecessors, (11), 9 states have call successors, (11) [2022-04-14 17:52:43,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 62 transitions. [2022-04-14 17:52:43,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 11 states have (on average 2.4545454545454546) internal successors, (27), 11 states have internal predecessors, (27), 9 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (11), 9 states have call predecessors, (11), 9 states have call successors, (11) [2022-04-14 17:52:43,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 62 transitions. [2022-04-14 17:52:43,722 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 12 states and 62 transitions. [2022-04-14 17:52:43,768 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 62 edges. 62 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-14 17:52:43,770 INFO L225 Difference]: With dead ends: 57 [2022-04-14 17:52:43,770 INFO L226 Difference]: Without dead ends: 51 [2022-04-14 17:52:43,770 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 96 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=74, Invalid=306, Unknown=0, NotChecked=0, Total=380 [2022-04-14 17:52:43,775 INFO L913 BasicCegarLoop]: 45 mSDtfsCounter, 2 mSDsluCounter, 259 mSDsCounter, 0 mSdLazyCounter, 265 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 304 SdHoareTripleChecker+Invalid, 266 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 265 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-14 17:52:43,776 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [2 Valid, 304 Invalid, 266 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 265 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-14 17:52:43,781 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2022-04-14 17:52:43,803 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2022-04-14 17:52:43,803 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-14 17:52:43,803 INFO L82 GeneralOperation]: Start isEquivalent. First operand 51 states. Second operand has 51 states, 32 states have (on average 1.03125) internal successors, (33), 32 states have internal predecessors, (33), 14 states have call successors, (14), 6 states have call predecessors, (14), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2022-04-14 17:52:43,803 INFO L74 IsIncluded]: Start isIncluded. First operand 51 states. Second operand has 51 states, 32 states have (on average 1.03125) internal successors, (33), 32 states have internal predecessors, (33), 14 states have call successors, (14), 6 states have call predecessors, (14), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2022-04-14 17:52:43,804 INFO L87 Difference]: Start difference. First operand 51 states. Second operand has 51 states, 32 states have (on average 1.03125) internal successors, (33), 32 states have internal predecessors, (33), 14 states have call successors, (14), 6 states have call predecessors, (14), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2022-04-14 17:52:43,810 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 17:52:43,810 INFO L93 Difference]: Finished difference Result 51 states and 59 transitions. [2022-04-14 17:52:43,810 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 59 transitions. [2022-04-14 17:52:43,810 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 17:52:43,810 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 17:52:43,810 INFO L74 IsIncluded]: Start isIncluded. First operand has 51 states, 32 states have (on average 1.03125) internal successors, (33), 32 states have internal predecessors, (33), 14 states have call successors, (14), 6 states have call predecessors, (14), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) Second operand 51 states. [2022-04-14 17:52:43,811 INFO L87 Difference]: Start difference. First operand has 51 states, 32 states have (on average 1.03125) internal successors, (33), 32 states have internal predecessors, (33), 14 states have call successors, (14), 6 states have call predecessors, (14), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) Second operand 51 states. [2022-04-14 17:52:43,812 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 17:52:43,812 INFO L93 Difference]: Finished difference Result 51 states and 59 transitions. [2022-04-14 17:52:43,812 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 59 transitions. [2022-04-14 17:52:43,812 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 17:52:43,812 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 17:52:43,812 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-14 17:52:43,812 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-14 17:52:43,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 32 states have (on average 1.03125) internal successors, (33), 32 states have internal predecessors, (33), 14 states have call successors, (14), 6 states have call predecessors, (14), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2022-04-14 17:52:43,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 59 transitions. [2022-04-14 17:52:43,813 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 59 transitions. Word has length 75 [2022-04-14 17:52:43,813 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-14 17:52:43,814 INFO L478 AbstractCegarLoop]: Abstraction has 51 states and 59 transitions. [2022-04-14 17:52:43,814 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 2.4545454545454546) internal successors, (27), 11 states have internal predecessors, (27), 9 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (11), 9 states have call predecessors, (11), 9 states have call successors, (11) [2022-04-14 17:52:43,814 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 59 transitions. [2022-04-14 17:52:43,814 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2022-04-14 17:52:43,814 INFO L491 BasicCegarLoop]: Found error trace [2022-04-14 17:52:43,814 INFO L499 BasicCegarLoop]: trace histogram [10, 9, 9, 8, 8, 8, 7, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-14 17:52:43,831 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-14 17:52:44,014 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable8 [2022-04-14 17:52:44,015 INFO L403 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-14 17:52:44,015 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-14 17:52:44,016 INFO L85 PathProgramCache]: Analyzing trace with hash 615143773, now seen corresponding path program 7 times [2022-04-14 17:52:44,016 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-14 17:52:44,016 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2077951277] [2022-04-14 17:52:44,016 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 17:52:44,016 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-14 17:52:44,037 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-14 17:52:44,037 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [733663288] [2022-04-14 17:52:44,037 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-04-14 17:52:44,037 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-14 17:52:44,038 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-14 17:52:44,038 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-14 17:52:44,039 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-14 17:53:32,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 17:53:32,646 INFO L263 TraceCheckSpWp]: Trace formula consists of 215 conjuncts, 51 conjunts are in the unsatisfiable core [2022-04-14 17:53:32,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 17:53:32,679 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-14 17:53:33,688 INFO L272 TraceCheckUtils]: 0: Hoare triple {3676#true} call ULTIMATE.init(); {3676#true} is VALID [2022-04-14 17:53:33,689 INFO L290 TraceCheckUtils]: 1: Hoare triple {3676#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); {3676#true} is VALID [2022-04-14 17:53:33,689 INFO L290 TraceCheckUtils]: 2: Hoare triple {3676#true} assume true; {3676#true} is VALID [2022-04-14 17:53:33,689 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3676#true} {3676#true} #63#return; {3676#true} is VALID [2022-04-14 17:53:33,689 INFO L272 TraceCheckUtils]: 4: Hoare triple {3676#true} call #t~ret5 := main(); {3676#true} is VALID [2022-04-14 17:53:33,689 INFO L290 TraceCheckUtils]: 5: Hoare triple {3676#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; {3676#true} is VALID [2022-04-14 17:53:33,689 INFO L272 TraceCheckUtils]: 6: Hoare triple {3676#true} call assume_abort_if_not((if ~k~0 >= 0 && ~k~0 <= 20 then 1 else 0)); {3676#true} is VALID [2022-04-14 17:53:33,689 INFO L290 TraceCheckUtils]: 7: Hoare triple {3676#true} ~cond := #in~cond; {3676#true} is VALID [2022-04-14 17:53:33,689 INFO L290 TraceCheckUtils]: 8: Hoare triple {3676#true} assume !(0 == ~cond); {3676#true} is VALID [2022-04-14 17:53:33,689 INFO L290 TraceCheckUtils]: 9: Hoare triple {3676#true} assume true; {3676#true} is VALID [2022-04-14 17:53:33,689 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {3676#true} {3676#true} #53#return; {3676#true} is VALID [2022-04-14 17:53:33,689 INFO L272 TraceCheckUtils]: 11: Hoare triple {3676#true} call assume_abort_if_not((if ~k~0 <= 256 then 1 else 0)); {3676#true} is VALID [2022-04-14 17:53:33,690 INFO L290 TraceCheckUtils]: 12: Hoare triple {3676#true} ~cond := #in~cond; {3676#true} is VALID [2022-04-14 17:53:33,690 INFO L290 TraceCheckUtils]: 13: Hoare triple {3676#true} assume !(0 == ~cond); {3676#true} is VALID [2022-04-14 17:53:33,690 INFO L290 TraceCheckUtils]: 14: Hoare triple {3676#true} assume true; {3676#true} is VALID [2022-04-14 17:53:33,690 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {3676#true} {3676#true} #55#return; {3676#true} is VALID [2022-04-14 17:53:33,690 INFO L290 TraceCheckUtils]: 16: Hoare triple {3676#true} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {3729#(and (<= 0 main_~x~0) (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-14 17:53:33,690 INFO L290 TraceCheckUtils]: 17: Hoare triple {3729#(and (<= 0 main_~x~0) (= main_~c~0 0) (= main_~y~0 0))} assume !false; {3729#(and (<= 0 main_~x~0) (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-14 17:53:33,690 INFO L272 TraceCheckUtils]: 18: Hoare triple {3729#(and (<= 0 main_~x~0) (= 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)); {3676#true} is VALID [2022-04-14 17:53:33,691 INFO L290 TraceCheckUtils]: 19: Hoare triple {3676#true} ~cond := #in~cond; {3676#true} is VALID [2022-04-14 17:53:33,691 INFO L290 TraceCheckUtils]: 20: Hoare triple {3676#true} assume !(0 == ~cond); {3676#true} is VALID [2022-04-14 17:53:33,691 INFO L290 TraceCheckUtils]: 21: Hoare triple {3676#true} assume true; {3676#true} is VALID [2022-04-14 17:53:33,691 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {3676#true} {3729#(and (<= 0 main_~x~0) (= main_~c~0 0) (= main_~y~0 0))} #57#return; {3729#(and (<= 0 main_~x~0) (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-14 17:53:33,692 INFO L290 TraceCheckUtils]: 23: Hoare triple {3729#(and (<= 0 main_~x~0) (= 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; {3751#(and (= main_~y~0 1) (< 0 main_~k~0) (<= (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0) main_~x~0) (= main_~c~0 1))} is VALID [2022-04-14 17:53:33,692 INFO L290 TraceCheckUtils]: 24: Hoare triple {3751#(and (= main_~y~0 1) (< 0 main_~k~0) (<= (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0) main_~x~0) (= main_~c~0 1))} assume !false; {3751#(and (= main_~y~0 1) (< 0 main_~k~0) (<= (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0) main_~x~0) (= main_~c~0 1))} is VALID [2022-04-14 17:53:33,692 INFO L272 TraceCheckUtils]: 25: Hoare triple {3751#(and (= main_~y~0 1) (< 0 main_~k~0) (<= (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0) main_~x~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)); {3676#true} is VALID [2022-04-14 17:53:33,692 INFO L290 TraceCheckUtils]: 26: Hoare triple {3676#true} ~cond := #in~cond; {3676#true} is VALID [2022-04-14 17:53:33,692 INFO L290 TraceCheckUtils]: 27: Hoare triple {3676#true} assume !(0 == ~cond); {3676#true} is VALID [2022-04-14 17:53:33,692 INFO L290 TraceCheckUtils]: 28: Hoare triple {3676#true} assume true; {3676#true} is VALID [2022-04-14 17:53:33,693 INFO L284 TraceCheckUtils]: 29: Hoare quadruple {3676#true} {3751#(and (= main_~y~0 1) (< 0 main_~k~0) (<= (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0) main_~x~0) (= main_~c~0 1))} #57#return; {3751#(and (= main_~y~0 1) (< 0 main_~k~0) (<= (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0) main_~x~0) (= main_~c~0 1))} is VALID [2022-04-14 17:53:33,693 INFO L290 TraceCheckUtils]: 30: Hoare triple {3751#(and (= main_~y~0 1) (< 0 main_~k~0) (<= (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0) main_~x~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; {3773#(and (= main_~y~0 2) (<= (+ (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0) 1) main_~x~0) (= main_~c~0 2) (< 0 main_~k~0))} is VALID [2022-04-14 17:53:33,694 INFO L290 TraceCheckUtils]: 31: Hoare triple {3773#(and (= main_~y~0 2) (<= (+ (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0) 1) main_~x~0) (= main_~c~0 2) (< 0 main_~k~0))} assume !false; {3773#(and (= main_~y~0 2) (<= (+ (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0) 1) main_~x~0) (= main_~c~0 2) (< 0 main_~k~0))} is VALID [2022-04-14 17:53:33,694 INFO L272 TraceCheckUtils]: 32: Hoare triple {3773#(and (= main_~y~0 2) (<= (+ (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0) 1) main_~x~0) (= main_~c~0 2) (< 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)); {3676#true} is VALID [2022-04-14 17:53:33,694 INFO L290 TraceCheckUtils]: 33: Hoare triple {3676#true} ~cond := #in~cond; {3676#true} is VALID [2022-04-14 17:53:33,694 INFO L290 TraceCheckUtils]: 34: Hoare triple {3676#true} assume !(0 == ~cond); {3676#true} is VALID [2022-04-14 17:53:33,694 INFO L290 TraceCheckUtils]: 35: Hoare triple {3676#true} assume true; {3676#true} is VALID [2022-04-14 17:53:33,694 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {3676#true} {3773#(and (= main_~y~0 2) (<= (+ (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0) 1) main_~x~0) (= main_~c~0 2) (< 0 main_~k~0))} #57#return; {3773#(and (= main_~y~0 2) (<= (+ (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0) 1) main_~x~0) (= main_~c~0 2) (< 0 main_~k~0))} is VALID [2022-04-14 17:53:33,695 INFO L290 TraceCheckUtils]: 37: Hoare triple {3773#(and (= main_~y~0 2) (<= (+ (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0) 1) main_~x~0) (= main_~c~0 2) (< 0 main_~k~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; {3795#(and (= 2 (+ (- 1) main_~y~0)) (<= (+ (* 5 main_~y~0) (* 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) 10)) (+ (* (* main_~y~0 main_~y~0) 10) main_~x~0 (* 5 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0)))) (< 0 main_~k~0) (= main_~c~0 3))} is VALID [2022-04-14 17:53:33,695 INFO L290 TraceCheckUtils]: 38: Hoare triple {3795#(and (= 2 (+ (- 1) main_~y~0)) (<= (+ (* 5 main_~y~0) (* 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) 10)) (+ (* (* main_~y~0 main_~y~0) 10) main_~x~0 (* 5 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0)))) (< 0 main_~k~0) (= main_~c~0 3))} assume !false; {3795#(and (= 2 (+ (- 1) main_~y~0)) (<= (+ (* 5 main_~y~0) (* 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) 10)) (+ (* (* main_~y~0 main_~y~0) 10) main_~x~0 (* 5 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0)))) (< 0 main_~k~0) (= main_~c~0 3))} is VALID [2022-04-14 17:53:33,696 INFO L272 TraceCheckUtils]: 39: Hoare triple {3795#(and (= 2 (+ (- 1) main_~y~0)) (<= (+ (* 5 main_~y~0) (* 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) 10)) (+ (* (* main_~y~0 main_~y~0) 10) main_~x~0 (* 5 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0)))) (< 0 main_~k~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)); {3676#true} is VALID [2022-04-14 17:53:33,696 INFO L290 TraceCheckUtils]: 40: Hoare triple {3676#true} ~cond := #in~cond; {3676#true} is VALID [2022-04-14 17:53:33,696 INFO L290 TraceCheckUtils]: 41: Hoare triple {3676#true} assume !(0 == ~cond); {3676#true} is VALID [2022-04-14 17:53:33,696 INFO L290 TraceCheckUtils]: 42: Hoare triple {3676#true} assume true; {3676#true} is VALID [2022-04-14 17:53:33,696 INFO L284 TraceCheckUtils]: 43: Hoare quadruple {3676#true} {3795#(and (= 2 (+ (- 1) main_~y~0)) (<= (+ (* 5 main_~y~0) (* 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) 10)) (+ (* (* main_~y~0 main_~y~0) 10) main_~x~0 (* 5 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0)))) (< 0 main_~k~0) (= main_~c~0 3))} #57#return; {3795#(and (= 2 (+ (- 1) main_~y~0)) (<= (+ (* 5 main_~y~0) (* 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) 10)) (+ (* (* main_~y~0 main_~y~0) 10) main_~x~0 (* 5 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0)))) (< 0 main_~k~0) (= main_~c~0 3))} is VALID [2022-04-14 17:53:33,698 INFO L290 TraceCheckUtils]: 44: Hoare triple {3795#(and (= 2 (+ (- 1) main_~y~0)) (<= (+ (* 5 main_~y~0) (* 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) 10)) (+ (* (* main_~y~0 main_~y~0) 10) main_~x~0 (* 5 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0)))) (< 0 main_~k~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; {3817#(and (= main_~c~0 4) (<= (+ (* main_~y~0 85) (* 3 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (* (* main_~y~0 main_~y~0 main_~y~0) 50)) (+ (* (* main_~y~0 main_~y~0 main_~y~0 main_~y~0) 15) 32 main_~x~0 (* 90 (* main_~y~0 main_~y~0)))) (< 0 main_~k~0) (= (+ (- 2) main_~y~0) 2))} is VALID [2022-04-14 17:53:33,699 INFO L290 TraceCheckUtils]: 45: Hoare triple {3817#(and (= main_~c~0 4) (<= (+ (* main_~y~0 85) (* 3 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (* (* main_~y~0 main_~y~0 main_~y~0) 50)) (+ (* (* main_~y~0 main_~y~0 main_~y~0 main_~y~0) 15) 32 main_~x~0 (* 90 (* main_~y~0 main_~y~0)))) (< 0 main_~k~0) (= (+ (- 2) main_~y~0) 2))} assume !false; {3817#(and (= main_~c~0 4) (<= (+ (* main_~y~0 85) (* 3 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (* (* main_~y~0 main_~y~0 main_~y~0) 50)) (+ (* (* main_~y~0 main_~y~0 main_~y~0 main_~y~0) 15) 32 main_~x~0 (* 90 (* main_~y~0 main_~y~0)))) (< 0 main_~k~0) (= (+ (- 2) main_~y~0) 2))} is VALID [2022-04-14 17:53:33,706 INFO L272 TraceCheckUtils]: 46: Hoare triple {3817#(and (= main_~c~0 4) (<= (+ (* main_~y~0 85) (* 3 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (* (* main_~y~0 main_~y~0 main_~y~0) 50)) (+ (* (* main_~y~0 main_~y~0 main_~y~0 main_~y~0) 15) 32 main_~x~0 (* 90 (* main_~y~0 main_~y~0)))) (< 0 main_~k~0) (= (+ (- 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)); {3676#true} is VALID [2022-04-14 17:53:33,707 INFO L290 TraceCheckUtils]: 47: Hoare triple {3676#true} ~cond := #in~cond; {3676#true} is VALID [2022-04-14 17:53:33,708 INFO L290 TraceCheckUtils]: 48: Hoare triple {3676#true} assume !(0 == ~cond); {3676#true} is VALID [2022-04-14 17:53:33,708 INFO L290 TraceCheckUtils]: 49: Hoare triple {3676#true} assume true; {3676#true} is VALID [2022-04-14 17:53:33,708 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {3676#true} {3817#(and (= main_~c~0 4) (<= (+ (* main_~y~0 85) (* 3 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (* (* main_~y~0 main_~y~0 main_~y~0) 50)) (+ (* (* main_~y~0 main_~y~0 main_~y~0 main_~y~0) 15) 32 main_~x~0 (* 90 (* main_~y~0 main_~y~0)))) (< 0 main_~k~0) (= (+ (- 2) main_~y~0) 2))} #57#return; {3817#(and (= main_~c~0 4) (<= (+ (* main_~y~0 85) (* 3 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (* (* main_~y~0 main_~y~0 main_~y~0) 50)) (+ (* (* main_~y~0 main_~y~0 main_~y~0 main_~y~0) 15) 32 main_~x~0 (* 90 (* main_~y~0 main_~y~0)))) (< 0 main_~k~0) (= (+ (- 2) main_~y~0) 2))} is VALID [2022-04-14 17:53:33,709 INFO L290 TraceCheckUtils]: 51: Hoare triple {3817#(and (= main_~c~0 4) (<= (+ (* main_~y~0 85) (* 3 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (* (* main_~y~0 main_~y~0 main_~y~0) 50)) (+ (* (* main_~y~0 main_~y~0 main_~y~0 main_~y~0) 15) 32 main_~x~0 (* 90 (* main_~y~0 main_~y~0)))) (< 0 main_~k~0) (= (+ (- 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; {3839#(and (<= (+ (* (* main_~y~0 main_~y~0 main_~y~0) 140) (* (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0) 4) (* main_~y~0 490)) (+ main_~x~0 275 (* 30 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (* 360 (* main_~y~0 main_~y~0)))) (= (+ main_~y~0 (- 3)) 2) (= 5 main_~c~0) (< 0 main_~k~0))} is VALID [2022-04-14 17:53:33,710 INFO L290 TraceCheckUtils]: 52: Hoare triple {3839#(and (<= (+ (* (* main_~y~0 main_~y~0 main_~y~0) 140) (* (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0) 4) (* main_~y~0 490)) (+ main_~x~0 275 (* 30 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (* 360 (* main_~y~0 main_~y~0)))) (= (+ main_~y~0 (- 3)) 2) (= 5 main_~c~0) (< 0 main_~k~0))} assume !false; {3839#(and (<= (+ (* (* main_~y~0 main_~y~0 main_~y~0) 140) (* (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0) 4) (* main_~y~0 490)) (+ main_~x~0 275 (* 30 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (* 360 (* main_~y~0 main_~y~0)))) (= (+ main_~y~0 (- 3)) 2) (= 5 main_~c~0) (< 0 main_~k~0))} is VALID [2022-04-14 17:53:33,711 INFO L272 TraceCheckUtils]: 53: Hoare triple {3839#(and (<= (+ (* (* main_~y~0 main_~y~0 main_~y~0) 140) (* (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0) 4) (* main_~y~0 490)) (+ main_~x~0 275 (* 30 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (* 360 (* main_~y~0 main_~y~0)))) (= (+ main_~y~0 (- 3)) 2) (= 5 main_~c~0) (< 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)); {3676#true} is VALID [2022-04-14 17:53:33,711 INFO L290 TraceCheckUtils]: 54: Hoare triple {3676#true} ~cond := #in~cond; {3676#true} is VALID [2022-04-14 17:53:33,711 INFO L290 TraceCheckUtils]: 55: Hoare triple {3676#true} assume !(0 == ~cond); {3676#true} is VALID [2022-04-14 17:53:33,711 INFO L290 TraceCheckUtils]: 56: Hoare triple {3676#true} assume true; {3676#true} is VALID [2022-04-14 17:53:33,711 INFO L284 TraceCheckUtils]: 57: Hoare quadruple {3676#true} {3839#(and (<= (+ (* (* main_~y~0 main_~y~0 main_~y~0) 140) (* (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0) 4) (* main_~y~0 490)) (+ main_~x~0 275 (* 30 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (* 360 (* main_~y~0 main_~y~0)))) (= (+ main_~y~0 (- 3)) 2) (= 5 main_~c~0) (< 0 main_~k~0))} #57#return; {3839#(and (<= (+ (* (* main_~y~0 main_~y~0 main_~y~0) 140) (* (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0) 4) (* main_~y~0 490)) (+ main_~x~0 275 (* 30 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (* 360 (* main_~y~0 main_~y~0)))) (= (+ main_~y~0 (- 3)) 2) (= 5 main_~c~0) (< 0 main_~k~0))} is VALID [2022-04-14 17:53:33,712 INFO L290 TraceCheckUtils]: 58: Hoare triple {3839#(and (<= (+ (* (* main_~y~0 main_~y~0 main_~y~0) 140) (* (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0) 4) (* main_~y~0 490)) (+ main_~x~0 275 (* 30 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (* 360 (* main_~y~0 main_~y~0)))) (= (+ main_~y~0 (- 3)) 2) (= 5 main_~c~0) (< 0 main_~k~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; {3861#(and (= (+ main_~y~0 (- 4)) 2) (= (+ (- 1) main_~c~0) 5) (<= (+ (* main_~y~0 1770) (* (* main_~y~0 main_~y~0 main_~y~0) 300) (* 5 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0))) (+ 1299 (* 1000 (* main_~y~0 main_~y~0)) (* (* main_~y~0 main_~y~0 main_~y~0 main_~y~0) 50) main_~x~0)) (< 0 main_~k~0))} is VALID [2022-04-14 17:53:33,712 INFO L290 TraceCheckUtils]: 59: Hoare triple {3861#(and (= (+ main_~y~0 (- 4)) 2) (= (+ (- 1) main_~c~0) 5) (<= (+ (* main_~y~0 1770) (* (* main_~y~0 main_~y~0 main_~y~0) 300) (* 5 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0))) (+ 1299 (* 1000 (* main_~y~0 main_~y~0)) (* (* main_~y~0 main_~y~0 main_~y~0 main_~y~0) 50) main_~x~0)) (< 0 main_~k~0))} assume !false; {3861#(and (= (+ main_~y~0 (- 4)) 2) (= (+ (- 1) main_~c~0) 5) (<= (+ (* main_~y~0 1770) (* (* main_~y~0 main_~y~0 main_~y~0) 300) (* 5 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0))) (+ 1299 (* 1000 (* main_~y~0 main_~y~0)) (* (* main_~y~0 main_~y~0 main_~y~0 main_~y~0) 50) main_~x~0)) (< 0 main_~k~0))} is VALID [2022-04-14 17:53:33,713 INFO L272 TraceCheckUtils]: 60: Hoare triple {3861#(and (= (+ main_~y~0 (- 4)) 2) (= (+ (- 1) main_~c~0) 5) (<= (+ (* main_~y~0 1770) (* (* main_~y~0 main_~y~0 main_~y~0) 300) (* 5 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0))) (+ 1299 (* 1000 (* main_~y~0 main_~y~0)) (* (* main_~y~0 main_~y~0 main_~y~0 main_~y~0) 50) main_~x~0)) (< 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)); {3676#true} is VALID [2022-04-14 17:53:33,713 INFO L290 TraceCheckUtils]: 61: Hoare triple {3676#true} ~cond := #in~cond; {3676#true} is VALID [2022-04-14 17:53:33,713 INFO L290 TraceCheckUtils]: 62: Hoare triple {3676#true} assume !(0 == ~cond); {3676#true} is VALID [2022-04-14 17:53:33,713 INFO L290 TraceCheckUtils]: 63: Hoare triple {3676#true} assume true; {3676#true} is VALID [2022-04-14 17:53:33,713 INFO L284 TraceCheckUtils]: 64: Hoare quadruple {3676#true} {3861#(and (= (+ main_~y~0 (- 4)) 2) (= (+ (- 1) main_~c~0) 5) (<= (+ (* main_~y~0 1770) (* (* main_~y~0 main_~y~0 main_~y~0) 300) (* 5 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0))) (+ 1299 (* 1000 (* main_~y~0 main_~y~0)) (* (* main_~y~0 main_~y~0 main_~y~0 main_~y~0) 50) main_~x~0)) (< 0 main_~k~0))} #57#return; {3861#(and (= (+ main_~y~0 (- 4)) 2) (= (+ (- 1) main_~c~0) 5) (<= (+ (* main_~y~0 1770) (* (* main_~y~0 main_~y~0 main_~y~0) 300) (* 5 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0))) (+ 1299 (* 1000 (* main_~y~0 main_~y~0)) (* (* main_~y~0 main_~y~0 main_~y~0 main_~y~0) 50) main_~x~0)) (< 0 main_~k~0))} is VALID [2022-04-14 17:53:33,714 INFO L290 TraceCheckUtils]: 65: Hoare triple {3861#(and (= (+ main_~y~0 (- 4)) 2) (= (+ (- 1) main_~c~0) 5) (<= (+ (* main_~y~0 1770) (* (* main_~y~0 main_~y~0 main_~y~0) 300) (* 5 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0))) (+ 1299 (* 1000 (* main_~y~0 main_~y~0)) (* (* main_~y~0 main_~y~0 main_~y~0 main_~y~0) 50) main_~x~0)) (< 0 main_~k~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; {3883#(and (<= main_~c~0 7) (<= (+ (* (* main_~y~0 main_~y~0 main_~y~0) 550) (* main_~y~0 4895) (* 6 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0))) (+ (* (* main_~y~0 main_~y~0 main_~y~0 main_~y~0) 75) 4424 main_~x~0 (* 2250 (* main_~y~0 main_~y~0)))) (= 7 main_~y~0) (< 6 main_~k~0))} is VALID [2022-04-14 17:53:33,714 INFO L290 TraceCheckUtils]: 66: Hoare triple {3883#(and (<= main_~c~0 7) (<= (+ (* (* main_~y~0 main_~y~0 main_~y~0) 550) (* main_~y~0 4895) (* 6 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0))) (+ (* (* main_~y~0 main_~y~0 main_~y~0 main_~y~0) 75) 4424 main_~x~0 (* 2250 (* main_~y~0 main_~y~0)))) (= 7 main_~y~0) (< 6 main_~k~0))} assume !false; {3883#(and (<= main_~c~0 7) (<= (+ (* (* main_~y~0 main_~y~0 main_~y~0) 550) (* main_~y~0 4895) (* 6 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0))) (+ (* (* main_~y~0 main_~y~0 main_~y~0 main_~y~0) 75) 4424 main_~x~0 (* 2250 (* main_~y~0 main_~y~0)))) (= 7 main_~y~0) (< 6 main_~k~0))} is VALID [2022-04-14 17:53:33,714 INFO L272 TraceCheckUtils]: 67: Hoare triple {3883#(and (<= main_~c~0 7) (<= (+ (* (* main_~y~0 main_~y~0 main_~y~0) 550) (* main_~y~0 4895) (* 6 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0))) (+ (* (* main_~y~0 main_~y~0 main_~y~0 main_~y~0) 75) 4424 main_~x~0 (* 2250 (* main_~y~0 main_~y~0)))) (= 7 main_~y~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)); {3676#true} is VALID [2022-04-14 17:53:33,714 INFO L290 TraceCheckUtils]: 68: Hoare triple {3676#true} ~cond := #in~cond; {3676#true} is VALID [2022-04-14 17:53:33,715 INFO L290 TraceCheckUtils]: 69: Hoare triple {3676#true} assume !(0 == ~cond); {3676#true} is VALID [2022-04-14 17:53:33,715 INFO L290 TraceCheckUtils]: 70: Hoare triple {3676#true} assume true; {3676#true} is VALID [2022-04-14 17:53:33,715 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {3676#true} {3883#(and (<= main_~c~0 7) (<= (+ (* (* main_~y~0 main_~y~0 main_~y~0) 550) (* main_~y~0 4895) (* 6 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0))) (+ (* (* main_~y~0 main_~y~0 main_~y~0 main_~y~0) 75) 4424 main_~x~0 (* 2250 (* main_~y~0 main_~y~0)))) (= 7 main_~y~0) (< 6 main_~k~0))} #57#return; {3883#(and (<= main_~c~0 7) (<= (+ (* (* main_~y~0 main_~y~0 main_~y~0) 550) (* main_~y~0 4895) (* 6 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0))) (+ (* (* main_~y~0 main_~y~0 main_~y~0 main_~y~0) 75) 4424 main_~x~0 (* 2250 (* main_~y~0 main_~y~0)))) (= 7 main_~y~0) (< 6 main_~k~0))} is VALID [2022-04-14 17:53:33,715 INFO L290 TraceCheckUtils]: 72: Hoare triple {3883#(and (<= main_~c~0 7) (<= (+ (* (* main_~y~0 main_~y~0 main_~y~0) 550) (* main_~y~0 4895) (* 6 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0))) (+ (* (* main_~y~0 main_~y~0 main_~y~0 main_~y~0) 75) 4424 main_~x~0 (* 2250 (* main_~y~0 main_~y~0)))) (= 7 main_~y~0) (< 6 main_~k~0))} assume !(~c~0 < ~k~0); {3905#(and (<= main_~k~0 7) (<= (+ (* (* main_~y~0 main_~y~0 main_~y~0) 550) (* main_~y~0 4895) (* 6 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0))) (+ (* (* main_~y~0 main_~y~0 main_~y~0 main_~y~0) 75) 4424 main_~x~0 (* 2250 (* main_~y~0 main_~y~0)))) (= 7 main_~y~0) (< 6 main_~k~0))} is VALID [2022-04-14 17:53:33,716 INFO L272 TraceCheckUtils]: 73: Hoare triple {3905#(and (<= main_~k~0 7) (<= (+ (* (* main_~y~0 main_~y~0 main_~y~0) 550) (* main_~y~0 4895) (* 6 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0))) (+ (* (* main_~y~0 main_~y~0 main_~y~0 main_~y~0) 75) 4424 main_~x~0 (* 2250 (* main_~y~0 main_~y~0)))) (= 7 main_~y~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)); {3676#true} is VALID [2022-04-14 17:53:33,716 INFO L290 TraceCheckUtils]: 74: Hoare triple {3676#true} ~cond := #in~cond; {3912#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-14 17:53:33,716 INFO L290 TraceCheckUtils]: 75: Hoare triple {3912#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {3916#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-14 17:53:33,716 INFO L290 TraceCheckUtils]: 76: Hoare triple {3916#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {3916#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-14 17:53:33,717 INFO L284 TraceCheckUtils]: 77: Hoare quadruple {3916#(not (= |__VERIFIER_assert_#in~cond| 0))} {3905#(and (<= main_~k~0 7) (<= (+ (* (* main_~y~0 main_~y~0 main_~y~0) 550) (* main_~y~0 4895) (* 6 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0))) (+ (* (* main_~y~0 main_~y~0 main_~y~0 main_~y~0) 75) 4424 main_~x~0 (* 2250 (* main_~y~0 main_~y~0)))) (= 7 main_~y~0) (< 6 main_~k~0))} #59#return; {3923#(and (<= main_~k~0 7) (= 7 main_~y~0) (< 6 main_~k~0))} is VALID [2022-04-14 17:53:33,717 INFO L272 TraceCheckUtils]: 78: Hoare triple {3923#(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)); {3927#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-14 17:53:33,718 INFO L290 TraceCheckUtils]: 79: Hoare triple {3927#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {3931#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-14 17:53:33,718 INFO L290 TraceCheckUtils]: 80: Hoare triple {3931#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {3677#false} is VALID [2022-04-14 17:53:33,718 INFO L290 TraceCheckUtils]: 81: Hoare triple {3677#false} assume !false; {3677#false} is VALID [2022-04-14 17:53:33,719 INFO L134 CoverageAnalysis]: Checked inductivity of 250 backedges. 41 proven. 85 refuted. 0 times theorem prover too weak. 124 trivial. 0 not checked. [2022-04-14 17:53:33,719 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-14 17:54:10,598 WARN L833 $PredicateComparison]: unable to prove that (or (< (div (+ (* 600 c_main_~y~0) (* 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) 216 (* 480 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 185) (* 719 c_main_~y~0 c_main_~y~0) (* 30 c_main_~y~0 c_main_~y~0 c_main_~y~0 c_main_~y~0 c_main_~y~0)) 12) (+ (* 60 (* c_main_~y~0 c_main_~y~0)) (* 15 (* c_main_~y~0 c_main_~y~0 c_main_~y~0 c_main_~y~0)) (* 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 50) 18 c_main_~x~0 (* (* c_main_~y~0 c_main_~y~0 c_main_~y~0) 40))) (not (< (+ 2 c_main_~c~0) c_main_~k~0)) (let ((.cse0 (+ 3 c_main_~y~0))) (= (* .cse0 c_main_~k~0) (* .cse0 .cse0))) (< (+ 3 c_main_~c~0) c_main_~k~0) (not (= (mod (let ((.cse1 (+ c_main_~y~0 1))) (+ (* 18 .cse1 .cse1 .cse1 .cse1 .cse1) (* 2 .cse1 .cse1 .cse1 .cse1 .cse1 .cse1) (* 65 .cse1 .cse1 .cse1 .cse1) (* 119 .cse1 .cse1) (* .cse1 .cse1 .cse1 120))) 12) 0))) is different from false [2022-04-14 17:54:28,508 WARN L232 SmtUtils]: Spent 5.01s on a formula simplification that was a NOOP. DAG size: 18 (called from [L1074] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2022-04-14 17:55:45,623 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-14 17:55:45,623 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2077951277] [2022-04-14 17:55:45,623 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-14 17:55:45,623 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [733663288] [2022-04-14 17:55:45,623 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [733663288] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-14 17:55:45,623 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-14 17:55:45,623 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2022-04-14 17:55:45,624 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [330964387] [2022-04-14 17:55:45,624 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2022-04-14 17:55:45,624 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 14 states have (on average 2.2857142857142856) internal successors, (32), 14 states have internal predecessors, (32), 11 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (12), 10 states have call predecessors, (12), 10 states have call successors, (12) Word has length 82 [2022-04-14 17:55:45,624 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-14 17:55:45,625 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 16 states, 14 states have (on average 2.2857142857142856) internal successors, (32), 14 states have internal predecessors, (32), 11 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (12), 10 states have call predecessors, (12), 10 states have call successors, (12) [2022-04-14 17:55:45,673 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 58 edges. 58 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-14 17:55:45,673 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-04-14 17:55:45,673 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-14 17:55:45,674 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-04-14 17:55:45,674 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=111, Invalid=536, Unknown=7, NotChecked=48, Total=702 [2022-04-14 17:55:45,674 INFO L87 Difference]: Start difference. First operand 51 states and 59 transitions. Second operand has 16 states, 14 states have (on average 2.2857142857142856) internal successors, (32), 14 states have internal predecessors, (32), 11 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (12), 10 states have call predecessors, (12), 10 states have call successors, (12) [2022-04-14 17:55:48,725 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 17:55:48,725 INFO L93 Difference]: Finished difference Result 60 states and 70 transitions. [2022-04-14 17:55:48,725 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-04-14 17:55:48,726 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 14 states have (on average 2.2857142857142856) internal successors, (32), 14 states have internal predecessors, (32), 11 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (12), 10 states have call predecessors, (12), 10 states have call successors, (12) Word has length 82 [2022-04-14 17:55:48,726 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-14 17:55:48,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 14 states have (on average 2.2857142857142856) internal successors, (32), 14 states have internal predecessors, (32), 11 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (12), 10 states have call predecessors, (12), 10 states have call successors, (12) [2022-04-14 17:55:48,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 66 transitions. [2022-04-14 17:55:48,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 14 states have (on average 2.2857142857142856) internal successors, (32), 14 states have internal predecessors, (32), 11 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (12), 10 states have call predecessors, (12), 10 states have call successors, (12) [2022-04-14 17:55:48,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 66 transitions. [2022-04-14 17:55:48,729 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 15 states and 66 transitions. [2022-04-14 17:55:48,798 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-14 17:55:48,799 INFO L225 Difference]: With dead ends: 60 [2022-04-14 17:55:48,799 INFO L226 Difference]: Without dead ends: 54 [2022-04-14 17:55:48,799 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 144 GetRequests, 115 SyntacticMatches, 1 SemanticMatches, 28 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 84.3s TimeCoverageRelationStatistics Valid=132, Invalid=677, Unknown=7, NotChecked=54, Total=870 [2022-04-14 17:55:48,800 INFO L913 BasicCegarLoop]: 35 mSDtfsCounter, 6 mSDsluCounter, 297 mSDsCounter, 0 mSdLazyCounter, 500 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 332 SdHoareTripleChecker+Invalid, 504 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 500 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-04-14 17:55:48,801 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [6 Valid, 332 Invalid, 504 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 500 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-04-14 17:55:48,801 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2022-04-14 17:55:48,850 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2022-04-14 17:55:48,851 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-14 17:55:48,851 INFO L82 GeneralOperation]: Start isEquivalent. First operand 54 states. Second operand has 54 states, 34 states have (on average 1.0294117647058822) internal successors, (35), 34 states have internal predecessors, (35), 15 states have call successors, (15), 6 states have call predecessors, (15), 4 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2022-04-14 17:55:48,851 INFO L74 IsIncluded]: Start isIncluded. First operand 54 states. Second operand has 54 states, 34 states have (on average 1.0294117647058822) internal successors, (35), 34 states have internal predecessors, (35), 15 states have call successors, (15), 6 states have call predecessors, (15), 4 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2022-04-14 17:55:48,851 INFO L87 Difference]: Start difference. First operand 54 states. Second operand has 54 states, 34 states have (on average 1.0294117647058822) internal successors, (35), 34 states have internal predecessors, (35), 15 states have call successors, (15), 6 states have call predecessors, (15), 4 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2022-04-14 17:55:48,852 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 17:55:48,853 INFO L93 Difference]: Finished difference Result 54 states and 63 transitions. [2022-04-14 17:55:48,853 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 63 transitions. [2022-04-14 17:55:48,853 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 17:55:48,853 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 17:55:48,853 INFO L74 IsIncluded]: Start isIncluded. First operand has 54 states, 34 states have (on average 1.0294117647058822) internal successors, (35), 34 states have internal predecessors, (35), 15 states have call successors, (15), 6 states have call predecessors, (15), 4 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) Second operand 54 states. [2022-04-14 17:55:48,853 INFO L87 Difference]: Start difference. First operand has 54 states, 34 states have (on average 1.0294117647058822) internal successors, (35), 34 states have internal predecessors, (35), 15 states have call successors, (15), 6 states have call predecessors, (15), 4 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) Second operand 54 states. [2022-04-14 17:55:48,854 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 17:55:48,855 INFO L93 Difference]: Finished difference Result 54 states and 63 transitions. [2022-04-14 17:55:48,855 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 63 transitions. [2022-04-14 17:55:48,855 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 17:55:48,855 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 17:55:48,855 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-14 17:55:48,855 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-14 17:55:48,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 34 states have (on average 1.0294117647058822) internal successors, (35), 34 states have internal predecessors, (35), 15 states have call successors, (15), 6 states have call predecessors, (15), 4 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2022-04-14 17:55:48,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 63 transitions. [2022-04-14 17:55:48,856 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 63 transitions. Word has length 82 [2022-04-14 17:55:48,856 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-14 17:55:48,856 INFO L478 AbstractCegarLoop]: Abstraction has 54 states and 63 transitions. [2022-04-14 17:55:48,857 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 14 states have (on average 2.2857142857142856) internal successors, (32), 14 states have internal predecessors, (32), 11 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (12), 10 states have call predecessors, (12), 10 states have call successors, (12) [2022-04-14 17:55:48,857 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 63 transitions. [2022-04-14 17:55:48,857 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2022-04-14 17:55:48,857 INFO L491 BasicCegarLoop]: Found error trace [2022-04-14 17:55:48,857 INFO L499 BasicCegarLoop]: trace histogram [11, 10, 10, 9, 9, 9, 8, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-14 17:55:48,902 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-14 17:55:49,071 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2022-04-14 17:55:49,071 INFO L403 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-14 17:55:49,072 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-14 17:55:49,072 INFO L85 PathProgramCache]: Analyzing trace with hash -1334355539, now seen corresponding path program 8 times [2022-04-14 17:55:49,072 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-14 17:55:49,072 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [356771687] [2022-04-14 17:55:49,072 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 17:55:49,072 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-14 17:55:49,083 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-14 17:55:49,083 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [970670327] [2022-04-14 17:55:49,083 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-14 17:55:49,083 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-14 17:55:49,083 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-14 17:55:49,084 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-14 17:55:49,089 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-14 17:55:49,768 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-14 17:55:49,769 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-14 17:55:49,770 INFO L263 TraceCheckSpWp]: Trace formula consists of 232 conjuncts, 40 conjunts are in the unsatisfiable core [2022-04-14 17:55:49,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 17:55:49,811 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-14 17:55:50,376 INFO L272 TraceCheckUtils]: 0: Hoare triple {4419#true} call ULTIMATE.init(); {4419#true} is VALID [2022-04-14 17:55:50,376 INFO L290 TraceCheckUtils]: 1: Hoare triple {4419#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); {4419#true} is VALID [2022-04-14 17:55:50,376 INFO L290 TraceCheckUtils]: 2: Hoare triple {4419#true} assume true; {4419#true} is VALID [2022-04-14 17:55:50,376 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4419#true} {4419#true} #63#return; {4419#true} is VALID [2022-04-14 17:55:50,376 INFO L272 TraceCheckUtils]: 4: Hoare triple {4419#true} call #t~ret5 := main(); {4419#true} is VALID [2022-04-14 17:55:50,377 INFO L290 TraceCheckUtils]: 5: Hoare triple {4419#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; {4419#true} is VALID [2022-04-14 17:55:50,377 INFO L272 TraceCheckUtils]: 6: Hoare triple {4419#true} call assume_abort_if_not((if ~k~0 >= 0 && ~k~0 <= 20 then 1 else 0)); {4419#true} is VALID [2022-04-14 17:55:50,377 INFO L290 TraceCheckUtils]: 7: Hoare triple {4419#true} ~cond := #in~cond; {4419#true} is VALID [2022-04-14 17:55:50,377 INFO L290 TraceCheckUtils]: 8: Hoare triple {4419#true} assume !(0 == ~cond); {4419#true} is VALID [2022-04-14 17:55:50,377 INFO L290 TraceCheckUtils]: 9: Hoare triple {4419#true} assume true; {4419#true} is VALID [2022-04-14 17:55:50,377 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {4419#true} {4419#true} #53#return; {4419#true} is VALID [2022-04-14 17:55:50,377 INFO L272 TraceCheckUtils]: 11: Hoare triple {4419#true} call assume_abort_if_not((if ~k~0 <= 256 then 1 else 0)); {4419#true} is VALID [2022-04-14 17:55:50,377 INFO L290 TraceCheckUtils]: 12: Hoare triple {4419#true} ~cond := #in~cond; {4419#true} is VALID [2022-04-14 17:55:50,377 INFO L290 TraceCheckUtils]: 13: Hoare triple {4419#true} assume !(0 == ~cond); {4419#true} is VALID [2022-04-14 17:55:50,377 INFO L290 TraceCheckUtils]: 14: Hoare triple {4419#true} assume true; {4419#true} is VALID [2022-04-14 17:55:50,377 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {4419#true} {4419#true} #55#return; {4419#true} is VALID [2022-04-14 17:55:50,378 INFO L290 TraceCheckUtils]: 16: Hoare triple {4419#true} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {4472#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-14 17:55:50,378 INFO L290 TraceCheckUtils]: 17: Hoare triple {4472#(and (= main_~c~0 0) (= main_~y~0 0))} assume !false; {4472#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-14 17:55:50,378 INFO L272 TraceCheckUtils]: 18: Hoare triple {4472#(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)); {4419#true} is VALID [2022-04-14 17:55:50,378 INFO L290 TraceCheckUtils]: 19: Hoare triple {4419#true} ~cond := #in~cond; {4419#true} is VALID [2022-04-14 17:55:50,378 INFO L290 TraceCheckUtils]: 20: Hoare triple {4419#true} assume !(0 == ~cond); {4419#true} is VALID [2022-04-14 17:55:50,378 INFO L290 TraceCheckUtils]: 21: Hoare triple {4419#true} assume true; {4419#true} is VALID [2022-04-14 17:55:50,379 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {4419#true} {4472#(and (= main_~c~0 0) (= main_~y~0 0))} #57#return; {4472#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-14 17:55:50,379 INFO L290 TraceCheckUtils]: 23: Hoare triple {4472#(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; {4494#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} is VALID [2022-04-14 17:55:50,380 INFO L290 TraceCheckUtils]: 24: Hoare triple {4494#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} assume !false; {4494#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} is VALID [2022-04-14 17:55:50,380 INFO L272 TraceCheckUtils]: 25: Hoare triple {4494#(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)); {4419#true} is VALID [2022-04-14 17:55:50,380 INFO L290 TraceCheckUtils]: 26: Hoare triple {4419#true} ~cond := #in~cond; {4419#true} is VALID [2022-04-14 17:55:50,380 INFO L290 TraceCheckUtils]: 27: Hoare triple {4419#true} assume !(0 == ~cond); {4419#true} is VALID [2022-04-14 17:55:50,380 INFO L290 TraceCheckUtils]: 28: Hoare triple {4419#true} assume true; {4419#true} is VALID [2022-04-14 17:55:50,380 INFO L284 TraceCheckUtils]: 29: Hoare quadruple {4419#true} {4494#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} #57#return; {4494#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} is VALID [2022-04-14 17:55:50,381 INFO L290 TraceCheckUtils]: 30: Hoare triple {4494#(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; {4516#(and (= main_~y~0 2) (= main_~c~0 2))} is VALID [2022-04-14 17:55:50,381 INFO L290 TraceCheckUtils]: 31: Hoare triple {4516#(and (= main_~y~0 2) (= main_~c~0 2))} assume !false; {4516#(and (= main_~y~0 2) (= main_~c~0 2))} is VALID [2022-04-14 17:55:50,382 INFO L272 TraceCheckUtils]: 32: Hoare triple {4516#(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)); {4419#true} is VALID [2022-04-14 17:55:50,383 INFO L290 TraceCheckUtils]: 33: Hoare triple {4419#true} ~cond := #in~cond; {4419#true} is VALID [2022-04-14 17:55:50,383 INFO L290 TraceCheckUtils]: 34: Hoare triple {4419#true} assume !(0 == ~cond); {4419#true} is VALID [2022-04-14 17:55:50,383 INFO L290 TraceCheckUtils]: 35: Hoare triple {4419#true} assume true; {4419#true} is VALID [2022-04-14 17:55:50,383 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {4419#true} {4516#(and (= main_~y~0 2) (= main_~c~0 2))} #57#return; {4516#(and (= main_~y~0 2) (= main_~c~0 2))} is VALID [2022-04-14 17:55:50,384 INFO L290 TraceCheckUtils]: 37: Hoare triple {4516#(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; {4538#(and (= main_~y~0 3) (= main_~c~0 3))} is VALID [2022-04-14 17:55:50,384 INFO L290 TraceCheckUtils]: 38: Hoare triple {4538#(and (= main_~y~0 3) (= main_~c~0 3))} assume !false; {4538#(and (= main_~y~0 3) (= main_~c~0 3))} is VALID [2022-04-14 17:55:50,384 INFO L272 TraceCheckUtils]: 39: Hoare triple {4538#(and (= main_~y~0 3) (= 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)); {4419#true} is VALID [2022-04-14 17:55:50,384 INFO L290 TraceCheckUtils]: 40: Hoare triple {4419#true} ~cond := #in~cond; {4419#true} is VALID [2022-04-14 17:55:50,384 INFO L290 TraceCheckUtils]: 41: Hoare triple {4419#true} assume !(0 == ~cond); {4419#true} is VALID [2022-04-14 17:55:50,384 INFO L290 TraceCheckUtils]: 42: Hoare triple {4419#true} assume true; {4419#true} is VALID [2022-04-14 17:55:50,385 INFO L284 TraceCheckUtils]: 43: Hoare quadruple {4419#true} {4538#(and (= main_~y~0 3) (= main_~c~0 3))} #57#return; {4538#(and (= main_~y~0 3) (= main_~c~0 3))} is VALID [2022-04-14 17:55:50,385 INFO L290 TraceCheckUtils]: 44: Hoare triple {4538#(and (= main_~y~0 3) (= main_~c~0 3))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {4560#(and (= (+ (- 1) main_~c~0) 3) (= main_~y~0 4))} is VALID [2022-04-14 17:55:50,386 INFO L290 TraceCheckUtils]: 45: Hoare triple {4560#(and (= (+ (- 1) main_~c~0) 3) (= main_~y~0 4))} assume !false; {4560#(and (= (+ (- 1) main_~c~0) 3) (= main_~y~0 4))} is VALID [2022-04-14 17:55:50,386 INFO L272 TraceCheckUtils]: 46: Hoare triple {4560#(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)); {4419#true} is VALID [2022-04-14 17:55:50,386 INFO L290 TraceCheckUtils]: 47: Hoare triple {4419#true} ~cond := #in~cond; {4419#true} is VALID [2022-04-14 17:55:50,386 INFO L290 TraceCheckUtils]: 48: Hoare triple {4419#true} assume !(0 == ~cond); {4419#true} is VALID [2022-04-14 17:55:50,386 INFO L290 TraceCheckUtils]: 49: Hoare triple {4419#true} assume true; {4419#true} is VALID [2022-04-14 17:55:50,386 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {4419#true} {4560#(and (= (+ (- 1) main_~c~0) 3) (= main_~y~0 4))} #57#return; {4560#(and (= (+ (- 1) main_~c~0) 3) (= main_~y~0 4))} is VALID [2022-04-14 17:55:50,387 INFO L290 TraceCheckUtils]: 51: Hoare triple {4560#(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; {4582#(and (= 5 main_~c~0) (= (+ (- 1) main_~y~0) 4))} is VALID [2022-04-14 17:55:50,387 INFO L290 TraceCheckUtils]: 52: Hoare triple {4582#(and (= 5 main_~c~0) (= (+ (- 1) main_~y~0) 4))} assume !false; {4582#(and (= 5 main_~c~0) (= (+ (- 1) main_~y~0) 4))} is VALID [2022-04-14 17:55:50,387 INFO L272 TraceCheckUtils]: 53: Hoare triple {4582#(and (= 5 main_~c~0) (= (+ (- 1) 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)); {4419#true} is VALID [2022-04-14 17:55:50,387 INFO L290 TraceCheckUtils]: 54: Hoare triple {4419#true} ~cond := #in~cond; {4419#true} is VALID [2022-04-14 17:55:50,388 INFO L290 TraceCheckUtils]: 55: Hoare triple {4419#true} assume !(0 == ~cond); {4419#true} is VALID [2022-04-14 17:55:50,388 INFO L290 TraceCheckUtils]: 56: Hoare triple {4419#true} assume true; {4419#true} is VALID [2022-04-14 17:55:50,388 INFO L284 TraceCheckUtils]: 57: Hoare quadruple {4419#true} {4582#(and (= 5 main_~c~0) (= (+ (- 1) main_~y~0) 4))} #57#return; {4582#(and (= 5 main_~c~0) (= (+ (- 1) main_~y~0) 4))} is VALID [2022-04-14 17:55:50,389 INFO L290 TraceCheckUtils]: 58: Hoare triple {4582#(and (= 5 main_~c~0) (= (+ (- 1) main_~y~0) 4))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {4604#(and (= main_~c~0 6) (= (+ (- 2) main_~y~0) 4))} is VALID [2022-04-14 17:55:50,389 INFO L290 TraceCheckUtils]: 59: Hoare triple {4604#(and (= main_~c~0 6) (= (+ (- 2) main_~y~0) 4))} assume !false; {4604#(and (= main_~c~0 6) (= (+ (- 2) main_~y~0) 4))} is VALID [2022-04-14 17:55:50,389 INFO L272 TraceCheckUtils]: 60: Hoare triple {4604#(and (= main_~c~0 6) (= (+ (- 2) 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)); {4419#true} is VALID [2022-04-14 17:55:50,389 INFO L290 TraceCheckUtils]: 61: Hoare triple {4419#true} ~cond := #in~cond; {4419#true} is VALID [2022-04-14 17:55:50,389 INFO L290 TraceCheckUtils]: 62: Hoare triple {4419#true} assume !(0 == ~cond); {4419#true} is VALID [2022-04-14 17:55:50,389 INFO L290 TraceCheckUtils]: 63: Hoare triple {4419#true} assume true; {4419#true} is VALID [2022-04-14 17:55:50,390 INFO L284 TraceCheckUtils]: 64: Hoare quadruple {4419#true} {4604#(and (= main_~c~0 6) (= (+ (- 2) main_~y~0) 4))} #57#return; {4604#(and (= main_~c~0 6) (= (+ (- 2) main_~y~0) 4))} is VALID [2022-04-14 17:55:50,390 INFO L290 TraceCheckUtils]: 65: Hoare triple {4604#(and (= main_~c~0 6) (= (+ (- 2) 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; {4626#(and (= 7 main_~y~0) (= (+ (- 1) main_~c~0) 6))} is VALID [2022-04-14 17:55:50,391 INFO L290 TraceCheckUtils]: 66: Hoare triple {4626#(and (= 7 main_~y~0) (= (+ (- 1) main_~c~0) 6))} assume !false; {4626#(and (= 7 main_~y~0) (= (+ (- 1) main_~c~0) 6))} is VALID [2022-04-14 17:55:50,391 INFO L272 TraceCheckUtils]: 67: Hoare triple {4626#(and (= 7 main_~y~0) (= (+ (- 1) main_~c~0) 6))} 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)); {4419#true} is VALID [2022-04-14 17:55:50,391 INFO L290 TraceCheckUtils]: 68: Hoare triple {4419#true} ~cond := #in~cond; {4419#true} is VALID [2022-04-14 17:55:50,391 INFO L290 TraceCheckUtils]: 69: Hoare triple {4419#true} assume !(0 == ~cond); {4419#true} is VALID [2022-04-14 17:55:50,391 INFO L290 TraceCheckUtils]: 70: Hoare triple {4419#true} assume true; {4419#true} is VALID [2022-04-14 17:55:50,391 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {4419#true} {4626#(and (= 7 main_~y~0) (= (+ (- 1) main_~c~0) 6))} #57#return; {4626#(and (= 7 main_~y~0) (= (+ (- 1) main_~c~0) 6))} is VALID [2022-04-14 17:55:50,392 INFO L290 TraceCheckUtils]: 72: Hoare triple {4626#(and (= 7 main_~y~0) (= (+ (- 1) main_~c~0) 6))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {4648#(and (< 7 main_~k~0) (= 7 (+ (- 1) main_~y~0)) (<= main_~c~0 8))} is VALID [2022-04-14 17:55:50,392 INFO L290 TraceCheckUtils]: 73: Hoare triple {4648#(and (< 7 main_~k~0) (= 7 (+ (- 1) main_~y~0)) (<= main_~c~0 8))} assume !false; {4648#(and (< 7 main_~k~0) (= 7 (+ (- 1) main_~y~0)) (<= main_~c~0 8))} is VALID [2022-04-14 17:55:50,392 INFO L272 TraceCheckUtils]: 74: Hoare triple {4648#(and (< 7 main_~k~0) (= 7 (+ (- 1) main_~y~0)) (<= 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)); {4419#true} is VALID [2022-04-14 17:55:50,392 INFO L290 TraceCheckUtils]: 75: Hoare triple {4419#true} ~cond := #in~cond; {4419#true} is VALID [2022-04-14 17:55:50,392 INFO L290 TraceCheckUtils]: 76: Hoare triple {4419#true} assume !(0 == ~cond); {4419#true} is VALID [2022-04-14 17:55:50,392 INFO L290 TraceCheckUtils]: 77: Hoare triple {4419#true} assume true; {4419#true} is VALID [2022-04-14 17:55:50,393 INFO L284 TraceCheckUtils]: 78: Hoare quadruple {4419#true} {4648#(and (< 7 main_~k~0) (= 7 (+ (- 1) main_~y~0)) (<= main_~c~0 8))} #57#return; {4648#(and (< 7 main_~k~0) (= 7 (+ (- 1) main_~y~0)) (<= main_~c~0 8))} is VALID [2022-04-14 17:55:50,393 INFO L290 TraceCheckUtils]: 79: Hoare triple {4648#(and (< 7 main_~k~0) (= 7 (+ (- 1) main_~y~0)) (<= main_~c~0 8))} assume !(~c~0 < ~k~0); {4670#(and (< 7 main_~k~0) (= 7 (+ (- 1) main_~y~0)) (<= main_~k~0 8))} is VALID [2022-04-14 17:55:50,393 INFO L272 TraceCheckUtils]: 80: Hoare triple {4670#(and (< 7 main_~k~0) (= 7 (+ (- 1) main_~y~0)) (<= 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)); {4419#true} is VALID [2022-04-14 17:55:50,393 INFO L290 TraceCheckUtils]: 81: Hoare triple {4419#true} ~cond := #in~cond; {4419#true} is VALID [2022-04-14 17:55:50,394 INFO L290 TraceCheckUtils]: 82: Hoare triple {4419#true} assume !(0 == ~cond); {4419#true} is VALID [2022-04-14 17:55:50,394 INFO L290 TraceCheckUtils]: 83: Hoare triple {4419#true} assume true; {4419#true} is VALID [2022-04-14 17:55:50,394 INFO L284 TraceCheckUtils]: 84: Hoare quadruple {4419#true} {4670#(and (< 7 main_~k~0) (= 7 (+ (- 1) main_~y~0)) (<= main_~k~0 8))} #59#return; {4670#(and (< 7 main_~k~0) (= 7 (+ (- 1) main_~y~0)) (<= main_~k~0 8))} is VALID [2022-04-14 17:55:50,395 INFO L272 TraceCheckUtils]: 85: Hoare triple {4670#(and (< 7 main_~k~0) (= 7 (+ (- 1) main_~y~0)) (<= main_~k~0 8))} call __VERIFIER_assert((if ~k~0 * ~y~0 == ~y~0 * ~y~0 then 1 else 0)); {4689#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-14 17:55:50,395 INFO L290 TraceCheckUtils]: 86: Hoare triple {4689#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {4693#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-14 17:55:50,395 INFO L290 TraceCheckUtils]: 87: Hoare triple {4693#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {4420#false} is VALID [2022-04-14 17:55:50,395 INFO L290 TraceCheckUtils]: 88: Hoare triple {4420#false} assume !false; {4420#false} is VALID [2022-04-14 17:55:50,396 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 20 proven. 108 refuted. 0 times theorem prover too weak. 184 trivial. 0 not checked. [2022-04-14 17:55:50,396 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-14 17:55:50,800 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-14 17:55:50,800 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [356771687] [2022-04-14 17:55:50,801 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-14 17:55:50,801 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [970670327] [2022-04-14 17:55:50,801 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [970670327] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-14 17:55:50,801 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-14 17:55:50,801 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2022-04-14 17:55:50,801 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [238007197] [2022-04-14 17:55:50,801 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2022-04-14 17:55:50,801 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 2.3846153846153846) internal successors, (31), 13 states have internal predecessors, (31), 11 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (13), 11 states have call predecessors, (13), 11 states have call successors, (13) Word has length 89 [2022-04-14 17:55:50,804 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-14 17:55:50,804 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 14 states, 13 states have (on average 2.3846153846153846) internal successors, (31), 13 states have internal predecessors, (31), 11 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (13), 11 states have call predecessors, (13), 11 states have call successors, (13) [2022-04-14 17:55:50,853 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 59 edges. 59 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-14 17:55:50,853 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-04-14 17:55:50,854 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-14 17:55:50,854 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-04-14 17:55:50,854 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=227, Unknown=0, NotChecked=0, Total=272 [2022-04-14 17:55:50,854 INFO L87 Difference]: Start difference. First operand 54 states and 63 transitions. Second operand has 14 states, 13 states have (on average 2.3846153846153846) internal successors, (31), 13 states have internal predecessors, (31), 11 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (13), 11 states have call predecessors, (13), 11 states have call successors, (13) [2022-04-14 17:55:51,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 17:55:51,891 INFO L93 Difference]: Finished difference Result 63 states and 74 transitions. [2022-04-14 17:55:51,891 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-04-14 17:55:51,891 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 2.3846153846153846) internal successors, (31), 13 states have internal predecessors, (31), 11 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (13), 11 states have call predecessors, (13), 11 states have call successors, (13) Word has length 89 [2022-04-14 17:55:51,891 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-14 17:55:51,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 13 states have (on average 2.3846153846153846) internal successors, (31), 13 states have internal predecessors, (31), 11 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (13), 11 states have call predecessors, (13), 11 states have call successors, (13) [2022-04-14 17:55:51,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 70 transitions. [2022-04-14 17:55:51,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 13 states have (on average 2.3846153846153846) internal successors, (31), 13 states have internal predecessors, (31), 11 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (13), 11 states have call predecessors, (13), 11 states have call successors, (13) [2022-04-14 17:55:51,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 70 transitions. [2022-04-14 17:55:51,908 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 14 states and 70 transitions. [2022-04-14 17:55:51,952 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 70 edges. 70 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-14 17:55:51,959 INFO L225 Difference]: With dead ends: 63 [2022-04-14 17:55:51,959 INFO L226 Difference]: Without dead ends: 57 [2022-04-14 17:55:51,962 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 90 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=55, Invalid=287, Unknown=0, NotChecked=0, Total=342 [2022-04-14 17:55:51,963 INFO L913 BasicCegarLoop]: 51 mSDtfsCounter, 2 mSDsluCounter, 343 mSDsCounter, 0 mSdLazyCounter, 381 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 394 SdHoareTripleChecker+Invalid, 382 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 381 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-04-14 17:55:51,963 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [2 Valid, 394 Invalid, 382 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 381 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-04-14 17:55:51,964 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2022-04-14 17:55:51,997 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2022-04-14 17:55:51,997 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-14 17:55:51,999 INFO L82 GeneralOperation]: Start isEquivalent. First operand 57 states. Second operand has 57 states, 36 states have (on average 1.0277777777777777) internal successors, (37), 36 states have internal predecessors, (37), 16 states have call successors, (16), 6 states have call predecessors, (16), 4 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2022-04-14 17:55:51,999 INFO L74 IsIncluded]: Start isIncluded. First operand 57 states. Second operand has 57 states, 36 states have (on average 1.0277777777777777) internal successors, (37), 36 states have internal predecessors, (37), 16 states have call successors, (16), 6 states have call predecessors, (16), 4 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2022-04-14 17:55:51,999 INFO L87 Difference]: Start difference. First operand 57 states. Second operand has 57 states, 36 states have (on average 1.0277777777777777) internal successors, (37), 36 states have internal predecessors, (37), 16 states have call successors, (16), 6 states have call predecessors, (16), 4 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2022-04-14 17:55:52,004 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 17:55:52,004 INFO L93 Difference]: Finished difference Result 57 states and 67 transitions. [2022-04-14 17:55:52,004 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 67 transitions. [2022-04-14 17:55:52,004 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 17:55:52,005 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 17:55:52,005 INFO L74 IsIncluded]: Start isIncluded. First operand has 57 states, 36 states have (on average 1.0277777777777777) internal successors, (37), 36 states have internal predecessors, (37), 16 states have call successors, (16), 6 states have call predecessors, (16), 4 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) Second operand 57 states. [2022-04-14 17:55:52,005 INFO L87 Difference]: Start difference. First operand has 57 states, 36 states have (on average 1.0277777777777777) internal successors, (37), 36 states have internal predecessors, (37), 16 states have call successors, (16), 6 states have call predecessors, (16), 4 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) Second operand 57 states. [2022-04-14 17:55:52,016 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 17:55:52,017 INFO L93 Difference]: Finished difference Result 57 states and 67 transitions. [2022-04-14 17:55:52,017 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 67 transitions. [2022-04-14 17:55:52,021 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 17:55:52,021 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 17:55:52,021 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-14 17:55:52,021 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-14 17:55:52,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 36 states have (on average 1.0277777777777777) internal successors, (37), 36 states have internal predecessors, (37), 16 states have call successors, (16), 6 states have call predecessors, (16), 4 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2022-04-14 17:55:52,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 67 transitions. [2022-04-14 17:55:52,024 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 67 transitions. Word has length 89 [2022-04-14 17:55:52,024 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-14 17:55:52,024 INFO L478 AbstractCegarLoop]: Abstraction has 57 states and 67 transitions. [2022-04-14 17:55:52,025 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 2.3846153846153846) internal successors, (31), 13 states have internal predecessors, (31), 11 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (13), 11 states have call predecessors, (13), 11 states have call successors, (13) [2022-04-14 17:55:52,025 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 67 transitions. [2022-04-14 17:55:52,026 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2022-04-14 17:55:52,026 INFO L491 BasicCegarLoop]: Found error trace [2022-04-14 17:55:52,026 INFO L499 BasicCegarLoop]: trace histogram [12, 11, 11, 10, 10, 10, 9, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-14 17:55:52,032 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-14 17:55:52,232 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2022-04-14 17:55:52,232 INFO L403 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-14 17:55:52,232 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-14 17:55:52,232 INFO L85 PathProgramCache]: Analyzing trace with hash 711483229, now seen corresponding path program 9 times [2022-04-14 17:55:52,233 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-14 17:55:52,233 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1800742711] [2022-04-14 17:55:52,233 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 17:55:52,233 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-14 17:55:52,260 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-14 17:55:52,260 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [483213820] [2022-04-14 17:55:52,260 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-04-14 17:55:52,260 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-14 17:55:52,261 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-14 17:55:52,261 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-14 17:55:52,262 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process