/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/ps4-ll_valuebound5.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-fb4f59a-m [2022-04-27 14:38:13,052 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-27 14:38:13,053 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-27 14:38:13,089 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-27 14:38:13,089 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-27 14:38:13,090 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-27 14:38:13,091 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-27 14:38:13,092 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-27 14:38:13,093 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-27 14:38:13,093 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-27 14:38:13,094 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-27 14:38:13,094 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-27 14:38:13,095 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-27 14:38:13,095 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-27 14:38:13,096 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-27 14:38:13,096 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-27 14:38:13,097 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-27 14:38:13,101 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-27 14:38:13,102 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-27 14:38:13,103 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-27 14:38:13,103 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-27 14:38:13,107 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-27 14:38:13,108 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-27 14:38:13,108 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-27 14:38:13,109 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-27 14:38:13,110 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-27 14:38:13,110 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-27 14:38:13,111 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-27 14:38:13,111 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-27 14:38:13,111 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-27 14:38:13,112 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-27 14:38:13,112 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-27 14:38:13,113 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-27 14:38:13,113 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-27 14:38:13,113 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-27 14:38:13,114 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-27 14:38:13,114 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-27 14:38:13,114 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-27 14:38:13,115 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-27 14:38:13,115 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-27 14:38:13,120 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-27 14:38:13,121 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-27 14:38:13,122 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-27 14:38:13,146 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-27 14:38:13,146 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-27 14:38:13,146 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-04-27 14:38:13,147 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-04-27 14:38:13,150 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-04-27 14:38:13,150 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-04-27 14:38:13,150 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-04-27 14:38:13,150 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-04-27 14:38:13,150 INFO L138 SettingsManager]: * Use SBE=true [2022-04-27 14:38:13,151 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-27 14:38:13,151 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-27 14:38:13,151 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-27 14:38:13,151 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-27 14:38:13,151 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-27 14:38:13,151 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-27 14:38:13,151 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-27 14:38:13,151 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-27 14:38:13,152 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-27 14:38:13,152 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-27 14:38:13,152 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-27 14:38:13,152 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-27 14:38:13,152 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-27 14:38:13,152 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-27 14:38:13,152 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-27 14:38:13,152 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-27 14:38:13,152 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-27 14:38:13,153 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-04-27 14:38:13,153 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-04-27 14:38:13,153 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-04-27 14:38:13,153 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-04-27 14:38:13,153 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-04-27 14:38:13,153 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-04-27 14:38:13,153 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-27 14:38:13,153 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-27 14:38:13,338 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-27 14:38:13,354 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-27 14:38:13,355 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-27 14:38:13,356 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-27 14:38:13,356 INFO L275 PluginConnector]: CDTParser initialized [2022-04-27 14:38:13,357 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/nla-digbench-scaling/ps4-ll_valuebound5.c [2022-04-27 14:38:13,428 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ab1958831/82d483b30fb14e2fb5b6f20994a722af/FLAG2c6c6da62 [2022-04-27 14:38:13,745 INFO L306 CDTParser]: Found 1 translation units. [2022-04-27 14:38:13,746 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/ps4-ll_valuebound5.c [2022-04-27 14:38:13,750 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ab1958831/82d483b30fb14e2fb5b6f20994a722af/FLAG2c6c6da62 [2022-04-27 14:38:13,758 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ab1958831/82d483b30fb14e2fb5b6f20994a722af [2022-04-27 14:38:13,760 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-27 14:38:13,761 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-27 14:38:13,761 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-27 14:38:13,761 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-27 14:38:13,763 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-27 14:38:13,764 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.04 02:38:13" (1/1) ... [2022-04-27 14:38:13,765 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@189a8559 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 02:38:13, skipping insertion in model container [2022-04-27 14:38:13,765 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.04 02:38:13" (1/1) ... [2022-04-27 14:38:13,769 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-27 14:38:13,778 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-27 14:38:13,882 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/ps4-ll_valuebound5.c[458,471] [2022-04-27 14:38:13,900 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-27 14:38:13,905 INFO L203 MainTranslator]: Completed pre-run [2022-04-27 14:38:13,915 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/ps4-ll_valuebound5.c[458,471] [2022-04-27 14:38:13,919 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-27 14:38:13,927 INFO L208 MainTranslator]: Completed translation [2022-04-27 14:38:13,927 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 02:38:13 WrapperNode [2022-04-27 14:38:13,927 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-27 14:38:13,928 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-27 14:38:13,928 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-27 14:38:13,928 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-27 14:38:13,934 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 02:38:13" (1/1) ... [2022-04-27 14:38:13,934 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 02:38:13" (1/1) ... [2022-04-27 14:38:13,938 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 02:38:13" (1/1) ... [2022-04-27 14:38:13,938 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 02:38:13" (1/1) ... [2022-04-27 14:38:13,948 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 02:38:13" (1/1) ... [2022-04-27 14:38:13,951 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 02:38:13" (1/1) ... [2022-04-27 14:38:13,952 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 02:38:13" (1/1) ... [2022-04-27 14:38:13,956 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-27 14:38:13,957 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-27 14:38:13,957 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-27 14:38:13,957 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-27 14:38:13,958 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 02:38:13" (1/1) ... [2022-04-27 14:38:13,962 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-27 14:38:13,968 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 14:38:13,976 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-27 14:38:13,994 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-27 14:38:14,003 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-27 14:38:14,003 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-27 14:38:14,003 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-27 14:38:14,004 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-27 14:38:14,004 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-27 14:38:14,004 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-27 14:38:14,005 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-27 14:38:14,005 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-27 14:38:14,005 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-27 14:38:14,005 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-27 14:38:14,005 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_short [2022-04-27 14:38:14,005 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-27 14:38:14,005 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-27 14:38:14,005 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-27 14:38:14,005 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-27 14:38:14,005 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-27 14:38:14,005 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-27 14:38:14,005 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-27 14:38:14,005 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-27 14:38:14,005 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-27 14:38:14,051 INFO L234 CfgBuilder]: Building ICFG [2022-04-27 14:38:14,052 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-27 14:38:14,183 INFO L275 CfgBuilder]: Performing block encoding [2022-04-27 14:38:14,188 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-27 14:38:14,188 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-27 14:38:14,189 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.04 02:38:14 BoogieIcfgContainer [2022-04-27 14:38:14,189 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-27 14:38:14,190 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-27 14:38:14,191 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-27 14:38:14,201 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-27 14:38:14,201 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.04 02:38:13" (1/3) ... [2022-04-27 14:38:14,202 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7eb8de8b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.04 02:38:14, skipping insertion in model container [2022-04-27 14:38:14,202 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 02:38:13" (2/3) ... [2022-04-27 14:38:14,202 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7eb8de8b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.04 02:38:14, skipping insertion in model container [2022-04-27 14:38:14,202 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.04 02:38:14" (3/3) ... [2022-04-27 14:38:14,203 INFO L111 eAbstractionObserver]: Analyzing ICFG ps4-ll_valuebound5.c [2022-04-27 14:38:14,214 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-04-27 14:38:14,214 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-27 14:38:14,281 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-27 14:38:14,287 INFO L357 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, mPorIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@2d990ec2, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@7d949890 [2022-04-27 14:38:14,288 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-27 14:38:14,316 INFO L276 IsEmpty]: Start isEmpty. Operand has 28 states, 16 states have (on average 1.375) internal successors, (22), 17 states have internal predecessors, (22), 6 states have call successors, (6), 4 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-27 14:38:14,323 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-04-27 14:38:14,323 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 14:38:14,324 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 14:38:14,324 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 14:38:14,336 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 14:38:14,336 INFO L85 PathProgramCache]: Analyzing trace with hash -630235283, now seen corresponding path program 1 times [2022-04-27 14:38:14,345 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 14:38:14,346 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1179513617] [2022-04-27 14:38:14,346 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 14:38:14,347 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 14:38:14,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 14:38:14,457 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 14:38:14,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 14:38:14,470 INFO L290 TraceCheckUtils]: 0: Hoare triple {40#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3); {31#true} is VALID [2022-04-27 14:38:14,470 INFO L290 TraceCheckUtils]: 1: Hoare triple {31#true} assume true; {31#true} is VALID [2022-04-27 14:38:14,470 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {31#true} {31#true} #60#return; {31#true} is VALID [2022-04-27 14:38:14,471 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-27 14:38:14,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 14:38:14,476 INFO L290 TraceCheckUtils]: 0: Hoare triple {31#true} ~cond := #in~cond; {31#true} is VALID [2022-04-27 14:38:14,477 INFO L290 TraceCheckUtils]: 1: Hoare triple {31#true} assume 0 == ~cond;assume false; {32#false} is VALID [2022-04-27 14:38:14,477 INFO L290 TraceCheckUtils]: 2: Hoare triple {32#false} assume true; {32#false} is VALID [2022-04-27 14:38:14,477 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {32#false} {31#true} #52#return; {32#false} is VALID [2022-04-27 14:38:14,478 INFO L272 TraceCheckUtils]: 0: Hoare triple {31#true} call ULTIMATE.init(); {40#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 14:38:14,478 INFO L290 TraceCheckUtils]: 1: Hoare triple {40#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3); {31#true} is VALID [2022-04-27 14:38:14,478 INFO L290 TraceCheckUtils]: 2: Hoare triple {31#true} assume true; {31#true} is VALID [2022-04-27 14:38:14,479 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {31#true} {31#true} #60#return; {31#true} is VALID [2022-04-27 14:38:14,479 INFO L272 TraceCheckUtils]: 4: Hoare triple {31#true} call #t~ret5 := main(); {31#true} is VALID [2022-04-27 14:38:14,479 INFO L290 TraceCheckUtils]: 5: Hoare triple {31#true} havoc ~k~0;havoc ~y~0;havoc ~x~0;havoc ~c~0;assume -32768 <= #t~nondet4 && #t~nondet4 <= 32767;~k~0 := #t~nondet4;havoc #t~nondet4; {31#true} is VALID [2022-04-27 14:38:14,479 INFO L272 TraceCheckUtils]: 6: Hoare triple {31#true} call assume_abort_if_not((if ~k~0 >= 0 && ~k~0 <= 5 then 1 else 0)); {31#true} is VALID [2022-04-27 14:38:14,479 INFO L290 TraceCheckUtils]: 7: Hoare triple {31#true} ~cond := #in~cond; {31#true} is VALID [2022-04-27 14:38:14,480 INFO L290 TraceCheckUtils]: 8: Hoare triple {31#true} assume 0 == ~cond;assume false; {32#false} is VALID [2022-04-27 14:38:14,480 INFO L290 TraceCheckUtils]: 9: Hoare triple {32#false} assume true; {32#false} is VALID [2022-04-27 14:38:14,480 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {32#false} {31#true} #52#return; {32#false} is VALID [2022-04-27 14:38:14,480 INFO L290 TraceCheckUtils]: 11: Hoare triple {32#false} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {32#false} is VALID [2022-04-27 14:38:14,480 INFO L290 TraceCheckUtils]: 12: Hoare triple {32#false} assume false; {32#false} is VALID [2022-04-27 14:38:14,480 INFO L272 TraceCheckUtils]: 13: Hoare triple {32#false} call __VERIFIER_assert((if 0 == ~k~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {32#false} is VALID [2022-04-27 14:38:14,480 INFO L290 TraceCheckUtils]: 14: Hoare triple {32#false} ~cond := #in~cond; {32#false} is VALID [2022-04-27 14:38:14,481 INFO L290 TraceCheckUtils]: 15: Hoare triple {32#false} assume 0 == ~cond; {32#false} is VALID [2022-04-27 14:38:14,481 INFO L290 TraceCheckUtils]: 16: Hoare triple {32#false} assume !false; {32#false} is VALID [2022-04-27 14:38:14,481 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 14:38:14,481 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 14:38:14,482 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1179513617] [2022-04-27 14:38:14,482 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1179513617] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 14:38:14,482 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 14:38:14,482 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-27 14:38:14,483 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1454538738] [2022-04-27 14:38:14,484 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 14:38:14,487 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 17 [2022-04-27 14:38:14,488 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 14:38:14,490 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-27 14:38:14,506 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 17 edges. 17 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 14:38:14,506 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-27 14:38:14,506 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 14:38:14,518 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-27 14:38:14,518 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-27 14:38:14,520 INFO L87 Difference]: Start difference. First operand has 28 states, 16 states have (on average 1.375) internal successors, (22), 17 states have internal predecessors, (22), 6 states have call successors, (6), 4 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-27 14:38:14,632 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:38:14,632 INFO L93 Difference]: Finished difference Result 47 states and 61 transitions. [2022-04-27 14:38:14,632 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-27 14:38:14,632 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 17 [2022-04-27 14:38:14,632 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 14:38:14,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-27 14:38:14,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 61 transitions. [2022-04-27 14:38:14,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-27 14:38:14,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 61 transitions. [2022-04-27 14:38:14,643 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 61 transitions. [2022-04-27 14:38:14,701 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 61 edges. 61 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 14:38:14,707 INFO L225 Difference]: With dead ends: 47 [2022-04-27 14:38:14,707 INFO L226 Difference]: Without dead ends: 23 [2022-04-27 14:38:14,709 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-27 14:38:14,711 INFO L413 NwaCegarLoop]: 26 mSDtfsCounter, 15 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 29 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 14:38:14,712 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 29 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 14:38:14,722 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2022-04-27 14:38:14,730 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2022-04-27 14:38:14,730 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 14:38:14,731 INFO L82 GeneralOperation]: Start isEquivalent. First operand 23 states. Second operand has 23 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 14 states have internal predecessors, (15), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-27 14:38:14,731 INFO L74 IsIncluded]: Start isIncluded. First operand 23 states. Second operand has 23 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 14 states have internal predecessors, (15), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-27 14:38:14,732 INFO L87 Difference]: Start difference. First operand 23 states. Second operand has 23 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 14 states have internal predecessors, (15), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-27 14:38:14,735 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:38:14,735 INFO L93 Difference]: Finished difference Result 23 states and 25 transitions. [2022-04-27 14:38:14,735 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 25 transitions. [2022-04-27 14:38:14,735 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:38:14,736 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 14:38:14,736 INFO L74 IsIncluded]: Start isIncluded. First operand has 23 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 14 states have internal predecessors, (15), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand 23 states. [2022-04-27 14:38:14,736 INFO L87 Difference]: Start difference. First operand has 23 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 14 states have internal predecessors, (15), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand 23 states. [2022-04-27 14:38:14,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:38:14,738 INFO L93 Difference]: Finished difference Result 23 states and 25 transitions. [2022-04-27 14:38:14,738 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 25 transitions. [2022-04-27 14:38:14,739 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:38:14,739 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 14:38:14,739 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 14:38:14,739 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 14:38:14,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 14 states have internal predecessors, (15), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-27 14:38:14,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 25 transitions. [2022-04-27 14:38:14,742 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 25 transitions. Word has length 17 [2022-04-27 14:38:14,742 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 14:38:14,742 INFO L495 AbstractCegarLoop]: Abstraction has 23 states and 25 transitions. [2022-04-27 14:38:14,742 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-27 14:38:14,742 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 25 transitions. [2022-04-27 14:38:14,743 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-04-27 14:38:14,743 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 14:38:14,743 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 14:38:14,743 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-27 14:38:14,743 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 14:38:14,744 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 14:38:14,744 INFO L85 PathProgramCache]: Analyzing trace with hash 51610547, now seen corresponding path program 1 times [2022-04-27 14:38:14,744 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 14:38:14,744 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [237674372] [2022-04-27 14:38:14,745 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 14:38:14,745 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 14:38:14,758 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 14:38:14,759 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1461187136] [2022-04-27 14:38:14,759 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 14:38:14,759 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 14:38:14,759 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 14:38:14,760 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-27 14:38:14,780 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-27 14:38:14,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 14:38:14,804 INFO L263 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-27 14:38:14,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 14:38:14,814 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 14:38:14,955 INFO L272 TraceCheckUtils]: 0: Hoare triple {186#true} call ULTIMATE.init(); {186#true} is VALID [2022-04-27 14:38:14,956 INFO L290 TraceCheckUtils]: 1: Hoare triple {186#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); {186#true} is VALID [2022-04-27 14:38:14,956 INFO L290 TraceCheckUtils]: 2: Hoare triple {186#true} assume true; {186#true} is VALID [2022-04-27 14:38:14,956 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {186#true} {186#true} #60#return; {186#true} is VALID [2022-04-27 14:38:14,956 INFO L272 TraceCheckUtils]: 4: Hoare triple {186#true} call #t~ret5 := main(); {186#true} is VALID [2022-04-27 14:38:14,956 INFO L290 TraceCheckUtils]: 5: Hoare triple {186#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; {186#true} is VALID [2022-04-27 14:38:14,957 INFO L272 TraceCheckUtils]: 6: Hoare triple {186#true} call assume_abort_if_not((if ~k~0 >= 0 && ~k~0 <= 5 then 1 else 0)); {186#true} is VALID [2022-04-27 14:38:14,957 INFO L290 TraceCheckUtils]: 7: Hoare triple {186#true} ~cond := #in~cond; {186#true} is VALID [2022-04-27 14:38:14,957 INFO L290 TraceCheckUtils]: 8: Hoare triple {186#true} assume !(0 == ~cond); {186#true} is VALID [2022-04-27 14:38:14,958 INFO L290 TraceCheckUtils]: 9: Hoare triple {186#true} assume true; {186#true} is VALID [2022-04-27 14:38:14,958 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {186#true} {186#true} #52#return; {186#true} is VALID [2022-04-27 14:38:14,958 INFO L290 TraceCheckUtils]: 11: Hoare triple {186#true} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {224#(and (= main_~x~0 0) (= main_~y~0 0))} is VALID [2022-04-27 14:38:14,959 INFO L290 TraceCheckUtils]: 12: Hoare triple {224#(and (= main_~x~0 0) (= main_~y~0 0))} assume !false; {224#(and (= main_~x~0 0) (= main_~y~0 0))} is VALID [2022-04-27 14:38:14,960 INFO L272 TraceCheckUtils]: 13: Hoare triple {224#(and (= main_~x~0 0) (= main_~y~0 0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {231#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 14:38:14,961 INFO L290 TraceCheckUtils]: 14: Hoare triple {231#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {235#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 14:38:14,961 INFO L290 TraceCheckUtils]: 15: Hoare triple {235#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {187#false} is VALID [2022-04-27 14:38:14,961 INFO L290 TraceCheckUtils]: 16: Hoare triple {187#false} assume !false; {187#false} is VALID [2022-04-27 14:38:14,962 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 14:38:14,962 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-27 14:38:14,962 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 14:38:14,962 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [237674372] [2022-04-27 14:38:14,963 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 14:38:14,963 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1461187136] [2022-04-27 14:38:14,966 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1461187136] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 14:38:14,966 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 14:38:14,966 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-27 14:38:14,967 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1660376331] [2022-04-27 14:38:14,967 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 14:38:14,969 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 17 [2022-04-27 14:38:14,969 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 14:38:14,969 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-27 14:38:14,982 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 17 edges. 17 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 14:38:14,982 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-27 14:38:14,983 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 14:38:14,984 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-27 14:38:14,984 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-27 14:38:14,985 INFO L87 Difference]: Start difference. First operand 23 states and 25 transitions. Second operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-27 14:38:15,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:38:15,245 INFO L93 Difference]: Finished difference Result 34 states and 38 transitions. [2022-04-27 14:38:15,245 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-27 14:38:15,245 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 17 [2022-04-27 14:38:15,246 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 14:38:15,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-27 14:38:15,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 38 transitions. [2022-04-27 14:38:15,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-27 14:38:15,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 38 transitions. [2022-04-27 14:38:15,253 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 38 transitions. [2022-04-27 14:38:15,296 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 38 edges. 38 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 14:38:15,298 INFO L225 Difference]: With dead ends: 34 [2022-04-27 14:38:15,298 INFO L226 Difference]: Without dead ends: 30 [2022-04-27 14:38:15,298 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-27 14:38:15,299 INFO L413 NwaCegarLoop]: 22 mSDtfsCounter, 6 mSDsluCounter, 55 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 77 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 14:38:15,299 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 77 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 14:38:15,300 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2022-04-27 14:38:15,303 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2022-04-27 14:38:15,303 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 14:38:15,304 INFO L82 GeneralOperation]: Start isEquivalent. First operand 30 states. Second operand has 30 states, 18 states have (on average 1.1111111111111112) internal successors, (20), 19 states have internal predecessors, (20), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-27 14:38:15,304 INFO L74 IsIncluded]: Start isIncluded. First operand 30 states. Second operand has 30 states, 18 states have (on average 1.1111111111111112) internal successors, (20), 19 states have internal predecessors, (20), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-27 14:38:15,304 INFO L87 Difference]: Start difference. First operand 30 states. Second operand has 30 states, 18 states have (on average 1.1111111111111112) internal successors, (20), 19 states have internal predecessors, (20), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-27 14:38:15,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:38:15,306 INFO L93 Difference]: Finished difference Result 30 states and 32 transitions. [2022-04-27 14:38:15,306 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 32 transitions. [2022-04-27 14:38:15,307 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:38:15,307 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 14:38:15,307 INFO L74 IsIncluded]: Start isIncluded. First operand has 30 states, 18 states have (on average 1.1111111111111112) internal successors, (20), 19 states have internal predecessors, (20), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand 30 states. [2022-04-27 14:38:15,307 INFO L87 Difference]: Start difference. First operand has 30 states, 18 states have (on average 1.1111111111111112) internal successors, (20), 19 states have internal predecessors, (20), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand 30 states. [2022-04-27 14:38:15,309 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:38:15,309 INFO L93 Difference]: Finished difference Result 30 states and 32 transitions. [2022-04-27 14:38:15,309 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 32 transitions. [2022-04-27 14:38:15,309 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:38:15,309 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 14:38:15,310 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 14:38:15,310 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 14:38:15,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 18 states have (on average 1.1111111111111112) internal successors, (20), 19 states have internal predecessors, (20), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-27 14:38:15,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 32 transitions. [2022-04-27 14:38:15,311 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 32 transitions. Word has length 17 [2022-04-27 14:38:15,311 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 14:38:15,312 INFO L495 AbstractCegarLoop]: Abstraction has 30 states and 32 transitions. [2022-04-27 14:38:15,312 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-27 14:38:15,312 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 32 transitions. [2022-04-27 14:38:15,312 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-04-27 14:38:15,312 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 14:38:15,312 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 14:38:15,331 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-04-27 14:38:15,525 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 14:38:15,526 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 14:38:15,527 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 14:38:15,527 INFO L85 PathProgramCache]: Analyzing trace with hash 311787922, now seen corresponding path program 1 times [2022-04-27 14:38:15,527 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 14:38:15,528 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1624528780] [2022-04-27 14:38:15,528 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 14:38:15,528 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 14:38:15,548 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 14:38:15,549 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2063603538] [2022-04-27 14:38:15,549 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 14:38:15,549 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 14:38:15,549 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 14:38:15,563 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-27 14:38:15,566 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-27 14:38:15,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 14:38:15,603 INFO L263 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 11 conjunts are in the unsatisfiable core [2022-04-27 14:38:15,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 14:38:15,613 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 14:38:15,797 INFO L272 TraceCheckUtils]: 0: Hoare triple {397#true} call ULTIMATE.init(); {397#true} is VALID [2022-04-27 14:38:15,797 INFO L290 TraceCheckUtils]: 1: Hoare triple {397#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); {397#true} is VALID [2022-04-27 14:38:15,797 INFO L290 TraceCheckUtils]: 2: Hoare triple {397#true} assume true; {397#true} is VALID [2022-04-27 14:38:15,798 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {397#true} {397#true} #60#return; {397#true} is VALID [2022-04-27 14:38:15,798 INFO L272 TraceCheckUtils]: 4: Hoare triple {397#true} call #t~ret5 := main(); {397#true} is VALID [2022-04-27 14:38:15,798 INFO L290 TraceCheckUtils]: 5: Hoare triple {397#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; {397#true} is VALID [2022-04-27 14:38:15,798 INFO L272 TraceCheckUtils]: 6: Hoare triple {397#true} call assume_abort_if_not((if ~k~0 >= 0 && ~k~0 <= 5 then 1 else 0)); {397#true} is VALID [2022-04-27 14:38:15,801 INFO L290 TraceCheckUtils]: 7: Hoare triple {397#true} ~cond := #in~cond; {397#true} is VALID [2022-04-27 14:38:15,802 INFO L290 TraceCheckUtils]: 8: Hoare triple {397#true} assume !(0 == ~cond); {397#true} is VALID [2022-04-27 14:38:15,802 INFO L290 TraceCheckUtils]: 9: Hoare triple {397#true} assume true; {397#true} is VALID [2022-04-27 14:38:15,802 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {397#true} {397#true} #52#return; {397#true} is VALID [2022-04-27 14:38:15,803 INFO L290 TraceCheckUtils]: 11: Hoare triple {397#true} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {435#(and (= main_~x~0 0) (= main_~y~0 0))} is VALID [2022-04-27 14:38:15,803 INFO L290 TraceCheckUtils]: 12: Hoare triple {435#(and (= main_~x~0 0) (= main_~y~0 0))} assume !false; {435#(and (= main_~x~0 0) (= main_~y~0 0))} is VALID [2022-04-27 14:38:15,803 INFO L272 TraceCheckUtils]: 13: Hoare triple {435#(and (= main_~x~0 0) (= main_~y~0 0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {397#true} is VALID [2022-04-27 14:38:15,804 INFO L290 TraceCheckUtils]: 14: Hoare triple {397#true} ~cond := #in~cond; {397#true} is VALID [2022-04-27 14:38:15,804 INFO L290 TraceCheckUtils]: 15: Hoare triple {397#true} assume !(0 == ~cond); {397#true} is VALID [2022-04-27 14:38:15,804 INFO L290 TraceCheckUtils]: 16: Hoare triple {397#true} assume true; {397#true} is VALID [2022-04-27 14:38:15,805 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {397#true} {435#(and (= main_~x~0 0) (= main_~y~0 0))} #54#return; {435#(and (= main_~x~0 0) (= main_~y~0 0))} is VALID [2022-04-27 14:38:15,805 INFO L290 TraceCheckUtils]: 18: Hoare triple {435#(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 + ~x~0; {457#(and (= (+ (- 1) main_~y~0) 0) (= (* main_~y~0 (* main_~y~0 main_~y~0)) main_~x~0))} is VALID [2022-04-27 14:38:15,806 INFO L290 TraceCheckUtils]: 19: Hoare triple {457#(and (= (+ (- 1) main_~y~0) 0) (= (* main_~y~0 (* main_~y~0 main_~y~0)) main_~x~0))} assume !false; {457#(and (= (+ (- 1) main_~y~0) 0) (= (* main_~y~0 (* main_~y~0 main_~y~0)) main_~x~0))} is VALID [2022-04-27 14:38:15,806 INFO L272 TraceCheckUtils]: 20: Hoare triple {457#(and (= (+ (- 1) main_~y~0) 0) (= (* main_~y~0 (* main_~y~0 main_~y~0)) main_~x~0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {464#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 14:38:15,807 INFO L290 TraceCheckUtils]: 21: Hoare triple {464#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {468#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 14:38:15,808 INFO L290 TraceCheckUtils]: 22: Hoare triple {468#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {398#false} is VALID [2022-04-27 14:38:15,808 INFO L290 TraceCheckUtils]: 23: Hoare triple {398#false} assume !false; {398#false} is VALID [2022-04-27 14:38:15,808 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 14:38:15,809 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 14:38:16,147 INFO L290 TraceCheckUtils]: 23: Hoare triple {398#false} assume !false; {398#false} is VALID [2022-04-27 14:38:16,148 INFO L290 TraceCheckUtils]: 22: Hoare triple {468#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {398#false} is VALID [2022-04-27 14:38:16,148 INFO L290 TraceCheckUtils]: 21: Hoare triple {464#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {468#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 14:38:16,149 INFO L272 TraceCheckUtils]: 20: Hoare triple {484#(= (+ (* main_~y~0 main_~y~0 main_~y~0 main_~y~0) (* main_~y~0 main_~y~0) (* (* main_~y~0 main_~y~0 main_~y~0) 2)) (* main_~x~0 4))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {464#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 14:38:16,149 INFO L290 TraceCheckUtils]: 19: Hoare triple {484#(= (+ (* main_~y~0 main_~y~0 main_~y~0 main_~y~0) (* main_~y~0 main_~y~0) (* (* main_~y~0 main_~y~0 main_~y~0) 2)) (* main_~x~0 4))} assume !false; {484#(= (+ (* main_~y~0 main_~y~0 main_~y~0 main_~y~0) (* main_~y~0 main_~y~0) (* (* main_~y~0 main_~y~0 main_~y~0) 2)) (* main_~x~0 4))} is VALID [2022-04-27 14:38:16,400 INFO L290 TraceCheckUtils]: 18: Hoare triple {484#(= (+ (* main_~y~0 main_~y~0 main_~y~0 main_~y~0) (* main_~y~0 main_~y~0) (* (* main_~y~0 main_~y~0 main_~y~0) 2)) (* main_~x~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 + ~x~0; {484#(= (+ (* main_~y~0 main_~y~0 main_~y~0 main_~y~0) (* main_~y~0 main_~y~0) (* (* main_~y~0 main_~y~0 main_~y~0) 2)) (* main_~x~0 4))} is VALID [2022-04-27 14:38:16,401 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {397#true} {484#(= (+ (* main_~y~0 main_~y~0 main_~y~0 main_~y~0) (* main_~y~0 main_~y~0) (* (* main_~y~0 main_~y~0 main_~y~0) 2)) (* main_~x~0 4))} #54#return; {484#(= (+ (* main_~y~0 main_~y~0 main_~y~0 main_~y~0) (* main_~y~0 main_~y~0) (* (* main_~y~0 main_~y~0 main_~y~0) 2)) (* main_~x~0 4))} is VALID [2022-04-27 14:38:16,401 INFO L290 TraceCheckUtils]: 16: Hoare triple {397#true} assume true; {397#true} is VALID [2022-04-27 14:38:16,401 INFO L290 TraceCheckUtils]: 15: Hoare triple {397#true} assume !(0 == ~cond); {397#true} is VALID [2022-04-27 14:38:16,401 INFO L290 TraceCheckUtils]: 14: Hoare triple {397#true} ~cond := #in~cond; {397#true} is VALID [2022-04-27 14:38:16,401 INFO L272 TraceCheckUtils]: 13: Hoare triple {484#(= (+ (* main_~y~0 main_~y~0 main_~y~0 main_~y~0) (* main_~y~0 main_~y~0) (* (* main_~y~0 main_~y~0 main_~y~0) 2)) (* main_~x~0 4))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {397#true} is VALID [2022-04-27 14:38:16,402 INFO L290 TraceCheckUtils]: 12: Hoare triple {484#(= (+ (* main_~y~0 main_~y~0 main_~y~0 main_~y~0) (* main_~y~0 main_~y~0) (* (* main_~y~0 main_~y~0 main_~y~0) 2)) (* main_~x~0 4))} assume !false; {484#(= (+ (* main_~y~0 main_~y~0 main_~y~0 main_~y~0) (* main_~y~0 main_~y~0) (* (* main_~y~0 main_~y~0 main_~y~0) 2)) (* main_~x~0 4))} is VALID [2022-04-27 14:38:16,402 INFO L290 TraceCheckUtils]: 11: Hoare triple {397#true} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {484#(= (+ (* main_~y~0 main_~y~0 main_~y~0 main_~y~0) (* main_~y~0 main_~y~0) (* (* main_~y~0 main_~y~0 main_~y~0) 2)) (* main_~x~0 4))} is VALID [2022-04-27 14:38:16,402 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {397#true} {397#true} #52#return; {397#true} is VALID [2022-04-27 14:38:16,402 INFO L290 TraceCheckUtils]: 9: Hoare triple {397#true} assume true; {397#true} is VALID [2022-04-27 14:38:16,402 INFO L290 TraceCheckUtils]: 8: Hoare triple {397#true} assume !(0 == ~cond); {397#true} is VALID [2022-04-27 14:38:16,403 INFO L290 TraceCheckUtils]: 7: Hoare triple {397#true} ~cond := #in~cond; {397#true} is VALID [2022-04-27 14:38:16,403 INFO L272 TraceCheckUtils]: 6: Hoare triple {397#true} call assume_abort_if_not((if ~k~0 >= 0 && ~k~0 <= 5 then 1 else 0)); {397#true} is VALID [2022-04-27 14:38:16,403 INFO L290 TraceCheckUtils]: 5: Hoare triple {397#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; {397#true} is VALID [2022-04-27 14:38:16,403 INFO L272 TraceCheckUtils]: 4: Hoare triple {397#true} call #t~ret5 := main(); {397#true} is VALID [2022-04-27 14:38:16,403 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {397#true} {397#true} #60#return; {397#true} is VALID [2022-04-27 14:38:16,403 INFO L290 TraceCheckUtils]: 2: Hoare triple {397#true} assume true; {397#true} is VALID [2022-04-27 14:38:16,403 INFO L290 TraceCheckUtils]: 1: Hoare triple {397#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); {397#true} is VALID [2022-04-27 14:38:16,403 INFO L272 TraceCheckUtils]: 0: Hoare triple {397#true} call ULTIMATE.init(); {397#true} is VALID [2022-04-27 14:38:16,404 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-27 14:38:16,404 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 14:38:16,404 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1624528780] [2022-04-27 14:38:16,404 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 14:38:16,404 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2063603538] [2022-04-27 14:38:16,404 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2063603538] provided 1 perfect and 1 imperfect interpolant sequences [2022-04-27 14:38:16,404 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-04-27 14:38:16,404 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 7 [2022-04-27 14:38:16,404 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [233933507] [2022-04-27 14:38:16,405 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 14:38:16,405 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 24 [2022-04-27 14:38:16,405 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 14:38:16,405 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-27 14:38:16,865 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 23 edges. 23 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 14:38:16,865 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-27 14:38:16,865 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 14:38:16,865 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-27 14:38:16,865 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-04-27 14:38:16,866 INFO L87 Difference]: Start difference. First operand 30 states and 32 transitions. Second operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-27 14:38:16,944 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:38:16,944 INFO L93 Difference]: Finished difference Result 36 states and 37 transitions. [2022-04-27 14:38:16,944 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-27 14:38:16,944 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 24 [2022-04-27 14:38:16,944 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 14:38:16,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-27 14:38:16,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 30 transitions. [2022-04-27 14:38:16,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-27 14:38:16,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 30 transitions. [2022-04-27 14:38:16,947 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 30 transitions. [2022-04-27 14:38:17,412 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 30 edges. 30 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 14:38:17,413 INFO L225 Difference]: With dead ends: 36 [2022-04-27 14:38:17,413 INFO L226 Difference]: Without dead ends: 31 [2022-04-27 14:38:17,413 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 40 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-04-27 14:38:17,414 INFO L413 NwaCegarLoop]: 21 mSDtfsCounter, 6 mSDsluCounter, 49 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 70 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 14:38:17,414 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 70 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 14:38:17,414 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2022-04-27 14:38:17,418 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2022-04-27 14:38:17,418 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 14:38:17,418 INFO L82 GeneralOperation]: Start isEquivalent. First operand 31 states. Second operand has 31 states, 20 states have (on average 1.05) internal successors, (21), 20 states have internal predecessors, (21), 6 states have call successors, (6), 6 states have call predecessors, (6), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-27 14:38:17,419 INFO L74 IsIncluded]: Start isIncluded. First operand 31 states. Second operand has 31 states, 20 states have (on average 1.05) internal successors, (21), 20 states have internal predecessors, (21), 6 states have call successors, (6), 6 states have call predecessors, (6), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-27 14:38:17,419 INFO L87 Difference]: Start difference. First operand 31 states. Second operand has 31 states, 20 states have (on average 1.05) internal successors, (21), 20 states have internal predecessors, (21), 6 states have call successors, (6), 6 states have call predecessors, (6), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-27 14:38:17,420 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:38:17,420 INFO L93 Difference]: Finished difference Result 31 states and 31 transitions. [2022-04-27 14:38:17,420 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 31 transitions. [2022-04-27 14:38:17,420 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:38:17,420 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 14:38:17,421 INFO L74 IsIncluded]: Start isIncluded. First operand has 31 states, 20 states have (on average 1.05) internal successors, (21), 20 states have internal predecessors, (21), 6 states have call successors, (6), 6 states have call predecessors, (6), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand 31 states. [2022-04-27 14:38:17,421 INFO L87 Difference]: Start difference. First operand has 31 states, 20 states have (on average 1.05) internal successors, (21), 20 states have internal predecessors, (21), 6 states have call successors, (6), 6 states have call predecessors, (6), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand 31 states. [2022-04-27 14:38:17,422 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:38:17,422 INFO L93 Difference]: Finished difference Result 31 states and 31 transitions. [2022-04-27 14:38:17,422 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 31 transitions. [2022-04-27 14:38:17,422 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:38:17,422 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 14:38:17,423 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 14:38:17,423 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 14:38:17,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 20 states have (on average 1.05) internal successors, (21), 20 states have internal predecessors, (21), 6 states have call successors, (6), 6 states have call predecessors, (6), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-27 14:38:17,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 31 transitions. [2022-04-27 14:38:17,424 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 31 transitions. Word has length 24 [2022-04-27 14:38:17,424 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 14:38:17,424 INFO L495 AbstractCegarLoop]: Abstraction has 31 states and 31 transitions. [2022-04-27 14:38:17,424 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-27 14:38:17,424 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 31 transitions. [2022-04-27 14:38:17,425 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-04-27 14:38:17,425 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 14:38:17,425 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 14:38:17,441 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-04-27 14:38:17,629 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2022-04-27 14:38:17,630 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 14:38:17,630 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 14:38:17,630 INFO L85 PathProgramCache]: Analyzing trace with hash -1417466424, now seen corresponding path program 1 times [2022-04-27 14:38:17,630 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 14:38:17,630 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1509866215] [2022-04-27 14:38:17,631 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 14:38:17,631 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 14:38:17,641 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 14:38:17,641 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1801393340] [2022-04-27 14:38:17,641 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 14:38:17,641 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 14:38:17,642 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 14:38:17,662 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-27 14:38:17,669 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-27 14:38:17,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 14:38:17,699 INFO L263 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 12 conjunts are in the unsatisfiable core [2022-04-27 14:38:17,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 14:38:17,708 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 14:38:17,909 INFO L272 TraceCheckUtils]: 0: Hoare triple {707#true} call ULTIMATE.init(); {707#true} is VALID [2022-04-27 14:38:17,909 INFO L290 TraceCheckUtils]: 1: Hoare triple {707#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); {707#true} is VALID [2022-04-27 14:38:17,909 INFO L290 TraceCheckUtils]: 2: Hoare triple {707#true} assume true; {707#true} is VALID [2022-04-27 14:38:17,909 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {707#true} {707#true} #60#return; {707#true} is VALID [2022-04-27 14:38:17,909 INFO L272 TraceCheckUtils]: 4: Hoare triple {707#true} call #t~ret5 := main(); {707#true} is VALID [2022-04-27 14:38:17,909 INFO L290 TraceCheckUtils]: 5: Hoare triple {707#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; {707#true} is VALID [2022-04-27 14:38:17,910 INFO L272 TraceCheckUtils]: 6: Hoare triple {707#true} call assume_abort_if_not((if ~k~0 >= 0 && ~k~0 <= 5 then 1 else 0)); {707#true} is VALID [2022-04-27 14:38:17,910 INFO L290 TraceCheckUtils]: 7: Hoare triple {707#true} ~cond := #in~cond; {707#true} is VALID [2022-04-27 14:38:17,910 INFO L290 TraceCheckUtils]: 8: Hoare triple {707#true} assume !(0 == ~cond); {707#true} is VALID [2022-04-27 14:38:17,910 INFO L290 TraceCheckUtils]: 9: Hoare triple {707#true} assume true; {707#true} is VALID [2022-04-27 14:38:17,910 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {707#true} {707#true} #52#return; {707#true} is VALID [2022-04-27 14:38:17,910 INFO L290 TraceCheckUtils]: 11: Hoare triple {707#true} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {745#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 14:38:17,911 INFO L290 TraceCheckUtils]: 12: Hoare triple {745#(and (= main_~c~0 0) (= main_~y~0 0))} assume !false; {745#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 14:38:17,911 INFO L272 TraceCheckUtils]: 13: Hoare triple {745#(and (= main_~c~0 0) (= main_~y~0 0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {707#true} is VALID [2022-04-27 14:38:17,911 INFO L290 TraceCheckUtils]: 14: Hoare triple {707#true} ~cond := #in~cond; {707#true} is VALID [2022-04-27 14:38:17,911 INFO L290 TraceCheckUtils]: 15: Hoare triple {707#true} assume !(0 == ~cond); {707#true} is VALID [2022-04-27 14:38:17,911 INFO L290 TraceCheckUtils]: 16: Hoare triple {707#true} assume true; {707#true} is VALID [2022-04-27 14:38:17,912 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {707#true} {745#(and (= main_~c~0 0) (= main_~y~0 0))} #54#return; {745#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 14:38:17,912 INFO L290 TraceCheckUtils]: 18: Hoare triple {745#(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 + ~x~0; {767#(and (= (+ (- 1) main_~y~0) 0) (< 0 main_~k~0) (<= main_~c~0 1))} is VALID [2022-04-27 14:38:17,913 INFO L290 TraceCheckUtils]: 19: Hoare triple {767#(and (= (+ (- 1) main_~y~0) 0) (< 0 main_~k~0) (<= main_~c~0 1))} assume !false; {767#(and (= (+ (- 1) main_~y~0) 0) (< 0 main_~k~0) (<= main_~c~0 1))} is VALID [2022-04-27 14:38:17,913 INFO L272 TraceCheckUtils]: 20: Hoare triple {767#(and (= (+ (- 1) main_~y~0) 0) (< 0 main_~k~0) (<= main_~c~0 1))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {707#true} is VALID [2022-04-27 14:38:17,913 INFO L290 TraceCheckUtils]: 21: Hoare triple {707#true} ~cond := #in~cond; {707#true} is VALID [2022-04-27 14:38:17,913 INFO L290 TraceCheckUtils]: 22: Hoare triple {707#true} assume !(0 == ~cond); {707#true} is VALID [2022-04-27 14:38:17,913 INFO L290 TraceCheckUtils]: 23: Hoare triple {707#true} assume true; {707#true} is VALID [2022-04-27 14:38:17,914 INFO L284 TraceCheckUtils]: 24: Hoare quadruple {707#true} {767#(and (= (+ (- 1) main_~y~0) 0) (< 0 main_~k~0) (<= main_~c~0 1))} #54#return; {767#(and (= (+ (- 1) main_~y~0) 0) (< 0 main_~k~0) (<= main_~c~0 1))} is VALID [2022-04-27 14:38:17,914 INFO L290 TraceCheckUtils]: 25: Hoare triple {767#(and (= (+ (- 1) main_~y~0) 0) (< 0 main_~k~0) (<= main_~c~0 1))} assume !(~c~0 < ~k~0); {789#(and (= (+ (- 1) main_~y~0) 0) (<= main_~k~0 1) (< 0 main_~k~0))} is VALID [2022-04-27 14:38:17,915 INFO L272 TraceCheckUtils]: 26: Hoare triple {789#(and (= (+ (- 1) main_~y~0) 0) (<= main_~k~0 1) (< 0 main_~k~0))} call __VERIFIER_assert((if 0 == ~k~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {793#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 14:38:17,915 INFO L290 TraceCheckUtils]: 27: Hoare triple {793#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {797#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 14:38:17,916 INFO L290 TraceCheckUtils]: 28: Hoare triple {797#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {708#false} is VALID [2022-04-27 14:38:17,916 INFO L290 TraceCheckUtils]: 29: Hoare triple {708#false} assume !false; {708#false} is VALID [2022-04-27 14:38:17,916 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 4 proven. 3 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-27 14:38:17,916 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 14:38:18,185 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 14:38:18,186 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1509866215] [2022-04-27 14:38:18,186 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 14:38:18,186 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1801393340] [2022-04-27 14:38:18,186 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1801393340] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 14:38:18,186 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-27 14:38:18,186 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2022-04-27 14:38:18,186 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [723630219] [2022-04-27 14:38:18,186 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2022-04-27 14:38:18,187 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, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) Word has length 30 [2022-04-27 14:38:18,187 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 14:38:18,187 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, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2022-04-27 14:38:18,207 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 27 edges. 27 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 14:38:18,208 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-27 14:38:18,208 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 14:38:18,208 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-27 14:38:18,208 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2022-04-27 14:38:18,208 INFO L87 Difference]: Start difference. First operand 31 states and 31 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, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2022-04-27 14:38:18,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:38:18,369 INFO L93 Difference]: Finished difference Result 39 states and 40 transitions. [2022-04-27 14:38:18,369 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-27 14:38:18,370 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, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) Word has length 30 [2022-04-27 14:38:18,370 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 14:38:18,370 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, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2022-04-27 14:38:18,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 36 transitions. [2022-04-27 14:38:18,371 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, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2022-04-27 14:38:18,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 36 transitions. [2022-04-27 14:38:18,372 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 36 transitions. [2022-04-27 14:38:18,399 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 36 edges. 36 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 14:38:18,400 INFO L225 Difference]: With dead ends: 39 [2022-04-27 14:38:18,400 INFO L226 Difference]: Without dead ends: 34 [2022-04-27 14:38:18,400 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 33 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-27 14:38:18,401 INFO L413 NwaCegarLoop]: 25 mSDtfsCounter, 2 mSDsluCounter, 90 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 115 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 14:38:18,401 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 115 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 14:38:18,401 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2022-04-27 14:38:18,408 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2022-04-27 14:38:18,408 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 14:38:18,408 INFO L82 GeneralOperation]: Start isEquivalent. First operand 34 states. Second operand has 34 states, 22 states have (on average 1.0454545454545454) internal successors, (23), 22 states have internal predecessors, (23), 7 states have call successors, (7), 6 states have call predecessors, (7), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-27 14:38:18,408 INFO L74 IsIncluded]: Start isIncluded. First operand 34 states. Second operand has 34 states, 22 states have (on average 1.0454545454545454) internal successors, (23), 22 states have internal predecessors, (23), 7 states have call successors, (7), 6 states have call predecessors, (7), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-27 14:38:18,408 INFO L87 Difference]: Start difference. First operand 34 states. Second operand has 34 states, 22 states have (on average 1.0454545454545454) internal successors, (23), 22 states have internal predecessors, (23), 7 states have call successors, (7), 6 states have call predecessors, (7), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-27 14:38:18,410 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:38:18,410 INFO L93 Difference]: Finished difference Result 34 states and 35 transitions. [2022-04-27 14:38:18,410 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 35 transitions. [2022-04-27 14:38:18,410 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:38:18,410 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 14:38:18,410 INFO L74 IsIncluded]: Start isIncluded. First operand has 34 states, 22 states have (on average 1.0454545454545454) internal successors, (23), 22 states have internal predecessors, (23), 7 states have call successors, (7), 6 states have call predecessors, (7), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand 34 states. [2022-04-27 14:38:18,411 INFO L87 Difference]: Start difference. First operand has 34 states, 22 states have (on average 1.0454545454545454) internal successors, (23), 22 states have internal predecessors, (23), 7 states have call successors, (7), 6 states have call predecessors, (7), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand 34 states. [2022-04-27 14:38:18,421 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:38:18,421 INFO L93 Difference]: Finished difference Result 34 states and 35 transitions. [2022-04-27 14:38:18,421 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 35 transitions. [2022-04-27 14:38:18,422 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:38:18,422 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 14:38:18,422 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 14:38:18,422 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 14:38:18,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 22 states have (on average 1.0454545454545454) internal successors, (23), 22 states have internal predecessors, (23), 7 states have call successors, (7), 6 states have call predecessors, (7), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-27 14:38:18,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 35 transitions. [2022-04-27 14:38:18,423 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 35 transitions. Word has length 30 [2022-04-27 14:38:18,423 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 14:38:18,423 INFO L495 AbstractCegarLoop]: Abstraction has 34 states and 35 transitions. [2022-04-27 14:38:18,424 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 states have internal predecessors, (17), 4 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2022-04-27 14:38:18,424 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 35 transitions. [2022-04-27 14:38:18,424 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-04-27 14:38:18,424 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 14:38:18,424 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 14:38:18,443 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-27 14:38:18,639 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 14:38:18,639 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 14:38:18,640 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 14:38:18,640 INFO L85 PathProgramCache]: Analyzing trace with hash -2045316535, now seen corresponding path program 2 times [2022-04-27 14:38:18,640 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 14:38:18,640 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1323505003] [2022-04-27 14:38:18,640 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 14:38:18,640 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 14:38:18,650 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 14:38:18,650 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1567347841] [2022-04-27 14:38:18,650 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-27 14:38:18,651 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 14:38:18,651 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 14:38:18,651 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-27 14:38:18,675 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-27 14:38:18,707 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-27 14:38:18,707 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-27 14:38:18,708 INFO L263 TraceCheckSpWp]: Trace formula consists of 112 conjuncts, 16 conjunts are in the unsatisfiable core [2022-04-27 14:38:18,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 14:38:18,724 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 14:38:18,955 INFO L272 TraceCheckUtils]: 0: Hoare triple {1024#true} call ULTIMATE.init(); {1024#true} is VALID [2022-04-27 14:38:18,955 INFO L290 TraceCheckUtils]: 1: Hoare triple {1024#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); {1024#true} is VALID [2022-04-27 14:38:18,955 INFO L290 TraceCheckUtils]: 2: Hoare triple {1024#true} assume true; {1024#true} is VALID [2022-04-27 14:38:18,955 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1024#true} {1024#true} #60#return; {1024#true} is VALID [2022-04-27 14:38:18,955 INFO L272 TraceCheckUtils]: 4: Hoare triple {1024#true} call #t~ret5 := main(); {1024#true} is VALID [2022-04-27 14:38:18,955 INFO L290 TraceCheckUtils]: 5: Hoare triple {1024#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; {1024#true} is VALID [2022-04-27 14:38:18,955 INFO L272 TraceCheckUtils]: 6: Hoare triple {1024#true} call assume_abort_if_not((if ~k~0 >= 0 && ~k~0 <= 5 then 1 else 0)); {1024#true} is VALID [2022-04-27 14:38:18,956 INFO L290 TraceCheckUtils]: 7: Hoare triple {1024#true} ~cond := #in~cond; {1024#true} is VALID [2022-04-27 14:38:18,956 INFO L290 TraceCheckUtils]: 8: Hoare triple {1024#true} assume !(0 == ~cond); {1024#true} is VALID [2022-04-27 14:38:18,956 INFO L290 TraceCheckUtils]: 9: Hoare triple {1024#true} assume true; {1024#true} is VALID [2022-04-27 14:38:18,956 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1024#true} {1024#true} #52#return; {1024#true} is VALID [2022-04-27 14:38:18,956 INFO L290 TraceCheckUtils]: 11: Hoare triple {1024#true} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {1062#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 14:38:18,957 INFO L290 TraceCheckUtils]: 12: Hoare triple {1062#(and (= main_~c~0 0) (= main_~y~0 0))} assume !false; {1062#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 14:38:18,957 INFO L272 TraceCheckUtils]: 13: Hoare triple {1062#(and (= main_~c~0 0) (= main_~y~0 0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {1024#true} is VALID [2022-04-27 14:38:18,957 INFO L290 TraceCheckUtils]: 14: Hoare triple {1024#true} ~cond := #in~cond; {1024#true} is VALID [2022-04-27 14:38:18,957 INFO L290 TraceCheckUtils]: 15: Hoare triple {1024#true} assume !(0 == ~cond); {1024#true} is VALID [2022-04-27 14:38:18,957 INFO L290 TraceCheckUtils]: 16: Hoare triple {1024#true} assume true; {1024#true} is VALID [2022-04-27 14:38:18,957 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {1024#true} {1062#(and (= main_~c~0 0) (= main_~y~0 0))} #54#return; {1062#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 14:38:18,958 INFO L290 TraceCheckUtils]: 18: Hoare triple {1062#(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 + ~x~0; {1084#(and (= main_~y~0 1) (= main_~c~0 1))} is VALID [2022-04-27 14:38:18,958 INFO L290 TraceCheckUtils]: 19: Hoare triple {1084#(and (= main_~y~0 1) (= main_~c~0 1))} assume !false; {1084#(and (= main_~y~0 1) (= main_~c~0 1))} is VALID [2022-04-27 14:38:18,958 INFO L272 TraceCheckUtils]: 20: Hoare triple {1084#(and (= main_~y~0 1) (= main_~c~0 1))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {1024#true} is VALID [2022-04-27 14:38:18,958 INFO L290 TraceCheckUtils]: 21: Hoare triple {1024#true} ~cond := #in~cond; {1024#true} is VALID [2022-04-27 14:38:18,959 INFO L290 TraceCheckUtils]: 22: Hoare triple {1024#true} assume !(0 == ~cond); {1024#true} is VALID [2022-04-27 14:38:18,959 INFO L290 TraceCheckUtils]: 23: Hoare triple {1024#true} assume true; {1024#true} is VALID [2022-04-27 14:38:18,959 INFO L284 TraceCheckUtils]: 24: Hoare quadruple {1024#true} {1084#(and (= main_~y~0 1) (= main_~c~0 1))} #54#return; {1084#(and (= main_~y~0 1) (= main_~c~0 1))} is VALID [2022-04-27 14:38:18,960 INFO L290 TraceCheckUtils]: 25: Hoare triple {1084#(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 + ~x~0; {1106#(and (< 1 main_~k~0) (= (+ (- 1) main_~y~0) 1) (<= main_~c~0 2))} is VALID [2022-04-27 14:38:18,960 INFO L290 TraceCheckUtils]: 26: Hoare triple {1106#(and (< 1 main_~k~0) (= (+ (- 1) main_~y~0) 1) (<= main_~c~0 2))} assume !false; {1106#(and (< 1 main_~k~0) (= (+ (- 1) main_~y~0) 1) (<= main_~c~0 2))} is VALID [2022-04-27 14:38:18,960 INFO L272 TraceCheckUtils]: 27: Hoare triple {1106#(and (< 1 main_~k~0) (= (+ (- 1) main_~y~0) 1) (<= main_~c~0 2))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {1024#true} is VALID [2022-04-27 14:38:18,960 INFO L290 TraceCheckUtils]: 28: Hoare triple {1024#true} ~cond := #in~cond; {1024#true} is VALID [2022-04-27 14:38:18,960 INFO L290 TraceCheckUtils]: 29: Hoare triple {1024#true} assume !(0 == ~cond); {1024#true} is VALID [2022-04-27 14:38:18,960 INFO L290 TraceCheckUtils]: 30: Hoare triple {1024#true} assume true; {1024#true} is VALID [2022-04-27 14:38:18,961 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {1024#true} {1106#(and (< 1 main_~k~0) (= (+ (- 1) main_~y~0) 1) (<= main_~c~0 2))} #54#return; {1106#(and (< 1 main_~k~0) (= (+ (- 1) main_~y~0) 1) (<= main_~c~0 2))} is VALID [2022-04-27 14:38:18,961 INFO L290 TraceCheckUtils]: 32: Hoare triple {1106#(and (< 1 main_~k~0) (= (+ (- 1) main_~y~0) 1) (<= main_~c~0 2))} assume !(~c~0 < ~k~0); {1128#(and (< 1 main_~k~0) (= (+ (- 1) main_~y~0) 1) (<= main_~k~0 2))} is VALID [2022-04-27 14:38:18,962 INFO L272 TraceCheckUtils]: 33: Hoare triple {1128#(and (< 1 main_~k~0) (= (+ (- 1) main_~y~0) 1) (<= main_~k~0 2))} call __VERIFIER_assert((if 0 == ~k~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {1132#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 14:38:18,962 INFO L290 TraceCheckUtils]: 34: Hoare triple {1132#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1136#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 14:38:18,963 INFO L290 TraceCheckUtils]: 35: Hoare triple {1136#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1025#false} is VALID [2022-04-27 14:38:18,963 INFO L290 TraceCheckUtils]: 36: Hoare triple {1025#false} assume !false; {1025#false} is VALID [2022-04-27 14:38:18,963 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 6 proven. 9 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-04-27 14:38:18,963 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 14:38:19,193 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 14:38:19,193 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1323505003] [2022-04-27 14:38:19,193 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 14:38:19,193 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1567347841] [2022-04-27 14:38:19,194 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1567347841] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 14:38:19,194 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-27 14:38:19,194 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2022-04-27 14:38:19,194 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [729110464] [2022-04-27 14:38:19,194 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2022-04-27 14:38:19,194 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, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) Word has length 37 [2022-04-27 14:38:19,195 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 14:38:19,195 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, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) [2022-04-27 14:38:19,221 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-27 14:38:19,221 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-27 14:38:19,221 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 14:38:19,221 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-27 14:38:19,221 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2022-04-27 14:38:19,222 INFO L87 Difference]: Start difference. First operand 34 states and 35 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, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) [2022-04-27 14:38:19,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:38:19,432 INFO L93 Difference]: Finished difference Result 42 states and 44 transitions. [2022-04-27 14:38:19,432 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-27 14:38:19,432 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, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) Word has length 37 [2022-04-27 14:38:19,432 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 14:38:19,433 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, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) [2022-04-27 14:38:19,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 40 transitions. [2022-04-27 14:38:19,434 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, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) [2022-04-27 14:38:19,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 40 transitions. [2022-04-27 14:38:19,435 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 40 transitions. [2022-04-27 14:38:19,464 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-27 14:38:19,464 INFO L225 Difference]: With dead ends: 42 [2022-04-27 14:38:19,464 INFO L226 Difference]: Without dead ends: 37 [2022-04-27 14:38:19,465 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 39 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-27 14:38:19,465 INFO L413 NwaCegarLoop]: 28 mSDtfsCounter, 2 mSDsluCounter, 115 mSDsCounter, 0 mSdLazyCounter, 77 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 143 SdHoareTripleChecker+Invalid, 77 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 77 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-27 14:38:19,465 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 143 Invalid, 77 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 77 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-27 14:38:19,466 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2022-04-27 14:38:19,474 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2022-04-27 14:38:19,474 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 14:38:19,474 INFO L82 GeneralOperation]: Start isEquivalent. First operand 37 states. Second operand has 37 states, 24 states have (on average 1.0416666666666667) internal successors, (25), 24 states have internal predecessors, (25), 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-27 14:38:19,475 INFO L74 IsIncluded]: Start isIncluded. First operand 37 states. Second operand has 37 states, 24 states have (on average 1.0416666666666667) internal successors, (25), 24 states have internal predecessors, (25), 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-27 14:38:19,475 INFO L87 Difference]: Start difference. First operand 37 states. Second operand has 37 states, 24 states have (on average 1.0416666666666667) internal successors, (25), 24 states have internal predecessors, (25), 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-27 14:38:19,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:38:19,476 INFO L93 Difference]: Finished difference Result 37 states and 39 transitions. [2022-04-27 14:38:19,476 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 39 transitions. [2022-04-27 14:38:19,477 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:38:19,477 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 14:38:19,477 INFO L74 IsIncluded]: Start isIncluded. First operand has 37 states, 24 states have (on average 1.0416666666666667) internal successors, (25), 24 states have internal predecessors, (25), 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 37 states. [2022-04-27 14:38:19,477 INFO L87 Difference]: Start difference. First operand has 37 states, 24 states have (on average 1.0416666666666667) internal successors, (25), 24 states have internal predecessors, (25), 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 37 states. [2022-04-27 14:38:19,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:38:19,478 INFO L93 Difference]: Finished difference Result 37 states and 39 transitions. [2022-04-27 14:38:19,478 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 39 transitions. [2022-04-27 14:38:19,479 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:38:19,479 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 14:38:19,479 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 14:38:19,479 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 14:38:19,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 24 states have (on average 1.0416666666666667) internal successors, (25), 24 states have internal predecessors, (25), 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-27 14:38:19,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 39 transitions. [2022-04-27 14:38:19,480 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 39 transitions. Word has length 37 [2022-04-27 14:38:19,480 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 14:38:19,480 INFO L495 AbstractCegarLoop]: Abstraction has 37 states and 39 transitions. [2022-04-27 14:38:19,480 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 5 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) [2022-04-27 14:38:19,481 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 39 transitions. [2022-04-27 14:38:19,481 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-04-27 14:38:19,481 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 14:38:19,481 INFO L195 NwaCegarLoop]: trace histogram [5, 4, 4, 4, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 14:38:19,499 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-27 14:38:19,697 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 14:38:19,698 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 14:38:19,698 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 14:38:19,698 INFO L85 PathProgramCache]: Analyzing trace with hash -285848920, now seen corresponding path program 3 times [2022-04-27 14:38:19,698 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 14:38:19,698 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [991304333] [2022-04-27 14:38:19,698 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 14:38:19,698 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 14:38:19,711 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 14:38:19,711 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1628320862] [2022-04-27 14:38:19,711 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-04-27 14:38:19,711 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 14:38:19,711 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 14:38:19,712 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-27 14:38:19,713 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-27 14:38:19,805 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2022-04-27 14:38:19,805 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-27 14:38:19,806 INFO L263 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 20 conjunts are in the unsatisfiable core [2022-04-27 14:38:19,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 14:38:19,819 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 14:38:20,116 INFO L272 TraceCheckUtils]: 0: Hoare triple {1379#true} call ULTIMATE.init(); {1379#true} is VALID [2022-04-27 14:38:20,117 INFO L290 TraceCheckUtils]: 1: Hoare triple {1379#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); {1379#true} is VALID [2022-04-27 14:38:20,119 INFO L290 TraceCheckUtils]: 2: Hoare triple {1379#true} assume true; {1379#true} is VALID [2022-04-27 14:38:20,119 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1379#true} {1379#true} #60#return; {1379#true} is VALID [2022-04-27 14:38:20,119 INFO L272 TraceCheckUtils]: 4: Hoare triple {1379#true} call #t~ret5 := main(); {1379#true} is VALID [2022-04-27 14:38:20,119 INFO L290 TraceCheckUtils]: 5: Hoare triple {1379#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; {1379#true} is VALID [2022-04-27 14:38:20,120 INFO L272 TraceCheckUtils]: 6: Hoare triple {1379#true} call assume_abort_if_not((if ~k~0 >= 0 && ~k~0 <= 5 then 1 else 0)); {1379#true} is VALID [2022-04-27 14:38:20,120 INFO L290 TraceCheckUtils]: 7: Hoare triple {1379#true} ~cond := #in~cond; {1379#true} is VALID [2022-04-27 14:38:20,120 INFO L290 TraceCheckUtils]: 8: Hoare triple {1379#true} assume !(0 == ~cond); {1379#true} is VALID [2022-04-27 14:38:20,120 INFO L290 TraceCheckUtils]: 9: Hoare triple {1379#true} assume true; {1379#true} is VALID [2022-04-27 14:38:20,120 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1379#true} {1379#true} #52#return; {1379#true} is VALID [2022-04-27 14:38:20,120 INFO L290 TraceCheckUtils]: 11: Hoare triple {1379#true} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {1417#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 14:38:20,121 INFO L290 TraceCheckUtils]: 12: Hoare triple {1417#(and (= main_~c~0 0) (= main_~y~0 0))} assume !false; {1417#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 14:38:20,121 INFO L272 TraceCheckUtils]: 13: Hoare triple {1417#(and (= main_~c~0 0) (= main_~y~0 0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {1379#true} is VALID [2022-04-27 14:38:20,121 INFO L290 TraceCheckUtils]: 14: Hoare triple {1379#true} ~cond := #in~cond; {1379#true} is VALID [2022-04-27 14:38:20,121 INFO L290 TraceCheckUtils]: 15: Hoare triple {1379#true} assume !(0 == ~cond); {1379#true} is VALID [2022-04-27 14:38:20,121 INFO L290 TraceCheckUtils]: 16: Hoare triple {1379#true} assume true; {1379#true} is VALID [2022-04-27 14:38:20,122 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {1379#true} {1417#(and (= main_~c~0 0) (= main_~y~0 0))} #54#return; {1417#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 14:38:20,122 INFO L290 TraceCheckUtils]: 18: Hoare triple {1417#(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 + ~x~0; {1439#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} is VALID [2022-04-27 14:38:20,124 INFO L290 TraceCheckUtils]: 19: Hoare triple {1439#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} assume !false; {1439#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} is VALID [2022-04-27 14:38:20,124 INFO L272 TraceCheckUtils]: 20: Hoare triple {1439#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {1379#true} is VALID [2022-04-27 14:38:20,124 INFO L290 TraceCheckUtils]: 21: Hoare triple {1379#true} ~cond := #in~cond; {1379#true} is VALID [2022-04-27 14:38:20,126 INFO L290 TraceCheckUtils]: 22: Hoare triple {1379#true} assume !(0 == ~cond); {1379#true} is VALID [2022-04-27 14:38:20,126 INFO L290 TraceCheckUtils]: 23: Hoare triple {1379#true} assume true; {1379#true} is VALID [2022-04-27 14:38:20,127 INFO L284 TraceCheckUtils]: 24: Hoare quadruple {1379#true} {1439#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} #54#return; {1439#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} is VALID [2022-04-27 14:38:20,127 INFO L290 TraceCheckUtils]: 25: Hoare triple {1439#(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 + ~x~0; {1461#(and (= (+ (- 2) main_~y~0) 0) (= 0 (+ (- 2) main_~c~0)))} is VALID [2022-04-27 14:38:20,128 INFO L290 TraceCheckUtils]: 26: Hoare triple {1461#(and (= (+ (- 2) main_~y~0) 0) (= 0 (+ (- 2) main_~c~0)))} assume !false; {1461#(and (= (+ (- 2) main_~y~0) 0) (= 0 (+ (- 2) main_~c~0)))} is VALID [2022-04-27 14:38:20,128 INFO L272 TraceCheckUtils]: 27: Hoare triple {1461#(and (= (+ (- 2) main_~y~0) 0) (= 0 (+ (- 2) main_~c~0)))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {1379#true} is VALID [2022-04-27 14:38:20,128 INFO L290 TraceCheckUtils]: 28: Hoare triple {1379#true} ~cond := #in~cond; {1379#true} is VALID [2022-04-27 14:38:20,128 INFO L290 TraceCheckUtils]: 29: Hoare triple {1379#true} assume !(0 == ~cond); {1379#true} is VALID [2022-04-27 14:38:20,128 INFO L290 TraceCheckUtils]: 30: Hoare triple {1379#true} assume true; {1379#true} is VALID [2022-04-27 14:38:20,129 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {1379#true} {1461#(and (= (+ (- 2) main_~y~0) 0) (= 0 (+ (- 2) main_~c~0)))} #54#return; {1461#(and (= (+ (- 2) main_~y~0) 0) (= 0 (+ (- 2) main_~c~0)))} is VALID [2022-04-27 14:38:20,129 INFO L290 TraceCheckUtils]: 32: Hoare triple {1461#(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 + ~x~0; {1483#(and (<= main_~c~0 3) (= (+ main_~y~0 (- 3)) 0) (< 2 main_~k~0))} is VALID [2022-04-27 14:38:20,129 INFO L290 TraceCheckUtils]: 33: Hoare triple {1483#(and (<= main_~c~0 3) (= (+ main_~y~0 (- 3)) 0) (< 2 main_~k~0))} assume !false; {1483#(and (<= main_~c~0 3) (= (+ main_~y~0 (- 3)) 0) (< 2 main_~k~0))} is VALID [2022-04-27 14:38:20,130 INFO L272 TraceCheckUtils]: 34: Hoare triple {1483#(and (<= main_~c~0 3) (= (+ main_~y~0 (- 3)) 0) (< 2 main_~k~0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {1379#true} is VALID [2022-04-27 14:38:20,130 INFO L290 TraceCheckUtils]: 35: Hoare triple {1379#true} ~cond := #in~cond; {1379#true} is VALID [2022-04-27 14:38:20,130 INFO L290 TraceCheckUtils]: 36: Hoare triple {1379#true} assume !(0 == ~cond); {1379#true} is VALID [2022-04-27 14:38:20,130 INFO L290 TraceCheckUtils]: 37: Hoare triple {1379#true} assume true; {1379#true} is VALID [2022-04-27 14:38:20,130 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {1379#true} {1483#(and (<= main_~c~0 3) (= (+ main_~y~0 (- 3)) 0) (< 2 main_~k~0))} #54#return; {1483#(and (<= main_~c~0 3) (= (+ main_~y~0 (- 3)) 0) (< 2 main_~k~0))} is VALID [2022-04-27 14:38:20,131 INFO L290 TraceCheckUtils]: 39: Hoare triple {1483#(and (<= main_~c~0 3) (= (+ main_~y~0 (- 3)) 0) (< 2 main_~k~0))} assume !(~c~0 < ~k~0); {1505#(and (<= main_~k~0 3) (= (+ main_~y~0 (- 3)) 0) (< 2 main_~k~0))} is VALID [2022-04-27 14:38:20,132 INFO L272 TraceCheckUtils]: 40: Hoare triple {1505#(and (<= main_~k~0 3) (= (+ main_~y~0 (- 3)) 0) (< 2 main_~k~0))} call __VERIFIER_assert((if 0 == ~k~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {1509#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 14:38:20,132 INFO L290 TraceCheckUtils]: 41: Hoare triple {1509#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1513#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 14:38:20,136 INFO L290 TraceCheckUtils]: 42: Hoare triple {1513#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1380#false} is VALID [2022-04-27 14:38:20,137 INFO L290 TraceCheckUtils]: 43: Hoare triple {1380#false} assume !false; {1380#false} is VALID [2022-04-27 14:38:20,137 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 8 proven. 18 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-04-27 14:38:20,137 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 14:38:20,370 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 14:38:20,370 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [991304333] [2022-04-27 14:38:20,370 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 14:38:20,370 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1628320862] [2022-04-27 14:38:20,370 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1628320862] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 14:38:20,370 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-27 14:38:20,370 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2022-04-27 14:38:20,370 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1996086313] [2022-04-27 14:38:20,370 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2022-04-27 14:38:20,371 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, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) Word has length 44 [2022-04-27 14:38:20,371 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 14:38:20,371 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, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) [2022-04-27 14:38:20,393 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-27 14:38:20,393 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-04-27 14:38:20,394 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 14:38:20,394 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-04-27 14:38:20,394 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2022-04-27 14:38:20,394 INFO L87 Difference]: Start difference. First operand 37 states and 39 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, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) [2022-04-27 14:38:20,683 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:38:20,683 INFO L93 Difference]: Finished difference Result 45 states and 48 transitions. [2022-04-27 14:38:20,683 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-27 14:38:20,683 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, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) Word has length 44 [2022-04-27 14:38:20,683 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 14:38:20,683 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, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) [2022-04-27 14:38:20,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 44 transitions. [2022-04-27 14:38:20,685 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, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) [2022-04-27 14:38:20,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 44 transitions. [2022-04-27 14:38:20,686 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 9 states and 44 transitions. [2022-04-27 14:38:20,720 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 44 edges. 44 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 14:38:20,721 INFO L225 Difference]: With dead ends: 45 [2022-04-27 14:38:20,721 INFO L226 Difference]: Without dead ends: 40 [2022-04-27 14:38:20,721 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 45 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-27 14:38:20,722 INFO L413 NwaCegarLoop]: 31 mSDtfsCounter, 2 mSDsluCounter, 142 mSDsCounter, 0 mSdLazyCounter, 109 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 173 SdHoareTripleChecker+Invalid, 109 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 109 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-27 14:38:20,722 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 173 Invalid, 109 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 109 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-27 14:38:20,722 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2022-04-27 14:38:20,733 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2022-04-27 14:38:20,733 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 14:38:20,733 INFO L82 GeneralOperation]: Start isEquivalent. First operand 40 states. Second operand has 40 states, 26 states have (on average 1.0384615384615385) internal successors, (27), 26 states have internal predecessors, (27), 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-27 14:38:20,733 INFO L74 IsIncluded]: Start isIncluded. First operand 40 states. Second operand has 40 states, 26 states have (on average 1.0384615384615385) internal successors, (27), 26 states have internal predecessors, (27), 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-27 14:38:20,733 INFO L87 Difference]: Start difference. First operand 40 states. Second operand has 40 states, 26 states have (on average 1.0384615384615385) internal successors, (27), 26 states have internal predecessors, (27), 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-27 14:38:20,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:38:20,735 INFO L93 Difference]: Finished difference Result 40 states and 43 transitions. [2022-04-27 14:38:20,735 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 43 transitions. [2022-04-27 14:38:20,735 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:38:20,735 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 14:38:20,735 INFO L74 IsIncluded]: Start isIncluded. First operand has 40 states, 26 states have (on average 1.0384615384615385) internal successors, (27), 26 states have internal predecessors, (27), 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 40 states. [2022-04-27 14:38:20,735 INFO L87 Difference]: Start difference. First operand has 40 states, 26 states have (on average 1.0384615384615385) internal successors, (27), 26 states have internal predecessors, (27), 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 40 states. [2022-04-27 14:38:20,736 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:38:20,736 INFO L93 Difference]: Finished difference Result 40 states and 43 transitions. [2022-04-27 14:38:20,736 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 43 transitions. [2022-04-27 14:38:20,737 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:38:20,737 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 14:38:20,737 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 14:38:20,737 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 14:38:20,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 26 states have (on average 1.0384615384615385) internal successors, (27), 26 states have internal predecessors, (27), 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-27 14:38:20,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 43 transitions. [2022-04-27 14:38:20,738 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 43 transitions. Word has length 44 [2022-04-27 14:38:20,738 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 14:38:20,738 INFO L495 AbstractCegarLoop]: Abstraction has 40 states and 43 transitions. [2022-04-27 14:38:20,738 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 6 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) [2022-04-27 14:38:20,738 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 43 transitions. [2022-04-27 14:38:20,739 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2022-04-27 14:38:20,739 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 14:38:20,739 INFO L195 NwaCegarLoop]: trace histogram [6, 5, 5, 5, 5, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 14:38:20,754 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2022-04-27 14:38:20,943 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 14:38:20,943 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 14:38:20,944 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 14:38:20,944 INFO L85 PathProgramCache]: Analyzing trace with hash -1858889367, now seen corresponding path program 4 times [2022-04-27 14:38:20,944 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 14:38:20,944 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1541310428] [2022-04-27 14:38:20,944 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 14:38:20,944 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 14:38:20,954 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 14:38:20,954 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [261171560] [2022-04-27 14:38:20,954 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-27 14:38:20,954 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 14:38:20,954 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 14:38:20,955 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-27 14:38:20,996 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-27 14:38:21,095 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-27 14:38:21,096 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-27 14:38:21,096 INFO L263 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 24 conjunts are in the unsatisfiable core [2022-04-27 14:38:21,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 14:38:21,110 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 14:38:21,375 INFO L272 TraceCheckUtils]: 0: Hoare triple {1772#true} call ULTIMATE.init(); {1772#true} is VALID [2022-04-27 14:38:21,375 INFO L290 TraceCheckUtils]: 1: Hoare triple {1772#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); {1772#true} is VALID [2022-04-27 14:38:21,375 INFO L290 TraceCheckUtils]: 2: Hoare triple {1772#true} assume true; {1772#true} is VALID [2022-04-27 14:38:21,376 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1772#true} {1772#true} #60#return; {1772#true} is VALID [2022-04-27 14:38:21,376 INFO L272 TraceCheckUtils]: 4: Hoare triple {1772#true} call #t~ret5 := main(); {1772#true} is VALID [2022-04-27 14:38:21,376 INFO L290 TraceCheckUtils]: 5: Hoare triple {1772#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; {1772#true} is VALID [2022-04-27 14:38:21,376 INFO L272 TraceCheckUtils]: 6: Hoare triple {1772#true} call assume_abort_if_not((if ~k~0 >= 0 && ~k~0 <= 5 then 1 else 0)); {1772#true} is VALID [2022-04-27 14:38:21,376 INFO L290 TraceCheckUtils]: 7: Hoare triple {1772#true} ~cond := #in~cond; {1772#true} is VALID [2022-04-27 14:38:21,376 INFO L290 TraceCheckUtils]: 8: Hoare triple {1772#true} assume !(0 == ~cond); {1772#true} is VALID [2022-04-27 14:38:21,376 INFO L290 TraceCheckUtils]: 9: Hoare triple {1772#true} assume true; {1772#true} is VALID [2022-04-27 14:38:21,376 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1772#true} {1772#true} #52#return; {1772#true} is VALID [2022-04-27 14:38:21,376 INFO L290 TraceCheckUtils]: 11: Hoare triple {1772#true} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {1810#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 14:38:21,377 INFO L290 TraceCheckUtils]: 12: Hoare triple {1810#(and (= main_~c~0 0) (= main_~y~0 0))} assume !false; {1810#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 14:38:21,377 INFO L272 TraceCheckUtils]: 13: Hoare triple {1810#(and (= main_~c~0 0) (= main_~y~0 0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {1772#true} is VALID [2022-04-27 14:38:21,377 INFO L290 TraceCheckUtils]: 14: Hoare triple {1772#true} ~cond := #in~cond; {1772#true} is VALID [2022-04-27 14:38:21,377 INFO L290 TraceCheckUtils]: 15: Hoare triple {1772#true} assume !(0 == ~cond); {1772#true} is VALID [2022-04-27 14:38:21,377 INFO L290 TraceCheckUtils]: 16: Hoare triple {1772#true} assume true; {1772#true} is VALID [2022-04-27 14:38:21,378 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {1772#true} {1810#(and (= main_~c~0 0) (= main_~y~0 0))} #54#return; {1810#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 14:38:21,378 INFO L290 TraceCheckUtils]: 18: Hoare triple {1810#(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 + ~x~0; {1832#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} is VALID [2022-04-27 14:38:21,378 INFO L290 TraceCheckUtils]: 19: Hoare triple {1832#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} assume !false; {1832#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} is VALID [2022-04-27 14:38:21,378 INFO L272 TraceCheckUtils]: 20: Hoare triple {1832#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {1772#true} is VALID [2022-04-27 14:38:21,378 INFO L290 TraceCheckUtils]: 21: Hoare triple {1772#true} ~cond := #in~cond; {1772#true} is VALID [2022-04-27 14:38:21,379 INFO L290 TraceCheckUtils]: 22: Hoare triple {1772#true} assume !(0 == ~cond); {1772#true} is VALID [2022-04-27 14:38:21,379 INFO L290 TraceCheckUtils]: 23: Hoare triple {1772#true} assume true; {1772#true} is VALID [2022-04-27 14:38:21,379 INFO L284 TraceCheckUtils]: 24: Hoare quadruple {1772#true} {1832#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} #54#return; {1832#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} is VALID [2022-04-27 14:38:21,379 INFO L290 TraceCheckUtils]: 25: Hoare triple {1832#(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 + ~x~0; {1854#(and (= (+ (- 1) main_~y~0) 1) (= 0 (+ (- 2) main_~c~0)))} is VALID [2022-04-27 14:38:21,380 INFO L290 TraceCheckUtils]: 26: Hoare triple {1854#(and (= (+ (- 1) main_~y~0) 1) (= 0 (+ (- 2) main_~c~0)))} assume !false; {1854#(and (= (+ (- 1) main_~y~0) 1) (= 0 (+ (- 2) main_~c~0)))} is VALID [2022-04-27 14:38:21,380 INFO L272 TraceCheckUtils]: 27: Hoare triple {1854#(and (= (+ (- 1) main_~y~0) 1) (= 0 (+ (- 2) main_~c~0)))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {1772#true} is VALID [2022-04-27 14:38:21,380 INFO L290 TraceCheckUtils]: 28: Hoare triple {1772#true} ~cond := #in~cond; {1772#true} is VALID [2022-04-27 14:38:21,380 INFO L290 TraceCheckUtils]: 29: Hoare triple {1772#true} assume !(0 == ~cond); {1772#true} is VALID [2022-04-27 14:38:21,380 INFO L290 TraceCheckUtils]: 30: Hoare triple {1772#true} assume true; {1772#true} is VALID [2022-04-27 14:38:21,381 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {1772#true} {1854#(and (= (+ (- 1) main_~y~0) 1) (= 0 (+ (- 2) main_~c~0)))} #54#return; {1854#(and (= (+ (- 1) main_~y~0) 1) (= 0 (+ (- 2) main_~c~0)))} is VALID [2022-04-27 14:38:21,381 INFO L290 TraceCheckUtils]: 32: Hoare triple {1854#(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 + ~x~0; {1876#(and (= (+ (- 2) main_~y~0) 1) (= (+ main_~c~0 (- 3)) 0))} is VALID [2022-04-27 14:38:21,381 INFO L290 TraceCheckUtils]: 33: Hoare triple {1876#(and (= (+ (- 2) main_~y~0) 1) (= (+ main_~c~0 (- 3)) 0))} assume !false; {1876#(and (= (+ (- 2) main_~y~0) 1) (= (+ main_~c~0 (- 3)) 0))} is VALID [2022-04-27 14:38:21,381 INFO L272 TraceCheckUtils]: 34: Hoare triple {1876#(and (= (+ (- 2) main_~y~0) 1) (= (+ main_~c~0 (- 3)) 0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {1772#true} is VALID [2022-04-27 14:38:21,381 INFO L290 TraceCheckUtils]: 35: Hoare triple {1772#true} ~cond := #in~cond; {1772#true} is VALID [2022-04-27 14:38:21,382 INFO L290 TraceCheckUtils]: 36: Hoare triple {1772#true} assume !(0 == ~cond); {1772#true} is VALID [2022-04-27 14:38:21,382 INFO L290 TraceCheckUtils]: 37: Hoare triple {1772#true} assume true; {1772#true} is VALID [2022-04-27 14:38:21,382 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {1772#true} {1876#(and (= (+ (- 2) main_~y~0) 1) (= (+ main_~c~0 (- 3)) 0))} #54#return; {1876#(and (= (+ (- 2) main_~y~0) 1) (= (+ main_~c~0 (- 3)) 0))} is VALID [2022-04-27 14:38:21,382 INFO L290 TraceCheckUtils]: 39: Hoare triple {1876#(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 + ~x~0; {1898#(and (= main_~y~0 4) (< 3 main_~k~0) (<= main_~c~0 4))} is VALID [2022-04-27 14:38:21,387 INFO L290 TraceCheckUtils]: 40: Hoare triple {1898#(and (= main_~y~0 4) (< 3 main_~k~0) (<= main_~c~0 4))} assume !false; {1898#(and (= main_~y~0 4) (< 3 main_~k~0) (<= main_~c~0 4))} is VALID [2022-04-27 14:38:21,387 INFO L272 TraceCheckUtils]: 41: Hoare triple {1898#(and (= main_~y~0 4) (< 3 main_~k~0) (<= main_~c~0 4))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {1772#true} is VALID [2022-04-27 14:38:21,387 INFO L290 TraceCheckUtils]: 42: Hoare triple {1772#true} ~cond := #in~cond; {1772#true} is VALID [2022-04-27 14:38:21,387 INFO L290 TraceCheckUtils]: 43: Hoare triple {1772#true} assume !(0 == ~cond); {1772#true} is VALID [2022-04-27 14:38:21,388 INFO L290 TraceCheckUtils]: 44: Hoare triple {1772#true} assume true; {1772#true} is VALID [2022-04-27 14:38:21,388 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {1772#true} {1898#(and (= main_~y~0 4) (< 3 main_~k~0) (<= main_~c~0 4))} #54#return; {1898#(and (= main_~y~0 4) (< 3 main_~k~0) (<= main_~c~0 4))} is VALID [2022-04-27 14:38:21,388 INFO L290 TraceCheckUtils]: 46: Hoare triple {1898#(and (= main_~y~0 4) (< 3 main_~k~0) (<= main_~c~0 4))} assume !(~c~0 < ~k~0); {1920#(and (= main_~y~0 4) (< 3 main_~k~0) (<= main_~k~0 4))} is VALID [2022-04-27 14:38:21,389 INFO L272 TraceCheckUtils]: 47: Hoare triple {1920#(and (= main_~y~0 4) (< 3 main_~k~0) (<= main_~k~0 4))} call __VERIFIER_assert((if 0 == ~k~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {1924#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 14:38:21,389 INFO L290 TraceCheckUtils]: 48: Hoare triple {1924#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1928#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 14:38:21,390 INFO L290 TraceCheckUtils]: 49: Hoare triple {1928#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1773#false} is VALID [2022-04-27 14:38:21,390 INFO L290 TraceCheckUtils]: 50: Hoare triple {1773#false} assume !false; {1773#false} is VALID [2022-04-27 14:38:21,390 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 10 proven. 30 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2022-04-27 14:38:21,390 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 14:38:21,708 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 14:38:21,708 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1541310428] [2022-04-27 14:38:21,708 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 14:38:21,708 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [261171560] [2022-04-27 14:38:21,709 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [261171560] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 14:38:21,709 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-27 14:38:21,709 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2022-04-27 14:38:21,709 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [78974335] [2022-04-27 14:38:21,709 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2022-04-27 14:38:21,709 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, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 6 states have call predecessors, (7), 6 states have call successors, (7) Word has length 51 [2022-04-27 14:38:21,710 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 14:38:21,710 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, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 6 states have call predecessors, (7), 6 states have call successors, (7) [2022-04-27 14:38:21,732 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-27 14:38:21,733 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-04-27 14:38:21,733 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 14:38:21,733 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-04-27 14:38:21,733 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2022-04-27 14:38:21,733 INFO L87 Difference]: Start difference. First operand 40 states and 43 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, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 6 states have call predecessors, (7), 6 states have call successors, (7) [2022-04-27 14:38:22,085 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:38:22,085 INFO L93 Difference]: Finished difference Result 48 states and 52 transitions. [2022-04-27 14:38:22,085 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-04-27 14:38:22,085 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, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 6 states have call predecessors, (7), 6 states have call successors, (7) Word has length 51 [2022-04-27 14:38:22,085 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 14:38:22,085 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, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 6 states have call predecessors, (7), 6 states have call successors, (7) [2022-04-27 14:38:22,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 48 transitions. [2022-04-27 14:38:22,087 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, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 6 states have call predecessors, (7), 6 states have call successors, (7) [2022-04-27 14:38:22,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 48 transitions. [2022-04-27 14:38:22,088 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 10 states and 48 transitions. [2022-04-27 14:38:22,119 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 48 edges. 48 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 14:38:22,120 INFO L225 Difference]: With dead ends: 48 [2022-04-27 14:38:22,120 INFO L226 Difference]: Without dead ends: 43 [2022-04-27 14:38:22,120 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 51 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=43, Invalid=167, Unknown=0, NotChecked=0, Total=210 [2022-04-27 14:38:22,121 INFO L413 NwaCegarLoop]: 34 mSDtfsCounter, 2 mSDsluCounter, 171 mSDsCounter, 0 mSdLazyCounter, 147 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 205 SdHoareTripleChecker+Invalid, 147 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 147 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-27 14:38:22,121 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 205 Invalid, 147 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 147 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-27 14:38:22,121 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2022-04-27 14:38:22,132 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2022-04-27 14:38:22,132 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 14:38:22,133 INFO L82 GeneralOperation]: Start isEquivalent. First operand 43 states. Second operand has 43 states, 28 states have (on average 1.0357142857142858) internal successors, (29), 28 states have internal predecessors, (29), 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-27 14:38:22,133 INFO L74 IsIncluded]: Start isIncluded. First operand 43 states. Second operand has 43 states, 28 states have (on average 1.0357142857142858) internal successors, (29), 28 states have internal predecessors, (29), 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-27 14:38:22,133 INFO L87 Difference]: Start difference. First operand 43 states. Second operand has 43 states, 28 states have (on average 1.0357142857142858) internal successors, (29), 28 states have internal predecessors, (29), 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-27 14:38:22,134 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:38:22,134 INFO L93 Difference]: Finished difference Result 43 states and 47 transitions. [2022-04-27 14:38:22,134 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 47 transitions. [2022-04-27 14:38:22,135 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:38:22,135 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 14:38:22,135 INFO L74 IsIncluded]: Start isIncluded. First operand has 43 states, 28 states have (on average 1.0357142857142858) internal successors, (29), 28 states have internal predecessors, (29), 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 43 states. [2022-04-27 14:38:22,135 INFO L87 Difference]: Start difference. First operand has 43 states, 28 states have (on average 1.0357142857142858) internal successors, (29), 28 states have internal predecessors, (29), 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 43 states. [2022-04-27 14:38:22,136 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:38:22,136 INFO L93 Difference]: Finished difference Result 43 states and 47 transitions. [2022-04-27 14:38:22,136 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 47 transitions. [2022-04-27 14:38:22,136 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:38:22,137 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 14:38:22,137 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 14:38:22,137 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 14:38:22,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 28 states have (on average 1.0357142857142858) internal successors, (29), 28 states have internal predecessors, (29), 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-27 14:38:22,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 47 transitions. [2022-04-27 14:38:22,138 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 47 transitions. Word has length 51 [2022-04-27 14:38:22,138 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 14:38:22,138 INFO L495 AbstractCegarLoop]: Abstraction has 43 states and 47 transitions. [2022-04-27 14:38:22,138 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 2.5555555555555554) internal successors, (23), 9 states have internal predecessors, (23), 7 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 6 states have call predecessors, (7), 6 states have call successors, (7) [2022-04-27 14:38:22,138 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 47 transitions. [2022-04-27 14:38:22,139 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2022-04-27 14:38:22,139 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 14:38:22,139 INFO L195 NwaCegarLoop]: trace histogram [7, 6, 6, 6, 6, 6, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 14:38:22,156 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2022-04-27 14:38:22,358 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 14:38:22,358 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 14:38:22,359 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 14:38:22,359 INFO L85 PathProgramCache]: Analyzing trace with hash 1288003464, now seen corresponding path program 5 times [2022-04-27 14:38:22,359 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 14:38:22,359 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1452662476] [2022-04-27 14:38:22,359 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 14:38:22,359 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 14:38:22,383 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 14:38:22,383 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [474074745] [2022-04-27 14:38:22,383 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-04-27 14:38:22,383 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 14:38:22,383 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 14:38:22,398 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-27 14:38:22,423 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-27 14:38:22,507 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2022-04-27 14:38:22,507 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-27 14:38:22,508 INFO L263 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 28 conjunts are in the unsatisfiable core [2022-04-27 14:38:22,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 14:38:22,518 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 14:38:22,866 INFO L272 TraceCheckUtils]: 0: Hoare triple {2203#true} call ULTIMATE.init(); {2203#true} is VALID [2022-04-27 14:38:22,866 INFO L290 TraceCheckUtils]: 1: Hoare triple {2203#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); {2203#true} is VALID [2022-04-27 14:38:22,866 INFO L290 TraceCheckUtils]: 2: Hoare triple {2203#true} assume true; {2203#true} is VALID [2022-04-27 14:38:22,867 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2203#true} {2203#true} #60#return; {2203#true} is VALID [2022-04-27 14:38:22,868 INFO L272 TraceCheckUtils]: 4: Hoare triple {2203#true} call #t~ret5 := main(); {2203#true} is VALID [2022-04-27 14:38:22,868 INFO L290 TraceCheckUtils]: 5: Hoare triple {2203#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; {2203#true} is VALID [2022-04-27 14:38:22,869 INFO L272 TraceCheckUtils]: 6: Hoare triple {2203#true} call assume_abort_if_not((if ~k~0 >= 0 && ~k~0 <= 5 then 1 else 0)); {2203#true} is VALID [2022-04-27 14:38:22,869 INFO L290 TraceCheckUtils]: 7: Hoare triple {2203#true} ~cond := #in~cond; {2203#true} is VALID [2022-04-27 14:38:22,869 INFO L290 TraceCheckUtils]: 8: Hoare triple {2203#true} assume !(0 == ~cond); {2203#true} is VALID [2022-04-27 14:38:22,869 INFO L290 TraceCheckUtils]: 9: Hoare triple {2203#true} assume true; {2203#true} is VALID [2022-04-27 14:38:22,869 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {2203#true} {2203#true} #52#return; {2203#true} is VALID [2022-04-27 14:38:22,869 INFO L290 TraceCheckUtils]: 11: Hoare triple {2203#true} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {2241#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 14:38:22,870 INFO L290 TraceCheckUtils]: 12: Hoare triple {2241#(and (= main_~c~0 0) (= main_~y~0 0))} assume !false; {2241#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 14:38:22,870 INFO L272 TraceCheckUtils]: 13: Hoare triple {2241#(and (= main_~c~0 0) (= main_~y~0 0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {2203#true} is VALID [2022-04-27 14:38:22,870 INFO L290 TraceCheckUtils]: 14: Hoare triple {2203#true} ~cond := #in~cond; {2203#true} is VALID [2022-04-27 14:38:22,870 INFO L290 TraceCheckUtils]: 15: Hoare triple {2203#true} assume !(0 == ~cond); {2203#true} is VALID [2022-04-27 14:38:22,870 INFO L290 TraceCheckUtils]: 16: Hoare triple {2203#true} assume true; {2203#true} is VALID [2022-04-27 14:38:22,870 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {2203#true} {2241#(and (= main_~c~0 0) (= main_~y~0 0))} #54#return; {2241#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-27 14:38:22,871 INFO L290 TraceCheckUtils]: 18: Hoare triple {2241#(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 + ~x~0; {2263#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} is VALID [2022-04-27 14:38:22,871 INFO L290 TraceCheckUtils]: 19: Hoare triple {2263#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} assume !false; {2263#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} is VALID [2022-04-27 14:38:22,871 INFO L272 TraceCheckUtils]: 20: Hoare triple {2263#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {2203#true} is VALID [2022-04-27 14:38:22,871 INFO L290 TraceCheckUtils]: 21: Hoare triple {2203#true} ~cond := #in~cond; {2203#true} is VALID [2022-04-27 14:38:22,871 INFO L290 TraceCheckUtils]: 22: Hoare triple {2203#true} assume !(0 == ~cond); {2203#true} is VALID [2022-04-27 14:38:22,871 INFO L290 TraceCheckUtils]: 23: Hoare triple {2203#true} assume true; {2203#true} is VALID [2022-04-27 14:38:22,872 INFO L284 TraceCheckUtils]: 24: Hoare quadruple {2203#true} {2263#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} #54#return; {2263#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} is VALID [2022-04-27 14:38:22,872 INFO L290 TraceCheckUtils]: 25: Hoare triple {2263#(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 + ~x~0; {2285#(and (= (+ (- 2) main_~y~0) 0) (= main_~c~0 2))} is VALID [2022-04-27 14:38:22,873 INFO L290 TraceCheckUtils]: 26: Hoare triple {2285#(and (= (+ (- 2) main_~y~0) 0) (= main_~c~0 2))} assume !false; {2285#(and (= (+ (- 2) main_~y~0) 0) (= main_~c~0 2))} is VALID [2022-04-27 14:38:22,873 INFO L272 TraceCheckUtils]: 27: Hoare triple {2285#(and (= (+ (- 2) main_~y~0) 0) (= main_~c~0 2))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {2203#true} is VALID [2022-04-27 14:38:22,873 INFO L290 TraceCheckUtils]: 28: Hoare triple {2203#true} ~cond := #in~cond; {2203#true} is VALID [2022-04-27 14:38:22,873 INFO L290 TraceCheckUtils]: 29: Hoare triple {2203#true} assume !(0 == ~cond); {2203#true} is VALID [2022-04-27 14:38:22,874 INFO L290 TraceCheckUtils]: 30: Hoare triple {2203#true} assume true; {2203#true} is VALID [2022-04-27 14:38:22,874 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {2203#true} {2285#(and (= (+ (- 2) main_~y~0) 0) (= main_~c~0 2))} #54#return; {2285#(and (= (+ (- 2) main_~y~0) 0) (= main_~c~0 2))} is VALID [2022-04-27 14:38:22,874 INFO L290 TraceCheckUtils]: 32: Hoare triple {2285#(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 + ~x~0; {2307#(and (= main_~y~0 3) (= (+ (- 1) main_~c~0) 2))} is VALID [2022-04-27 14:38:22,875 INFO L290 TraceCheckUtils]: 33: Hoare triple {2307#(and (= main_~y~0 3) (= (+ (- 1) main_~c~0) 2))} assume !false; {2307#(and (= main_~y~0 3) (= (+ (- 1) main_~c~0) 2))} is VALID [2022-04-27 14:38:22,875 INFO L272 TraceCheckUtils]: 34: Hoare triple {2307#(and (= main_~y~0 3) (= (+ (- 1) main_~c~0) 2))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {2203#true} is VALID [2022-04-27 14:38:22,875 INFO L290 TraceCheckUtils]: 35: Hoare triple {2203#true} ~cond := #in~cond; {2203#true} is VALID [2022-04-27 14:38:22,875 INFO L290 TraceCheckUtils]: 36: Hoare triple {2203#true} assume !(0 == ~cond); {2203#true} is VALID [2022-04-27 14:38:22,875 INFO L290 TraceCheckUtils]: 37: Hoare triple {2203#true} assume true; {2203#true} is VALID [2022-04-27 14:38:22,875 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {2203#true} {2307#(and (= main_~y~0 3) (= (+ (- 1) main_~c~0) 2))} #54#return; {2307#(and (= main_~y~0 3) (= (+ (- 1) main_~c~0) 2))} is VALID [2022-04-27 14:38:22,876 INFO L290 TraceCheckUtils]: 39: Hoare triple {2307#(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 + ~x~0; {2329#(and (= 2 (+ (- 2) main_~c~0)) (= 3 (+ (- 1) main_~y~0)))} is VALID [2022-04-27 14:38:22,876 INFO L290 TraceCheckUtils]: 40: Hoare triple {2329#(and (= 2 (+ (- 2) main_~c~0)) (= 3 (+ (- 1) main_~y~0)))} assume !false; {2329#(and (= 2 (+ (- 2) main_~c~0)) (= 3 (+ (- 1) main_~y~0)))} is VALID [2022-04-27 14:38:22,876 INFO L272 TraceCheckUtils]: 41: Hoare triple {2329#(and (= 2 (+ (- 2) main_~c~0)) (= 3 (+ (- 1) main_~y~0)))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {2203#true} is VALID [2022-04-27 14:38:22,876 INFO L290 TraceCheckUtils]: 42: Hoare triple {2203#true} ~cond := #in~cond; {2203#true} is VALID [2022-04-27 14:38:22,876 INFO L290 TraceCheckUtils]: 43: Hoare triple {2203#true} assume !(0 == ~cond); {2203#true} is VALID [2022-04-27 14:38:22,877 INFO L290 TraceCheckUtils]: 44: Hoare triple {2203#true} assume true; {2203#true} is VALID [2022-04-27 14:38:22,877 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {2203#true} {2329#(and (= 2 (+ (- 2) main_~c~0)) (= 3 (+ (- 1) main_~y~0)))} #54#return; {2329#(and (= 2 (+ (- 2) main_~c~0)) (= 3 (+ (- 1) main_~y~0)))} is VALID [2022-04-27 14:38:22,878 INFO L290 TraceCheckUtils]: 46: Hoare triple {2329#(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 + ~x~0; {2351#(and (<= main_~c~0 5) (= (+ (- 2) main_~y~0) 3) (< 4 main_~k~0))} is VALID [2022-04-27 14:38:22,878 INFO L290 TraceCheckUtils]: 47: Hoare triple {2351#(and (<= main_~c~0 5) (= (+ (- 2) main_~y~0) 3) (< 4 main_~k~0))} assume !false; {2351#(and (<= main_~c~0 5) (= (+ (- 2) main_~y~0) 3) (< 4 main_~k~0))} is VALID [2022-04-27 14:38:22,878 INFO L272 TraceCheckUtils]: 48: Hoare triple {2351#(and (<= main_~c~0 5) (= (+ (- 2) main_~y~0) 3) (< 4 main_~k~0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {2203#true} is VALID [2022-04-27 14:38:22,878 INFO L290 TraceCheckUtils]: 49: Hoare triple {2203#true} ~cond := #in~cond; {2203#true} is VALID [2022-04-27 14:38:22,878 INFO L290 TraceCheckUtils]: 50: Hoare triple {2203#true} assume !(0 == ~cond); {2203#true} is VALID [2022-04-27 14:38:22,879 INFO L290 TraceCheckUtils]: 51: Hoare triple {2203#true} assume true; {2203#true} is VALID [2022-04-27 14:38:22,880 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {2203#true} {2351#(and (<= main_~c~0 5) (= (+ (- 2) main_~y~0) 3) (< 4 main_~k~0))} #54#return; {2351#(and (<= main_~c~0 5) (= (+ (- 2) main_~y~0) 3) (< 4 main_~k~0))} is VALID [2022-04-27 14:38:22,880 INFO L290 TraceCheckUtils]: 53: Hoare triple {2351#(and (<= main_~c~0 5) (= (+ (- 2) main_~y~0) 3) (< 4 main_~k~0))} assume !(~c~0 < ~k~0); {2373#(and (<= main_~k~0 5) (= (+ (- 2) main_~y~0) 3) (< 4 main_~k~0))} is VALID [2022-04-27 14:38:22,881 INFO L272 TraceCheckUtils]: 54: Hoare triple {2373#(and (<= main_~k~0 5) (= (+ (- 2) main_~y~0) 3) (< 4 main_~k~0))} call __VERIFIER_assert((if 0 == ~k~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {2377#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 14:38:22,881 INFO L290 TraceCheckUtils]: 55: Hoare triple {2377#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {2381#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 14:38:22,881 INFO L290 TraceCheckUtils]: 56: Hoare triple {2381#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {2204#false} is VALID [2022-04-27 14:38:22,882 INFO L290 TraceCheckUtils]: 57: Hoare triple {2204#false} assume !false; {2204#false} is VALID [2022-04-27 14:38:22,883 INFO L134 CoverageAnalysis]: Checked inductivity of 117 backedges. 12 proven. 45 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2022-04-27 14:38:22,883 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 14:38:23,146 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 14:38:23,146 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1452662476] [2022-04-27 14:38:23,146 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 14:38:23,146 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [474074745] [2022-04-27 14:38:23,146 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [474074745] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 14:38:23,146 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-27 14:38:23,146 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2022-04-27 14:38:23,146 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [574368066] [2022-04-27 14:38:23,146 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2022-04-27 14:38:23,147 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, (10), 2 states have call predecessors, (10), 1 states have return successors, (8), 7 states have call predecessors, (8), 7 states have call successors, (8) Word has length 58 [2022-04-27 14:38:23,147 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 14:38:23,147 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, (10), 2 states have call predecessors, (10), 1 states have return successors, (8), 7 states have call predecessors, (8), 7 states have call successors, (8) [2022-04-27 14:38:23,174 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-27 14:38:23,174 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-04-27 14:38:23,174 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 14:38:23,175 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-04-27 14:38:23,175 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=146, Unknown=0, NotChecked=0, Total=182 [2022-04-27 14:38:23,175 INFO L87 Difference]: Start difference. First operand 43 states and 47 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, (10), 2 states have call predecessors, (10), 1 states have return successors, (8), 7 states have call predecessors, (8), 7 states have call successors, (8) [2022-04-27 14:38:23,666 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:38:23,666 INFO L93 Difference]: Finished difference Result 51 states and 56 transitions. [2022-04-27 14:38:23,666 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-04-27 14:38:23,666 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, (10), 2 states have call predecessors, (10), 1 states have return successors, (8), 7 states have call predecessors, (8), 7 states have call successors, (8) Word has length 58 [2022-04-27 14:38:23,667 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 14:38:23,667 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, (10), 2 states have call predecessors, (10), 1 states have return successors, (8), 7 states have call predecessors, (8), 7 states have call successors, (8) [2022-04-27 14:38:23,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 52 transitions. [2022-04-27 14:38:23,668 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, (10), 2 states have call predecessors, (10), 1 states have return successors, (8), 7 states have call predecessors, (8), 7 states have call successors, (8) [2022-04-27 14:38:23,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 52 transitions. [2022-04-27 14:38:23,669 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 11 states and 52 transitions. [2022-04-27 14:38:23,720 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 52 edges. 52 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 14:38:23,721 INFO L225 Difference]: With dead ends: 51 [2022-04-27 14:38:23,721 INFO L226 Difference]: Without dead ends: 46 [2022-04-27 14:38:23,721 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 57 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-27 14:38:23,722 INFO L413 NwaCegarLoop]: 37 mSDtfsCounter, 2 mSDsluCounter, 202 mSDsCounter, 0 mSdLazyCounter, 191 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 239 SdHoareTripleChecker+Invalid, 191 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 191 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-27 14:38:23,722 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 239 Invalid, 191 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 191 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-27 14:38:23,722 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2022-04-27 14:38:23,753 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2022-04-27 14:38:23,753 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 14:38:23,753 INFO L82 GeneralOperation]: Start isEquivalent. First operand 46 states. Second operand has 46 states, 30 states have (on average 1.0333333333333334) internal successors, (31), 30 states have internal predecessors, (31), 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-27 14:38:23,753 INFO L74 IsIncluded]: Start isIncluded. First operand 46 states. Second operand has 46 states, 30 states have (on average 1.0333333333333334) internal successors, (31), 30 states have internal predecessors, (31), 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-27 14:38:23,754 INFO L87 Difference]: Start difference. First operand 46 states. Second operand has 46 states, 30 states have (on average 1.0333333333333334) internal successors, (31), 30 states have internal predecessors, (31), 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-27 14:38:23,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:38:23,755 INFO L93 Difference]: Finished difference Result 46 states and 51 transitions. [2022-04-27 14:38:23,755 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 51 transitions. [2022-04-27 14:38:23,755 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:38:23,755 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 14:38:23,756 INFO L74 IsIncluded]: Start isIncluded. First operand has 46 states, 30 states have (on average 1.0333333333333334) internal successors, (31), 30 states have internal predecessors, (31), 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 46 states. [2022-04-27 14:38:23,756 INFO L87 Difference]: Start difference. First operand has 46 states, 30 states have (on average 1.0333333333333334) internal successors, (31), 30 states have internal predecessors, (31), 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 46 states. [2022-04-27 14:38:23,757 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:38:23,757 INFO L93 Difference]: Finished difference Result 46 states and 51 transitions. [2022-04-27 14:38:23,757 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 51 transitions. [2022-04-27 14:38:23,757 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:38:23,757 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 14:38:23,757 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 14:38:23,758 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 14:38:23,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 30 states have (on average 1.0333333333333334) internal successors, (31), 30 states have internal predecessors, (31), 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-27 14:38:23,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 51 transitions. [2022-04-27 14:38:23,759 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 51 transitions. Word has length 58 [2022-04-27 14:38:23,759 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 14:38:23,759 INFO L495 AbstractCegarLoop]: Abstraction has 46 states and 51 transitions. [2022-04-27 14:38:23,759 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 2.5) internal successors, (25), 10 states have internal predecessors, (25), 8 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (8), 7 states have call predecessors, (8), 7 states have call successors, (8) [2022-04-27 14:38:23,759 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 51 transitions. [2022-04-27 14:38:23,760 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2022-04-27 14:38:23,760 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 14:38:23,760 INFO L195 NwaCegarLoop]: trace histogram [8, 7, 7, 7, 7, 7, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 14:38:23,791 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-27 14:38:23,991 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 14:38:23,991 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 14:38:23,992 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 14:38:23,992 INFO L85 PathProgramCache]: Analyzing trace with hash 1494042761, now seen corresponding path program 6 times [2022-04-27 14:38:23,992 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 14:38:23,992 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2137345085] [2022-04-27 14:38:23,992 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 14:38:23,992 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 14:38:24,002 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 14:38:24,002 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [588006387] [2022-04-27 14:38:24,002 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-27 14:38:24,002 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 14:38:24,002 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 14:38:24,003 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-27 14:38:24,004 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-27 14:38:24,093 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2022-04-27 14:38:24,093 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-27 14:38:24,094 INFO L263 TraceCheckSpWp]: Trace formula consists of 180 conjuncts, 12 conjunts are in the unsatisfiable core [2022-04-27 14:38:24,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 14:38:24,107 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 14:38:24,571 INFO L272 TraceCheckUtils]: 0: Hoare triple {2672#true} call ULTIMATE.init(); {2672#true} is VALID [2022-04-27 14:38:24,571 INFO L290 TraceCheckUtils]: 1: Hoare triple {2672#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); {2672#true} is VALID [2022-04-27 14:38:24,571 INFO L290 TraceCheckUtils]: 2: Hoare triple {2672#true} assume true; {2672#true} is VALID [2022-04-27 14:38:24,571 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2672#true} {2672#true} #60#return; {2672#true} is VALID [2022-04-27 14:38:24,571 INFO L272 TraceCheckUtils]: 4: Hoare triple {2672#true} call #t~ret5 := main(); {2672#true} is VALID [2022-04-27 14:38:24,571 INFO L290 TraceCheckUtils]: 5: Hoare triple {2672#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; {2672#true} is VALID [2022-04-27 14:38:24,571 INFO L272 TraceCheckUtils]: 6: Hoare triple {2672#true} call assume_abort_if_not((if ~k~0 >= 0 && ~k~0 <= 5 then 1 else 0)); {2672#true} is VALID [2022-04-27 14:38:24,572 INFO L290 TraceCheckUtils]: 7: Hoare triple {2672#true} ~cond := #in~cond; {2698#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-04-27 14:38:24,572 INFO L290 TraceCheckUtils]: 8: Hoare triple {2698#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} assume !(0 == ~cond); {2702#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-27 14:38:24,572 INFO L290 TraceCheckUtils]: 9: Hoare triple {2702#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {2702#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-27 14:38:24,573 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {2702#(not (= |assume_abort_if_not_#in~cond| 0))} {2672#true} #52#return; {2709#(and (<= main_~k~0 5) (<= 0 main_~k~0))} is VALID [2022-04-27 14:38:24,573 INFO L290 TraceCheckUtils]: 11: Hoare triple {2709#(and (<= main_~k~0 5) (<= 0 main_~k~0))} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {2713#(and (<= main_~k~0 5) (<= 0 main_~k~0) (<= 0 main_~c~0))} is VALID [2022-04-27 14:38:24,574 INFO L290 TraceCheckUtils]: 12: Hoare triple {2713#(and (<= main_~k~0 5) (<= 0 main_~k~0) (<= 0 main_~c~0))} assume !false; {2713#(and (<= main_~k~0 5) (<= 0 main_~k~0) (<= 0 main_~c~0))} is VALID [2022-04-27 14:38:24,574 INFO L272 TraceCheckUtils]: 13: Hoare triple {2713#(and (<= main_~k~0 5) (<= 0 main_~k~0) (<= 0 main_~c~0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {2672#true} is VALID [2022-04-27 14:38:24,574 INFO L290 TraceCheckUtils]: 14: Hoare triple {2672#true} ~cond := #in~cond; {2672#true} is VALID [2022-04-27 14:38:24,574 INFO L290 TraceCheckUtils]: 15: Hoare triple {2672#true} assume !(0 == ~cond); {2672#true} is VALID [2022-04-27 14:38:24,574 INFO L290 TraceCheckUtils]: 16: Hoare triple {2672#true} assume true; {2672#true} is VALID [2022-04-27 14:38:24,574 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {2672#true} {2713#(and (<= main_~k~0 5) (<= 0 main_~k~0) (<= 0 main_~c~0))} #54#return; {2713#(and (<= main_~k~0 5) (<= 0 main_~k~0) (<= 0 main_~c~0))} is VALID [2022-04-27 14:38:24,575 INFO L290 TraceCheckUtils]: 18: Hoare triple {2713#(and (<= main_~k~0 5) (<= 0 main_~k~0) (<= 0 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 + ~x~0; {2735#(and (<= main_~k~0 5) (<= 1 main_~c~0) (<= 0 main_~k~0))} is VALID [2022-04-27 14:38:24,575 INFO L290 TraceCheckUtils]: 19: Hoare triple {2735#(and (<= main_~k~0 5) (<= 1 main_~c~0) (<= 0 main_~k~0))} assume !false; {2735#(and (<= main_~k~0 5) (<= 1 main_~c~0) (<= 0 main_~k~0))} is VALID [2022-04-27 14:38:24,576 INFO L272 TraceCheckUtils]: 20: Hoare triple {2735#(and (<= main_~k~0 5) (<= 1 main_~c~0) (<= 0 main_~k~0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {2672#true} is VALID [2022-04-27 14:38:24,576 INFO L290 TraceCheckUtils]: 21: Hoare triple {2672#true} ~cond := #in~cond; {2672#true} is VALID [2022-04-27 14:38:24,576 INFO L290 TraceCheckUtils]: 22: Hoare triple {2672#true} assume !(0 == ~cond); {2672#true} is VALID [2022-04-27 14:38:24,576 INFO L290 TraceCheckUtils]: 23: Hoare triple {2672#true} assume true; {2672#true} is VALID [2022-04-27 14:38:24,576 INFO L284 TraceCheckUtils]: 24: Hoare quadruple {2672#true} {2735#(and (<= main_~k~0 5) (<= 1 main_~c~0) (<= 0 main_~k~0))} #54#return; {2735#(and (<= main_~k~0 5) (<= 1 main_~c~0) (<= 0 main_~k~0))} is VALID [2022-04-27 14:38:24,577 INFO L290 TraceCheckUtils]: 25: Hoare triple {2735#(and (<= main_~k~0 5) (<= 1 main_~c~0) (<= 0 main_~k~0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {2757#(and (<= main_~k~0 5) (<= 0 main_~k~0) (<= 2 main_~c~0))} is VALID [2022-04-27 14:38:24,577 INFO L290 TraceCheckUtils]: 26: Hoare triple {2757#(and (<= main_~k~0 5) (<= 0 main_~k~0) (<= 2 main_~c~0))} assume !false; {2757#(and (<= main_~k~0 5) (<= 0 main_~k~0) (<= 2 main_~c~0))} is VALID [2022-04-27 14:38:24,577 INFO L272 TraceCheckUtils]: 27: Hoare triple {2757#(and (<= main_~k~0 5) (<= 0 main_~k~0) (<= 2 main_~c~0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {2672#true} is VALID [2022-04-27 14:38:24,577 INFO L290 TraceCheckUtils]: 28: Hoare triple {2672#true} ~cond := #in~cond; {2672#true} is VALID [2022-04-27 14:38:24,577 INFO L290 TraceCheckUtils]: 29: Hoare triple {2672#true} assume !(0 == ~cond); {2672#true} is VALID [2022-04-27 14:38:24,578 INFO L290 TraceCheckUtils]: 30: Hoare triple {2672#true} assume true; {2672#true} is VALID [2022-04-27 14:38:24,578 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {2672#true} {2757#(and (<= main_~k~0 5) (<= 0 main_~k~0) (<= 2 main_~c~0))} #54#return; {2757#(and (<= main_~k~0 5) (<= 0 main_~k~0) (<= 2 main_~c~0))} is VALID [2022-04-27 14:38:24,579 INFO L290 TraceCheckUtils]: 32: Hoare triple {2757#(and (<= main_~k~0 5) (<= 0 main_~k~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 + ~x~0; {2779#(and (<= main_~k~0 5) (<= 0 main_~k~0) (<= 3 main_~c~0))} is VALID [2022-04-27 14:38:24,579 INFO L290 TraceCheckUtils]: 33: Hoare triple {2779#(and (<= main_~k~0 5) (<= 0 main_~k~0) (<= 3 main_~c~0))} assume !false; {2779#(and (<= main_~k~0 5) (<= 0 main_~k~0) (<= 3 main_~c~0))} is VALID [2022-04-27 14:38:24,579 INFO L272 TraceCheckUtils]: 34: Hoare triple {2779#(and (<= main_~k~0 5) (<= 0 main_~k~0) (<= 3 main_~c~0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {2672#true} is VALID [2022-04-27 14:38:24,579 INFO L290 TraceCheckUtils]: 35: Hoare triple {2672#true} ~cond := #in~cond; {2672#true} is VALID [2022-04-27 14:38:24,579 INFO L290 TraceCheckUtils]: 36: Hoare triple {2672#true} assume !(0 == ~cond); {2672#true} is VALID [2022-04-27 14:38:24,579 INFO L290 TraceCheckUtils]: 37: Hoare triple {2672#true} assume true; {2672#true} is VALID [2022-04-27 14:38:24,580 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {2672#true} {2779#(and (<= main_~k~0 5) (<= 0 main_~k~0) (<= 3 main_~c~0))} #54#return; {2779#(and (<= main_~k~0 5) (<= 0 main_~k~0) (<= 3 main_~c~0))} is VALID [2022-04-27 14:38:24,580 INFO L290 TraceCheckUtils]: 39: Hoare triple {2779#(and (<= main_~k~0 5) (<= 0 main_~k~0) (<= 3 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 + ~x~0; {2801#(and (<= main_~k~0 5) (<= 0 main_~k~0) (<= 4 main_~c~0))} is VALID [2022-04-27 14:38:24,581 INFO L290 TraceCheckUtils]: 40: Hoare triple {2801#(and (<= main_~k~0 5) (<= 0 main_~k~0) (<= 4 main_~c~0))} assume !false; {2801#(and (<= main_~k~0 5) (<= 0 main_~k~0) (<= 4 main_~c~0))} is VALID [2022-04-27 14:38:24,581 INFO L272 TraceCheckUtils]: 41: Hoare triple {2801#(and (<= main_~k~0 5) (<= 0 main_~k~0) (<= 4 main_~c~0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {2672#true} is VALID [2022-04-27 14:38:24,581 INFO L290 TraceCheckUtils]: 42: Hoare triple {2672#true} ~cond := #in~cond; {2672#true} is VALID [2022-04-27 14:38:24,581 INFO L290 TraceCheckUtils]: 43: Hoare triple {2672#true} assume !(0 == ~cond); {2672#true} is VALID [2022-04-27 14:38:24,581 INFO L290 TraceCheckUtils]: 44: Hoare triple {2672#true} assume true; {2672#true} is VALID [2022-04-27 14:38:24,581 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {2672#true} {2801#(and (<= main_~k~0 5) (<= 0 main_~k~0) (<= 4 main_~c~0))} #54#return; {2801#(and (<= main_~k~0 5) (<= 0 main_~k~0) (<= 4 main_~c~0))} is VALID [2022-04-27 14:38:24,582 INFO L290 TraceCheckUtils]: 46: Hoare triple {2801#(and (<= main_~k~0 5) (<= 0 main_~k~0) (<= 4 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 + ~x~0; {2823#(and (<= main_~k~0 5) (<= 0 main_~k~0) (<= 5 main_~c~0))} is VALID [2022-04-27 14:38:24,582 INFO L290 TraceCheckUtils]: 47: Hoare triple {2823#(and (<= main_~k~0 5) (<= 0 main_~k~0) (<= 5 main_~c~0))} assume !false; {2823#(and (<= main_~k~0 5) (<= 0 main_~k~0) (<= 5 main_~c~0))} is VALID [2022-04-27 14:38:24,582 INFO L272 TraceCheckUtils]: 48: Hoare triple {2823#(and (<= main_~k~0 5) (<= 0 main_~k~0) (<= 5 main_~c~0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {2672#true} is VALID [2022-04-27 14:38:24,583 INFO L290 TraceCheckUtils]: 49: Hoare triple {2672#true} ~cond := #in~cond; {2672#true} is VALID [2022-04-27 14:38:24,583 INFO L290 TraceCheckUtils]: 50: Hoare triple {2672#true} assume !(0 == ~cond); {2672#true} is VALID [2022-04-27 14:38:24,583 INFO L290 TraceCheckUtils]: 51: Hoare triple {2672#true} assume true; {2672#true} is VALID [2022-04-27 14:38:24,583 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {2672#true} {2823#(and (<= main_~k~0 5) (<= 0 main_~k~0) (<= 5 main_~c~0))} #54#return; {2823#(and (<= main_~k~0 5) (<= 0 main_~k~0) (<= 5 main_~c~0))} is VALID [2022-04-27 14:38:24,584 INFO L290 TraceCheckUtils]: 53: Hoare triple {2823#(and (<= main_~k~0 5) (<= 0 main_~k~0) (<= 5 main_~c~0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {2673#false} is VALID [2022-04-27 14:38:24,584 INFO L290 TraceCheckUtils]: 54: Hoare triple {2673#false} assume !false; {2673#false} is VALID [2022-04-27 14:38:24,584 INFO L272 TraceCheckUtils]: 55: Hoare triple {2673#false} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {2673#false} is VALID [2022-04-27 14:38:24,584 INFO L290 TraceCheckUtils]: 56: Hoare triple {2673#false} ~cond := #in~cond; {2673#false} is VALID [2022-04-27 14:38:24,584 INFO L290 TraceCheckUtils]: 57: Hoare triple {2673#false} assume !(0 == ~cond); {2673#false} is VALID [2022-04-27 14:38:24,584 INFO L290 TraceCheckUtils]: 58: Hoare triple {2673#false} assume true; {2673#false} is VALID [2022-04-27 14:38:24,584 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {2673#false} {2673#false} #54#return; {2673#false} is VALID [2022-04-27 14:38:24,584 INFO L290 TraceCheckUtils]: 60: Hoare triple {2673#false} assume !(~c~0 < ~k~0); {2673#false} is VALID [2022-04-27 14:38:24,584 INFO L272 TraceCheckUtils]: 61: Hoare triple {2673#false} call __VERIFIER_assert((if 0 == ~k~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {2673#false} is VALID [2022-04-27 14:38:24,584 INFO L290 TraceCheckUtils]: 62: Hoare triple {2673#false} ~cond := #in~cond; {2673#false} is VALID [2022-04-27 14:38:24,584 INFO L290 TraceCheckUtils]: 63: Hoare triple {2673#false} assume 0 == ~cond; {2673#false} is VALID [2022-04-27 14:38:24,585 INFO L290 TraceCheckUtils]: 64: Hoare triple {2673#false} assume !false; {2673#false} is VALID [2022-04-27 14:38:24,585 INFO L134 CoverageAnalysis]: Checked inductivity of 161 backedges. 99 proven. 0 refuted. 0 times theorem prover too weak. 62 trivial. 0 not checked. [2022-04-27 14:38:24,585 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-27 14:38:24,585 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 14:38:24,585 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2137345085] [2022-04-27 14:38:24,585 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 14:38:24,585 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [588006387] [2022-04-27 14:38:24,585 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [588006387] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 14:38:24,585 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 14:38:24,585 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-04-27 14:38:24,585 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1290510660] [2022-04-27 14:38:24,585 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 14:38:24,586 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.6363636363636362) internal successors, (29), 10 states have internal predecessors, (29), 8 states have call successors, (11), 2 states have call predecessors, (11), 3 states have return successors, (9), 9 states have call predecessors, (9), 8 states have call successors, (9) Word has length 65 [2022-04-27 14:38:24,587 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 14:38:24,587 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 11 states, 11 states have (on average 2.6363636363636362) internal successors, (29), 10 states have internal predecessors, (29), 8 states have call successors, (11), 2 states have call predecessors, (11), 3 states have return successors, (9), 9 states have call predecessors, (9), 8 states have call successors, (9) [2022-04-27 14:38:24,620 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 49 edges. 49 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 14:38:24,620 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-04-27 14:38:24,620 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 14:38:24,620 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-04-27 14:38:24,620 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2022-04-27 14:38:24,620 INFO L87 Difference]: Start difference. First operand 46 states and 51 transitions. Second operand has 11 states, 11 states have (on average 2.6363636363636362) internal successors, (29), 10 states have internal predecessors, (29), 8 states have call successors, (11), 2 states have call predecessors, (11), 3 states have return successors, (9), 9 states have call predecessors, (9), 8 states have call successors, (9) [2022-04-27 14:38:24,796 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:38:24,796 INFO L93 Difference]: Finished difference Result 50 states and 54 transitions. [2022-04-27 14:38:24,796 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-04-27 14:38:24,796 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.6363636363636362) internal successors, (29), 10 states have internal predecessors, (29), 8 states have call successors, (11), 2 states have call predecessors, (11), 3 states have return successors, (9), 9 states have call predecessors, (9), 8 states have call successors, (9) Word has length 65 [2022-04-27 14:38:24,796 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 14:38:24,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 2.6363636363636362) internal successors, (29), 10 states have internal predecessors, (29), 8 states have call successors, (11), 2 states have call predecessors, (11), 3 states have return successors, (9), 9 states have call predecessors, (9), 8 states have call successors, (9) [2022-04-27 14:38:24,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 50 transitions. [2022-04-27 14:38:24,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 2.6363636363636362) internal successors, (29), 10 states have internal predecessors, (29), 8 states have call successors, (11), 2 states have call predecessors, (11), 3 states have return successors, (9), 9 states have call predecessors, (9), 8 states have call successors, (9) [2022-04-27 14:38:24,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 50 transitions. [2022-04-27 14:38:24,799 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 11 states and 50 transitions. [2022-04-27 14:38:24,830 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-27 14:38:24,831 INFO L225 Difference]: With dead ends: 50 [2022-04-27 14:38:24,831 INFO L226 Difference]: Without dead ends: 0 [2022-04-27 14:38:24,831 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=44, Invalid=88, Unknown=0, NotChecked=0, Total=132 [2022-04-27 14:38:24,831 INFO L413 NwaCegarLoop]: 31 mSDtfsCounter, 4 mSDsluCounter, 98 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 129 SdHoareTripleChecker+Invalid, 56 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 14:38:24,832 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 129 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 14:38:24,832 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-04-27 14:38:24,832 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-04-27 14:38:24,832 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 14:38:24,832 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-27 14:38:24,832 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-27 14:38:24,832 INFO L87 Difference]: Start difference. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-27 14:38:24,832 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:38:24,832 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-27 14:38:24,832 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-27 14:38:24,832 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:38:24,832 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 14:38:24,833 INFO L74 IsIncluded]: Start isIncluded. First operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 0 states. [2022-04-27 14:38:24,833 INFO L87 Difference]: Start difference. First operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 0 states. [2022-04-27 14:38:24,833 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:38:24,833 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-27 14:38:24,833 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-27 14:38:24,833 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:38:24,833 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 14:38:24,833 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 14:38:24,833 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 14:38:24,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-27 14:38:24,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-04-27 14:38:24,833 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 65 [2022-04-27 14:38:24,833 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 14:38:24,833 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-04-27 14:38:24,833 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.6363636363636362) internal successors, (29), 10 states have internal predecessors, (29), 8 states have call successors, (11), 2 states have call predecessors, (11), 3 states have return successors, (9), 9 states have call predecessors, (9), 8 states have call successors, (9) [2022-04-27 14:38:24,834 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-27 14:38:24,834 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:38:24,835 INFO L805 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-04-27 14:38:24,840 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-04-27 14:38:25,036 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable8 [2022-04-27 14:38:25,037 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-04-27 14:38:25,376 INFO L899 garLoopResultBuilder]: For program point reach_errorEXIT(line 3) no Hoare annotation was computed. [2022-04-27 14:38:25,376 INFO L899 garLoopResultBuilder]: For program point reach_errorENTRY(line 3) no Hoare annotation was computed. [2022-04-27 14:38:25,376 INFO L899 garLoopResultBuilder]: For program point reach_errorFINAL(line 3) no Hoare annotation was computed. [2022-04-27 14:38:25,376 INFO L902 garLoopResultBuilder]: At program point assume_abort_if_notENTRY(lines 6 8) the Hoare annotation is: true [2022-04-27 14:38:25,376 INFO L899 garLoopResultBuilder]: For program point L7(line 7) no Hoare annotation was computed. [2022-04-27 14:38:25,376 INFO L899 garLoopResultBuilder]: For program point L7-2(lines 6 8) no Hoare annotation was computed. [2022-04-27 14:38:25,376 INFO L899 garLoopResultBuilder]: For program point assume_abort_if_notEXIT(lines 6 8) no Hoare annotation was computed. [2022-04-27 14:38:25,376 INFO L902 garLoopResultBuilder]: At program point mainENTRY(lines 17 40) the Hoare annotation is: true [2022-04-27 14:38:25,376 INFO L895 garLoopResultBuilder]: At program point L28(line 28) the Hoare annotation is: (let ((.cse0 (<= main_~k~0 5)) (.cse1 (= (+ (* main_~y~0 main_~y~0 main_~y~0 main_~y~0) (* main_~y~0 main_~y~0) (* (* main_~y~0 main_~y~0 main_~y~0) 2)) (* main_~x~0 4)))) (or (and .cse0 (= main_~y~0 1) (< 0 main_~k~0) .cse1 (= main_~c~0 1)) (and .cse0 (= main_~y~0 4) (= main_~c~0 4) (< 3 main_~k~0) .cse1) (and (<= main_~c~0 5) .cse0 (= 5 main_~y~0) .cse1 (<= 5 main_~c~0) (< 4 main_~k~0)) (and .cse0 (<= 0 main_~k~0) (= main_~c~0 0) (= main_~y~0 0) .cse1) (and .cse0 (= main_~y~0 3) (< 2 main_~k~0) .cse1 (= main_~c~0 3)) (and (= main_~y~0 2) .cse0 (< 1 main_~k~0) (= main_~c~0 2) .cse1))) [2022-04-27 14:38:25,376 INFO L899 garLoopResultBuilder]: For program point L28-1(lines 27 36) no Hoare annotation was computed. [2022-04-27 14:38:25,376 INFO L895 garLoopResultBuilder]: At program point L27-2(lines 27 36) the Hoare annotation is: (let ((.cse0 (<= main_~k~0 5)) (.cse1 (= (+ (* main_~y~0 main_~y~0 main_~y~0 main_~y~0) (* main_~y~0 main_~y~0) (* (* main_~y~0 main_~y~0 main_~y~0) 2)) (* main_~x~0 4)))) (or (and .cse0 (= main_~y~0 1) (< 0 main_~k~0) .cse1 (= main_~c~0 1)) (and .cse0 (= main_~y~0 4) (= main_~c~0 4) (< 3 main_~k~0) .cse1) (and (<= main_~c~0 5) .cse0 (= 5 main_~y~0) .cse1 (<= 5 main_~c~0) (< 4 main_~k~0)) (and .cse0 (<= 0 main_~k~0) (= main_~c~0 0) (= main_~y~0 0) .cse1) (and .cse0 (= main_~y~0 3) (< 2 main_~k~0) .cse1 (= main_~c~0 3)) (and (= main_~y~0 2) .cse0 (< 1 main_~k~0) (= main_~c~0 2) .cse1))) [2022-04-27 14:38:25,376 INFO L899 garLoopResultBuilder]: For program point mainEXIT(lines 17 40) no Hoare annotation was computed. [2022-04-27 14:38:25,377 INFO L895 garLoopResultBuilder]: At program point L27-3(lines 27 36) the Hoare annotation is: (let ((.cse1 (+ (- 1) main_~y~0)) (.cse0 (= (+ (* main_~y~0 main_~y~0 main_~y~0 main_~y~0) (* main_~y~0 main_~y~0) (* (* main_~y~0 main_~y~0 main_~y~0) 2)) (* main_~x~0 4)))) (or (and (= main_~x~0 0) (= main_~y~0 0)) (and (<= main_~c~0 3) (<= main_~k~0 3) (= (+ main_~y~0 (- 3)) 0) (< 2 main_~k~0) .cse0) (and (< 1 main_~k~0) (= .cse1 1) (<= main_~k~0 2) (<= main_~c~0 2) .cse0) (and (= .cse1 0) (<= main_~k~0 1) (< 0 main_~k~0) .cse0 (<= main_~c~0 1)) (and (= main_~y~0 4) (< 3 main_~k~0) (<= main_~k~0 4) .cse0 (<= main_~c~0 4)) (and (<= main_~c~0 5) (<= main_~k~0 5) (= (+ (- 2) main_~y~0) 3) .cse0 (< 4 main_~k~0)))) [2022-04-27 14:38:25,377 INFO L902 garLoopResultBuilder]: At program point L21(line 21) the Hoare annotation is: true [2022-04-27 14:38:25,377 INFO L899 garLoopResultBuilder]: For program point L21-1(line 21) no Hoare annotation was computed. [2022-04-27 14:38:25,377 INFO L899 garLoopResultBuilder]: For program point mainFINAL(lines 17 40) no Hoare annotation was computed. [2022-04-27 14:38:25,377 INFO L899 garLoopResultBuilder]: For program point L38(line 38) no Hoare annotation was computed. [2022-04-27 14:38:25,377 INFO L895 garLoopResultBuilder]: At program point L37(line 37) the Hoare annotation is: (= (+ (* main_~y~0 main_~y~0 main_~y~0 main_~y~0) (* main_~y~0 main_~y~0) (* (* main_~y~0 main_~y~0 main_~y~0) 2)) (* main_~x~0 4)) [2022-04-27 14:38:25,377 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2022-04-27 14:38:25,377 INFO L895 garLoopResultBuilder]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|)) [2022-04-27 14:38:25,377 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2022-04-27 14:38:25,377 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-04-27 14:38:25,377 INFO L902 garLoopResultBuilder]: At program point L-1(line -1) the Hoare annotation is: true [2022-04-27 14:38:25,377 INFO L902 garLoopResultBuilder]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2022-04-27 14:38:25,377 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2022-04-27 14:38:25,377 INFO L902 garLoopResultBuilder]: At program point __VERIFIER_assertENTRY(lines 9 15) the Hoare annotation is: true [2022-04-27 14:38:25,377 INFO L899 garLoopResultBuilder]: For program point L11(lines 11 12) no Hoare annotation was computed. [2022-04-27 14:38:25,377 INFO L899 garLoopResultBuilder]: For program point L10(lines 10 13) no Hoare annotation was computed. [2022-04-27 14:38:25,377 INFO L899 garLoopResultBuilder]: For program point __VERIFIER_assertEXIT(lines 9 15) no Hoare annotation was computed. [2022-04-27 14:38:25,377 INFO L899 garLoopResultBuilder]: For program point L10-2(lines 9 15) no Hoare annotation was computed. [2022-04-27 14:38:25,378 INFO L899 garLoopResultBuilder]: For program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 12) no Hoare annotation was computed. [2022-04-27 14:38:25,379 INFO L356 BasicCegarLoop]: Path program histogram: [6, 1, 1, 1] [2022-04-27 14:38:25,381 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-04-27 14:38:25,383 WARN L170 areAnnotationChecker]: reach_errorENTRY has no Hoare annotation [2022-04-27 14:38:25,383 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2022-04-27 14:38:25,383 WARN L170 areAnnotationChecker]: L7 has no Hoare annotation [2022-04-27 14:38:25,384 WARN L170 areAnnotationChecker]: L10 has no Hoare annotation [2022-04-27 14:38:25,384 WARN L170 areAnnotationChecker]: reach_errorFINAL has no Hoare annotation [2022-04-27 14:38:25,384 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2022-04-27 14:38:25,384 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2022-04-27 14:38:25,384 WARN L170 areAnnotationChecker]: L7 has no Hoare annotation [2022-04-27 14:38:25,384 WARN L170 areAnnotationChecker]: L7 has no Hoare annotation [2022-04-27 14:38:25,384 WARN L170 areAnnotationChecker]: L21-1 has no Hoare annotation [2022-04-27 14:38:25,384 WARN L170 areAnnotationChecker]: L10 has no Hoare annotation [2022-04-27 14:38:25,384 WARN L170 areAnnotationChecker]: L10 has no Hoare annotation [2022-04-27 14:38:25,384 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2022-04-27 14:38:25,384 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2022-04-27 14:38:25,384 WARN L170 areAnnotationChecker]: L7-2 has no Hoare annotation [2022-04-27 14:38:25,384 WARN L170 areAnnotationChecker]: L21-1 has no Hoare annotation [2022-04-27 14:38:25,384 WARN L170 areAnnotationChecker]: L11 has no Hoare annotation [2022-04-27 14:38:25,384 WARN L170 areAnnotationChecker]: L11 has no Hoare annotation [2022-04-27 14:38:25,384 WARN L170 areAnnotationChecker]: L10-2 has no Hoare annotation [2022-04-27 14:38:25,384 WARN L170 areAnnotationChecker]: assume_abort_if_notEXIT has no Hoare annotation [2022-04-27 14:38:25,391 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-27 14:38:25,391 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-27 14:38:25,391 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-27 14:38:25,391 WARN L170 areAnnotationChecker]: L28-1 has no Hoare annotation [2022-04-27 14:38:25,391 WARN L170 areAnnotationChecker]: L28-1 has no Hoare annotation [2022-04-27 14:38:25,391 WARN L170 areAnnotationChecker]: L28-1 has no Hoare annotation [2022-04-27 14:38:25,391 WARN L170 areAnnotationChecker]: L38 has no Hoare annotation [2022-04-27 14:38:25,391 WARN L170 areAnnotationChecker]: L38 has no Hoare annotation [2022-04-27 14:38:25,391 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2022-04-27 14:38:25,391 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2022-04-27 14:38:25,391 INFO L163 areAnnotationChecker]: CFG has 10 edges. 10 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2022-04-27 14:38:25,398 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.04 02:38:25 BoogieIcfgContainer [2022-04-27 14:38:25,398 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-04-27 14:38:25,399 INFO L158 Benchmark]: Toolchain (without parser) took 11638.24ms. Allocated memory was 216.0MB in the beginning and 312.5MB in the end (delta: 96.5MB). Free memory was 188.1MB in the beginning and 134.1MB in the end (delta: 54.0MB). Peak memory consumption was 149.9MB. Max. memory is 8.0GB. [2022-04-27 14:38:25,399 INFO L158 Benchmark]: CDTParser took 0.08ms. Allocated memory is still 216.0MB. Free memory is still 176.0MB. There was no memory consumed. Max. memory is 8.0GB. [2022-04-27 14:38:25,399 INFO L158 Benchmark]: CACSL2BoogieTranslator took 165.92ms. Allocated memory is still 216.0MB. Free memory was 187.9MB in the beginning and 186.4MB in the end (delta: 1.5MB). Peak memory consumption was 10.1MB. Max. memory is 8.0GB. [2022-04-27 14:38:25,399 INFO L158 Benchmark]: Boogie Preprocessor took 28.63ms. Allocated memory is still 216.0MB. Free memory was 186.4MB in the beginning and 184.8MB in the end (delta: 1.5MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-04-27 14:38:25,400 INFO L158 Benchmark]: RCFGBuilder took 232.67ms. Allocated memory is still 216.0MB. Free memory was 184.8MB in the beginning and 174.2MB in the end (delta: 10.7MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. [2022-04-27 14:38:25,400 INFO L158 Benchmark]: TraceAbstraction took 11207.64ms. Allocated memory was 216.0MB in the beginning and 312.5MB in the end (delta: 96.5MB). Free memory was 173.6MB in the beginning and 134.1MB in the end (delta: 39.6MB). Peak memory consumption was 136.6MB. Max. memory is 8.0GB. [2022-04-27 14:38:25,401 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - AssertionsEnabledResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.08ms. Allocated memory is still 216.0MB. Free memory is still 176.0MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 165.92ms. Allocated memory is still 216.0MB. Free memory was 187.9MB in the beginning and 186.4MB in the end (delta: 1.5MB). Peak memory consumption was 10.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 28.63ms. Allocated memory is still 216.0MB. Free memory was 186.4MB in the beginning and 184.8MB in the end (delta: 1.5MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 232.67ms. Allocated memory is still 216.0MB. Free memory was 184.8MB in the beginning and 174.2MB in the end (delta: 10.7MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. * TraceAbstraction took 11207.64ms. Allocated memory was 216.0MB in the beginning and 312.5MB in the end (delta: 96.5MB). Free memory was 173.6MB in the beginning and 134.1MB in the end (delta: 39.6MB). Peak memory consumption was 136.6MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 12]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 6 procedures, 31 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 11.1s, OverallIterations: 9, TraceHistogramMax: 8, PathProgramHistogramMax: 6, EmptinessCheckTime: 0.0s, AutomataDifference: 3.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.3s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 48 SdHoareTripleChecker+Valid, 0.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 41 mSDsluCounter, 1180 SdHoareTripleChecker+Invalid, 0.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 925 mSDsCounter, 15 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 680 IncrementalHoareTripleChecker+Invalid, 695 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 15 mSolverCounterUnsat, 255 mSDtfsCounter, 680 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 427 GetRequests, 339 SyntacticMatches, 7 SemanticMatches, 81 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=46occurred in iteration=8, InterpolantAutomatonStates: 69, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 9 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 11 LocationsWithAnnotation, 29 PreInvPairs, 49 NumberOfFragments, 600 HoareAnnotationTreeSize, 29 FomulaSimplifications, 180 FormulaSimplificationTreeSizeReduction, 0.1s HoareSimplificationTime, 11 FomulaSimplificationsInter, 14 FormulaSimplificationTreeSizeReductionInter, 0.2s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 4.3s InterpolantComputationTime, 343 NumberOfCodeBlocks, 341 NumberOfCodeBlocksAsserted, 24 NumberOfCheckSat, 357 ConstructedInterpolants, 0 QuantifiedInterpolants, 1287 SizeOfPredicates, 13 NumberOfNonLiveVariables, 951 ConjunctsInSsa, 130 ConjunctsInUnsatCore, 10 InterpolantComputations, 4 PerfectInterpolantSequences, 347/454 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 27]: Loop Invariant Derived loop invariant: ((((((((k <= 5 && y == 1) && 0 < k) && y * y * y * y + y * y + y * y * y * 2 == x * 4) && c == 1) || ((((k <= 5 && y == 4) && c == 4) && 3 < k) && y * y * y * y + y * y + y * y * y * 2 == x * 4)) || (((((c <= 5 && k <= 5) && 5 == y) && y * y * y * y + y * y + y * y * y * 2 == x * 4) && 5 <= c) && 4 < k)) || ((((k <= 5 && 0 <= k) && c == 0) && y == 0) && y * y * y * y + y * y + y * y * y * 2 == x * 4)) || ((((k <= 5 && y == 3) && 2 < k) && y * y * y * y + y * y + y * y * y * 2 == x * 4) && c == 3)) || ((((y == 2 && k <= 5) && 1 < k) && c == 2) && y * y * y * y + y * y + y * y * y * 2 == x * 4) RESULT: Ultimate proved your program to be correct! [2022-04-27 14:38:25,413 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...