/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_valuebound10.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-e106359-m [2022-04-14 17:52:01,529 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-14 17:52:01,530 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-14 17:52:01,551 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-14 17:52:01,551 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-14 17:52:01,552 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-14 17:52:01,553 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-14 17:52:01,554 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-14 17:52:01,555 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-14 17:52:01,555 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-14 17:52:01,556 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-14 17:52:01,557 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-14 17:52:01,557 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-14 17:52:01,557 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-14 17:52:01,558 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-14 17:52:01,559 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-14 17:52:01,559 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-14 17:52:01,560 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-14 17:52:01,561 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-14 17:52:01,562 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-14 17:52:01,563 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-14 17:52:01,564 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-14 17:52:01,565 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-14 17:52:01,565 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-14 17:52:01,566 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-14 17:52:01,568 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-14 17:52:01,568 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-14 17:52:01,569 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-14 17:52:01,569 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-14 17:52:01,570 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-14 17:52:01,570 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-14 17:52:01,570 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-14 17:52:01,571 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-14 17:52:01,571 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-14 17:52:01,572 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-14 17:52:01,572 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-14 17:52:01,573 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-14 17:52:01,573 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-14 17:52:01,573 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-14 17:52:01,574 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-14 17:52:01,574 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-14 17:52:01,575 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-14 17:52:01,575 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:01,588 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-14 17:52:01,589 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-14 17:52:01,589 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-04-14 17:52:01,589 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-04-14 17:52:01,589 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-04-14 17:52:01,589 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-04-14 17:52:01,590 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-04-14 17:52:01,590 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-04-14 17:52:01,590 INFO L138 SettingsManager]: * Use SBE=true [2022-04-14 17:52:01,590 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-14 17:52:01,590 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-14 17:52:01,590 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-14 17:52:01,591 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-14 17:52:01,591 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-14 17:52:01,591 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-14 17:52:01,591 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-14 17:52:01,591 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-14 17:52:01,591 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-14 17:52:01,591 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-14 17:52:01,591 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-14 17:52:01,592 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-14 17:52:01,592 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-14 17:52:01,592 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-14 17:52:01,592 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-14 17:52:01,592 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-14 17:52:01,592 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-14 17:52:01,592 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-04-14 17:52:01,592 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-04-14 17:52:01,593 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-04-14 17:52:01,593 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-04-14 17:52:01,593 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-04-14 17:52:01,593 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-04-14 17:52:01,593 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-14 17:52:01,593 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:01,731 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-14 17:52:01,752 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-14 17:52:01,754 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-14 17:52:01,755 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-14 17:52:01,755 INFO L275 PluginConnector]: CDTParser initialized [2022-04-14 17:52:01,756 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/nla-digbench-scaling/ps6-ll_valuebound10.c [2022-04-14 17:52:01,812 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a8b77b8e3/9d726ac04ddb4398b1cd2501c03c15df/FLAG7d393fd08 [2022-04-14 17:52:02,153 INFO L306 CDTParser]: Found 1 translation units. [2022-04-14 17:52:02,154 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/ps6-ll_valuebound10.c [2022-04-14 17:52:02,158 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a8b77b8e3/9d726ac04ddb4398b1cd2501c03c15df/FLAG7d393fd08 [2022-04-14 17:52:02,590 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a8b77b8e3/9d726ac04ddb4398b1cd2501c03c15df [2022-04-14 17:52:02,591 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-14 17:52:02,592 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-14 17:52:02,593 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-14 17:52:02,593 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-14 17:52:02,600 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-14 17:52:02,601 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.04 05:52:02" (1/1) ... [2022-04-14 17:52:02,601 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@37b29d0e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 05:52:02, skipping insertion in model container [2022-04-14 17:52:02,602 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.04 05:52:02" (1/1) ... [2022-04-14 17:52:02,606 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-14 17:52:02,618 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-14 17:52:02,734 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_valuebound10.c[458,471] [2022-04-14 17:52:02,748 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-14 17:52:02,754 INFO L203 MainTranslator]: Completed pre-run [2022-04-14 17:52:02,761 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_valuebound10.c[458,471] [2022-04-14 17:52:02,767 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-14 17:52:02,776 INFO L208 MainTranslator]: Completed translation [2022-04-14 17:52:02,776 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 05:52:02 WrapperNode [2022-04-14 17:52:02,776 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-14 17:52:02,777 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-14 17:52:02,777 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-14 17:52:02,777 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-14 17:52:02,783 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:02" (1/1) ... [2022-04-14 17:52:02,783 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:02" (1/1) ... [2022-04-14 17:52:02,787 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:02" (1/1) ... [2022-04-14 17:52:02,788 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:02" (1/1) ... [2022-04-14 17:52:02,791 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:02" (1/1) ... [2022-04-14 17:52:02,794 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:02" (1/1) ... [2022-04-14 17:52:02,794 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:02" (1/1) ... [2022-04-14 17:52:02,795 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-14 17:52:02,796 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-14 17:52:02,796 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-14 17:52:02,796 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-14 17:52:02,797 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 05:52:02" (1/1) ... [2022-04-14 17:52:02,801 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-14 17:52:02,812 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-14 17:52:02,821 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:02,823 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:02,851 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-14 17:52:02,851 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-14 17:52:02,851 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-14 17:52:02,852 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-14 17:52:02,852 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-14 17:52:02,852 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-14 17:52:02,852 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-14 17:52:02,852 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-14 17:52:02,852 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-14 17:52:02,852 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-14 17:52:02,852 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_short [2022-04-14 17:52:02,852 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-14 17:52:02,852 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-14 17:52:02,852 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-14 17:52:02,852 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-14 17:52:02,852 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-14 17:52:02,853 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-14 17:52:02,853 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-14 17:52:02,853 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-14 17:52:02,853 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-14 17:52:02,905 INFO L234 CfgBuilder]: Building ICFG [2022-04-14 17:52:02,907 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-14 17:52:03,004 INFO L275 CfgBuilder]: Performing block encoding [2022-04-14 17:52:03,009 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-14 17:52:03,009 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-14 17:52:03,010 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.04 05:52:03 BoogieIcfgContainer [2022-04-14 17:52:03,010 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-14 17:52:03,011 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-14 17:52:03,011 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-14 17:52:03,013 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-14 17:52:03,014 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.04 05:52:02" (1/3) ... [2022-04-14 17:52:03,014 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@73d579e9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.04 05:52:03, skipping insertion in model container [2022-04-14 17:52:03,014 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 05:52:02" (2/3) ... [2022-04-14 17:52:03,014 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@73d579e9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.04 05:52:03, skipping insertion in model container [2022-04-14 17:52:03,014 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.04 05:52:03" (3/3) ... [2022-04-14 17:52:03,015 INFO L111 eAbstractionObserver]: Analyzing ICFG ps6-ll_valuebound10.c [2022-04-14 17:52:03,018 INFO L202 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-04-14 17:52:03,018 INFO L161 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-14 17:52:03,045 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-14 17:52:03,049 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:03,050 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-14 17:52:03,063 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:03,066 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-04-14 17:52:03,067 INFO L491 BasicCegarLoop]: Found error trace [2022-04-14 17:52:03,067 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:03,067 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-14 17:52:03,071 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-14 17:52:03,071 INFO L85 PathProgramCache]: Analyzing trace with hash 1098891495, now seen corresponding path program 1 times [2022-04-14 17:52:03,077 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-14 17:52:03,077 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2047088135] [2022-04-14 17:52:03,077 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 17:52:03,078 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-14 17:52:03,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 17:52:03,198 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-14 17:52:03,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 17:52:03,213 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:03,214 INFO L290 TraceCheckUtils]: 1: Hoare triple {32#true} assume true; {32#true} is VALID [2022-04-14 17:52:03,214 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {32#true} {32#true} #63#return; {32#true} is VALID [2022-04-14 17:52:03,214 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-14 17:52:03,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 17:52:03,221 INFO L290 TraceCheckUtils]: 0: Hoare triple {32#true} ~cond := #in~cond; {32#true} is VALID [2022-04-14 17:52:03,221 INFO L290 TraceCheckUtils]: 1: Hoare triple {32#true} assume 0 == ~cond;assume false; {33#false} is VALID [2022-04-14 17:52:03,222 INFO L290 TraceCheckUtils]: 2: Hoare triple {33#false} assume true; {33#false} is VALID [2022-04-14 17:52:03,222 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {33#false} {32#true} #53#return; {33#false} is VALID [2022-04-14 17:52:03,222 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-04-14 17:52:03,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 17:52:03,228 INFO L290 TraceCheckUtils]: 0: Hoare triple {32#true} ~cond := #in~cond; {32#true} is VALID [2022-04-14 17:52:03,228 INFO L290 TraceCheckUtils]: 1: Hoare triple {32#true} assume 0 == ~cond;assume false; {33#false} is VALID [2022-04-14 17:52:03,229 INFO L290 TraceCheckUtils]: 2: Hoare triple {33#false} assume true; {33#false} is VALID [2022-04-14 17:52:03,229 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {33#false} {33#false} #55#return; {33#false} is VALID [2022-04-14 17:52:03,230 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:03,230 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:03,230 INFO L290 TraceCheckUtils]: 2: Hoare triple {32#true} assume true; {32#true} is VALID [2022-04-14 17:52:03,230 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {32#true} {32#true} #63#return; {32#true} is VALID [2022-04-14 17:52:03,230 INFO L272 TraceCheckUtils]: 4: Hoare triple {32#true} call #t~ret5 := main(); {32#true} is VALID [2022-04-14 17:52:03,230 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:03,231 INFO L272 TraceCheckUtils]: 6: Hoare triple {32#true} call assume_abort_if_not((if ~k~0 >= 0 && ~k~0 <= 10 then 1 else 0)); {32#true} is VALID [2022-04-14 17:52:03,231 INFO L290 TraceCheckUtils]: 7: Hoare triple {32#true} ~cond := #in~cond; {32#true} is VALID [2022-04-14 17:52:03,233 INFO L290 TraceCheckUtils]: 8: Hoare triple {32#true} assume 0 == ~cond;assume false; {33#false} is VALID [2022-04-14 17:52:03,234 INFO L290 TraceCheckUtils]: 9: Hoare triple {33#false} assume true; {33#false} is VALID [2022-04-14 17:52:03,234 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {33#false} {32#true} #53#return; {33#false} is VALID [2022-04-14 17:52:03,234 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:03,234 INFO L290 TraceCheckUtils]: 12: Hoare triple {32#true} ~cond := #in~cond; {32#true} is VALID [2022-04-14 17:52:03,235 INFO L290 TraceCheckUtils]: 13: Hoare triple {32#true} assume 0 == ~cond;assume false; {33#false} is VALID [2022-04-14 17:52:03,235 INFO L290 TraceCheckUtils]: 14: Hoare triple {33#false} assume true; {33#false} is VALID [2022-04-14 17:52:03,235 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {33#false} {33#false} #55#return; {33#false} is VALID [2022-04-14 17:52:03,235 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:03,235 INFO L290 TraceCheckUtils]: 17: Hoare triple {33#false} assume false; {33#false} is VALID [2022-04-14 17:52:03,235 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:03,235 INFO L290 TraceCheckUtils]: 19: Hoare triple {33#false} ~cond := #in~cond; {33#false} is VALID [2022-04-14 17:52:03,236 INFO L290 TraceCheckUtils]: 20: Hoare triple {33#false} assume 0 == ~cond; {33#false} is VALID [2022-04-14 17:52:03,236 INFO L290 TraceCheckUtils]: 21: Hoare triple {33#false} assume !false; {33#false} is VALID [2022-04-14 17:52:03,236 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:03,236 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-14 17:52:03,237 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2047088135] [2022-04-14 17:52:03,237 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2047088135] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-14 17:52:03,237 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-14 17:52:03,237 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-14 17:52:03,238 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [683453545] [2022-04-14 17:52:03,239 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-14 17:52:03,242 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:03,243 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-14 17:52:03,245 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:03,283 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:03,284 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-14 17:52:03,284 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-14 17:52:03,303 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-14 17:52:03,304 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-14 17:52:03,306 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:03,513 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 17:52:03,513 INFO L93 Difference]: Finished difference Result 51 states and 69 transitions. [2022-04-14 17:52:03,513 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-14 17:52:03,514 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:03,514 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-14 17:52:03,515 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:03,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 69 transitions. [2022-04-14 17:52:03,528 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:03,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 69 transitions. [2022-04-14 17:52:03,536 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 69 transitions. [2022-04-14 17:52:03,614 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:03,622 INFO L225 Difference]: With dead ends: 51 [2022-04-14 17:52:03,623 INFO L226 Difference]: Without dead ends: 24 [2022-04-14 17:52:03,625 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:03,630 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:03,631 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:03,643 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2022-04-14 17:52:03,662 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2022-04-14 17:52:03,663 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-14 17:52:03,664 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:03,666 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:03,668 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:03,676 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 17:52:03,677 INFO L93 Difference]: Finished difference Result 24 states and 27 transitions. [2022-04-14 17:52:03,677 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 27 transitions. [2022-04-14 17:52:03,677 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 17:52:03,677 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 17:52:03,678 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:03,678 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:03,682 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 17:52:03,682 INFO L93 Difference]: Finished difference Result 24 states and 27 transitions. [2022-04-14 17:52:03,682 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 27 transitions. [2022-04-14 17:52:03,683 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 17:52:03,683 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 17:52:03,683 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-14 17:52:03,683 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-14 17:52:03,684 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:03,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 27 transitions. [2022-04-14 17:52:03,689 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 27 transitions. Word has length 22 [2022-04-14 17:52:03,689 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-14 17:52:03,689 INFO L478 AbstractCegarLoop]: Abstraction has 24 states and 27 transitions. [2022-04-14 17:52:03,689 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:03,690 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 27 transitions. [2022-04-14 17:52:03,690 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-04-14 17:52:03,690 INFO L491 BasicCegarLoop]: Found error trace [2022-04-14 17:52:03,690 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:03,690 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-14 17:52:03,691 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-14 17:52:03,691 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-14 17:52:03,691 INFO L85 PathProgramCache]: Analyzing trace with hash 769620075, now seen corresponding path program 1 times [2022-04-14 17:52:03,692 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-14 17:52:03,692 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [620051472] [2022-04-14 17:52:03,692 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 17:52:03,692 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-14 17:52:03,723 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-14 17:52:03,723 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [537562242] [2022-04-14 17:52:03,723 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 17:52:03,723 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-14 17:52:03,724 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-14 17:52:03,725 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:03,726 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:03,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 17:52:03,773 INFO L263 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-14 17:52:03,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 17:52:03,789 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-14 17:52:03,935 INFO L272 TraceCheckUtils]: 0: Hoare triple {202#true} call ULTIMATE.init(); {202#true} is VALID [2022-04-14 17:52:03,936 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:03,936 INFO L290 TraceCheckUtils]: 2: Hoare triple {202#true} assume true; {202#true} is VALID [2022-04-14 17:52:03,936 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {202#true} {202#true} #63#return; {202#true} is VALID [2022-04-14 17:52:03,936 INFO L272 TraceCheckUtils]: 4: Hoare triple {202#true} call #t~ret5 := main(); {202#true} is VALID [2022-04-14 17:52:03,936 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:03,936 INFO L272 TraceCheckUtils]: 6: Hoare triple {202#true} call assume_abort_if_not((if ~k~0 >= 0 && ~k~0 <= 10 then 1 else 0)); {202#true} is VALID [2022-04-14 17:52:03,936 INFO L290 TraceCheckUtils]: 7: Hoare triple {202#true} ~cond := #in~cond; {202#true} is VALID [2022-04-14 17:52:03,937 INFO L290 TraceCheckUtils]: 8: Hoare triple {202#true} assume !(0 == ~cond); {202#true} is VALID [2022-04-14 17:52:03,937 INFO L290 TraceCheckUtils]: 9: Hoare triple {202#true} assume true; {202#true} is VALID [2022-04-14 17:52:03,937 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {202#true} {202#true} #53#return; {202#true} is VALID [2022-04-14 17:52:03,937 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:03,937 INFO L290 TraceCheckUtils]: 12: Hoare triple {202#true} ~cond := #in~cond; {202#true} is VALID [2022-04-14 17:52:03,937 INFO L290 TraceCheckUtils]: 13: Hoare triple {202#true} assume !(0 == ~cond); {202#true} is VALID [2022-04-14 17:52:03,937 INFO L290 TraceCheckUtils]: 14: Hoare triple {202#true} assume true; {202#true} is VALID [2022-04-14 17:52:03,937 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {202#true} {202#true} #55#return; {202#true} is VALID [2022-04-14 17:52:03,938 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:03,938 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:03,939 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:03,940 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:03,940 INFO L290 TraceCheckUtils]: 20: Hoare triple {266#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {203#false} is VALID [2022-04-14 17:52:03,940 INFO L290 TraceCheckUtils]: 21: Hoare triple {203#false} assume !false; {203#false} is VALID [2022-04-14 17:52:03,941 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:03,941 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-14 17:52:03,941 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-14 17:52:03,941 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [620051472] [2022-04-14 17:52:03,941 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-14 17:52:03,941 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [537562242] [2022-04-14 17:52:03,941 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [537562242] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-14 17:52:03,941 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-14 17:52:03,942 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-14 17:52:03,942 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1280814796] [2022-04-14 17:52:03,942 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-14 17:52:03,943 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:03,943 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-14 17:52:03,943 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:03,957 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:03,957 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-14 17:52:03,957 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-14 17:52:03,958 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-14 17:52:03,958 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-14 17:52:03,958 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:04,232 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 17:52:04,232 INFO L93 Difference]: Finished difference Result 35 states and 40 transitions. [2022-04-14 17:52:04,232 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-14 17:52:04,232 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:04,232 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-14 17:52:04,233 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:04,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 40 transitions. [2022-04-14 17:52:04,234 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:04,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 40 transitions. [2022-04-14 17:52:04,235 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 40 transitions. [2022-04-14 17:52:04,270 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:04,271 INFO L225 Difference]: With dead ends: 35 [2022-04-14 17:52:04,271 INFO L226 Difference]: Without dead ends: 31 [2022-04-14 17:52:04,271 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:04,272 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:04,273 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:04,273 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2022-04-14 17:52:04,286 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2022-04-14 17:52:04,286 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-14 17:52:04,287 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:04,287 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:04,287 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:04,290 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 17:52:04,290 INFO L93 Difference]: Finished difference Result 31 states and 34 transitions. [2022-04-14 17:52:04,290 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 34 transitions. [2022-04-14 17:52:04,292 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 17:52:04,292 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 17:52:04,292 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:04,292 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:04,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 17:52:04,295 INFO L93 Difference]: Finished difference Result 31 states and 34 transitions. [2022-04-14 17:52:04,295 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 34 transitions. [2022-04-14 17:52:04,297 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 17:52:04,297 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 17:52:04,297 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-14 17:52:04,297 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-14 17:52:04,297 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:04,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 34 transitions. [2022-04-14 17:52:04,299 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 34 transitions. Word has length 22 [2022-04-14 17:52:04,299 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-14 17:52:04,299 INFO L478 AbstractCegarLoop]: Abstraction has 31 states and 34 transitions. [2022-04-14 17:52:04,299 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:04,299 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 34 transitions. [2022-04-14 17:52:04,300 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-04-14 17:52:04,300 INFO L491 BasicCegarLoop]: Found error trace [2022-04-14 17:52:04,300 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:04,319 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:04,515 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:04,516 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-14 17:52:04,516 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-14 17:52:04,516 INFO L85 PathProgramCache]: Analyzing trace with hash 645812411, now seen corresponding path program 1 times [2022-04-14 17:52:04,517 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-14 17:52:04,517 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1990544404] [2022-04-14 17:52:04,517 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 17:52:04,517 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-14 17:52:04,536 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-14 17:52:04,537 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [282747638] [2022-04-14 17:52:04,537 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 17:52:04,537 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-14 17:52:04,537 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-14 17:52:04,542 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:04,543 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:04,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 17:52:04,596 INFO L263 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 11 conjunts are in the unsatisfiable core [2022-04-14 17:52:04,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 17:52:04,606 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-14 17:52:04,734 INFO L272 TraceCheckUtils]: 0: Hoare triple {434#true} call ULTIMATE.init(); {434#true} is VALID [2022-04-14 17:52:04,735 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:04,735 INFO L290 TraceCheckUtils]: 2: Hoare triple {434#true} assume true; {434#true} is VALID [2022-04-14 17:52:04,735 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {434#true} {434#true} #63#return; {434#true} is VALID [2022-04-14 17:52:04,735 INFO L272 TraceCheckUtils]: 4: Hoare triple {434#true} call #t~ret5 := main(); {434#true} is VALID [2022-04-14 17:52:04,735 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:04,735 INFO L272 TraceCheckUtils]: 6: Hoare triple {434#true} call assume_abort_if_not((if ~k~0 >= 0 && ~k~0 <= 10 then 1 else 0)); {434#true} is VALID [2022-04-14 17:52:04,735 INFO L290 TraceCheckUtils]: 7: Hoare triple {434#true} ~cond := #in~cond; {434#true} is VALID [2022-04-14 17:52:04,735 INFO L290 TraceCheckUtils]: 8: Hoare triple {434#true} assume !(0 == ~cond); {434#true} is VALID [2022-04-14 17:52:04,736 INFO L290 TraceCheckUtils]: 9: Hoare triple {434#true} assume true; {434#true} is VALID [2022-04-14 17:52:04,736 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {434#true} {434#true} #53#return; {434#true} is VALID [2022-04-14 17:52:04,736 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:04,736 INFO L290 TraceCheckUtils]: 12: Hoare triple {434#true} ~cond := #in~cond; {434#true} is VALID [2022-04-14 17:52:04,736 INFO L290 TraceCheckUtils]: 13: Hoare triple {434#true} assume !(0 == ~cond); {434#true} is VALID [2022-04-14 17:52:04,736 INFO L290 TraceCheckUtils]: 14: Hoare triple {434#true} assume true; {434#true} is VALID [2022-04-14 17:52:04,736 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {434#true} {434#true} #55#return; {434#true} is VALID [2022-04-14 17:52:04,737 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:04,737 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:04,737 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:04,737 INFO L290 TraceCheckUtils]: 19: Hoare triple {434#true} ~cond := #in~cond; {434#true} is VALID [2022-04-14 17:52:04,737 INFO L290 TraceCheckUtils]: 20: Hoare triple {434#true} assume !(0 == ~cond); {434#true} is VALID [2022-04-14 17:52:04,738 INFO L290 TraceCheckUtils]: 21: Hoare triple {434#true} assume true; {434#true} is VALID [2022-04-14 17:52:04,738 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:04,739 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:04,739 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:04,740 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:04,741 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:04,741 INFO L290 TraceCheckUtils]: 27: Hoare triple {520#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {435#false} is VALID [2022-04-14 17:52:04,741 INFO L290 TraceCheckUtils]: 28: Hoare triple {435#false} assume !false; {435#false} is VALID [2022-04-14 17:52:04,741 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:04,742 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-14 17:52:04,940 INFO L290 TraceCheckUtils]: 28: Hoare triple {435#false} assume !false; {435#false} is VALID [2022-04-14 17:52:04,940 INFO L290 TraceCheckUtils]: 27: Hoare triple {520#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {435#false} is VALID [2022-04-14 17:52:04,941 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:04,941 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:04,942 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:04,986 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:04,986 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:04,987 INFO L290 TraceCheckUtils]: 21: Hoare triple {434#true} assume true; {434#true} is VALID [2022-04-14 17:52:04,987 INFO L290 TraceCheckUtils]: 20: Hoare triple {434#true} assume !(0 == ~cond); {434#true} is VALID [2022-04-14 17:52:04,987 INFO L290 TraceCheckUtils]: 19: Hoare triple {434#true} ~cond := #in~cond; {434#true} is VALID [2022-04-14 17:52:04,987 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:04,988 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:04,988 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:04,989 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {434#true} {434#true} #55#return; {434#true} is VALID [2022-04-14 17:52:04,989 INFO L290 TraceCheckUtils]: 14: Hoare triple {434#true} assume true; {434#true} is VALID [2022-04-14 17:52:04,989 INFO L290 TraceCheckUtils]: 13: Hoare triple {434#true} assume !(0 == ~cond); {434#true} is VALID [2022-04-14 17:52:04,989 INFO L290 TraceCheckUtils]: 12: Hoare triple {434#true} ~cond := #in~cond; {434#true} is VALID [2022-04-14 17:52:04,989 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:04,989 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {434#true} {434#true} #53#return; {434#true} is VALID [2022-04-14 17:52:04,989 INFO L290 TraceCheckUtils]: 9: Hoare triple {434#true} assume true; {434#true} is VALID [2022-04-14 17:52:04,989 INFO L290 TraceCheckUtils]: 8: Hoare triple {434#true} assume !(0 == ~cond); {434#true} is VALID [2022-04-14 17:52:04,989 INFO L290 TraceCheckUtils]: 7: Hoare triple {434#true} ~cond := #in~cond; {434#true} is VALID [2022-04-14 17:52:04,989 INFO L272 TraceCheckUtils]: 6: Hoare triple {434#true} call assume_abort_if_not((if ~k~0 >= 0 && ~k~0 <= 10 then 1 else 0)); {434#true} is VALID [2022-04-14 17:52:04,989 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:04,990 INFO L272 TraceCheckUtils]: 4: Hoare triple {434#true} call #t~ret5 := main(); {434#true} is VALID [2022-04-14 17:52:04,990 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {434#true} {434#true} #63#return; {434#true} is VALID [2022-04-14 17:52:04,990 INFO L290 TraceCheckUtils]: 2: Hoare triple {434#true} assume true; {434#true} is VALID [2022-04-14 17:52:04,990 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:04,990 INFO L272 TraceCheckUtils]: 0: Hoare triple {434#true} call ULTIMATE.init(); {434#true} is VALID [2022-04-14 17:52:04,990 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:04,990 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-14 17:52:04,990 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1990544404] [2022-04-14 17:52:04,990 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-14 17:52:04,991 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [282747638] [2022-04-14 17:52:04,991 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [282747638] provided 1 perfect and 1 imperfect interpolant sequences [2022-04-14 17:52:04,991 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-04-14 17:52:04,991 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 7 [2022-04-14 17:52:04,991 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1310762049] [2022-04-14 17:52:04,991 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-14 17:52:04,991 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:04,992 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-14 17:52:04,992 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:05,121 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:05,122 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-14 17:52:05,122 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-14 17:52:05,122 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-14 17:52:05,122 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-04-14 17:52:05,123 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:05,227 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 17:52:05,227 INFO L93 Difference]: Finished difference Result 37 states and 39 transitions. [2022-04-14 17:52:05,227 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-14 17:52:05,228 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:05,228 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-14 17:52:05,228 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:05,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 32 transitions. [2022-04-14 17:52:05,229 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:05,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 32 transitions. [2022-04-14 17:52:05,230 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 32 transitions. [2022-04-14 17:52:05,301 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:05,302 INFO L225 Difference]: With dead ends: 37 [2022-04-14 17:52:05,302 INFO L226 Difference]: Without dead ends: 33 [2022-04-14 17:52:05,303 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:05,303 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:05,304 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:05,304 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2022-04-14 17:52:05,309 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2022-04-14 17:52:05,309 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-14 17:52:05,309 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:05,309 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:05,310 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:05,311 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 17:52:05,311 INFO L93 Difference]: Finished difference Result 33 states and 35 transitions. [2022-04-14 17:52:05,312 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 35 transitions. [2022-04-14 17:52:05,312 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 17:52:05,312 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 17:52:05,313 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:05,313 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:05,314 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 17:52:05,314 INFO L93 Difference]: Finished difference Result 33 states and 35 transitions. [2022-04-14 17:52:05,314 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 35 transitions. [2022-04-14 17:52:05,314 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 17:52:05,314 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 17:52:05,314 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-14 17:52:05,314 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-14 17:52:05,315 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:05,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 35 transitions. [2022-04-14 17:52:05,316 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 35 transitions. Word has length 29 [2022-04-14 17:52:05,316 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-14 17:52:05,316 INFO L478 AbstractCegarLoop]: Abstraction has 33 states and 35 transitions. [2022-04-14 17:52:05,316 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:05,316 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 35 transitions. [2022-04-14 17:52:05,317 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2022-04-14 17:52:05,317 INFO L491 BasicCegarLoop]: Found error trace [2022-04-14 17:52:05,317 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:05,323 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2022-04-14 17:52:05,521 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:05,521 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-14 17:52:05,522 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-14 17:52:05,522 INFO L85 PathProgramCache]: Analyzing trace with hash 463554397, now seen corresponding path program 1 times [2022-04-14 17:52:05,522 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-14 17:52:05,522 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1941307550] [2022-04-14 17:52:05,522 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 17:52:05,522 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-14 17:52:05,535 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-14 17:52:05,535 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [628524907] [2022-04-14 17:52:05,535 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 17:52:05,535 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-14 17:52:05,535 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-14 17:52:05,543 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:05,553 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:05,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 17:52:05,587 INFO L263 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 12 conjunts are in the unsatisfiable core [2022-04-14 17:52:05,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 17:52:05,596 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-14 17:52:05,856 INFO L272 TraceCheckUtils]: 0: Hoare triple {784#true} call ULTIMATE.init(); {784#true} is VALID [2022-04-14 17:52:05,856 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:05,857 INFO L290 TraceCheckUtils]: 2: Hoare triple {784#true} assume true; {784#true} is VALID [2022-04-14 17:52:05,857 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {784#true} {784#true} #63#return; {784#true} is VALID [2022-04-14 17:52:05,858 INFO L272 TraceCheckUtils]: 4: Hoare triple {784#true} call #t~ret5 := main(); {784#true} is VALID [2022-04-14 17:52:05,858 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:05,867 INFO L272 TraceCheckUtils]: 6: Hoare triple {784#true} call assume_abort_if_not((if ~k~0 >= 0 && ~k~0 <= 10 then 1 else 0)); {784#true} is VALID [2022-04-14 17:52:05,870 INFO L290 TraceCheckUtils]: 7: Hoare triple {784#true} ~cond := #in~cond; {784#true} is VALID [2022-04-14 17:52:05,870 INFO L290 TraceCheckUtils]: 8: Hoare triple {784#true} assume !(0 == ~cond); {784#true} is VALID [2022-04-14 17:52:05,870 INFO L290 TraceCheckUtils]: 9: Hoare triple {784#true} assume true; {784#true} is VALID [2022-04-14 17:52:05,870 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {784#true} {784#true} #53#return; {784#true} is VALID [2022-04-14 17:52:05,870 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:05,870 INFO L290 TraceCheckUtils]: 12: Hoare triple {784#true} ~cond := #in~cond; {784#true} is VALID [2022-04-14 17:52:05,871 INFO L290 TraceCheckUtils]: 13: Hoare triple {784#true} assume !(0 == ~cond); {784#true} is VALID [2022-04-14 17:52:05,871 INFO L290 TraceCheckUtils]: 14: Hoare triple {784#true} assume true; {784#true} is VALID [2022-04-14 17:52:05,871 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {784#true} {784#true} #55#return; {784#true} is VALID [2022-04-14 17:52:05,872 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:05,873 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:05,873 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:05,873 INFO L290 TraceCheckUtils]: 19: Hoare triple {784#true} ~cond := #in~cond; {784#true} is VALID [2022-04-14 17:52:05,873 INFO L290 TraceCheckUtils]: 20: Hoare triple {784#true} assume !(0 == ~cond); {784#true} is VALID [2022-04-14 17:52:05,873 INFO L290 TraceCheckUtils]: 21: Hoare triple {784#true} assume true; {784#true} is VALID [2022-04-14 17:52:05,874 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:05,874 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:05,875 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:05,875 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:05,875 INFO L290 TraceCheckUtils]: 26: Hoare triple {784#true} ~cond := #in~cond; {784#true} is VALID [2022-04-14 17:52:05,875 INFO L290 TraceCheckUtils]: 27: Hoare triple {784#true} assume !(0 == ~cond); {784#true} is VALID [2022-04-14 17:52:05,876 INFO L290 TraceCheckUtils]: 28: Hoare triple {784#true} assume true; {784#true} is VALID [2022-04-14 17:52:05,876 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:05,877 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:05,877 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:05,877 INFO L290 TraceCheckUtils]: 32: Hoare triple {784#true} ~cond := #in~cond; {784#true} is VALID [2022-04-14 17:52:05,877 INFO L290 TraceCheckUtils]: 33: Hoare triple {784#true} assume !(0 == ~cond); {784#true} is VALID [2022-04-14 17:52:05,877 INFO L290 TraceCheckUtils]: 34: Hoare triple {784#true} assume true; {784#true} is VALID [2022-04-14 17:52:05,877 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:05,878 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:05,878 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:05,879 INFO L290 TraceCheckUtils]: 38: Hoare triple {904#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {785#false} is VALID [2022-04-14 17:52:05,879 INFO L290 TraceCheckUtils]: 39: Hoare triple {785#false} assume !false; {785#false} is VALID [2022-04-14 17:52:05,879 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:05,879 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-14 17:52:06,208 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-14 17:52:06,208 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1941307550] [2022-04-14 17:52:06,208 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-14 17:52:06,208 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [628524907] [2022-04-14 17:52:06,208 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [628524907] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-14 17:52:06,208 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-14 17:52:06,209 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2022-04-14 17:52:06,209 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [622448564] [2022-04-14 17:52:06,209 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2022-04-14 17:52:06,209 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:06,211 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-14 17:52:06,211 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:06,230 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:06,230 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-14 17:52:06,230 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-14 17:52:06,231 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-14 17:52:06,231 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2022-04-14 17:52:06,231 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:06,420 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 17:52:06,421 INFO L93 Difference]: Finished difference Result 42 states and 46 transitions. [2022-04-14 17:52:06,421 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-14 17:52:06,421 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:06,421 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-14 17:52:06,421 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:06,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 42 transitions. [2022-04-14 17:52:06,423 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:06,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 42 transitions. [2022-04-14 17:52:06,424 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 42 transitions. [2022-04-14 17:52:06,474 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:06,475 INFO L225 Difference]: With dead ends: 42 [2022-04-14 17:52:06,476 INFO L226 Difference]: Without dead ends: 36 [2022-04-14 17:52:06,476 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:06,480 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:06,480 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:06,482 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2022-04-14 17:52:06,493 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2022-04-14 17:52:06,493 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-14 17:52:06,493 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:06,494 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:06,495 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:06,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 17:52:06,497 INFO L93 Difference]: Finished difference Result 36 states and 39 transitions. [2022-04-14 17:52:06,498 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 39 transitions. [2022-04-14 17:52:06,501 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 17:52:06,501 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 17:52:06,502 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:06,504 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:06,509 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 17:52:06,509 INFO L93 Difference]: Finished difference Result 36 states and 39 transitions. [2022-04-14 17:52:06,509 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 39 transitions. [2022-04-14 17:52:06,509 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 17:52:06,509 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 17:52:06,510 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-14 17:52:06,510 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-14 17:52:06,510 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:06,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 39 transitions. [2022-04-14 17:52:06,511 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 39 transitions. Word has length 40 [2022-04-14 17:52:06,511 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-14 17:52:06,511 INFO L478 AbstractCegarLoop]: Abstraction has 36 states and 39 transitions. [2022-04-14 17:52:06,511 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:06,511 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 39 transitions. [2022-04-14 17:52:06,512 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2022-04-14 17:52:06,512 INFO L491 BasicCegarLoop]: Found error trace [2022-04-14 17:52:06,512 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:06,528 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:06,722 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:06,722 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-14 17:52:06,723 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-14 17:52:06,724 INFO L85 PathProgramCache]: Analyzing trace with hash 1886956461, now seen corresponding path program 2 times [2022-04-14 17:52:06,724 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-14 17:52:06,724 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1281272008] [2022-04-14 17:52:06,724 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 17:52:06,724 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-14 17:52:06,736 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-14 17:52:06,736 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [158663119] [2022-04-14 17:52:06,736 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-14 17:52:06,736 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-14 17:52:06,736 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-14 17:52:06,737 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:06,738 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:06,807 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-14 17:52:06,808 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-14 17:52:06,809 INFO L263 TraceCheckSpWp]: Trace formula consists of 130 conjuncts, 16 conjunts are in the unsatisfiable core [2022-04-14 17:52:06,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 17:52:06,826 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-14 17:52:07,107 INFO L272 TraceCheckUtils]: 0: Hoare triple {1160#true} call ULTIMATE.init(); {1160#true} is VALID [2022-04-14 17:52:07,107 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:07,108 INFO L290 TraceCheckUtils]: 2: Hoare triple {1160#true} assume true; {1160#true} is VALID [2022-04-14 17:52:07,108 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1160#true} {1160#true} #63#return; {1160#true} is VALID [2022-04-14 17:52:07,108 INFO L272 TraceCheckUtils]: 4: Hoare triple {1160#true} call #t~ret5 := main(); {1160#true} is VALID [2022-04-14 17:52:07,108 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:07,108 INFO L272 TraceCheckUtils]: 6: Hoare triple {1160#true} call assume_abort_if_not((if ~k~0 >= 0 && ~k~0 <= 10 then 1 else 0)); {1160#true} is VALID [2022-04-14 17:52:07,108 INFO L290 TraceCheckUtils]: 7: Hoare triple {1160#true} ~cond := #in~cond; {1160#true} is VALID [2022-04-14 17:52:07,108 INFO L290 TraceCheckUtils]: 8: Hoare triple {1160#true} assume !(0 == ~cond); {1160#true} is VALID [2022-04-14 17:52:07,108 INFO L290 TraceCheckUtils]: 9: Hoare triple {1160#true} assume true; {1160#true} is VALID [2022-04-14 17:52:07,108 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1160#true} {1160#true} #53#return; {1160#true} is VALID [2022-04-14 17:52:07,109 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:07,109 INFO L290 TraceCheckUtils]: 12: Hoare triple {1160#true} ~cond := #in~cond; {1160#true} is VALID [2022-04-14 17:52:07,109 INFO L290 TraceCheckUtils]: 13: Hoare triple {1160#true} assume !(0 == ~cond); {1160#true} is VALID [2022-04-14 17:52:07,109 INFO L290 TraceCheckUtils]: 14: Hoare triple {1160#true} assume true; {1160#true} is VALID [2022-04-14 17:52:07,109 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {1160#true} {1160#true} #55#return; {1160#true} is VALID [2022-04-14 17:52:07,109 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:07,110 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:07,110 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:07,110 INFO L290 TraceCheckUtils]: 19: Hoare triple {1160#true} ~cond := #in~cond; {1160#true} is VALID [2022-04-14 17:52:07,110 INFO L290 TraceCheckUtils]: 20: Hoare triple {1160#true} assume !(0 == ~cond); {1160#true} is VALID [2022-04-14 17:52:07,110 INFO L290 TraceCheckUtils]: 21: Hoare triple {1160#true} assume true; {1160#true} is VALID [2022-04-14 17:52:07,111 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:07,111 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:07,114 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:07,114 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:07,114 INFO L290 TraceCheckUtils]: 26: Hoare triple {1160#true} ~cond := #in~cond; {1160#true} is VALID [2022-04-14 17:52:07,114 INFO L290 TraceCheckUtils]: 27: Hoare triple {1160#true} assume !(0 == ~cond); {1160#true} is VALID [2022-04-14 17:52:07,114 INFO L290 TraceCheckUtils]: 28: Hoare triple {1160#true} assume true; {1160#true} is VALID [2022-04-14 17:52:07,115 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:07,116 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:07,116 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:07,116 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:07,116 INFO L290 TraceCheckUtils]: 33: Hoare triple {1160#true} ~cond := #in~cond; {1160#true} is VALID [2022-04-14 17:52:07,116 INFO L290 TraceCheckUtils]: 34: Hoare triple {1160#true} assume !(0 == ~cond); {1160#true} is VALID [2022-04-14 17:52:07,116 INFO L290 TraceCheckUtils]: 35: Hoare triple {1160#true} assume true; {1160#true} is VALID [2022-04-14 17:52:07,117 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:07,118 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:07,118 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:07,118 INFO L290 TraceCheckUtils]: 39: Hoare triple {1160#true} ~cond := #in~cond; {1160#true} is VALID [2022-04-14 17:52:07,118 INFO L290 TraceCheckUtils]: 40: Hoare triple {1160#true} assume !(0 == ~cond); {1160#true} is VALID [2022-04-14 17:52:07,118 INFO L290 TraceCheckUtils]: 41: Hoare triple {1160#true} assume true; {1160#true} is VALID [2022-04-14 17:52:07,119 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:07,119 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:07,120 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:07,124 INFO L290 TraceCheckUtils]: 45: Hoare triple {1302#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1161#false} is VALID [2022-04-14 17:52:07,124 INFO L290 TraceCheckUtils]: 46: Hoare triple {1161#false} assume !false; {1161#false} is VALID [2022-04-14 17:52:07,124 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:07,125 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-14 17:52:07,429 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-14 17:52:07,429 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1281272008] [2022-04-14 17:52:07,429 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-14 17:52:07,429 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [158663119] [2022-04-14 17:52:07,429 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [158663119] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-14 17:52:07,429 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-14 17:52:07,430 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2022-04-14 17:52:07,430 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1305331214] [2022-04-14 17:52:07,430 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2022-04-14 17:52:07,430 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:07,430 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-14 17:52:07,431 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:07,453 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:07,453 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-14 17:52:07,453 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-14 17:52:07,453 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-14 17:52:07,454 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2022-04-14 17:52:07,454 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:07,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 17:52:07,698 INFO L93 Difference]: Finished difference Result 45 states and 50 transitions. [2022-04-14 17:52:07,699 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-14 17:52:07,699 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:07,699 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-14 17:52:07,699 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:07,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 46 transitions. [2022-04-14 17:52:07,700 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:07,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 46 transitions. [2022-04-14 17:52:07,701 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 46 transitions. [2022-04-14 17:52:07,733 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:07,734 INFO L225 Difference]: With dead ends: 45 [2022-04-14 17:52:07,734 INFO L226 Difference]: Without dead ends: 39 [2022-04-14 17:52:07,735 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:07,735 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:07,735 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:07,736 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2022-04-14 17:52:07,743 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2022-04-14 17:52:07,744 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-14 17:52:07,744 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:07,744 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:07,744 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:07,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 17:52:07,745 INFO L93 Difference]: Finished difference Result 39 states and 43 transitions. [2022-04-14 17:52:07,746 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 43 transitions. [2022-04-14 17:52:07,746 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 17:52:07,746 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 17:52:07,746 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:07,746 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:07,747 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 17:52:07,747 INFO L93 Difference]: Finished difference Result 39 states and 43 transitions. [2022-04-14 17:52:07,747 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 43 transitions. [2022-04-14 17:52:07,748 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 17:52:07,748 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 17:52:07,748 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-14 17:52:07,748 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-14 17:52:07,748 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:07,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 43 transitions. [2022-04-14 17:52:07,749 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 43 transitions. Word has length 47 [2022-04-14 17:52:07,749 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-14 17:52:07,749 INFO L478 AbstractCegarLoop]: Abstraction has 39 states and 43 transitions. [2022-04-14 17:52:07,749 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:07,749 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 43 transitions. [2022-04-14 17:52:07,750 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2022-04-14 17:52:07,750 INFO L491 BasicCegarLoop]: Found error trace [2022-04-14 17:52:07,750 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:07,756 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:07,955 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:07,955 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-14 17:52:07,955 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-14 17:52:07,955 INFO L85 PathProgramCache]: Analyzing trace with hash -1213805219, now seen corresponding path program 3 times [2022-04-14 17:52:07,956 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-14 17:52:07,956 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1544826009] [2022-04-14 17:52:07,956 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 17:52:07,956 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-14 17:52:07,967 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-14 17:52:07,967 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1064543607] [2022-04-14 17:52:07,967 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-04-14 17:52:07,967 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-14 17:52:07,967 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-14 17:52:07,968 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:07,973 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:08,064 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2022-04-14 17:52:08,064 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-14 17:52:08,065 INFO L263 TraceCheckSpWp]: Trace formula consists of 147 conjuncts, 20 conjunts are in the unsatisfiable core [2022-04-14 17:52:08,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 17:52:08,083 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-14 17:52:08,398 INFO L272 TraceCheckUtils]: 0: Hoare triple {1574#true} call ULTIMATE.init(); {1574#true} is VALID [2022-04-14 17:52:08,398 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:08,398 INFO L290 TraceCheckUtils]: 2: Hoare triple {1574#true} assume true; {1574#true} is VALID [2022-04-14 17:52:08,398 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1574#true} {1574#true} #63#return; {1574#true} is VALID [2022-04-14 17:52:08,398 INFO L272 TraceCheckUtils]: 4: Hoare triple {1574#true} call #t~ret5 := main(); {1574#true} is VALID [2022-04-14 17:52:08,398 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:08,398 INFO L272 TraceCheckUtils]: 6: Hoare triple {1574#true} call assume_abort_if_not((if ~k~0 >= 0 && ~k~0 <= 10 then 1 else 0)); {1574#true} is VALID [2022-04-14 17:52:08,398 INFO L290 TraceCheckUtils]: 7: Hoare triple {1574#true} ~cond := #in~cond; {1574#true} is VALID [2022-04-14 17:52:08,399 INFO L290 TraceCheckUtils]: 8: Hoare triple {1574#true} assume !(0 == ~cond); {1574#true} is VALID [2022-04-14 17:52:08,399 INFO L290 TraceCheckUtils]: 9: Hoare triple {1574#true} assume true; {1574#true} is VALID [2022-04-14 17:52:08,399 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1574#true} {1574#true} #53#return; {1574#true} is VALID [2022-04-14 17:52:08,399 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:08,399 INFO L290 TraceCheckUtils]: 12: Hoare triple {1574#true} ~cond := #in~cond; {1574#true} is VALID [2022-04-14 17:52:08,399 INFO L290 TraceCheckUtils]: 13: Hoare triple {1574#true} assume !(0 == ~cond); {1574#true} is VALID [2022-04-14 17:52:08,399 INFO L290 TraceCheckUtils]: 14: Hoare triple {1574#true} assume true; {1574#true} is VALID [2022-04-14 17:52:08,399 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {1574#true} {1574#true} #55#return; {1574#true} is VALID [2022-04-14 17:52:08,399 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:08,400 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:08,400 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:08,400 INFO L290 TraceCheckUtils]: 19: Hoare triple {1574#true} ~cond := #in~cond; {1574#true} is VALID [2022-04-14 17:52:08,400 INFO L290 TraceCheckUtils]: 20: Hoare triple {1574#true} assume !(0 == ~cond); {1574#true} is VALID [2022-04-14 17:52:08,400 INFO L290 TraceCheckUtils]: 21: Hoare triple {1574#true} assume true; {1574#true} is VALID [2022-04-14 17:52:08,400 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:08,401 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:08,401 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:08,401 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:08,401 INFO L290 TraceCheckUtils]: 26: Hoare triple {1574#true} ~cond := #in~cond; {1574#true} is VALID [2022-04-14 17:52:08,401 INFO L290 TraceCheckUtils]: 27: Hoare triple {1574#true} assume !(0 == ~cond); {1574#true} is VALID [2022-04-14 17:52:08,401 INFO L290 TraceCheckUtils]: 28: Hoare triple {1574#true} assume true; {1574#true} is VALID [2022-04-14 17:52:08,402 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:08,402 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:08,402 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:08,402 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:08,403 INFO L290 TraceCheckUtils]: 33: Hoare triple {1574#true} ~cond := #in~cond; {1574#true} is VALID [2022-04-14 17:52:08,403 INFO L290 TraceCheckUtils]: 34: Hoare triple {1574#true} assume !(0 == ~cond); {1574#true} is VALID [2022-04-14 17:52:08,403 INFO L290 TraceCheckUtils]: 35: Hoare triple {1574#true} assume true; {1574#true} is VALID [2022-04-14 17:52:08,403 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:08,404 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:08,404 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:08,404 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:08,404 INFO L290 TraceCheckUtils]: 40: Hoare triple {1574#true} ~cond := #in~cond; {1574#true} is VALID [2022-04-14 17:52:08,404 INFO L290 TraceCheckUtils]: 41: Hoare triple {1574#true} assume !(0 == ~cond); {1574#true} is VALID [2022-04-14 17:52:08,404 INFO L290 TraceCheckUtils]: 42: Hoare triple {1574#true} assume true; {1574#true} is VALID [2022-04-14 17:52:08,405 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:08,405 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:08,405 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:08,405 INFO L290 TraceCheckUtils]: 46: Hoare triple {1574#true} ~cond := #in~cond; {1574#true} is VALID [2022-04-14 17:52:08,405 INFO L290 TraceCheckUtils]: 47: Hoare triple {1574#true} assume !(0 == ~cond); {1574#true} is VALID [2022-04-14 17:52:08,405 INFO L290 TraceCheckUtils]: 48: Hoare triple {1574#true} assume true; {1574#true} is VALID [2022-04-14 17:52:08,406 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:08,407 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:08,408 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:08,408 INFO L290 TraceCheckUtils]: 52: Hoare triple {1738#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1575#false} is VALID [2022-04-14 17:52:08,408 INFO L290 TraceCheckUtils]: 53: Hoare triple {1575#false} assume !false; {1575#false} is VALID [2022-04-14 17:52:08,408 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:08,408 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-14 17:52:08,702 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-14 17:52:08,702 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1544826009] [2022-04-14 17:52:08,702 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-14 17:52:08,702 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1064543607] [2022-04-14 17:52:08,702 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1064543607] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-14 17:52:08,702 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-14 17:52:08,702 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2022-04-14 17:52:08,702 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1580759356] [2022-04-14 17:52:08,702 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2022-04-14 17:52:08,703 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:08,703 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-14 17:52:08,703 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:08,731 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:08,731 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-04-14 17:52:08,732 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-14 17:52:08,732 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-04-14 17:52:08,732 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2022-04-14 17:52:08,732 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:09,075 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 17:52:09,075 INFO L93 Difference]: Finished difference Result 48 states and 54 transitions. [2022-04-14 17:52:09,076 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-14 17:52:09,076 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:09,076 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-14 17:52:09,076 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:09,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 50 transitions. [2022-04-14 17:52:09,077 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:09,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 50 transitions. [2022-04-14 17:52:09,078 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 9 states and 50 transitions. [2022-04-14 17:52:09,120 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:09,121 INFO L225 Difference]: With dead ends: 48 [2022-04-14 17:52:09,121 INFO L226 Difference]: Without dead ends: 42 [2022-04-14 17:52:09,121 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:09,122 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:09,122 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:09,122 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2022-04-14 17:52:09,132 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2022-04-14 17:52:09,133 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-14 17:52:09,133 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:09,134 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:09,134 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:09,136 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 17:52:09,136 INFO L93 Difference]: Finished difference Result 42 states and 47 transitions. [2022-04-14 17:52:09,136 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 47 transitions. [2022-04-14 17:52:09,136 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 17:52:09,136 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 17:52:09,136 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:09,137 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:09,139 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 17:52:09,139 INFO L93 Difference]: Finished difference Result 42 states and 47 transitions. [2022-04-14 17:52:09,139 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 47 transitions. [2022-04-14 17:52:09,139 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 17:52:09,139 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 17:52:09,139 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-14 17:52:09,139 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-14 17:52:09,140 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:09,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 47 transitions. [2022-04-14 17:52:09,142 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 47 transitions. Word has length 54 [2022-04-14 17:52:09,142 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-14 17:52:09,142 INFO L478 AbstractCegarLoop]: Abstraction has 42 states and 47 transitions. [2022-04-14 17:52:09,142 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:09,142 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 47 transitions. [2022-04-14 17:52:09,144 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2022-04-14 17:52:09,144 INFO L491 BasicCegarLoop]: Found error trace [2022-04-14 17:52:09,144 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:09,153 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:09,349 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:09,351 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-14 17:52:09,351 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-14 17:52:09,351 INFO L85 PathProgramCache]: Analyzing trace with hash 307258797, now seen corresponding path program 4 times [2022-04-14 17:52:09,351 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-14 17:52:09,351 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1778890388] [2022-04-14 17:52:09,352 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 17:52:09,352 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-14 17:52:09,368 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-14 17:52:09,368 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1045255600] [2022-04-14 17:52:09,368 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-14 17:52:09,368 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-14 17:52:09,368 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-14 17:52:09,369 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:09,384 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:09,406 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-14 17:52:09,406 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-14 17:52:09,407 INFO L263 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 24 conjunts are in the unsatisfiable core [2022-04-14 17:52:09,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 17:52:09,418 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-14 17:52:09,756 INFO L272 TraceCheckUtils]: 0: Hoare triple {2026#true} call ULTIMATE.init(); {2026#true} is VALID [2022-04-14 17:52:09,756 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:09,756 INFO L290 TraceCheckUtils]: 2: Hoare triple {2026#true} assume true; {2026#true} is VALID [2022-04-14 17:52:09,756 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2026#true} {2026#true} #63#return; {2026#true} is VALID [2022-04-14 17:52:09,756 INFO L272 TraceCheckUtils]: 4: Hoare triple {2026#true} call #t~ret5 := main(); {2026#true} is VALID [2022-04-14 17:52:09,756 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:09,756 INFO L272 TraceCheckUtils]: 6: Hoare triple {2026#true} call assume_abort_if_not((if ~k~0 >= 0 && ~k~0 <= 10 then 1 else 0)); {2026#true} is VALID [2022-04-14 17:52:09,756 INFO L290 TraceCheckUtils]: 7: Hoare triple {2026#true} ~cond := #in~cond; {2026#true} is VALID [2022-04-14 17:52:09,756 INFO L290 TraceCheckUtils]: 8: Hoare triple {2026#true} assume !(0 == ~cond); {2026#true} is VALID [2022-04-14 17:52:09,757 INFO L290 TraceCheckUtils]: 9: Hoare triple {2026#true} assume true; {2026#true} is VALID [2022-04-14 17:52:09,757 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {2026#true} {2026#true} #53#return; {2026#true} is VALID [2022-04-14 17:52:09,757 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:09,757 INFO L290 TraceCheckUtils]: 12: Hoare triple {2026#true} ~cond := #in~cond; {2026#true} is VALID [2022-04-14 17:52:09,757 INFO L290 TraceCheckUtils]: 13: Hoare triple {2026#true} assume !(0 == ~cond); {2026#true} is VALID [2022-04-14 17:52:09,757 INFO L290 TraceCheckUtils]: 14: Hoare triple {2026#true} assume true; {2026#true} is VALID [2022-04-14 17:52:09,757 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {2026#true} {2026#true} #55#return; {2026#true} is VALID [2022-04-14 17:52:09,759 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:09,759 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:09,759 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:09,760 INFO L290 TraceCheckUtils]: 19: Hoare triple {2026#true} ~cond := #in~cond; {2026#true} is VALID [2022-04-14 17:52:09,760 INFO L290 TraceCheckUtils]: 20: Hoare triple {2026#true} assume !(0 == ~cond); {2026#true} is VALID [2022-04-14 17:52:09,760 INFO L290 TraceCheckUtils]: 21: Hoare triple {2026#true} assume true; {2026#true} is VALID [2022-04-14 17:52:09,760 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:09,761 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:09,761 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:09,761 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:09,761 INFO L290 TraceCheckUtils]: 26: Hoare triple {2026#true} ~cond := #in~cond; {2026#true} is VALID [2022-04-14 17:52:09,761 INFO L290 TraceCheckUtils]: 27: Hoare triple {2026#true} assume !(0 == ~cond); {2026#true} is VALID [2022-04-14 17:52:09,761 INFO L290 TraceCheckUtils]: 28: Hoare triple {2026#true} assume true; {2026#true} is VALID [2022-04-14 17:52:09,762 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:09,762 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:09,763 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:09,763 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:09,763 INFO L290 TraceCheckUtils]: 33: Hoare triple {2026#true} ~cond := #in~cond; {2026#true} is VALID [2022-04-14 17:52:09,763 INFO L290 TraceCheckUtils]: 34: Hoare triple {2026#true} assume !(0 == ~cond); {2026#true} is VALID [2022-04-14 17:52:09,763 INFO L290 TraceCheckUtils]: 35: Hoare triple {2026#true} assume true; {2026#true} is VALID [2022-04-14 17:52:09,763 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:09,764 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:09,764 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:09,764 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:09,764 INFO L290 TraceCheckUtils]: 40: Hoare triple {2026#true} ~cond := #in~cond; {2026#true} is VALID [2022-04-14 17:52:09,764 INFO L290 TraceCheckUtils]: 41: Hoare triple {2026#true} assume !(0 == ~cond); {2026#true} is VALID [2022-04-14 17:52:09,764 INFO L290 TraceCheckUtils]: 42: Hoare triple {2026#true} assume true; {2026#true} is VALID [2022-04-14 17:52:09,765 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:09,765 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:09,766 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:09,766 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:09,766 INFO L290 TraceCheckUtils]: 47: Hoare triple {2026#true} ~cond := #in~cond; {2026#true} is VALID [2022-04-14 17:52:09,766 INFO L290 TraceCheckUtils]: 48: Hoare triple {2026#true} assume !(0 == ~cond); {2026#true} is VALID [2022-04-14 17:52:09,766 INFO L290 TraceCheckUtils]: 49: Hoare triple {2026#true} assume true; {2026#true} is VALID [2022-04-14 17:52:09,766 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:09,771 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:09,771 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:09,771 INFO L290 TraceCheckUtils]: 53: Hoare triple {2026#true} ~cond := #in~cond; {2026#true} is VALID [2022-04-14 17:52:09,772 INFO L290 TraceCheckUtils]: 54: Hoare triple {2026#true} assume !(0 == ~cond); {2026#true} is VALID [2022-04-14 17:52:09,772 INFO L290 TraceCheckUtils]: 55: Hoare triple {2026#true} assume true; {2026#true} is VALID [2022-04-14 17:52:09,772 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:09,773 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:09,773 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:09,773 INFO L290 TraceCheckUtils]: 59: Hoare triple {2212#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {2027#false} is VALID [2022-04-14 17:52:09,774 INFO L290 TraceCheckUtils]: 60: Hoare triple {2027#false} assume !false; {2027#false} is VALID [2022-04-14 17:52:09,775 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:09,775 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-14 17:52:10,319 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-14 17:52:10,320 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1778890388] [2022-04-14 17:52:10,320 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-14 17:52:10,320 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1045255600] [2022-04-14 17:52:10,320 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1045255600] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-14 17:52:10,320 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-14 17:52:10,320 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2022-04-14 17:52:10,320 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1291363165] [2022-04-14 17:52:10,320 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2022-04-14 17:52:10,321 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:10,321 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-14 17:52:10,321 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:10,353 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:10,353 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-04-14 17:52:10,353 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-14 17:52:10,353 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-04-14 17:52:10,354 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2022-04-14 17:52:10,354 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:10,759 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 17:52:10,759 INFO L93 Difference]: Finished difference Result 51 states and 58 transitions. [2022-04-14 17:52:10,759 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-04-14 17:52:10,759 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:10,760 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-14 17:52:10,760 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:10,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 54 transitions. [2022-04-14 17:52:10,761 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:10,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 54 transitions. [2022-04-14 17:52:10,763 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 10 states and 54 transitions. [2022-04-14 17:52:10,814 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:10,815 INFO L225 Difference]: With dead ends: 51 [2022-04-14 17:52:10,815 INFO L226 Difference]: Without dead ends: 45 [2022-04-14 17:52:10,816 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 66 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=43, Invalid=167, Unknown=0, NotChecked=0, Total=210 [2022-04-14 17:52:10,816 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:10,816 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:10,817 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2022-04-14 17:52:10,834 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2022-04-14 17:52:10,834 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-14 17:52:10,834 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:10,834 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:10,834 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:10,836 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 17:52:10,836 INFO L93 Difference]: Finished difference Result 45 states and 51 transitions. [2022-04-14 17:52:10,836 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 51 transitions. [2022-04-14 17:52:10,836 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 17:52:10,836 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 17:52:10,836 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:10,836 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:10,837 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 17:52:10,837 INFO L93 Difference]: Finished difference Result 45 states and 51 transitions. [2022-04-14 17:52:10,837 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 51 transitions. [2022-04-14 17:52:10,838 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 17:52:10,838 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 17:52:10,838 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-14 17:52:10,838 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-14 17:52:10,838 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:10,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 51 transitions. [2022-04-14 17:52:10,839 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 51 transitions. Word has length 61 [2022-04-14 17:52:10,839 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-14 17:52:10,839 INFO L478 AbstractCegarLoop]: Abstraction has 45 states and 51 transitions. [2022-04-14 17:52:10,839 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:10,839 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 51 transitions. [2022-04-14 17:52:10,840 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2022-04-14 17:52:10,840 INFO L491 BasicCegarLoop]: Found error trace [2022-04-14 17:52:10,840 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:10,860 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:11,058 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:11,058 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-14 17:52:11,059 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-14 17:52:11,059 INFO L85 PathProgramCache]: Analyzing trace with hash 1082774365, now seen corresponding path program 5 times [2022-04-14 17:52:11,059 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-14 17:52:11,059 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [595115829] [2022-04-14 17:52:11,059 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 17:52:11,059 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-14 17:52:11,074 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-14 17:52:11,074 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1353333924] [2022-04-14 17:52:11,074 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-04-14 17:52:11,074 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-14 17:52:11,074 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-14 17:52:11,076 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:11,077 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:11,572 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2022-04-14 17:52:11,572 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-14 17:52:11,573 INFO L263 TraceCheckSpWp]: Trace formula consists of 181 conjuncts, 28 conjunts are in the unsatisfiable core [2022-04-14 17:52:11,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 17:52:11,596 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-14 17:52:11,934 INFO L272 TraceCheckUtils]: 0: Hoare triple {2516#true} call ULTIMATE.init(); {2516#true} is VALID [2022-04-14 17:52:11,934 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:11,934 INFO L290 TraceCheckUtils]: 2: Hoare triple {2516#true} assume true; {2516#true} is VALID [2022-04-14 17:52:11,934 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2516#true} {2516#true} #63#return; {2516#true} is VALID [2022-04-14 17:52:11,934 INFO L272 TraceCheckUtils]: 4: Hoare triple {2516#true} call #t~ret5 := main(); {2516#true} is VALID [2022-04-14 17:52:11,934 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:11,934 INFO L272 TraceCheckUtils]: 6: Hoare triple {2516#true} call assume_abort_if_not((if ~k~0 >= 0 && ~k~0 <= 10 then 1 else 0)); {2516#true} is VALID [2022-04-14 17:52:11,935 INFO L290 TraceCheckUtils]: 7: Hoare triple {2516#true} ~cond := #in~cond; {2516#true} is VALID [2022-04-14 17:52:11,935 INFO L290 TraceCheckUtils]: 8: Hoare triple {2516#true} assume !(0 == ~cond); {2516#true} is VALID [2022-04-14 17:52:11,935 INFO L290 TraceCheckUtils]: 9: Hoare triple {2516#true} assume true; {2516#true} is VALID [2022-04-14 17:52:11,935 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {2516#true} {2516#true} #53#return; {2516#true} is VALID [2022-04-14 17:52:11,935 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:11,935 INFO L290 TraceCheckUtils]: 12: Hoare triple {2516#true} ~cond := #in~cond; {2516#true} is VALID [2022-04-14 17:52:11,935 INFO L290 TraceCheckUtils]: 13: Hoare triple {2516#true} assume !(0 == ~cond); {2516#true} is VALID [2022-04-14 17:52:11,935 INFO L290 TraceCheckUtils]: 14: Hoare triple {2516#true} assume true; {2516#true} is VALID [2022-04-14 17:52:11,935 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {2516#true} {2516#true} #55#return; {2516#true} is VALID [2022-04-14 17:52:11,935 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:11,936 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:11,936 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:11,936 INFO L290 TraceCheckUtils]: 19: Hoare triple {2516#true} ~cond := #in~cond; {2516#true} is VALID [2022-04-14 17:52:11,936 INFO L290 TraceCheckUtils]: 20: Hoare triple {2516#true} assume !(0 == ~cond); {2516#true} is VALID [2022-04-14 17:52:11,936 INFO L290 TraceCheckUtils]: 21: Hoare triple {2516#true} assume true; {2516#true} is VALID [2022-04-14 17:52:11,940 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:11,941 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:11,941 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:11,941 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:11,941 INFO L290 TraceCheckUtils]: 26: Hoare triple {2516#true} ~cond := #in~cond; {2516#true} is VALID [2022-04-14 17:52:11,941 INFO L290 TraceCheckUtils]: 27: Hoare triple {2516#true} assume !(0 == ~cond); {2516#true} is VALID [2022-04-14 17:52:11,941 INFO L290 TraceCheckUtils]: 28: Hoare triple {2516#true} assume true; {2516#true} is VALID [2022-04-14 17:52:11,942 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:11,942 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:11,943 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:11,943 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:11,943 INFO L290 TraceCheckUtils]: 33: Hoare triple {2516#true} ~cond := #in~cond; {2516#true} is VALID [2022-04-14 17:52:11,943 INFO L290 TraceCheckUtils]: 34: Hoare triple {2516#true} assume !(0 == ~cond); {2516#true} is VALID [2022-04-14 17:52:11,943 INFO L290 TraceCheckUtils]: 35: Hoare triple {2516#true} assume true; {2516#true} is VALID [2022-04-14 17:52:11,943 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:11,944 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:11,951 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:11,951 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:11,951 INFO L290 TraceCheckUtils]: 40: Hoare triple {2516#true} ~cond := #in~cond; {2516#true} is VALID [2022-04-14 17:52:11,951 INFO L290 TraceCheckUtils]: 41: Hoare triple {2516#true} assume !(0 == ~cond); {2516#true} is VALID [2022-04-14 17:52:11,951 INFO L290 TraceCheckUtils]: 42: Hoare triple {2516#true} assume true; {2516#true} is VALID [2022-04-14 17:52:11,952 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:11,953 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:11,953 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:11,953 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:11,953 INFO L290 TraceCheckUtils]: 47: Hoare triple {2516#true} ~cond := #in~cond; {2516#true} is VALID [2022-04-14 17:52:11,953 INFO L290 TraceCheckUtils]: 48: Hoare triple {2516#true} assume !(0 == ~cond); {2516#true} is VALID [2022-04-14 17:52:11,953 INFO L290 TraceCheckUtils]: 49: Hoare triple {2516#true} assume true; {2516#true} is VALID [2022-04-14 17:52:11,954 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:11,954 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:11,955 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:11,955 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:11,955 INFO L290 TraceCheckUtils]: 54: Hoare triple {2516#true} ~cond := #in~cond; {2516#true} is VALID [2022-04-14 17:52:11,955 INFO L290 TraceCheckUtils]: 55: Hoare triple {2516#true} assume !(0 == ~cond); {2516#true} is VALID [2022-04-14 17:52:11,955 INFO L290 TraceCheckUtils]: 56: Hoare triple {2516#true} assume true; {2516#true} is VALID [2022-04-14 17:52:11,955 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:11,956 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:11,956 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:11,956 INFO L290 TraceCheckUtils]: 60: Hoare triple {2516#true} ~cond := #in~cond; {2516#true} is VALID [2022-04-14 17:52:11,956 INFO L290 TraceCheckUtils]: 61: Hoare triple {2516#true} assume !(0 == ~cond); {2516#true} is VALID [2022-04-14 17:52:11,956 INFO L290 TraceCheckUtils]: 62: Hoare triple {2516#true} assume true; {2516#true} is VALID [2022-04-14 17:52:11,959 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:11,960 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:11,960 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:11,960 INFO L290 TraceCheckUtils]: 66: Hoare triple {2724#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {2517#false} is VALID [2022-04-14 17:52:11,960 INFO L290 TraceCheckUtils]: 67: Hoare triple {2517#false} assume !false; {2517#false} is VALID [2022-04-14 17:52:11,961 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:11,961 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-14 17:52:12,245 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-14 17:52:12,245 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [595115829] [2022-04-14 17:52:12,245 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-14 17:52:12,245 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1353333924] [2022-04-14 17:52:12,245 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1353333924] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-14 17:52:12,245 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-14 17:52:12,245 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2022-04-14 17:52:12,245 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [261325155] [2022-04-14 17:52:12,245 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2022-04-14 17:52:12,246 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:12,246 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-14 17:52:12,247 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:12,280 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:12,280 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-04-14 17:52:12,280 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-14 17:52:12,281 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-04-14 17:52:12,281 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=146, Unknown=0, NotChecked=0, Total=182 [2022-04-14 17:52:12,281 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:12,767 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 17:52:12,768 INFO L93 Difference]: Finished difference Result 54 states and 62 transitions. [2022-04-14 17:52:12,768 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-04-14 17:52:12,768 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:12,768 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-14 17:52:12,768 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:12,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 58 transitions. [2022-04-14 17:52:12,769 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:12,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 58 transitions. [2022-04-14 17:52:12,771 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 11 states and 58 transitions. [2022-04-14 17:52:12,812 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:12,813 INFO L225 Difference]: With dead ends: 54 [2022-04-14 17:52:12,813 INFO L226 Difference]: Without dead ends: 48 [2022-04-14 17:52:12,813 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:12,814 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:12,814 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:12,814 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2022-04-14 17:52:12,830 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2022-04-14 17:52:12,830 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-14 17:52:12,831 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:12,831 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:12,831 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:12,832 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 17:52:12,832 INFO L93 Difference]: Finished difference Result 48 states and 55 transitions. [2022-04-14 17:52:12,832 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 55 transitions. [2022-04-14 17:52:12,833 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 17:52:12,833 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 17:52:12,833 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:12,833 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:12,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 17:52:12,834 INFO L93 Difference]: Finished difference Result 48 states and 55 transitions. [2022-04-14 17:52:12,834 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 55 transitions. [2022-04-14 17:52:12,834 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 17:52:12,834 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 17:52:12,835 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-14 17:52:12,835 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-14 17:52:12,835 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:12,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 55 transitions. [2022-04-14 17:52:12,836 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 55 transitions. Word has length 68 [2022-04-14 17:52:12,836 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-14 17:52:12,836 INFO L478 AbstractCegarLoop]: Abstraction has 48 states and 55 transitions. [2022-04-14 17:52:12,837 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:12,837 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 55 transitions. [2022-04-14 17:52:12,837 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2022-04-14 17:52:12,837 INFO L491 BasicCegarLoop]: Found error trace [2022-04-14 17:52:12,837 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:12,844 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2022-04-14 17:52:13,042 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:13,042 INFO L403 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-14 17:52:13,043 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-14 17:52:13,043 INFO L85 PathProgramCache]: Analyzing trace with hash -1692754003, now seen corresponding path program 6 times [2022-04-14 17:52:13,043 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-14 17:52:13,043 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [753778421] [2022-04-14 17:52:13,043 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 17:52:13,043 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-14 17:52:13,053 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-14 17:52:13,053 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1535759897] [2022-04-14 17:52:13,053 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-14 17:52:13,053 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-14 17:52:13,053 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-14 17:52:13,054 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:13,055 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:13,576 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2022-04-14 17:52:13,576 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-14 17:52:13,578 INFO L263 TraceCheckSpWp]: Trace formula consists of 198 conjuncts, 32 conjunts are in the unsatisfiable core [2022-04-14 17:52:13,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 17:52:13,603 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-14 17:52:13,994 INFO L272 TraceCheckUtils]: 0: Hoare triple {3044#true} call ULTIMATE.init(); {3044#true} is VALID [2022-04-14 17:52:13,995 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:13,995 INFO L290 TraceCheckUtils]: 2: Hoare triple {3044#true} assume true; {3044#true} is VALID [2022-04-14 17:52:13,995 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3044#true} {3044#true} #63#return; {3044#true} is VALID [2022-04-14 17:52:13,995 INFO L272 TraceCheckUtils]: 4: Hoare triple {3044#true} call #t~ret5 := main(); {3044#true} is VALID [2022-04-14 17:52:13,995 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:13,995 INFO L272 TraceCheckUtils]: 6: Hoare triple {3044#true} call assume_abort_if_not((if ~k~0 >= 0 && ~k~0 <= 10 then 1 else 0)); {3044#true} is VALID [2022-04-14 17:52:13,995 INFO L290 TraceCheckUtils]: 7: Hoare triple {3044#true} ~cond := #in~cond; {3044#true} is VALID [2022-04-14 17:52:13,995 INFO L290 TraceCheckUtils]: 8: Hoare triple {3044#true} assume !(0 == ~cond); {3044#true} is VALID [2022-04-14 17:52:13,995 INFO L290 TraceCheckUtils]: 9: Hoare triple {3044#true} assume true; {3044#true} is VALID [2022-04-14 17:52:13,995 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {3044#true} {3044#true} #53#return; {3044#true} is VALID [2022-04-14 17:52:13,995 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:13,995 INFO L290 TraceCheckUtils]: 12: Hoare triple {3044#true} ~cond := #in~cond; {3044#true} is VALID [2022-04-14 17:52:13,996 INFO L290 TraceCheckUtils]: 13: Hoare triple {3044#true} assume !(0 == ~cond); {3044#true} is VALID [2022-04-14 17:52:13,996 INFO L290 TraceCheckUtils]: 14: Hoare triple {3044#true} assume true; {3044#true} is VALID [2022-04-14 17:52:13,996 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {3044#true} {3044#true} #55#return; {3044#true} is VALID [2022-04-14 17:52:13,996 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:13,996 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:13,996 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:13,996 INFO L290 TraceCheckUtils]: 19: Hoare triple {3044#true} ~cond := #in~cond; {3044#true} is VALID [2022-04-14 17:52:13,997 INFO L290 TraceCheckUtils]: 20: Hoare triple {3044#true} assume !(0 == ~cond); {3044#true} is VALID [2022-04-14 17:52:13,997 INFO L290 TraceCheckUtils]: 21: Hoare triple {3044#true} assume true; {3044#true} is VALID [2022-04-14 17:52:13,997 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:13,998 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:13,998 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:13,998 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:13,998 INFO L290 TraceCheckUtils]: 26: Hoare triple {3044#true} ~cond := #in~cond; {3044#true} is VALID [2022-04-14 17:52:13,998 INFO L290 TraceCheckUtils]: 27: Hoare triple {3044#true} assume !(0 == ~cond); {3044#true} is VALID [2022-04-14 17:52:13,998 INFO L290 TraceCheckUtils]: 28: Hoare triple {3044#true} assume true; {3044#true} is VALID [2022-04-14 17:52:13,999 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:13,999 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:13,999 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:13,999 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:14,000 INFO L290 TraceCheckUtils]: 33: Hoare triple {3044#true} ~cond := #in~cond; {3044#true} is VALID [2022-04-14 17:52:14,000 INFO L290 TraceCheckUtils]: 34: Hoare triple {3044#true} assume !(0 == ~cond); {3044#true} is VALID [2022-04-14 17:52:14,000 INFO L290 TraceCheckUtils]: 35: Hoare triple {3044#true} assume true; {3044#true} is VALID [2022-04-14 17:52:14,000 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:14,001 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))} is VALID [2022-04-14 17:52:14,001 INFO L290 TraceCheckUtils]: 38: Hoare triple {3163#(and (= (+ (- 2) main_~c~0) 1) (= main_~y~0 3))} assume !false; {3163#(and (= (+ (- 2) main_~c~0) 1) (= main_~y~0 3))} is VALID [2022-04-14 17:52:14,001 INFO L272 TraceCheckUtils]: 39: Hoare triple {3163#(and (= (+ (- 2) main_~c~0) 1) (= main_~y~0 3))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {3044#true} is VALID [2022-04-14 17:52:14,001 INFO L290 TraceCheckUtils]: 40: Hoare triple {3044#true} ~cond := #in~cond; {3044#true} is VALID [2022-04-14 17:52:14,001 INFO L290 TraceCheckUtils]: 41: Hoare triple {3044#true} assume !(0 == ~cond); {3044#true} is VALID [2022-04-14 17:52:14,001 INFO L290 TraceCheckUtils]: 42: Hoare triple {3044#true} assume true; {3044#true} is VALID [2022-04-14 17:52:14,002 INFO L284 TraceCheckUtils]: 43: Hoare quadruple {3044#true} {3163#(and (= (+ (- 2) main_~c~0) 1) (= main_~y~0 3))} #57#return; {3163#(and (= (+ (- 2) main_~c~0) 1) (= main_~y~0 3))} is VALID [2022-04-14 17:52:14,002 INFO L290 TraceCheckUtils]: 44: Hoare triple {3163#(and (= (+ (- 2) main_~c~0) 1) (= main_~y~0 3))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {3185#(and (= main_~y~0 4) (= main_~c~0 4))} is VALID [2022-04-14 17:52:14,002 INFO L290 TraceCheckUtils]: 45: Hoare triple {3185#(and (= main_~y~0 4) (= main_~c~0 4))} assume !false; {3185#(and (= main_~y~0 4) (= main_~c~0 4))} is VALID [2022-04-14 17:52:14,002 INFO L272 TraceCheckUtils]: 46: Hoare triple {3185#(and (= main_~y~0 4) (= main_~c~0 4))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {3044#true} is VALID [2022-04-14 17:52:14,002 INFO L290 TraceCheckUtils]: 47: Hoare triple {3044#true} ~cond := #in~cond; {3044#true} is VALID [2022-04-14 17:52:14,003 INFO L290 TraceCheckUtils]: 48: Hoare triple {3044#true} assume !(0 == ~cond); {3044#true} is VALID [2022-04-14 17:52:14,003 INFO L290 TraceCheckUtils]: 49: Hoare triple {3044#true} assume true; {3044#true} is VALID [2022-04-14 17:52:14,003 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {3044#true} {3185#(and (= main_~y~0 4) (= main_~c~0 4))} #57#return; {3185#(and (= main_~y~0 4) (= main_~c~0 4))} is VALID [2022-04-14 17:52:14,004 INFO L290 TraceCheckUtils]: 51: Hoare triple {3185#(and (= main_~y~0 4) (= main_~c~0 4))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {3207#(and (= 5 main_~c~0) (= 5 main_~y~0))} is VALID [2022-04-14 17:52:14,004 INFO L290 TraceCheckUtils]: 52: Hoare triple {3207#(and (= 5 main_~c~0) (= 5 main_~y~0))} assume !false; {3207#(and (= 5 main_~c~0) (= 5 main_~y~0))} is VALID [2022-04-14 17:52:14,004 INFO L272 TraceCheckUtils]: 53: Hoare triple {3207#(and (= 5 main_~c~0) (= 5 main_~y~0))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {3044#true} is VALID [2022-04-14 17:52:14,004 INFO L290 TraceCheckUtils]: 54: Hoare triple {3044#true} ~cond := #in~cond; {3044#true} is VALID [2022-04-14 17:52:14,004 INFO L290 TraceCheckUtils]: 55: Hoare triple {3044#true} assume !(0 == ~cond); {3044#true} is VALID [2022-04-14 17:52:14,004 INFO L290 TraceCheckUtils]: 56: Hoare triple {3044#true} assume true; {3044#true} is VALID [2022-04-14 17:52:14,005 INFO L284 TraceCheckUtils]: 57: Hoare quadruple {3044#true} {3207#(and (= 5 main_~c~0) (= 5 main_~y~0))} #57#return; {3207#(and (= 5 main_~c~0) (= 5 main_~y~0))} is VALID [2022-04-14 17:52:14,005 INFO L290 TraceCheckUtils]: 58: Hoare triple {3207#(and (= 5 main_~c~0) (= 5 main_~y~0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {3229#(and (= main_~y~0 6) (< 5 main_~k~0) (<= main_~c~0 6))} is VALID [2022-04-14 17:52:14,005 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:14,006 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:14,006 INFO L290 TraceCheckUtils]: 61: Hoare triple {3044#true} ~cond := #in~cond; {3044#true} is VALID [2022-04-14 17:52:14,006 INFO L290 TraceCheckUtils]: 62: Hoare triple {3044#true} assume !(0 == ~cond); {3044#true} is VALID [2022-04-14 17:52:14,006 INFO L290 TraceCheckUtils]: 63: Hoare triple {3044#true} assume true; {3044#true} is VALID [2022-04-14 17:52:14,006 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:14,007 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:14,007 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:14,007 INFO L290 TraceCheckUtils]: 67: Hoare triple {3044#true} ~cond := #in~cond; {3044#true} is VALID [2022-04-14 17:52:14,007 INFO L290 TraceCheckUtils]: 68: Hoare triple {3044#true} assume !(0 == ~cond); {3044#true} is VALID [2022-04-14 17:52:14,007 INFO L290 TraceCheckUtils]: 69: Hoare triple {3044#true} assume true; {3044#true} is VALID [2022-04-14 17:52:14,008 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:14,008 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:14,009 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:14,009 INFO L290 TraceCheckUtils]: 73: Hoare triple {3274#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {3045#false} is VALID [2022-04-14 17:52:14,009 INFO L290 TraceCheckUtils]: 74: Hoare triple {3045#false} assume !false; {3045#false} is VALID [2022-04-14 17:52:14,009 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:14,009 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-14 17:52:14,287 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-14 17:52:14,287 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [753778421] [2022-04-14 17:52:14,287 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-14 17:52:14,287 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1535759897] [2022-04-14 17:52:14,287 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1535759897] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-14 17:52:14,287 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-14 17:52:14,287 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2022-04-14 17:52:14,287 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [105269749] [2022-04-14 17:52:14,287 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2022-04-14 17:52:14,288 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:14,288 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-14 17:52:14,288 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:14,324 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:14,325 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-04-14 17:52:14,325 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-14 17:52:14,325 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-04-14 17:52:14,325 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=171, Unknown=0, NotChecked=0, Total=210 [2022-04-14 17:52:14,325 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:14,945 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 17:52:14,945 INFO L93 Difference]: Finished difference Result 57 states and 66 transitions. [2022-04-14 17:52:14,945 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-04-14 17:52:14,945 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:14,946 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-14 17:52:14,946 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:14,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 62 transitions. [2022-04-14 17:52:14,948 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:14,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 62 transitions. [2022-04-14 17:52:14,952 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 12 states and 62 transitions. [2022-04-14 17:52:14,993 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:14,994 INFO L225 Difference]: With dead ends: 57 [2022-04-14 17:52:14,994 INFO L226 Difference]: Without dead ends: 51 [2022-04-14 17:52:14,994 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 78 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=49, Invalid=223, Unknown=0, NotChecked=0, Total=272 [2022-04-14 17:52:14,995 INFO L913 BasicCegarLoop]: 45 mSDtfsCounter, 2 mSDsluCounter, 265 mSDsCounter, 0 mSdLazyCounter, 259 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 310 SdHoareTripleChecker+Invalid, 260 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 259 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-14 17:52:14,995 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [2 Valid, 310 Invalid, 260 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 259 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-14 17:52:14,995 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2022-04-14 17:52:15,010 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2022-04-14 17:52:15,010 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-14 17:52:15,011 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:15,011 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:15,011 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:15,013 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 17:52:15,013 INFO L93 Difference]: Finished difference Result 51 states and 59 transitions. [2022-04-14 17:52:15,013 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 59 transitions. [2022-04-14 17:52:15,013 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 17:52:15,013 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 17:52:15,014 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:15,014 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:15,015 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 17:52:15,015 INFO L93 Difference]: Finished difference Result 51 states and 59 transitions. [2022-04-14 17:52:15,015 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 59 transitions. [2022-04-14 17:52:15,015 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 17:52:15,015 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 17:52:15,015 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-14 17:52:15,015 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-14 17:52:15,015 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:15,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 59 transitions. [2022-04-14 17:52:15,016 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 59 transitions. Word has length 75 [2022-04-14 17:52:15,016 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-14 17:52:15,016 INFO L478 AbstractCegarLoop]: Abstraction has 51 states and 59 transitions. [2022-04-14 17:52:15,016 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:15,016 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 59 transitions. [2022-04-14 17:52:15,017 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2022-04-14 17:52:15,017 INFO L491 BasicCegarLoop]: Found error trace [2022-04-14 17:52:15,017 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:15,025 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2022-04-14 17:52:15,226 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:15,228 INFO L403 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-14 17:52:15,228 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-14 17:52:15,228 INFO L85 PathProgramCache]: Analyzing trace with hash 615143773, now seen corresponding path program 7 times [2022-04-14 17:52:15,229 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-14 17:52:15,229 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [838496744] [2022-04-14 17:52:15,229 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 17:52:15,229 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-14 17:52:15,239 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-14 17:52:15,239 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [231644728] [2022-04-14 17:52:15,239 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-04-14 17:52:15,239 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-14 17:52:15,239 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-14 17:52:15,240 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:15,244 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:07,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 17:53:07,346 INFO L263 TraceCheckSpWp]: Trace formula consists of 215 conjuncts, 36 conjunts are in the unsatisfiable core [2022-04-14 17:53:07,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 17:53:07,359 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-14 17:53:07,787 INFO L272 TraceCheckUtils]: 0: Hoare triple {3610#true} call ULTIMATE.init(); {3610#true} is VALID [2022-04-14 17:53:07,787 INFO L290 TraceCheckUtils]: 1: Hoare triple {3610#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); {3610#true} is VALID [2022-04-14 17:53:07,787 INFO L290 TraceCheckUtils]: 2: Hoare triple {3610#true} assume true; {3610#true} is VALID [2022-04-14 17:53:07,787 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3610#true} {3610#true} #63#return; {3610#true} is VALID [2022-04-14 17:53:07,787 INFO L272 TraceCheckUtils]: 4: Hoare triple {3610#true} call #t~ret5 := main(); {3610#true} is VALID [2022-04-14 17:53:07,787 INFO L290 TraceCheckUtils]: 5: Hoare triple {3610#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; {3610#true} is VALID [2022-04-14 17:53:07,788 INFO L272 TraceCheckUtils]: 6: Hoare triple {3610#true} call assume_abort_if_not((if ~k~0 >= 0 && ~k~0 <= 10 then 1 else 0)); {3610#true} is VALID [2022-04-14 17:53:07,788 INFO L290 TraceCheckUtils]: 7: Hoare triple {3610#true} ~cond := #in~cond; {3610#true} is VALID [2022-04-14 17:53:07,788 INFO L290 TraceCheckUtils]: 8: Hoare triple {3610#true} assume !(0 == ~cond); {3610#true} is VALID [2022-04-14 17:53:07,788 INFO L290 TraceCheckUtils]: 9: Hoare triple {3610#true} assume true; {3610#true} is VALID [2022-04-14 17:53:07,788 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {3610#true} {3610#true} #53#return; {3610#true} is VALID [2022-04-14 17:53:07,788 INFO L272 TraceCheckUtils]: 11: Hoare triple {3610#true} call assume_abort_if_not((if ~k~0 <= 256 then 1 else 0)); {3610#true} is VALID [2022-04-14 17:53:07,788 INFO L290 TraceCheckUtils]: 12: Hoare triple {3610#true} ~cond := #in~cond; {3610#true} is VALID [2022-04-14 17:53:07,788 INFO L290 TraceCheckUtils]: 13: Hoare triple {3610#true} assume !(0 == ~cond); {3610#true} is VALID [2022-04-14 17:53:07,788 INFO L290 TraceCheckUtils]: 14: Hoare triple {3610#true} assume true; {3610#true} is VALID [2022-04-14 17:53:07,788 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {3610#true} {3610#true} #55#return; {3610#true} is VALID [2022-04-14 17:53:07,788 INFO L290 TraceCheckUtils]: 16: Hoare triple {3610#true} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {3663#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-14 17:53:07,789 INFO L290 TraceCheckUtils]: 17: Hoare triple {3663#(and (= main_~c~0 0) (= main_~y~0 0))} assume !false; {3663#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-14 17:53:07,789 INFO L272 TraceCheckUtils]: 18: Hoare triple {3663#(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)); {3610#true} is VALID [2022-04-14 17:53:07,789 INFO L290 TraceCheckUtils]: 19: Hoare triple {3610#true} ~cond := #in~cond; {3610#true} is VALID [2022-04-14 17:53:07,789 INFO L290 TraceCheckUtils]: 20: Hoare triple {3610#true} assume !(0 == ~cond); {3610#true} is VALID [2022-04-14 17:53:07,789 INFO L290 TraceCheckUtils]: 21: Hoare triple {3610#true} assume true; {3610#true} is VALID [2022-04-14 17:53:07,790 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {3610#true} {3663#(and (= main_~c~0 0) (= main_~y~0 0))} #57#return; {3663#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-14 17:53:07,790 INFO L290 TraceCheckUtils]: 23: Hoare triple {3663#(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; {3685#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} is VALID [2022-04-14 17:53:07,791 INFO L290 TraceCheckUtils]: 24: Hoare triple {3685#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} assume !false; {3685#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} is VALID [2022-04-14 17:53:07,791 INFO L272 TraceCheckUtils]: 25: Hoare triple {3685#(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)); {3610#true} is VALID [2022-04-14 17:53:07,791 INFO L290 TraceCheckUtils]: 26: Hoare triple {3610#true} ~cond := #in~cond; {3610#true} is VALID [2022-04-14 17:53:07,791 INFO L290 TraceCheckUtils]: 27: Hoare triple {3610#true} assume !(0 == ~cond); {3610#true} is VALID [2022-04-14 17:53:07,791 INFO L290 TraceCheckUtils]: 28: Hoare triple {3610#true} assume true; {3610#true} is VALID [2022-04-14 17:53:07,791 INFO L284 TraceCheckUtils]: 29: Hoare quadruple {3610#true} {3685#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} #57#return; {3685#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} is VALID [2022-04-14 17:53:07,792 INFO L290 TraceCheckUtils]: 30: Hoare triple {3685#(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; {3707#(and (= (+ (- 1) main_~y~0) 1) (= 0 (+ (- 2) main_~c~0)))} is VALID [2022-04-14 17:53:07,792 INFO L290 TraceCheckUtils]: 31: Hoare triple {3707#(and (= (+ (- 1) main_~y~0) 1) (= 0 (+ (- 2) main_~c~0)))} assume !false; {3707#(and (= (+ (- 1) main_~y~0) 1) (= 0 (+ (- 2) main_~c~0)))} is VALID [2022-04-14 17:53:07,792 INFO L272 TraceCheckUtils]: 32: Hoare triple {3707#(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)); {3610#true} is VALID [2022-04-14 17:53:07,793 INFO L290 TraceCheckUtils]: 33: Hoare triple {3610#true} ~cond := #in~cond; {3610#true} is VALID [2022-04-14 17:53:07,793 INFO L290 TraceCheckUtils]: 34: Hoare triple {3610#true} assume !(0 == ~cond); {3610#true} is VALID [2022-04-14 17:53:07,793 INFO L290 TraceCheckUtils]: 35: Hoare triple {3610#true} assume true; {3610#true} is VALID [2022-04-14 17:53:07,793 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {3610#true} {3707#(and (= (+ (- 1) main_~y~0) 1) (= 0 (+ (- 2) main_~c~0)))} #57#return; {3707#(and (= (+ (- 1) main_~y~0) 1) (= 0 (+ (- 2) main_~c~0)))} is VALID [2022-04-14 17:53:07,794 INFO L290 TraceCheckUtils]: 37: Hoare triple {3707#(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; {3729#(and (= main_~y~0 3) (= main_~c~0 3))} is VALID [2022-04-14 17:53:07,794 INFO L290 TraceCheckUtils]: 38: Hoare triple {3729#(and (= main_~y~0 3) (= main_~c~0 3))} assume !false; {3729#(and (= main_~y~0 3) (= main_~c~0 3))} is VALID [2022-04-14 17:53:07,794 INFO L272 TraceCheckUtils]: 39: Hoare triple {3729#(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)); {3610#true} is VALID [2022-04-14 17:53:07,794 INFO L290 TraceCheckUtils]: 40: Hoare triple {3610#true} ~cond := #in~cond; {3610#true} is VALID [2022-04-14 17:53:07,794 INFO L290 TraceCheckUtils]: 41: Hoare triple {3610#true} assume !(0 == ~cond); {3610#true} is VALID [2022-04-14 17:53:07,794 INFO L290 TraceCheckUtils]: 42: Hoare triple {3610#true} assume true; {3610#true} is VALID [2022-04-14 17:53:07,795 INFO L284 TraceCheckUtils]: 43: Hoare quadruple {3610#true} {3729#(and (= main_~y~0 3) (= main_~c~0 3))} #57#return; {3729#(and (= main_~y~0 3) (= main_~c~0 3))} is VALID [2022-04-14 17:53:07,815 INFO L290 TraceCheckUtils]: 44: Hoare triple {3729#(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; {3751#(and (= 3 (+ (- 1) main_~y~0)) (= main_~c~0 4))} is VALID [2022-04-14 17:53:07,816 INFO L290 TraceCheckUtils]: 45: Hoare triple {3751#(and (= 3 (+ (- 1) main_~y~0)) (= main_~c~0 4))} assume !false; {3751#(and (= 3 (+ (- 1) main_~y~0)) (= main_~c~0 4))} is VALID [2022-04-14 17:53:07,816 INFO L272 TraceCheckUtils]: 46: Hoare triple {3751#(and (= 3 (+ (- 1) main_~y~0)) (= main_~c~0 4))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {3610#true} is VALID [2022-04-14 17:53:07,816 INFO L290 TraceCheckUtils]: 47: Hoare triple {3610#true} ~cond := #in~cond; {3610#true} is VALID [2022-04-14 17:53:07,816 INFO L290 TraceCheckUtils]: 48: Hoare triple {3610#true} assume !(0 == ~cond); {3610#true} is VALID [2022-04-14 17:53:07,816 INFO L290 TraceCheckUtils]: 49: Hoare triple {3610#true} assume true; {3610#true} is VALID [2022-04-14 17:53:07,825 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {3610#true} {3751#(and (= 3 (+ (- 1) main_~y~0)) (= main_~c~0 4))} #57#return; {3751#(and (= 3 (+ (- 1) main_~y~0)) (= main_~c~0 4))} is VALID [2022-04-14 17:53:07,826 INFO L290 TraceCheckUtils]: 51: Hoare triple {3751#(and (= 3 (+ (- 1) main_~y~0)) (= main_~c~0 4))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {3773#(and (= (+ (- 1) main_~c~0) 4) (= 5 main_~y~0))} is VALID [2022-04-14 17:53:07,826 INFO L290 TraceCheckUtils]: 52: Hoare triple {3773#(and (= (+ (- 1) main_~c~0) 4) (= 5 main_~y~0))} assume !false; {3773#(and (= (+ (- 1) main_~c~0) 4) (= 5 main_~y~0))} is VALID [2022-04-14 17:53:07,826 INFO L272 TraceCheckUtils]: 53: Hoare triple {3773#(and (= (+ (- 1) main_~c~0) 4) (= 5 main_~y~0))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {3610#true} is VALID [2022-04-14 17:53:07,826 INFO L290 TraceCheckUtils]: 54: Hoare triple {3610#true} ~cond := #in~cond; {3610#true} is VALID [2022-04-14 17:53:07,826 INFO L290 TraceCheckUtils]: 55: Hoare triple {3610#true} assume !(0 == ~cond); {3610#true} is VALID [2022-04-14 17:53:07,826 INFO L290 TraceCheckUtils]: 56: Hoare triple {3610#true} assume true; {3610#true} is VALID [2022-04-14 17:53:07,827 INFO L284 TraceCheckUtils]: 57: Hoare quadruple {3610#true} {3773#(and (= (+ (- 1) main_~c~0) 4) (= 5 main_~y~0))} #57#return; {3773#(and (= (+ (- 1) main_~c~0) 4) (= 5 main_~y~0))} is VALID [2022-04-14 17:53:07,827 INFO L290 TraceCheckUtils]: 58: Hoare triple {3773#(and (= (+ (- 1) main_~c~0) 4) (= 5 main_~y~0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {3795#(and (= main_~c~0 6) (= 5 (+ (- 1) main_~y~0)))} is VALID [2022-04-14 17:53:07,827 INFO L290 TraceCheckUtils]: 59: Hoare triple {3795#(and (= main_~c~0 6) (= 5 (+ (- 1) main_~y~0)))} assume !false; {3795#(and (= main_~c~0 6) (= 5 (+ (- 1) main_~y~0)))} is VALID [2022-04-14 17:53:07,827 INFO L272 TraceCheckUtils]: 60: Hoare triple {3795#(and (= main_~c~0 6) (= 5 (+ (- 1) main_~y~0)))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {3610#true} is VALID [2022-04-14 17:53:07,827 INFO L290 TraceCheckUtils]: 61: Hoare triple {3610#true} ~cond := #in~cond; {3610#true} is VALID [2022-04-14 17:53:07,828 INFO L290 TraceCheckUtils]: 62: Hoare triple {3610#true} assume !(0 == ~cond); {3610#true} is VALID [2022-04-14 17:53:07,828 INFO L290 TraceCheckUtils]: 63: Hoare triple {3610#true} assume true; {3610#true} is VALID [2022-04-14 17:53:07,828 INFO L284 TraceCheckUtils]: 64: Hoare quadruple {3610#true} {3795#(and (= main_~c~0 6) (= 5 (+ (- 1) main_~y~0)))} #57#return; {3795#(and (= main_~c~0 6) (= 5 (+ (- 1) main_~y~0)))} is VALID [2022-04-14 17:53:07,828 INFO L290 TraceCheckUtils]: 65: Hoare triple {3795#(and (= main_~c~0 6) (= 5 (+ (- 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; {3817#(and (<= main_~c~0 7) (= (+ (- 2) main_~y~0) 5) (< 6 main_~k~0))} is VALID [2022-04-14 17:53:07,829 INFO L290 TraceCheckUtils]: 66: Hoare triple {3817#(and (<= main_~c~0 7) (= (+ (- 2) main_~y~0) 5) (< 6 main_~k~0))} assume !false; {3817#(and (<= main_~c~0 7) (= (+ (- 2) main_~y~0) 5) (< 6 main_~k~0))} is VALID [2022-04-14 17:53:07,829 INFO L272 TraceCheckUtils]: 67: Hoare triple {3817#(and (<= main_~c~0 7) (= (+ (- 2) main_~y~0) 5) (< 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)); {3610#true} is VALID [2022-04-14 17:53:07,829 INFO L290 TraceCheckUtils]: 68: Hoare triple {3610#true} ~cond := #in~cond; {3610#true} is VALID [2022-04-14 17:53:07,829 INFO L290 TraceCheckUtils]: 69: Hoare triple {3610#true} assume !(0 == ~cond); {3610#true} is VALID [2022-04-14 17:53:07,829 INFO L290 TraceCheckUtils]: 70: Hoare triple {3610#true} assume true; {3610#true} is VALID [2022-04-14 17:53:07,829 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {3610#true} {3817#(and (<= main_~c~0 7) (= (+ (- 2) main_~y~0) 5) (< 6 main_~k~0))} #57#return; {3817#(and (<= main_~c~0 7) (= (+ (- 2) main_~y~0) 5) (< 6 main_~k~0))} is VALID [2022-04-14 17:53:07,830 INFO L290 TraceCheckUtils]: 72: Hoare triple {3817#(and (<= main_~c~0 7) (= (+ (- 2) main_~y~0) 5) (< 6 main_~k~0))} assume !(~c~0 < ~k~0); {3839#(and (<= main_~k~0 7) (= (+ (- 2) main_~y~0) 5) (< 6 main_~k~0))} is VALID [2022-04-14 17:53:07,830 INFO L272 TraceCheckUtils]: 73: Hoare triple {3839#(and (<= main_~k~0 7) (= (+ (- 2) main_~y~0) 5) (< 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)); {3610#true} is VALID [2022-04-14 17:53:07,830 INFO L290 TraceCheckUtils]: 74: Hoare triple {3610#true} ~cond := #in~cond; {3610#true} is VALID [2022-04-14 17:53:07,830 INFO L290 TraceCheckUtils]: 75: Hoare triple {3610#true} assume !(0 == ~cond); {3610#true} is VALID [2022-04-14 17:53:07,830 INFO L290 TraceCheckUtils]: 76: Hoare triple {3610#true} assume true; {3610#true} is VALID [2022-04-14 17:53:07,831 INFO L284 TraceCheckUtils]: 77: Hoare quadruple {3610#true} {3839#(and (<= main_~k~0 7) (= (+ (- 2) main_~y~0) 5) (< 6 main_~k~0))} #59#return; {3839#(and (<= main_~k~0 7) (= (+ (- 2) main_~y~0) 5) (< 6 main_~k~0))} is VALID [2022-04-14 17:53:07,832 INFO L272 TraceCheckUtils]: 78: Hoare triple {3839#(and (<= main_~k~0 7) (= (+ (- 2) main_~y~0) 5) (< 6 main_~k~0))} call __VERIFIER_assert((if ~k~0 * ~y~0 == ~y~0 * ~y~0 then 1 else 0)); {3858#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-14 17:53:07,832 INFO L290 TraceCheckUtils]: 79: Hoare triple {3858#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {3862#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-14 17:53:07,832 INFO L290 TraceCheckUtils]: 80: Hoare triple {3862#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {3611#false} is VALID [2022-04-14 17:53:07,832 INFO L290 TraceCheckUtils]: 81: Hoare triple {3611#false} assume !false; {3611#false} is VALID [2022-04-14 17:53:07,833 INFO L134 CoverageAnalysis]: Checked inductivity of 250 backedges. 18 proven. 84 refuted. 0 times theorem prover too weak. 148 trivial. 0 not checked. [2022-04-14 17:53:07,833 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-14 17:53:08,082 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-14 17:53:08,082 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [838496744] [2022-04-14 17:53:08,082 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-14 17:53:08,082 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [231644728] [2022-04-14 17:53:08,082 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [231644728] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-14 17:53:08,082 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-14 17:53:08,082 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2022-04-14 17:53:08,082 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1946562129] [2022-04-14 17:53:08,082 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2022-04-14 17:53:08,083 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 2.4166666666666665) internal successors, (29), 12 states have internal predecessors, (29), 10 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (12), 10 states have call predecessors, (12), 10 states have call successors, (12) Word has length 82 [2022-04-14 17:53:08,083 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-14 17:53:08,083 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 13 states, 12 states have (on average 2.4166666666666665) internal successors, (29), 12 states have internal predecessors, (29), 10 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (12), 10 states have call predecessors, (12), 10 states have call successors, (12) [2022-04-14 17:53:08,128 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 55 edges. 55 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-14 17:53:08,128 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-04-14 17:53:08,128 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-14 17:53:08,129 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-04-14 17:53:08,129 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=198, Unknown=0, NotChecked=0, Total=240 [2022-04-14 17:53:08,129 INFO L87 Difference]: Start difference. First operand 51 states and 59 transitions. Second operand has 13 states, 12 states have (on average 2.4166666666666665) internal successors, (29), 12 states have internal predecessors, (29), 10 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (12), 10 states have call predecessors, (12), 10 states have call successors, (12) [2022-04-14 17:53:08,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 17:53:08,860 INFO L93 Difference]: Finished difference Result 60 states and 70 transitions. [2022-04-14 17:53:08,860 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-04-14 17:53:08,860 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 2.4166666666666665) internal successors, (29), 12 states have internal predecessors, (29), 10 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (12), 10 states have call predecessors, (12), 10 states have call successors, (12) Word has length 82 [2022-04-14 17:53:08,861 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-14 17:53:08,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 12 states have (on average 2.4166666666666665) internal successors, (29), 12 states have internal predecessors, (29), 10 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (12), 10 states have call predecessors, (12), 10 states have call successors, (12) [2022-04-14 17:53:08,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 66 transitions. [2022-04-14 17:53:08,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 12 states have (on average 2.4166666666666665) internal successors, (29), 12 states have internal predecessors, (29), 10 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (12), 10 states have call predecessors, (12), 10 states have call successors, (12) [2022-04-14 17:53:08,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 66 transitions. [2022-04-14 17:53:08,863 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 13 states and 66 transitions. [2022-04-14 17:53:08,917 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:53:08,919 INFO L225 Difference]: With dead ends: 60 [2022-04-14 17:53:08,919 INFO L226 Difference]: Without dead ends: 54 [2022-04-14 17:53:08,919 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 84 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=52, Invalid=254, Unknown=0, NotChecked=0, Total=306 [2022-04-14 17:53:08,919 INFO L913 BasicCegarLoop]: 48 mSDtfsCounter, 2 mSDsluCounter, 303 mSDsCounter, 0 mSdLazyCounter, 317 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 351 SdHoareTripleChecker+Invalid, 318 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 317 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-04-14 17:53:08,919 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [2 Valid, 351 Invalid, 318 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 317 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-04-14 17:53:08,920 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2022-04-14 17:53:08,955 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2022-04-14 17:53:08,955 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-14 17:53:08,955 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:53:08,955 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:53:08,955 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:53:08,956 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 17:53:08,957 INFO L93 Difference]: Finished difference Result 54 states and 63 transitions. [2022-04-14 17:53:08,957 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 63 transitions. [2022-04-14 17:53:08,957 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 17:53:08,957 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 17:53:08,957 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:53:08,957 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:53:08,958 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 17:53:08,958 INFO L93 Difference]: Finished difference Result 54 states and 63 transitions. [2022-04-14 17:53:08,958 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 63 transitions. [2022-04-14 17:53:08,958 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 17:53:08,958 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 17:53:08,958 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-14 17:53:08,958 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-14 17:53:08,959 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:53:08,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 63 transitions. [2022-04-14 17:53:08,960 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 63 transitions. Word has length 82 [2022-04-14 17:53:08,960 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-14 17:53:08,960 INFO L478 AbstractCegarLoop]: Abstraction has 54 states and 63 transitions. [2022-04-14 17:53:08,960 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 2.4166666666666665) internal successors, (29), 12 states have internal predecessors, (29), 10 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (12), 10 states have call predecessors, (12), 10 states have call successors, (12) [2022-04-14 17:53:08,960 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 63 transitions. [2022-04-14 17:53:08,960 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2022-04-14 17:53:08,960 INFO L491 BasicCegarLoop]: Found error trace [2022-04-14 17:53:08,960 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:53:09,000 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:53:09,161 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:53:09,161 INFO L403 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-14 17:53:09,161 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-14 17:53:09,161 INFO L85 PathProgramCache]: Analyzing trace with hash -1334355539, now seen corresponding path program 8 times [2022-04-14 17:53:09,161 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-14 17:53:09,162 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [363169498] [2022-04-14 17:53:09,162 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 17:53:09,162 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-14 17:53:09,177 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-14 17:53:09,177 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [293698901] [2022-04-14 17:53:09,177 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-14 17:53:09,177 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-14 17:53:09,177 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-14 17:53:09,184 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:53:09,187 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:53:09,846 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-14 17:53:09,846 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-14 17:53:09,848 INFO L263 TraceCheckSpWp]: Trace formula consists of 232 conjuncts, 55 conjunts are in the unsatisfiable core [2022-04-14 17:53:09,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 17:53:09,864 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-14 17:53:10,436 INFO L272 TraceCheckUtils]: 0: Hoare triple {4214#true} call ULTIMATE.init(); {4214#true} is VALID [2022-04-14 17:53:10,436 INFO L290 TraceCheckUtils]: 1: Hoare triple {4214#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); {4214#true} is VALID [2022-04-14 17:53:10,437 INFO L290 TraceCheckUtils]: 2: Hoare triple {4214#true} assume true; {4214#true} is VALID [2022-04-14 17:53:10,437 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4214#true} {4214#true} #63#return; {4214#true} is VALID [2022-04-14 17:53:10,437 INFO L272 TraceCheckUtils]: 4: Hoare triple {4214#true} call #t~ret5 := main(); {4214#true} is VALID [2022-04-14 17:53:10,437 INFO L290 TraceCheckUtils]: 5: Hoare triple {4214#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; {4214#true} is VALID [2022-04-14 17:53:10,437 INFO L272 TraceCheckUtils]: 6: Hoare triple {4214#true} call assume_abort_if_not((if ~k~0 >= 0 && ~k~0 <= 10 then 1 else 0)); {4214#true} is VALID [2022-04-14 17:53:10,437 INFO L290 TraceCheckUtils]: 7: Hoare triple {4214#true} ~cond := #in~cond; {4214#true} is VALID [2022-04-14 17:53:10,437 INFO L290 TraceCheckUtils]: 8: Hoare triple {4214#true} assume !(0 == ~cond); {4214#true} is VALID [2022-04-14 17:53:10,437 INFO L290 TraceCheckUtils]: 9: Hoare triple {4214#true} assume true; {4214#true} is VALID [2022-04-14 17:53:10,437 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {4214#true} {4214#true} #53#return; {4214#true} is VALID [2022-04-14 17:53:10,437 INFO L272 TraceCheckUtils]: 11: Hoare triple {4214#true} call assume_abort_if_not((if ~k~0 <= 256 then 1 else 0)); {4214#true} is VALID [2022-04-14 17:53:10,437 INFO L290 TraceCheckUtils]: 12: Hoare triple {4214#true} ~cond := #in~cond; {4214#true} is VALID [2022-04-14 17:53:10,437 INFO L290 TraceCheckUtils]: 13: Hoare triple {4214#true} assume !(0 == ~cond); {4214#true} is VALID [2022-04-14 17:53:10,437 INFO L290 TraceCheckUtils]: 14: Hoare triple {4214#true} assume true; {4214#true} is VALID [2022-04-14 17:53:10,437 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {4214#true} {4214#true} #55#return; {4214#true} is VALID [2022-04-14 17:53:10,438 INFO L290 TraceCheckUtils]: 16: Hoare triple {4214#true} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {4267#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-14 17:53:10,438 INFO L290 TraceCheckUtils]: 17: Hoare triple {4267#(and (= main_~c~0 0) (= main_~y~0 0))} assume !false; {4267#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-14 17:53:10,438 INFO L272 TraceCheckUtils]: 18: Hoare triple {4267#(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)); {4214#true} is VALID [2022-04-14 17:53:10,438 INFO L290 TraceCheckUtils]: 19: Hoare triple {4214#true} ~cond := #in~cond; {4214#true} is VALID [2022-04-14 17:53:10,438 INFO L290 TraceCheckUtils]: 20: Hoare triple {4214#true} assume !(0 == ~cond); {4214#true} is VALID [2022-04-14 17:53:10,438 INFO L290 TraceCheckUtils]: 21: Hoare triple {4214#true} assume true; {4214#true} is VALID [2022-04-14 17:53:10,438 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {4214#true} {4267#(and (= main_~c~0 0) (= main_~y~0 0))} #57#return; {4267#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-14 17:53:10,439 INFO L290 TraceCheckUtils]: 23: Hoare triple {4267#(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; {4289#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} is VALID [2022-04-14 17:53:10,439 INFO L290 TraceCheckUtils]: 24: Hoare triple {4289#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} assume !false; {4289#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} is VALID [2022-04-14 17:53:10,439 INFO L272 TraceCheckUtils]: 25: Hoare triple {4289#(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)); {4214#true} is VALID [2022-04-14 17:53:10,439 INFO L290 TraceCheckUtils]: 26: Hoare triple {4214#true} ~cond := #in~cond; {4214#true} is VALID [2022-04-14 17:53:10,439 INFO L290 TraceCheckUtils]: 27: Hoare triple {4214#true} assume !(0 == ~cond); {4214#true} is VALID [2022-04-14 17:53:10,439 INFO L290 TraceCheckUtils]: 28: Hoare triple {4214#true} assume true; {4214#true} is VALID [2022-04-14 17:53:10,440 INFO L284 TraceCheckUtils]: 29: Hoare quadruple {4214#true} {4289#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} #57#return; {4289#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} is VALID [2022-04-14 17:53:10,440 INFO L290 TraceCheckUtils]: 30: Hoare triple {4289#(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; {4311#(and (= (+ (- 1) main_~c~0) 1) (= (+ (- 2) main_~y~0) 0))} is VALID [2022-04-14 17:53:10,440 INFO L290 TraceCheckUtils]: 31: Hoare triple {4311#(and (= (+ (- 1) main_~c~0) 1) (= (+ (- 2) main_~y~0) 0))} assume !false; {4311#(and (= (+ (- 1) main_~c~0) 1) (= (+ (- 2) main_~y~0) 0))} is VALID [2022-04-14 17:53:10,440 INFO L272 TraceCheckUtils]: 32: Hoare triple {4311#(and (= (+ (- 1) main_~c~0) 1) (= (+ (- 2) 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)); {4214#true} is VALID [2022-04-14 17:53:10,441 INFO L290 TraceCheckUtils]: 33: Hoare triple {4214#true} ~cond := #in~cond; {4214#true} is VALID [2022-04-14 17:53:10,441 INFO L290 TraceCheckUtils]: 34: Hoare triple {4214#true} assume !(0 == ~cond); {4214#true} is VALID [2022-04-14 17:53:10,441 INFO L290 TraceCheckUtils]: 35: Hoare triple {4214#true} assume true; {4214#true} is VALID [2022-04-14 17:53:10,441 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {4214#true} {4311#(and (= (+ (- 1) main_~c~0) 1) (= (+ (- 2) main_~y~0) 0))} #57#return; {4311#(and (= (+ (- 1) main_~c~0) 1) (= (+ (- 2) main_~y~0) 0))} is VALID [2022-04-14 17:53:10,441 INFO L290 TraceCheckUtils]: 37: Hoare triple {4311#(and (= (+ (- 1) main_~c~0) 1) (= (+ (- 2) 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; {4333#(and (= main_~y~0 3) (= main_~c~0 3))} is VALID [2022-04-14 17:53:10,442 INFO L290 TraceCheckUtils]: 38: Hoare triple {4333#(and (= main_~y~0 3) (= main_~c~0 3))} assume !false; {4333#(and (= main_~y~0 3) (= main_~c~0 3))} is VALID [2022-04-14 17:53:10,442 INFO L272 TraceCheckUtils]: 39: Hoare triple {4333#(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)); {4214#true} is VALID [2022-04-14 17:53:10,442 INFO L290 TraceCheckUtils]: 40: Hoare triple {4214#true} ~cond := #in~cond; {4214#true} is VALID [2022-04-14 17:53:10,442 INFO L290 TraceCheckUtils]: 41: Hoare triple {4214#true} assume !(0 == ~cond); {4214#true} is VALID [2022-04-14 17:53:10,442 INFO L290 TraceCheckUtils]: 42: Hoare triple {4214#true} assume true; {4214#true} is VALID [2022-04-14 17:53:10,442 INFO L284 TraceCheckUtils]: 43: Hoare quadruple {4214#true} {4333#(and (= main_~y~0 3) (= main_~c~0 3))} #57#return; {4333#(and (= main_~y~0 3) (= main_~c~0 3))} is VALID [2022-04-14 17:53:10,442 INFO L290 TraceCheckUtils]: 44: Hoare triple {4333#(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; {4355#(and (= (+ (- 1) main_~c~0) 3) (= 3 (+ (- 1) main_~y~0)))} is VALID [2022-04-14 17:53:10,443 INFO L290 TraceCheckUtils]: 45: Hoare triple {4355#(and (= (+ (- 1) main_~c~0) 3) (= 3 (+ (- 1) main_~y~0)))} assume !false; {4355#(and (= (+ (- 1) main_~c~0) 3) (= 3 (+ (- 1) main_~y~0)))} is VALID [2022-04-14 17:53:10,443 INFO L272 TraceCheckUtils]: 46: Hoare triple {4355#(and (= (+ (- 1) main_~c~0) 3) (= 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)); {4214#true} is VALID [2022-04-14 17:53:10,443 INFO L290 TraceCheckUtils]: 47: Hoare triple {4214#true} ~cond := #in~cond; {4214#true} is VALID [2022-04-14 17:53:10,443 INFO L290 TraceCheckUtils]: 48: Hoare triple {4214#true} assume !(0 == ~cond); {4214#true} is VALID [2022-04-14 17:53:10,443 INFO L290 TraceCheckUtils]: 49: Hoare triple {4214#true} assume true; {4214#true} is VALID [2022-04-14 17:53:10,443 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {4214#true} {4355#(and (= (+ (- 1) main_~c~0) 3) (= 3 (+ (- 1) main_~y~0)))} #57#return; {4355#(and (= (+ (- 1) main_~c~0) 3) (= 3 (+ (- 1) main_~y~0)))} is VALID [2022-04-14 17:53:10,444 INFO L290 TraceCheckUtils]: 51: Hoare triple {4355#(and (= (+ (- 1) main_~c~0) 3) (= 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; {4377#(and (= 5 main_~c~0) (= 5 main_~y~0))} is VALID [2022-04-14 17:53:10,444 INFO L290 TraceCheckUtils]: 52: Hoare triple {4377#(and (= 5 main_~c~0) (= 5 main_~y~0))} assume !false; {4377#(and (= 5 main_~c~0) (= 5 main_~y~0))} is VALID [2022-04-14 17:53:10,444 INFO L272 TraceCheckUtils]: 53: Hoare triple {4377#(and (= 5 main_~c~0) (= 5 main_~y~0))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {4214#true} is VALID [2022-04-14 17:53:10,444 INFO L290 TraceCheckUtils]: 54: Hoare triple {4214#true} ~cond := #in~cond; {4214#true} is VALID [2022-04-14 17:53:10,444 INFO L290 TraceCheckUtils]: 55: Hoare triple {4214#true} assume !(0 == ~cond); {4214#true} is VALID [2022-04-14 17:53:10,444 INFO L290 TraceCheckUtils]: 56: Hoare triple {4214#true} assume true; {4214#true} is VALID [2022-04-14 17:53:10,444 INFO L284 TraceCheckUtils]: 57: Hoare quadruple {4214#true} {4377#(and (= 5 main_~c~0) (= 5 main_~y~0))} #57#return; {4377#(and (= 5 main_~c~0) (= 5 main_~y~0))} is VALID [2022-04-14 17:53:10,445 INFO L290 TraceCheckUtils]: 58: Hoare triple {4377#(and (= 5 main_~c~0) (= 5 main_~y~0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {4399#(and (= main_~y~0 6) (= (+ (- 1) main_~c~0) 5))} is VALID [2022-04-14 17:53:10,445 INFO L290 TraceCheckUtils]: 59: Hoare triple {4399#(and (= main_~y~0 6) (= (+ (- 1) main_~c~0) 5))} assume !false; {4399#(and (= main_~y~0 6) (= (+ (- 1) main_~c~0) 5))} is VALID [2022-04-14 17:53:10,445 INFO L272 TraceCheckUtils]: 60: Hoare triple {4399#(and (= main_~y~0 6) (= (+ (- 1) main_~c~0) 5))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {4214#true} is VALID [2022-04-14 17:53:10,445 INFO L290 TraceCheckUtils]: 61: Hoare triple {4214#true} ~cond := #in~cond; {4214#true} is VALID [2022-04-14 17:53:10,445 INFO L290 TraceCheckUtils]: 62: Hoare triple {4214#true} assume !(0 == ~cond); {4214#true} is VALID [2022-04-14 17:53:10,445 INFO L290 TraceCheckUtils]: 63: Hoare triple {4214#true} assume true; {4214#true} is VALID [2022-04-14 17:53:10,446 INFO L284 TraceCheckUtils]: 64: Hoare quadruple {4214#true} {4399#(and (= main_~y~0 6) (= (+ (- 1) main_~c~0) 5))} #57#return; {4399#(and (= main_~y~0 6) (= (+ (- 1) main_~c~0) 5))} is VALID [2022-04-14 17:53:10,446 INFO L290 TraceCheckUtils]: 65: Hoare triple {4399#(and (= main_~y~0 6) (= (+ (- 1) main_~c~0) 5))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {4421#(and (= 7 main_~y~0) (= 5 (+ (- 2) main_~c~0)))} is VALID [2022-04-14 17:53:10,446 INFO L290 TraceCheckUtils]: 66: Hoare triple {4421#(and (= 7 main_~y~0) (= 5 (+ (- 2) main_~c~0)))} assume !false; {4421#(and (= 7 main_~y~0) (= 5 (+ (- 2) main_~c~0)))} is VALID [2022-04-14 17:53:10,446 INFO L272 TraceCheckUtils]: 67: Hoare triple {4421#(and (= 7 main_~y~0) (= 5 (+ (- 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)); {4214#true} is VALID [2022-04-14 17:53:10,446 INFO L290 TraceCheckUtils]: 68: Hoare triple {4214#true} ~cond := #in~cond; {4431#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-14 17:53:10,447 INFO L290 TraceCheckUtils]: 69: Hoare triple {4431#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {4435#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-14 17:53:10,447 INFO L290 TraceCheckUtils]: 70: Hoare triple {4435#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {4435#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-14 17:53:10,448 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {4435#(not (= |__VERIFIER_assert_#in~cond| 0))} {4421#(and (= 7 main_~y~0) (= 5 (+ (- 2) main_~c~0)))} #57#return; {4442#(and (= 7 main_~y~0) (= 5 (+ (- 2) main_~c~0)) (= (+ (* 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:53:10,448 INFO L290 TraceCheckUtils]: 72: Hoare triple {4442#(and (= 7 main_~y~0) (= 5 (+ (- 2) main_~c~0)) (= (+ (* 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; {4446#(and (< 7 main_~k~0) (= main_~y~0 8) (<= main_~c~0 8) (<= (+ 29008 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) main_~x~0))} is VALID [2022-04-14 17:53:10,448 INFO L290 TraceCheckUtils]: 73: Hoare triple {4446#(and (< 7 main_~k~0) (= main_~y~0 8) (<= main_~c~0 8) (<= (+ 29008 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) main_~x~0))} assume !false; {4446#(and (< 7 main_~k~0) (= main_~y~0 8) (<= main_~c~0 8) (<= (+ 29008 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) main_~x~0))} is VALID [2022-04-14 17:53:10,448 INFO L272 TraceCheckUtils]: 74: Hoare triple {4446#(and (< 7 main_~k~0) (= main_~y~0 8) (<= main_~c~0 8) (<= (+ 29008 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) main_~x~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)); {4214#true} is VALID [2022-04-14 17:53:10,449 INFO L290 TraceCheckUtils]: 75: Hoare triple {4214#true} ~cond := #in~cond; {4214#true} is VALID [2022-04-14 17:53:10,449 INFO L290 TraceCheckUtils]: 76: Hoare triple {4214#true} assume !(0 == ~cond); {4214#true} is VALID [2022-04-14 17:53:10,449 INFO L290 TraceCheckUtils]: 77: Hoare triple {4214#true} assume true; {4214#true} is VALID [2022-04-14 17:53:10,449 INFO L284 TraceCheckUtils]: 78: Hoare quadruple {4214#true} {4446#(and (< 7 main_~k~0) (= main_~y~0 8) (<= main_~c~0 8) (<= (+ 29008 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) main_~x~0))} #57#return; {4446#(and (< 7 main_~k~0) (= main_~y~0 8) (<= main_~c~0 8) (<= (+ 29008 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) main_~x~0))} is VALID [2022-04-14 17:53:10,450 INFO L290 TraceCheckUtils]: 79: Hoare triple {4446#(and (< 7 main_~k~0) (= main_~y~0 8) (<= main_~c~0 8) (<= (+ 29008 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) main_~x~0))} assume !(~c~0 < ~k~0); {4468#(and (< 7 main_~k~0) (= main_~y~0 8) (<= (+ 29008 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) main_~x~0) (<= main_~k~0 8))} is VALID [2022-04-14 17:53:10,450 INFO L272 TraceCheckUtils]: 80: Hoare triple {4468#(and (< 7 main_~k~0) (= main_~y~0 8) (<= (+ 29008 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) main_~x~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)); {4214#true} is VALID [2022-04-14 17:53:10,450 INFO L290 TraceCheckUtils]: 81: Hoare triple {4214#true} ~cond := #in~cond; {4431#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-14 17:53:10,450 INFO L290 TraceCheckUtils]: 82: Hoare triple {4431#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {4435#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-14 17:53:10,450 INFO L290 TraceCheckUtils]: 83: Hoare triple {4435#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {4435#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-14 17:53:10,451 INFO L284 TraceCheckUtils]: 84: Hoare quadruple {4435#(not (= |__VERIFIER_assert_#in~cond| 0))} {4468#(and (< 7 main_~k~0) (= main_~y~0 8) (<= (+ 29008 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) main_~x~0) (<= main_~k~0 8))} #59#return; {4484#(and (< 7 main_~k~0) (= main_~y~0 8) (<= main_~k~0 8))} is VALID [2022-04-14 17:53:10,451 INFO L272 TraceCheckUtils]: 85: Hoare triple {4484#(and (< 7 main_~k~0) (= main_~y~0 8) (<= main_~k~0 8))} call __VERIFIER_assert((if ~k~0 * ~y~0 == ~y~0 * ~y~0 then 1 else 0)); {4488#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-14 17:53:10,452 INFO L290 TraceCheckUtils]: 86: Hoare triple {4488#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {4492#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-14 17:53:10,452 INFO L290 TraceCheckUtils]: 87: Hoare triple {4492#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {4215#false} is VALID [2022-04-14 17:53:10,452 INFO L290 TraceCheckUtils]: 88: Hoare triple {4215#false} assume !false; {4215#false} is VALID [2022-04-14 17:53:10,452 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 63 proven. 113 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2022-04-14 17:53:10,452 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-14 17:53:25,390 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (* (- 18) c_main_~y~0 c_main_~y~0 c_main_~y~0 c_main_~y~0 c_main_~y~0)) (.cse1 (* (- 2) c_main_~y~0 c_main_~y~0 c_main_~y~0 c_main_~y~0 c_main_~y~0 c_main_~y~0)) (.cse2 (* (- 119) c_main_~y~0 c_main_~y~0)) (.cse3 (* (- 65) c_main_~y~0 c_main_~y~0 c_main_~y~0 c_main_~y~0))) (or (not (= (mod (+ .cse0 .cse1 .cse2 (* (- 120) c_main_~y~0 c_main_~y~0 c_main_~y~0) .cse3) 12) 0)) (forall ((main_~k~0 Int)) (or (< (+ c_main_~c~0 1) main_~k~0) (not (< c_main_~c~0 main_~k~0)) (let ((.cse4 (+ c_main_~y~0 1))) (= (* .cse4 .cse4) (* main_~k~0 .cse4))))) (not (<= (+ (* 10 (* c_main_~y~0 c_main_~y~0)) (* 5 (* c_main_~y~0 c_main_~y~0 c_main_~y~0 c_main_~y~0)) (* c_main_~y~0 c_main_~y~0 c_main_~y~0 c_main_~y~0 c_main_~y~0) c_main_~x~0 1) (div (+ .cse0 .cse1 .cse2 (- 12) .cse3) (- 12)))))) is different from false [2022-04-14 17:54:06,666 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-14 17:54:06,666 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [363169498] [2022-04-14 17:54:06,666 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-14 17:54:06,666 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [293698901] [2022-04-14 17:54:06,667 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [293698901] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-14 17:54:06,667 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-14 17:54:06,667 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2022-04-14 17:54:06,667 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1188041701] [2022-04-14 17:54:06,667 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2022-04-14 17:54:06,667 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 16 states have (on average 2.125) internal successors, (34), 15 states have internal predecessors, (34), 12 states have call successors, (15), 2 states have call predecessors, (15), 2 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:54:06,667 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-14 17:54:06,668 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 18 states, 16 states have (on average 2.125) internal successors, (34), 15 states have internal predecessors, (34), 12 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (13), 11 states have call predecessors, (13), 11 states have call successors, (13) [2022-04-14 17:54:06,710 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:54:06,711 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-04-14 17:54:06,711 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-14 17:54:06,711 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-04-14 17:54:06,711 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=426, Unknown=11, NotChecked=42, Total=552 [2022-04-14 17:54:06,711 INFO L87 Difference]: Start difference. First operand 54 states and 63 transitions. Second operand has 18 states, 16 states have (on average 2.125) internal successors, (34), 15 states have internal predecessors, (34), 12 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (13), 11 states have call predecessors, (13), 11 states have call successors, (13) [2022-04-14 17:54:09,957 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 17:54:09,957 INFO L93 Difference]: Finished difference Result 63 states and 74 transitions. [2022-04-14 17:54:09,957 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-04-14 17:54:09,957 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 16 states have (on average 2.125) internal successors, (34), 15 states have internal predecessors, (34), 12 states have call successors, (15), 2 states have call predecessors, (15), 2 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:54:09,957 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-14 17:54:09,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 16 states have (on average 2.125) internal successors, (34), 15 states have internal predecessors, (34), 12 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (13), 11 states have call predecessors, (13), 11 states have call successors, (13) [2022-04-14 17:54:09,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 70 transitions. [2022-04-14 17:54:09,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 16 states have (on average 2.125) internal successors, (34), 15 states have internal predecessors, (34), 12 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (13), 11 states have call predecessors, (13), 11 states have call successors, (13) [2022-04-14 17:54:09,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 70 transitions. [2022-04-14 17:54:09,961 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 17 states and 70 transitions. [2022-04-14 17:54:10,013 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:54:10,014 INFO L225 Difference]: With dead ends: 63 [2022-04-14 17:54:10,014 INFO L226 Difference]: Without dead ends: 57 [2022-04-14 17:54:10,015 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 83 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 43.3s TimeCoverageRelationStatistics Valid=94, Invalid=548, Unknown=12, NotChecked=48, Total=702 [2022-04-14 17:54:10,015 INFO L913 BasicCegarLoop]: 37 mSDtfsCounter, 7 mSDsluCounter, 346 mSDsCounter, 0 mSdLazyCounter, 570 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 383 SdHoareTripleChecker+Invalid, 574 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 570 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-04-14 17:54:10,015 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [8 Valid, 383 Invalid, 574 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 570 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-04-14 17:54:10,016 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2022-04-14 17:54:10,041 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2022-04-14 17:54:10,041 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-14 17:54:10,041 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:54:10,041 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:54:10,041 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:54:10,042 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 17:54:10,043 INFO L93 Difference]: Finished difference Result 57 states and 67 transitions. [2022-04-14 17:54:10,043 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 67 transitions. [2022-04-14 17:54:10,043 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 17:54:10,043 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 17:54:10,043 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:54:10,043 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:54:10,044 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 17:54:10,044 INFO L93 Difference]: Finished difference Result 57 states and 67 transitions. [2022-04-14 17:54:10,044 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 67 transitions. [2022-04-14 17:54:10,045 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 17:54:10,045 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 17:54:10,045 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-14 17:54:10,045 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-14 17:54:10,045 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:54:10,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 67 transitions. [2022-04-14 17:54:10,046 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 67 transitions. Word has length 89 [2022-04-14 17:54:10,046 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-14 17:54:10,046 INFO L478 AbstractCegarLoop]: Abstraction has 57 states and 67 transitions. [2022-04-14 17:54:10,047 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 16 states have (on average 2.125) internal successors, (34), 15 states have internal predecessors, (34), 12 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (13), 11 states have call predecessors, (13), 11 states have call successors, (13) [2022-04-14 17:54:10,047 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 67 transitions. [2022-04-14 17:54:10,047 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2022-04-14 17:54:10,047 INFO L491 BasicCegarLoop]: Found error trace [2022-04-14 17:54:10,047 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:54:10,056 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:54:10,252 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:54:10,252 INFO L403 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-14 17:54:10,253 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-14 17:54:10,253 INFO L85 PathProgramCache]: Analyzing trace with hash 711483229, now seen corresponding path program 9 times [2022-04-14 17:54:10,253 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-14 17:54:10,253 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [384497735] [2022-04-14 17:54:10,253 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 17:54:10,253 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-14 17:54:10,264 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-14 17:54:10,264 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1321133455] [2022-04-14 17:54:10,264 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-04-14 17:54:10,264 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-14 17:54:10,264 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-14 17:54:10,265 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:54:10,279 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process