/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/ps5-ll_valuebound20.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-e106359-m [2022-04-14 17:41:26,144 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-14 17:41:26,145 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-14 17:41:26,177 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-14 17:41:26,177 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-14 17:41:26,178 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-14 17:41:26,180 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-14 17:41:26,181 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-14 17:41:26,182 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-14 17:41:26,185 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-14 17:41:26,186 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-14 17:41:26,187 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-14 17:41:26,187 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-14 17:41:26,189 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-14 17:41:26,189 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-14 17:41:26,192 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-14 17:41:26,193 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-14 17:41:26,194 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-14 17:41:26,195 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-14 17:41:26,199 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-14 17:41:26,200 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-14 17:41:26,201 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-14 17:41:26,201 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-14 17:41:26,202 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-14 17:41:26,203 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-14 17:41:26,207 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-14 17:41:26,207 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-14 17:41:26,207 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-14 17:41:26,207 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-14 17:41:26,208 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-14 17:41:26,209 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-14 17:41:26,209 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-14 17:41:26,210 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-14 17:41:26,210 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-14 17:41:26,210 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-14 17:41:26,211 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-14 17:41:26,211 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-14 17:41:26,211 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-14 17:41:26,212 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-14 17:41:26,212 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-14 17:41:26,212 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-14 17:41:26,213 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-14 17:41:26,214 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2022-04-14 17:41:26,235 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-14 17:41:26,235 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-14 17:41:26,235 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-04-14 17:41:26,235 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-04-14 17:41:26,236 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-04-14 17:41:26,236 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-04-14 17:41:26,236 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-04-14 17:41:26,236 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-04-14 17:41:26,237 INFO L138 SettingsManager]: * Use SBE=true [2022-04-14 17:41:26,237 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-14 17:41:26,237 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-14 17:41:26,237 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-14 17:41:26,237 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-14 17:41:26,237 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-14 17:41:26,237 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-14 17:41:26,238 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-14 17:41:26,238 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-14 17:41:26,238 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-14 17:41:26,239 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-14 17:41:26,239 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-14 17:41:26,239 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-14 17:41:26,239 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-14 17:41:26,239 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-14 17:41:26,239 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-14 17:41:26,239 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-14 17:41:26,239 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-14 17:41:26,239 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-04-14 17:41:26,239 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-04-14 17:41:26,239 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-04-14 17:41:26,239 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-04-14 17:41:26,240 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-04-14 17:41:26,240 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-04-14 17:41:26,240 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-14 17:41:26,240 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.core: Log level for class -> de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN; [2022-04-14 17:41:26,406 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-14 17:41:26,422 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-14 17:41:26,423 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-14 17:41:26,424 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-14 17:41:26,424 INFO L275 PluginConnector]: CDTParser initialized [2022-04-14 17:41:26,425 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/nla-digbench-scaling/ps5-ll_valuebound20.c [2022-04-14 17:41:26,463 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f990d899a/be64699f4a3c4927a9b35badff5a53cb/FLAG17ff0f552 [2022-04-14 17:41:26,819 INFO L306 CDTParser]: Found 1 translation units. [2022-04-14 17:41:26,819 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/ps5-ll_valuebound20.c [2022-04-14 17:41:26,823 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f990d899a/be64699f4a3c4927a9b35badff5a53cb/FLAG17ff0f552 [2022-04-14 17:41:26,831 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f990d899a/be64699f4a3c4927a9b35badff5a53cb [2022-04-14 17:41:26,833 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-14 17:41:26,834 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-14 17:41:26,836 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-14 17:41:26,836 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-14 17:41:26,838 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-14 17:41:26,839 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.04 05:41:26" (1/1) ... [2022-04-14 17:41:26,839 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2a2fd215 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 05:41:26, skipping insertion in model container [2022-04-14 17:41:26,839 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.04 05:41:26" (1/1) ... [2022-04-14 17:41:26,844 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-14 17:41:26,854 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-14 17:41:26,999 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/ps5-ll_valuebound20.c[458,471] [2022-04-14 17:41:27,022 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-14 17:41:27,029 INFO L203 MainTranslator]: Completed pre-run [2022-04-14 17:41:27,039 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/ps5-ll_valuebound20.c[458,471] [2022-04-14 17:41:27,056 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-14 17:41:27,064 INFO L208 MainTranslator]: Completed translation [2022-04-14 17:41:27,064 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 05:41:27 WrapperNode [2022-04-14 17:41:27,064 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-14 17:41:27,065 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-14 17:41:27,065 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-14 17:41:27,065 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-14 17:41:27,072 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 05:41:27" (1/1) ... [2022-04-14 17:41:27,072 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 05:41:27" (1/1) ... [2022-04-14 17:41:27,078 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 05:41:27" (1/1) ... [2022-04-14 17:41:27,078 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 05:41:27" (1/1) ... [2022-04-14 17:41:27,091 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 05:41:27" (1/1) ... [2022-04-14 17:41:27,094 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 05:41:27" (1/1) ... [2022-04-14 17:41:27,095 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 05:41:27" (1/1) ... [2022-04-14 17:41:27,096 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-14 17:41:27,096 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-14 17:41:27,096 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-14 17:41:27,097 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-14 17:41:27,097 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 05:41:27" (1/1) ... [2022-04-14 17:41:27,103 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-14 17:41:27,109 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-14 17:41:27,117 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-04-14 17:41:27,122 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-04-14 17:41:27,139 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-14 17:41:27,139 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-14 17:41:27,139 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-14 17:41:27,139 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-14 17:41:27,139 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-14 17:41:27,139 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-14 17:41:27,139 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-14 17:41:27,139 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-14 17:41:27,140 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-14 17:41:27,140 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-14 17:41:27,140 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_short [2022-04-14 17:41:27,140 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-14 17:41:27,140 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-14 17:41:27,140 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-14 17:41:27,140 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-14 17:41:27,140 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-14 17:41:27,140 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-14 17:41:27,140 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-14 17:41:27,140 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-14 17:41:27,140 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-14 17:41:27,182 INFO L234 CfgBuilder]: Building ICFG [2022-04-14 17:41:27,183 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-14 17:41:27,291 INFO L275 CfgBuilder]: Performing block encoding [2022-04-14 17:41:27,295 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-14 17:41:27,295 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-14 17:41:27,296 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.04 05:41:27 BoogieIcfgContainer [2022-04-14 17:41:27,296 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-14 17:41:27,297 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-14 17:41:27,297 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-14 17:41:27,299 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-14 17:41:27,299 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.04 05:41:26" (1/3) ... [2022-04-14 17:41:27,300 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@20ab6387 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.04 05:41:27, skipping insertion in model container [2022-04-14 17:41:27,300 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 05:41:27" (2/3) ... [2022-04-14 17:41:27,300 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@20ab6387 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.04 05:41:27, skipping insertion in model container [2022-04-14 17:41:27,300 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.04 05:41:27" (3/3) ... [2022-04-14 17:41:27,301 INFO L111 eAbstractionObserver]: Analyzing ICFG ps5-ll_valuebound20.c [2022-04-14 17:41:27,304 INFO L202 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-04-14 17:41:27,304 INFO L161 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-14 17:41:27,329 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-14 17:41:27,333 INFO L340 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP [2022-04-14 17:41:27,333 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-14 17:41:27,344 INFO L276 IsEmpty]: Start isEmpty. Operand has 29 states, 16 states have (on average 1.375) internal successors, (22), 17 states have internal predecessors, (22), 7 states have call successors, (7), 4 states have call predecessors, (7), 4 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-14 17:41:27,347 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-04-14 17:41:27,347 INFO L491 BasicCegarLoop]: Found error trace [2022-04-14 17:41:27,347 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-14 17:41:27,348 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-14 17:41:27,350 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-14 17:41:27,351 INFO L85 PathProgramCache]: Analyzing trace with hash 1098891495, now seen corresponding path program 1 times [2022-04-14 17:41:27,356 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-14 17:41:27,356 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1137618003] [2022-04-14 17:41:27,356 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 17:41:27,357 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-14 17:41:27,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 17:41:27,469 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-14 17:41:27,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 17:41:27,482 INFO L290 TraceCheckUtils]: 0: Hoare triple {45#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3); {32#true} is VALID [2022-04-14 17:41:27,482 INFO L290 TraceCheckUtils]: 1: Hoare triple {32#true} assume true; {32#true} is VALID [2022-04-14 17:41:27,482 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {32#true} {32#true} #63#return; {32#true} is VALID [2022-04-14 17:41:27,483 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-14 17:41:27,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 17:41:27,489 INFO L290 TraceCheckUtils]: 0: Hoare triple {32#true} ~cond := #in~cond; {32#true} is VALID [2022-04-14 17:41:27,490 INFO L290 TraceCheckUtils]: 1: Hoare triple {32#true} assume 0 == ~cond;assume false; {33#false} is VALID [2022-04-14 17:41:27,490 INFO L290 TraceCheckUtils]: 2: Hoare triple {33#false} assume true; {33#false} is VALID [2022-04-14 17:41:27,490 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {33#false} {32#true} #53#return; {33#false} is VALID [2022-04-14 17:41:27,490 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-04-14 17:41:27,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 17:41:27,496 INFO L290 TraceCheckUtils]: 0: Hoare triple {32#true} ~cond := #in~cond; {32#true} is VALID [2022-04-14 17:41:27,496 INFO L290 TraceCheckUtils]: 1: Hoare triple {32#true} assume 0 == ~cond;assume false; {33#false} is VALID [2022-04-14 17:41:27,496 INFO L290 TraceCheckUtils]: 2: Hoare triple {33#false} assume true; {33#false} is VALID [2022-04-14 17:41:27,497 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {33#false} {33#false} #55#return; {33#false} is VALID [2022-04-14 17:41:27,497 INFO L272 TraceCheckUtils]: 0: Hoare triple {32#true} call ULTIMATE.init(); {45#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-14 17:41:27,498 INFO L290 TraceCheckUtils]: 1: Hoare triple {45#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3); {32#true} is VALID [2022-04-14 17:41:27,498 INFO L290 TraceCheckUtils]: 2: Hoare triple {32#true} assume true; {32#true} is VALID [2022-04-14 17:41:27,498 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {32#true} {32#true} #63#return; {32#true} is VALID [2022-04-14 17:41:27,498 INFO L272 TraceCheckUtils]: 4: Hoare triple {32#true} call #t~ret5 := main(); {32#true} is VALID [2022-04-14 17:41:27,498 INFO L290 TraceCheckUtils]: 5: Hoare triple {32#true} havoc ~k~0;havoc ~y~0;havoc ~x~0;havoc ~c~0;assume -32768 <= #t~nondet4 && #t~nondet4 <= 32767;~k~0 := #t~nondet4;havoc #t~nondet4; {32#true} is VALID [2022-04-14 17:41:27,498 INFO L272 TraceCheckUtils]: 6: Hoare triple {32#true} call assume_abort_if_not((if ~k~0 >= 0 && ~k~0 <= 20 then 1 else 0)); {32#true} is VALID [2022-04-14 17:41:27,498 INFO L290 TraceCheckUtils]: 7: Hoare triple {32#true} ~cond := #in~cond; {32#true} is VALID [2022-04-14 17:41:27,499 INFO L290 TraceCheckUtils]: 8: Hoare triple {32#true} assume 0 == ~cond;assume false; {33#false} is VALID [2022-04-14 17:41:27,499 INFO L290 TraceCheckUtils]: 9: Hoare triple {33#false} assume true; {33#false} is VALID [2022-04-14 17:41:27,499 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {33#false} {32#true} #53#return; {33#false} is VALID [2022-04-14 17:41:27,499 INFO L272 TraceCheckUtils]: 11: Hoare triple {33#false} call assume_abort_if_not((if ~k~0 <= 256 then 1 else 0)); {32#true} is VALID [2022-04-14 17:41:27,499 INFO L290 TraceCheckUtils]: 12: Hoare triple {32#true} ~cond := #in~cond; {32#true} is VALID [2022-04-14 17:41:27,500 INFO L290 TraceCheckUtils]: 13: Hoare triple {32#true} assume 0 == ~cond;assume false; {33#false} is VALID [2022-04-14 17:41:27,500 INFO L290 TraceCheckUtils]: 14: Hoare triple {33#false} assume true; {33#false} is VALID [2022-04-14 17:41:27,500 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {33#false} {33#false} #55#return; {33#false} is VALID [2022-04-14 17:41:27,500 INFO L290 TraceCheckUtils]: 16: Hoare triple {33#false} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {33#false} is VALID [2022-04-14 17:41:27,500 INFO L290 TraceCheckUtils]: 17: Hoare triple {33#false} assume false; {33#false} is VALID [2022-04-14 17:41:27,501 INFO L272 TraceCheckUtils]: 18: Hoare triple {33#false} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {33#false} is VALID [2022-04-14 17:41:27,501 INFO L290 TraceCheckUtils]: 19: Hoare triple {33#false} ~cond := #in~cond; {33#false} is VALID [2022-04-14 17:41:27,501 INFO L290 TraceCheckUtils]: 20: Hoare triple {33#false} assume 0 == ~cond; {33#false} is VALID [2022-04-14 17:41:27,501 INFO L290 TraceCheckUtils]: 21: Hoare triple {33#false} assume !false; {33#false} is VALID [2022-04-14 17:41:27,501 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-14 17:41:27,502 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-14 17:41:27,502 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1137618003] [2022-04-14 17:41:27,502 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1137618003] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-14 17:41:27,502 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-14 17:41:27,503 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-14 17:41:27,503 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [909475442] [2022-04-14 17:41:27,504 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-14 17:41:27,507 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 22 [2022-04-14 17:41:27,508 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-14 17:41:27,510 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-14 17:41:27,529 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 19 edges. 19 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-14 17:41:27,530 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-14 17:41:27,530 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-14 17:41:27,541 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-14 17:41:27,542 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-14 17:41:27,544 INFO L87 Difference]: Start difference. First operand has 29 states, 16 states have (on average 1.375) internal successors, (22), 17 states have internal predecessors, (22), 7 states have call successors, (7), 4 states have call predecessors, (7), 4 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-14 17:41:27,618 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 17:41:27,618 INFO L93 Difference]: Finished difference Result 51 states and 69 transitions. [2022-04-14 17:41:27,618 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-14 17:41:27,618 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 22 [2022-04-14 17:41:27,619 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-14 17:41:27,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-14 17:41:27,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 69 transitions. [2022-04-14 17:41:27,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-14 17:41:27,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 69 transitions. [2022-04-14 17:41:27,629 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 69 transitions. [2022-04-14 17:41:27,721 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 69 edges. 69 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-14 17:41:27,729 INFO L225 Difference]: With dead ends: 51 [2022-04-14 17:41:27,729 INFO L226 Difference]: Without dead ends: 24 [2022-04-14 17:41:27,732 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-14 17:41:27,737 INFO L913 BasicCegarLoop]: 27 mSDtfsCounter, 15 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 30 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-14 17:41:27,737 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [20 Valid, 30 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-14 17:41:27,747 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2022-04-14 17:41:27,766 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2022-04-14 17:41:27,767 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-14 17:41:27,768 INFO L82 GeneralOperation]: Start isEquivalent. First operand 24 states. Second operand has 24 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 14 states have internal predecessors, (15), 7 states have call successors, (7), 4 states have call predecessors, (7), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-14 17:41:27,769 INFO L74 IsIncluded]: Start isIncluded. First operand 24 states. Second operand has 24 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 14 states have internal predecessors, (15), 7 states have call successors, (7), 4 states have call predecessors, (7), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-14 17:41:27,771 INFO L87 Difference]: Start difference. First operand 24 states. Second operand has 24 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 14 states have internal predecessors, (15), 7 states have call successors, (7), 4 states have call predecessors, (7), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-14 17:41:27,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 17:41:27,774 INFO L93 Difference]: Finished difference Result 24 states and 27 transitions. [2022-04-14 17:41:27,774 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 27 transitions. [2022-04-14 17:41:27,775 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 17:41:27,775 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 17:41:27,775 INFO L74 IsIncluded]: Start isIncluded. First operand has 24 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 14 states have internal predecessors, (15), 7 states have call successors, (7), 4 states have call predecessors, (7), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand 24 states. [2022-04-14 17:41:27,776 INFO L87 Difference]: Start difference. First operand has 24 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 14 states have internal predecessors, (15), 7 states have call successors, (7), 4 states have call predecessors, (7), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand 24 states. [2022-04-14 17:41:27,778 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 17:41:27,778 INFO L93 Difference]: Finished difference Result 24 states and 27 transitions. [2022-04-14 17:41:27,778 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 27 transitions. [2022-04-14 17:41:27,779 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 17:41:27,779 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 17:41:27,779 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-14 17:41:27,779 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-14 17:41:27,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 14 states have internal predecessors, (15), 7 states have call successors, (7), 4 states have call predecessors, (7), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-14 17:41:27,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 27 transitions. [2022-04-14 17:41:27,782 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 27 transitions. Word has length 22 [2022-04-14 17:41:27,782 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-14 17:41:27,782 INFO L478 AbstractCegarLoop]: Abstraction has 24 states and 27 transitions. [2022-04-14 17:41:27,782 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-14 17:41:27,782 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 27 transitions. [2022-04-14 17:41:27,783 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-04-14 17:41:27,784 INFO L491 BasicCegarLoop]: Found error trace [2022-04-14 17:41:27,784 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-14 17:41:27,784 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-14 17:41:27,785 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-14 17:41:27,785 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-14 17:41:27,785 INFO L85 PathProgramCache]: Analyzing trace with hash 769620075, now seen corresponding path program 1 times [2022-04-14 17:41:27,785 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-14 17:41:27,785 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [3331363] [2022-04-14 17:41:27,786 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 17:41:27,786 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-14 17:41:27,806 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-14 17:41:27,807 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2056857500] [2022-04-14 17:41:27,807 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 17:41:27,807 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-14 17:41:27,807 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-14 17:41:27,810 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-14 17:41:27,811 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-04-14 17:41:27,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 17:41:27,865 INFO L263 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-14 17:41:27,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 17:41:27,880 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-14 17:41:28,029 INFO L272 TraceCheckUtils]: 0: Hoare triple {202#true} call ULTIMATE.init(); {202#true} is VALID [2022-04-14 17:41:28,029 INFO L290 TraceCheckUtils]: 1: Hoare triple {202#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3); {202#true} is VALID [2022-04-14 17:41:28,029 INFO L290 TraceCheckUtils]: 2: Hoare triple {202#true} assume true; {202#true} is VALID [2022-04-14 17:41:28,029 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {202#true} {202#true} #63#return; {202#true} is VALID [2022-04-14 17:41:28,030 INFO L272 TraceCheckUtils]: 4: Hoare triple {202#true} call #t~ret5 := main(); {202#true} is VALID [2022-04-14 17:41:28,030 INFO L290 TraceCheckUtils]: 5: Hoare triple {202#true} havoc ~k~0;havoc ~y~0;havoc ~x~0;havoc ~c~0;assume -32768 <= #t~nondet4 && #t~nondet4 <= 32767;~k~0 := #t~nondet4;havoc #t~nondet4; {202#true} is VALID [2022-04-14 17:41:28,030 INFO L272 TraceCheckUtils]: 6: Hoare triple {202#true} call assume_abort_if_not((if ~k~0 >= 0 && ~k~0 <= 20 then 1 else 0)); {202#true} is VALID [2022-04-14 17:41:28,030 INFO L290 TraceCheckUtils]: 7: Hoare triple {202#true} ~cond := #in~cond; {202#true} is VALID [2022-04-14 17:41:28,031 INFO L290 TraceCheckUtils]: 8: Hoare triple {202#true} assume !(0 == ~cond); {202#true} is VALID [2022-04-14 17:41:28,040 INFO L290 TraceCheckUtils]: 9: Hoare triple {202#true} assume true; {202#true} is VALID [2022-04-14 17:41:28,040 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {202#true} {202#true} #53#return; {202#true} is VALID [2022-04-14 17:41:28,041 INFO L272 TraceCheckUtils]: 11: Hoare triple {202#true} call assume_abort_if_not((if ~k~0 <= 256 then 1 else 0)); {202#true} is VALID [2022-04-14 17:41:28,041 INFO L290 TraceCheckUtils]: 12: Hoare triple {202#true} ~cond := #in~cond; {202#true} is VALID [2022-04-14 17:41:28,041 INFO L290 TraceCheckUtils]: 13: Hoare triple {202#true} assume !(0 == ~cond); {202#true} is VALID [2022-04-14 17:41:28,041 INFO L290 TraceCheckUtils]: 14: Hoare triple {202#true} assume true; {202#true} is VALID [2022-04-14 17:41:28,044 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {202#true} {202#true} #55#return; {202#true} is VALID [2022-04-14 17:41:28,045 INFO L290 TraceCheckUtils]: 16: Hoare triple {202#true} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {255#(and (= main_~x~0 0) (= main_~y~0 0))} is VALID [2022-04-14 17:41:28,045 INFO L290 TraceCheckUtils]: 17: Hoare triple {255#(and (= main_~x~0 0) (= main_~y~0 0))} assume !false; {255#(and (= main_~x~0 0) (= main_~y~0 0))} is VALID [2022-04-14 17:41:28,047 INFO L272 TraceCheckUtils]: 18: Hoare triple {255#(and (= main_~x~0 0) (= main_~y~0 0))} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {262#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-14 17:41:28,047 INFO L290 TraceCheckUtils]: 19: Hoare triple {262#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {266#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-14 17:41:28,048 INFO L290 TraceCheckUtils]: 20: Hoare triple {266#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {203#false} is VALID [2022-04-14 17:41:28,048 INFO L290 TraceCheckUtils]: 21: Hoare triple {203#false} assume !false; {203#false} is VALID [2022-04-14 17:41:28,049 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-14 17:41:28,049 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-14 17:41:28,049 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-14 17:41:28,049 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [3331363] [2022-04-14 17:41:28,049 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-14 17:41:28,050 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2056857500] [2022-04-14 17:41:28,051 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2056857500] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-14 17:41:28,052 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-14 17:41:28,052 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-14 17:41:28,052 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1454884844] [2022-04-14 17:41:28,052 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-14 17:41:28,053 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 22 [2022-04-14 17:41:28,053 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-14 17:41:28,053 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-14 17:41:28,068 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 19 edges. 19 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-14 17:41:28,068 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-14 17:41:28,069 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-14 17:41:28,070 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-14 17:41:28,070 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-14 17:41:28,071 INFO L87 Difference]: Start difference. First operand 24 states and 27 transitions. Second operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-14 17:41:28,189 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 17:41:28,190 INFO L93 Difference]: Finished difference Result 35 states and 40 transitions. [2022-04-14 17:41:28,190 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-14 17:41:28,191 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 22 [2022-04-14 17:41:28,191 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-14 17:41:28,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-14 17:41:28,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 40 transitions. [2022-04-14 17:41:28,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-14 17:41:28,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 40 transitions. [2022-04-14 17:41:28,202 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 40 transitions. [2022-04-14 17:41:28,233 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 40 edges. 40 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-14 17:41:28,235 INFO L225 Difference]: With dead ends: 35 [2022-04-14 17:41:28,236 INFO L226 Difference]: Without dead ends: 31 [2022-04-14 17:41:28,236 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-14 17:41:28,238 INFO L913 BasicCegarLoop]: 24 mSDtfsCounter, 6 mSDsluCounter, 61 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 85 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-14 17:41:28,239 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [8 Valid, 85 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-14 17:41:28,241 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2022-04-14 17:41:28,247 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2022-04-14 17:41:28,247 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-14 17:41:28,248 INFO L82 GeneralOperation]: Start isEquivalent. First operand 31 states. Second operand has 31 states, 18 states have (on average 1.1111111111111112) internal successors, (20), 19 states have internal predecessors, (20), 8 states have call successors, (8), 5 states have call predecessors, (8), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-14 17:41:28,248 INFO L74 IsIncluded]: Start isIncluded. First operand 31 states. Second operand has 31 states, 18 states have (on average 1.1111111111111112) internal successors, (20), 19 states have internal predecessors, (20), 8 states have call successors, (8), 5 states have call predecessors, (8), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-14 17:41:28,249 INFO L87 Difference]: Start difference. First operand 31 states. Second operand has 31 states, 18 states have (on average 1.1111111111111112) internal successors, (20), 19 states have internal predecessors, (20), 8 states have call successors, (8), 5 states have call predecessors, (8), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-14 17:41:28,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 17:41:28,252 INFO L93 Difference]: Finished difference Result 31 states and 34 transitions. [2022-04-14 17:41:28,252 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 34 transitions. [2022-04-14 17:41:28,254 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 17:41:28,254 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 17:41:28,254 INFO L74 IsIncluded]: Start isIncluded. First operand has 31 states, 18 states have (on average 1.1111111111111112) internal successors, (20), 19 states have internal predecessors, (20), 8 states have call successors, (8), 5 states have call predecessors, (8), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand 31 states. [2022-04-14 17:41:28,255 INFO L87 Difference]: Start difference. First operand has 31 states, 18 states have (on average 1.1111111111111112) internal successors, (20), 19 states have internal predecessors, (20), 8 states have call successors, (8), 5 states have call predecessors, (8), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand 31 states. [2022-04-14 17:41:28,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 17:41:28,259 INFO L93 Difference]: Finished difference Result 31 states and 34 transitions. [2022-04-14 17:41:28,259 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 34 transitions. [2022-04-14 17:41:28,260 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 17:41:28,260 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 17:41:28,260 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-14 17:41:28,260 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-14 17:41:28,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 18 states have (on average 1.1111111111111112) internal successors, (20), 19 states have internal predecessors, (20), 8 states have call successors, (8), 5 states have call predecessors, (8), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-14 17:41:28,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 34 transitions. [2022-04-14 17:41:28,269 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 34 transitions. Word has length 22 [2022-04-14 17:41:28,270 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-14 17:41:28,271 INFO L478 AbstractCegarLoop]: Abstraction has 31 states and 34 transitions. [2022-04-14 17:41:28,273 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-14 17:41:28,273 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 34 transitions. [2022-04-14 17:41:28,273 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-04-14 17:41:28,273 INFO L491 BasicCegarLoop]: Found error trace [2022-04-14 17:41:28,274 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-14 17:41:28,293 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-04-14 17:41:28,474 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-14 17:41:28,474 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-14 17:41:28,475 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-14 17:41:28,475 INFO L85 PathProgramCache]: Analyzing trace with hash 645812411, now seen corresponding path program 1 times [2022-04-14 17:41:28,475 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-14 17:41:28,475 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [834643646] [2022-04-14 17:41:28,475 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 17:41:28,475 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-14 17:41:28,491 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-14 17:41:28,491 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [467022278] [2022-04-14 17:41:28,491 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 17:41:28,496 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-14 17:41:28,496 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-14 17:41:28,496 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-14 17:41:28,498 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-04-14 17:41:28,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 17:41:28,552 INFO L263 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 11 conjunts are in the unsatisfiable core [2022-04-14 17:41:28,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 17:41:28,567 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-14 17:41:28,713 INFO L272 TraceCheckUtils]: 0: Hoare triple {434#true} call ULTIMATE.init(); {434#true} is VALID [2022-04-14 17:41:28,714 INFO L290 TraceCheckUtils]: 1: Hoare triple {434#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3); {434#true} is VALID [2022-04-14 17:41:28,714 INFO L290 TraceCheckUtils]: 2: Hoare triple {434#true} assume true; {434#true} is VALID [2022-04-14 17:41:28,714 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {434#true} {434#true} #63#return; {434#true} is VALID [2022-04-14 17:41:28,715 INFO L272 TraceCheckUtils]: 4: Hoare triple {434#true} call #t~ret5 := main(); {434#true} is VALID [2022-04-14 17:41:28,715 INFO L290 TraceCheckUtils]: 5: Hoare triple {434#true} havoc ~k~0;havoc ~y~0;havoc ~x~0;havoc ~c~0;assume -32768 <= #t~nondet4 && #t~nondet4 <= 32767;~k~0 := #t~nondet4;havoc #t~nondet4; {434#true} is VALID [2022-04-14 17:41:28,715 INFO L272 TraceCheckUtils]: 6: Hoare triple {434#true} call assume_abort_if_not((if ~k~0 >= 0 && ~k~0 <= 20 then 1 else 0)); {434#true} is VALID [2022-04-14 17:41:28,715 INFO L290 TraceCheckUtils]: 7: Hoare triple {434#true} ~cond := #in~cond; {434#true} is VALID [2022-04-14 17:41:28,715 INFO L290 TraceCheckUtils]: 8: Hoare triple {434#true} assume !(0 == ~cond); {434#true} is VALID [2022-04-14 17:41:28,715 INFO L290 TraceCheckUtils]: 9: Hoare triple {434#true} assume true; {434#true} is VALID [2022-04-14 17:41:28,715 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {434#true} {434#true} #53#return; {434#true} is VALID [2022-04-14 17:41:28,715 INFO L272 TraceCheckUtils]: 11: Hoare triple {434#true} call assume_abort_if_not((if ~k~0 <= 256 then 1 else 0)); {434#true} is VALID [2022-04-14 17:41:28,715 INFO L290 TraceCheckUtils]: 12: Hoare triple {434#true} ~cond := #in~cond; {434#true} is VALID [2022-04-14 17:41:28,716 INFO L290 TraceCheckUtils]: 13: Hoare triple {434#true} assume !(0 == ~cond); {434#true} is VALID [2022-04-14 17:41:28,716 INFO L290 TraceCheckUtils]: 14: Hoare triple {434#true} assume true; {434#true} is VALID [2022-04-14 17:41:28,716 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {434#true} {434#true} #55#return; {434#true} is VALID [2022-04-14 17:41:28,717 INFO L290 TraceCheckUtils]: 16: Hoare triple {434#true} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {487#(and (= main_~x~0 0) (= main_~y~0 0))} is VALID [2022-04-14 17:41:28,718 INFO L290 TraceCheckUtils]: 17: Hoare triple {487#(and (= main_~x~0 0) (= main_~y~0 0))} assume !false; {487#(and (= main_~x~0 0) (= main_~y~0 0))} is VALID [2022-04-14 17:41:28,718 INFO L272 TraceCheckUtils]: 18: Hoare triple {487#(and (= main_~x~0 0) (= main_~y~0 0))} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {434#true} is VALID [2022-04-14 17:41:28,718 INFO L290 TraceCheckUtils]: 19: Hoare triple {434#true} ~cond := #in~cond; {434#true} is VALID [2022-04-14 17:41:28,718 INFO L290 TraceCheckUtils]: 20: Hoare triple {434#true} assume !(0 == ~cond); {434#true} is VALID [2022-04-14 17:41:28,718 INFO L290 TraceCheckUtils]: 21: Hoare triple {434#true} assume true; {434#true} is VALID [2022-04-14 17:41:28,719 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {434#true} {487#(and (= main_~x~0 0) (= main_~y~0 0))} #57#return; {487#(and (= main_~x~0 0) (= main_~y~0 0))} is VALID [2022-04-14 17:41:28,720 INFO L290 TraceCheckUtils]: 23: Hoare triple {487#(and (= main_~x~0 0) (= main_~y~0 0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {509#(and (= (+ main_~x~0 (* (- 1) main_~y~0 main_~y~0 main_~y~0 main_~y~0)) 0) (= (+ (- 1) main_~y~0) 0))} is VALID [2022-04-14 17:41:28,720 INFO L290 TraceCheckUtils]: 24: Hoare triple {509#(and (= (+ main_~x~0 (* (- 1) main_~y~0 main_~y~0 main_~y~0 main_~y~0)) 0) (= (+ (- 1) main_~y~0) 0))} assume !false; {509#(and (= (+ main_~x~0 (* (- 1) main_~y~0 main_~y~0 main_~y~0 main_~y~0)) 0) (= (+ (- 1) main_~y~0) 0))} is VALID [2022-04-14 17:41:28,722 INFO L272 TraceCheckUtils]: 25: Hoare triple {509#(and (= (+ main_~x~0 (* (- 1) main_~y~0 main_~y~0 main_~y~0 main_~y~0)) 0) (= (+ (- 1) main_~y~0) 0))} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {516#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-14 17:41:28,722 INFO L290 TraceCheckUtils]: 26: Hoare triple {516#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {520#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-14 17:41:28,723 INFO L290 TraceCheckUtils]: 27: Hoare triple {520#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {435#false} is VALID [2022-04-14 17:41:28,723 INFO L290 TraceCheckUtils]: 28: Hoare triple {435#false} assume !false; {435#false} is VALID [2022-04-14 17:41:28,724 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-14 17:41:28,724 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-14 17:41:29,071 INFO L290 TraceCheckUtils]: 28: Hoare triple {435#false} assume !false; {435#false} is VALID [2022-04-14 17:41:29,071 INFO L290 TraceCheckUtils]: 27: Hoare triple {520#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {435#false} is VALID [2022-04-14 17:41:29,072 INFO L290 TraceCheckUtils]: 26: Hoare triple {516#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {520#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-14 17:41:29,073 INFO L272 TraceCheckUtils]: 25: Hoare triple {536#(= (+ main_~y~0 (* 30 main_~x~0)) (+ (* (* main_~y~0 main_~y~0 main_~y~0 main_~y~0) 15) (* 6 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (* (* main_~y~0 main_~y~0 main_~y~0) 10)))} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {516#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-14 17:41:29,073 INFO L290 TraceCheckUtils]: 24: Hoare triple {536#(= (+ main_~y~0 (* 30 main_~x~0)) (+ (* (* main_~y~0 main_~y~0 main_~y~0 main_~y~0) 15) (* 6 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (* (* main_~y~0 main_~y~0 main_~y~0) 10)))} assume !false; {536#(= (+ main_~y~0 (* 30 main_~x~0)) (+ (* (* main_~y~0 main_~y~0 main_~y~0 main_~y~0) 15) (* 6 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (* (* main_~y~0 main_~y~0 main_~y~0) 10)))} is VALID [2022-04-14 17:41:31,157 WARN L290 TraceCheckUtils]: 23: Hoare triple {536#(= (+ main_~y~0 (* 30 main_~x~0)) (+ (* (* main_~y~0 main_~y~0 main_~y~0 main_~y~0) 15) (* 6 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (* (* main_~y~0 main_~y~0 main_~y~0) 10)))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {536#(= (+ main_~y~0 (* 30 main_~x~0)) (+ (* (* main_~y~0 main_~y~0 main_~y~0 main_~y~0) 15) (* 6 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (* (* main_~y~0 main_~y~0 main_~y~0) 10)))} is UNKNOWN [2022-04-14 17:41:31,158 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {434#true} {536#(= (+ main_~y~0 (* 30 main_~x~0)) (+ (* (* main_~y~0 main_~y~0 main_~y~0 main_~y~0) 15) (* 6 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (* (* main_~y~0 main_~y~0 main_~y~0) 10)))} #57#return; {536#(= (+ main_~y~0 (* 30 main_~x~0)) (+ (* (* main_~y~0 main_~y~0 main_~y~0 main_~y~0) 15) (* 6 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (* (* main_~y~0 main_~y~0 main_~y~0) 10)))} is VALID [2022-04-14 17:41:31,158 INFO L290 TraceCheckUtils]: 21: Hoare triple {434#true} assume true; {434#true} is VALID [2022-04-14 17:41:31,158 INFO L290 TraceCheckUtils]: 20: Hoare triple {434#true} assume !(0 == ~cond); {434#true} is VALID [2022-04-14 17:41:31,158 INFO L290 TraceCheckUtils]: 19: Hoare triple {434#true} ~cond := #in~cond; {434#true} is VALID [2022-04-14 17:41:31,158 INFO L272 TraceCheckUtils]: 18: Hoare triple {536#(= (+ main_~y~0 (* 30 main_~x~0)) (+ (* (* main_~y~0 main_~y~0 main_~y~0 main_~y~0) 15) (* 6 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (* (* main_~y~0 main_~y~0 main_~y~0) 10)))} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {434#true} is VALID [2022-04-14 17:41:31,159 INFO L290 TraceCheckUtils]: 17: Hoare triple {536#(= (+ main_~y~0 (* 30 main_~x~0)) (+ (* (* main_~y~0 main_~y~0 main_~y~0 main_~y~0) 15) (* 6 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (* (* main_~y~0 main_~y~0 main_~y~0) 10)))} assume !false; {536#(= (+ main_~y~0 (* 30 main_~x~0)) (+ (* (* main_~y~0 main_~y~0 main_~y~0 main_~y~0) 15) (* 6 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (* (* main_~y~0 main_~y~0 main_~y~0) 10)))} is VALID [2022-04-14 17:41:31,159 INFO L290 TraceCheckUtils]: 16: Hoare triple {434#true} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {536#(= (+ main_~y~0 (* 30 main_~x~0)) (+ (* (* main_~y~0 main_~y~0 main_~y~0 main_~y~0) 15) (* 6 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (* (* main_~y~0 main_~y~0 main_~y~0) 10)))} is VALID [2022-04-14 17:41:31,159 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {434#true} {434#true} #55#return; {434#true} is VALID [2022-04-14 17:41:31,159 INFO L290 TraceCheckUtils]: 14: Hoare triple {434#true} assume true; {434#true} is VALID [2022-04-14 17:41:31,159 INFO L290 TraceCheckUtils]: 13: Hoare triple {434#true} assume !(0 == ~cond); {434#true} is VALID [2022-04-14 17:41:31,160 INFO L290 TraceCheckUtils]: 12: Hoare triple {434#true} ~cond := #in~cond; {434#true} is VALID [2022-04-14 17:41:31,160 INFO L272 TraceCheckUtils]: 11: Hoare triple {434#true} call assume_abort_if_not((if ~k~0 <= 256 then 1 else 0)); {434#true} is VALID [2022-04-14 17:41:31,160 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {434#true} {434#true} #53#return; {434#true} is VALID [2022-04-14 17:41:31,160 INFO L290 TraceCheckUtils]: 9: Hoare triple {434#true} assume true; {434#true} is VALID [2022-04-14 17:41:31,160 INFO L290 TraceCheckUtils]: 8: Hoare triple {434#true} assume !(0 == ~cond); {434#true} is VALID [2022-04-14 17:41:31,160 INFO L290 TraceCheckUtils]: 7: Hoare triple {434#true} ~cond := #in~cond; {434#true} is VALID [2022-04-14 17:41:31,160 INFO L272 TraceCheckUtils]: 6: Hoare triple {434#true} call assume_abort_if_not((if ~k~0 >= 0 && ~k~0 <= 20 then 1 else 0)); {434#true} is VALID [2022-04-14 17:41:31,166 INFO L290 TraceCheckUtils]: 5: Hoare triple {434#true} havoc ~k~0;havoc ~y~0;havoc ~x~0;havoc ~c~0;assume -32768 <= #t~nondet4 && #t~nondet4 <= 32767;~k~0 := #t~nondet4;havoc #t~nondet4; {434#true} is VALID [2022-04-14 17:41:31,166 INFO L272 TraceCheckUtils]: 4: Hoare triple {434#true} call #t~ret5 := main(); {434#true} is VALID [2022-04-14 17:41:31,166 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {434#true} {434#true} #63#return; {434#true} is VALID [2022-04-14 17:41:31,166 INFO L290 TraceCheckUtils]: 2: Hoare triple {434#true} assume true; {434#true} is VALID [2022-04-14 17:41:31,167 INFO L290 TraceCheckUtils]: 1: Hoare triple {434#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3); {434#true} is VALID [2022-04-14 17:41:31,167 INFO L272 TraceCheckUtils]: 0: Hoare triple {434#true} call ULTIMATE.init(); {434#true} is VALID [2022-04-14 17:41:31,167 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-04-14 17:41:31,167 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-14 17:41:31,167 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [834643646] [2022-04-14 17:41:31,167 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-14 17:41:31,167 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [467022278] [2022-04-14 17:41:31,167 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [467022278] provided 1 perfect and 1 imperfect interpolant sequences [2022-04-14 17:41:31,167 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-04-14 17:41:31,168 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 7 [2022-04-14 17:41:31,168 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [329130285] [2022-04-14 17:41:31,168 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-14 17:41:31,168 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 29 [2022-04-14 17:41:31,168 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-14 17:41:31,169 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-14 17:41:33,832 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 25 edges. 24 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-14 17:41:33,832 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-14 17:41:33,833 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-14 17:41:33,833 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-14 17:41:33,833 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-04-14 17:41:33,833 INFO L87 Difference]: Start difference. First operand 31 states and 34 transitions. Second operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-14 17:41:33,956 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 17:41:33,956 INFO L93 Difference]: Finished difference Result 37 states and 39 transitions. [2022-04-14 17:41:33,956 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-14 17:41:33,957 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 29 [2022-04-14 17:41:33,957 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-14 17:41:33,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-14 17:41:33,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 32 transitions. [2022-04-14 17:41:33,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-14 17:41:33,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 32 transitions. [2022-04-14 17:41:33,959 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 32 transitions. [2022-04-14 17:41:34,374 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 32 edges. 32 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-14 17:41:34,375 INFO L225 Difference]: With dead ends: 37 [2022-04-14 17:41:34,375 INFO L226 Difference]: Without dead ends: 33 [2022-04-14 17:41:34,375 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 50 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-14 17:41:34,376 INFO L913 BasicCegarLoop]: 22 mSDtfsCounter, 6 mSDsluCounter, 53 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 75 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-14 17:41:34,376 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [7 Valid, 75 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-14 17:41:34,377 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2022-04-14 17:41:34,381 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2022-04-14 17:41:34,381 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-14 17:41:34,381 INFO L82 GeneralOperation]: Start isEquivalent. First operand 33 states. Second operand has 33 states, 20 states have (on average 1.05) internal successors, (21), 20 states have internal predecessors, (21), 8 states have call successors, (8), 6 states have call predecessors, (8), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-14 17:41:34,382 INFO L74 IsIncluded]: Start isIncluded. First operand 33 states. Second operand has 33 states, 20 states have (on average 1.05) internal successors, (21), 20 states have internal predecessors, (21), 8 states have call successors, (8), 6 states have call predecessors, (8), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-14 17:41:34,382 INFO L87 Difference]: Start difference. First operand 33 states. Second operand has 33 states, 20 states have (on average 1.05) internal successors, (21), 20 states have internal predecessors, (21), 8 states have call successors, (8), 6 states have call predecessors, (8), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-14 17:41:34,383 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 17:41:34,383 INFO L93 Difference]: Finished difference Result 33 states and 35 transitions. [2022-04-14 17:41:34,383 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 35 transitions. [2022-04-14 17:41:34,384 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 17:41:34,384 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 17:41:34,384 INFO L74 IsIncluded]: Start isIncluded. First operand has 33 states, 20 states have (on average 1.05) internal successors, (21), 20 states have internal predecessors, (21), 8 states have call successors, (8), 6 states have call predecessors, (8), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand 33 states. [2022-04-14 17:41:34,384 INFO L87 Difference]: Start difference. First operand has 33 states, 20 states have (on average 1.05) internal successors, (21), 20 states have internal predecessors, (21), 8 states have call successors, (8), 6 states have call predecessors, (8), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand 33 states. [2022-04-14 17:41:34,385 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 17:41:34,385 INFO L93 Difference]: Finished difference Result 33 states and 35 transitions. [2022-04-14 17:41:34,386 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 35 transitions. [2022-04-14 17:41:34,386 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 17:41:34,386 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 17:41:34,386 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-14 17:41:34,386 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-14 17:41:34,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 20 states have (on average 1.05) internal successors, (21), 20 states have internal predecessors, (21), 8 states have call successors, (8), 6 states have call predecessors, (8), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-14 17:41:34,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 35 transitions. [2022-04-14 17:41:34,387 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 35 transitions. Word has length 29 [2022-04-14 17:41:34,387 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-14 17:41:34,388 INFO L478 AbstractCegarLoop]: Abstraction has 33 states and 35 transitions. [2022-04-14 17:41:34,388 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-14 17:41:34,388 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 35 transitions. [2022-04-14 17:41:34,388 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2022-04-14 17:41:34,388 INFO L491 BasicCegarLoop]: Found error trace [2022-04-14 17:41:34,389 INFO L499 BasicCegarLoop]: trace histogram [4, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-14 17:41:34,394 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-04-14 17:41:34,589 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2022-04-14 17:41:34,589 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-14 17:41:34,589 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-14 17:41:34,590 INFO L85 PathProgramCache]: Analyzing trace with hash 463554397, now seen corresponding path program 1 times [2022-04-14 17:41:34,590 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-14 17:41:34,590 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1458061252] [2022-04-14 17:41:34,590 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 17:41:34,590 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-14 17:41:34,617 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-14 17:41:34,617 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1366804048] [2022-04-14 17:41:34,617 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 17:41:34,617 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-14 17:41:34,618 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-14 17:41:34,632 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-14 17:41:34,652 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-04-14 17:41:34,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 17:41:34,675 INFO L263 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 12 conjunts are in the unsatisfiable core [2022-04-14 17:41:34,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 17:41:34,693 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-14 17:41:34,949 INFO L272 TraceCheckUtils]: 0: Hoare triple {784#true} call ULTIMATE.init(); {784#true} is VALID [2022-04-14 17:41:34,950 INFO L290 TraceCheckUtils]: 1: Hoare triple {784#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3); {784#true} is VALID [2022-04-14 17:41:34,950 INFO L290 TraceCheckUtils]: 2: Hoare triple {784#true} assume true; {784#true} is VALID [2022-04-14 17:41:34,951 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {784#true} {784#true} #63#return; {784#true} is VALID [2022-04-14 17:41:34,952 INFO L272 TraceCheckUtils]: 4: Hoare triple {784#true} call #t~ret5 := main(); {784#true} is VALID [2022-04-14 17:41:34,952 INFO L290 TraceCheckUtils]: 5: Hoare triple {784#true} havoc ~k~0;havoc ~y~0;havoc ~x~0;havoc ~c~0;assume -32768 <= #t~nondet4 && #t~nondet4 <= 32767;~k~0 := #t~nondet4;havoc #t~nondet4; {784#true} is VALID [2022-04-14 17:41:34,961 INFO L272 TraceCheckUtils]: 6: Hoare triple {784#true} call assume_abort_if_not((if ~k~0 >= 0 && ~k~0 <= 20 then 1 else 0)); {784#true} is VALID [2022-04-14 17:41:34,962 INFO L290 TraceCheckUtils]: 7: Hoare triple {784#true} ~cond := #in~cond; {784#true} is VALID [2022-04-14 17:41:34,962 INFO L290 TraceCheckUtils]: 8: Hoare triple {784#true} assume !(0 == ~cond); {784#true} is VALID [2022-04-14 17:41:34,962 INFO L290 TraceCheckUtils]: 9: Hoare triple {784#true} assume true; {784#true} is VALID [2022-04-14 17:41:34,962 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {784#true} {784#true} #53#return; {784#true} is VALID [2022-04-14 17:41:34,962 INFO L272 TraceCheckUtils]: 11: Hoare triple {784#true} call assume_abort_if_not((if ~k~0 <= 256 then 1 else 0)); {784#true} is VALID [2022-04-14 17:41:34,962 INFO L290 TraceCheckUtils]: 12: Hoare triple {784#true} ~cond := #in~cond; {784#true} is VALID [2022-04-14 17:41:34,962 INFO L290 TraceCheckUtils]: 13: Hoare triple {784#true} assume !(0 == ~cond); {784#true} is VALID [2022-04-14 17:41:34,962 INFO L290 TraceCheckUtils]: 14: Hoare triple {784#true} assume true; {784#true} is VALID [2022-04-14 17:41:34,963 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {784#true} {784#true} #55#return; {784#true} is VALID [2022-04-14 17:41:34,963 INFO L290 TraceCheckUtils]: 16: Hoare triple {784#true} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {837#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-14 17:41:34,963 INFO L290 TraceCheckUtils]: 17: Hoare triple {837#(and (= main_~c~0 0) (= main_~y~0 0))} assume !false; {837#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-14 17:41:34,964 INFO L272 TraceCheckUtils]: 18: Hoare triple {837#(and (= main_~c~0 0) (= main_~y~0 0))} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {784#true} is VALID [2022-04-14 17:41:34,964 INFO L290 TraceCheckUtils]: 19: Hoare triple {784#true} ~cond := #in~cond; {784#true} is VALID [2022-04-14 17:41:34,964 INFO L290 TraceCheckUtils]: 20: Hoare triple {784#true} assume !(0 == ~cond); {784#true} is VALID [2022-04-14 17:41:34,964 INFO L290 TraceCheckUtils]: 21: Hoare triple {784#true} assume true; {784#true} is VALID [2022-04-14 17:41:34,964 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {784#true} {837#(and (= main_~c~0 0) (= main_~y~0 0))} #57#return; {837#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-14 17:41:34,965 INFO L290 TraceCheckUtils]: 23: Hoare triple {837#(and (= main_~c~0 0) (= main_~y~0 0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {859#(and (= (+ (- 1) main_~y~0) 0) (< 0 main_~k~0) (<= main_~c~0 1))} is VALID [2022-04-14 17:41:34,965 INFO L290 TraceCheckUtils]: 24: Hoare triple {859#(and (= (+ (- 1) main_~y~0) 0) (< 0 main_~k~0) (<= main_~c~0 1))} assume !false; {859#(and (= (+ (- 1) main_~y~0) 0) (< 0 main_~k~0) (<= main_~c~0 1))} is VALID [2022-04-14 17:41:34,965 INFO L272 TraceCheckUtils]: 25: Hoare triple {859#(and (= (+ (- 1) main_~y~0) 0) (< 0 main_~k~0) (<= main_~c~0 1))} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {784#true} is VALID [2022-04-14 17:41:34,965 INFO L290 TraceCheckUtils]: 26: Hoare triple {784#true} ~cond := #in~cond; {784#true} is VALID [2022-04-14 17:41:34,965 INFO L290 TraceCheckUtils]: 27: Hoare triple {784#true} assume !(0 == ~cond); {784#true} is VALID [2022-04-14 17:41:34,966 INFO L290 TraceCheckUtils]: 28: Hoare triple {784#true} assume true; {784#true} is VALID [2022-04-14 17:41:34,967 INFO L284 TraceCheckUtils]: 29: Hoare quadruple {784#true} {859#(and (= (+ (- 1) main_~y~0) 0) (< 0 main_~k~0) (<= main_~c~0 1))} #57#return; {859#(and (= (+ (- 1) main_~y~0) 0) (< 0 main_~k~0) (<= main_~c~0 1))} is VALID [2022-04-14 17:41:34,968 INFO L290 TraceCheckUtils]: 30: Hoare triple {859#(and (= (+ (- 1) main_~y~0) 0) (< 0 main_~k~0) (<= main_~c~0 1))} assume !(~c~0 < ~k~0); {881#(and (= (+ (- 1) main_~y~0) 0) (<= main_~k~0 1) (< 0 main_~k~0))} is VALID [2022-04-14 17:41:34,968 INFO L272 TraceCheckUtils]: 31: Hoare triple {881#(and (= (+ (- 1) main_~y~0) 0) (<= main_~k~0 1) (< 0 main_~k~0))} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {784#true} is VALID [2022-04-14 17:41:34,968 INFO L290 TraceCheckUtils]: 32: Hoare triple {784#true} ~cond := #in~cond; {784#true} is VALID [2022-04-14 17:41:34,968 INFO L290 TraceCheckUtils]: 33: Hoare triple {784#true} assume !(0 == ~cond); {784#true} is VALID [2022-04-14 17:41:34,968 INFO L290 TraceCheckUtils]: 34: Hoare triple {784#true} assume true; {784#true} is VALID [2022-04-14 17:41:34,969 INFO L284 TraceCheckUtils]: 35: Hoare quadruple {784#true} {881#(and (= (+ (- 1) main_~y~0) 0) (<= main_~k~0 1) (< 0 main_~k~0))} #59#return; {881#(and (= (+ (- 1) main_~y~0) 0) (<= main_~k~0 1) (< 0 main_~k~0))} is VALID [2022-04-14 17:41:34,969 INFO L272 TraceCheckUtils]: 36: Hoare triple {881#(and (= (+ (- 1) main_~y~0) 0) (<= main_~k~0 1) (< 0 main_~k~0))} call __VERIFIER_assert((if ~k~0 * ~y~0 == ~y~0 * ~y~0 then 1 else 0)); {900#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-14 17:41:34,970 INFO L290 TraceCheckUtils]: 37: Hoare triple {900#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {904#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-14 17:41:34,970 INFO L290 TraceCheckUtils]: 38: Hoare triple {904#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {785#false} is VALID [2022-04-14 17:41:34,970 INFO L290 TraceCheckUtils]: 39: Hoare triple {785#false} assume !false; {785#false} is VALID [2022-04-14 17:41:34,970 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-04-14 17:41:34,970 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-14 17:41:35,236 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-14 17:41:35,236 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1458061252] [2022-04-14 17:41:35,236 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-14 17:41:35,236 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1366804048] [2022-04-14 17:41:35,237 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1366804048] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-14 17:41:35,237 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-14 17:41:35,237 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2022-04-14 17:41:35,237 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [496255119] [2022-04-14 17:41:35,237 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2022-04-14 17:41:35,237 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 states have internal predecessors, (17), 4 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) Word has length 40 [2022-04-14 17:41:35,239 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-14 17:41:35,239 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 7 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 states have internal predecessors, (17), 4 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2022-04-14 17:41:35,261 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 31 edges. 31 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-14 17:41:35,261 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-14 17:41:35,261 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-14 17:41:35,262 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-14 17:41:35,262 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2022-04-14 17:41:35,262 INFO L87 Difference]: Start difference. First operand 33 states and 35 transitions. Second operand has 7 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 states have internal predecessors, (17), 4 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2022-04-14 17:41:35,500 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 17:41:35,500 INFO L93 Difference]: Finished difference Result 42 states and 46 transitions. [2022-04-14 17:41:35,500 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-14 17:41:35,500 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 states have internal predecessors, (17), 4 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) Word has length 40 [2022-04-14 17:41:35,501 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-14 17:41:35,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 states have internal predecessors, (17), 4 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2022-04-14 17:41:35,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 42 transitions. [2022-04-14 17:41:35,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 states have internal predecessors, (17), 4 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2022-04-14 17:41:35,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 42 transitions. [2022-04-14 17:41:35,503 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 42 transitions. [2022-04-14 17:41:35,538 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 42 edges. 42 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-14 17:41:35,539 INFO L225 Difference]: With dead ends: 42 [2022-04-14 17:41:35,539 INFO L226 Difference]: Without dead ends: 36 [2022-04-14 17:41:35,540 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 48 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2022-04-14 17:41:35,540 INFO L913 BasicCegarLoop]: 30 mSDtfsCounter, 2 mSDsluCounter, 105 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 135 SdHoareTripleChecker+Invalid, 60 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 59 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-14 17:41:35,540 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [2 Valid, 135 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 59 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-14 17:41:35,541 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2022-04-14 17:41:35,549 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2022-04-14 17:41:35,549 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-14 17:41:35,549 INFO L82 GeneralOperation]: Start isEquivalent. First operand 36 states. Second operand has 36 states, 22 states have (on average 1.0454545454545454) internal successors, (23), 22 states have internal predecessors, (23), 9 states have call successors, (9), 6 states have call predecessors, (9), 4 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-14 17:41:35,549 INFO L74 IsIncluded]: Start isIncluded. First operand 36 states. Second operand has 36 states, 22 states have (on average 1.0454545454545454) internal successors, (23), 22 states have internal predecessors, (23), 9 states have call successors, (9), 6 states have call predecessors, (9), 4 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-14 17:41:35,550 INFO L87 Difference]: Start difference. First operand 36 states. Second operand has 36 states, 22 states have (on average 1.0454545454545454) internal successors, (23), 22 states have internal predecessors, (23), 9 states have call successors, (9), 6 states have call predecessors, (9), 4 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-14 17:41:35,551 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 17:41:35,551 INFO L93 Difference]: Finished difference Result 36 states and 39 transitions. [2022-04-14 17:41:35,551 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 39 transitions. [2022-04-14 17:41:35,551 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 17:41:35,551 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 17:41:35,552 INFO L74 IsIncluded]: Start isIncluded. First operand has 36 states, 22 states have (on average 1.0454545454545454) internal successors, (23), 22 states have internal predecessors, (23), 9 states have call successors, (9), 6 states have call predecessors, (9), 4 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Second operand 36 states. [2022-04-14 17:41:35,552 INFO L87 Difference]: Start difference. First operand has 36 states, 22 states have (on average 1.0454545454545454) internal successors, (23), 22 states have internal predecessors, (23), 9 states have call successors, (9), 6 states have call predecessors, (9), 4 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Second operand 36 states. [2022-04-14 17:41:35,553 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 17:41:35,553 INFO L93 Difference]: Finished difference Result 36 states and 39 transitions. [2022-04-14 17:41:35,553 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 39 transitions. [2022-04-14 17:41:35,553 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 17:41:35,553 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 17:41:35,553 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-14 17:41:35,553 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-14 17:41:35,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 22 states have (on average 1.0454545454545454) internal successors, (23), 22 states have internal predecessors, (23), 9 states have call successors, (9), 6 states have call predecessors, (9), 4 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-14 17:41:35,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 39 transitions. [2022-04-14 17:41:35,555 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 39 transitions. Word has length 40 [2022-04-14 17:41:35,555 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-14 17:41:35,555 INFO L478 AbstractCegarLoop]: Abstraction has 36 states and 39 transitions. [2022-04-14 17:41:35,555 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 states have internal predecessors, (17), 4 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2022-04-14 17:41:35,555 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 39 transitions. [2022-04-14 17:41:35,556 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2022-04-14 17:41:35,556 INFO L491 BasicCegarLoop]: Found error trace [2022-04-14 17:41:35,556 INFO L499 BasicCegarLoop]: trace histogram [5, 4, 4, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-14 17:41:35,577 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-04-14 17:41:35,777 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-14 17:41:35,778 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-14 17:41:35,778 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-14 17:41:35,778 INFO L85 PathProgramCache]: Analyzing trace with hash 1886956461, now seen corresponding path program 2 times [2022-04-14 17:41:35,778 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-14 17:41:35,778 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1447964993] [2022-04-14 17:41:35,778 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 17:41:35,778 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-14 17:41:35,803 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-14 17:41:35,804 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1900165726] [2022-04-14 17:41:35,804 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-14 17:41:35,804 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-14 17:41:35,804 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-14 17:41:35,812 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-14 17:41:35,812 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-04-14 17:41:35,925 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-14 17:41:35,925 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-14 17:41:35,926 INFO L263 TraceCheckSpWp]: Trace formula consists of 130 conjuncts, 17 conjunts are in the unsatisfiable core [2022-04-14 17:41:35,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 17:41:35,938 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-14 17:41:36,241 INFO L272 TraceCheckUtils]: 0: Hoare triple {1160#true} call ULTIMATE.init(); {1160#true} is VALID [2022-04-14 17:41:36,241 INFO L290 TraceCheckUtils]: 1: Hoare triple {1160#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3); {1160#true} is VALID [2022-04-14 17:41:36,241 INFO L290 TraceCheckUtils]: 2: Hoare triple {1160#true} assume true; {1160#true} is VALID [2022-04-14 17:41:36,241 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1160#true} {1160#true} #63#return; {1160#true} is VALID [2022-04-14 17:41:36,241 INFO L272 TraceCheckUtils]: 4: Hoare triple {1160#true} call #t~ret5 := main(); {1160#true} is VALID [2022-04-14 17:41:36,241 INFO L290 TraceCheckUtils]: 5: Hoare triple {1160#true} havoc ~k~0;havoc ~y~0;havoc ~x~0;havoc ~c~0;assume -32768 <= #t~nondet4 && #t~nondet4 <= 32767;~k~0 := #t~nondet4;havoc #t~nondet4; {1160#true} is VALID [2022-04-14 17:41:36,241 INFO L272 TraceCheckUtils]: 6: Hoare triple {1160#true} call assume_abort_if_not((if ~k~0 >= 0 && ~k~0 <= 20 then 1 else 0)); {1160#true} is VALID [2022-04-14 17:41:36,241 INFO L290 TraceCheckUtils]: 7: Hoare triple {1160#true} ~cond := #in~cond; {1160#true} is VALID [2022-04-14 17:41:36,241 INFO L290 TraceCheckUtils]: 8: Hoare triple {1160#true} assume !(0 == ~cond); {1160#true} is VALID [2022-04-14 17:41:36,241 INFO L290 TraceCheckUtils]: 9: Hoare triple {1160#true} assume true; {1160#true} is VALID [2022-04-14 17:41:36,242 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1160#true} {1160#true} #53#return; {1160#true} is VALID [2022-04-14 17:41:36,242 INFO L272 TraceCheckUtils]: 11: Hoare triple {1160#true} call assume_abort_if_not((if ~k~0 <= 256 then 1 else 0)); {1160#true} is VALID [2022-04-14 17:41:36,242 INFO L290 TraceCheckUtils]: 12: Hoare triple {1160#true} ~cond := #in~cond; {1160#true} is VALID [2022-04-14 17:41:36,242 INFO L290 TraceCheckUtils]: 13: Hoare triple {1160#true} assume !(0 == ~cond); {1160#true} is VALID [2022-04-14 17:41:36,242 INFO L290 TraceCheckUtils]: 14: Hoare triple {1160#true} assume true; {1160#true} is VALID [2022-04-14 17:41:36,242 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {1160#true} {1160#true} #55#return; {1160#true} is VALID [2022-04-14 17:41:36,242 INFO L290 TraceCheckUtils]: 16: Hoare triple {1160#true} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {1213#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-14 17:41:36,243 INFO L290 TraceCheckUtils]: 17: Hoare triple {1213#(and (= main_~c~0 0) (= main_~y~0 0))} assume !false; {1213#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-14 17:41:36,243 INFO L272 TraceCheckUtils]: 18: Hoare triple {1213#(and (= main_~c~0 0) (= main_~y~0 0))} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {1160#true} is VALID [2022-04-14 17:41:36,243 INFO L290 TraceCheckUtils]: 19: Hoare triple {1160#true} ~cond := #in~cond; {1160#true} is VALID [2022-04-14 17:41:36,243 INFO L290 TraceCheckUtils]: 20: Hoare triple {1160#true} assume !(0 == ~cond); {1160#true} is VALID [2022-04-14 17:41:36,243 INFO L290 TraceCheckUtils]: 21: Hoare triple {1160#true} assume true; {1160#true} is VALID [2022-04-14 17:41:36,244 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {1160#true} {1213#(and (= main_~c~0 0) (= main_~y~0 0))} #57#return; {1213#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-14 17:41:36,245 INFO L290 TraceCheckUtils]: 23: Hoare triple {1213#(and (= main_~c~0 0) (= main_~y~0 0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {1235#(and (= main_~y~0 1) (< 0 main_~k~0) (= main_~c~0 1))} is VALID [2022-04-14 17:41:36,245 INFO L290 TraceCheckUtils]: 24: Hoare triple {1235#(and (= main_~y~0 1) (< 0 main_~k~0) (= main_~c~0 1))} assume !false; {1235#(and (= main_~y~0 1) (< 0 main_~k~0) (= main_~c~0 1))} is VALID [2022-04-14 17:41:36,245 INFO L272 TraceCheckUtils]: 25: Hoare triple {1235#(and (= main_~y~0 1) (< 0 main_~k~0) (= main_~c~0 1))} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {1160#true} is VALID [2022-04-14 17:41:36,245 INFO L290 TraceCheckUtils]: 26: Hoare triple {1160#true} ~cond := #in~cond; {1160#true} is VALID [2022-04-14 17:41:36,245 INFO L290 TraceCheckUtils]: 27: Hoare triple {1160#true} assume !(0 == ~cond); {1160#true} is VALID [2022-04-14 17:41:36,245 INFO L290 TraceCheckUtils]: 28: Hoare triple {1160#true} assume true; {1160#true} is VALID [2022-04-14 17:41:36,247 INFO L284 TraceCheckUtils]: 29: Hoare quadruple {1160#true} {1235#(and (= main_~y~0 1) (< 0 main_~k~0) (= main_~c~0 1))} #57#return; {1235#(and (= main_~y~0 1) (< 0 main_~k~0) (= main_~c~0 1))} is VALID [2022-04-14 17:41:36,247 INFO L290 TraceCheckUtils]: 30: Hoare triple {1235#(and (= main_~y~0 1) (< 0 main_~k~0) (= main_~c~0 1))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {1257#(and (= main_~y~0 2) (< 1 main_~k~0) (<= main_~c~0 2))} is VALID [2022-04-14 17:41:36,248 INFO L290 TraceCheckUtils]: 31: Hoare triple {1257#(and (= main_~y~0 2) (< 1 main_~k~0) (<= main_~c~0 2))} assume !false; {1257#(and (= main_~y~0 2) (< 1 main_~k~0) (<= main_~c~0 2))} is VALID [2022-04-14 17:41:36,248 INFO L272 TraceCheckUtils]: 32: Hoare triple {1257#(and (= main_~y~0 2) (< 1 main_~k~0) (<= main_~c~0 2))} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {1160#true} is VALID [2022-04-14 17:41:36,248 INFO L290 TraceCheckUtils]: 33: Hoare triple {1160#true} ~cond := #in~cond; {1160#true} is VALID [2022-04-14 17:41:36,248 INFO L290 TraceCheckUtils]: 34: Hoare triple {1160#true} assume !(0 == ~cond); {1160#true} is VALID [2022-04-14 17:41:36,248 INFO L290 TraceCheckUtils]: 35: Hoare triple {1160#true} assume true; {1160#true} is VALID [2022-04-14 17:41:36,248 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {1160#true} {1257#(and (= main_~y~0 2) (< 1 main_~k~0) (<= main_~c~0 2))} #57#return; {1257#(and (= main_~y~0 2) (< 1 main_~k~0) (<= main_~c~0 2))} is VALID [2022-04-14 17:41:36,249 INFO L290 TraceCheckUtils]: 37: Hoare triple {1257#(and (= main_~y~0 2) (< 1 main_~k~0) (<= main_~c~0 2))} assume !(~c~0 < ~k~0); {1279#(and (= main_~y~0 2) (< 1 main_~k~0) (<= main_~k~0 2))} is VALID [2022-04-14 17:41:36,249 INFO L272 TraceCheckUtils]: 38: Hoare triple {1279#(and (= main_~y~0 2) (< 1 main_~k~0) (<= main_~k~0 2))} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {1160#true} is VALID [2022-04-14 17:41:36,249 INFO L290 TraceCheckUtils]: 39: Hoare triple {1160#true} ~cond := #in~cond; {1160#true} is VALID [2022-04-14 17:41:36,249 INFO L290 TraceCheckUtils]: 40: Hoare triple {1160#true} assume !(0 == ~cond); {1160#true} is VALID [2022-04-14 17:41:36,249 INFO L290 TraceCheckUtils]: 41: Hoare triple {1160#true} assume true; {1160#true} is VALID [2022-04-14 17:41:36,250 INFO L284 TraceCheckUtils]: 42: Hoare quadruple {1160#true} {1279#(and (= main_~y~0 2) (< 1 main_~k~0) (<= main_~k~0 2))} #59#return; {1279#(and (= main_~y~0 2) (< 1 main_~k~0) (<= main_~k~0 2))} is VALID [2022-04-14 17:41:36,250 INFO L272 TraceCheckUtils]: 43: Hoare triple {1279#(and (= main_~y~0 2) (< 1 main_~k~0) (<= main_~k~0 2))} call __VERIFIER_assert((if ~k~0 * ~y~0 == ~y~0 * ~y~0 then 1 else 0)); {1298#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-14 17:41:36,250 INFO L290 TraceCheckUtils]: 44: Hoare triple {1298#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1302#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-14 17:41:36,251 INFO L290 TraceCheckUtils]: 45: Hoare triple {1302#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1161#false} is VALID [2022-04-14 17:41:36,251 INFO L290 TraceCheckUtils]: 46: Hoare triple {1161#false} assume !false; {1161#false} is VALID [2022-04-14 17:41:36,251 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 8 proven. 9 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2022-04-14 17:41:36,251 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-14 17:41:36,614 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-14 17:41:36,615 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1447964993] [2022-04-14 17:41:36,615 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-14 17:41:36,615 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1900165726] [2022-04-14 17:41:36,615 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1900165726] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-14 17:41:36,615 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-14 17:41:36,615 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2022-04-14 17:41:36,615 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1923794758] [2022-04-14 17:41:36,615 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2022-04-14 17:41:36,615 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 5 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 5 states have call predecessors, (7), 5 states have call successors, (7) Word has length 47 [2022-04-14 17:41:36,616 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-14 17:41:36,616 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 8 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 5 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 5 states have call predecessors, (7), 5 states have call successors, (7) [2022-04-14 17:41:36,638 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 35 edges. 35 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-14 17:41:36,638 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-14 17:41:36,638 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-14 17:41:36,638 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-14 17:41:36,638 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2022-04-14 17:41:36,638 INFO L87 Difference]: Start difference. First operand 36 states and 39 transitions. Second operand has 8 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 5 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 5 states have call predecessors, (7), 5 states have call successors, (7) [2022-04-14 17:41:36,917 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 17:41:36,917 INFO L93 Difference]: Finished difference Result 45 states and 50 transitions. [2022-04-14 17:41:36,917 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-14 17:41:36,918 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 5 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 5 states have call predecessors, (7), 5 states have call successors, (7) Word has length 47 [2022-04-14 17:41:36,919 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-14 17:41:36,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 5 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 5 states have call predecessors, (7), 5 states have call successors, (7) [2022-04-14 17:41:36,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 46 transitions. [2022-04-14 17:41:36,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 5 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 5 states have call predecessors, (7), 5 states have call successors, (7) [2022-04-14 17:41:36,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 46 transitions. [2022-04-14 17:41:36,921 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 46 transitions. [2022-04-14 17:41:36,963 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 46 edges. 46 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-14 17:41:36,964 INFO L225 Difference]: With dead ends: 45 [2022-04-14 17:41:36,964 INFO L226 Difference]: Without dead ends: 39 [2022-04-14 17:41:36,964 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 60 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=140, Unknown=0, NotChecked=0, Total=182 [2022-04-14 17:41:36,965 INFO L913 BasicCegarLoop]: 33 mSDtfsCounter, 2 mSDsluCounter, 131 mSDsCounter, 0 mSdLazyCounter, 89 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 164 SdHoareTripleChecker+Invalid, 90 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 89 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-14 17:41:36,965 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [2 Valid, 164 Invalid, 90 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 89 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-14 17:41:36,965 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2022-04-14 17:41:36,973 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2022-04-14 17:41:36,973 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-14 17:41:36,973 INFO L82 GeneralOperation]: Start isEquivalent. First operand 39 states. Second operand has 39 states, 24 states have (on average 1.0416666666666667) internal successors, (25), 24 states have internal predecessors, (25), 10 states have call successors, (10), 6 states have call predecessors, (10), 4 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-14 17:41:36,973 INFO L74 IsIncluded]: Start isIncluded. First operand 39 states. Second operand has 39 states, 24 states have (on average 1.0416666666666667) internal successors, (25), 24 states have internal predecessors, (25), 10 states have call successors, (10), 6 states have call predecessors, (10), 4 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-14 17:41:36,974 INFO L87 Difference]: Start difference. First operand 39 states. Second operand has 39 states, 24 states have (on average 1.0416666666666667) internal successors, (25), 24 states have internal predecessors, (25), 10 states have call successors, (10), 6 states have call predecessors, (10), 4 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-14 17:41:36,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 17:41:36,975 INFO L93 Difference]: Finished difference Result 39 states and 43 transitions. [2022-04-14 17:41:36,975 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 43 transitions. [2022-04-14 17:41:36,975 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 17:41:36,975 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 17:41:36,975 INFO L74 IsIncluded]: Start isIncluded. First operand has 39 states, 24 states have (on average 1.0416666666666667) internal successors, (25), 24 states have internal predecessors, (25), 10 states have call successors, (10), 6 states have call predecessors, (10), 4 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Second operand 39 states. [2022-04-14 17:41:36,976 INFO L87 Difference]: Start difference. First operand has 39 states, 24 states have (on average 1.0416666666666667) internal successors, (25), 24 states have internal predecessors, (25), 10 states have call successors, (10), 6 states have call predecessors, (10), 4 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Second operand 39 states. [2022-04-14 17:41:36,977 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 17:41:36,977 INFO L93 Difference]: Finished difference Result 39 states and 43 transitions. [2022-04-14 17:41:36,977 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 43 transitions. [2022-04-14 17:41:36,977 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 17:41:36,977 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 17:41:36,977 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-14 17:41:36,977 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-14 17:41:36,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 24 states have (on average 1.0416666666666667) internal successors, (25), 24 states have internal predecessors, (25), 10 states have call successors, (10), 6 states have call predecessors, (10), 4 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-14 17:41:36,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 43 transitions. [2022-04-14 17:41:36,978 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 43 transitions. Word has length 47 [2022-04-14 17:41:36,979 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-14 17:41:36,979 INFO L478 AbstractCegarLoop]: Abstraction has 39 states and 43 transitions. [2022-04-14 17:41:36,979 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 5 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 5 states have call predecessors, (7), 5 states have call successors, (7) [2022-04-14 17:41:36,979 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 43 transitions. [2022-04-14 17:41:36,979 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2022-04-14 17:41:36,979 INFO L491 BasicCegarLoop]: Found error trace [2022-04-14 17:41:36,979 INFO L499 BasicCegarLoop]: trace histogram [6, 5, 5, 4, 4, 4, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-14 17:41:36,983 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-04-14 17:41:37,180 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-14 17:41:37,180 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-14 17:41:37,181 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-14 17:41:37,181 INFO L85 PathProgramCache]: Analyzing trace with hash -1213805219, now seen corresponding path program 3 times [2022-04-14 17:41:37,181 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-14 17:41:37,181 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [813692052] [2022-04-14 17:41:37,181 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 17:41:37,181 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-14 17:41:37,206 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-14 17:41:37,206 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1823616784] [2022-04-14 17:41:37,206 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-04-14 17:41:37,206 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-14 17:41:37,206 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-14 17:41:37,213 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-14 17:41:37,214 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-04-14 17:41:37,424 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2022-04-14 17:41:37,424 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-14 17:41:37,425 INFO L263 TraceCheckSpWp]: Trace formula consists of 147 conjuncts, 20 conjunts are in the unsatisfiable core [2022-04-14 17:41:37,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 17:41:37,442 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-14 17:41:37,741 INFO L272 TraceCheckUtils]: 0: Hoare triple {1596#true} call ULTIMATE.init(); {1596#true} is VALID [2022-04-14 17:41:37,741 INFO L290 TraceCheckUtils]: 1: Hoare triple {1596#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); {1596#true} is VALID [2022-04-14 17:41:37,741 INFO L290 TraceCheckUtils]: 2: Hoare triple {1596#true} assume true; {1596#true} is VALID [2022-04-14 17:41:37,741 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1596#true} {1596#true} #63#return; {1596#true} is VALID [2022-04-14 17:41:37,741 INFO L272 TraceCheckUtils]: 4: Hoare triple {1596#true} call #t~ret5 := main(); {1596#true} is VALID [2022-04-14 17:41:37,741 INFO L290 TraceCheckUtils]: 5: Hoare triple {1596#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; {1596#true} is VALID [2022-04-14 17:41:37,741 INFO L272 TraceCheckUtils]: 6: Hoare triple {1596#true} call assume_abort_if_not((if ~k~0 >= 0 && ~k~0 <= 20 then 1 else 0)); {1596#true} is VALID [2022-04-14 17:41:37,741 INFO L290 TraceCheckUtils]: 7: Hoare triple {1596#true} ~cond := #in~cond; {1596#true} is VALID [2022-04-14 17:41:37,742 INFO L290 TraceCheckUtils]: 8: Hoare triple {1596#true} assume !(0 == ~cond); {1596#true} is VALID [2022-04-14 17:41:37,742 INFO L290 TraceCheckUtils]: 9: Hoare triple {1596#true} assume true; {1596#true} is VALID [2022-04-14 17:41:37,742 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1596#true} {1596#true} #53#return; {1596#true} is VALID [2022-04-14 17:41:37,742 INFO L272 TraceCheckUtils]: 11: Hoare triple {1596#true} call assume_abort_if_not((if ~k~0 <= 256 then 1 else 0)); {1596#true} is VALID [2022-04-14 17:41:37,742 INFO L290 TraceCheckUtils]: 12: Hoare triple {1596#true} ~cond := #in~cond; {1596#true} is VALID [2022-04-14 17:41:37,742 INFO L290 TraceCheckUtils]: 13: Hoare triple {1596#true} assume !(0 == ~cond); {1596#true} is VALID [2022-04-14 17:41:37,742 INFO L290 TraceCheckUtils]: 14: Hoare triple {1596#true} assume true; {1596#true} is VALID [2022-04-14 17:41:37,742 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {1596#true} {1596#true} #55#return; {1596#true} is VALID [2022-04-14 17:41:37,742 INFO L290 TraceCheckUtils]: 16: Hoare triple {1596#true} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {1649#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-14 17:41:37,743 INFO L290 TraceCheckUtils]: 17: Hoare triple {1649#(and (= main_~c~0 0) (= main_~y~0 0))} assume !false; {1649#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-14 17:41:37,743 INFO L272 TraceCheckUtils]: 18: Hoare triple {1649#(and (= main_~c~0 0) (= main_~y~0 0))} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {1596#true} is VALID [2022-04-14 17:41:37,743 INFO L290 TraceCheckUtils]: 19: Hoare triple {1596#true} ~cond := #in~cond; {1596#true} is VALID [2022-04-14 17:41:37,743 INFO L290 TraceCheckUtils]: 20: Hoare triple {1596#true} assume !(0 == ~cond); {1596#true} is VALID [2022-04-14 17:41:37,743 INFO L290 TraceCheckUtils]: 21: Hoare triple {1596#true} assume true; {1596#true} is VALID [2022-04-14 17:41:37,743 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {1596#true} {1649#(and (= main_~c~0 0) (= main_~y~0 0))} #57#return; {1649#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-14 17:41:37,744 INFO L290 TraceCheckUtils]: 23: Hoare triple {1649#(and (= main_~c~0 0) (= main_~y~0 0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {1671#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} is VALID [2022-04-14 17:41:37,744 INFO L290 TraceCheckUtils]: 24: Hoare triple {1671#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} assume !false; {1671#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} is VALID [2022-04-14 17:41:37,744 INFO L272 TraceCheckUtils]: 25: Hoare triple {1671#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {1596#true} is VALID [2022-04-14 17:41:37,744 INFO L290 TraceCheckUtils]: 26: Hoare triple {1596#true} ~cond := #in~cond; {1596#true} is VALID [2022-04-14 17:41:37,744 INFO L290 TraceCheckUtils]: 27: Hoare triple {1596#true} assume !(0 == ~cond); {1596#true} is VALID [2022-04-14 17:41:37,744 INFO L290 TraceCheckUtils]: 28: Hoare triple {1596#true} assume true; {1596#true} is VALID [2022-04-14 17:41:37,745 INFO L284 TraceCheckUtils]: 29: Hoare quadruple {1596#true} {1671#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} #57#return; {1671#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} is VALID [2022-04-14 17:41:37,745 INFO L290 TraceCheckUtils]: 30: Hoare triple {1671#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {1693#(and (= (+ (- 2) main_~y~0) 0) (= main_~c~0 2))} is VALID [2022-04-14 17:41:37,746 INFO L290 TraceCheckUtils]: 31: Hoare triple {1693#(and (= (+ (- 2) main_~y~0) 0) (= main_~c~0 2))} assume !false; {1693#(and (= (+ (- 2) main_~y~0) 0) (= main_~c~0 2))} is VALID [2022-04-14 17:41:37,746 INFO L272 TraceCheckUtils]: 32: Hoare triple {1693#(and (= (+ (- 2) main_~y~0) 0) (= main_~c~0 2))} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {1596#true} is VALID [2022-04-14 17:41:37,746 INFO L290 TraceCheckUtils]: 33: Hoare triple {1596#true} ~cond := #in~cond; {1596#true} is VALID [2022-04-14 17:41:37,746 INFO L290 TraceCheckUtils]: 34: Hoare triple {1596#true} assume !(0 == ~cond); {1596#true} is VALID [2022-04-14 17:41:37,746 INFO L290 TraceCheckUtils]: 35: Hoare triple {1596#true} assume true; {1596#true} is VALID [2022-04-14 17:41:37,746 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {1596#true} {1693#(and (= (+ (- 2) main_~y~0) 0) (= main_~c~0 2))} #57#return; {1693#(and (= (+ (- 2) main_~y~0) 0) (= main_~c~0 2))} is VALID [2022-04-14 17:41:37,747 INFO L290 TraceCheckUtils]: 37: Hoare triple {1693#(and (= (+ (- 2) main_~y~0) 0) (= main_~c~0 2))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {1715#(and (<= main_~c~0 3) (= main_~y~0 3) (< 2 main_~k~0))} is VALID [2022-04-14 17:41:37,747 INFO L290 TraceCheckUtils]: 38: Hoare triple {1715#(and (<= main_~c~0 3) (= main_~y~0 3) (< 2 main_~k~0))} assume !false; {1715#(and (<= main_~c~0 3) (= main_~y~0 3) (< 2 main_~k~0))} is VALID [2022-04-14 17:41:37,747 INFO L272 TraceCheckUtils]: 39: Hoare triple {1715#(and (<= main_~c~0 3) (= main_~y~0 3) (< 2 main_~k~0))} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {1596#true} is VALID [2022-04-14 17:41:37,747 INFO L290 TraceCheckUtils]: 40: Hoare triple {1596#true} ~cond := #in~cond; {1596#true} is VALID [2022-04-14 17:41:37,747 INFO L290 TraceCheckUtils]: 41: Hoare triple {1596#true} assume !(0 == ~cond); {1596#true} is VALID [2022-04-14 17:41:37,747 INFO L290 TraceCheckUtils]: 42: Hoare triple {1596#true} assume true; {1596#true} is VALID [2022-04-14 17:41:37,754 INFO L284 TraceCheckUtils]: 43: Hoare quadruple {1596#true} {1715#(and (<= main_~c~0 3) (= main_~y~0 3) (< 2 main_~k~0))} #57#return; {1715#(and (<= main_~c~0 3) (= main_~y~0 3) (< 2 main_~k~0))} is VALID [2022-04-14 17:41:37,754 INFO L290 TraceCheckUtils]: 44: Hoare triple {1715#(and (<= main_~c~0 3) (= main_~y~0 3) (< 2 main_~k~0))} assume !(~c~0 < ~k~0); {1737#(and (= main_~y~0 3) (<= main_~k~0 3) (< 2 main_~k~0))} is VALID [2022-04-14 17:41:37,754 INFO L272 TraceCheckUtils]: 45: Hoare triple {1737#(and (= main_~y~0 3) (<= main_~k~0 3) (< 2 main_~k~0))} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {1596#true} is VALID [2022-04-14 17:41:37,754 INFO L290 TraceCheckUtils]: 46: Hoare triple {1596#true} ~cond := #in~cond; {1596#true} is VALID [2022-04-14 17:41:37,754 INFO L290 TraceCheckUtils]: 47: Hoare triple {1596#true} assume !(0 == ~cond); {1596#true} is VALID [2022-04-14 17:41:37,754 INFO L290 TraceCheckUtils]: 48: Hoare triple {1596#true} assume true; {1596#true} is VALID [2022-04-14 17:41:37,755 INFO L284 TraceCheckUtils]: 49: Hoare quadruple {1596#true} {1737#(and (= main_~y~0 3) (<= main_~k~0 3) (< 2 main_~k~0))} #59#return; {1737#(and (= main_~y~0 3) (<= main_~k~0 3) (< 2 main_~k~0))} is VALID [2022-04-14 17:41:37,756 INFO L272 TraceCheckUtils]: 50: Hoare triple {1737#(and (= main_~y~0 3) (<= main_~k~0 3) (< 2 main_~k~0))} call __VERIFIER_assert((if ~k~0 * ~y~0 == ~y~0 * ~y~0 then 1 else 0)); {1756#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-14 17:41:37,756 INFO L290 TraceCheckUtils]: 51: Hoare triple {1756#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1760#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-14 17:41:37,756 INFO L290 TraceCheckUtils]: 52: Hoare triple {1760#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1597#false} is VALID [2022-04-14 17:41:37,756 INFO L290 TraceCheckUtils]: 53: Hoare triple {1597#false} assume !false; {1597#false} is VALID [2022-04-14 17:41:37,756 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 10 proven. 18 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2022-04-14 17:41:37,756 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-14 17:41:38,036 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-14 17:41:38,036 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [813692052] [2022-04-14 17:41:38,036 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-14 17:41:38,036 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1823616784] [2022-04-14 17:41:38,036 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1823616784] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-14 17:41:38,036 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-14 17:41:38,037 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2022-04-14 17:41:38,037 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [747923315] [2022-04-14 17:41:38,037 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2022-04-14 17:41:38,037 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 6 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (8), 6 states have call predecessors, (8), 6 states have call successors, (8) Word has length 54 [2022-04-14 17:41:38,037 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-14 17:41:38,037 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 9 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 6 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (8), 6 states have call predecessors, (8), 6 states have call successors, (8) [2022-04-14 17:41:38,063 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 39 edges. 39 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-14 17:41:38,063 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-04-14 17:41:38,064 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-14 17:41:38,064 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-04-14 17:41:38,064 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2022-04-14 17:41:38,064 INFO L87 Difference]: Start difference. First operand 39 states and 43 transitions. Second operand has 9 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 6 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (8), 6 states have call predecessors, (8), 6 states have call successors, (8) [2022-04-14 17:41:38,414 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 17:41:38,414 INFO L93 Difference]: Finished difference Result 48 states and 54 transitions. [2022-04-14 17:41:38,414 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-14 17:41:38,414 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 6 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (8), 6 states have call predecessors, (8), 6 states have call successors, (8) Word has length 54 [2022-04-14 17:41:38,414 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-14 17:41:38,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 6 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (8), 6 states have call predecessors, (8), 6 states have call successors, (8) [2022-04-14 17:41:38,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 50 transitions. [2022-04-14 17:41:38,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 6 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (8), 6 states have call predecessors, (8), 6 states have call successors, (8) [2022-04-14 17:41:38,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 50 transitions. [2022-04-14 17:41:38,417 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 9 states and 50 transitions. [2022-04-14 17:41:38,456 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 50 edges. 50 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-14 17:41:38,457 INFO L225 Difference]: With dead ends: 48 [2022-04-14 17:41:38,457 INFO L226 Difference]: Without dead ends: 42 [2022-04-14 17:41:38,457 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 60 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=142, Unknown=0, NotChecked=0, Total=182 [2022-04-14 17:41:38,458 INFO L913 BasicCegarLoop]: 36 mSDtfsCounter, 2 mSDsluCounter, 163 mSDsCounter, 0 mSdLazyCounter, 121 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 199 SdHoareTripleChecker+Invalid, 122 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 121 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-14 17:41:38,458 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [2 Valid, 199 Invalid, 122 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 121 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-14 17:41:38,458 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2022-04-14 17:41:38,468 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2022-04-14 17:41:38,469 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-14 17:41:38,469 INFO L82 GeneralOperation]: Start isEquivalent. First operand 42 states. Second operand has 42 states, 26 states have (on average 1.0384615384615385) internal successors, (27), 26 states have internal predecessors, (27), 11 states have call successors, (11), 6 states have call predecessors, (11), 4 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-14 17:41:38,469 INFO L74 IsIncluded]: Start isIncluded. First operand 42 states. Second operand has 42 states, 26 states have (on average 1.0384615384615385) internal successors, (27), 26 states have internal predecessors, (27), 11 states have call successors, (11), 6 states have call predecessors, (11), 4 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-14 17:41:38,469 INFO L87 Difference]: Start difference. First operand 42 states. Second operand has 42 states, 26 states have (on average 1.0384615384615385) internal successors, (27), 26 states have internal predecessors, (27), 11 states have call successors, (11), 6 states have call predecessors, (11), 4 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-14 17:41:38,470 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 17:41:38,471 INFO L93 Difference]: Finished difference Result 42 states and 47 transitions. [2022-04-14 17:41:38,471 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 47 transitions. [2022-04-14 17:41:38,471 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 17:41:38,471 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 17:41:38,471 INFO L74 IsIncluded]: Start isIncluded. First operand has 42 states, 26 states have (on average 1.0384615384615385) internal successors, (27), 26 states have internal predecessors, (27), 11 states have call successors, (11), 6 states have call predecessors, (11), 4 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) Second operand 42 states. [2022-04-14 17:41:38,471 INFO L87 Difference]: Start difference. First operand has 42 states, 26 states have (on average 1.0384615384615385) internal successors, (27), 26 states have internal predecessors, (27), 11 states have call successors, (11), 6 states have call predecessors, (11), 4 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) Second operand 42 states. [2022-04-14 17:41:38,472 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 17:41:38,472 INFO L93 Difference]: Finished difference Result 42 states and 47 transitions. [2022-04-14 17:41:38,472 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 47 transitions. [2022-04-14 17:41:38,473 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 17:41:38,473 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 17:41:38,473 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-14 17:41:38,473 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-14 17:41:38,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 26 states have (on average 1.0384615384615385) internal successors, (27), 26 states have internal predecessors, (27), 11 states have call successors, (11), 6 states have call predecessors, (11), 4 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-14 17:41:38,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 47 transitions. [2022-04-14 17:41:38,474 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 47 transitions. Word has length 54 [2022-04-14 17:41:38,474 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-14 17:41:38,474 INFO L478 AbstractCegarLoop]: Abstraction has 42 states and 47 transitions. [2022-04-14 17:41:38,474 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 6 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (8), 6 states have call predecessors, (8), 6 states have call successors, (8) [2022-04-14 17:41:38,474 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 47 transitions. [2022-04-14 17:41:38,475 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2022-04-14 17:41:38,475 INFO L491 BasicCegarLoop]: Found error trace [2022-04-14 17:41:38,475 INFO L499 BasicCegarLoop]: trace histogram [7, 6, 6, 5, 5, 5, 4, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-14 17:41:38,480 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-04-14 17:41:38,680 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-14 17:41:38,680 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-14 17:41:38,680 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-14 17:41:38,681 INFO L85 PathProgramCache]: Analyzing trace with hash 307258797, now seen corresponding path program 4 times [2022-04-14 17:41:38,681 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-14 17:41:38,681 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [550999273] [2022-04-14 17:41:38,681 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 17:41:38,681 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-14 17:41:38,690 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-14 17:41:38,690 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [978580545] [2022-04-14 17:41:38,691 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-14 17:41:38,691 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-14 17:41:38,691 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-14 17:41:38,691 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-14 17:41:38,692 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-04-14 17:41:38,723 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-14 17:41:38,723 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-14 17:41:38,723 INFO L263 TraceCheckSpWp]: Trace formula consists of 105 conjuncts, 24 conjunts are in the unsatisfiable core [2022-04-14 17:41:38,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 17:41:38,734 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-14 17:41:39,107 INFO L272 TraceCheckUtils]: 0: Hoare triple {2048#true} call ULTIMATE.init(); {2048#true} is VALID [2022-04-14 17:41:39,107 INFO L290 TraceCheckUtils]: 1: Hoare triple {2048#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); {2048#true} is VALID [2022-04-14 17:41:39,107 INFO L290 TraceCheckUtils]: 2: Hoare triple {2048#true} assume true; {2048#true} is VALID [2022-04-14 17:41:39,107 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2048#true} {2048#true} #63#return; {2048#true} is VALID [2022-04-14 17:41:39,107 INFO L272 TraceCheckUtils]: 4: Hoare triple {2048#true} call #t~ret5 := main(); {2048#true} is VALID [2022-04-14 17:41:39,107 INFO L290 TraceCheckUtils]: 5: Hoare triple {2048#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; {2048#true} is VALID [2022-04-14 17:41:39,107 INFO L272 TraceCheckUtils]: 6: Hoare triple {2048#true} call assume_abort_if_not((if ~k~0 >= 0 && ~k~0 <= 20 then 1 else 0)); {2048#true} is VALID [2022-04-14 17:41:39,107 INFO L290 TraceCheckUtils]: 7: Hoare triple {2048#true} ~cond := #in~cond; {2048#true} is VALID [2022-04-14 17:41:39,107 INFO L290 TraceCheckUtils]: 8: Hoare triple {2048#true} assume !(0 == ~cond); {2048#true} is VALID [2022-04-14 17:41:39,107 INFO L290 TraceCheckUtils]: 9: Hoare triple {2048#true} assume true; {2048#true} is VALID [2022-04-14 17:41:39,107 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {2048#true} {2048#true} #53#return; {2048#true} is VALID [2022-04-14 17:41:39,108 INFO L272 TraceCheckUtils]: 11: Hoare triple {2048#true} call assume_abort_if_not((if ~k~0 <= 256 then 1 else 0)); {2048#true} is VALID [2022-04-14 17:41:39,108 INFO L290 TraceCheckUtils]: 12: Hoare triple {2048#true} ~cond := #in~cond; {2048#true} is VALID [2022-04-14 17:41:39,108 INFO L290 TraceCheckUtils]: 13: Hoare triple {2048#true} assume !(0 == ~cond); {2048#true} is VALID [2022-04-14 17:41:39,108 INFO L290 TraceCheckUtils]: 14: Hoare triple {2048#true} assume true; {2048#true} is VALID [2022-04-14 17:41:39,108 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {2048#true} {2048#true} #55#return; {2048#true} is VALID [2022-04-14 17:41:39,109 INFO L290 TraceCheckUtils]: 16: Hoare triple {2048#true} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {2101#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-14 17:41:39,109 INFO L290 TraceCheckUtils]: 17: Hoare triple {2101#(and (= main_~c~0 0) (= main_~y~0 0))} assume !false; {2101#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-14 17:41:39,109 INFO L272 TraceCheckUtils]: 18: Hoare triple {2101#(and (= main_~c~0 0) (= main_~y~0 0))} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {2048#true} is VALID [2022-04-14 17:41:39,109 INFO L290 TraceCheckUtils]: 19: Hoare triple {2048#true} ~cond := #in~cond; {2048#true} is VALID [2022-04-14 17:41:39,109 INFO L290 TraceCheckUtils]: 20: Hoare triple {2048#true} assume !(0 == ~cond); {2048#true} is VALID [2022-04-14 17:41:39,109 INFO L290 TraceCheckUtils]: 21: Hoare triple {2048#true} assume true; {2048#true} is VALID [2022-04-14 17:41:39,110 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {2048#true} {2101#(and (= main_~c~0 0) (= main_~y~0 0))} #57#return; {2101#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-14 17:41:39,110 INFO L290 TraceCheckUtils]: 23: Hoare triple {2101#(and (= main_~c~0 0) (= main_~y~0 0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {2123#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} is VALID [2022-04-14 17:41:39,111 INFO L290 TraceCheckUtils]: 24: Hoare triple {2123#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} assume !false; {2123#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} is VALID [2022-04-14 17:41:39,111 INFO L272 TraceCheckUtils]: 25: Hoare triple {2123#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {2048#true} is VALID [2022-04-14 17:41:39,111 INFO L290 TraceCheckUtils]: 26: Hoare triple {2048#true} ~cond := #in~cond; {2048#true} is VALID [2022-04-14 17:41:39,111 INFO L290 TraceCheckUtils]: 27: Hoare triple {2048#true} assume !(0 == ~cond); {2048#true} is VALID [2022-04-14 17:41:39,111 INFO L290 TraceCheckUtils]: 28: Hoare triple {2048#true} assume true; {2048#true} is VALID [2022-04-14 17:41:39,112 INFO L284 TraceCheckUtils]: 29: Hoare quadruple {2048#true} {2123#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} #57#return; {2123#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} is VALID [2022-04-14 17:41:39,112 INFO L290 TraceCheckUtils]: 30: Hoare triple {2123#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {2145#(and (= (+ (- 1) main_~y~0) 1) (= main_~c~0 2))} is VALID [2022-04-14 17:41:39,112 INFO L290 TraceCheckUtils]: 31: Hoare triple {2145#(and (= (+ (- 1) main_~y~0) 1) (= main_~c~0 2))} assume !false; {2145#(and (= (+ (- 1) main_~y~0) 1) (= main_~c~0 2))} is VALID [2022-04-14 17:41:39,112 INFO L272 TraceCheckUtils]: 32: Hoare triple {2145#(and (= (+ (- 1) main_~y~0) 1) (= main_~c~0 2))} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {2048#true} is VALID [2022-04-14 17:41:39,112 INFO L290 TraceCheckUtils]: 33: Hoare triple {2048#true} ~cond := #in~cond; {2048#true} is VALID [2022-04-14 17:41:39,112 INFO L290 TraceCheckUtils]: 34: Hoare triple {2048#true} assume !(0 == ~cond); {2048#true} is VALID [2022-04-14 17:41:39,113 INFO L290 TraceCheckUtils]: 35: Hoare triple {2048#true} assume true; {2048#true} is VALID [2022-04-14 17:41:39,113 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {2048#true} {2145#(and (= (+ (- 1) main_~y~0) 1) (= main_~c~0 2))} #57#return; {2145#(and (= (+ (- 1) main_~y~0) 1) (= main_~c~0 2))} is VALID [2022-04-14 17:41:39,113 INFO L290 TraceCheckUtils]: 37: Hoare triple {2145#(and (= (+ (- 1) main_~y~0) 1) (= main_~c~0 2))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {2167#(and (= main_~y~0 3) (= main_~c~0 3))} is VALID [2022-04-14 17:41:39,114 INFO L290 TraceCheckUtils]: 38: Hoare triple {2167#(and (= main_~y~0 3) (= main_~c~0 3))} assume !false; {2167#(and (= main_~y~0 3) (= main_~c~0 3))} is VALID [2022-04-14 17:41:39,114 INFO L272 TraceCheckUtils]: 39: Hoare triple {2167#(and (= main_~y~0 3) (= main_~c~0 3))} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {2048#true} is VALID [2022-04-14 17:41:39,114 INFO L290 TraceCheckUtils]: 40: Hoare triple {2048#true} ~cond := #in~cond; {2048#true} is VALID [2022-04-14 17:41:39,114 INFO L290 TraceCheckUtils]: 41: Hoare triple {2048#true} assume !(0 == ~cond); {2048#true} is VALID [2022-04-14 17:41:39,114 INFO L290 TraceCheckUtils]: 42: Hoare triple {2048#true} assume true; {2048#true} is VALID [2022-04-14 17:41:39,114 INFO L284 TraceCheckUtils]: 43: Hoare quadruple {2048#true} {2167#(and (= main_~y~0 3) (= main_~c~0 3))} #57#return; {2167#(and (= main_~y~0 3) (= main_~c~0 3))} is VALID [2022-04-14 17:41:39,115 INFO L290 TraceCheckUtils]: 44: Hoare triple {2167#(and (= main_~y~0 3) (= main_~c~0 3))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {2189#(and (= 3 (+ (- 1) main_~y~0)) (< 3 main_~k~0) (<= main_~c~0 4))} is VALID [2022-04-14 17:41:39,115 INFO L290 TraceCheckUtils]: 45: Hoare triple {2189#(and (= 3 (+ (- 1) main_~y~0)) (< 3 main_~k~0) (<= main_~c~0 4))} assume !false; {2189#(and (= 3 (+ (- 1) main_~y~0)) (< 3 main_~k~0) (<= main_~c~0 4))} is VALID [2022-04-14 17:41:39,115 INFO L272 TraceCheckUtils]: 46: Hoare triple {2189#(and (= 3 (+ (- 1) main_~y~0)) (< 3 main_~k~0) (<= main_~c~0 4))} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {2048#true} is VALID [2022-04-14 17:41:39,115 INFO L290 TraceCheckUtils]: 47: Hoare triple {2048#true} ~cond := #in~cond; {2048#true} is VALID [2022-04-14 17:41:39,115 INFO L290 TraceCheckUtils]: 48: Hoare triple {2048#true} assume !(0 == ~cond); {2048#true} is VALID [2022-04-14 17:41:39,115 INFO L290 TraceCheckUtils]: 49: Hoare triple {2048#true} assume true; {2048#true} is VALID [2022-04-14 17:41:39,117 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {2048#true} {2189#(and (= 3 (+ (- 1) main_~y~0)) (< 3 main_~k~0) (<= main_~c~0 4))} #57#return; {2189#(and (= 3 (+ (- 1) main_~y~0)) (< 3 main_~k~0) (<= main_~c~0 4))} is VALID [2022-04-14 17:41:39,117 INFO L290 TraceCheckUtils]: 51: Hoare triple {2189#(and (= 3 (+ (- 1) main_~y~0)) (< 3 main_~k~0) (<= main_~c~0 4))} assume !(~c~0 < ~k~0); {2211#(and (= 3 (+ (- 1) main_~y~0)) (< 3 main_~k~0) (<= main_~k~0 4))} is VALID [2022-04-14 17:41:39,117 INFO L272 TraceCheckUtils]: 52: Hoare triple {2211#(and (= 3 (+ (- 1) main_~y~0)) (< 3 main_~k~0) (<= main_~k~0 4))} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {2048#true} is VALID [2022-04-14 17:41:39,117 INFO L290 TraceCheckUtils]: 53: Hoare triple {2048#true} ~cond := #in~cond; {2048#true} is VALID [2022-04-14 17:41:39,117 INFO L290 TraceCheckUtils]: 54: Hoare triple {2048#true} assume !(0 == ~cond); {2048#true} is VALID [2022-04-14 17:41:39,118 INFO L290 TraceCheckUtils]: 55: Hoare triple {2048#true} assume true; {2048#true} is VALID [2022-04-14 17:41:39,118 INFO L284 TraceCheckUtils]: 56: Hoare quadruple {2048#true} {2211#(and (= 3 (+ (- 1) main_~y~0)) (< 3 main_~k~0) (<= main_~k~0 4))} #59#return; {2211#(and (= 3 (+ (- 1) main_~y~0)) (< 3 main_~k~0) (<= main_~k~0 4))} is VALID [2022-04-14 17:41:39,119 INFO L272 TraceCheckUtils]: 57: Hoare triple {2211#(and (= 3 (+ (- 1) main_~y~0)) (< 3 main_~k~0) (<= main_~k~0 4))} call __VERIFIER_assert((if ~k~0 * ~y~0 == ~y~0 * ~y~0 then 1 else 0)); {2230#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-14 17:41:39,119 INFO L290 TraceCheckUtils]: 58: Hoare triple {2230#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {2234#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-14 17:41:39,119 INFO L290 TraceCheckUtils]: 59: Hoare triple {2234#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {2049#false} is VALID [2022-04-14 17:41:39,119 INFO L290 TraceCheckUtils]: 60: Hoare triple {2049#false} assume !false; {2049#false} is VALID [2022-04-14 17:41:39,120 INFO L134 CoverageAnalysis]: Checked inductivity of 106 backedges. 12 proven. 30 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2022-04-14 17:41:39,120 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-14 17:41:39,369 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-14 17:41:39,369 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [550999273] [2022-04-14 17:41:39,369 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-14 17:41:39,369 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [978580545] [2022-04-14 17:41:39,369 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [978580545] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-14 17:41:39,369 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-14 17:41:39,370 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2022-04-14 17:41:39,370 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2058333514] [2022-04-14 17:41:39,370 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2022-04-14 17:41:39,370 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 2.5555555555555554) internal successors, (23), 9 states have internal predecessors, (23), 7 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (9), 7 states have call predecessors, (9), 7 states have call successors, (9) Word has length 61 [2022-04-14 17:41:39,370 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-14 17:41:39,370 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 10 states, 9 states have (on average 2.5555555555555554) internal successors, (23), 9 states have internal predecessors, (23), 7 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (9), 7 states have call predecessors, (9), 7 states have call successors, (9) [2022-04-14 17:41:39,397 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 43 edges. 43 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-14 17:41:39,397 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-04-14 17:41:39,397 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-14 17:41:39,397 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-04-14 17:41:39,397 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2022-04-14 17:41:39,398 INFO L87 Difference]: Start difference. First operand 42 states and 47 transitions. Second operand has 10 states, 9 states have (on average 2.5555555555555554) internal successors, (23), 9 states have internal predecessors, (23), 7 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (9), 7 states have call predecessors, (9), 7 states have call successors, (9) [2022-04-14 17:41:39,876 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 17:41:39,876 INFO L93 Difference]: Finished difference Result 51 states and 58 transitions. [2022-04-14 17:41:39,876 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-04-14 17:41:39,877 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 2.5555555555555554) internal successors, (23), 9 states have internal predecessors, (23), 7 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (9), 7 states have call predecessors, (9), 7 states have call successors, (9) Word has length 61 [2022-04-14 17:41:39,877 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-14 17:41:39,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 9 states have (on average 2.5555555555555554) internal successors, (23), 9 states have internal predecessors, (23), 7 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (9), 7 states have call predecessors, (9), 7 states have call successors, (9) [2022-04-14 17:41:39,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 54 transitions. [2022-04-14 17:41:39,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 9 states have (on average 2.5555555555555554) internal successors, (23), 9 states have internal predecessors, (23), 7 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (9), 7 states have call predecessors, (9), 7 states have call successors, (9) [2022-04-14 17:41:39,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 54 transitions. [2022-04-14 17:41:39,895 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 10 states and 54 transitions. [2022-04-14 17:41:39,931 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 54 edges. 54 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-14 17:41:39,932 INFO L225 Difference]: With dead ends: 51 [2022-04-14 17:41:39,932 INFO L226 Difference]: Without dead ends: 45 [2022-04-14 17:41:39,932 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 66 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=167, Unknown=0, NotChecked=0, Total=210 [2022-04-14 17:41:39,933 INFO L913 BasicCegarLoop]: 39 mSDtfsCounter, 2 mSDsluCounter, 195 mSDsCounter, 0 mSdLazyCounter, 161 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 234 SdHoareTripleChecker+Invalid, 162 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 161 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-14 17:41:39,933 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [2 Valid, 234 Invalid, 162 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 161 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-14 17:41:39,933 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2022-04-14 17:41:39,945 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2022-04-14 17:41:39,945 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-14 17:41:39,945 INFO L82 GeneralOperation]: Start isEquivalent. First operand 45 states. Second operand has 45 states, 28 states have (on average 1.0357142857142858) internal successors, (29), 28 states have internal predecessors, (29), 12 states have call successors, (12), 6 states have call predecessors, (12), 4 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-14 17:41:39,945 INFO L74 IsIncluded]: Start isIncluded. First operand 45 states. Second operand has 45 states, 28 states have (on average 1.0357142857142858) internal successors, (29), 28 states have internal predecessors, (29), 12 states have call successors, (12), 6 states have call predecessors, (12), 4 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-14 17:41:39,946 INFO L87 Difference]: Start difference. First operand 45 states. Second operand has 45 states, 28 states have (on average 1.0357142857142858) internal successors, (29), 28 states have internal predecessors, (29), 12 states have call successors, (12), 6 states have call predecessors, (12), 4 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-14 17:41:39,947 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 17:41:39,947 INFO L93 Difference]: Finished difference Result 45 states and 51 transitions. [2022-04-14 17:41:39,947 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 51 transitions. [2022-04-14 17:41:39,947 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 17:41:39,947 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 17:41:39,947 INFO L74 IsIncluded]: Start isIncluded. First operand has 45 states, 28 states have (on average 1.0357142857142858) internal successors, (29), 28 states have internal predecessors, (29), 12 states have call successors, (12), 6 states have call predecessors, (12), 4 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) Second operand 45 states. [2022-04-14 17:41:39,947 INFO L87 Difference]: Start difference. First operand has 45 states, 28 states have (on average 1.0357142857142858) internal successors, (29), 28 states have internal predecessors, (29), 12 states have call successors, (12), 6 states have call predecessors, (12), 4 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) Second operand 45 states. [2022-04-14 17:41:39,949 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 17:41:39,949 INFO L93 Difference]: Finished difference Result 45 states and 51 transitions. [2022-04-14 17:41:39,949 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 51 transitions. [2022-04-14 17:41:39,949 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 17:41:39,949 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 17:41:39,949 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-14 17:41:39,949 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-14 17:41:39,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 28 states have (on average 1.0357142857142858) internal successors, (29), 28 states have internal predecessors, (29), 12 states have call successors, (12), 6 states have call predecessors, (12), 4 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-14 17:41:39,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 51 transitions. [2022-04-14 17:41:39,950 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 51 transitions. Word has length 61 [2022-04-14 17:41:39,951 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-14 17:41:39,951 INFO L478 AbstractCegarLoop]: Abstraction has 45 states and 51 transitions. [2022-04-14 17:41:39,951 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 2.5555555555555554) internal successors, (23), 9 states have internal predecessors, (23), 7 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (9), 7 states have call predecessors, (9), 7 states have call successors, (9) [2022-04-14 17:41:39,951 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 51 transitions. [2022-04-14 17:41:39,951 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2022-04-14 17:41:39,951 INFO L491 BasicCegarLoop]: Found error trace [2022-04-14 17:41:39,951 INFO L499 BasicCegarLoop]: trace histogram [8, 7, 7, 6, 6, 6, 5, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-14 17:41:39,983 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-14 17:41:40,152 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-14 17:41:40,152 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-14 17:41:40,152 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-14 17:41:40,152 INFO L85 PathProgramCache]: Analyzing trace with hash 1082774365, now seen corresponding path program 5 times [2022-04-14 17:41:40,152 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-14 17:41:40,152 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1057628069] [2022-04-14 17:41:40,153 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 17:41:40,153 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-14 17:41:40,162 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-14 17:41:40,162 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [633741590] [2022-04-14 17:41:40,163 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-04-14 17:41:40,163 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-14 17:41:40,163 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-14 17:41:40,165 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-14 17:41:40,167 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-04-14 17:41:54,795 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2022-04-14 17:41:54,795 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-14 17:41:54,818 INFO L263 TraceCheckSpWp]: Trace formula consists of 181 conjuncts, 28 conjunts are in the unsatisfiable core [2022-04-14 17:41:54,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 17:41:54,833 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-14 17:41:55,202 INFO L272 TraceCheckUtils]: 0: Hoare triple {2538#true} call ULTIMATE.init(); {2538#true} is VALID [2022-04-14 17:41:55,202 INFO L290 TraceCheckUtils]: 1: Hoare triple {2538#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); {2538#true} is VALID [2022-04-14 17:41:55,202 INFO L290 TraceCheckUtils]: 2: Hoare triple {2538#true} assume true; {2538#true} is VALID [2022-04-14 17:41:55,202 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2538#true} {2538#true} #63#return; {2538#true} is VALID [2022-04-14 17:41:55,202 INFO L272 TraceCheckUtils]: 4: Hoare triple {2538#true} call #t~ret5 := main(); {2538#true} is VALID [2022-04-14 17:41:55,202 INFO L290 TraceCheckUtils]: 5: Hoare triple {2538#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; {2538#true} is VALID [2022-04-14 17:41:55,203 INFO L272 TraceCheckUtils]: 6: Hoare triple {2538#true} call assume_abort_if_not((if ~k~0 >= 0 && ~k~0 <= 20 then 1 else 0)); {2538#true} is VALID [2022-04-14 17:41:55,203 INFO L290 TraceCheckUtils]: 7: Hoare triple {2538#true} ~cond := #in~cond; {2538#true} is VALID [2022-04-14 17:41:55,203 INFO L290 TraceCheckUtils]: 8: Hoare triple {2538#true} assume !(0 == ~cond); {2538#true} is VALID [2022-04-14 17:41:55,203 INFO L290 TraceCheckUtils]: 9: Hoare triple {2538#true} assume true; {2538#true} is VALID [2022-04-14 17:41:55,203 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {2538#true} {2538#true} #53#return; {2538#true} is VALID [2022-04-14 17:41:55,203 INFO L272 TraceCheckUtils]: 11: Hoare triple {2538#true} call assume_abort_if_not((if ~k~0 <= 256 then 1 else 0)); {2538#true} is VALID [2022-04-14 17:41:55,203 INFO L290 TraceCheckUtils]: 12: Hoare triple {2538#true} ~cond := #in~cond; {2538#true} is VALID [2022-04-14 17:41:55,203 INFO L290 TraceCheckUtils]: 13: Hoare triple {2538#true} assume !(0 == ~cond); {2538#true} is VALID [2022-04-14 17:41:55,203 INFO L290 TraceCheckUtils]: 14: Hoare triple {2538#true} assume true; {2538#true} is VALID [2022-04-14 17:41:55,203 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {2538#true} {2538#true} #55#return; {2538#true} is VALID [2022-04-14 17:41:55,203 INFO L290 TraceCheckUtils]: 16: Hoare triple {2538#true} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {2591#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-14 17:41:55,204 INFO L290 TraceCheckUtils]: 17: Hoare triple {2591#(and (= main_~c~0 0) (= main_~y~0 0))} assume !false; {2591#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-14 17:41:55,204 INFO L272 TraceCheckUtils]: 18: Hoare triple {2591#(and (= main_~c~0 0) (= main_~y~0 0))} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {2538#true} is VALID [2022-04-14 17:41:55,204 INFO L290 TraceCheckUtils]: 19: Hoare triple {2538#true} ~cond := #in~cond; {2538#true} is VALID [2022-04-14 17:41:55,204 INFO L290 TraceCheckUtils]: 20: Hoare triple {2538#true} assume !(0 == ~cond); {2538#true} is VALID [2022-04-14 17:41:55,204 INFO L290 TraceCheckUtils]: 21: Hoare triple {2538#true} assume true; {2538#true} is VALID [2022-04-14 17:41:55,208 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {2538#true} {2591#(and (= main_~c~0 0) (= main_~y~0 0))} #57#return; {2591#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-14 17:41:55,208 INFO L290 TraceCheckUtils]: 23: Hoare triple {2591#(and (= main_~c~0 0) (= main_~y~0 0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {2613#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} is VALID [2022-04-14 17:41:55,209 INFO L290 TraceCheckUtils]: 24: Hoare triple {2613#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} assume !false; {2613#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} is VALID [2022-04-14 17:41:55,209 INFO L272 TraceCheckUtils]: 25: Hoare triple {2613#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {2538#true} is VALID [2022-04-14 17:41:55,209 INFO L290 TraceCheckUtils]: 26: Hoare triple {2538#true} ~cond := #in~cond; {2538#true} is VALID [2022-04-14 17:41:55,209 INFO L290 TraceCheckUtils]: 27: Hoare triple {2538#true} assume !(0 == ~cond); {2538#true} is VALID [2022-04-14 17:41:55,209 INFO L290 TraceCheckUtils]: 28: Hoare triple {2538#true} assume true; {2538#true} is VALID [2022-04-14 17:41:55,209 INFO L284 TraceCheckUtils]: 29: Hoare quadruple {2538#true} {2613#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} #57#return; {2613#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} is VALID [2022-04-14 17:41:55,210 INFO L290 TraceCheckUtils]: 30: Hoare triple {2613#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {2635#(and (= main_~y~0 2) (= (+ (- 1) main_~c~0) 1))} is VALID [2022-04-14 17:41:55,210 INFO L290 TraceCheckUtils]: 31: Hoare triple {2635#(and (= main_~y~0 2) (= (+ (- 1) main_~c~0) 1))} assume !false; {2635#(and (= main_~y~0 2) (= (+ (- 1) main_~c~0) 1))} is VALID [2022-04-14 17:41:55,210 INFO L272 TraceCheckUtils]: 32: Hoare triple {2635#(and (= main_~y~0 2) (= (+ (- 1) main_~c~0) 1))} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {2538#true} is VALID [2022-04-14 17:41:55,210 INFO L290 TraceCheckUtils]: 33: Hoare triple {2538#true} ~cond := #in~cond; {2538#true} is VALID [2022-04-14 17:41:55,210 INFO L290 TraceCheckUtils]: 34: Hoare triple {2538#true} assume !(0 == ~cond); {2538#true} is VALID [2022-04-14 17:41:55,210 INFO L290 TraceCheckUtils]: 35: Hoare triple {2538#true} assume true; {2538#true} is VALID [2022-04-14 17:41:55,211 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {2538#true} {2635#(and (= main_~y~0 2) (= (+ (- 1) main_~c~0) 1))} #57#return; {2635#(and (= main_~y~0 2) (= (+ (- 1) main_~c~0) 1))} is VALID [2022-04-14 17:41:55,211 INFO L290 TraceCheckUtils]: 37: Hoare triple {2635#(and (= main_~y~0 2) (= (+ (- 1) main_~c~0) 1))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {2657#(and (= 2 (+ (- 1) main_~y~0)) (= main_~c~0 3))} is VALID [2022-04-14 17:41:55,212 INFO L290 TraceCheckUtils]: 38: Hoare triple {2657#(and (= 2 (+ (- 1) main_~y~0)) (= main_~c~0 3))} assume !false; {2657#(and (= 2 (+ (- 1) main_~y~0)) (= main_~c~0 3))} is VALID [2022-04-14 17:41:55,212 INFO L272 TraceCheckUtils]: 39: Hoare triple {2657#(and (= 2 (+ (- 1) main_~y~0)) (= main_~c~0 3))} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {2538#true} is VALID [2022-04-14 17:41:55,212 INFO L290 TraceCheckUtils]: 40: Hoare triple {2538#true} ~cond := #in~cond; {2538#true} is VALID [2022-04-14 17:41:55,212 INFO L290 TraceCheckUtils]: 41: Hoare triple {2538#true} assume !(0 == ~cond); {2538#true} is VALID [2022-04-14 17:41:55,212 INFO L290 TraceCheckUtils]: 42: Hoare triple {2538#true} assume true; {2538#true} is VALID [2022-04-14 17:41:55,212 INFO L284 TraceCheckUtils]: 43: Hoare quadruple {2538#true} {2657#(and (= 2 (+ (- 1) main_~y~0)) (= main_~c~0 3))} #57#return; {2657#(and (= 2 (+ (- 1) main_~y~0)) (= main_~c~0 3))} is VALID [2022-04-14 17:41:55,213 INFO L290 TraceCheckUtils]: 44: Hoare triple {2657#(and (= 2 (+ (- 1) main_~y~0)) (= main_~c~0 3))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {2679#(and (= (+ (- 1) main_~c~0) 3) (= (+ (- 2) main_~y~0) 2))} is VALID [2022-04-14 17:41:55,213 INFO L290 TraceCheckUtils]: 45: Hoare triple {2679#(and (= (+ (- 1) main_~c~0) 3) (= (+ (- 2) main_~y~0) 2))} assume !false; {2679#(and (= (+ (- 1) main_~c~0) 3) (= (+ (- 2) main_~y~0) 2))} is VALID [2022-04-14 17:41:55,213 INFO L272 TraceCheckUtils]: 46: Hoare triple {2679#(and (= (+ (- 1) main_~c~0) 3) (= (+ (- 2) main_~y~0) 2))} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {2538#true} is VALID [2022-04-14 17:41:55,213 INFO L290 TraceCheckUtils]: 47: Hoare triple {2538#true} ~cond := #in~cond; {2538#true} is VALID [2022-04-14 17:41:55,213 INFO L290 TraceCheckUtils]: 48: Hoare triple {2538#true} assume !(0 == ~cond); {2538#true} is VALID [2022-04-14 17:41:55,213 INFO L290 TraceCheckUtils]: 49: Hoare triple {2538#true} assume true; {2538#true} is VALID [2022-04-14 17:41:55,214 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {2538#true} {2679#(and (= (+ (- 1) main_~c~0) 3) (= (+ (- 2) main_~y~0) 2))} #57#return; {2679#(and (= (+ (- 1) main_~c~0) 3) (= (+ (- 2) main_~y~0) 2))} is VALID [2022-04-14 17:41:55,214 INFO L290 TraceCheckUtils]: 51: Hoare triple {2679#(and (= (+ (- 1) main_~c~0) 3) (= (+ (- 2) main_~y~0) 2))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {2701#(and (<= main_~c~0 5) (= 5 main_~y~0) (< 4 main_~k~0))} is VALID [2022-04-14 17:41:55,214 INFO L290 TraceCheckUtils]: 52: Hoare triple {2701#(and (<= main_~c~0 5) (= 5 main_~y~0) (< 4 main_~k~0))} assume !false; {2701#(and (<= main_~c~0 5) (= 5 main_~y~0) (< 4 main_~k~0))} is VALID [2022-04-14 17:41:55,214 INFO L272 TraceCheckUtils]: 53: Hoare triple {2701#(and (<= main_~c~0 5) (= 5 main_~y~0) (< 4 main_~k~0))} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {2538#true} is VALID [2022-04-14 17:41:55,214 INFO L290 TraceCheckUtils]: 54: Hoare triple {2538#true} ~cond := #in~cond; {2538#true} is VALID [2022-04-14 17:41:55,214 INFO L290 TraceCheckUtils]: 55: Hoare triple {2538#true} assume !(0 == ~cond); {2538#true} is VALID [2022-04-14 17:41:55,215 INFO L290 TraceCheckUtils]: 56: Hoare triple {2538#true} assume true; {2538#true} is VALID [2022-04-14 17:41:55,215 INFO L284 TraceCheckUtils]: 57: Hoare quadruple {2538#true} {2701#(and (<= main_~c~0 5) (= 5 main_~y~0) (< 4 main_~k~0))} #57#return; {2701#(and (<= main_~c~0 5) (= 5 main_~y~0) (< 4 main_~k~0))} is VALID [2022-04-14 17:41:55,217 INFO L290 TraceCheckUtils]: 58: Hoare triple {2701#(and (<= main_~c~0 5) (= 5 main_~y~0) (< 4 main_~k~0))} assume !(~c~0 < ~k~0); {2723#(and (<= main_~k~0 5) (= 5 main_~y~0) (< 4 main_~k~0))} is VALID [2022-04-14 17:41:55,217 INFO L272 TraceCheckUtils]: 59: Hoare triple {2723#(and (<= main_~k~0 5) (= 5 main_~y~0) (< 4 main_~k~0))} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {2538#true} is VALID [2022-04-14 17:41:55,217 INFO L290 TraceCheckUtils]: 60: Hoare triple {2538#true} ~cond := #in~cond; {2538#true} is VALID [2022-04-14 17:41:55,217 INFO L290 TraceCheckUtils]: 61: Hoare triple {2538#true} assume !(0 == ~cond); {2538#true} is VALID [2022-04-14 17:41:55,217 INFO L290 TraceCheckUtils]: 62: Hoare triple {2538#true} assume true; {2538#true} is VALID [2022-04-14 17:41:55,221 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {2538#true} {2723#(and (<= main_~k~0 5) (= 5 main_~y~0) (< 4 main_~k~0))} #59#return; {2723#(and (<= main_~k~0 5) (= 5 main_~y~0) (< 4 main_~k~0))} is VALID [2022-04-14 17:41:55,222 INFO L272 TraceCheckUtils]: 64: Hoare triple {2723#(and (<= main_~k~0 5) (= 5 main_~y~0) (< 4 main_~k~0))} call __VERIFIER_assert((if ~k~0 * ~y~0 == ~y~0 * ~y~0 then 1 else 0)); {2742#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-14 17:41:55,222 INFO L290 TraceCheckUtils]: 65: Hoare triple {2742#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {2746#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-14 17:41:55,223 INFO L290 TraceCheckUtils]: 66: Hoare triple {2746#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {2539#false} is VALID [2022-04-14 17:41:55,223 INFO L290 TraceCheckUtils]: 67: Hoare triple {2539#false} assume !false; {2539#false} is VALID [2022-04-14 17:41:55,223 INFO L134 CoverageAnalysis]: Checked inductivity of 147 backedges. 14 proven. 45 refuted. 0 times theorem prover too weak. 88 trivial. 0 not checked. [2022-04-14 17:41:55,223 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-14 17:41:55,525 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-14 17:41:55,526 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1057628069] [2022-04-14 17:41:55,526 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-14 17:41:55,526 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [633741590] [2022-04-14 17:41:55,526 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [633741590] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-14 17:41:55,526 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-14 17:41:55,526 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2022-04-14 17:41:55,526 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1003668906] [2022-04-14 17:41:55,526 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2022-04-14 17:41:55,527 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 2.5) internal successors, (25), 10 states have internal predecessors, (25), 8 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (10), 8 states have call predecessors, (10), 8 states have call successors, (10) Word has length 68 [2022-04-14 17:41:55,528 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-14 17:41:55,528 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 11 states, 10 states have (on average 2.5) internal successors, (25), 10 states have internal predecessors, (25), 8 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (10), 8 states have call predecessors, (10), 8 states have call successors, (10) [2022-04-14 17:41:55,560 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 47 edges. 47 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-14 17:41:55,561 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-04-14 17:41:55,561 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-14 17:41:55,561 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-04-14 17:41:55,561 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=146, Unknown=0, NotChecked=0, Total=182 [2022-04-14 17:41:55,561 INFO L87 Difference]: Start difference. First operand 45 states and 51 transitions. Second operand has 11 states, 10 states have (on average 2.5) internal successors, (25), 10 states have internal predecessors, (25), 8 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (10), 8 states have call predecessors, (10), 8 states have call successors, (10) [2022-04-14 17:41:56,186 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 17:41:56,186 INFO L93 Difference]: Finished difference Result 54 states and 62 transitions. [2022-04-14 17:41:56,186 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-04-14 17:41:56,186 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 2.5) internal successors, (25), 10 states have internal predecessors, (25), 8 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (10), 8 states have call predecessors, (10), 8 states have call successors, (10) Word has length 68 [2022-04-14 17:41:56,186 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-14 17:41:56,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 10 states have (on average 2.5) internal successors, (25), 10 states have internal predecessors, (25), 8 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (10), 8 states have call predecessors, (10), 8 states have call successors, (10) [2022-04-14 17:41:56,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 58 transitions. [2022-04-14 17:41:56,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 10 states have (on average 2.5) internal successors, (25), 10 states have internal predecessors, (25), 8 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (10), 8 states have call predecessors, (10), 8 states have call successors, (10) [2022-04-14 17:41:56,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 58 transitions. [2022-04-14 17:41:56,189 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 11 states and 58 transitions. [2022-04-14 17:41:56,229 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 58 edges. 58 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-14 17:41:56,230 INFO L225 Difference]: With dead ends: 54 [2022-04-14 17:41:56,230 INFO L226 Difference]: Without dead ends: 48 [2022-04-14 17:41:56,230 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 72 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=194, Unknown=0, NotChecked=0, Total=240 [2022-04-14 17:41:56,231 INFO L913 BasicCegarLoop]: 42 mSDtfsCounter, 2 mSDsluCounter, 229 mSDsCounter, 0 mSdLazyCounter, 207 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 271 SdHoareTripleChecker+Invalid, 208 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 207 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-14 17:41:56,231 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [2 Valid, 271 Invalid, 208 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 207 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-14 17:41:56,231 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2022-04-14 17:41:56,245 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2022-04-14 17:41:56,245 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-14 17:41:56,245 INFO L82 GeneralOperation]: Start isEquivalent. First operand 48 states. Second operand has 48 states, 30 states have (on average 1.0333333333333334) internal successors, (31), 30 states have internal predecessors, (31), 13 states have call successors, (13), 6 states have call predecessors, (13), 4 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-14 17:41:56,245 INFO L74 IsIncluded]: Start isIncluded. First operand 48 states. Second operand has 48 states, 30 states have (on average 1.0333333333333334) internal successors, (31), 30 states have internal predecessors, (31), 13 states have call successors, (13), 6 states have call predecessors, (13), 4 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-14 17:41:56,246 INFO L87 Difference]: Start difference. First operand 48 states. Second operand has 48 states, 30 states have (on average 1.0333333333333334) internal successors, (31), 30 states have internal predecessors, (31), 13 states have call successors, (13), 6 states have call predecessors, (13), 4 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-14 17:41:56,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 17:41:56,247 INFO L93 Difference]: Finished difference Result 48 states and 55 transitions. [2022-04-14 17:41:56,247 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 55 transitions. [2022-04-14 17:41:56,247 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 17:41:56,247 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 17:41:56,247 INFO L74 IsIncluded]: Start isIncluded. First operand has 48 states, 30 states have (on average 1.0333333333333334) internal successors, (31), 30 states have internal predecessors, (31), 13 states have call successors, (13), 6 states have call predecessors, (13), 4 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) Second operand 48 states. [2022-04-14 17:41:56,247 INFO L87 Difference]: Start difference. First operand has 48 states, 30 states have (on average 1.0333333333333334) internal successors, (31), 30 states have internal predecessors, (31), 13 states have call successors, (13), 6 states have call predecessors, (13), 4 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) Second operand 48 states. [2022-04-14 17:41:56,249 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 17:41:56,249 INFO L93 Difference]: Finished difference Result 48 states and 55 transitions. [2022-04-14 17:41:56,249 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 55 transitions. [2022-04-14 17:41:56,249 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 17:41:56,249 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 17:41:56,249 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-14 17:41:56,249 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-14 17:41:56,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 30 states have (on average 1.0333333333333334) internal successors, (31), 30 states have internal predecessors, (31), 13 states have call successors, (13), 6 states have call predecessors, (13), 4 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-14 17:41:56,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 55 transitions. [2022-04-14 17:41:56,250 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 55 transitions. Word has length 68 [2022-04-14 17:41:56,250 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-14 17:41:56,250 INFO L478 AbstractCegarLoop]: Abstraction has 48 states and 55 transitions. [2022-04-14 17:41:56,251 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 2.5) internal successors, (25), 10 states have internal predecessors, (25), 8 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (10), 8 states have call predecessors, (10), 8 states have call successors, (10) [2022-04-14 17:41:56,251 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 55 transitions. [2022-04-14 17:41:56,252 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2022-04-14 17:41:56,252 INFO L491 BasicCegarLoop]: Found error trace [2022-04-14 17:41:56,252 INFO L499 BasicCegarLoop]: trace histogram [9, 8, 8, 7, 7, 7, 6, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-14 17:41:56,263 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-04-14 17:41:56,461 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-14 17:41:56,461 INFO L403 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-14 17:41:56,461 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-14 17:41:56,461 INFO L85 PathProgramCache]: Analyzing trace with hash -1692754003, now seen corresponding path program 6 times [2022-04-14 17:41:56,462 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-14 17:41:56,462 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [480855729] [2022-04-14 17:41:56,462 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 17:41:56,462 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-14 17:41:56,473 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-14 17:41:56,473 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1751832916] [2022-04-14 17:41:56,474 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-14 17:41:56,474 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-14 17:41:56,474 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-14 17:41:56,476 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-14 17:41:56,476 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-04-14 17:42:08,455 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2022-04-14 17:42:08,455 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-14 17:42:08,461 INFO L263 TraceCheckSpWp]: Trace formula consists of 198 conjuncts, 32 conjunts are in the unsatisfiable core [2022-04-14 17:42:08,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 17:42:08,474 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-14 17:42:08,943 INFO L272 TraceCheckUtils]: 0: Hoare triple {3066#true} call ULTIMATE.init(); {3066#true} is VALID [2022-04-14 17:42:08,943 INFO L290 TraceCheckUtils]: 1: Hoare triple {3066#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); {3066#true} is VALID [2022-04-14 17:42:08,943 INFO L290 TraceCheckUtils]: 2: Hoare triple {3066#true} assume true; {3066#true} is VALID [2022-04-14 17:42:08,943 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3066#true} {3066#true} #63#return; {3066#true} is VALID [2022-04-14 17:42:08,943 INFO L272 TraceCheckUtils]: 4: Hoare triple {3066#true} call #t~ret5 := main(); {3066#true} is VALID [2022-04-14 17:42:08,943 INFO L290 TraceCheckUtils]: 5: Hoare triple {3066#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; {3066#true} is VALID [2022-04-14 17:42:08,943 INFO L272 TraceCheckUtils]: 6: Hoare triple {3066#true} call assume_abort_if_not((if ~k~0 >= 0 && ~k~0 <= 20 then 1 else 0)); {3066#true} is VALID [2022-04-14 17:42:08,943 INFO L290 TraceCheckUtils]: 7: Hoare triple {3066#true} ~cond := #in~cond; {3066#true} is VALID [2022-04-14 17:42:08,943 INFO L290 TraceCheckUtils]: 8: Hoare triple {3066#true} assume !(0 == ~cond); {3066#true} is VALID [2022-04-14 17:42:08,943 INFO L290 TraceCheckUtils]: 9: Hoare triple {3066#true} assume true; {3066#true} is VALID [2022-04-14 17:42:08,943 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {3066#true} {3066#true} #53#return; {3066#true} is VALID [2022-04-14 17:42:08,944 INFO L272 TraceCheckUtils]: 11: Hoare triple {3066#true} call assume_abort_if_not((if ~k~0 <= 256 then 1 else 0)); {3066#true} is VALID [2022-04-14 17:42:08,944 INFO L290 TraceCheckUtils]: 12: Hoare triple {3066#true} ~cond := #in~cond; {3066#true} is VALID [2022-04-14 17:42:08,944 INFO L290 TraceCheckUtils]: 13: Hoare triple {3066#true} assume !(0 == ~cond); {3066#true} is VALID [2022-04-14 17:42:08,944 INFO L290 TraceCheckUtils]: 14: Hoare triple {3066#true} assume true; {3066#true} is VALID [2022-04-14 17:42:08,944 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {3066#true} {3066#true} #55#return; {3066#true} is VALID [2022-04-14 17:42:08,951 INFO L290 TraceCheckUtils]: 16: Hoare triple {3066#true} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {3119#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-14 17:42:08,952 INFO L290 TraceCheckUtils]: 17: Hoare triple {3119#(and (= main_~c~0 0) (= main_~y~0 0))} assume !false; {3119#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-14 17:42:08,952 INFO L272 TraceCheckUtils]: 18: Hoare triple {3119#(and (= main_~c~0 0) (= main_~y~0 0))} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {3066#true} is VALID [2022-04-14 17:42:08,952 INFO L290 TraceCheckUtils]: 19: Hoare triple {3066#true} ~cond := #in~cond; {3066#true} is VALID [2022-04-14 17:42:08,952 INFO L290 TraceCheckUtils]: 20: Hoare triple {3066#true} assume !(0 == ~cond); {3066#true} is VALID [2022-04-14 17:42:08,952 INFO L290 TraceCheckUtils]: 21: Hoare triple {3066#true} assume true; {3066#true} is VALID [2022-04-14 17:42:08,952 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {3066#true} {3119#(and (= main_~c~0 0) (= main_~y~0 0))} #57#return; {3119#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-14 17:42:08,953 INFO L290 TraceCheckUtils]: 23: Hoare triple {3119#(and (= main_~c~0 0) (= main_~y~0 0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {3141#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} is VALID [2022-04-14 17:42:08,953 INFO L290 TraceCheckUtils]: 24: Hoare triple {3141#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} assume !false; {3141#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} is VALID [2022-04-14 17:42:08,953 INFO L272 TraceCheckUtils]: 25: Hoare triple {3141#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {3066#true} is VALID [2022-04-14 17:42:08,953 INFO L290 TraceCheckUtils]: 26: Hoare triple {3066#true} ~cond := #in~cond; {3066#true} is VALID [2022-04-14 17:42:08,953 INFO L290 TraceCheckUtils]: 27: Hoare triple {3066#true} assume !(0 == ~cond); {3066#true} is VALID [2022-04-14 17:42:08,953 INFO L290 TraceCheckUtils]: 28: Hoare triple {3066#true} assume true; {3066#true} is VALID [2022-04-14 17:42:08,953 INFO L284 TraceCheckUtils]: 29: Hoare quadruple {3066#true} {3141#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} #57#return; {3141#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} is VALID [2022-04-14 17:42:08,954 INFO L290 TraceCheckUtils]: 30: Hoare triple {3141#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {3163#(and (= main_~y~0 2) (= 0 (+ (- 2) main_~c~0)))} is VALID [2022-04-14 17:42:08,954 INFO L290 TraceCheckUtils]: 31: Hoare triple {3163#(and (= main_~y~0 2) (= 0 (+ (- 2) main_~c~0)))} assume !false; {3163#(and (= main_~y~0 2) (= 0 (+ (- 2) main_~c~0)))} is VALID [2022-04-14 17:42:08,954 INFO L272 TraceCheckUtils]: 32: Hoare triple {3163#(and (= main_~y~0 2) (= 0 (+ (- 2) main_~c~0)))} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {3066#true} is VALID [2022-04-14 17:42:08,954 INFO L290 TraceCheckUtils]: 33: Hoare triple {3066#true} ~cond := #in~cond; {3066#true} is VALID [2022-04-14 17:42:08,954 INFO L290 TraceCheckUtils]: 34: Hoare triple {3066#true} assume !(0 == ~cond); {3066#true} is VALID [2022-04-14 17:42:08,954 INFO L290 TraceCheckUtils]: 35: Hoare triple {3066#true} assume true; {3066#true} is VALID [2022-04-14 17:42:08,955 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {3066#true} {3163#(and (= main_~y~0 2) (= 0 (+ (- 2) main_~c~0)))} #57#return; {3163#(and (= main_~y~0 2) (= 0 (+ (- 2) main_~c~0)))} is VALID [2022-04-14 17:42:08,955 INFO L290 TraceCheckUtils]: 37: Hoare triple {3163#(and (= main_~y~0 2) (= 0 (+ (- 2) main_~c~0)))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {3185#(and (= (+ main_~c~0 (- 3)) 0) (= main_~y~0 3))} is VALID [2022-04-14 17:42:08,955 INFO L290 TraceCheckUtils]: 38: Hoare triple {3185#(and (= (+ main_~c~0 (- 3)) 0) (= main_~y~0 3))} assume !false; {3185#(and (= (+ main_~c~0 (- 3)) 0) (= main_~y~0 3))} is VALID [2022-04-14 17:42:08,956 INFO L272 TraceCheckUtils]: 39: Hoare triple {3185#(and (= (+ main_~c~0 (- 3)) 0) (= main_~y~0 3))} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {3066#true} is VALID [2022-04-14 17:42:08,956 INFO L290 TraceCheckUtils]: 40: Hoare triple {3066#true} ~cond := #in~cond; {3066#true} is VALID [2022-04-14 17:42:08,956 INFO L290 TraceCheckUtils]: 41: Hoare triple {3066#true} assume !(0 == ~cond); {3066#true} is VALID [2022-04-14 17:42:08,956 INFO L290 TraceCheckUtils]: 42: Hoare triple {3066#true} assume true; {3066#true} is VALID [2022-04-14 17:42:08,956 INFO L284 TraceCheckUtils]: 43: Hoare quadruple {3066#true} {3185#(and (= (+ main_~c~0 (- 3)) 0) (= main_~y~0 3))} #57#return; {3185#(and (= (+ main_~c~0 (- 3)) 0) (= main_~y~0 3))} is VALID [2022-04-14 17:42:08,956 INFO L290 TraceCheckUtils]: 44: Hoare triple {3185#(and (= (+ main_~c~0 (- 3)) 0) (= main_~y~0 3))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {3207#(and (= 3 (+ (- 1) main_~y~0)) (= (+ main_~c~0 (- 4)) 0))} is VALID [2022-04-14 17:42:08,957 INFO L290 TraceCheckUtils]: 45: Hoare triple {3207#(and (= 3 (+ (- 1) main_~y~0)) (= (+ main_~c~0 (- 4)) 0))} assume !false; {3207#(and (= 3 (+ (- 1) main_~y~0)) (= (+ main_~c~0 (- 4)) 0))} is VALID [2022-04-14 17:42:08,957 INFO L272 TraceCheckUtils]: 46: Hoare triple {3207#(and (= 3 (+ (- 1) main_~y~0)) (= (+ main_~c~0 (- 4)) 0))} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {3066#true} is VALID [2022-04-14 17:42:08,957 INFO L290 TraceCheckUtils]: 47: Hoare triple {3066#true} ~cond := #in~cond; {3066#true} is VALID [2022-04-14 17:42:08,957 INFO L290 TraceCheckUtils]: 48: Hoare triple {3066#true} assume !(0 == ~cond); {3066#true} is VALID [2022-04-14 17:42:08,957 INFO L290 TraceCheckUtils]: 49: Hoare triple {3066#true} assume true; {3066#true} is VALID [2022-04-14 17:42:08,957 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {3066#true} {3207#(and (= 3 (+ (- 1) main_~y~0)) (= (+ main_~c~0 (- 4)) 0))} #57#return; {3207#(and (= 3 (+ (- 1) main_~y~0)) (= (+ main_~c~0 (- 4)) 0))} is VALID [2022-04-14 17:42:08,958 INFO L290 TraceCheckUtils]: 51: Hoare triple {3207#(and (= 3 (+ (- 1) main_~y~0)) (= (+ main_~c~0 (- 4)) 0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {3229#(and (= (+ (- 2) main_~y~0) 3) (= 5 main_~c~0))} is VALID [2022-04-14 17:42:08,958 INFO L290 TraceCheckUtils]: 52: Hoare triple {3229#(and (= (+ (- 2) main_~y~0) 3) (= 5 main_~c~0))} assume !false; {3229#(and (= (+ (- 2) main_~y~0) 3) (= 5 main_~c~0))} is VALID [2022-04-14 17:42:08,958 INFO L272 TraceCheckUtils]: 53: Hoare triple {3229#(and (= (+ (- 2) main_~y~0) 3) (= 5 main_~c~0))} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {3066#true} is VALID [2022-04-14 17:42:08,958 INFO L290 TraceCheckUtils]: 54: Hoare triple {3066#true} ~cond := #in~cond; {3066#true} is VALID [2022-04-14 17:42:08,958 INFO L290 TraceCheckUtils]: 55: Hoare triple {3066#true} assume !(0 == ~cond); {3066#true} is VALID [2022-04-14 17:42:08,958 INFO L290 TraceCheckUtils]: 56: Hoare triple {3066#true} assume true; {3066#true} is VALID [2022-04-14 17:42:08,959 INFO L284 TraceCheckUtils]: 57: Hoare quadruple {3066#true} {3229#(and (= (+ (- 2) main_~y~0) 3) (= 5 main_~c~0))} #57#return; {3229#(and (= (+ (- 2) main_~y~0) 3) (= 5 main_~c~0))} is VALID [2022-04-14 17:42:08,959 INFO L290 TraceCheckUtils]: 58: Hoare triple {3229#(and (= (+ (- 2) main_~y~0) 3) (= 5 main_~c~0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {3251#(and (= main_~y~0 6) (< 5 main_~k~0) (<= main_~c~0 6))} is VALID [2022-04-14 17:42:08,959 INFO L290 TraceCheckUtils]: 59: Hoare triple {3251#(and (= main_~y~0 6) (< 5 main_~k~0) (<= main_~c~0 6))} assume !false; {3251#(and (= main_~y~0 6) (< 5 main_~k~0) (<= main_~c~0 6))} is VALID [2022-04-14 17:42:08,959 INFO L272 TraceCheckUtils]: 60: Hoare triple {3251#(and (= main_~y~0 6) (< 5 main_~k~0) (<= main_~c~0 6))} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {3066#true} is VALID [2022-04-14 17:42:08,960 INFO L290 TraceCheckUtils]: 61: Hoare triple {3066#true} ~cond := #in~cond; {3066#true} is VALID [2022-04-14 17:42:08,960 INFO L290 TraceCheckUtils]: 62: Hoare triple {3066#true} assume !(0 == ~cond); {3066#true} is VALID [2022-04-14 17:42:08,960 INFO L290 TraceCheckUtils]: 63: Hoare triple {3066#true} assume true; {3066#true} is VALID [2022-04-14 17:42:08,960 INFO L284 TraceCheckUtils]: 64: Hoare quadruple {3066#true} {3251#(and (= main_~y~0 6) (< 5 main_~k~0) (<= main_~c~0 6))} #57#return; {3251#(and (= main_~y~0 6) (< 5 main_~k~0) (<= main_~c~0 6))} is VALID [2022-04-14 17:42:08,961 INFO L290 TraceCheckUtils]: 65: Hoare triple {3251#(and (= main_~y~0 6) (< 5 main_~k~0) (<= main_~c~0 6))} assume !(~c~0 < ~k~0); {3273#(and (= main_~y~0 6) (<= main_~k~0 6) (< 5 main_~k~0))} is VALID [2022-04-14 17:42:08,961 INFO L272 TraceCheckUtils]: 66: Hoare triple {3273#(and (= main_~y~0 6) (<= main_~k~0 6) (< 5 main_~k~0))} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {3066#true} is VALID [2022-04-14 17:42:08,961 INFO L290 TraceCheckUtils]: 67: Hoare triple {3066#true} ~cond := #in~cond; {3066#true} is VALID [2022-04-14 17:42:08,961 INFO L290 TraceCheckUtils]: 68: Hoare triple {3066#true} assume !(0 == ~cond); {3066#true} is VALID [2022-04-14 17:42:08,961 INFO L290 TraceCheckUtils]: 69: Hoare triple {3066#true} assume true; {3066#true} is VALID [2022-04-14 17:42:08,961 INFO L284 TraceCheckUtils]: 70: Hoare quadruple {3066#true} {3273#(and (= main_~y~0 6) (<= main_~k~0 6) (< 5 main_~k~0))} #59#return; {3273#(and (= main_~y~0 6) (<= main_~k~0 6) (< 5 main_~k~0))} is VALID [2022-04-14 17:42:08,962 INFO L272 TraceCheckUtils]: 71: Hoare triple {3273#(and (= main_~y~0 6) (<= main_~k~0 6) (< 5 main_~k~0))} call __VERIFIER_assert((if ~k~0 * ~y~0 == ~y~0 * ~y~0 then 1 else 0)); {3292#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-14 17:42:08,962 INFO L290 TraceCheckUtils]: 72: Hoare triple {3292#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {3296#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-14 17:42:08,962 INFO L290 TraceCheckUtils]: 73: Hoare triple {3296#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {3067#false} is VALID [2022-04-14 17:42:08,962 INFO L290 TraceCheckUtils]: 74: Hoare triple {3067#false} assume !false; {3067#false} is VALID [2022-04-14 17:42:08,963 INFO L134 CoverageAnalysis]: Checked inductivity of 195 backedges. 16 proven. 63 refuted. 0 times theorem prover too weak. 116 trivial. 0 not checked. [2022-04-14 17:42:08,963 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-14 17:42:09,219 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-14 17:42:09,219 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [480855729] [2022-04-14 17:42:09,219 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-14 17:42:09,219 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1751832916] [2022-04-14 17:42:09,219 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1751832916] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-14 17:42:09,219 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-14 17:42:09,220 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2022-04-14 17:42:09,220 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1963624307] [2022-04-14 17:42:09,220 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2022-04-14 17:42:09,220 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 2.4545454545454546) internal successors, (27), 11 states have internal predecessors, (27), 9 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (11), 9 states have call predecessors, (11), 9 states have call successors, (11) Word has length 75 [2022-04-14 17:42:09,220 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-14 17:42:09,220 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 12 states, 11 states have (on average 2.4545454545454546) internal successors, (27), 11 states have internal predecessors, (27), 9 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (11), 9 states have call predecessors, (11), 9 states have call successors, (11) [2022-04-14 17:42:09,258 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 51 edges. 51 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-14 17:42:09,259 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-04-14 17:42:09,259 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-14 17:42:09,259 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-04-14 17:42:09,259 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=171, Unknown=0, NotChecked=0, Total=210 [2022-04-14 17:42:09,259 INFO L87 Difference]: Start difference. First operand 48 states and 55 transitions. Second operand has 12 states, 11 states have (on average 2.4545454545454546) internal successors, (27), 11 states have internal predecessors, (27), 9 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (11), 9 states have call predecessors, (11), 9 states have call successors, (11) [2022-04-14 17:42:09,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 17:42:09,953 INFO L93 Difference]: Finished difference Result 57 states and 66 transitions. [2022-04-14 17:42:09,953 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-04-14 17:42:09,953 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 2.4545454545454546) internal successors, (27), 11 states have internal predecessors, (27), 9 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (11), 9 states have call predecessors, (11), 9 states have call successors, (11) Word has length 75 [2022-04-14 17:42:09,953 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-14 17:42:09,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 11 states have (on average 2.4545454545454546) internal successors, (27), 11 states have internal predecessors, (27), 9 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (11), 9 states have call predecessors, (11), 9 states have call successors, (11) [2022-04-14 17:42:09,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 62 transitions. [2022-04-14 17:42:09,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 11 states have (on average 2.4545454545454546) internal successors, (27), 11 states have internal predecessors, (27), 9 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (11), 9 states have call predecessors, (11), 9 states have call successors, (11) [2022-04-14 17:42:09,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 62 transitions. [2022-04-14 17:42:09,956 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 12 states and 62 transitions. [2022-04-14 17:42:09,997 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 62 edges. 62 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-14 17:42:09,998 INFO L225 Difference]: With dead ends: 57 [2022-04-14 17:42:09,998 INFO L226 Difference]: Without dead ends: 51 [2022-04-14 17:42:09,998 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 78 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=49, Invalid=223, Unknown=0, NotChecked=0, Total=272 [2022-04-14 17:42:09,998 INFO L913 BasicCegarLoop]: 45 mSDtfsCounter, 2 mSDsluCounter, 265 mSDsCounter, 0 mSdLazyCounter, 259 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 310 SdHoareTripleChecker+Invalid, 260 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 259 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-04-14 17:42:09,998 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [2 Valid, 310 Invalid, 260 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 259 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-04-14 17:42:09,999 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2022-04-14 17:42:10,021 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2022-04-14 17:42:10,021 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-14 17:42:10,021 INFO L82 GeneralOperation]: Start isEquivalent. First operand 51 states. Second operand has 51 states, 32 states have (on average 1.03125) internal successors, (33), 32 states have internal predecessors, (33), 14 states have call successors, (14), 6 states have call predecessors, (14), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2022-04-14 17:42:10,021 INFO L74 IsIncluded]: Start isIncluded. First operand 51 states. Second operand has 51 states, 32 states have (on average 1.03125) internal successors, (33), 32 states have internal predecessors, (33), 14 states have call successors, (14), 6 states have call predecessors, (14), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2022-04-14 17:42:10,022 INFO L87 Difference]: Start difference. First operand 51 states. Second operand has 51 states, 32 states have (on average 1.03125) internal successors, (33), 32 states have internal predecessors, (33), 14 states have call successors, (14), 6 states have call predecessors, (14), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2022-04-14 17:42:10,023 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 17:42:10,023 INFO L93 Difference]: Finished difference Result 51 states and 59 transitions. [2022-04-14 17:42:10,023 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 59 transitions. [2022-04-14 17:42:10,023 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 17:42:10,023 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 17:42:10,023 INFO L74 IsIncluded]: Start isIncluded. First operand has 51 states, 32 states have (on average 1.03125) internal successors, (33), 32 states have internal predecessors, (33), 14 states have call successors, (14), 6 states have call predecessors, (14), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) Second operand 51 states. [2022-04-14 17:42:10,024 INFO L87 Difference]: Start difference. First operand has 51 states, 32 states have (on average 1.03125) internal successors, (33), 32 states have internal predecessors, (33), 14 states have call successors, (14), 6 states have call predecessors, (14), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) Second operand 51 states. [2022-04-14 17:42:10,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 17:42:10,025 INFO L93 Difference]: Finished difference Result 51 states and 59 transitions. [2022-04-14 17:42:10,025 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 59 transitions. [2022-04-14 17:42:10,025 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 17:42:10,025 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 17:42:10,025 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-14 17:42:10,025 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-14 17:42:10,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 32 states have (on average 1.03125) internal successors, (33), 32 states have internal predecessors, (33), 14 states have call successors, (14), 6 states have call predecessors, (14), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2022-04-14 17:42:10,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 59 transitions. [2022-04-14 17:42:10,026 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 59 transitions. Word has length 75 [2022-04-14 17:42:10,027 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-14 17:42:10,027 INFO L478 AbstractCegarLoop]: Abstraction has 51 states and 59 transitions. [2022-04-14 17:42:10,027 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 2.4545454545454546) internal successors, (27), 11 states have internal predecessors, (27), 9 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (11), 9 states have call predecessors, (11), 9 states have call successors, (11) [2022-04-14 17:42:10,027 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 59 transitions. [2022-04-14 17:42:10,027 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2022-04-14 17:42:10,027 INFO L491 BasicCegarLoop]: Found error trace [2022-04-14 17:42:10,027 INFO L499 BasicCegarLoop]: trace histogram [10, 9, 9, 8, 8, 8, 7, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-14 17:42:10,041 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-04-14 17:42:10,239 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable8 [2022-04-14 17:42:10,239 INFO L403 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-14 17:42:10,239 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-14 17:42:10,240 INFO L85 PathProgramCache]: Analyzing trace with hash 615143773, now seen corresponding path program 7 times [2022-04-14 17:42:10,240 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-14 17:42:10,240 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [131076000] [2022-04-14 17:42:10,240 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 17:42:10,240 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-14 17:42:10,249 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-14 17:42:10,249 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [536218576] [2022-04-14 17:42:10,249 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-04-14 17:42:10,249 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-14 17:42:10,249 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-14 17:42:10,250 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-14 17:42:10,251 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-04-14 17:42:11,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 17:42:11,297 INFO L263 TraceCheckSpWp]: Trace formula consists of 215 conjuncts, 36 conjunts are in the unsatisfiable core [2022-04-14 17:42:11,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 17:42:11,310 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-14 17:42:11,749 INFO L272 TraceCheckUtils]: 0: Hoare triple {3632#true} call ULTIMATE.init(); {3632#true} is VALID [2022-04-14 17:42:11,749 INFO L290 TraceCheckUtils]: 1: Hoare triple {3632#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); {3632#true} is VALID [2022-04-14 17:42:11,749 INFO L290 TraceCheckUtils]: 2: Hoare triple {3632#true} assume true; {3632#true} is VALID [2022-04-14 17:42:11,749 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3632#true} {3632#true} #63#return; {3632#true} is VALID [2022-04-14 17:42:11,750 INFO L272 TraceCheckUtils]: 4: Hoare triple {3632#true} call #t~ret5 := main(); {3632#true} is VALID [2022-04-14 17:42:11,750 INFO L290 TraceCheckUtils]: 5: Hoare triple {3632#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; {3632#true} is VALID [2022-04-14 17:42:11,750 INFO L272 TraceCheckUtils]: 6: Hoare triple {3632#true} call assume_abort_if_not((if ~k~0 >= 0 && ~k~0 <= 20 then 1 else 0)); {3632#true} is VALID [2022-04-14 17:42:11,750 INFO L290 TraceCheckUtils]: 7: Hoare triple {3632#true} ~cond := #in~cond; {3632#true} is VALID [2022-04-14 17:42:11,750 INFO L290 TraceCheckUtils]: 8: Hoare triple {3632#true} assume !(0 == ~cond); {3632#true} is VALID [2022-04-14 17:42:11,750 INFO L290 TraceCheckUtils]: 9: Hoare triple {3632#true} assume true; {3632#true} is VALID [2022-04-14 17:42:11,750 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {3632#true} {3632#true} #53#return; {3632#true} is VALID [2022-04-14 17:42:11,750 INFO L272 TraceCheckUtils]: 11: Hoare triple {3632#true} call assume_abort_if_not((if ~k~0 <= 256 then 1 else 0)); {3632#true} is VALID [2022-04-14 17:42:11,750 INFO L290 TraceCheckUtils]: 12: Hoare triple {3632#true} ~cond := #in~cond; {3632#true} is VALID [2022-04-14 17:42:11,750 INFO L290 TraceCheckUtils]: 13: Hoare triple {3632#true} assume !(0 == ~cond); {3632#true} is VALID [2022-04-14 17:42:11,750 INFO L290 TraceCheckUtils]: 14: Hoare triple {3632#true} assume true; {3632#true} is VALID [2022-04-14 17:42:11,750 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {3632#true} {3632#true} #55#return; {3632#true} is VALID [2022-04-14 17:42:11,750 INFO L290 TraceCheckUtils]: 16: Hoare triple {3632#true} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {3685#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-14 17:42:11,751 INFO L290 TraceCheckUtils]: 17: Hoare triple {3685#(and (= main_~c~0 0) (= main_~y~0 0))} assume !false; {3685#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-14 17:42:11,751 INFO L272 TraceCheckUtils]: 18: Hoare triple {3685#(and (= main_~c~0 0) (= main_~y~0 0))} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {3632#true} is VALID [2022-04-14 17:42:11,751 INFO L290 TraceCheckUtils]: 19: Hoare triple {3632#true} ~cond := #in~cond; {3632#true} is VALID [2022-04-14 17:42:11,751 INFO L290 TraceCheckUtils]: 20: Hoare triple {3632#true} assume !(0 == ~cond); {3632#true} is VALID [2022-04-14 17:42:11,751 INFO L290 TraceCheckUtils]: 21: Hoare triple {3632#true} assume true; {3632#true} is VALID [2022-04-14 17:42:11,751 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {3632#true} {3685#(and (= main_~c~0 0) (= main_~y~0 0))} #57#return; {3685#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-14 17:42:11,752 INFO L290 TraceCheckUtils]: 23: Hoare triple {3685#(and (= main_~c~0 0) (= main_~y~0 0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {3707#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} is VALID [2022-04-14 17:42:11,752 INFO L290 TraceCheckUtils]: 24: Hoare triple {3707#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} assume !false; {3707#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} is VALID [2022-04-14 17:42:11,752 INFO L272 TraceCheckUtils]: 25: Hoare triple {3707#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {3632#true} is VALID [2022-04-14 17:42:11,752 INFO L290 TraceCheckUtils]: 26: Hoare triple {3632#true} ~cond := #in~cond; {3632#true} is VALID [2022-04-14 17:42:11,752 INFO L290 TraceCheckUtils]: 27: Hoare triple {3632#true} assume !(0 == ~cond); {3632#true} is VALID [2022-04-14 17:42:11,752 INFO L290 TraceCheckUtils]: 28: Hoare triple {3632#true} assume true; {3632#true} is VALID [2022-04-14 17:42:11,755 INFO L284 TraceCheckUtils]: 29: Hoare quadruple {3632#true} {3707#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} #57#return; {3707#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} is VALID [2022-04-14 17:42:11,756 INFO L290 TraceCheckUtils]: 30: Hoare triple {3707#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {3729#(and (= (+ (- 2) main_~y~0) 0) (= main_~c~0 2))} is VALID [2022-04-14 17:42:11,756 INFO L290 TraceCheckUtils]: 31: Hoare triple {3729#(and (= (+ (- 2) main_~y~0) 0) (= main_~c~0 2))} assume !false; {3729#(and (= (+ (- 2) main_~y~0) 0) (= main_~c~0 2))} is VALID [2022-04-14 17:42:11,756 INFO L272 TraceCheckUtils]: 32: Hoare triple {3729#(and (= (+ (- 2) main_~y~0) 0) (= main_~c~0 2))} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {3632#true} is VALID [2022-04-14 17:42:11,756 INFO L290 TraceCheckUtils]: 33: Hoare triple {3632#true} ~cond := #in~cond; {3632#true} is VALID [2022-04-14 17:42:11,756 INFO L290 TraceCheckUtils]: 34: Hoare triple {3632#true} assume !(0 == ~cond); {3632#true} is VALID [2022-04-14 17:42:11,756 INFO L290 TraceCheckUtils]: 35: Hoare triple {3632#true} assume true; {3632#true} is VALID [2022-04-14 17:42:11,757 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {3632#true} {3729#(and (= (+ (- 2) main_~y~0) 0) (= main_~c~0 2))} #57#return; {3729#(and (= (+ (- 2) main_~y~0) 0) (= main_~c~0 2))} is VALID [2022-04-14 17:42:11,757 INFO L290 TraceCheckUtils]: 37: Hoare triple {3729#(and (= (+ (- 2) main_~y~0) 0) (= main_~c~0 2))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {3751#(and (= (+ main_~y~0 (- 3)) 0) (= main_~c~0 3))} is VALID [2022-04-14 17:42:11,758 INFO L290 TraceCheckUtils]: 38: Hoare triple {3751#(and (= (+ main_~y~0 (- 3)) 0) (= main_~c~0 3))} assume !false; {3751#(and (= (+ main_~y~0 (- 3)) 0) (= main_~c~0 3))} is VALID [2022-04-14 17:42:11,758 INFO L272 TraceCheckUtils]: 39: Hoare triple {3751#(and (= (+ main_~y~0 (- 3)) 0) (= main_~c~0 3))} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {3632#true} is VALID [2022-04-14 17:42:11,758 INFO L290 TraceCheckUtils]: 40: Hoare triple {3632#true} ~cond := #in~cond; {3632#true} is VALID [2022-04-14 17:42:11,758 INFO L290 TraceCheckUtils]: 41: Hoare triple {3632#true} assume !(0 == ~cond); {3632#true} is VALID [2022-04-14 17:42:11,758 INFO L290 TraceCheckUtils]: 42: Hoare triple {3632#true} assume true; {3632#true} is VALID [2022-04-14 17:42:11,758 INFO L284 TraceCheckUtils]: 43: Hoare quadruple {3632#true} {3751#(and (= (+ main_~y~0 (- 3)) 0) (= main_~c~0 3))} #57#return; {3751#(and (= (+ main_~y~0 (- 3)) 0) (= main_~c~0 3))} is VALID [2022-04-14 17:42:11,759 INFO L290 TraceCheckUtils]: 44: Hoare triple {3751#(and (= (+ main_~y~0 (- 3)) 0) (= main_~c~0 3))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {3773#(and (= main_~y~0 4) (= main_~c~0 4))} is VALID [2022-04-14 17:42:11,759 INFO L290 TraceCheckUtils]: 45: Hoare triple {3773#(and (= main_~y~0 4) (= main_~c~0 4))} assume !false; {3773#(and (= main_~y~0 4) (= main_~c~0 4))} is VALID [2022-04-14 17:42:11,759 INFO L272 TraceCheckUtils]: 46: Hoare triple {3773#(and (= main_~y~0 4) (= main_~c~0 4))} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {3632#true} is VALID [2022-04-14 17:42:11,759 INFO L290 TraceCheckUtils]: 47: Hoare triple {3632#true} ~cond := #in~cond; {3632#true} is VALID [2022-04-14 17:42:11,759 INFO L290 TraceCheckUtils]: 48: Hoare triple {3632#true} assume !(0 == ~cond); {3632#true} is VALID [2022-04-14 17:42:11,759 INFO L290 TraceCheckUtils]: 49: Hoare triple {3632#true} assume true; {3632#true} is VALID [2022-04-14 17:42:11,760 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {3632#true} {3773#(and (= main_~y~0 4) (= main_~c~0 4))} #57#return; {3773#(and (= main_~y~0 4) (= main_~c~0 4))} is VALID [2022-04-14 17:42:11,760 INFO L290 TraceCheckUtils]: 51: Hoare triple {3773#(and (= main_~y~0 4) (= main_~c~0 4))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {3795#(and (= 5 main_~c~0) (= (+ (- 1) main_~y~0) 4))} is VALID [2022-04-14 17:42:11,761 INFO L290 TraceCheckUtils]: 52: Hoare triple {3795#(and (= 5 main_~c~0) (= (+ (- 1) main_~y~0) 4))} assume !false; {3795#(and (= 5 main_~c~0) (= (+ (- 1) main_~y~0) 4))} is VALID [2022-04-14 17:42:11,761 INFO L272 TraceCheckUtils]: 53: Hoare triple {3795#(and (= 5 main_~c~0) (= (+ (- 1) main_~y~0) 4))} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {3632#true} is VALID [2022-04-14 17:42:11,761 INFO L290 TraceCheckUtils]: 54: Hoare triple {3632#true} ~cond := #in~cond; {3632#true} is VALID [2022-04-14 17:42:11,761 INFO L290 TraceCheckUtils]: 55: Hoare triple {3632#true} assume !(0 == ~cond); {3632#true} is VALID [2022-04-14 17:42:11,761 INFO L290 TraceCheckUtils]: 56: Hoare triple {3632#true} assume true; {3632#true} is VALID [2022-04-14 17:42:11,761 INFO L284 TraceCheckUtils]: 57: Hoare quadruple {3632#true} {3795#(and (= 5 main_~c~0) (= (+ (- 1) main_~y~0) 4))} #57#return; {3795#(and (= 5 main_~c~0) (= (+ (- 1) main_~y~0) 4))} is VALID [2022-04-14 17:42:11,762 INFO L290 TraceCheckUtils]: 58: Hoare triple {3795#(and (= 5 main_~c~0) (= (+ (- 1) main_~y~0) 4))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {3817#(and (= main_~y~0 6) (= (+ (- 1) main_~c~0) 5))} is VALID [2022-04-14 17:42:11,762 INFO L290 TraceCheckUtils]: 59: Hoare triple {3817#(and (= main_~y~0 6) (= (+ (- 1) main_~c~0) 5))} assume !false; {3817#(and (= main_~y~0 6) (= (+ (- 1) main_~c~0) 5))} is VALID [2022-04-14 17:42:11,762 INFO L272 TraceCheckUtils]: 60: Hoare triple {3817#(and (= main_~y~0 6) (= (+ (- 1) main_~c~0) 5))} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {3632#true} is VALID [2022-04-14 17:42:11,762 INFO L290 TraceCheckUtils]: 61: Hoare triple {3632#true} ~cond := #in~cond; {3632#true} is VALID [2022-04-14 17:42:11,762 INFO L290 TraceCheckUtils]: 62: Hoare triple {3632#true} assume !(0 == ~cond); {3632#true} is VALID [2022-04-14 17:42:11,762 INFO L290 TraceCheckUtils]: 63: Hoare triple {3632#true} assume true; {3632#true} is VALID [2022-04-14 17:42:11,763 INFO L284 TraceCheckUtils]: 64: Hoare quadruple {3632#true} {3817#(and (= main_~y~0 6) (= (+ (- 1) main_~c~0) 5))} #57#return; {3817#(and (= main_~y~0 6) (= (+ (- 1) main_~c~0) 5))} is VALID [2022-04-14 17:42:11,763 INFO L290 TraceCheckUtils]: 65: Hoare triple {3817#(and (= main_~y~0 6) (= (+ (- 1) main_~c~0) 5))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {3839#(and (<= main_~c~0 7) (= 6 (+ (- 1) main_~y~0)) (< 6 main_~k~0))} is VALID [2022-04-14 17:42:11,764 INFO L290 TraceCheckUtils]: 66: Hoare triple {3839#(and (<= main_~c~0 7) (= 6 (+ (- 1) main_~y~0)) (< 6 main_~k~0))} assume !false; {3839#(and (<= main_~c~0 7) (= 6 (+ (- 1) main_~y~0)) (< 6 main_~k~0))} is VALID [2022-04-14 17:42:11,764 INFO L272 TraceCheckUtils]: 67: Hoare triple {3839#(and (<= main_~c~0 7) (= 6 (+ (- 1) main_~y~0)) (< 6 main_~k~0))} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {3632#true} is VALID [2022-04-14 17:42:11,764 INFO L290 TraceCheckUtils]: 68: Hoare triple {3632#true} ~cond := #in~cond; {3632#true} is VALID [2022-04-14 17:42:11,764 INFO L290 TraceCheckUtils]: 69: Hoare triple {3632#true} assume !(0 == ~cond); {3632#true} is VALID [2022-04-14 17:42:11,764 INFO L290 TraceCheckUtils]: 70: Hoare triple {3632#true} assume true; {3632#true} is VALID [2022-04-14 17:42:11,765 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {3632#true} {3839#(and (<= main_~c~0 7) (= 6 (+ (- 1) main_~y~0)) (< 6 main_~k~0))} #57#return; {3839#(and (<= main_~c~0 7) (= 6 (+ (- 1) main_~y~0)) (< 6 main_~k~0))} is VALID [2022-04-14 17:42:11,765 INFO L290 TraceCheckUtils]: 72: Hoare triple {3839#(and (<= main_~c~0 7) (= 6 (+ (- 1) main_~y~0)) (< 6 main_~k~0))} assume !(~c~0 < ~k~0); {3861#(and (<= main_~k~0 7) (= 6 (+ (- 1) main_~y~0)) (< 6 main_~k~0))} is VALID [2022-04-14 17:42:11,765 INFO L272 TraceCheckUtils]: 73: Hoare triple {3861#(and (<= main_~k~0 7) (= 6 (+ (- 1) main_~y~0)) (< 6 main_~k~0))} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {3632#true} is VALID [2022-04-14 17:42:11,765 INFO L290 TraceCheckUtils]: 74: Hoare triple {3632#true} ~cond := #in~cond; {3632#true} is VALID [2022-04-14 17:42:11,765 INFO L290 TraceCheckUtils]: 75: Hoare triple {3632#true} assume !(0 == ~cond); {3632#true} is VALID [2022-04-14 17:42:11,765 INFO L290 TraceCheckUtils]: 76: Hoare triple {3632#true} assume true; {3632#true} is VALID [2022-04-14 17:42:11,766 INFO L284 TraceCheckUtils]: 77: Hoare quadruple {3632#true} {3861#(and (<= main_~k~0 7) (= 6 (+ (- 1) main_~y~0)) (< 6 main_~k~0))} #59#return; {3861#(and (<= main_~k~0 7) (= 6 (+ (- 1) main_~y~0)) (< 6 main_~k~0))} is VALID [2022-04-14 17:42:11,766 INFO L272 TraceCheckUtils]: 78: Hoare triple {3861#(and (<= main_~k~0 7) (= 6 (+ (- 1) main_~y~0)) (< 6 main_~k~0))} call __VERIFIER_assert((if ~k~0 * ~y~0 == ~y~0 * ~y~0 then 1 else 0)); {3880#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-14 17:42:11,767 INFO L290 TraceCheckUtils]: 79: Hoare triple {3880#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {3884#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-14 17:42:11,767 INFO L290 TraceCheckUtils]: 80: Hoare triple {3884#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {3633#false} is VALID [2022-04-14 17:42:11,767 INFO L290 TraceCheckUtils]: 81: Hoare triple {3633#false} assume !false; {3633#false} is VALID [2022-04-14 17:42:11,767 INFO L134 CoverageAnalysis]: Checked inductivity of 250 backedges. 18 proven. 84 refuted. 0 times theorem prover too weak. 148 trivial. 0 not checked. [2022-04-14 17:42:11,767 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-14 17:42:12,060 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-14 17:42:12,060 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [131076000] [2022-04-14 17:42:12,060 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-14 17:42:12,060 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [536218576] [2022-04-14 17:42:12,060 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [536218576] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-14 17:42:12,060 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-14 17:42:12,060 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2022-04-14 17:42:12,061 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2042286406] [2022-04-14 17:42:12,061 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2022-04-14 17:42:12,061 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 2.4166666666666665) internal successors, (29), 12 states have internal predecessors, (29), 10 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (12), 10 states have call predecessors, (12), 10 states have call successors, (12) Word has length 82 [2022-04-14 17:42:12,061 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-14 17:42:12,061 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 13 states, 12 states have (on average 2.4166666666666665) internal successors, (29), 12 states have internal predecessors, (29), 10 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (12), 10 states have call predecessors, (12), 10 states have call successors, (12) [2022-04-14 17:42:12,098 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 55 edges. 55 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-14 17:42:12,098 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-04-14 17:42:12,098 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-14 17:42:12,098 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-04-14 17:42:12,099 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=198, Unknown=0, NotChecked=0, Total=240 [2022-04-14 17:42:12,099 INFO L87 Difference]: Start difference. First operand 51 states and 59 transitions. Second operand has 13 states, 12 states have (on average 2.4166666666666665) internal successors, (29), 12 states have internal predecessors, (29), 10 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (12), 10 states have call predecessors, (12), 10 states have call successors, (12) [2022-04-14 17:42:12,951 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 17:42:12,951 INFO L93 Difference]: Finished difference Result 60 states and 70 transitions. [2022-04-14 17:42:12,951 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-04-14 17:42:12,951 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 2.4166666666666665) internal successors, (29), 12 states have internal predecessors, (29), 10 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (12), 10 states have call predecessors, (12), 10 states have call successors, (12) Word has length 82 [2022-04-14 17:42:12,952 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-14 17:42:12,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 12 states have (on average 2.4166666666666665) internal successors, (29), 12 states have internal predecessors, (29), 10 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (12), 10 states have call predecessors, (12), 10 states have call successors, (12) [2022-04-14 17:42:12,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 66 transitions. [2022-04-14 17:42:12,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 12 states have (on average 2.4166666666666665) internal successors, (29), 12 states have internal predecessors, (29), 10 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (12), 10 states have call predecessors, (12), 10 states have call successors, (12) [2022-04-14 17:42:12,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 66 transitions. [2022-04-14 17:42:12,954 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 13 states and 66 transitions. [2022-04-14 17:42:13,015 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 66 edges. 66 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-14 17:42:13,016 INFO L225 Difference]: With dead ends: 60 [2022-04-14 17:42:13,016 INFO L226 Difference]: Without dead ends: 54 [2022-04-14 17:42:13,016 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 84 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=52, Invalid=254, Unknown=0, NotChecked=0, Total=306 [2022-04-14 17:42:13,016 INFO L913 BasicCegarLoop]: 48 mSDtfsCounter, 2 mSDsluCounter, 303 mSDsCounter, 0 mSdLazyCounter, 317 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 351 SdHoareTripleChecker+Invalid, 318 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 317 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-04-14 17:42:13,017 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [2 Valid, 351 Invalid, 318 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 317 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-04-14 17:42:13,017 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2022-04-14 17:42:13,040 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2022-04-14 17:42:13,040 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-14 17:42:13,040 INFO L82 GeneralOperation]: Start isEquivalent. First operand 54 states. Second operand has 54 states, 34 states have (on average 1.0294117647058822) internal successors, (35), 34 states have internal predecessors, (35), 15 states have call successors, (15), 6 states have call predecessors, (15), 4 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2022-04-14 17:42:13,040 INFO L74 IsIncluded]: Start isIncluded. First operand 54 states. Second operand has 54 states, 34 states have (on average 1.0294117647058822) internal successors, (35), 34 states have internal predecessors, (35), 15 states have call successors, (15), 6 states have call predecessors, (15), 4 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2022-04-14 17:42:13,040 INFO L87 Difference]: Start difference. First operand 54 states. Second operand has 54 states, 34 states have (on average 1.0294117647058822) internal successors, (35), 34 states have internal predecessors, (35), 15 states have call successors, (15), 6 states have call predecessors, (15), 4 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2022-04-14 17:42:13,041 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 17:42:13,041 INFO L93 Difference]: Finished difference Result 54 states and 63 transitions. [2022-04-14 17:42:13,042 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 63 transitions. [2022-04-14 17:42:13,042 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 17:42:13,042 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 17:42:13,042 INFO L74 IsIncluded]: Start isIncluded. First operand has 54 states, 34 states have (on average 1.0294117647058822) internal successors, (35), 34 states have internal predecessors, (35), 15 states have call successors, (15), 6 states have call predecessors, (15), 4 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) Second operand 54 states. [2022-04-14 17:42:13,042 INFO L87 Difference]: Start difference. First operand has 54 states, 34 states have (on average 1.0294117647058822) internal successors, (35), 34 states have internal predecessors, (35), 15 states have call successors, (15), 6 states have call predecessors, (15), 4 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) Second operand 54 states. [2022-04-14 17:42:13,043 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 17:42:13,043 INFO L93 Difference]: Finished difference Result 54 states and 63 transitions. [2022-04-14 17:42:13,043 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 63 transitions. [2022-04-14 17:42:13,044 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 17:42:13,044 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 17:42:13,044 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-14 17:42:13,044 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-14 17:42:13,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 34 states have (on average 1.0294117647058822) internal successors, (35), 34 states have internal predecessors, (35), 15 states have call successors, (15), 6 states have call predecessors, (15), 4 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2022-04-14 17:42:13,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 63 transitions. [2022-04-14 17:42:13,045 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 63 transitions. Word has length 82 [2022-04-14 17:42:13,045 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-14 17:42:13,045 INFO L478 AbstractCegarLoop]: Abstraction has 54 states and 63 transitions. [2022-04-14 17:42:13,045 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 2.4166666666666665) internal successors, (29), 12 states have internal predecessors, (29), 10 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (12), 10 states have call predecessors, (12), 10 states have call successors, (12) [2022-04-14 17:42:13,045 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 63 transitions. [2022-04-14 17:42:13,046 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2022-04-14 17:42:13,046 INFO L491 BasicCegarLoop]: Found error trace [2022-04-14 17:42:13,046 INFO L499 BasicCegarLoop]: trace histogram [11, 10, 10, 9, 9, 9, 8, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-14 17:42:13,053 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2022-04-14 17:42:13,251 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2022-04-14 17:42:13,251 INFO L403 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-14 17:42:13,251 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-14 17:42:13,251 INFO L85 PathProgramCache]: Analyzing trace with hash -1334355539, now seen corresponding path program 8 times [2022-04-14 17:42:13,251 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-14 17:42:13,251 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1403619940] [2022-04-14 17:42:13,251 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 17:42:13,252 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-14 17:42:13,265 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-14 17:42:13,265 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [907706546] [2022-04-14 17:42:13,265 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-14 17:42:13,265 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-14 17:42:13,265 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-14 17:42:13,270 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-14 17:42:13,270 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-04-14 17:42:21,220 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-14 17:42:21,221 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-14 17:42:21,225 INFO L263 TraceCheckSpWp]: Trace formula consists of 232 conjuncts, 40 conjunts are in the unsatisfiable core [2022-04-14 17:42:21,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 17:42:21,240 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-14 17:42:21,733 INFO L272 TraceCheckUtils]: 0: Hoare triple {4236#true} call ULTIMATE.init(); {4236#true} is VALID [2022-04-14 17:42:21,733 INFO L290 TraceCheckUtils]: 1: Hoare triple {4236#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); {4236#true} is VALID [2022-04-14 17:42:21,733 INFO L290 TraceCheckUtils]: 2: Hoare triple {4236#true} assume true; {4236#true} is VALID [2022-04-14 17:42:21,733 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4236#true} {4236#true} #63#return; {4236#true} is VALID [2022-04-14 17:42:21,734 INFO L272 TraceCheckUtils]: 4: Hoare triple {4236#true} call #t~ret5 := main(); {4236#true} is VALID [2022-04-14 17:42:21,734 INFO L290 TraceCheckUtils]: 5: Hoare triple {4236#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; {4236#true} is VALID [2022-04-14 17:42:21,734 INFO L272 TraceCheckUtils]: 6: Hoare triple {4236#true} call assume_abort_if_not((if ~k~0 >= 0 && ~k~0 <= 20 then 1 else 0)); {4236#true} is VALID [2022-04-14 17:42:21,734 INFO L290 TraceCheckUtils]: 7: Hoare triple {4236#true} ~cond := #in~cond; {4236#true} is VALID [2022-04-14 17:42:21,734 INFO L290 TraceCheckUtils]: 8: Hoare triple {4236#true} assume !(0 == ~cond); {4236#true} is VALID [2022-04-14 17:42:21,734 INFO L290 TraceCheckUtils]: 9: Hoare triple {4236#true} assume true; {4236#true} is VALID [2022-04-14 17:42:21,734 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {4236#true} {4236#true} #53#return; {4236#true} is VALID [2022-04-14 17:42:21,734 INFO L272 TraceCheckUtils]: 11: Hoare triple {4236#true} call assume_abort_if_not((if ~k~0 <= 256 then 1 else 0)); {4236#true} is VALID [2022-04-14 17:42:21,734 INFO L290 TraceCheckUtils]: 12: Hoare triple {4236#true} ~cond := #in~cond; {4236#true} is VALID [2022-04-14 17:42:21,734 INFO L290 TraceCheckUtils]: 13: Hoare triple {4236#true} assume !(0 == ~cond); {4236#true} is VALID [2022-04-14 17:42:21,734 INFO L290 TraceCheckUtils]: 14: Hoare triple {4236#true} assume true; {4236#true} is VALID [2022-04-14 17:42:21,734 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {4236#true} {4236#true} #55#return; {4236#true} is VALID [2022-04-14 17:42:21,734 INFO L290 TraceCheckUtils]: 16: Hoare triple {4236#true} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {4289#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-14 17:42:21,735 INFO L290 TraceCheckUtils]: 17: Hoare triple {4289#(and (= main_~c~0 0) (= main_~y~0 0))} assume !false; {4289#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-14 17:42:21,735 INFO L272 TraceCheckUtils]: 18: Hoare triple {4289#(and (= main_~c~0 0) (= main_~y~0 0))} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {4236#true} is VALID [2022-04-14 17:42:21,735 INFO L290 TraceCheckUtils]: 19: Hoare triple {4236#true} ~cond := #in~cond; {4236#true} is VALID [2022-04-14 17:42:21,735 INFO L290 TraceCheckUtils]: 20: Hoare triple {4236#true} assume !(0 == ~cond); {4236#true} is VALID [2022-04-14 17:42:21,735 INFO L290 TraceCheckUtils]: 21: Hoare triple {4236#true} assume true; {4236#true} is VALID [2022-04-14 17:42:21,735 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {4236#true} {4289#(and (= main_~c~0 0) (= main_~y~0 0))} #57#return; {4289#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-14 17:42:21,736 INFO L290 TraceCheckUtils]: 23: Hoare triple {4289#(and (= main_~c~0 0) (= main_~y~0 0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {4311#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} is VALID [2022-04-14 17:42:21,736 INFO L290 TraceCheckUtils]: 24: Hoare triple {4311#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} assume !false; {4311#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} is VALID [2022-04-14 17:42:21,736 INFO L272 TraceCheckUtils]: 25: Hoare triple {4311#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {4236#true} is VALID [2022-04-14 17:42:21,736 INFO L290 TraceCheckUtils]: 26: Hoare triple {4236#true} ~cond := #in~cond; {4236#true} is VALID [2022-04-14 17:42:21,736 INFO L290 TraceCheckUtils]: 27: Hoare triple {4236#true} assume !(0 == ~cond); {4236#true} is VALID [2022-04-14 17:42:21,736 INFO L290 TraceCheckUtils]: 28: Hoare triple {4236#true} assume true; {4236#true} is VALID [2022-04-14 17:42:21,737 INFO L284 TraceCheckUtils]: 29: Hoare quadruple {4236#true} {4311#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} #57#return; {4311#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} is VALID [2022-04-14 17:42:21,737 INFO L290 TraceCheckUtils]: 30: Hoare triple {4311#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {4333#(and (= main_~y~0 2) (= 0 (+ (- 2) main_~c~0)))} is VALID [2022-04-14 17:42:21,737 INFO L290 TraceCheckUtils]: 31: Hoare triple {4333#(and (= main_~y~0 2) (= 0 (+ (- 2) main_~c~0)))} assume !false; {4333#(and (= main_~y~0 2) (= 0 (+ (- 2) main_~c~0)))} is VALID [2022-04-14 17:42:21,737 INFO L272 TraceCheckUtils]: 32: Hoare triple {4333#(and (= main_~y~0 2) (= 0 (+ (- 2) main_~c~0)))} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {4236#true} is VALID [2022-04-14 17:42:21,738 INFO L290 TraceCheckUtils]: 33: Hoare triple {4236#true} ~cond := #in~cond; {4236#true} is VALID [2022-04-14 17:42:21,738 INFO L290 TraceCheckUtils]: 34: Hoare triple {4236#true} assume !(0 == ~cond); {4236#true} is VALID [2022-04-14 17:42:21,738 INFO L290 TraceCheckUtils]: 35: Hoare triple {4236#true} assume true; {4236#true} is VALID [2022-04-14 17:42:21,738 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {4236#true} {4333#(and (= main_~y~0 2) (= 0 (+ (- 2) main_~c~0)))} #57#return; {4333#(and (= main_~y~0 2) (= 0 (+ (- 2) main_~c~0)))} is VALID [2022-04-14 17:42:21,739 INFO L290 TraceCheckUtils]: 37: Hoare triple {4333#(and (= main_~y~0 2) (= 0 (+ (- 2) main_~c~0)))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {4355#(and (= 2 (+ (- 1) main_~y~0)) (= (+ main_~c~0 (- 3)) 0))} is VALID [2022-04-14 17:42:21,740 INFO L290 TraceCheckUtils]: 38: Hoare triple {4355#(and (= 2 (+ (- 1) main_~y~0)) (= (+ main_~c~0 (- 3)) 0))} assume !false; {4355#(and (= 2 (+ (- 1) main_~y~0)) (= (+ main_~c~0 (- 3)) 0))} is VALID [2022-04-14 17:42:21,740 INFO L272 TraceCheckUtils]: 39: Hoare triple {4355#(and (= 2 (+ (- 1) main_~y~0)) (= (+ main_~c~0 (- 3)) 0))} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {4236#true} is VALID [2022-04-14 17:42:21,740 INFO L290 TraceCheckUtils]: 40: Hoare triple {4236#true} ~cond := #in~cond; {4236#true} is VALID [2022-04-14 17:42:21,740 INFO L290 TraceCheckUtils]: 41: Hoare triple {4236#true} assume !(0 == ~cond); {4236#true} is VALID [2022-04-14 17:42:21,740 INFO L290 TraceCheckUtils]: 42: Hoare triple {4236#true} assume true; {4236#true} is VALID [2022-04-14 17:42:21,740 INFO L284 TraceCheckUtils]: 43: Hoare quadruple {4236#true} {4355#(and (= 2 (+ (- 1) main_~y~0)) (= (+ main_~c~0 (- 3)) 0))} #57#return; {4355#(and (= 2 (+ (- 1) main_~y~0)) (= (+ main_~c~0 (- 3)) 0))} is VALID [2022-04-14 17:42:21,741 INFO L290 TraceCheckUtils]: 44: Hoare triple {4355#(and (= 2 (+ (- 1) main_~y~0)) (= (+ main_~c~0 (- 3)) 0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {4377#(and (= main_~y~0 4) (= main_~c~0 4))} is VALID [2022-04-14 17:42:21,741 INFO L290 TraceCheckUtils]: 45: Hoare triple {4377#(and (= main_~y~0 4) (= main_~c~0 4))} assume !false; {4377#(and (= main_~y~0 4) (= main_~c~0 4))} is VALID [2022-04-14 17:42:21,741 INFO L272 TraceCheckUtils]: 46: Hoare triple {4377#(and (= main_~y~0 4) (= main_~c~0 4))} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {4236#true} is VALID [2022-04-14 17:42:21,741 INFO L290 TraceCheckUtils]: 47: Hoare triple {4236#true} ~cond := #in~cond; {4236#true} is VALID [2022-04-14 17:42:21,741 INFO L290 TraceCheckUtils]: 48: Hoare triple {4236#true} assume !(0 == ~cond); {4236#true} is VALID [2022-04-14 17:42:21,741 INFO L290 TraceCheckUtils]: 49: Hoare triple {4236#true} assume true; {4236#true} is VALID [2022-04-14 17:42:21,742 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {4236#true} {4377#(and (= main_~y~0 4) (= main_~c~0 4))} #57#return; {4377#(and (= main_~y~0 4) (= main_~c~0 4))} is VALID [2022-04-14 17:42:21,742 INFO L290 TraceCheckUtils]: 51: Hoare triple {4377#(and (= main_~y~0 4) (= main_~c~0 4))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {4399#(and (= (+ (- 1) main_~y~0) 4) (= (+ (- 1) main_~c~0) 4))} is VALID [2022-04-14 17:42:21,742 INFO L290 TraceCheckUtils]: 52: Hoare triple {4399#(and (= (+ (- 1) main_~y~0) 4) (= (+ (- 1) main_~c~0) 4))} assume !false; {4399#(and (= (+ (- 1) main_~y~0) 4) (= (+ (- 1) main_~c~0) 4))} is VALID [2022-04-14 17:42:21,742 INFO L272 TraceCheckUtils]: 53: Hoare triple {4399#(and (= (+ (- 1) main_~y~0) 4) (= (+ (- 1) main_~c~0) 4))} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {4236#true} is VALID [2022-04-14 17:42:21,742 INFO L290 TraceCheckUtils]: 54: Hoare triple {4236#true} ~cond := #in~cond; {4236#true} is VALID [2022-04-14 17:42:21,743 INFO L290 TraceCheckUtils]: 55: Hoare triple {4236#true} assume !(0 == ~cond); {4236#true} is VALID [2022-04-14 17:42:21,743 INFO L290 TraceCheckUtils]: 56: Hoare triple {4236#true} assume true; {4236#true} is VALID [2022-04-14 17:42:21,743 INFO L284 TraceCheckUtils]: 57: Hoare quadruple {4236#true} {4399#(and (= (+ (- 1) main_~y~0) 4) (= (+ (- 1) main_~c~0) 4))} #57#return; {4399#(and (= (+ (- 1) main_~y~0) 4) (= (+ (- 1) main_~c~0) 4))} is VALID [2022-04-14 17:42:21,743 INFO L290 TraceCheckUtils]: 58: Hoare triple {4399#(and (= (+ (- 1) main_~y~0) 4) (= (+ (- 1) main_~c~0) 4))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {4421#(and (= main_~c~0 6) (= (+ (- 2) main_~y~0) 4))} is VALID [2022-04-14 17:42:21,744 INFO L290 TraceCheckUtils]: 59: Hoare triple {4421#(and (= main_~c~0 6) (= (+ (- 2) main_~y~0) 4))} assume !false; {4421#(and (= main_~c~0 6) (= (+ (- 2) main_~y~0) 4))} is VALID [2022-04-14 17:42:21,744 INFO L272 TraceCheckUtils]: 60: Hoare triple {4421#(and (= main_~c~0 6) (= (+ (- 2) main_~y~0) 4))} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {4236#true} is VALID [2022-04-14 17:42:21,744 INFO L290 TraceCheckUtils]: 61: Hoare triple {4236#true} ~cond := #in~cond; {4236#true} is VALID [2022-04-14 17:42:21,744 INFO L290 TraceCheckUtils]: 62: Hoare triple {4236#true} assume !(0 == ~cond); {4236#true} is VALID [2022-04-14 17:42:21,744 INFO L290 TraceCheckUtils]: 63: Hoare triple {4236#true} assume true; {4236#true} is VALID [2022-04-14 17:42:21,744 INFO L284 TraceCheckUtils]: 64: Hoare quadruple {4236#true} {4421#(and (= main_~c~0 6) (= (+ (- 2) main_~y~0) 4))} #57#return; {4421#(and (= main_~c~0 6) (= (+ (- 2) main_~y~0) 4))} is VALID [2022-04-14 17:42:21,745 INFO L290 TraceCheckUtils]: 65: Hoare triple {4421#(and (= main_~c~0 6) (= (+ (- 2) main_~y~0) 4))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {4443#(and (= 7 main_~y~0) (= 7 main_~c~0))} is VALID [2022-04-14 17:42:21,745 INFO L290 TraceCheckUtils]: 66: Hoare triple {4443#(and (= 7 main_~y~0) (= 7 main_~c~0))} assume !false; {4443#(and (= 7 main_~y~0) (= 7 main_~c~0))} is VALID [2022-04-14 17:42:21,745 INFO L272 TraceCheckUtils]: 67: Hoare triple {4443#(and (= 7 main_~y~0) (= 7 main_~c~0))} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {4236#true} is VALID [2022-04-14 17:42:21,745 INFO L290 TraceCheckUtils]: 68: Hoare triple {4236#true} ~cond := #in~cond; {4236#true} is VALID [2022-04-14 17:42:21,745 INFO L290 TraceCheckUtils]: 69: Hoare triple {4236#true} assume !(0 == ~cond); {4236#true} is VALID [2022-04-14 17:42:21,745 INFO L290 TraceCheckUtils]: 70: Hoare triple {4236#true} assume true; {4236#true} is VALID [2022-04-14 17:42:21,746 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {4236#true} {4443#(and (= 7 main_~y~0) (= 7 main_~c~0))} #57#return; {4443#(and (= 7 main_~y~0) (= 7 main_~c~0))} is VALID [2022-04-14 17:42:21,746 INFO L290 TraceCheckUtils]: 72: Hoare triple {4443#(and (= 7 main_~y~0) (= 7 main_~c~0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {4465#(and (< 7 main_~k~0) (= main_~y~0 8) (<= main_~c~0 8))} is VALID [2022-04-14 17:42:21,746 INFO L290 TraceCheckUtils]: 73: Hoare triple {4465#(and (< 7 main_~k~0) (= main_~y~0 8) (<= main_~c~0 8))} assume !false; {4465#(and (< 7 main_~k~0) (= main_~y~0 8) (<= main_~c~0 8))} is VALID [2022-04-14 17:42:21,746 INFO L272 TraceCheckUtils]: 74: Hoare triple {4465#(and (< 7 main_~k~0) (= main_~y~0 8) (<= main_~c~0 8))} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {4236#true} is VALID [2022-04-14 17:42:21,746 INFO L290 TraceCheckUtils]: 75: Hoare triple {4236#true} ~cond := #in~cond; {4236#true} is VALID [2022-04-14 17:42:21,746 INFO L290 TraceCheckUtils]: 76: Hoare triple {4236#true} assume !(0 == ~cond); {4236#true} is VALID [2022-04-14 17:42:21,747 INFO L290 TraceCheckUtils]: 77: Hoare triple {4236#true} assume true; {4236#true} is VALID [2022-04-14 17:42:21,747 INFO L284 TraceCheckUtils]: 78: Hoare quadruple {4236#true} {4465#(and (< 7 main_~k~0) (= main_~y~0 8) (<= main_~c~0 8))} #57#return; {4465#(and (< 7 main_~k~0) (= main_~y~0 8) (<= main_~c~0 8))} is VALID [2022-04-14 17:42:21,747 INFO L290 TraceCheckUtils]: 79: Hoare triple {4465#(and (< 7 main_~k~0) (= main_~y~0 8) (<= main_~c~0 8))} assume !(~c~0 < ~k~0); {4487#(and (< 7 main_~k~0) (= main_~y~0 8) (<= main_~k~0 8))} is VALID [2022-04-14 17:42:21,748 INFO L272 TraceCheckUtils]: 80: Hoare triple {4487#(and (< 7 main_~k~0) (= main_~y~0 8) (<= main_~k~0 8))} call __VERIFIER_assert((if 0 == 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 15 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + 10 * ~y~0 * ~y~0 * ~y~0 - 30 * ~x~0 - ~y~0 then 1 else 0)); {4236#true} is VALID [2022-04-14 17:42:21,748 INFO L290 TraceCheckUtils]: 81: Hoare triple {4236#true} ~cond := #in~cond; {4236#true} is VALID [2022-04-14 17:42:21,748 INFO L290 TraceCheckUtils]: 82: Hoare triple {4236#true} assume !(0 == ~cond); {4236#true} is VALID [2022-04-14 17:42:21,748 INFO L290 TraceCheckUtils]: 83: Hoare triple {4236#true} assume true; {4236#true} is VALID [2022-04-14 17:42:21,748 INFO L284 TraceCheckUtils]: 84: Hoare quadruple {4236#true} {4487#(and (< 7 main_~k~0) (= main_~y~0 8) (<= main_~k~0 8))} #59#return; {4487#(and (< 7 main_~k~0) (= main_~y~0 8) (<= main_~k~0 8))} is VALID [2022-04-14 17:42:21,749 INFO L272 TraceCheckUtils]: 85: Hoare triple {4487#(and (< 7 main_~k~0) (= main_~y~0 8) (<= main_~k~0 8))} call __VERIFIER_assert((if ~k~0 * ~y~0 == ~y~0 * ~y~0 then 1 else 0)); {4506#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-14 17:42:21,749 INFO L290 TraceCheckUtils]: 86: Hoare triple {4506#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {4510#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-14 17:42:21,749 INFO L290 TraceCheckUtils]: 87: Hoare triple {4510#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {4237#false} is VALID [2022-04-14 17:42:21,749 INFO L290 TraceCheckUtils]: 88: Hoare triple {4237#false} assume !false; {4237#false} is VALID [2022-04-14 17:42:21,750 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 20 proven. 108 refuted. 0 times theorem prover too weak. 184 trivial. 0 not checked. [2022-04-14 17:42:21,750 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-14 17:42:22,029 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-14 17:42:22,029 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1403619940] [2022-04-14 17:42:22,029 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-14 17:42:22,029 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [907706546] [2022-04-14 17:42:22,029 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [907706546] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-14 17:42:22,029 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-14 17:42:22,029 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2022-04-14 17:42:22,029 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [85932772] [2022-04-14 17:42:22,029 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2022-04-14 17:42:22,030 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 2.3846153846153846) internal successors, (31), 13 states have internal predecessors, (31), 11 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (13), 11 states have call predecessors, (13), 11 states have call successors, (13) Word has length 89 [2022-04-14 17:42:22,030 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-14 17:42:22,030 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 14 states, 13 states have (on average 2.3846153846153846) internal successors, (31), 13 states have internal predecessors, (31), 11 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (13), 11 states have call predecessors, (13), 11 states have call successors, (13) [2022-04-14 17:42:22,069 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 59 edges. 59 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-14 17:42:22,070 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-04-14 17:42:22,070 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-14 17:42:22,070 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-04-14 17:42:22,070 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=227, Unknown=0, NotChecked=0, Total=272 [2022-04-14 17:42:22,070 INFO L87 Difference]: Start difference. First operand 54 states and 63 transitions. Second operand has 14 states, 13 states have (on average 2.3846153846153846) internal successors, (31), 13 states have internal predecessors, (31), 11 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (13), 11 states have call predecessors, (13), 11 states have call successors, (13) [2022-04-14 17:42:23,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 17:42:23,092 INFO L93 Difference]: Finished difference Result 63 states and 74 transitions. [2022-04-14 17:42:23,092 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-04-14 17:42:23,092 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 2.3846153846153846) internal successors, (31), 13 states have internal predecessors, (31), 11 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (13), 11 states have call predecessors, (13), 11 states have call successors, (13) Word has length 89 [2022-04-14 17:42:23,092 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-14 17:42:23,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 13 states have (on average 2.3846153846153846) internal successors, (31), 13 states have internal predecessors, (31), 11 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (13), 11 states have call predecessors, (13), 11 states have call successors, (13) [2022-04-14 17:42:23,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 70 transitions. [2022-04-14 17:42:23,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 13 states have (on average 2.3846153846153846) internal successors, (31), 13 states have internal predecessors, (31), 11 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (13), 11 states have call predecessors, (13), 11 states have call successors, (13) [2022-04-14 17:42:23,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 70 transitions. [2022-04-14 17:42:23,096 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 14 states and 70 transitions. [2022-04-14 17:42:23,152 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 70 edges. 70 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-14 17:42:23,152 INFO L225 Difference]: With dead ends: 63 [2022-04-14 17:42:23,152 INFO L226 Difference]: Without dead ends: 57 [2022-04-14 17:42:23,153 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 90 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=55, Invalid=287, Unknown=0, NotChecked=0, Total=342 [2022-04-14 17:42:23,153 INFO L913 BasicCegarLoop]: 51 mSDtfsCounter, 2 mSDsluCounter, 343 mSDsCounter, 0 mSdLazyCounter, 381 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 394 SdHoareTripleChecker+Invalid, 382 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 381 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-04-14 17:42:23,153 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [2 Valid, 394 Invalid, 382 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 381 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-04-14 17:42:23,154 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2022-04-14 17:42:23,174 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2022-04-14 17:42:23,174 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-14 17:42:23,174 INFO L82 GeneralOperation]: Start isEquivalent. First operand 57 states. Second operand has 57 states, 36 states have (on average 1.0277777777777777) internal successors, (37), 36 states have internal predecessors, (37), 16 states have call successors, (16), 6 states have call predecessors, (16), 4 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2022-04-14 17:42:23,174 INFO L74 IsIncluded]: Start isIncluded. First operand 57 states. Second operand has 57 states, 36 states have (on average 1.0277777777777777) internal successors, (37), 36 states have internal predecessors, (37), 16 states have call successors, (16), 6 states have call predecessors, (16), 4 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2022-04-14 17:42:23,175 INFO L87 Difference]: Start difference. First operand 57 states. Second operand has 57 states, 36 states have (on average 1.0277777777777777) internal successors, (37), 36 states have internal predecessors, (37), 16 states have call successors, (16), 6 states have call predecessors, (16), 4 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2022-04-14 17:42:23,176 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 17:42:23,176 INFO L93 Difference]: Finished difference Result 57 states and 67 transitions. [2022-04-14 17:42:23,176 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 67 transitions. [2022-04-14 17:42:23,176 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 17:42:23,176 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 17:42:23,176 INFO L74 IsIncluded]: Start isIncluded. First operand has 57 states, 36 states have (on average 1.0277777777777777) internal successors, (37), 36 states have internal predecessors, (37), 16 states have call successors, (16), 6 states have call predecessors, (16), 4 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) Second operand 57 states. [2022-04-14 17:42:23,176 INFO L87 Difference]: Start difference. First operand has 57 states, 36 states have (on average 1.0277777777777777) internal successors, (37), 36 states have internal predecessors, (37), 16 states have call successors, (16), 6 states have call predecessors, (16), 4 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) Second operand 57 states. [2022-04-14 17:42:23,177 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 17:42:23,177 INFO L93 Difference]: Finished difference Result 57 states and 67 transitions. [2022-04-14 17:42:23,177 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 67 transitions. [2022-04-14 17:42:23,178 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 17:42:23,178 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 17:42:23,178 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-14 17:42:23,178 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-14 17:42:23,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 36 states have (on average 1.0277777777777777) internal successors, (37), 36 states have internal predecessors, (37), 16 states have call successors, (16), 6 states have call predecessors, (16), 4 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2022-04-14 17:42:23,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 67 transitions. [2022-04-14 17:42:23,179 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 67 transitions. Word has length 89 [2022-04-14 17:42:23,179 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-14 17:42:23,179 INFO L478 AbstractCegarLoop]: Abstraction has 57 states and 67 transitions. [2022-04-14 17:42:23,179 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 2.3846153846153846) internal successors, (31), 13 states have internal predecessors, (31), 11 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (13), 11 states have call predecessors, (13), 11 states have call successors, (13) [2022-04-14 17:42:23,179 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 67 transitions. [2022-04-14 17:42:23,180 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2022-04-14 17:42:23,180 INFO L491 BasicCegarLoop]: Found error trace [2022-04-14 17:42:23,180 INFO L499 BasicCegarLoop]: trace histogram [12, 11, 11, 10, 10, 10, 9, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-14 17:42:23,188 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-04-14 17:42:23,387 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2022-04-14 17:42:23,387 INFO L403 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-14 17:42:23,387 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-14 17:42:23,388 INFO L85 PathProgramCache]: Analyzing trace with hash 711483229, now seen corresponding path program 9 times [2022-04-14 17:42:23,388 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-14 17:42:23,388 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1558994269] [2022-04-14 17:42:23,388 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 17:42:23,388 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-14 17:42:23,406 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-14 17:42:23,406 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [70714206] [2022-04-14 17:42:23,406 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-04-14 17:42:23,406 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-14 17:42:23,406 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-14 17:42:23,407 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-14 17:42:23,407 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process