/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/egcd-ll_valuebound2.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-fb4f59a-m [2022-04-27 12:51:11,131 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-27 12:51:11,157 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-27 12:51:11,182 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-27 12:51:11,182 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-27 12:51:11,183 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-27 12:51:11,184 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-27 12:51:11,185 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-27 12:51:11,186 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-27 12:51:11,186 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-27 12:51:11,187 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-27 12:51:11,187 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-27 12:51:11,188 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-27 12:51:11,188 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-27 12:51:11,189 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-27 12:51:11,189 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-27 12:51:11,190 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-27 12:51:11,200 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-27 12:51:11,201 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-27 12:51:11,202 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-27 12:51:11,203 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-27 12:51:11,206 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-27 12:51:11,206 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-27 12:51:11,207 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-27 12:51:11,208 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-27 12:51:11,209 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-27 12:51:11,209 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-27 12:51:11,210 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-27 12:51:11,210 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-27 12:51:11,211 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-27 12:51:11,211 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-27 12:51:11,211 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-27 12:51:11,212 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-27 12:51:11,212 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-27 12:51:11,213 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-27 12:51:11,213 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-27 12:51:11,214 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-27 12:51:11,214 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-27 12:51:11,214 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-27 12:51:11,214 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-27 12:51:11,236 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-27 12:51:11,237 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-27 12:51:11,237 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2022-04-27 12:51:11,263 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-27 12:51:11,263 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-27 12:51:11,263 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-04-27 12:51:11,263 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-04-27 12:51:11,263 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-04-27 12:51:11,263 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-04-27 12:51:11,264 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-04-27 12:51:11,264 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-04-27 12:51:11,264 INFO L138 SettingsManager]: * Use SBE=true [2022-04-27 12:51:11,264 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-27 12:51:11,264 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-27 12:51:11,264 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-27 12:51:11,264 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-27 12:51:11,265 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-27 12:51:11,265 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-27 12:51:11,265 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-27 12:51:11,265 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-27 12:51:11,265 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-27 12:51:11,265 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-27 12:51:11,265 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-27 12:51:11,265 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-27 12:51:11,265 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-27 12:51:11,265 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-27 12:51:11,265 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-27 12:51:11,266 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-27 12:51:11,266 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-27 12:51:11,266 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-04-27 12:51:11,266 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-04-27 12:51:11,266 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-04-27 12:51:11,266 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-04-27 12:51:11,266 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-04-27 12:51:11,266 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-04-27 12:51:11,266 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-27 12:51:11,266 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.core: Log level for class -> de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN; [2022-04-27 12:51:11,426 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-27 12:51:11,453 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-27 12:51:11,456 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-27 12:51:11,457 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-27 12:51:11,457 INFO L275 PluginConnector]: CDTParser initialized [2022-04-27 12:51:11,458 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/nla-digbench-scaling/egcd-ll_valuebound2.c [2022-04-27 12:51:11,508 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2812b8c70/0989e6b5d4c1454f969dbd34d400b143/FLAGdc3346f05 [2022-04-27 12:51:11,894 INFO L306 CDTParser]: Found 1 translation units. [2022-04-27 12:51:11,895 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/egcd-ll_valuebound2.c [2022-04-27 12:51:11,901 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2812b8c70/0989e6b5d4c1454f969dbd34d400b143/FLAGdc3346f05 [2022-04-27 12:51:11,919 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2812b8c70/0989e6b5d4c1454f969dbd34d400b143 [2022-04-27 12:51:11,921 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-27 12:51:11,923 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-27 12:51:11,930 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-27 12:51:11,930 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-27 12:51:11,945 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-27 12:51:11,946 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.04 12:51:11" (1/1) ... [2022-04-27 12:51:11,947 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@51f58e0e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 12:51:11, skipping insertion in model container [2022-04-27 12:51:11,947 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.04 12:51:11" (1/1) ... [2022-04-27 12:51:11,952 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-27 12:51:11,975 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-27 12:51:12,120 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/egcd-ll_valuebound2.c[489,502] [2022-04-27 12:51:12,141 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-27 12:51:12,146 INFO L203 MainTranslator]: Completed pre-run [2022-04-27 12:51:12,157 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/egcd-ll_valuebound2.c[489,502] [2022-04-27 12:51:12,179 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-27 12:51:12,188 INFO L208 MainTranslator]: Completed translation [2022-04-27 12:51:12,188 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 12:51:12 WrapperNode [2022-04-27 12:51:12,188 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-27 12:51:12,189 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-27 12:51:12,189 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-27 12:51:12,189 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-27 12:51:12,195 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 12:51:12" (1/1) ... [2022-04-27 12:51:12,196 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 12:51:12" (1/1) ... [2022-04-27 12:51:12,200 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 12:51:12" (1/1) ... [2022-04-27 12:51:12,200 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 12:51:12" (1/1) ... [2022-04-27 12:51:12,216 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 12:51:12" (1/1) ... [2022-04-27 12:51:12,218 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 12:51:12" (1/1) ... [2022-04-27 12:51:12,219 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 12:51:12" (1/1) ... [2022-04-27 12:51:12,220 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-27 12:51:12,221 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-27 12:51:12,221 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-27 12:51:12,221 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-27 12:51:12,223 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 12:51:12" (1/1) ... [2022-04-27 12:51:12,227 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-27 12:51:12,233 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 12:51:12,256 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-04-27 12:51:12,280 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-04-27 12:51:12,286 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-27 12:51:12,286 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-27 12:51:12,286 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-27 12:51:12,287 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-27 12:51:12,288 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-27 12:51:12,288 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-27 12:51:12,288 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-27 12:51:12,289 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-27 12:51:12,289 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-27 12:51:12,289 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-27 12:51:12,289 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-04-27 12:51:12,289 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-27 12:51:12,289 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-27 12:51:12,289 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-27 12:51:12,289 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-27 12:51:12,289 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-27 12:51:12,289 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-27 12:51:12,289 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-27 12:51:12,289 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-27 12:51:12,289 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-27 12:51:12,329 INFO L234 CfgBuilder]: Building ICFG [2022-04-27 12:51:12,330 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-27 12:51:12,492 INFO L275 CfgBuilder]: Performing block encoding [2022-04-27 12:51:12,504 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-27 12:51:12,504 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-27 12:51:12,506 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.04 12:51:12 BoogieIcfgContainer [2022-04-27 12:51:12,506 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-27 12:51:12,507 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-27 12:51:12,507 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-27 12:51:12,513 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-27 12:51:12,513 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.04 12:51:11" (1/3) ... [2022-04-27 12:51:12,514 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@495a3f3f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.04 12:51:12, skipping insertion in model container [2022-04-27 12:51:12,514 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 12:51:12" (2/3) ... [2022-04-27 12:51:12,514 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@495a3f3f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.04 12:51:12, skipping insertion in model container [2022-04-27 12:51:12,514 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.04 12:51:12" (3/3) ... [2022-04-27 12:51:12,515 INFO L111 eAbstractionObserver]: Analyzing ICFG egcd-ll_valuebound2.c [2022-04-27 12:51:12,527 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-04-27 12:51:12,527 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-27 12:51:12,562 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-27 12:51:12,567 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@1447601, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@10816053 [2022-04-27 12:51:12,567 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-27 12:51:12,574 INFO L276 IsEmpty]: Start isEmpty. Operand has 37 states, 18 states have (on average 1.3888888888888888) internal successors, (25), 19 states have internal predecessors, (25), 13 states have call successors, (13), 4 states have call predecessors, (13), 4 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2022-04-27 12:51:12,579 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-04-27 12:51:12,579 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 12:51:12,580 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 12:51:12,580 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 12:51:12,584 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 12:51:12,584 INFO L85 PathProgramCache]: Analyzing trace with hash 870870740, now seen corresponding path program 1 times [2022-04-27 12:51:12,600 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 12:51:12,601 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [912522009] [2022-04-27 12:51:12,601 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 12:51:12,601 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 12:51:12,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 12:51:12,755 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 12:51:12,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 12:51:12,801 INFO L290 TraceCheckUtils]: 0: Hoare triple {61#(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(10, 2);call #Ultimate.allocInit(12, 3); {40#true} is VALID [2022-04-27 12:51:12,802 INFO L290 TraceCheckUtils]: 1: Hoare triple {40#true} assume true; {40#true} is VALID [2022-04-27 12:51:12,802 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {40#true} {40#true} #88#return; {40#true} is VALID [2022-04-27 12:51:12,803 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-27 12:51:12,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 12:51:12,813 INFO L290 TraceCheckUtils]: 0: Hoare triple {40#true} ~cond := #in~cond; {40#true} is VALID [2022-04-27 12:51:12,815 INFO L290 TraceCheckUtils]: 1: Hoare triple {40#true} assume 0 == ~cond;assume false; {41#false} is VALID [2022-04-27 12:51:12,815 INFO L290 TraceCheckUtils]: 2: Hoare triple {41#false} assume true; {41#false} is VALID [2022-04-27 12:51:12,815 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {41#false} {40#true} #66#return; {41#false} is VALID [2022-04-27 12:51:12,816 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-04-27 12:51:12,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 12:51:12,829 INFO L290 TraceCheckUtils]: 0: Hoare triple {40#true} ~cond := #in~cond; {40#true} is VALID [2022-04-27 12:51:12,830 INFO L290 TraceCheckUtils]: 1: Hoare triple {40#true} assume 0 == ~cond;assume false; {41#false} is VALID [2022-04-27 12:51:12,830 INFO L290 TraceCheckUtils]: 2: Hoare triple {41#false} assume true; {41#false} is VALID [2022-04-27 12:51:12,831 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {41#false} {41#false} #68#return; {41#false} is VALID [2022-04-27 12:51:12,831 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-04-27 12:51:12,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 12:51:12,849 INFO L290 TraceCheckUtils]: 0: Hoare triple {40#true} ~cond := #in~cond; {40#true} is VALID [2022-04-27 12:51:12,849 INFO L290 TraceCheckUtils]: 1: Hoare triple {40#true} assume 0 == ~cond;assume false; {41#false} is VALID [2022-04-27 12:51:12,849 INFO L290 TraceCheckUtils]: 2: Hoare triple {41#false} assume true; {41#false} is VALID [2022-04-27 12:51:12,850 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {41#false} {41#false} #70#return; {41#false} is VALID [2022-04-27 12:51:12,850 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-04-27 12:51:12,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 12:51:12,866 INFO L290 TraceCheckUtils]: 0: Hoare triple {40#true} ~cond := #in~cond; {40#true} is VALID [2022-04-27 12:51:12,868 INFO L290 TraceCheckUtils]: 1: Hoare triple {40#true} assume 0 == ~cond;assume false; {41#false} is VALID [2022-04-27 12:51:12,869 INFO L290 TraceCheckUtils]: 2: Hoare triple {41#false} assume true; {41#false} is VALID [2022-04-27 12:51:12,869 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {41#false} {41#false} #72#return; {41#false} is VALID [2022-04-27 12:51:12,871 INFO L272 TraceCheckUtils]: 0: Hoare triple {40#true} call ULTIMATE.init(); {61#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 12:51:12,871 INFO L290 TraceCheckUtils]: 1: Hoare triple {61#(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(10, 2);call #Ultimate.allocInit(12, 3); {40#true} is VALID [2022-04-27 12:51:12,871 INFO L290 TraceCheckUtils]: 2: Hoare triple {40#true} assume true; {40#true} is VALID [2022-04-27 12:51:12,871 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {40#true} {40#true} #88#return; {40#true} is VALID [2022-04-27 12:51:12,871 INFO L272 TraceCheckUtils]: 4: Hoare triple {40#true} call #t~ret6 := main(); {40#true} is VALID [2022-04-27 12:51:12,872 INFO L290 TraceCheckUtils]: 5: Hoare triple {40#true} havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~s~0;havoc ~x~0;havoc ~y~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4; {40#true} is VALID [2022-04-27 12:51:12,872 INFO L272 TraceCheckUtils]: 6: Hoare triple {40#true} call assume_abort_if_not((if ~x~0 >= 0 && ~x~0 <= 2 then 1 else 0)); {40#true} is VALID [2022-04-27 12:51:12,872 INFO L290 TraceCheckUtils]: 7: Hoare triple {40#true} ~cond := #in~cond; {40#true} is VALID [2022-04-27 12:51:12,875 INFO L290 TraceCheckUtils]: 8: Hoare triple {40#true} assume 0 == ~cond;assume false; {41#false} is VALID [2022-04-27 12:51:12,875 INFO L290 TraceCheckUtils]: 9: Hoare triple {41#false} assume true; {41#false} is VALID [2022-04-27 12:51:12,876 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {41#false} {40#true} #66#return; {41#false} is VALID [2022-04-27 12:51:12,876 INFO L290 TraceCheckUtils]: 11: Hoare triple {41#false} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {41#false} is VALID [2022-04-27 12:51:12,876 INFO L272 TraceCheckUtils]: 12: Hoare triple {41#false} call assume_abort_if_not((if ~y~0 >= 0 && ~y~0 <= 2 then 1 else 0)); {40#true} is VALID [2022-04-27 12:51:12,876 INFO L290 TraceCheckUtils]: 13: Hoare triple {40#true} ~cond := #in~cond; {40#true} is VALID [2022-04-27 12:51:12,877 INFO L290 TraceCheckUtils]: 14: Hoare triple {40#true} assume 0 == ~cond;assume false; {41#false} is VALID [2022-04-27 12:51:12,877 INFO L290 TraceCheckUtils]: 15: Hoare triple {41#false} assume true; {41#false} is VALID [2022-04-27 12:51:12,878 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {41#false} {41#false} #68#return; {41#false} is VALID [2022-04-27 12:51:12,878 INFO L272 TraceCheckUtils]: 17: Hoare triple {41#false} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {40#true} is VALID [2022-04-27 12:51:12,878 INFO L290 TraceCheckUtils]: 18: Hoare triple {40#true} ~cond := #in~cond; {40#true} is VALID [2022-04-27 12:51:12,885 INFO L290 TraceCheckUtils]: 19: Hoare triple {40#true} assume 0 == ~cond;assume false; {41#false} is VALID [2022-04-27 12:51:12,885 INFO L290 TraceCheckUtils]: 20: Hoare triple {41#false} assume true; {41#false} is VALID [2022-04-27 12:51:12,886 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {41#false} {41#false} #70#return; {41#false} is VALID [2022-04-27 12:51:12,886 INFO L272 TraceCheckUtils]: 22: Hoare triple {41#false} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {40#true} is VALID [2022-04-27 12:51:12,886 INFO L290 TraceCheckUtils]: 23: Hoare triple {40#true} ~cond := #in~cond; {40#true} is VALID [2022-04-27 12:51:12,886 INFO L290 TraceCheckUtils]: 24: Hoare triple {40#true} assume 0 == ~cond;assume false; {41#false} is VALID [2022-04-27 12:51:12,886 INFO L290 TraceCheckUtils]: 25: Hoare triple {41#false} assume true; {41#false} is VALID [2022-04-27 12:51:12,887 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {41#false} {41#false} #72#return; {41#false} is VALID [2022-04-27 12:51:12,887 INFO L290 TraceCheckUtils]: 27: Hoare triple {41#false} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1; {41#false} is VALID [2022-04-27 12:51:12,887 INFO L290 TraceCheckUtils]: 28: Hoare triple {41#false} assume false; {41#false} is VALID [2022-04-27 12:51:12,887 INFO L272 TraceCheckUtils]: 29: Hoare triple {41#false} call __VERIFIER_assert((if 0 == ~a~0 - ~b~0 then 1 else 0)); {41#false} is VALID [2022-04-27 12:51:12,887 INFO L290 TraceCheckUtils]: 30: Hoare triple {41#false} ~cond := #in~cond; {41#false} is VALID [2022-04-27 12:51:12,887 INFO L290 TraceCheckUtils]: 31: Hoare triple {41#false} assume 0 == ~cond; {41#false} is VALID [2022-04-27 12:51:12,887 INFO L290 TraceCheckUtils]: 32: Hoare triple {41#false} assume !false; {41#false} is VALID [2022-04-27 12:51:12,888 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-04-27 12:51:12,888 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 12:51:12,888 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [912522009] [2022-04-27 12:51:12,889 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [912522009] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 12:51:12,889 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 12:51:12,889 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-27 12:51:12,890 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1606601453] [2022-04-27 12:51:12,891 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 12:51:12,898 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 33 [2022-04-27 12:51:12,900 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 12:51:12,902 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-27 12:51:12,936 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 24 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 12:51:12,937 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-27 12:51:12,937 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 12:51:12,967 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-27 12:51:12,971 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-27 12:51:12,974 INFO L87 Difference]: Start difference. First operand has 37 states, 18 states have (on average 1.3888888888888888) internal successors, (25), 19 states have internal predecessors, (25), 13 states have call successors, (13), 4 states have call predecessors, (13), 4 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) Second operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-27 12:51:13,121 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:51:13,121 INFO L93 Difference]: Finished difference Result 67 states and 105 transitions. [2022-04-27 12:51:13,121 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-27 12:51:13,122 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 33 [2022-04-27 12:51:13,122 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 12:51:13,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-27 12:51:13,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 105 transitions. [2022-04-27 12:51:13,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-27 12:51:13,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 105 transitions. [2022-04-27 12:51:13,136 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 105 transitions. [2022-04-27 12:51:13,232 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 105 edges. 105 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 12:51:13,238 INFO L225 Difference]: With dead ends: 67 [2022-04-27 12:51:13,238 INFO L226 Difference]: Without dead ends: 32 [2022-04-27 12:51:13,241 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-27 12:51:13,243 INFO L413 NwaCegarLoop]: 36 mSDtfsCounter, 18 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 39 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 12:51:13,244 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 39 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 12:51:13,255 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2022-04-27 12:51:13,269 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2022-04-27 12:51:13,269 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 12:51:13,270 INFO L82 GeneralOperation]: Start isEquivalent. First operand 32 states. Second operand has 32 states, 15 states have (on average 1.2) internal successors, (18), 16 states have internal predecessors, (18), 13 states have call successors, (13), 4 states have call predecessors, (13), 3 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-27 12:51:13,270 INFO L74 IsIncluded]: Start isIncluded. First operand 32 states. Second operand has 32 states, 15 states have (on average 1.2) internal successors, (18), 16 states have internal predecessors, (18), 13 states have call successors, (13), 4 states have call predecessors, (13), 3 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-27 12:51:13,270 INFO L87 Difference]: Start difference. First operand 32 states. Second operand has 32 states, 15 states have (on average 1.2) internal successors, (18), 16 states have internal predecessors, (18), 13 states have call successors, (13), 4 states have call predecessors, (13), 3 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-27 12:51:13,274 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:51:13,274 INFO L93 Difference]: Finished difference Result 32 states and 42 transitions. [2022-04-27 12:51:13,274 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 42 transitions. [2022-04-27 12:51:13,275 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 12:51:13,275 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 12:51:13,276 INFO L74 IsIncluded]: Start isIncluded. First operand has 32 states, 15 states have (on average 1.2) internal successors, (18), 16 states have internal predecessors, (18), 13 states have call successors, (13), 4 states have call predecessors, (13), 3 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) Second operand 32 states. [2022-04-27 12:51:13,276 INFO L87 Difference]: Start difference. First operand has 32 states, 15 states have (on average 1.2) internal successors, (18), 16 states have internal predecessors, (18), 13 states have call successors, (13), 4 states have call predecessors, (13), 3 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) Second operand 32 states. [2022-04-27 12:51:13,279 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:51:13,279 INFO L93 Difference]: Finished difference Result 32 states and 42 transitions. [2022-04-27 12:51:13,279 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 42 transitions. [2022-04-27 12:51:13,280 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 12:51:13,280 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 12:51:13,280 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 12:51:13,280 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 12:51:13,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 15 states have (on average 1.2) internal successors, (18), 16 states have internal predecessors, (18), 13 states have call successors, (13), 4 states have call predecessors, (13), 3 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-27 12:51:13,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 42 transitions. [2022-04-27 12:51:13,285 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 42 transitions. Word has length 33 [2022-04-27 12:51:13,285 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 12:51:13,286 INFO L495 AbstractCegarLoop]: Abstraction has 32 states and 42 transitions. [2022-04-27 12:51:13,286 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-27 12:51:13,286 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 42 transitions. [2022-04-27 12:51:13,287 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-04-27 12:51:13,287 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 12:51:13,287 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 12:51:13,287 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-27 12:51:13,287 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 12:51:13,288 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 12:51:13,288 INFO L85 PathProgramCache]: Analyzing trace with hash -1006914976, now seen corresponding path program 1 times [2022-04-27 12:51:13,288 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 12:51:13,288 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [939138431] [2022-04-27 12:51:13,288 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 12:51:13,289 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 12:51:13,313 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 12:51:13,313 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1408192589] [2022-04-27 12:51:13,313 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 12:51:13,313 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 12:51:13,313 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 12:51:13,357 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-27 12:51:13,372 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-04-27 12:51:13,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 12:51:13,403 INFO L263 TraceCheckSpWp]: Trace formula consists of 105 conjuncts, 9 conjunts are in the unsatisfiable core [2022-04-27 12:51:13,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 12:51:13,416 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 12:51:17,652 INFO L272 TraceCheckUtils]: 0: Hoare triple {276#true} call ULTIMATE.init(); {276#true} is VALID [2022-04-27 12:51:17,652 INFO L290 TraceCheckUtils]: 1: Hoare triple {276#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(10, 2);call #Ultimate.allocInit(12, 3); {276#true} is VALID [2022-04-27 12:51:17,652 INFO L290 TraceCheckUtils]: 2: Hoare triple {276#true} assume true; {276#true} is VALID [2022-04-27 12:51:17,652 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {276#true} {276#true} #88#return; {276#true} is VALID [2022-04-27 12:51:17,653 INFO L272 TraceCheckUtils]: 4: Hoare triple {276#true} call #t~ret6 := main(); {276#true} is VALID [2022-04-27 12:51:17,653 INFO L290 TraceCheckUtils]: 5: Hoare triple {276#true} havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~s~0;havoc ~x~0;havoc ~y~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4; {276#true} is VALID [2022-04-27 12:51:17,653 INFO L272 TraceCheckUtils]: 6: Hoare triple {276#true} call assume_abort_if_not((if ~x~0 >= 0 && ~x~0 <= 2 then 1 else 0)); {276#true} is VALID [2022-04-27 12:51:17,653 INFO L290 TraceCheckUtils]: 7: Hoare triple {276#true} ~cond := #in~cond; {276#true} is VALID [2022-04-27 12:51:17,653 INFO L290 TraceCheckUtils]: 8: Hoare triple {276#true} assume !(0 == ~cond); {276#true} is VALID [2022-04-27 12:51:17,653 INFO L290 TraceCheckUtils]: 9: Hoare triple {276#true} assume true; {276#true} is VALID [2022-04-27 12:51:17,653 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {276#true} {276#true} #66#return; {276#true} is VALID [2022-04-27 12:51:17,653 INFO L290 TraceCheckUtils]: 11: Hoare triple {276#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {276#true} is VALID [2022-04-27 12:51:17,654 INFO L272 TraceCheckUtils]: 12: Hoare triple {276#true} call assume_abort_if_not((if ~y~0 >= 0 && ~y~0 <= 2 then 1 else 0)); {276#true} is VALID [2022-04-27 12:51:17,654 INFO L290 TraceCheckUtils]: 13: Hoare triple {276#true} ~cond := #in~cond; {276#true} is VALID [2022-04-27 12:51:17,654 INFO L290 TraceCheckUtils]: 14: Hoare triple {276#true} assume !(0 == ~cond); {276#true} is VALID [2022-04-27 12:51:17,654 INFO L290 TraceCheckUtils]: 15: Hoare triple {276#true} assume true; {276#true} is VALID [2022-04-27 12:51:17,654 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {276#true} {276#true} #68#return; {276#true} is VALID [2022-04-27 12:51:17,654 INFO L272 TraceCheckUtils]: 17: Hoare triple {276#true} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {276#true} is VALID [2022-04-27 12:51:17,654 INFO L290 TraceCheckUtils]: 18: Hoare triple {276#true} ~cond := #in~cond; {276#true} is VALID [2022-04-27 12:51:17,654 INFO L290 TraceCheckUtils]: 19: Hoare triple {276#true} assume !(0 == ~cond); {276#true} is VALID [2022-04-27 12:51:17,655 INFO L290 TraceCheckUtils]: 20: Hoare triple {276#true} assume true; {276#true} is VALID [2022-04-27 12:51:17,655 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {276#true} {276#true} #70#return; {276#true} is VALID [2022-04-27 12:51:17,655 INFO L272 TraceCheckUtils]: 22: Hoare triple {276#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {276#true} is VALID [2022-04-27 12:51:17,655 INFO L290 TraceCheckUtils]: 23: Hoare triple {276#true} ~cond := #in~cond; {276#true} is VALID [2022-04-27 12:51:17,655 INFO L290 TraceCheckUtils]: 24: Hoare triple {276#true} assume !(0 == ~cond); {276#true} is VALID [2022-04-27 12:51:17,655 INFO L290 TraceCheckUtils]: 25: Hoare triple {276#true} assume true; {276#true} is VALID [2022-04-27 12:51:17,655 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {276#true} {276#true} #72#return; {276#true} is VALID [2022-04-27 12:51:17,656 INFO L290 TraceCheckUtils]: 27: Hoare triple {276#true} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1; {362#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~p~0 1))} is VALID [2022-04-27 12:51:17,657 INFO L290 TraceCheckUtils]: 28: Hoare triple {362#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~p~0 1))} assume !false; {362#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~p~0 1))} is VALID [2022-04-27 12:51:17,657 INFO L272 TraceCheckUtils]: 29: Hoare triple {362#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~p~0 1))} call __VERIFIER_assert((if 1 == ~p~0 * ~s~0 - ~r~0 * ~q~0 then 1 else 0)); {369#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 12:51:17,658 INFO L290 TraceCheckUtils]: 30: Hoare triple {369#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {373#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 12:51:17,658 INFO L290 TraceCheckUtils]: 31: Hoare triple {373#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {277#false} is VALID [2022-04-27 12:51:17,658 INFO L290 TraceCheckUtils]: 32: Hoare triple {277#false} assume !false; {277#false} is VALID [2022-04-27 12:51:17,659 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-04-27 12:51:17,659 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-27 12:51:17,659 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 12:51:17,659 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [939138431] [2022-04-27 12:51:17,659 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 12:51:17,659 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1408192589] [2022-04-27 12:51:17,659 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1408192589] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 12:51:17,659 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 12:51:17,659 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-27 12:51:17,660 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2036957992] [2022-04-27 12:51:17,660 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 12:51:17,661 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) Word has length 33 [2022-04-27 12:51:17,661 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 12:51:17,661 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2022-04-27 12:51:17,681 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 24 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 12:51:17,681 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-27 12:51:17,682 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 12:51:17,683 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-27 12:51:17,683 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-27 12:51:17,684 INFO L87 Difference]: Start difference. First operand 32 states and 42 transitions. Second operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2022-04-27 12:51:17,879 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:51:17,879 INFO L93 Difference]: Finished difference Result 48 states and 65 transitions. [2022-04-27 12:51:17,879 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-27 12:51:17,879 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) Word has length 33 [2022-04-27 12:51:17,879 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 12:51:17,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2022-04-27 12:51:17,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 65 transitions. [2022-04-27 12:51:17,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2022-04-27 12:51:17,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 65 transitions. [2022-04-27 12:51:17,883 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 65 transitions. [2022-04-27 12:51:17,951 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 65 edges. 65 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 12:51:17,953 INFO L225 Difference]: With dead ends: 48 [2022-04-27 12:51:17,953 INFO L226 Difference]: Without dead ends: 46 [2022-04-27 12:51:17,954 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-27 12:51:17,954 INFO L413 NwaCegarLoop]: 42 mSDtfsCounter, 7 mSDsluCounter, 101 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 143 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 12:51:17,955 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 143 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 12:51:17,955 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2022-04-27 12:51:17,960 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 45. [2022-04-27 12:51:17,960 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 12:51:17,961 INFO L82 GeneralOperation]: Start isEquivalent. First operand 46 states. Second operand has 45 states, 21 states have (on average 1.2380952380952381) internal successors, (26), 23 states have internal predecessors, (26), 19 states have call successors, (19), 5 states have call predecessors, (19), 4 states have return successors, (17), 16 states have call predecessors, (17), 17 states have call successors, (17) [2022-04-27 12:51:17,961 INFO L74 IsIncluded]: Start isIncluded. First operand 46 states. Second operand has 45 states, 21 states have (on average 1.2380952380952381) internal successors, (26), 23 states have internal predecessors, (26), 19 states have call successors, (19), 5 states have call predecessors, (19), 4 states have return successors, (17), 16 states have call predecessors, (17), 17 states have call successors, (17) [2022-04-27 12:51:17,971 INFO L87 Difference]: Start difference. First operand 46 states. Second operand has 45 states, 21 states have (on average 1.2380952380952381) internal successors, (26), 23 states have internal predecessors, (26), 19 states have call successors, (19), 5 states have call predecessors, (19), 4 states have return successors, (17), 16 states have call predecessors, (17), 17 states have call successors, (17) [2022-04-27 12:51:17,974 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:51:17,974 INFO L93 Difference]: Finished difference Result 46 states and 63 transitions. [2022-04-27 12:51:17,974 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 63 transitions. [2022-04-27 12:51:17,975 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 12:51:17,975 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 12:51:17,975 INFO L74 IsIncluded]: Start isIncluded. First operand has 45 states, 21 states have (on average 1.2380952380952381) internal successors, (26), 23 states have internal predecessors, (26), 19 states have call successors, (19), 5 states have call predecessors, (19), 4 states have return successors, (17), 16 states have call predecessors, (17), 17 states have call successors, (17) Second operand 46 states. [2022-04-27 12:51:17,975 INFO L87 Difference]: Start difference. First operand has 45 states, 21 states have (on average 1.2380952380952381) internal successors, (26), 23 states have internal predecessors, (26), 19 states have call successors, (19), 5 states have call predecessors, (19), 4 states have return successors, (17), 16 states have call predecessors, (17), 17 states have call successors, (17) Second operand 46 states. [2022-04-27 12:51:17,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:51:17,979 INFO L93 Difference]: Finished difference Result 46 states and 63 transitions. [2022-04-27 12:51:17,979 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 63 transitions. [2022-04-27 12:51:17,980 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 12:51:17,980 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 12:51:17,980 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 12:51:17,980 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 12:51:17,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 21 states have (on average 1.2380952380952381) internal successors, (26), 23 states have internal predecessors, (26), 19 states have call successors, (19), 5 states have call predecessors, (19), 4 states have return successors, (17), 16 states have call predecessors, (17), 17 states have call successors, (17) [2022-04-27 12:51:17,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 62 transitions. [2022-04-27 12:51:17,982 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 62 transitions. Word has length 33 [2022-04-27 12:51:17,983 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 12:51:17,983 INFO L495 AbstractCegarLoop]: Abstraction has 45 states and 62 transitions. [2022-04-27 12:51:17,983 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2022-04-27 12:51:17,983 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 62 transitions. [2022-04-27 12:51:17,983 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2022-04-27 12:51:17,984 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 12:51:17,984 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 12:51:18,002 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-04-27 12:51:18,196 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 12:51:18,197 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 12:51:18,197 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 12:51:18,197 INFO L85 PathProgramCache]: Analyzing trace with hash -124657161, now seen corresponding path program 1 times [2022-04-27 12:51:18,197 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 12:51:18,198 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1285086674] [2022-04-27 12:51:18,198 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 12:51:18,198 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 12:51:18,215 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 12:51:18,216 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1987200759] [2022-04-27 12:51:18,216 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 12:51:18,216 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 12:51:18,216 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 12:51:18,229 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-27 12:51:18,250 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-04-27 12:51:18,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 12:51:18,286 INFO L263 TraceCheckSpWp]: Trace formula consists of 114 conjuncts, 29 conjunts are in the unsatisfiable core [2022-04-27 12:51:18,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 12:51:18,298 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 12:51:18,691 INFO L272 TraceCheckUtils]: 0: Hoare triple {619#true} call ULTIMATE.init(); {619#true} is VALID [2022-04-27 12:51:18,692 INFO L290 TraceCheckUtils]: 1: Hoare triple {619#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(10, 2);call #Ultimate.allocInit(12, 3); {619#true} is VALID [2022-04-27 12:51:18,692 INFO L290 TraceCheckUtils]: 2: Hoare triple {619#true} assume true; {619#true} is VALID [2022-04-27 12:51:18,692 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {619#true} {619#true} #88#return; {619#true} is VALID [2022-04-27 12:51:18,692 INFO L272 TraceCheckUtils]: 4: Hoare triple {619#true} call #t~ret6 := main(); {619#true} is VALID [2022-04-27 12:51:18,692 INFO L290 TraceCheckUtils]: 5: Hoare triple {619#true} havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~s~0;havoc ~x~0;havoc ~y~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4; {619#true} is VALID [2022-04-27 12:51:18,692 INFO L272 TraceCheckUtils]: 6: Hoare triple {619#true} call assume_abort_if_not((if ~x~0 >= 0 && ~x~0 <= 2 then 1 else 0)); {619#true} is VALID [2022-04-27 12:51:18,693 INFO L290 TraceCheckUtils]: 7: Hoare triple {619#true} ~cond := #in~cond; {645#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-04-27 12:51:18,693 INFO L290 TraceCheckUtils]: 8: Hoare triple {645#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} assume !(0 == ~cond); {649#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-27 12:51:18,694 INFO L290 TraceCheckUtils]: 9: Hoare triple {649#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {649#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-27 12:51:18,694 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {649#(not (= |assume_abort_if_not_#in~cond| 0))} {619#true} #66#return; {656#(and (<= 0 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-27 12:51:18,695 INFO L290 TraceCheckUtils]: 11: Hoare triple {656#(and (<= 0 main_~x~0) (<= main_~x~0 2))} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {656#(and (<= 0 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-27 12:51:18,695 INFO L272 TraceCheckUtils]: 12: Hoare triple {656#(and (<= 0 main_~x~0) (<= main_~x~0 2))} call assume_abort_if_not((if ~y~0 >= 0 && ~y~0 <= 2 then 1 else 0)); {619#true} is VALID [2022-04-27 12:51:18,695 INFO L290 TraceCheckUtils]: 13: Hoare triple {619#true} ~cond := #in~cond; {645#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-04-27 12:51:18,696 INFO L290 TraceCheckUtils]: 14: Hoare triple {645#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} assume !(0 == ~cond); {649#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-27 12:51:18,696 INFO L290 TraceCheckUtils]: 15: Hoare triple {649#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {649#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-27 12:51:18,697 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {649#(not (= |assume_abort_if_not_#in~cond| 0))} {656#(and (<= 0 main_~x~0) (<= main_~x~0 2))} #68#return; {675#(and (<= 0 main_~y~0) (<= main_~y~0 2) (<= 0 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-27 12:51:18,697 INFO L272 TraceCheckUtils]: 17: Hoare triple {675#(and (<= 0 main_~y~0) (<= main_~y~0 2) (<= 0 main_~x~0) (<= main_~x~0 2))} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {619#true} is VALID [2022-04-27 12:51:18,697 INFO L290 TraceCheckUtils]: 18: Hoare triple {619#true} ~cond := #in~cond; {645#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-04-27 12:51:18,698 INFO L290 TraceCheckUtils]: 19: Hoare triple {645#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} assume !(0 == ~cond); {649#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-27 12:51:18,698 INFO L290 TraceCheckUtils]: 20: Hoare triple {649#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {649#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-27 12:51:18,699 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {649#(not (= |assume_abort_if_not_#in~cond| 0))} {675#(and (<= 0 main_~y~0) (<= main_~y~0 2) (<= 0 main_~x~0) (<= main_~x~0 2))} #70#return; {691#(and (<= 0 main_~y~0) (<= 1 main_~x~0) (<= main_~y~0 2) (<= main_~x~0 2))} is VALID [2022-04-27 12:51:18,699 INFO L272 TraceCheckUtils]: 22: Hoare triple {691#(and (<= 0 main_~y~0) (<= 1 main_~x~0) (<= main_~y~0 2) (<= main_~x~0 2))} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {619#true} is VALID [2022-04-27 12:51:18,699 INFO L290 TraceCheckUtils]: 23: Hoare triple {619#true} ~cond := #in~cond; {645#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-04-27 12:51:18,700 INFO L290 TraceCheckUtils]: 24: Hoare triple {645#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} assume !(0 == ~cond); {649#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-27 12:51:18,700 INFO L290 TraceCheckUtils]: 25: Hoare triple {649#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {649#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-27 12:51:18,701 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {649#(not (= |assume_abort_if_not_#in~cond| 0))} {691#(and (<= 0 main_~y~0) (<= 1 main_~x~0) (<= main_~y~0 2) (<= main_~x~0 2))} #72#return; {707#(and (<= 1 main_~x~0) (<= main_~y~0 2) (<= 1 main_~y~0) (<= main_~x~0 2))} is VALID [2022-04-27 12:51:18,701 INFO L290 TraceCheckUtils]: 27: Hoare triple {707#(and (<= 1 main_~x~0) (<= main_~y~0 2) (<= 1 main_~y~0) (<= main_~x~0 2))} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1; {711#(and (= main_~r~0 0) (<= 1 main_~x~0) (<= main_~y~0 2) (<= 1 main_~y~0) (= main_~a~0 main_~x~0) (<= main_~x~0 2) (= main_~p~0 1))} is VALID [2022-04-27 12:51:18,702 INFO L290 TraceCheckUtils]: 28: Hoare triple {711#(and (= main_~r~0 0) (<= 1 main_~x~0) (<= main_~y~0 2) (<= 1 main_~y~0) (= main_~a~0 main_~x~0) (<= main_~x~0 2) (= main_~p~0 1))} assume !false; {711#(and (= main_~r~0 0) (<= 1 main_~x~0) (<= main_~y~0 2) (<= 1 main_~y~0) (= main_~a~0 main_~x~0) (<= main_~x~0 2) (= main_~p~0 1))} is VALID [2022-04-27 12:51:18,702 INFO L272 TraceCheckUtils]: 29: Hoare triple {711#(and (= main_~r~0 0) (<= 1 main_~x~0) (<= main_~y~0 2) (<= 1 main_~y~0) (= main_~a~0 main_~x~0) (<= main_~x~0 2) (= main_~p~0 1))} call __VERIFIER_assert((if 1 == ~p~0 * ~s~0 - ~r~0 * ~q~0 then 1 else 0)); {619#true} is VALID [2022-04-27 12:51:18,702 INFO L290 TraceCheckUtils]: 30: Hoare triple {619#true} ~cond := #in~cond; {619#true} is VALID [2022-04-27 12:51:18,702 INFO L290 TraceCheckUtils]: 31: Hoare triple {619#true} assume !(0 == ~cond); {619#true} is VALID [2022-04-27 12:51:18,702 INFO L290 TraceCheckUtils]: 32: Hoare triple {619#true} assume true; {619#true} is VALID [2022-04-27 12:51:18,703 INFO L284 TraceCheckUtils]: 33: Hoare quadruple {619#true} {711#(and (= main_~r~0 0) (<= 1 main_~x~0) (<= main_~y~0 2) (<= 1 main_~y~0) (= main_~a~0 main_~x~0) (<= main_~x~0 2) (= main_~p~0 1))} #74#return; {711#(and (= main_~r~0 0) (<= 1 main_~x~0) (<= main_~y~0 2) (<= 1 main_~y~0) (= main_~a~0 main_~x~0) (<= main_~x~0 2) (= main_~p~0 1))} is VALID [2022-04-27 12:51:18,704 INFO L272 TraceCheckUtils]: 34: Hoare triple {711#(and (= main_~r~0 0) (<= 1 main_~x~0) (<= main_~y~0 2) (<= 1 main_~y~0) (= main_~a~0 main_~x~0) (<= main_~x~0 2) (= main_~p~0 1))} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {733#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 12:51:18,704 INFO L290 TraceCheckUtils]: 35: Hoare triple {733#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {737#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 12:51:18,705 INFO L290 TraceCheckUtils]: 36: Hoare triple {737#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {620#false} is VALID [2022-04-27 12:51:18,705 INFO L290 TraceCheckUtils]: 37: Hoare triple {620#false} assume !false; {620#false} is VALID [2022-04-27 12:51:18,705 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-04-27 12:51:18,705 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-27 12:51:18,705 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 12:51:18,705 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1285086674] [2022-04-27 12:51:18,706 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 12:51:18,706 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1987200759] [2022-04-27 12:51:18,706 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1987200759] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 12:51:18,706 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 12:51:18,706 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-04-27 12:51:18,706 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1285638975] [2022-04-27 12:51:18,706 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 12:51:18,707 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 9 states have (on average 1.6666666666666667) internal successors, (15), 7 states have internal predecessors, (15), 5 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) Word has length 38 [2022-04-27 12:51:18,707 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 12:51:18,707 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 11 states, 9 states have (on average 1.6666666666666667) internal successors, (15), 7 states have internal predecessors, (15), 5 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2022-04-27 12:51:18,730 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 29 edges. 29 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 12:51:18,730 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-04-27 12:51:18,730 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 12:51:18,731 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-04-27 12:51:18,731 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2022-04-27 12:51:18,731 INFO L87 Difference]: Start difference. First operand 45 states and 62 transitions. Second operand has 11 states, 9 states have (on average 1.6666666666666667) internal successors, (15), 7 states have internal predecessors, (15), 5 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2022-04-27 12:51:19,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:51:19,163 INFO L93 Difference]: Finished difference Result 52 states and 68 transitions. [2022-04-27 12:51:19,163 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-04-27 12:51:19,164 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 9 states have (on average 1.6666666666666667) internal successors, (15), 7 states have internal predecessors, (15), 5 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) Word has length 38 [2022-04-27 12:51:19,164 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 12:51:19,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 9 states have (on average 1.6666666666666667) internal successors, (15), 7 states have internal predecessors, (15), 5 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2022-04-27 12:51:19,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 65 transitions. [2022-04-27 12:51:19,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 9 states have (on average 1.6666666666666667) internal successors, (15), 7 states have internal predecessors, (15), 5 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2022-04-27 12:51:19,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 65 transitions. [2022-04-27 12:51:19,167 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 11 states and 65 transitions. [2022-04-27 12:51:19,218 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 65 edges. 65 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 12:51:19,220 INFO L225 Difference]: With dead ends: 52 [2022-04-27 12:51:19,220 INFO L226 Difference]: Without dead ends: 50 [2022-04-27 12:51:19,220 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=119, Unknown=0, NotChecked=0, Total=156 [2022-04-27 12:51:19,221 INFO L413 NwaCegarLoop]: 38 mSDtfsCounter, 30 mSDsluCounter, 130 mSDsCounter, 0 mSdLazyCounter, 150 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 168 SdHoareTripleChecker+Invalid, 171 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 150 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-27 12:51:19,221 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 168 Invalid, 171 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 150 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-27 12:51:19,222 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2022-04-27 12:51:19,255 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 49. [2022-04-27 12:51:19,256 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 12:51:19,256 INFO L82 GeneralOperation]: Start isEquivalent. First operand 50 states. Second operand has 49 states, 24 states have (on average 1.2083333333333333) internal successors, (29), 26 states have internal predecessors, (29), 19 states have call successors, (19), 6 states have call predecessors, (19), 5 states have return successors, (17), 16 states have call predecessors, (17), 17 states have call successors, (17) [2022-04-27 12:51:19,256 INFO L74 IsIncluded]: Start isIncluded. First operand 50 states. Second operand has 49 states, 24 states have (on average 1.2083333333333333) internal successors, (29), 26 states have internal predecessors, (29), 19 states have call successors, (19), 6 states have call predecessors, (19), 5 states have return successors, (17), 16 states have call predecessors, (17), 17 states have call successors, (17) [2022-04-27 12:51:19,257 INFO L87 Difference]: Start difference. First operand 50 states. Second operand has 49 states, 24 states have (on average 1.2083333333333333) internal successors, (29), 26 states have internal predecessors, (29), 19 states have call successors, (19), 6 states have call predecessors, (19), 5 states have return successors, (17), 16 states have call predecessors, (17), 17 states have call successors, (17) [2022-04-27 12:51:19,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:51:19,259 INFO L93 Difference]: Finished difference Result 50 states and 66 transitions. [2022-04-27 12:51:19,259 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 66 transitions. [2022-04-27 12:51:19,259 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 12:51:19,259 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 12:51:19,260 INFO L74 IsIncluded]: Start isIncluded. First operand has 49 states, 24 states have (on average 1.2083333333333333) internal successors, (29), 26 states have internal predecessors, (29), 19 states have call successors, (19), 6 states have call predecessors, (19), 5 states have return successors, (17), 16 states have call predecessors, (17), 17 states have call successors, (17) Second operand 50 states. [2022-04-27 12:51:19,260 INFO L87 Difference]: Start difference. First operand has 49 states, 24 states have (on average 1.2083333333333333) internal successors, (29), 26 states have internal predecessors, (29), 19 states have call successors, (19), 6 states have call predecessors, (19), 5 states have return successors, (17), 16 states have call predecessors, (17), 17 states have call successors, (17) Second operand 50 states. [2022-04-27 12:51:19,262 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:51:19,262 INFO L93 Difference]: Finished difference Result 50 states and 66 transitions. [2022-04-27 12:51:19,262 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 66 transitions. [2022-04-27 12:51:19,262 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 12:51:19,262 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 12:51:19,263 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 12:51:19,263 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 12:51:19,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 24 states have (on average 1.2083333333333333) internal successors, (29), 26 states have internal predecessors, (29), 19 states have call successors, (19), 6 states have call predecessors, (19), 5 states have return successors, (17), 16 states have call predecessors, (17), 17 states have call successors, (17) [2022-04-27 12:51:19,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 65 transitions. [2022-04-27 12:51:19,264 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 65 transitions. Word has length 38 [2022-04-27 12:51:19,265 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 12:51:19,265 INFO L495 AbstractCegarLoop]: Abstraction has 49 states and 65 transitions. [2022-04-27 12:51:19,265 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 9 states have (on average 1.6666666666666667) internal successors, (15), 7 states have internal predecessors, (15), 5 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2022-04-27 12:51:19,265 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 65 transitions. [2022-04-27 12:51:19,265 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2022-04-27 12:51:19,266 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 12:51:19,266 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 12:51:19,284 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2022-04-27 12:51:19,481 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2022-04-27 12:51:19,482 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 12:51:19,482 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 12:51:19,482 INFO L85 PathProgramCache]: Analyzing trace with hash 1732898944, now seen corresponding path program 1 times [2022-04-27 12:51:19,482 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 12:51:19,483 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1256107575] [2022-04-27 12:51:19,483 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 12:51:19,483 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 12:51:19,495 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 12:51:19,495 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1284420082] [2022-04-27 12:51:19,495 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 12:51:19,495 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 12:51:19,495 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 12:51:19,496 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-27 12:51:19,497 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-04-27 12:51:19,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 12:51:19,531 INFO L263 TraceCheckSpWp]: Trace formula consists of 123 conjuncts, 29 conjunts are in the unsatisfiable core [2022-04-27 12:51:19,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 12:51:19,541 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 12:51:19,938 INFO L272 TraceCheckUtils]: 0: Hoare triple {1003#true} call ULTIMATE.init(); {1003#true} is VALID [2022-04-27 12:51:19,938 INFO L290 TraceCheckUtils]: 1: Hoare triple {1003#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(10, 2);call #Ultimate.allocInit(12, 3); {1003#true} is VALID [2022-04-27 12:51:19,938 INFO L290 TraceCheckUtils]: 2: Hoare triple {1003#true} assume true; {1003#true} is VALID [2022-04-27 12:51:19,938 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1003#true} {1003#true} #88#return; {1003#true} is VALID [2022-04-27 12:51:19,938 INFO L272 TraceCheckUtils]: 4: Hoare triple {1003#true} call #t~ret6 := main(); {1003#true} is VALID [2022-04-27 12:51:19,939 INFO L290 TraceCheckUtils]: 5: Hoare triple {1003#true} havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~s~0;havoc ~x~0;havoc ~y~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4; {1003#true} is VALID [2022-04-27 12:51:19,939 INFO L272 TraceCheckUtils]: 6: Hoare triple {1003#true} call assume_abort_if_not((if ~x~0 >= 0 && ~x~0 <= 2 then 1 else 0)); {1003#true} is VALID [2022-04-27 12:51:19,939 INFO L290 TraceCheckUtils]: 7: Hoare triple {1003#true} ~cond := #in~cond; {1029#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-04-27 12:51:19,939 INFO L290 TraceCheckUtils]: 8: Hoare triple {1029#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} assume !(0 == ~cond); {1033#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-27 12:51:19,940 INFO L290 TraceCheckUtils]: 9: Hoare triple {1033#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {1033#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-27 12:51:19,940 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1033#(not (= |assume_abort_if_not_#in~cond| 0))} {1003#true} #66#return; {1040#(and (<= 0 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-27 12:51:19,941 INFO L290 TraceCheckUtils]: 11: Hoare triple {1040#(and (<= 0 main_~x~0) (<= main_~x~0 2))} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {1040#(and (<= 0 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-27 12:51:19,941 INFO L272 TraceCheckUtils]: 12: Hoare triple {1040#(and (<= 0 main_~x~0) (<= main_~x~0 2))} call assume_abort_if_not((if ~y~0 >= 0 && ~y~0 <= 2 then 1 else 0)); {1003#true} is VALID [2022-04-27 12:51:19,941 INFO L290 TraceCheckUtils]: 13: Hoare triple {1003#true} ~cond := #in~cond; {1029#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-04-27 12:51:19,941 INFO L290 TraceCheckUtils]: 14: Hoare triple {1029#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} assume !(0 == ~cond); {1033#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-27 12:51:19,942 INFO L290 TraceCheckUtils]: 15: Hoare triple {1033#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {1033#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-27 12:51:19,942 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {1033#(not (= |assume_abort_if_not_#in~cond| 0))} {1040#(and (<= 0 main_~x~0) (<= main_~x~0 2))} #68#return; {1059#(and (<= 0 main_~y~0) (<= main_~y~0 2) (<= 0 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-27 12:51:19,943 INFO L272 TraceCheckUtils]: 17: Hoare triple {1059#(and (<= 0 main_~y~0) (<= main_~y~0 2) (<= 0 main_~x~0) (<= main_~x~0 2))} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {1003#true} is VALID [2022-04-27 12:51:19,943 INFO L290 TraceCheckUtils]: 18: Hoare triple {1003#true} ~cond := #in~cond; {1029#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-04-27 12:51:19,943 INFO L290 TraceCheckUtils]: 19: Hoare triple {1029#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} assume !(0 == ~cond); {1033#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-27 12:51:19,944 INFO L290 TraceCheckUtils]: 20: Hoare triple {1033#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {1033#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-27 12:51:19,944 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {1033#(not (= |assume_abort_if_not_#in~cond| 0))} {1059#(and (<= 0 main_~y~0) (<= main_~y~0 2) (<= 0 main_~x~0) (<= main_~x~0 2))} #70#return; {1075#(and (<= 0 main_~y~0) (<= 1 main_~x~0) (<= main_~y~0 2) (<= main_~x~0 2))} is VALID [2022-04-27 12:51:19,944 INFO L272 TraceCheckUtils]: 22: Hoare triple {1075#(and (<= 0 main_~y~0) (<= 1 main_~x~0) (<= main_~y~0 2) (<= main_~x~0 2))} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {1003#true} is VALID [2022-04-27 12:51:19,945 INFO L290 TraceCheckUtils]: 23: Hoare triple {1003#true} ~cond := #in~cond; {1029#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-04-27 12:51:19,945 INFO L290 TraceCheckUtils]: 24: Hoare triple {1029#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} assume !(0 == ~cond); {1033#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-27 12:51:19,945 INFO L290 TraceCheckUtils]: 25: Hoare triple {1033#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {1033#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-27 12:51:19,946 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {1033#(not (= |assume_abort_if_not_#in~cond| 0))} {1075#(and (<= 0 main_~y~0) (<= 1 main_~x~0) (<= main_~y~0 2) (<= main_~x~0 2))} #72#return; {1091#(and (<= 1 main_~x~0) (<= main_~y~0 2) (<= 1 main_~y~0) (<= main_~x~0 2))} is VALID [2022-04-27 12:51:19,946 INFO L290 TraceCheckUtils]: 27: Hoare triple {1091#(and (<= 1 main_~x~0) (<= main_~y~0 2) (<= 1 main_~y~0) (<= main_~x~0 2))} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1; {1095#(and (<= 1 main_~x~0) (<= main_~y~0 2) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (<= 1 main_~y~0) (<= main_~x~0 2))} is VALID [2022-04-27 12:51:19,947 INFO L290 TraceCheckUtils]: 28: Hoare triple {1095#(and (<= 1 main_~x~0) (<= main_~y~0 2) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (<= 1 main_~y~0) (<= main_~x~0 2))} assume !false; {1095#(and (<= 1 main_~x~0) (<= main_~y~0 2) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (<= 1 main_~y~0) (<= main_~x~0 2))} is VALID [2022-04-27 12:51:19,947 INFO L272 TraceCheckUtils]: 29: Hoare triple {1095#(and (<= 1 main_~x~0) (<= main_~y~0 2) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (<= 1 main_~y~0) (<= main_~x~0 2))} call __VERIFIER_assert((if 1 == ~p~0 * ~s~0 - ~r~0 * ~q~0 then 1 else 0)); {1003#true} is VALID [2022-04-27 12:51:19,947 INFO L290 TraceCheckUtils]: 30: Hoare triple {1003#true} ~cond := #in~cond; {1003#true} is VALID [2022-04-27 12:51:19,947 INFO L290 TraceCheckUtils]: 31: Hoare triple {1003#true} assume !(0 == ~cond); {1003#true} is VALID [2022-04-27 12:51:19,947 INFO L290 TraceCheckUtils]: 32: Hoare triple {1003#true} assume true; {1003#true} is VALID [2022-04-27 12:51:19,948 INFO L284 TraceCheckUtils]: 33: Hoare quadruple {1003#true} {1095#(and (<= 1 main_~x~0) (<= main_~y~0 2) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (<= 1 main_~y~0) (<= main_~x~0 2))} #74#return; {1095#(and (<= 1 main_~x~0) (<= main_~y~0 2) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (<= 1 main_~y~0) (<= main_~x~0 2))} is VALID [2022-04-27 12:51:19,948 INFO L272 TraceCheckUtils]: 34: Hoare triple {1095#(and (<= 1 main_~x~0) (<= main_~y~0 2) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (<= 1 main_~y~0) (<= main_~x~0 2))} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {1003#true} is VALID [2022-04-27 12:51:19,948 INFO L290 TraceCheckUtils]: 35: Hoare triple {1003#true} ~cond := #in~cond; {1003#true} is VALID [2022-04-27 12:51:19,948 INFO L290 TraceCheckUtils]: 36: Hoare triple {1003#true} assume !(0 == ~cond); {1003#true} is VALID [2022-04-27 12:51:19,948 INFO L290 TraceCheckUtils]: 37: Hoare triple {1003#true} assume true; {1003#true} is VALID [2022-04-27 12:51:19,949 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {1003#true} {1095#(and (<= 1 main_~x~0) (<= main_~y~0 2) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (<= 1 main_~y~0) (<= main_~x~0 2))} #76#return; {1095#(and (<= 1 main_~x~0) (<= main_~y~0 2) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (<= 1 main_~y~0) (<= main_~x~0 2))} is VALID [2022-04-27 12:51:19,950 INFO L272 TraceCheckUtils]: 39: Hoare triple {1095#(and (<= 1 main_~x~0) (<= main_~y~0 2) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (<= 1 main_~y~0) (<= main_~x~0 2))} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {1132#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 12:51:19,950 INFO L290 TraceCheckUtils]: 40: Hoare triple {1132#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1136#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 12:51:19,950 INFO L290 TraceCheckUtils]: 41: Hoare triple {1136#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1004#false} is VALID [2022-04-27 12:51:19,950 INFO L290 TraceCheckUtils]: 42: Hoare triple {1004#false} assume !false; {1004#false} is VALID [2022-04-27 12:51:19,951 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2022-04-27 12:51:19,951 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-27 12:51:19,951 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 12:51:19,951 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1256107575] [2022-04-27 12:51:19,951 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 12:51:19,951 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1284420082] [2022-04-27 12:51:19,951 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1284420082] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 12:51:19,951 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 12:51:19,951 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-04-27 12:51:19,952 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1210629295] [2022-04-27 12:51:19,952 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 12:51:19,952 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 9 states have (on average 1.6666666666666667) internal successors, (15), 7 states have internal predecessors, (15), 5 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (7), 6 states have call predecessors, (7), 5 states have call successors, (7) Word has length 43 [2022-04-27 12:51:19,952 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 12:51:19,952 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 11 states, 9 states have (on average 1.6666666666666667) internal successors, (15), 7 states have internal predecessors, (15), 5 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (7), 6 states have call predecessors, (7), 5 states have call successors, (7) [2022-04-27 12:51:19,974 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 31 edges. 31 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 12:51:19,975 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-04-27 12:51:19,975 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 12:51:19,975 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-04-27 12:51:19,975 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2022-04-27 12:51:19,975 INFO L87 Difference]: Start difference. First operand 49 states and 65 transitions. Second operand has 11 states, 9 states have (on average 1.6666666666666667) internal successors, (15), 7 states have internal predecessors, (15), 5 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (7), 6 states have call predecessors, (7), 5 states have call successors, (7) [2022-04-27 12:51:20,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:51:20,455 INFO L93 Difference]: Finished difference Result 74 states and 105 transitions. [2022-04-27 12:51:20,455 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-04-27 12:51:20,455 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 9 states have (on average 1.6666666666666667) internal successors, (15), 7 states have internal predecessors, (15), 5 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (7), 6 states have call predecessors, (7), 5 states have call successors, (7) Word has length 43 [2022-04-27 12:51:20,455 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 12:51:20,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 9 states have (on average 1.6666666666666667) internal successors, (15), 7 states have internal predecessors, (15), 5 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (7), 6 states have call predecessors, (7), 5 states have call successors, (7) [2022-04-27 12:51:20,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 65 transitions. [2022-04-27 12:51:20,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 9 states have (on average 1.6666666666666667) internal successors, (15), 7 states have internal predecessors, (15), 5 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (7), 6 states have call predecessors, (7), 5 states have call successors, (7) [2022-04-27 12:51:20,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 65 transitions. [2022-04-27 12:51:20,458 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 11 states and 65 transitions. [2022-04-27 12:51:20,511 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 65 edges. 65 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 12:51:20,513 INFO L225 Difference]: With dead ends: 74 [2022-04-27 12:51:20,513 INFO L226 Difference]: Without dead ends: 70 [2022-04-27 12:51:20,514 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=119, Unknown=0, NotChecked=0, Total=156 [2022-04-27 12:51:20,514 INFO L413 NwaCegarLoop]: 38 mSDtfsCounter, 20 mSDsluCounter, 156 mSDsCounter, 0 mSdLazyCounter, 183 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 194 SdHoareTripleChecker+Invalid, 191 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 183 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-27 12:51:20,515 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 194 Invalid, 191 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 183 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-27 12:51:20,515 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2022-04-27 12:51:20,588 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 70. [2022-04-27 12:51:20,588 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 12:51:20,589 INFO L82 GeneralOperation]: Start isEquivalent. First operand 70 states. Second operand has 70 states, 33 states have (on average 1.2727272727272727) internal successors, (42), 37 states have internal predecessors, (42), 30 states have call successors, (30), 7 states have call predecessors, (30), 6 states have return successors, (26), 25 states have call predecessors, (26), 26 states have call successors, (26) [2022-04-27 12:51:20,589 INFO L74 IsIncluded]: Start isIncluded. First operand 70 states. Second operand has 70 states, 33 states have (on average 1.2727272727272727) internal successors, (42), 37 states have internal predecessors, (42), 30 states have call successors, (30), 7 states have call predecessors, (30), 6 states have return successors, (26), 25 states have call predecessors, (26), 26 states have call successors, (26) [2022-04-27 12:51:20,589 INFO L87 Difference]: Start difference. First operand 70 states. Second operand has 70 states, 33 states have (on average 1.2727272727272727) internal successors, (42), 37 states have internal predecessors, (42), 30 states have call successors, (30), 7 states have call predecessors, (30), 6 states have return successors, (26), 25 states have call predecessors, (26), 26 states have call successors, (26) [2022-04-27 12:51:20,592 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:51:20,592 INFO L93 Difference]: Finished difference Result 70 states and 98 transitions. [2022-04-27 12:51:20,592 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 98 transitions. [2022-04-27 12:51:20,593 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 12:51:20,593 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 12:51:20,593 INFO L74 IsIncluded]: Start isIncluded. First operand has 70 states, 33 states have (on average 1.2727272727272727) internal successors, (42), 37 states have internal predecessors, (42), 30 states have call successors, (30), 7 states have call predecessors, (30), 6 states have return successors, (26), 25 states have call predecessors, (26), 26 states have call successors, (26) Second operand 70 states. [2022-04-27 12:51:20,593 INFO L87 Difference]: Start difference. First operand has 70 states, 33 states have (on average 1.2727272727272727) internal successors, (42), 37 states have internal predecessors, (42), 30 states have call successors, (30), 7 states have call predecessors, (30), 6 states have return successors, (26), 25 states have call predecessors, (26), 26 states have call successors, (26) Second operand 70 states. [2022-04-27 12:51:20,596 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:51:20,596 INFO L93 Difference]: Finished difference Result 70 states and 98 transitions. [2022-04-27 12:51:20,596 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 98 transitions. [2022-04-27 12:51:20,596 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 12:51:20,597 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 12:51:20,597 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 12:51:20,597 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 12:51:20,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 33 states have (on average 1.2727272727272727) internal successors, (42), 37 states have internal predecessors, (42), 30 states have call successors, (30), 7 states have call predecessors, (30), 6 states have return successors, (26), 25 states have call predecessors, (26), 26 states have call successors, (26) [2022-04-27 12:51:20,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 98 transitions. [2022-04-27 12:51:20,599 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 98 transitions. Word has length 43 [2022-04-27 12:51:20,599 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 12:51:20,599 INFO L495 AbstractCegarLoop]: Abstraction has 70 states and 98 transitions. [2022-04-27 12:51:20,600 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 9 states have (on average 1.6666666666666667) internal successors, (15), 7 states have internal predecessors, (15), 5 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (7), 6 states have call predecessors, (7), 5 states have call successors, (7) [2022-04-27 12:51:20,600 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 98 transitions. [2022-04-27 12:51:20,600 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2022-04-27 12:51:20,600 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 12:51:20,600 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 12:51:20,617 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-04-27 12:51:20,810 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 12:51:20,811 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 12:51:20,811 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 12:51:20,811 INFO L85 PathProgramCache]: Analyzing trace with hash -301191846, now seen corresponding path program 1 times [2022-04-27 12:51:20,811 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 12:51:20,811 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [210980268] [2022-04-27 12:51:20,811 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 12:51:20,812 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 12:51:20,839 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 12:51:20,839 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [455117972] [2022-04-27 12:51:20,839 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 12:51:20,839 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 12:51:20,839 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 12:51:20,840 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-27 12:51:20,855 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-04-27 12:51:20,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 12:51:20,879 INFO L263 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 5 conjunts are in the unsatisfiable core [2022-04-27 12:51:20,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 12:51:20,892 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 12:51:20,998 INFO L272 TraceCheckUtils]: 0: Hoare triple {1514#true} call ULTIMATE.init(); {1514#true} is VALID [2022-04-27 12:51:20,998 INFO L290 TraceCheckUtils]: 1: Hoare triple {1514#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(10, 2);call #Ultimate.allocInit(12, 3); {1514#true} is VALID [2022-04-27 12:51:20,998 INFO L290 TraceCheckUtils]: 2: Hoare triple {1514#true} assume true; {1514#true} is VALID [2022-04-27 12:51:20,998 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1514#true} {1514#true} #88#return; {1514#true} is VALID [2022-04-27 12:51:20,998 INFO L272 TraceCheckUtils]: 4: Hoare triple {1514#true} call #t~ret6 := main(); {1514#true} is VALID [2022-04-27 12:51:20,998 INFO L290 TraceCheckUtils]: 5: Hoare triple {1514#true} havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~s~0;havoc ~x~0;havoc ~y~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4; {1514#true} is VALID [2022-04-27 12:51:20,999 INFO L272 TraceCheckUtils]: 6: Hoare triple {1514#true} call assume_abort_if_not((if ~x~0 >= 0 && ~x~0 <= 2 then 1 else 0)); {1514#true} is VALID [2022-04-27 12:51:20,999 INFO L290 TraceCheckUtils]: 7: Hoare triple {1514#true} ~cond := #in~cond; {1514#true} is VALID [2022-04-27 12:51:20,999 INFO L290 TraceCheckUtils]: 8: Hoare triple {1514#true} assume !(0 == ~cond); {1514#true} is VALID [2022-04-27 12:51:20,999 INFO L290 TraceCheckUtils]: 9: Hoare triple {1514#true} assume true; {1514#true} is VALID [2022-04-27 12:51:20,999 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1514#true} {1514#true} #66#return; {1514#true} is VALID [2022-04-27 12:51:20,999 INFO L290 TraceCheckUtils]: 11: Hoare triple {1514#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {1514#true} is VALID [2022-04-27 12:51:20,999 INFO L272 TraceCheckUtils]: 12: Hoare triple {1514#true} call assume_abort_if_not((if ~y~0 >= 0 && ~y~0 <= 2 then 1 else 0)); {1514#true} is VALID [2022-04-27 12:51:20,999 INFO L290 TraceCheckUtils]: 13: Hoare triple {1514#true} ~cond := #in~cond; {1514#true} is VALID [2022-04-27 12:51:20,999 INFO L290 TraceCheckUtils]: 14: Hoare triple {1514#true} assume !(0 == ~cond); {1514#true} is VALID [2022-04-27 12:51:20,999 INFO L290 TraceCheckUtils]: 15: Hoare triple {1514#true} assume true; {1514#true} is VALID [2022-04-27 12:51:20,999 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {1514#true} {1514#true} #68#return; {1514#true} is VALID [2022-04-27 12:51:21,000 INFO L272 TraceCheckUtils]: 17: Hoare triple {1514#true} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {1514#true} is VALID [2022-04-27 12:51:21,000 INFO L290 TraceCheckUtils]: 18: Hoare triple {1514#true} ~cond := #in~cond; {1514#true} is VALID [2022-04-27 12:51:21,000 INFO L290 TraceCheckUtils]: 19: Hoare triple {1514#true} assume !(0 == ~cond); {1514#true} is VALID [2022-04-27 12:51:21,000 INFO L290 TraceCheckUtils]: 20: Hoare triple {1514#true} assume true; {1514#true} is VALID [2022-04-27 12:51:21,000 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {1514#true} {1514#true} #70#return; {1514#true} is VALID [2022-04-27 12:51:21,000 INFO L272 TraceCheckUtils]: 22: Hoare triple {1514#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {1514#true} is VALID [2022-04-27 12:51:21,000 INFO L290 TraceCheckUtils]: 23: Hoare triple {1514#true} ~cond := #in~cond; {1514#true} is VALID [2022-04-27 12:51:21,000 INFO L290 TraceCheckUtils]: 24: Hoare triple {1514#true} assume !(0 == ~cond); {1514#true} is VALID [2022-04-27 12:51:21,000 INFO L290 TraceCheckUtils]: 25: Hoare triple {1514#true} assume true; {1514#true} is VALID [2022-04-27 12:51:21,000 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {1514#true} {1514#true} #72#return; {1514#true} is VALID [2022-04-27 12:51:21,000 INFO L290 TraceCheckUtils]: 27: Hoare triple {1514#true} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1; {1514#true} is VALID [2022-04-27 12:51:21,001 INFO L290 TraceCheckUtils]: 28: Hoare triple {1514#true} assume !false; {1514#true} is VALID [2022-04-27 12:51:21,001 INFO L272 TraceCheckUtils]: 29: Hoare triple {1514#true} call __VERIFIER_assert((if 1 == ~p~0 * ~s~0 - ~r~0 * ~q~0 then 1 else 0)); {1514#true} is VALID [2022-04-27 12:51:21,001 INFO L290 TraceCheckUtils]: 30: Hoare triple {1514#true} ~cond := #in~cond; {1514#true} is VALID [2022-04-27 12:51:21,001 INFO L290 TraceCheckUtils]: 31: Hoare triple {1514#true} assume !(0 == ~cond); {1514#true} is VALID [2022-04-27 12:51:21,001 INFO L290 TraceCheckUtils]: 32: Hoare triple {1514#true} assume true; {1514#true} is VALID [2022-04-27 12:51:21,001 INFO L284 TraceCheckUtils]: 33: Hoare quadruple {1514#true} {1514#true} #74#return; {1514#true} is VALID [2022-04-27 12:51:21,001 INFO L272 TraceCheckUtils]: 34: Hoare triple {1514#true} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {1514#true} is VALID [2022-04-27 12:51:21,001 INFO L290 TraceCheckUtils]: 35: Hoare triple {1514#true} ~cond := #in~cond; {1514#true} is VALID [2022-04-27 12:51:21,001 INFO L290 TraceCheckUtils]: 36: Hoare triple {1514#true} assume !(0 == ~cond); {1514#true} is VALID [2022-04-27 12:51:21,001 INFO L290 TraceCheckUtils]: 37: Hoare triple {1514#true} assume true; {1514#true} is VALID [2022-04-27 12:51:21,001 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {1514#true} {1514#true} #76#return; {1514#true} is VALID [2022-04-27 12:51:21,002 INFO L272 TraceCheckUtils]: 39: Hoare triple {1514#true} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {1514#true} is VALID [2022-04-27 12:51:21,002 INFO L290 TraceCheckUtils]: 40: Hoare triple {1514#true} ~cond := #in~cond; {1514#true} is VALID [2022-04-27 12:51:21,002 INFO L290 TraceCheckUtils]: 41: Hoare triple {1514#true} assume !(0 == ~cond); {1514#true} is VALID [2022-04-27 12:51:21,002 INFO L290 TraceCheckUtils]: 42: Hoare triple {1514#true} assume true; {1514#true} is VALID [2022-04-27 12:51:21,002 INFO L284 TraceCheckUtils]: 43: Hoare quadruple {1514#true} {1514#true} #78#return; {1514#true} is VALID [2022-04-27 12:51:21,003 INFO L290 TraceCheckUtils]: 44: Hoare triple {1514#true} assume !(~a~0 != ~b~0); {1651#(= main_~b~0 main_~a~0)} is VALID [2022-04-27 12:51:21,003 INFO L272 TraceCheckUtils]: 45: Hoare triple {1651#(= main_~b~0 main_~a~0)} call __VERIFIER_assert((if 0 == ~a~0 - ~b~0 then 1 else 0)); {1655#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 12:51:21,004 INFO L290 TraceCheckUtils]: 46: Hoare triple {1655#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1659#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 12:51:21,004 INFO L290 TraceCheckUtils]: 47: Hoare triple {1659#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1515#false} is VALID [2022-04-27 12:51:21,004 INFO L290 TraceCheckUtils]: 48: Hoare triple {1515#false} assume !false; {1515#false} is VALID [2022-04-27 12:51:21,004 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2022-04-27 12:51:21,004 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-27 12:51:21,004 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 12:51:21,005 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [210980268] [2022-04-27 12:51:21,005 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 12:51:21,005 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [455117972] [2022-04-27 12:51:21,005 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [455117972] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 12:51:21,005 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 12:51:21,005 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-27 12:51:21,005 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [22024087] [2022-04-27 12:51:21,005 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 12:51:21,006 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 2 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) Word has length 49 [2022-04-27 12:51:21,006 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 12:51:21,006 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 2 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2022-04-27 12:51:21,027 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 34 edges. 34 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 12:51:21,027 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-27 12:51:21,027 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 12:51:21,028 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-27 12:51:21,028 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-27 12:51:21,028 INFO L87 Difference]: Start difference. First operand 70 states and 98 transitions. Second operand has 5 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 2 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2022-04-27 12:51:21,237 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:51:21,237 INFO L93 Difference]: Finished difference Result 76 states and 103 transitions. [2022-04-27 12:51:21,237 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-27 12:51:21,237 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 2 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) Word has length 49 [2022-04-27 12:51:21,237 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 12:51:21,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 2 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2022-04-27 12:51:21,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 47 transitions. [2022-04-27 12:51:21,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 2 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2022-04-27 12:51:21,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 47 transitions. [2022-04-27 12:51:21,239 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 47 transitions. [2022-04-27 12:51:21,271 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-27 12:51:21,273 INFO L225 Difference]: With dead ends: 76 [2022-04-27 12:51:21,273 INFO L226 Difference]: Without dead ends: 74 [2022-04-27 12:51:21,273 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-27 12:51:21,274 INFO L413 NwaCegarLoop]: 42 mSDtfsCounter, 5 mSDsluCounter, 97 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 139 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 12:51:21,274 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 139 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 12:51:21,274 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2022-04-27 12:51:21,326 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 74. [2022-04-27 12:51:21,326 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 12:51:21,327 INFO L82 GeneralOperation]: Start isEquivalent. First operand 74 states. Second operand has 74 states, 36 states have (on average 1.25) internal successors, (45), 40 states have internal predecessors, (45), 30 states have call successors, (30), 8 states have call predecessors, (30), 7 states have return successors, (26), 25 states have call predecessors, (26), 26 states have call successors, (26) [2022-04-27 12:51:21,327 INFO L74 IsIncluded]: Start isIncluded. First operand 74 states. Second operand has 74 states, 36 states have (on average 1.25) internal successors, (45), 40 states have internal predecessors, (45), 30 states have call successors, (30), 8 states have call predecessors, (30), 7 states have return successors, (26), 25 states have call predecessors, (26), 26 states have call successors, (26) [2022-04-27 12:51:21,327 INFO L87 Difference]: Start difference. First operand 74 states. Second operand has 74 states, 36 states have (on average 1.25) internal successors, (45), 40 states have internal predecessors, (45), 30 states have call successors, (30), 8 states have call predecessors, (30), 7 states have return successors, (26), 25 states have call predecessors, (26), 26 states have call successors, (26) [2022-04-27 12:51:21,330 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:51:21,330 INFO L93 Difference]: Finished difference Result 74 states and 101 transitions. [2022-04-27 12:51:21,330 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 101 transitions. [2022-04-27 12:51:21,330 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 12:51:21,331 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 12:51:21,331 INFO L74 IsIncluded]: Start isIncluded. First operand has 74 states, 36 states have (on average 1.25) internal successors, (45), 40 states have internal predecessors, (45), 30 states have call successors, (30), 8 states have call predecessors, (30), 7 states have return successors, (26), 25 states have call predecessors, (26), 26 states have call successors, (26) Second operand 74 states. [2022-04-27 12:51:21,331 INFO L87 Difference]: Start difference. First operand has 74 states, 36 states have (on average 1.25) internal successors, (45), 40 states have internal predecessors, (45), 30 states have call successors, (30), 8 states have call predecessors, (30), 7 states have return successors, (26), 25 states have call predecessors, (26), 26 states have call successors, (26) Second operand 74 states. [2022-04-27 12:51:21,334 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:51:21,334 INFO L93 Difference]: Finished difference Result 74 states and 101 transitions. [2022-04-27 12:51:21,334 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 101 transitions. [2022-04-27 12:51:21,334 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 12:51:21,335 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 12:51:21,335 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 12:51:21,335 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 12:51:21,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 36 states have (on average 1.25) internal successors, (45), 40 states have internal predecessors, (45), 30 states have call successors, (30), 8 states have call predecessors, (30), 7 states have return successors, (26), 25 states have call predecessors, (26), 26 states have call successors, (26) [2022-04-27 12:51:21,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 101 transitions. [2022-04-27 12:51:21,337 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 101 transitions. Word has length 49 [2022-04-27 12:51:21,338 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 12:51:21,338 INFO L495 AbstractCegarLoop]: Abstraction has 74 states and 101 transitions. [2022-04-27 12:51:21,338 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 2 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2022-04-27 12:51:21,338 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 101 transitions. [2022-04-27 12:51:21,338 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2022-04-27 12:51:21,339 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 12:51:21,339 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 12:51:21,359 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2022-04-27 12:51:21,556 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 12:51:21,556 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 12:51:21,557 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 12:51:21,557 INFO L85 PathProgramCache]: Analyzing trace with hash -1164909737, now seen corresponding path program 1 times [2022-04-27 12:51:21,557 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 12:51:21,557 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [423197558] [2022-04-27 12:51:21,557 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 12:51:21,557 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 12:51:21,571 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 12:51:21,571 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [612519872] [2022-04-27 12:51:21,571 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 12:51:21,572 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 12:51:21,572 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 12:51:21,573 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-27 12:51:21,574 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-04-27 12:51:21,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 12:51:21,611 INFO L263 TraceCheckSpWp]: Trace formula consists of 141 conjuncts, 11 conjunts are in the unsatisfiable core [2022-04-27 12:51:21,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 12:51:21,625 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 12:51:25,798 INFO L272 TraceCheckUtils]: 0: Hoare triple {2049#true} call ULTIMATE.init(); {2049#true} is VALID [2022-04-27 12:51:25,798 INFO L290 TraceCheckUtils]: 1: Hoare triple {2049#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(10, 2);call #Ultimate.allocInit(12, 3); {2049#true} is VALID [2022-04-27 12:51:25,798 INFO L290 TraceCheckUtils]: 2: Hoare triple {2049#true} assume true; {2049#true} is VALID [2022-04-27 12:51:25,799 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2049#true} {2049#true} #88#return; {2049#true} is VALID [2022-04-27 12:51:25,799 INFO L272 TraceCheckUtils]: 4: Hoare triple {2049#true} call #t~ret6 := main(); {2049#true} is VALID [2022-04-27 12:51:25,799 INFO L290 TraceCheckUtils]: 5: Hoare triple {2049#true} havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~s~0;havoc ~x~0;havoc ~y~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4; {2049#true} is VALID [2022-04-27 12:51:25,799 INFO L272 TraceCheckUtils]: 6: Hoare triple {2049#true} call assume_abort_if_not((if ~x~0 >= 0 && ~x~0 <= 2 then 1 else 0)); {2049#true} is VALID [2022-04-27 12:51:25,799 INFO L290 TraceCheckUtils]: 7: Hoare triple {2049#true} ~cond := #in~cond; {2049#true} is VALID [2022-04-27 12:51:25,799 INFO L290 TraceCheckUtils]: 8: Hoare triple {2049#true} assume !(0 == ~cond); {2049#true} is VALID [2022-04-27 12:51:25,799 INFO L290 TraceCheckUtils]: 9: Hoare triple {2049#true} assume true; {2049#true} is VALID [2022-04-27 12:51:25,799 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {2049#true} {2049#true} #66#return; {2049#true} is VALID [2022-04-27 12:51:25,799 INFO L290 TraceCheckUtils]: 11: Hoare triple {2049#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {2049#true} is VALID [2022-04-27 12:51:25,799 INFO L272 TraceCheckUtils]: 12: Hoare triple {2049#true} call assume_abort_if_not((if ~y~0 >= 0 && ~y~0 <= 2 then 1 else 0)); {2049#true} is VALID [2022-04-27 12:51:25,799 INFO L290 TraceCheckUtils]: 13: Hoare triple {2049#true} ~cond := #in~cond; {2049#true} is VALID [2022-04-27 12:51:25,799 INFO L290 TraceCheckUtils]: 14: Hoare triple {2049#true} assume !(0 == ~cond); {2049#true} is VALID [2022-04-27 12:51:25,800 INFO L290 TraceCheckUtils]: 15: Hoare triple {2049#true} assume true; {2049#true} is VALID [2022-04-27 12:51:25,800 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {2049#true} {2049#true} #68#return; {2049#true} is VALID [2022-04-27 12:51:25,802 INFO L272 TraceCheckUtils]: 17: Hoare triple {2049#true} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {2049#true} is VALID [2022-04-27 12:51:25,802 INFO L290 TraceCheckUtils]: 18: Hoare triple {2049#true} ~cond := #in~cond; {2049#true} is VALID [2022-04-27 12:51:25,802 INFO L290 TraceCheckUtils]: 19: Hoare triple {2049#true} assume !(0 == ~cond); {2049#true} is VALID [2022-04-27 12:51:25,802 INFO L290 TraceCheckUtils]: 20: Hoare triple {2049#true} assume true; {2049#true} is VALID [2022-04-27 12:51:25,803 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {2049#true} {2049#true} #70#return; {2049#true} is VALID [2022-04-27 12:51:25,803 INFO L272 TraceCheckUtils]: 22: Hoare triple {2049#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {2049#true} is VALID [2022-04-27 12:51:25,803 INFO L290 TraceCheckUtils]: 23: Hoare triple {2049#true} ~cond := #in~cond; {2049#true} is VALID [2022-04-27 12:51:25,803 INFO L290 TraceCheckUtils]: 24: Hoare triple {2049#true} assume !(0 == ~cond); {2049#true} is VALID [2022-04-27 12:51:25,803 INFO L290 TraceCheckUtils]: 25: Hoare triple {2049#true} assume true; {2049#true} is VALID [2022-04-27 12:51:25,803 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {2049#true} {2049#true} #72#return; {2049#true} is VALID [2022-04-27 12:51:25,808 INFO L290 TraceCheckUtils]: 27: Hoare triple {2049#true} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1; {2135#(and (= main_~s~0 1) (= main_~q~0 0) (= main_~p~0 1))} is VALID [2022-04-27 12:51:25,809 INFO L290 TraceCheckUtils]: 28: Hoare triple {2135#(and (= main_~s~0 1) (= main_~q~0 0) (= main_~p~0 1))} assume !false; {2135#(and (= main_~s~0 1) (= main_~q~0 0) (= main_~p~0 1))} is VALID [2022-04-27 12:51:25,809 INFO L272 TraceCheckUtils]: 29: Hoare triple {2135#(and (= main_~s~0 1) (= main_~q~0 0) (= main_~p~0 1))} call __VERIFIER_assert((if 1 == ~p~0 * ~s~0 - ~r~0 * ~q~0 then 1 else 0)); {2049#true} is VALID [2022-04-27 12:51:25,809 INFO L290 TraceCheckUtils]: 30: Hoare triple {2049#true} ~cond := #in~cond; {2049#true} is VALID [2022-04-27 12:51:25,809 INFO L290 TraceCheckUtils]: 31: Hoare triple {2049#true} assume !(0 == ~cond); {2049#true} is VALID [2022-04-27 12:51:25,810 INFO L290 TraceCheckUtils]: 32: Hoare triple {2049#true} assume true; {2049#true} is VALID [2022-04-27 12:51:25,811 INFO L284 TraceCheckUtils]: 33: Hoare quadruple {2049#true} {2135#(and (= main_~s~0 1) (= main_~q~0 0) (= main_~p~0 1))} #74#return; {2135#(and (= main_~s~0 1) (= main_~q~0 0) (= main_~p~0 1))} is VALID [2022-04-27 12:51:25,811 INFO L272 TraceCheckUtils]: 34: Hoare triple {2135#(and (= main_~s~0 1) (= main_~q~0 0) (= main_~p~0 1))} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {2049#true} is VALID [2022-04-27 12:51:25,811 INFO L290 TraceCheckUtils]: 35: Hoare triple {2049#true} ~cond := #in~cond; {2049#true} is VALID [2022-04-27 12:51:25,811 INFO L290 TraceCheckUtils]: 36: Hoare triple {2049#true} assume !(0 == ~cond); {2049#true} is VALID [2022-04-27 12:51:25,811 INFO L290 TraceCheckUtils]: 37: Hoare triple {2049#true} assume true; {2049#true} is VALID [2022-04-27 12:51:25,812 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {2049#true} {2135#(and (= main_~s~0 1) (= main_~q~0 0) (= main_~p~0 1))} #76#return; {2135#(and (= main_~s~0 1) (= main_~q~0 0) (= main_~p~0 1))} is VALID [2022-04-27 12:51:25,813 INFO L272 TraceCheckUtils]: 39: Hoare triple {2135#(and (= main_~s~0 1) (= main_~q~0 0) (= main_~p~0 1))} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {2049#true} is VALID [2022-04-27 12:51:25,813 INFO L290 TraceCheckUtils]: 40: Hoare triple {2049#true} ~cond := #in~cond; {2049#true} is VALID [2022-04-27 12:51:25,813 INFO L290 TraceCheckUtils]: 41: Hoare triple {2049#true} assume !(0 == ~cond); {2049#true} is VALID [2022-04-27 12:51:25,813 INFO L290 TraceCheckUtils]: 42: Hoare triple {2049#true} assume true; {2049#true} is VALID [2022-04-27 12:51:25,818 INFO L284 TraceCheckUtils]: 43: Hoare quadruple {2049#true} {2135#(and (= main_~s~0 1) (= main_~q~0 0) (= main_~p~0 1))} #78#return; {2135#(and (= main_~s~0 1) (= main_~q~0 0) (= main_~p~0 1))} is VALID [2022-04-27 12:51:25,819 INFO L290 TraceCheckUtils]: 44: Hoare triple {2135#(and (= main_~s~0 1) (= main_~q~0 0) (= main_~p~0 1))} assume !!(~a~0 != ~b~0); {2135#(and (= main_~s~0 1) (= main_~q~0 0) (= main_~p~0 1))} is VALID [2022-04-27 12:51:25,819 INFO L290 TraceCheckUtils]: 45: Hoare triple {2135#(and (= main_~s~0 1) (= main_~q~0 0) (= main_~p~0 1))} assume ~a~0 > ~b~0;~a~0 := ~a~0 - ~b~0;~p~0 := ~p~0 - ~q~0;~r~0 := ~r~0 - ~s~0; {2135#(and (= main_~s~0 1) (= main_~q~0 0) (= main_~p~0 1))} is VALID [2022-04-27 12:51:25,820 INFO L290 TraceCheckUtils]: 46: Hoare triple {2135#(and (= main_~s~0 1) (= main_~q~0 0) (= main_~p~0 1))} assume !false; {2135#(and (= main_~s~0 1) (= main_~q~0 0) (= main_~p~0 1))} is VALID [2022-04-27 12:51:25,821 INFO L272 TraceCheckUtils]: 47: Hoare triple {2135#(and (= main_~s~0 1) (= main_~q~0 0) (= main_~p~0 1))} call __VERIFIER_assert((if 1 == ~p~0 * ~s~0 - ~r~0 * ~q~0 then 1 else 0)); {2196#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 12:51:25,821 INFO L290 TraceCheckUtils]: 48: Hoare triple {2196#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {2200#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 12:51:25,822 INFO L290 TraceCheckUtils]: 49: Hoare triple {2200#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {2050#false} is VALID [2022-04-27 12:51:25,822 INFO L290 TraceCheckUtils]: 50: Hoare triple {2050#false} assume !false; {2050#false} is VALID [2022-04-27 12:51:25,822 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2022-04-27 12:51:25,822 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-27 12:51:25,822 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 12:51:25,822 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [423197558] [2022-04-27 12:51:25,822 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 12:51:25,823 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [612519872] [2022-04-27 12:51:25,823 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [612519872] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 12:51:25,823 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 12:51:25,823 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-27 12:51:25,823 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1941352630] [2022-04-27 12:51:25,823 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 12:51:25,823 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 4 states have internal predecessors, (17), 2 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 51 [2022-04-27 12:51:25,824 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 12:51:25,824 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 3.4) internal successors, (17), 4 states have internal predecessors, (17), 2 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2022-04-27 12:51:25,852 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 35 edges. 35 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 12:51:25,853 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-27 12:51:25,853 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 12:51:25,854 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-27 12:51:25,854 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-27 12:51:25,854 INFO L87 Difference]: Start difference. First operand 74 states and 101 transitions. Second operand has 5 states, 5 states have (on average 3.4) internal successors, (17), 4 states have internal predecessors, (17), 2 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2022-04-27 12:51:26,063 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:51:26,063 INFO L93 Difference]: Finished difference Result 84 states and 109 transitions. [2022-04-27 12:51:26,063 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-27 12:51:26,064 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 4 states have internal predecessors, (17), 2 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 51 [2022-04-27 12:51:26,064 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 12:51:26,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.4) internal successors, (17), 4 states have internal predecessors, (17), 2 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2022-04-27 12:51:26,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 63 transitions. [2022-04-27 12:51:26,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.4) internal successors, (17), 4 states have internal predecessors, (17), 2 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2022-04-27 12:51:26,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 63 transitions. [2022-04-27 12:51:26,066 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 63 transitions. [2022-04-27 12:51:26,106 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 63 edges. 63 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 12:51:26,108 INFO L225 Difference]: With dead ends: 84 [2022-04-27 12:51:26,108 INFO L226 Difference]: Without dead ends: 81 [2022-04-27 12:51:26,108 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 46 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-27 12:51:26,109 INFO L413 NwaCegarLoop]: 43 mSDtfsCounter, 6 mSDsluCounter, 103 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 146 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 12:51:26,109 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 146 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 12:51:26,109 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2022-04-27 12:51:26,156 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 79. [2022-04-27 12:51:26,156 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 12:51:26,157 INFO L82 GeneralOperation]: Start isEquivalent. First operand 81 states. Second operand has 79 states, 42 states have (on average 1.2142857142857142) internal successors, (51), 45 states have internal predecessors, (51), 27 states have call successors, (27), 10 states have call predecessors, (27), 9 states have return successors, (24), 23 states have call predecessors, (24), 24 states have call successors, (24) [2022-04-27 12:51:26,157 INFO L74 IsIncluded]: Start isIncluded. First operand 81 states. Second operand has 79 states, 42 states have (on average 1.2142857142857142) internal successors, (51), 45 states have internal predecessors, (51), 27 states have call successors, (27), 10 states have call predecessors, (27), 9 states have return successors, (24), 23 states have call predecessors, (24), 24 states have call successors, (24) [2022-04-27 12:51:26,157 INFO L87 Difference]: Start difference. First operand 81 states. Second operand has 79 states, 42 states have (on average 1.2142857142857142) internal successors, (51), 45 states have internal predecessors, (51), 27 states have call successors, (27), 10 states have call predecessors, (27), 9 states have return successors, (24), 23 states have call predecessors, (24), 24 states have call successors, (24) [2022-04-27 12:51:26,159 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:51:26,160 INFO L93 Difference]: Finished difference Result 81 states and 105 transitions. [2022-04-27 12:51:26,160 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 105 transitions. [2022-04-27 12:51:26,160 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 12:51:26,160 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 12:51:26,160 INFO L74 IsIncluded]: Start isIncluded. First operand has 79 states, 42 states have (on average 1.2142857142857142) internal successors, (51), 45 states have internal predecessors, (51), 27 states have call successors, (27), 10 states have call predecessors, (27), 9 states have return successors, (24), 23 states have call predecessors, (24), 24 states have call successors, (24) Second operand 81 states. [2022-04-27 12:51:26,161 INFO L87 Difference]: Start difference. First operand has 79 states, 42 states have (on average 1.2142857142857142) internal successors, (51), 45 states have internal predecessors, (51), 27 states have call successors, (27), 10 states have call predecessors, (27), 9 states have return successors, (24), 23 states have call predecessors, (24), 24 states have call successors, (24) Second operand 81 states. [2022-04-27 12:51:26,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:51:26,163 INFO L93 Difference]: Finished difference Result 81 states and 105 transitions. [2022-04-27 12:51:26,163 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 105 transitions. [2022-04-27 12:51:26,164 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 12:51:26,164 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 12:51:26,164 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 12:51:26,164 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 12:51:26,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 42 states have (on average 1.2142857142857142) internal successors, (51), 45 states have internal predecessors, (51), 27 states have call successors, (27), 10 states have call predecessors, (27), 9 states have return successors, (24), 23 states have call predecessors, (24), 24 states have call successors, (24) [2022-04-27 12:51:26,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 102 transitions. [2022-04-27 12:51:26,167 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 102 transitions. Word has length 51 [2022-04-27 12:51:26,167 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 12:51:26,167 INFO L495 AbstractCegarLoop]: Abstraction has 79 states and 102 transitions. [2022-04-27 12:51:26,167 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 4 states have internal predecessors, (17), 2 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2022-04-27 12:51:26,167 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 102 transitions. [2022-04-27 12:51:26,167 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2022-04-27 12:51:26,167 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 12:51:26,168 INFO L195 NwaCegarLoop]: trace histogram [5, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 12:51:26,187 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-27 12:51:26,385 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 12:51:26,385 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 12:51:26,386 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 12:51:26,386 INFO L85 PathProgramCache]: Analyzing trace with hash 1924168317, now seen corresponding path program 1 times [2022-04-27 12:51:26,386 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 12:51:26,386 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [289510763] [2022-04-27 12:51:26,386 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 12:51:26,386 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 12:51:26,398 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 12:51:26,398 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1887345324] [2022-04-27 12:51:26,398 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 12:51:26,399 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 12:51:26,399 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 12:51:26,415 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-27 12:51:26,415 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-04-27 12:51:26,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 12:51:26,449 INFO L263 TraceCheckSpWp]: Trace formula consists of 143 conjuncts, 10 conjunts are in the unsatisfiable core [2022-04-27 12:51:26,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 12:51:26,457 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 12:51:26,592 INFO L272 TraceCheckUtils]: 0: Hoare triple {2618#true} call ULTIMATE.init(); {2618#true} is VALID [2022-04-27 12:51:26,592 INFO L290 TraceCheckUtils]: 1: Hoare triple {2618#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(10, 2);call #Ultimate.allocInit(12, 3); {2618#true} is VALID [2022-04-27 12:51:26,592 INFO L290 TraceCheckUtils]: 2: Hoare triple {2618#true} assume true; {2618#true} is VALID [2022-04-27 12:51:26,592 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2618#true} {2618#true} #88#return; {2618#true} is VALID [2022-04-27 12:51:26,592 INFO L272 TraceCheckUtils]: 4: Hoare triple {2618#true} call #t~ret6 := main(); {2618#true} is VALID [2022-04-27 12:51:26,592 INFO L290 TraceCheckUtils]: 5: Hoare triple {2618#true} havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~s~0;havoc ~x~0;havoc ~y~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4; {2618#true} is VALID [2022-04-27 12:51:26,592 INFO L272 TraceCheckUtils]: 6: Hoare triple {2618#true} call assume_abort_if_not((if ~x~0 >= 0 && ~x~0 <= 2 then 1 else 0)); {2618#true} is VALID [2022-04-27 12:51:26,593 INFO L290 TraceCheckUtils]: 7: Hoare triple {2618#true} ~cond := #in~cond; {2618#true} is VALID [2022-04-27 12:51:26,593 INFO L290 TraceCheckUtils]: 8: Hoare triple {2618#true} assume !(0 == ~cond); {2618#true} is VALID [2022-04-27 12:51:26,593 INFO L290 TraceCheckUtils]: 9: Hoare triple {2618#true} assume true; {2618#true} is VALID [2022-04-27 12:51:26,593 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {2618#true} {2618#true} #66#return; {2618#true} is VALID [2022-04-27 12:51:26,593 INFO L290 TraceCheckUtils]: 11: Hoare triple {2618#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {2618#true} is VALID [2022-04-27 12:51:26,593 INFO L272 TraceCheckUtils]: 12: Hoare triple {2618#true} call assume_abort_if_not((if ~y~0 >= 0 && ~y~0 <= 2 then 1 else 0)); {2618#true} is VALID [2022-04-27 12:51:26,593 INFO L290 TraceCheckUtils]: 13: Hoare triple {2618#true} ~cond := #in~cond; {2618#true} is VALID [2022-04-27 12:51:26,593 INFO L290 TraceCheckUtils]: 14: Hoare triple {2618#true} assume !(0 == ~cond); {2618#true} is VALID [2022-04-27 12:51:26,593 INFO L290 TraceCheckUtils]: 15: Hoare triple {2618#true} assume true; {2618#true} is VALID [2022-04-27 12:51:26,593 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {2618#true} {2618#true} #68#return; {2618#true} is VALID [2022-04-27 12:51:26,593 INFO L272 TraceCheckUtils]: 17: Hoare triple {2618#true} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {2618#true} is VALID [2022-04-27 12:51:26,593 INFO L290 TraceCheckUtils]: 18: Hoare triple {2618#true} ~cond := #in~cond; {2618#true} is VALID [2022-04-27 12:51:26,593 INFO L290 TraceCheckUtils]: 19: Hoare triple {2618#true} assume !(0 == ~cond); {2618#true} is VALID [2022-04-27 12:51:26,593 INFO L290 TraceCheckUtils]: 20: Hoare triple {2618#true} assume true; {2618#true} is VALID [2022-04-27 12:51:26,594 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {2618#true} {2618#true} #70#return; {2618#true} is VALID [2022-04-27 12:51:26,594 INFO L272 TraceCheckUtils]: 22: Hoare triple {2618#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {2618#true} is VALID [2022-04-27 12:51:26,594 INFO L290 TraceCheckUtils]: 23: Hoare triple {2618#true} ~cond := #in~cond; {2618#true} is VALID [2022-04-27 12:51:26,594 INFO L290 TraceCheckUtils]: 24: Hoare triple {2618#true} assume !(0 == ~cond); {2618#true} is VALID [2022-04-27 12:51:26,594 INFO L290 TraceCheckUtils]: 25: Hoare triple {2618#true} assume true; {2618#true} is VALID [2022-04-27 12:51:26,594 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {2618#true} {2618#true} #72#return; {2618#true} is VALID [2022-04-27 12:51:26,594 INFO L290 TraceCheckUtils]: 27: Hoare triple {2618#true} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1; {2618#true} is VALID [2022-04-27 12:51:26,594 INFO L290 TraceCheckUtils]: 28: Hoare triple {2618#true} assume !false; {2618#true} is VALID [2022-04-27 12:51:26,594 INFO L272 TraceCheckUtils]: 29: Hoare triple {2618#true} call __VERIFIER_assert((if 1 == ~p~0 * ~s~0 - ~r~0 * ~q~0 then 1 else 0)); {2618#true} is VALID [2022-04-27 12:51:26,594 INFO L290 TraceCheckUtils]: 30: Hoare triple {2618#true} ~cond := #in~cond; {2618#true} is VALID [2022-04-27 12:51:26,594 INFO L290 TraceCheckUtils]: 31: Hoare triple {2618#true} assume !(0 == ~cond); {2618#true} is VALID [2022-04-27 12:51:26,594 INFO L290 TraceCheckUtils]: 32: Hoare triple {2618#true} assume true; {2618#true} is VALID [2022-04-27 12:51:26,594 INFO L284 TraceCheckUtils]: 33: Hoare quadruple {2618#true} {2618#true} #74#return; {2618#true} is VALID [2022-04-27 12:51:26,594 INFO L272 TraceCheckUtils]: 34: Hoare triple {2618#true} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {2618#true} is VALID [2022-04-27 12:51:26,595 INFO L290 TraceCheckUtils]: 35: Hoare triple {2618#true} ~cond := #in~cond; {2728#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-27 12:51:26,595 INFO L290 TraceCheckUtils]: 36: Hoare triple {2728#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {2732#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 12:51:26,595 INFO L290 TraceCheckUtils]: 37: Hoare triple {2732#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {2732#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 12:51:26,596 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {2732#(not (= |__VERIFIER_assert_#in~cond| 0))} {2618#true} #76#return; {2739#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} is VALID [2022-04-27 12:51:26,596 INFO L272 TraceCheckUtils]: 39: Hoare triple {2739#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {2618#true} is VALID [2022-04-27 12:51:26,596 INFO L290 TraceCheckUtils]: 40: Hoare triple {2618#true} ~cond := #in~cond; {2618#true} is VALID [2022-04-27 12:51:26,596 INFO L290 TraceCheckUtils]: 41: Hoare triple {2618#true} assume !(0 == ~cond); {2618#true} is VALID [2022-04-27 12:51:26,596 INFO L290 TraceCheckUtils]: 42: Hoare triple {2618#true} assume true; {2618#true} is VALID [2022-04-27 12:51:26,598 INFO L284 TraceCheckUtils]: 43: Hoare quadruple {2618#true} {2739#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} #78#return; {2739#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} is VALID [2022-04-27 12:51:26,598 INFO L290 TraceCheckUtils]: 44: Hoare triple {2739#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} assume !(~a~0 != ~b~0); {2758#(= main_~b~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} is VALID [2022-04-27 12:51:26,598 INFO L272 TraceCheckUtils]: 45: Hoare triple {2758#(= main_~b~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} call __VERIFIER_assert((if 0 == ~a~0 - ~b~0 then 1 else 0)); {2618#true} is VALID [2022-04-27 12:51:26,599 INFO L290 TraceCheckUtils]: 46: Hoare triple {2618#true} ~cond := #in~cond; {2618#true} is VALID [2022-04-27 12:51:26,599 INFO L290 TraceCheckUtils]: 47: Hoare triple {2618#true} assume !(0 == ~cond); {2618#true} is VALID [2022-04-27 12:51:26,599 INFO L290 TraceCheckUtils]: 48: Hoare triple {2618#true} assume true; {2618#true} is VALID [2022-04-27 12:51:26,599 INFO L284 TraceCheckUtils]: 49: Hoare quadruple {2618#true} {2758#(= main_~b~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} #80#return; {2758#(= main_~b~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} is VALID [2022-04-27 12:51:26,600 INFO L272 TraceCheckUtils]: 50: Hoare triple {2758#(= main_~b~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} call __VERIFIER_assert((if 0 == ~p~0 * ~x~0 + ~r~0 * ~y~0 - ~b~0 then 1 else 0)); {2777#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 12:51:26,600 INFO L290 TraceCheckUtils]: 51: Hoare triple {2777#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {2781#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 12:51:26,600 INFO L290 TraceCheckUtils]: 52: Hoare triple {2781#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {2619#false} is VALID [2022-04-27 12:51:26,600 INFO L290 TraceCheckUtils]: 53: Hoare triple {2619#false} assume !false; {2619#false} is VALID [2022-04-27 12:51:26,601 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 10 proven. 7 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2022-04-27 12:51:26,601 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 12:51:43,441 INFO L290 TraceCheckUtils]: 53: Hoare triple {2619#false} assume !false; {2619#false} is VALID [2022-04-27 12:51:43,442 INFO L290 TraceCheckUtils]: 52: Hoare triple {2781#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {2619#false} is VALID [2022-04-27 12:51:43,442 INFO L290 TraceCheckUtils]: 51: Hoare triple {2777#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {2781#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 12:51:43,443 INFO L272 TraceCheckUtils]: 50: Hoare triple {2758#(= main_~b~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} call __VERIFIER_assert((if 0 == ~p~0 * ~x~0 + ~r~0 * ~y~0 - ~b~0 then 1 else 0)); {2777#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 12:51:43,443 INFO L284 TraceCheckUtils]: 49: Hoare quadruple {2618#true} {2758#(= main_~b~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} #80#return; {2758#(= main_~b~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} is VALID [2022-04-27 12:51:43,443 INFO L290 TraceCheckUtils]: 48: Hoare triple {2618#true} assume true; {2618#true} is VALID [2022-04-27 12:51:43,444 INFO L290 TraceCheckUtils]: 47: Hoare triple {2618#true} assume !(0 == ~cond); {2618#true} is VALID [2022-04-27 12:51:43,444 INFO L290 TraceCheckUtils]: 46: Hoare triple {2618#true} ~cond := #in~cond; {2618#true} is VALID [2022-04-27 12:51:43,444 INFO L272 TraceCheckUtils]: 45: Hoare triple {2758#(= main_~b~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} call __VERIFIER_assert((if 0 == ~a~0 - ~b~0 then 1 else 0)); {2618#true} is VALID [2022-04-27 12:51:43,444 INFO L290 TraceCheckUtils]: 44: Hoare triple {2739#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} assume !(~a~0 != ~b~0); {2758#(= main_~b~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} is VALID [2022-04-27 12:51:43,447 INFO L284 TraceCheckUtils]: 43: Hoare quadruple {2618#true} {2739#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} #78#return; {2739#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} is VALID [2022-04-27 12:51:43,447 INFO L290 TraceCheckUtils]: 42: Hoare triple {2618#true} assume true; {2618#true} is VALID [2022-04-27 12:51:43,447 INFO L290 TraceCheckUtils]: 41: Hoare triple {2618#true} assume !(0 == ~cond); {2618#true} is VALID [2022-04-27 12:51:43,447 INFO L290 TraceCheckUtils]: 40: Hoare triple {2618#true} ~cond := #in~cond; {2618#true} is VALID [2022-04-27 12:51:43,448 INFO L272 TraceCheckUtils]: 39: Hoare triple {2739#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {2618#true} is VALID [2022-04-27 12:51:43,451 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {2732#(not (= |__VERIFIER_assert_#in~cond| 0))} {2618#true} #76#return; {2739#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} is VALID [2022-04-27 12:51:43,451 INFO L290 TraceCheckUtils]: 37: Hoare triple {2732#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {2732#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 12:51:43,451 INFO L290 TraceCheckUtils]: 36: Hoare triple {2842#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} assume !(0 == ~cond); {2732#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 12:51:43,452 INFO L290 TraceCheckUtils]: 35: Hoare triple {2618#true} ~cond := #in~cond; {2842#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-27 12:51:43,452 INFO L272 TraceCheckUtils]: 34: Hoare triple {2618#true} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {2618#true} is VALID [2022-04-27 12:51:43,452 INFO L284 TraceCheckUtils]: 33: Hoare quadruple {2618#true} {2618#true} #74#return; {2618#true} is VALID [2022-04-27 12:51:43,452 INFO L290 TraceCheckUtils]: 32: Hoare triple {2618#true} assume true; {2618#true} is VALID [2022-04-27 12:51:43,452 INFO L290 TraceCheckUtils]: 31: Hoare triple {2618#true} assume !(0 == ~cond); {2618#true} is VALID [2022-04-27 12:51:43,452 INFO L290 TraceCheckUtils]: 30: Hoare triple {2618#true} ~cond := #in~cond; {2618#true} is VALID [2022-04-27 12:51:43,452 INFO L272 TraceCheckUtils]: 29: Hoare triple {2618#true} call __VERIFIER_assert((if 1 == ~p~0 * ~s~0 - ~r~0 * ~q~0 then 1 else 0)); {2618#true} is VALID [2022-04-27 12:51:43,452 INFO L290 TraceCheckUtils]: 28: Hoare triple {2618#true} assume !false; {2618#true} is VALID [2022-04-27 12:51:43,452 INFO L290 TraceCheckUtils]: 27: Hoare triple {2618#true} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1; {2618#true} is VALID [2022-04-27 12:51:43,452 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {2618#true} {2618#true} #72#return; {2618#true} is VALID [2022-04-27 12:51:43,453 INFO L290 TraceCheckUtils]: 25: Hoare triple {2618#true} assume true; {2618#true} is VALID [2022-04-27 12:51:43,453 INFO L290 TraceCheckUtils]: 24: Hoare triple {2618#true} assume !(0 == ~cond); {2618#true} is VALID [2022-04-27 12:51:43,453 INFO L290 TraceCheckUtils]: 23: Hoare triple {2618#true} ~cond := #in~cond; {2618#true} is VALID [2022-04-27 12:51:43,453 INFO L272 TraceCheckUtils]: 22: Hoare triple {2618#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {2618#true} is VALID [2022-04-27 12:51:43,453 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {2618#true} {2618#true} #70#return; {2618#true} is VALID [2022-04-27 12:51:43,453 INFO L290 TraceCheckUtils]: 20: Hoare triple {2618#true} assume true; {2618#true} is VALID [2022-04-27 12:51:43,453 INFO L290 TraceCheckUtils]: 19: Hoare triple {2618#true} assume !(0 == ~cond); {2618#true} is VALID [2022-04-27 12:51:43,453 INFO L290 TraceCheckUtils]: 18: Hoare triple {2618#true} ~cond := #in~cond; {2618#true} is VALID [2022-04-27 12:51:43,453 INFO L272 TraceCheckUtils]: 17: Hoare triple {2618#true} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {2618#true} is VALID [2022-04-27 12:51:43,453 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {2618#true} {2618#true} #68#return; {2618#true} is VALID [2022-04-27 12:51:43,453 INFO L290 TraceCheckUtils]: 15: Hoare triple {2618#true} assume true; {2618#true} is VALID [2022-04-27 12:51:43,453 INFO L290 TraceCheckUtils]: 14: Hoare triple {2618#true} assume !(0 == ~cond); {2618#true} is VALID [2022-04-27 12:51:43,453 INFO L290 TraceCheckUtils]: 13: Hoare triple {2618#true} ~cond := #in~cond; {2618#true} is VALID [2022-04-27 12:51:43,453 INFO L272 TraceCheckUtils]: 12: Hoare triple {2618#true} call assume_abort_if_not((if ~y~0 >= 0 && ~y~0 <= 2 then 1 else 0)); {2618#true} is VALID [2022-04-27 12:51:43,454 INFO L290 TraceCheckUtils]: 11: Hoare triple {2618#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {2618#true} is VALID [2022-04-27 12:51:43,454 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {2618#true} {2618#true} #66#return; {2618#true} is VALID [2022-04-27 12:51:43,454 INFO L290 TraceCheckUtils]: 9: Hoare triple {2618#true} assume true; {2618#true} is VALID [2022-04-27 12:51:43,454 INFO L290 TraceCheckUtils]: 8: Hoare triple {2618#true} assume !(0 == ~cond); {2618#true} is VALID [2022-04-27 12:51:43,454 INFO L290 TraceCheckUtils]: 7: Hoare triple {2618#true} ~cond := #in~cond; {2618#true} is VALID [2022-04-27 12:51:43,454 INFO L272 TraceCheckUtils]: 6: Hoare triple {2618#true} call assume_abort_if_not((if ~x~0 >= 0 && ~x~0 <= 2 then 1 else 0)); {2618#true} is VALID [2022-04-27 12:51:43,454 INFO L290 TraceCheckUtils]: 5: Hoare triple {2618#true} havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~s~0;havoc ~x~0;havoc ~y~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4; {2618#true} is VALID [2022-04-27 12:51:43,454 INFO L272 TraceCheckUtils]: 4: Hoare triple {2618#true} call #t~ret6 := main(); {2618#true} is VALID [2022-04-27 12:51:43,454 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2618#true} {2618#true} #88#return; {2618#true} is VALID [2022-04-27 12:51:43,454 INFO L290 TraceCheckUtils]: 2: Hoare triple {2618#true} assume true; {2618#true} is VALID [2022-04-27 12:51:43,454 INFO L290 TraceCheckUtils]: 1: Hoare triple {2618#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(10, 2);call #Ultimate.allocInit(12, 3); {2618#true} is VALID [2022-04-27 12:51:43,454 INFO L272 TraceCheckUtils]: 0: Hoare triple {2618#true} call ULTIMATE.init(); {2618#true} is VALID [2022-04-27 12:51:43,455 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 10 proven. 7 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2022-04-27 12:51:43,455 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 12:51:43,455 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [289510763] [2022-04-27 12:51:43,455 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 12:51:43,455 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1887345324] [2022-04-27 12:51:43,455 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1887345324] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 12:51:43,455 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-27 12:51:43,455 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 9 [2022-04-27 12:51:43,455 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [974255942] [2022-04-27 12:51:43,455 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-27 12:51:43,456 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.625) internal successors, (21), 7 states have internal predecessors, (21), 3 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) Word has length 54 [2022-04-27 12:51:43,456 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 12:51:43,456 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), 7 states have internal predecessors, (21), 3 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2022-04-27 12:51:43,495 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 41 edges. 41 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 12:51:43,496 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-04-27 12:51:43,496 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 12:51:43,496 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-04-27 12:51:43,496 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2022-04-27 12:51:43,496 INFO L87 Difference]: Start difference. First operand 79 states and 102 transitions. Second operand has 9 states, 8 states have (on average 2.625) internal successors, (21), 7 states have internal predecessors, (21), 3 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2022-04-27 12:51:44,038 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:51:44,039 INFO L93 Difference]: Finished difference Result 88 states and 112 transitions. [2022-04-27 12:51:44,039 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-27 12:51:44,039 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.625) internal successors, (21), 7 states have internal predecessors, (21), 3 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) Word has length 54 [2022-04-27 12:51:44,039 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 12:51:44,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 8 states have (on average 2.625) internal successors, (21), 7 states have internal predecessors, (21), 3 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2022-04-27 12:51:44,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 52 transitions. [2022-04-27 12:51:44,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 8 states have (on average 2.625) internal successors, (21), 7 states have internal predecessors, (21), 3 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2022-04-27 12:51:44,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 52 transitions. [2022-04-27 12:51:44,041 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 52 transitions. [2022-04-27 12:51:44,082 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 52 edges. 52 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 12:51:44,085 INFO L225 Difference]: With dead ends: 88 [2022-04-27 12:51:44,085 INFO L226 Difference]: Without dead ends: 84 [2022-04-27 12:51:44,086 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 99 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2022-04-27 12:51:44,086 INFO L413 NwaCegarLoop]: 31 mSDtfsCounter, 13 mSDsluCounter, 99 mSDsCounter, 0 mSdLazyCounter, 124 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 130 SdHoareTripleChecker+Invalid, 136 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 124 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-27 12:51:44,088 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 130 Invalid, 136 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 124 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-27 12:51:44,089 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2022-04-27 12:51:44,150 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 84. [2022-04-27 12:51:44,150 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 12:51:44,150 INFO L82 GeneralOperation]: Start isEquivalent. First operand 84 states. Second operand has 84 states, 46 states have (on average 1.1521739130434783) internal successors, (53), 49 states have internal predecessors, (53), 27 states have call successors, (27), 11 states have call predecessors, (27), 10 states have return successors, (25), 23 states have call predecessors, (25), 25 states have call successors, (25) [2022-04-27 12:51:44,151 INFO L74 IsIncluded]: Start isIncluded. First operand 84 states. Second operand has 84 states, 46 states have (on average 1.1521739130434783) internal successors, (53), 49 states have internal predecessors, (53), 27 states have call successors, (27), 11 states have call predecessors, (27), 10 states have return successors, (25), 23 states have call predecessors, (25), 25 states have call successors, (25) [2022-04-27 12:51:44,151 INFO L87 Difference]: Start difference. First operand 84 states. Second operand has 84 states, 46 states have (on average 1.1521739130434783) internal successors, (53), 49 states have internal predecessors, (53), 27 states have call successors, (27), 11 states have call predecessors, (27), 10 states have return successors, (25), 23 states have call predecessors, (25), 25 states have call successors, (25) [2022-04-27 12:51:44,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:51:44,153 INFO L93 Difference]: Finished difference Result 84 states and 105 transitions. [2022-04-27 12:51:44,153 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 105 transitions. [2022-04-27 12:51:44,154 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 12:51:44,154 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 12:51:44,156 INFO L74 IsIncluded]: Start isIncluded. First operand has 84 states, 46 states have (on average 1.1521739130434783) internal successors, (53), 49 states have internal predecessors, (53), 27 states have call successors, (27), 11 states have call predecessors, (27), 10 states have return successors, (25), 23 states have call predecessors, (25), 25 states have call successors, (25) Second operand 84 states. [2022-04-27 12:51:44,156 INFO L87 Difference]: Start difference. First operand has 84 states, 46 states have (on average 1.1521739130434783) internal successors, (53), 49 states have internal predecessors, (53), 27 states have call successors, (27), 11 states have call predecessors, (27), 10 states have return successors, (25), 23 states have call predecessors, (25), 25 states have call successors, (25) Second operand 84 states. [2022-04-27 12:51:44,159 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:51:44,159 INFO L93 Difference]: Finished difference Result 84 states and 105 transitions. [2022-04-27 12:51:44,159 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 105 transitions. [2022-04-27 12:51:44,160 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 12:51:44,160 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 12:51:44,160 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 12:51:44,160 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 12:51:44,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 46 states have (on average 1.1521739130434783) internal successors, (53), 49 states have internal predecessors, (53), 27 states have call successors, (27), 11 states have call predecessors, (27), 10 states have return successors, (25), 23 states have call predecessors, (25), 25 states have call successors, (25) [2022-04-27 12:51:44,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 105 transitions. [2022-04-27 12:51:44,163 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 105 transitions. Word has length 54 [2022-04-27 12:51:44,163 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 12:51:44,163 INFO L495 AbstractCegarLoop]: Abstraction has 84 states and 105 transitions. [2022-04-27 12:51:44,163 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.625) internal successors, (21), 7 states have internal predecessors, (21), 3 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2022-04-27 12:51:44,163 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 105 transitions. [2022-04-27 12:51:44,164 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2022-04-27 12:51:44,164 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 12:51:44,164 INFO L195 NwaCegarLoop]: trace histogram [5, 4, 4, 4, 4, 4, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 12:51:44,184 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-04-27 12:51:44,379 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 12:51:44,379 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 12:51:44,380 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 12:51:44,380 INFO L85 PathProgramCache]: Analyzing trace with hash 1698149216, now seen corresponding path program 2 times [2022-04-27 12:51:44,380 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 12:51:44,380 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [206668539] [2022-04-27 12:51:44,380 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 12:51:44,380 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 12:51:44,401 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 12:51:44,401 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [789967833] [2022-04-27 12:51:44,401 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-27 12:51:44,401 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 12:51:44,401 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 12:51:44,416 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-27 12:51:44,432 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-04-27 12:51:44,470 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-27 12:51:44,470 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-27 12:51:44,471 INFO L263 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 41 conjunts are in the unsatisfiable core [2022-04-27 12:51:44,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 12:51:44,482 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 12:51:45,079 INFO L272 TraceCheckUtils]: 0: Hoare triple {3384#true} call ULTIMATE.init(); {3384#true} is VALID [2022-04-27 12:51:45,079 INFO L290 TraceCheckUtils]: 1: Hoare triple {3384#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(10, 2);call #Ultimate.allocInit(12, 3); {3384#true} is VALID [2022-04-27 12:51:45,079 INFO L290 TraceCheckUtils]: 2: Hoare triple {3384#true} assume true; {3384#true} is VALID [2022-04-27 12:51:45,079 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3384#true} {3384#true} #88#return; {3384#true} is VALID [2022-04-27 12:51:45,079 INFO L272 TraceCheckUtils]: 4: Hoare triple {3384#true} call #t~ret6 := main(); {3384#true} is VALID [2022-04-27 12:51:45,079 INFO L290 TraceCheckUtils]: 5: Hoare triple {3384#true} havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~s~0;havoc ~x~0;havoc ~y~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4; {3384#true} is VALID [2022-04-27 12:51:45,079 INFO L272 TraceCheckUtils]: 6: Hoare triple {3384#true} call assume_abort_if_not((if ~x~0 >= 0 && ~x~0 <= 2 then 1 else 0)); {3384#true} is VALID [2022-04-27 12:51:45,089 INFO L290 TraceCheckUtils]: 7: Hoare triple {3384#true} ~cond := #in~cond; {3410#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-04-27 12:51:45,089 INFO L290 TraceCheckUtils]: 8: Hoare triple {3410#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} assume !(0 == ~cond); {3414#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-27 12:51:45,090 INFO L290 TraceCheckUtils]: 9: Hoare triple {3414#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {3414#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-27 12:51:45,090 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {3414#(not (= |assume_abort_if_not_#in~cond| 0))} {3384#true} #66#return; {3421#(and (<= 0 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-27 12:51:45,091 INFO L290 TraceCheckUtils]: 11: Hoare triple {3421#(and (<= 0 main_~x~0) (<= main_~x~0 2))} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {3421#(and (<= 0 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-27 12:51:45,091 INFO L272 TraceCheckUtils]: 12: Hoare triple {3421#(and (<= 0 main_~x~0) (<= main_~x~0 2))} call assume_abort_if_not((if ~y~0 >= 0 && ~y~0 <= 2 then 1 else 0)); {3384#true} is VALID [2022-04-27 12:51:45,091 INFO L290 TraceCheckUtils]: 13: Hoare triple {3384#true} ~cond := #in~cond; {3384#true} is VALID [2022-04-27 12:51:45,091 INFO L290 TraceCheckUtils]: 14: Hoare triple {3384#true} assume !(0 == ~cond); {3384#true} is VALID [2022-04-27 12:51:45,091 INFO L290 TraceCheckUtils]: 15: Hoare triple {3384#true} assume true; {3384#true} is VALID [2022-04-27 12:51:45,091 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {3384#true} {3421#(and (<= 0 main_~x~0) (<= main_~x~0 2))} #68#return; {3421#(and (<= 0 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-27 12:51:45,091 INFO L272 TraceCheckUtils]: 17: Hoare triple {3421#(and (<= 0 main_~x~0) (<= main_~x~0 2))} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {3384#true} is VALID [2022-04-27 12:51:45,092 INFO L290 TraceCheckUtils]: 18: Hoare triple {3384#true} ~cond := #in~cond; {3384#true} is VALID [2022-04-27 12:51:45,092 INFO L290 TraceCheckUtils]: 19: Hoare triple {3384#true} assume !(0 == ~cond); {3384#true} is VALID [2022-04-27 12:51:45,092 INFO L290 TraceCheckUtils]: 20: Hoare triple {3384#true} assume true; {3384#true} is VALID [2022-04-27 12:51:45,092 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {3384#true} {3421#(and (<= 0 main_~x~0) (<= main_~x~0 2))} #70#return; {3421#(and (<= 0 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-27 12:51:45,092 INFO L272 TraceCheckUtils]: 22: Hoare triple {3421#(and (<= 0 main_~x~0) (<= main_~x~0 2))} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {3384#true} is VALID [2022-04-27 12:51:45,092 INFO L290 TraceCheckUtils]: 23: Hoare triple {3384#true} ~cond := #in~cond; {3410#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-04-27 12:51:45,093 INFO L290 TraceCheckUtils]: 24: Hoare triple {3410#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} assume !(0 == ~cond); {3414#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-27 12:51:45,093 INFO L290 TraceCheckUtils]: 25: Hoare triple {3414#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {3414#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-27 12:51:45,094 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {3414#(not (= |assume_abort_if_not_#in~cond| 0))} {3421#(and (<= 0 main_~x~0) (<= main_~x~0 2))} #72#return; {3470#(and (<= 0 main_~x~0) (<= 1 main_~y~0) (<= main_~x~0 2))} is VALID [2022-04-27 12:51:45,094 INFO L290 TraceCheckUtils]: 27: Hoare triple {3470#(and (<= 0 main_~x~0) (<= 1 main_~y~0) (<= main_~x~0 2))} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1; {3474#(and (= main_~r~0 0) (= main_~s~0 1) (<= 0 main_~x~0) (= main_~b~0 main_~y~0) (= main_~q~0 0) (<= 1 main_~y~0) (= main_~a~0 main_~x~0) (<= main_~x~0 2) (= main_~p~0 1))} is VALID [2022-04-27 12:51:45,094 INFO L290 TraceCheckUtils]: 28: Hoare triple {3474#(and (= main_~r~0 0) (= main_~s~0 1) (<= 0 main_~x~0) (= main_~b~0 main_~y~0) (= main_~q~0 0) (<= 1 main_~y~0) (= main_~a~0 main_~x~0) (<= main_~x~0 2) (= main_~p~0 1))} assume !false; {3474#(and (= main_~r~0 0) (= main_~s~0 1) (<= 0 main_~x~0) (= main_~b~0 main_~y~0) (= main_~q~0 0) (<= 1 main_~y~0) (= main_~a~0 main_~x~0) (<= main_~x~0 2) (= main_~p~0 1))} is VALID [2022-04-27 12:51:45,095 INFO L272 TraceCheckUtils]: 29: Hoare triple {3474#(and (= main_~r~0 0) (= main_~s~0 1) (<= 0 main_~x~0) (= main_~b~0 main_~y~0) (= main_~q~0 0) (<= 1 main_~y~0) (= main_~a~0 main_~x~0) (<= main_~x~0 2) (= main_~p~0 1))} call __VERIFIER_assert((if 1 == ~p~0 * ~s~0 - ~r~0 * ~q~0 then 1 else 0)); {3384#true} is VALID [2022-04-27 12:51:45,095 INFO L290 TraceCheckUtils]: 30: Hoare triple {3384#true} ~cond := #in~cond; {3384#true} is VALID [2022-04-27 12:51:45,095 INFO L290 TraceCheckUtils]: 31: Hoare triple {3384#true} assume !(0 == ~cond); {3384#true} is VALID [2022-04-27 12:51:45,095 INFO L290 TraceCheckUtils]: 32: Hoare triple {3384#true} assume true; {3384#true} is VALID [2022-04-27 12:51:45,095 INFO L284 TraceCheckUtils]: 33: Hoare quadruple {3384#true} {3474#(and (= main_~r~0 0) (= main_~s~0 1) (<= 0 main_~x~0) (= main_~b~0 main_~y~0) (= main_~q~0 0) (<= 1 main_~y~0) (= main_~a~0 main_~x~0) (<= main_~x~0 2) (= main_~p~0 1))} #74#return; {3474#(and (= main_~r~0 0) (= main_~s~0 1) (<= 0 main_~x~0) (= main_~b~0 main_~y~0) (= main_~q~0 0) (<= 1 main_~y~0) (= main_~a~0 main_~x~0) (<= main_~x~0 2) (= main_~p~0 1))} is VALID [2022-04-27 12:51:45,095 INFO L272 TraceCheckUtils]: 34: Hoare triple {3474#(and (= main_~r~0 0) (= main_~s~0 1) (<= 0 main_~x~0) (= main_~b~0 main_~y~0) (= main_~q~0 0) (<= 1 main_~y~0) (= main_~a~0 main_~x~0) (<= main_~x~0 2) (= main_~p~0 1))} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {3384#true} is VALID [2022-04-27 12:51:45,095 INFO L290 TraceCheckUtils]: 35: Hoare triple {3384#true} ~cond := #in~cond; {3384#true} is VALID [2022-04-27 12:51:45,096 INFO L290 TraceCheckUtils]: 36: Hoare triple {3384#true} assume !(0 == ~cond); {3384#true} is VALID [2022-04-27 12:51:45,096 INFO L290 TraceCheckUtils]: 37: Hoare triple {3384#true} assume true; {3384#true} is VALID [2022-04-27 12:51:45,096 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {3384#true} {3474#(and (= main_~r~0 0) (= main_~s~0 1) (<= 0 main_~x~0) (= main_~b~0 main_~y~0) (= main_~q~0 0) (<= 1 main_~y~0) (= main_~a~0 main_~x~0) (<= main_~x~0 2) (= main_~p~0 1))} #76#return; {3474#(and (= main_~r~0 0) (= main_~s~0 1) (<= 0 main_~x~0) (= main_~b~0 main_~y~0) (= main_~q~0 0) (<= 1 main_~y~0) (= main_~a~0 main_~x~0) (<= main_~x~0 2) (= main_~p~0 1))} is VALID [2022-04-27 12:51:45,096 INFO L272 TraceCheckUtils]: 39: Hoare triple {3474#(and (= main_~r~0 0) (= main_~s~0 1) (<= 0 main_~x~0) (= main_~b~0 main_~y~0) (= main_~q~0 0) (<= 1 main_~y~0) (= main_~a~0 main_~x~0) (<= main_~x~0 2) (= main_~p~0 1))} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {3384#true} is VALID [2022-04-27 12:51:45,097 INFO L290 TraceCheckUtils]: 40: Hoare triple {3384#true} ~cond := #in~cond; {3514#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-27 12:51:45,097 INFO L290 TraceCheckUtils]: 41: Hoare triple {3514#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {3518#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 12:51:45,097 INFO L290 TraceCheckUtils]: 42: Hoare triple {3518#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {3518#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 12:51:45,098 INFO L284 TraceCheckUtils]: 43: Hoare quadruple {3518#(not (= |__VERIFIER_assert_#in~cond| 0))} {3474#(and (= main_~r~0 0) (= main_~s~0 1) (<= 0 main_~x~0) (= main_~b~0 main_~y~0) (= main_~q~0 0) (<= 1 main_~y~0) (= main_~a~0 main_~x~0) (<= main_~x~0 2) (= main_~p~0 1))} #78#return; {3474#(and (= main_~r~0 0) (= main_~s~0 1) (<= 0 main_~x~0) (= main_~b~0 main_~y~0) (= main_~q~0 0) (<= 1 main_~y~0) (= main_~a~0 main_~x~0) (<= main_~x~0 2) (= main_~p~0 1))} is VALID [2022-04-27 12:51:45,098 INFO L290 TraceCheckUtils]: 44: Hoare triple {3474#(and (= main_~r~0 0) (= main_~s~0 1) (<= 0 main_~x~0) (= main_~b~0 main_~y~0) (= main_~q~0 0) (<= 1 main_~y~0) (= main_~a~0 main_~x~0) (<= main_~x~0 2) (= main_~p~0 1))} assume !!(~a~0 != ~b~0); {3474#(and (= main_~r~0 0) (= main_~s~0 1) (<= 0 main_~x~0) (= main_~b~0 main_~y~0) (= main_~q~0 0) (<= 1 main_~y~0) (= main_~a~0 main_~x~0) (<= main_~x~0 2) (= main_~p~0 1))} is VALID [2022-04-27 12:51:45,099 INFO L290 TraceCheckUtils]: 45: Hoare triple {3474#(and (= main_~r~0 0) (= main_~s~0 1) (<= 0 main_~x~0) (= main_~b~0 main_~y~0) (= main_~q~0 0) (<= 1 main_~y~0) (= main_~a~0 main_~x~0) (<= main_~x~0 2) (= main_~p~0 1))} assume ~a~0 > ~b~0;~a~0 := ~a~0 - ~b~0;~p~0 := ~p~0 - ~q~0;~r~0 := ~r~0 - ~s~0; {3531#(and (= (+ main_~a~0 main_~y~0) main_~x~0) (= (+ main_~r~0 1) 0) (< 0 main_~a~0) (<= 1 main_~y~0) (<= main_~x~0 2) (= main_~p~0 1))} is VALID [2022-04-27 12:51:45,099 INFO L290 TraceCheckUtils]: 46: Hoare triple {3531#(and (= (+ main_~a~0 main_~y~0) main_~x~0) (= (+ main_~r~0 1) 0) (< 0 main_~a~0) (<= 1 main_~y~0) (<= main_~x~0 2) (= main_~p~0 1))} assume !false; {3531#(and (= (+ main_~a~0 main_~y~0) main_~x~0) (= (+ main_~r~0 1) 0) (< 0 main_~a~0) (<= 1 main_~y~0) (<= main_~x~0 2) (= main_~p~0 1))} is VALID [2022-04-27 12:51:45,099 INFO L272 TraceCheckUtils]: 47: Hoare triple {3531#(and (= (+ main_~a~0 main_~y~0) main_~x~0) (= (+ main_~r~0 1) 0) (< 0 main_~a~0) (<= 1 main_~y~0) (<= main_~x~0 2) (= main_~p~0 1))} call __VERIFIER_assert((if 1 == ~p~0 * ~s~0 - ~r~0 * ~q~0 then 1 else 0)); {3384#true} is VALID [2022-04-27 12:51:45,099 INFO L290 TraceCheckUtils]: 48: Hoare triple {3384#true} ~cond := #in~cond; {3384#true} is VALID [2022-04-27 12:51:45,100 INFO L290 TraceCheckUtils]: 49: Hoare triple {3384#true} assume !(0 == ~cond); {3384#true} is VALID [2022-04-27 12:51:45,100 INFO L290 TraceCheckUtils]: 50: Hoare triple {3384#true} assume true; {3384#true} is VALID [2022-04-27 12:51:45,100 INFO L284 TraceCheckUtils]: 51: Hoare quadruple {3384#true} {3531#(and (= (+ main_~a~0 main_~y~0) main_~x~0) (= (+ main_~r~0 1) 0) (< 0 main_~a~0) (<= 1 main_~y~0) (<= main_~x~0 2) (= main_~p~0 1))} #74#return; {3531#(and (= (+ main_~a~0 main_~y~0) main_~x~0) (= (+ main_~r~0 1) 0) (< 0 main_~a~0) (<= 1 main_~y~0) (<= main_~x~0 2) (= main_~p~0 1))} is VALID [2022-04-27 12:51:45,101 INFO L272 TraceCheckUtils]: 52: Hoare triple {3531#(and (= (+ main_~a~0 main_~y~0) main_~x~0) (= (+ main_~r~0 1) 0) (< 0 main_~a~0) (<= 1 main_~y~0) (<= main_~x~0 2) (= main_~p~0 1))} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {3553#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 12:51:45,101 INFO L290 TraceCheckUtils]: 53: Hoare triple {3553#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {3557#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 12:51:45,101 INFO L290 TraceCheckUtils]: 54: Hoare triple {3557#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {3385#false} is VALID [2022-04-27 12:51:45,102 INFO L290 TraceCheckUtils]: 55: Hoare triple {3385#false} assume !false; {3385#false} is VALID [2022-04-27 12:51:45,102 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 19 proven. 13 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2022-04-27 12:51:45,102 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 12:52:01,008 INFO L290 TraceCheckUtils]: 55: Hoare triple {3385#false} assume !false; {3385#false} is VALID [2022-04-27 12:52:01,009 INFO L290 TraceCheckUtils]: 54: Hoare triple {3557#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {3385#false} is VALID [2022-04-27 12:52:01,009 INFO L290 TraceCheckUtils]: 53: Hoare triple {3553#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {3557#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 12:52:01,010 INFO L272 TraceCheckUtils]: 52: Hoare triple {3573#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {3553#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 12:52:01,010 INFO L284 TraceCheckUtils]: 51: Hoare quadruple {3384#true} {3573#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} #74#return; {3573#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} is VALID [2022-04-27 12:52:01,010 INFO L290 TraceCheckUtils]: 50: Hoare triple {3384#true} assume true; {3384#true} is VALID [2022-04-27 12:52:01,010 INFO L290 TraceCheckUtils]: 49: Hoare triple {3384#true} assume !(0 == ~cond); {3384#true} is VALID [2022-04-27 12:52:01,011 INFO L290 TraceCheckUtils]: 48: Hoare triple {3384#true} ~cond := #in~cond; {3384#true} is VALID [2022-04-27 12:52:01,011 INFO L272 TraceCheckUtils]: 47: Hoare triple {3573#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} call __VERIFIER_assert((if 1 == ~p~0 * ~s~0 - ~r~0 * ~q~0 then 1 else 0)); {3384#true} is VALID [2022-04-27 12:52:01,011 INFO L290 TraceCheckUtils]: 46: Hoare triple {3573#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} assume !false; {3573#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} is VALID [2022-04-27 12:52:01,181 INFO L290 TraceCheckUtils]: 45: Hoare triple {3595#(or (= (+ main_~a~0 (* (- 1) main_~b~0)) (+ (* (+ main_~r~0 (* (- 1) main_~s~0)) main_~y~0) (* main_~x~0 (+ main_~p~0 (* (- 1) main_~q~0))))) (not (< main_~b~0 main_~a~0)))} assume ~a~0 > ~b~0;~a~0 := ~a~0 - ~b~0;~p~0 := ~p~0 - ~q~0;~r~0 := ~r~0 - ~s~0; {3573#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} is VALID [2022-04-27 12:52:01,182 INFO L290 TraceCheckUtils]: 44: Hoare triple {3595#(or (= (+ main_~a~0 (* (- 1) main_~b~0)) (+ (* (+ main_~r~0 (* (- 1) main_~s~0)) main_~y~0) (* main_~x~0 (+ main_~p~0 (* (- 1) main_~q~0))))) (not (< main_~b~0 main_~a~0)))} assume !!(~a~0 != ~b~0); {3595#(or (= (+ main_~a~0 (* (- 1) main_~b~0)) (+ (* (+ main_~r~0 (* (- 1) main_~s~0)) main_~y~0) (* main_~x~0 (+ main_~p~0 (* (- 1) main_~q~0))))) (not (< main_~b~0 main_~a~0)))} is VALID [2022-04-27 12:52:01,183 INFO L284 TraceCheckUtils]: 43: Hoare quadruple {3518#(not (= |__VERIFIER_assert_#in~cond| 0))} {3602#(or (= (+ main_~a~0 (* (- 1) main_~b~0)) (+ (* (+ main_~r~0 (* (- 1) main_~s~0)) main_~y~0) (* main_~x~0 (+ main_~p~0 (* (- 1) main_~q~0))))) (not (< main_~b~0 main_~a~0)) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))))} #78#return; {3595#(or (= (+ main_~a~0 (* (- 1) main_~b~0)) (+ (* (+ main_~r~0 (* (- 1) main_~s~0)) main_~y~0) (* main_~x~0 (+ main_~p~0 (* (- 1) main_~q~0))))) (not (< main_~b~0 main_~a~0)))} is VALID [2022-04-27 12:52:01,183 INFO L290 TraceCheckUtils]: 42: Hoare triple {3518#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {3518#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 12:52:01,183 INFO L290 TraceCheckUtils]: 41: Hoare triple {3612#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} assume !(0 == ~cond); {3518#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 12:52:01,184 INFO L290 TraceCheckUtils]: 40: Hoare triple {3384#true} ~cond := #in~cond; {3612#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-27 12:52:01,184 INFO L272 TraceCheckUtils]: 39: Hoare triple {3602#(or (= (+ main_~a~0 (* (- 1) main_~b~0)) (+ (* (+ main_~r~0 (* (- 1) main_~s~0)) main_~y~0) (* main_~x~0 (+ main_~p~0 (* (- 1) main_~q~0))))) (not (< main_~b~0 main_~a~0)) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))))} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {3384#true} is VALID [2022-04-27 12:52:01,184 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {3384#true} {3602#(or (= (+ main_~a~0 (* (- 1) main_~b~0)) (+ (* (+ main_~r~0 (* (- 1) main_~s~0)) main_~y~0) (* main_~x~0 (+ main_~p~0 (* (- 1) main_~q~0))))) (not (< main_~b~0 main_~a~0)) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))))} #76#return; {3602#(or (= (+ main_~a~0 (* (- 1) main_~b~0)) (+ (* (+ main_~r~0 (* (- 1) main_~s~0)) main_~y~0) (* main_~x~0 (+ main_~p~0 (* (- 1) main_~q~0))))) (not (< main_~b~0 main_~a~0)) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))))} is VALID [2022-04-27 12:52:01,184 INFO L290 TraceCheckUtils]: 37: Hoare triple {3384#true} assume true; {3384#true} is VALID [2022-04-27 12:52:01,184 INFO L290 TraceCheckUtils]: 36: Hoare triple {3384#true} assume !(0 == ~cond); {3384#true} is VALID [2022-04-27 12:52:01,185 INFO L290 TraceCheckUtils]: 35: Hoare triple {3384#true} ~cond := #in~cond; {3384#true} is VALID [2022-04-27 12:52:01,185 INFO L272 TraceCheckUtils]: 34: Hoare triple {3602#(or (= (+ main_~a~0 (* (- 1) main_~b~0)) (+ (* (+ main_~r~0 (* (- 1) main_~s~0)) main_~y~0) (* main_~x~0 (+ main_~p~0 (* (- 1) main_~q~0))))) (not (< main_~b~0 main_~a~0)) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))))} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {3384#true} is VALID [2022-04-27 12:52:01,185 INFO L284 TraceCheckUtils]: 33: Hoare quadruple {3384#true} {3602#(or (= (+ main_~a~0 (* (- 1) main_~b~0)) (+ (* (+ main_~r~0 (* (- 1) main_~s~0)) main_~y~0) (* main_~x~0 (+ main_~p~0 (* (- 1) main_~q~0))))) (not (< main_~b~0 main_~a~0)) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))))} #74#return; {3602#(or (= (+ main_~a~0 (* (- 1) main_~b~0)) (+ (* (+ main_~r~0 (* (- 1) main_~s~0)) main_~y~0) (* main_~x~0 (+ main_~p~0 (* (- 1) main_~q~0))))) (not (< main_~b~0 main_~a~0)) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))))} is VALID [2022-04-27 12:52:01,185 INFO L290 TraceCheckUtils]: 32: Hoare triple {3384#true} assume true; {3384#true} is VALID [2022-04-27 12:52:01,185 INFO L290 TraceCheckUtils]: 31: Hoare triple {3384#true} assume !(0 == ~cond); {3384#true} is VALID [2022-04-27 12:52:01,185 INFO L290 TraceCheckUtils]: 30: Hoare triple {3384#true} ~cond := #in~cond; {3384#true} is VALID [2022-04-27 12:52:01,186 INFO L272 TraceCheckUtils]: 29: Hoare triple {3602#(or (= (+ main_~a~0 (* (- 1) main_~b~0)) (+ (* (+ main_~r~0 (* (- 1) main_~s~0)) main_~y~0) (* main_~x~0 (+ main_~p~0 (* (- 1) main_~q~0))))) (not (< main_~b~0 main_~a~0)) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))))} call __VERIFIER_assert((if 1 == ~p~0 * ~s~0 - ~r~0 * ~q~0 then 1 else 0)); {3384#true} is VALID [2022-04-27 12:52:01,186 INFO L290 TraceCheckUtils]: 28: Hoare triple {3602#(or (= (+ main_~a~0 (* (- 1) main_~b~0)) (+ (* (+ main_~r~0 (* (- 1) main_~s~0)) main_~y~0) (* main_~x~0 (+ main_~p~0 (* (- 1) main_~q~0))))) (not (< main_~b~0 main_~a~0)) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))))} assume !false; {3602#(or (= (+ main_~a~0 (* (- 1) main_~b~0)) (+ (* (+ main_~r~0 (* (- 1) main_~s~0)) main_~y~0) (* main_~x~0 (+ main_~p~0 (* (- 1) main_~q~0))))) (not (< main_~b~0 main_~a~0)) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))))} is VALID [2022-04-27 12:52:01,186 INFO L290 TraceCheckUtils]: 27: Hoare triple {3384#true} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1; {3602#(or (= (+ main_~a~0 (* (- 1) main_~b~0)) (+ (* (+ main_~r~0 (* (- 1) main_~s~0)) main_~y~0) (* main_~x~0 (+ main_~p~0 (* (- 1) main_~q~0))))) (not (< main_~b~0 main_~a~0)) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))))} is VALID [2022-04-27 12:52:01,187 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {3384#true} {3384#true} #72#return; {3384#true} is VALID [2022-04-27 12:52:01,187 INFO L290 TraceCheckUtils]: 25: Hoare triple {3384#true} assume true; {3384#true} is VALID [2022-04-27 12:52:01,187 INFO L290 TraceCheckUtils]: 24: Hoare triple {3384#true} assume !(0 == ~cond); {3384#true} is VALID [2022-04-27 12:52:01,187 INFO L290 TraceCheckUtils]: 23: Hoare triple {3384#true} ~cond := #in~cond; {3384#true} is VALID [2022-04-27 12:52:01,187 INFO L272 TraceCheckUtils]: 22: Hoare triple {3384#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {3384#true} is VALID [2022-04-27 12:52:01,187 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {3384#true} {3384#true} #70#return; {3384#true} is VALID [2022-04-27 12:52:01,187 INFO L290 TraceCheckUtils]: 20: Hoare triple {3384#true} assume true; {3384#true} is VALID [2022-04-27 12:52:01,187 INFO L290 TraceCheckUtils]: 19: Hoare triple {3384#true} assume !(0 == ~cond); {3384#true} is VALID [2022-04-27 12:52:01,187 INFO L290 TraceCheckUtils]: 18: Hoare triple {3384#true} ~cond := #in~cond; {3384#true} is VALID [2022-04-27 12:52:01,187 INFO L272 TraceCheckUtils]: 17: Hoare triple {3384#true} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {3384#true} is VALID [2022-04-27 12:52:01,187 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {3384#true} {3384#true} #68#return; {3384#true} is VALID [2022-04-27 12:52:01,187 INFO L290 TraceCheckUtils]: 15: Hoare triple {3384#true} assume true; {3384#true} is VALID [2022-04-27 12:52:01,187 INFO L290 TraceCheckUtils]: 14: Hoare triple {3384#true} assume !(0 == ~cond); {3384#true} is VALID [2022-04-27 12:52:01,187 INFO L290 TraceCheckUtils]: 13: Hoare triple {3384#true} ~cond := #in~cond; {3384#true} is VALID [2022-04-27 12:52:01,187 INFO L272 TraceCheckUtils]: 12: Hoare triple {3384#true} call assume_abort_if_not((if ~y~0 >= 0 && ~y~0 <= 2 then 1 else 0)); {3384#true} is VALID [2022-04-27 12:52:01,188 INFO L290 TraceCheckUtils]: 11: Hoare triple {3384#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {3384#true} is VALID [2022-04-27 12:52:01,188 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {3384#true} {3384#true} #66#return; {3384#true} is VALID [2022-04-27 12:52:01,188 INFO L290 TraceCheckUtils]: 9: Hoare triple {3384#true} assume true; {3384#true} is VALID [2022-04-27 12:52:01,188 INFO L290 TraceCheckUtils]: 8: Hoare triple {3384#true} assume !(0 == ~cond); {3384#true} is VALID [2022-04-27 12:52:01,188 INFO L290 TraceCheckUtils]: 7: Hoare triple {3384#true} ~cond := #in~cond; {3384#true} is VALID [2022-04-27 12:52:01,188 INFO L272 TraceCheckUtils]: 6: Hoare triple {3384#true} call assume_abort_if_not((if ~x~0 >= 0 && ~x~0 <= 2 then 1 else 0)); {3384#true} is VALID [2022-04-27 12:52:01,188 INFO L290 TraceCheckUtils]: 5: Hoare triple {3384#true} havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~s~0;havoc ~x~0;havoc ~y~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4; {3384#true} is VALID [2022-04-27 12:52:01,188 INFO L272 TraceCheckUtils]: 4: Hoare triple {3384#true} call #t~ret6 := main(); {3384#true} is VALID [2022-04-27 12:52:01,188 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3384#true} {3384#true} #88#return; {3384#true} is VALID [2022-04-27 12:52:01,188 INFO L290 TraceCheckUtils]: 2: Hoare triple {3384#true} assume true; {3384#true} is VALID [2022-04-27 12:52:01,188 INFO L290 TraceCheckUtils]: 1: Hoare triple {3384#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(10, 2);call #Ultimate.allocInit(12, 3); {3384#true} is VALID [2022-04-27 12:52:01,188 INFO L272 TraceCheckUtils]: 0: Hoare triple {3384#true} call ULTIMATE.init(); {3384#true} is VALID [2022-04-27 12:52:01,188 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 16 proven. 4 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2022-04-27 12:52:01,189 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 12:52:01,189 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [206668539] [2022-04-27 12:52:01,189 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 12:52:01,189 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [789967833] [2022-04-27 12:52:01,189 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [789967833] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 12:52:01,189 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-27 12:52:01,189 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 9] total 16 [2022-04-27 12:52:01,189 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [995722864] [2022-04-27 12:52:01,189 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-27 12:52:01,190 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 2.0) internal successors, (32), 14 states have internal predecessors, (32), 6 states have call successors, (19), 2 states have call predecessors, (19), 3 states have return successors, (17), 8 states have call predecessors, (17), 6 states have call successors, (17) Word has length 56 [2022-04-27 12:52:01,190 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 12:52:01,190 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 16 states, 16 states have (on average 2.0) internal successors, (32), 14 states have internal predecessors, (32), 6 states have call successors, (19), 2 states have call predecessors, (19), 3 states have return successors, (17), 8 states have call predecessors, (17), 6 states have call successors, (17) [2022-04-27 12:52:01,284 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 68 edges. 68 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 12:52:01,284 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-04-27 12:52:01,285 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 12:52:01,285 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-04-27 12:52:01,285 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=195, Unknown=0, NotChecked=0, Total=240 [2022-04-27 12:52:01,285 INFO L87 Difference]: Start difference. First operand 84 states and 105 transitions. Second operand has 16 states, 16 states have (on average 2.0) internal successors, (32), 14 states have internal predecessors, (32), 6 states have call successors, (19), 2 states have call predecessors, (19), 3 states have return successors, (17), 8 states have call predecessors, (17), 6 states have call successors, (17) [2022-04-27 12:52:04,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:52:04,025 INFO L93 Difference]: Finished difference Result 119 states and 153 transitions. [2022-04-27 12:52:04,025 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-04-27 12:52:04,026 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 2.0) internal successors, (32), 14 states have internal predecessors, (32), 6 states have call successors, (19), 2 states have call predecessors, (19), 3 states have return successors, (17), 8 states have call predecessors, (17), 6 states have call successors, (17) Word has length 56 [2022-04-27 12:52:04,026 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 12:52:04,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 16 states have (on average 2.0) internal successors, (32), 14 states have internal predecessors, (32), 6 states have call successors, (19), 2 states have call predecessors, (19), 3 states have return successors, (17), 8 states have call predecessors, (17), 6 states have call successors, (17) [2022-04-27 12:52:04,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 89 transitions. [2022-04-27 12:52:04,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 16 states have (on average 2.0) internal successors, (32), 14 states have internal predecessors, (32), 6 states have call successors, (19), 2 states have call predecessors, (19), 3 states have return successors, (17), 8 states have call predecessors, (17), 6 states have call successors, (17) [2022-04-27 12:52:04,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 89 transitions. [2022-04-27 12:52:04,029 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 15 states and 89 transitions. [2022-04-27 12:52:04,129 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 89 edges. 89 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 12:52:04,131 INFO L225 Difference]: With dead ends: 119 [2022-04-27 12:52:04,131 INFO L226 Difference]: Without dead ends: 117 [2022-04-27 12:52:04,131 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 96 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 65 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=89, Invalid=373, Unknown=0, NotChecked=0, Total=462 [2022-04-27 12:52:04,131 INFO L413 NwaCegarLoop]: 27 mSDtfsCounter, 43 mSDsluCounter, 129 mSDsCounter, 0 mSdLazyCounter, 479 mSolverCounterSat, 91 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 156 SdHoareTripleChecker+Invalid, 570 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 91 IncrementalHoareTripleChecker+Valid, 479 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2022-04-27 12:52:04,132 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 156 Invalid, 570 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [91 Valid, 479 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2022-04-27 12:52:04,132 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2022-04-27 12:52:04,233 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 96. [2022-04-27 12:52:04,233 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 12:52:04,234 INFO L82 GeneralOperation]: Start isEquivalent. First operand 117 states. Second operand has 96 states, 55 states have (on average 1.1272727272727272) internal successors, (62), 58 states have internal predecessors, (62), 27 states have call successors, (27), 14 states have call predecessors, (27), 13 states have return successors, (25), 23 states have call predecessors, (25), 25 states have call successors, (25) [2022-04-27 12:52:04,234 INFO L74 IsIncluded]: Start isIncluded. First operand 117 states. Second operand has 96 states, 55 states have (on average 1.1272727272727272) internal successors, (62), 58 states have internal predecessors, (62), 27 states have call successors, (27), 14 states have call predecessors, (27), 13 states have return successors, (25), 23 states have call predecessors, (25), 25 states have call successors, (25) [2022-04-27 12:52:04,234 INFO L87 Difference]: Start difference. First operand 117 states. Second operand has 96 states, 55 states have (on average 1.1272727272727272) internal successors, (62), 58 states have internal predecessors, (62), 27 states have call successors, (27), 14 states have call predecessors, (27), 13 states have return successors, (25), 23 states have call predecessors, (25), 25 states have call successors, (25) [2022-04-27 12:52:04,237 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:52:04,237 INFO L93 Difference]: Finished difference Result 117 states and 151 transitions. [2022-04-27 12:52:04,237 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 151 transitions. [2022-04-27 12:52:04,238 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 12:52:04,238 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 12:52:04,238 INFO L74 IsIncluded]: Start isIncluded. First operand has 96 states, 55 states have (on average 1.1272727272727272) internal successors, (62), 58 states have internal predecessors, (62), 27 states have call successors, (27), 14 states have call predecessors, (27), 13 states have return successors, (25), 23 states have call predecessors, (25), 25 states have call successors, (25) Second operand 117 states. [2022-04-27 12:52:04,238 INFO L87 Difference]: Start difference. First operand has 96 states, 55 states have (on average 1.1272727272727272) internal successors, (62), 58 states have internal predecessors, (62), 27 states have call successors, (27), 14 states have call predecessors, (27), 13 states have return successors, (25), 23 states have call predecessors, (25), 25 states have call successors, (25) Second operand 117 states. [2022-04-27 12:52:04,241 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:52:04,242 INFO L93 Difference]: Finished difference Result 117 states and 151 transitions. [2022-04-27 12:52:04,242 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 151 transitions. [2022-04-27 12:52:04,242 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 12:52:04,242 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 12:52:04,242 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 12:52:04,242 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 12:52:04,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 55 states have (on average 1.1272727272727272) internal successors, (62), 58 states have internal predecessors, (62), 27 states have call successors, (27), 14 states have call predecessors, (27), 13 states have return successors, (25), 23 states have call predecessors, (25), 25 states have call successors, (25) [2022-04-27 12:52:04,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 114 transitions. [2022-04-27 12:52:04,245 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 114 transitions. Word has length 56 [2022-04-27 12:52:04,245 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 12:52:04,245 INFO L495 AbstractCegarLoop]: Abstraction has 96 states and 114 transitions. [2022-04-27 12:52:04,246 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 2.0) internal successors, (32), 14 states have internal predecessors, (32), 6 states have call successors, (19), 2 states have call predecessors, (19), 3 states have return successors, (17), 8 states have call predecessors, (17), 6 states have call successors, (17) [2022-04-27 12:52:04,246 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 114 transitions. [2022-04-27 12:52:04,246 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2022-04-27 12:52:04,246 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 12:52:04,247 INFO L195 NwaCegarLoop]: trace histogram [6, 5, 5, 4, 4, 4, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 12:52:04,285 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-27 12:52:04,451 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 12:52:04,452 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 12:52:04,452 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 12:52:04,452 INFO L85 PathProgramCache]: Analyzing trace with hash 888099957, now seen corresponding path program 1 times [2022-04-27 12:52:04,452 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 12:52:04,452 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1143089572] [2022-04-27 12:52:04,452 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 12:52:04,452 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 12:52:04,469 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 12:52:04,469 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [660346297] [2022-04-27 12:52:04,469 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 12:52:04,469 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 12:52:04,469 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 12:52:04,475 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-27 12:52:04,493 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-04-27 12:52:04,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 12:52:04,532 INFO L263 TraceCheckSpWp]: Trace formula consists of 159 conjuncts, 33 conjunts are in the unsatisfiable core [2022-04-27 12:52:04,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 12:52:04,544 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 12:52:05,040 INFO L272 TraceCheckUtils]: 0: Hoare triple {4305#true} call ULTIMATE.init(); {4305#true} is VALID [2022-04-27 12:52:05,040 INFO L290 TraceCheckUtils]: 1: Hoare triple {4305#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(10, 2);call #Ultimate.allocInit(12, 3); {4305#true} is VALID [2022-04-27 12:52:05,040 INFO L290 TraceCheckUtils]: 2: Hoare triple {4305#true} assume true; {4305#true} is VALID [2022-04-27 12:52:05,040 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4305#true} {4305#true} #88#return; {4305#true} is VALID [2022-04-27 12:52:05,040 INFO L272 TraceCheckUtils]: 4: Hoare triple {4305#true} call #t~ret6 := main(); {4305#true} is VALID [2022-04-27 12:52:05,040 INFO L290 TraceCheckUtils]: 5: Hoare triple {4305#true} havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~s~0;havoc ~x~0;havoc ~y~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4; {4305#true} is VALID [2022-04-27 12:52:05,040 INFO L272 TraceCheckUtils]: 6: Hoare triple {4305#true} call assume_abort_if_not((if ~x~0 >= 0 && ~x~0 <= 2 then 1 else 0)); {4305#true} is VALID [2022-04-27 12:52:05,040 INFO L290 TraceCheckUtils]: 7: Hoare triple {4305#true} ~cond := #in~cond; {4305#true} is VALID [2022-04-27 12:52:05,041 INFO L290 TraceCheckUtils]: 8: Hoare triple {4305#true} assume !(0 == ~cond); {4305#true} is VALID [2022-04-27 12:52:05,041 INFO L290 TraceCheckUtils]: 9: Hoare triple {4305#true} assume true; {4305#true} is VALID [2022-04-27 12:52:05,041 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {4305#true} {4305#true} #66#return; {4305#true} is VALID [2022-04-27 12:52:05,041 INFO L290 TraceCheckUtils]: 11: Hoare triple {4305#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {4305#true} is VALID [2022-04-27 12:52:05,041 INFO L272 TraceCheckUtils]: 12: Hoare triple {4305#true} call assume_abort_if_not((if ~y~0 >= 0 && ~y~0 <= 2 then 1 else 0)); {4305#true} is VALID [2022-04-27 12:52:05,041 INFO L290 TraceCheckUtils]: 13: Hoare triple {4305#true} ~cond := #in~cond; {4305#true} is VALID [2022-04-27 12:52:05,041 INFO L290 TraceCheckUtils]: 14: Hoare triple {4305#true} assume !(0 == ~cond); {4305#true} is VALID [2022-04-27 12:52:05,041 INFO L290 TraceCheckUtils]: 15: Hoare triple {4305#true} assume true; {4305#true} is VALID [2022-04-27 12:52:05,041 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {4305#true} {4305#true} #68#return; {4305#true} is VALID [2022-04-27 12:52:05,041 INFO L272 TraceCheckUtils]: 17: Hoare triple {4305#true} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {4305#true} is VALID [2022-04-27 12:52:05,042 INFO L290 TraceCheckUtils]: 18: Hoare triple {4305#true} ~cond := #in~cond; {4364#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-04-27 12:52:05,043 INFO L290 TraceCheckUtils]: 19: Hoare triple {4364#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} assume !(0 == ~cond); {4368#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-27 12:52:05,043 INFO L290 TraceCheckUtils]: 20: Hoare triple {4368#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {4368#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-27 12:52:05,044 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {4368#(not (= |assume_abort_if_not_#in~cond| 0))} {4305#true} #70#return; {4375#(<= 1 main_~x~0)} is VALID [2022-04-27 12:52:05,045 INFO L272 TraceCheckUtils]: 22: Hoare triple {4375#(<= 1 main_~x~0)} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {4305#true} is VALID [2022-04-27 12:52:05,045 INFO L290 TraceCheckUtils]: 23: Hoare triple {4305#true} ~cond := #in~cond; {4305#true} is VALID [2022-04-27 12:52:05,045 INFO L290 TraceCheckUtils]: 24: Hoare triple {4305#true} assume !(0 == ~cond); {4305#true} is VALID [2022-04-27 12:52:05,045 INFO L290 TraceCheckUtils]: 25: Hoare triple {4305#true} assume true; {4305#true} is VALID [2022-04-27 12:52:05,048 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {4305#true} {4375#(<= 1 main_~x~0)} #72#return; {4375#(<= 1 main_~x~0)} is VALID [2022-04-27 12:52:05,048 INFO L290 TraceCheckUtils]: 27: Hoare triple {4375#(<= 1 main_~x~0)} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1; {4394#(and (= main_~r~0 0) (<= 1 main_~x~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-27 12:52:05,049 INFO L290 TraceCheckUtils]: 28: Hoare triple {4394#(and (= main_~r~0 0) (<= 1 main_~x~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} assume !false; {4394#(and (= main_~r~0 0) (<= 1 main_~x~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-27 12:52:05,049 INFO L272 TraceCheckUtils]: 29: Hoare triple {4394#(and (= main_~r~0 0) (<= 1 main_~x~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} call __VERIFIER_assert((if 1 == ~p~0 * ~s~0 - ~r~0 * ~q~0 then 1 else 0)); {4305#true} is VALID [2022-04-27 12:52:05,049 INFO L290 TraceCheckUtils]: 30: Hoare triple {4305#true} ~cond := #in~cond; {4305#true} is VALID [2022-04-27 12:52:05,049 INFO L290 TraceCheckUtils]: 31: Hoare triple {4305#true} assume !(0 == ~cond); {4305#true} is VALID [2022-04-27 12:52:05,049 INFO L290 TraceCheckUtils]: 32: Hoare triple {4305#true} assume true; {4305#true} is VALID [2022-04-27 12:52:05,049 INFO L284 TraceCheckUtils]: 33: Hoare quadruple {4305#true} {4394#(and (= main_~r~0 0) (<= 1 main_~x~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} #74#return; {4394#(and (= main_~r~0 0) (<= 1 main_~x~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-27 12:52:05,050 INFO L272 TraceCheckUtils]: 34: Hoare triple {4394#(and (= main_~r~0 0) (<= 1 main_~x~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {4305#true} is VALID [2022-04-27 12:52:05,050 INFO L290 TraceCheckUtils]: 35: Hoare triple {4305#true} ~cond := #in~cond; {4305#true} is VALID [2022-04-27 12:52:05,050 INFO L290 TraceCheckUtils]: 36: Hoare triple {4305#true} assume !(0 == ~cond); {4305#true} is VALID [2022-04-27 12:52:05,050 INFO L290 TraceCheckUtils]: 37: Hoare triple {4305#true} assume true; {4305#true} is VALID [2022-04-27 12:52:05,050 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {4305#true} {4394#(and (= main_~r~0 0) (<= 1 main_~x~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} #76#return; {4394#(and (= main_~r~0 0) (<= 1 main_~x~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-27 12:52:05,050 INFO L272 TraceCheckUtils]: 39: Hoare triple {4394#(and (= main_~r~0 0) (<= 1 main_~x~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {4305#true} is VALID [2022-04-27 12:52:05,050 INFO L290 TraceCheckUtils]: 40: Hoare triple {4305#true} ~cond := #in~cond; {4305#true} is VALID [2022-04-27 12:52:05,051 INFO L290 TraceCheckUtils]: 41: Hoare triple {4305#true} assume !(0 == ~cond); {4305#true} is VALID [2022-04-27 12:52:05,051 INFO L290 TraceCheckUtils]: 42: Hoare triple {4305#true} assume true; {4305#true} is VALID [2022-04-27 12:52:05,051 INFO L284 TraceCheckUtils]: 43: Hoare quadruple {4305#true} {4394#(and (= main_~r~0 0) (<= 1 main_~x~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} #78#return; {4394#(and (= main_~r~0 0) (<= 1 main_~x~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-27 12:52:05,052 INFO L290 TraceCheckUtils]: 44: Hoare triple {4394#(and (= main_~r~0 0) (<= 1 main_~x~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} assume !!(~a~0 != ~b~0); {4394#(and (= main_~r~0 0) (<= 1 main_~x~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-27 12:52:05,052 INFO L290 TraceCheckUtils]: 45: Hoare triple {4394#(and (= main_~r~0 0) (<= 1 main_~x~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} assume !(~a~0 > ~b~0);~b~0 := ~b~0 - ~a~0;~q~0 := ~q~0 - ~p~0;~s~0 := ~s~0 - ~r~0; {4449#(and (= main_~r~0 0) (<= 1 main_~x~0) (= (+ (* (- 1) main_~r~0) 1) main_~s~0) (= (+ (* (- 1) main_~a~0) main_~y~0) main_~b~0) (= main_~a~0 main_~x~0) (= (+ main_~q~0 main_~p~0) 0) (= main_~p~0 1))} is VALID [2022-04-27 12:52:05,053 INFO L290 TraceCheckUtils]: 46: Hoare triple {4449#(and (= main_~r~0 0) (<= 1 main_~x~0) (= (+ (* (- 1) main_~r~0) 1) main_~s~0) (= (+ (* (- 1) main_~a~0) main_~y~0) main_~b~0) (= main_~a~0 main_~x~0) (= (+ main_~q~0 main_~p~0) 0) (= main_~p~0 1))} assume !false; {4449#(and (= main_~r~0 0) (<= 1 main_~x~0) (= (+ (* (- 1) main_~r~0) 1) main_~s~0) (= (+ (* (- 1) main_~a~0) main_~y~0) main_~b~0) (= main_~a~0 main_~x~0) (= (+ main_~q~0 main_~p~0) 0) (= main_~p~0 1))} is VALID [2022-04-27 12:52:05,053 INFO L272 TraceCheckUtils]: 47: Hoare triple {4449#(and (= main_~r~0 0) (<= 1 main_~x~0) (= (+ (* (- 1) main_~r~0) 1) main_~s~0) (= (+ (* (- 1) main_~a~0) main_~y~0) main_~b~0) (= main_~a~0 main_~x~0) (= (+ main_~q~0 main_~p~0) 0) (= main_~p~0 1))} call __VERIFIER_assert((if 1 == ~p~0 * ~s~0 - ~r~0 * ~q~0 then 1 else 0)); {4305#true} is VALID [2022-04-27 12:52:05,053 INFO L290 TraceCheckUtils]: 48: Hoare triple {4305#true} ~cond := #in~cond; {4305#true} is VALID [2022-04-27 12:52:05,053 INFO L290 TraceCheckUtils]: 49: Hoare triple {4305#true} assume !(0 == ~cond); {4305#true} is VALID [2022-04-27 12:52:05,053 INFO L290 TraceCheckUtils]: 50: Hoare triple {4305#true} assume true; {4305#true} is VALID [2022-04-27 12:52:05,054 INFO L284 TraceCheckUtils]: 51: Hoare quadruple {4305#true} {4449#(and (= main_~r~0 0) (<= 1 main_~x~0) (= (+ (* (- 1) main_~r~0) 1) main_~s~0) (= (+ (* (- 1) main_~a~0) main_~y~0) main_~b~0) (= main_~a~0 main_~x~0) (= (+ main_~q~0 main_~p~0) 0) (= main_~p~0 1))} #74#return; {4449#(and (= main_~r~0 0) (<= 1 main_~x~0) (= (+ (* (- 1) main_~r~0) 1) main_~s~0) (= (+ (* (- 1) main_~a~0) main_~y~0) main_~b~0) (= main_~a~0 main_~x~0) (= (+ main_~q~0 main_~p~0) 0) (= main_~p~0 1))} is VALID [2022-04-27 12:52:05,054 INFO L272 TraceCheckUtils]: 52: Hoare triple {4449#(and (= main_~r~0 0) (<= 1 main_~x~0) (= (+ (* (- 1) main_~r~0) 1) main_~s~0) (= (+ (* (- 1) main_~a~0) main_~y~0) main_~b~0) (= main_~a~0 main_~x~0) (= (+ main_~q~0 main_~p~0) 0) (= main_~p~0 1))} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {4305#true} is VALID [2022-04-27 12:52:05,054 INFO L290 TraceCheckUtils]: 53: Hoare triple {4305#true} ~cond := #in~cond; {4474#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-27 12:52:05,054 INFO L290 TraceCheckUtils]: 54: Hoare triple {4474#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {4478#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 12:52:05,055 INFO L290 TraceCheckUtils]: 55: Hoare triple {4478#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {4478#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 12:52:05,056 INFO L284 TraceCheckUtils]: 56: Hoare quadruple {4478#(not (= |__VERIFIER_assert_#in~cond| 0))} {4449#(and (= main_~r~0 0) (<= 1 main_~x~0) (= (+ (* (- 1) main_~r~0) 1) main_~s~0) (= (+ (* (- 1) main_~a~0) main_~y~0) main_~b~0) (= main_~a~0 main_~x~0) (= (+ main_~q~0 main_~p~0) 0) (= main_~p~0 1))} #76#return; {4485#(and (<= 1 main_~x~0) (= main_~b~0 (+ (* main_~q~0 main_~x~0) main_~y~0)) (= main_~s~0 1) (= (+ main_~q~0 1) 0))} is VALID [2022-04-27 12:52:05,056 INFO L272 TraceCheckUtils]: 57: Hoare triple {4485#(and (<= 1 main_~x~0) (= main_~b~0 (+ (* main_~q~0 main_~x~0) main_~y~0)) (= main_~s~0 1) (= (+ main_~q~0 1) 0))} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {4489#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 12:52:05,057 INFO L290 TraceCheckUtils]: 58: Hoare triple {4489#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {4493#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 12:52:05,057 INFO L290 TraceCheckUtils]: 59: Hoare triple {4493#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {4306#false} is VALID [2022-04-27 12:52:05,057 INFO L290 TraceCheckUtils]: 60: Hoare triple {4306#false} assume !false; {4306#false} is VALID [2022-04-27 12:52:05,058 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 27 proven. 8 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2022-04-27 12:52:05,058 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 12:52:19,397 INFO L290 TraceCheckUtils]: 60: Hoare triple {4306#false} assume !false; {4306#false} is VALID [2022-04-27 12:52:19,397 INFO L290 TraceCheckUtils]: 59: Hoare triple {4493#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {4306#false} is VALID [2022-04-27 12:52:19,398 INFO L290 TraceCheckUtils]: 58: Hoare triple {4489#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {4493#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 12:52:19,398 INFO L272 TraceCheckUtils]: 57: Hoare triple {4509#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {4489#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 12:52:19,399 INFO L284 TraceCheckUtils]: 56: Hoare quadruple {4478#(not (= |__VERIFIER_assert_#in~cond| 0))} {4513#(or (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))))} #76#return; {4509#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} is VALID [2022-04-27 12:52:19,399 INFO L290 TraceCheckUtils]: 55: Hoare triple {4478#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {4478#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 12:52:19,400 INFO L290 TraceCheckUtils]: 54: Hoare triple {4523#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} assume !(0 == ~cond); {4478#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 12:52:19,400 INFO L290 TraceCheckUtils]: 53: Hoare triple {4305#true} ~cond := #in~cond; {4523#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-27 12:52:19,400 INFO L272 TraceCheckUtils]: 52: Hoare triple {4513#(or (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))))} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {4305#true} is VALID [2022-04-27 12:52:19,401 INFO L284 TraceCheckUtils]: 51: Hoare quadruple {4305#true} {4513#(or (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))))} #74#return; {4513#(or (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))))} is VALID [2022-04-27 12:52:19,401 INFO L290 TraceCheckUtils]: 50: Hoare triple {4305#true} assume true; {4305#true} is VALID [2022-04-27 12:52:19,401 INFO L290 TraceCheckUtils]: 49: Hoare triple {4305#true} assume !(0 == ~cond); {4305#true} is VALID [2022-04-27 12:52:19,401 INFO L290 TraceCheckUtils]: 48: Hoare triple {4305#true} ~cond := #in~cond; {4305#true} is VALID [2022-04-27 12:52:19,401 INFO L272 TraceCheckUtils]: 47: Hoare triple {4513#(or (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))))} call __VERIFIER_assert((if 1 == ~p~0 * ~s~0 - ~r~0 * ~q~0 then 1 else 0)); {4305#true} is VALID [2022-04-27 12:52:19,401 INFO L290 TraceCheckUtils]: 46: Hoare triple {4513#(or (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))))} assume !false; {4513#(or (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))))} is VALID [2022-04-27 12:52:20,476 INFO L290 TraceCheckUtils]: 45: Hoare triple {4513#(or (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))))} assume !(~a~0 > ~b~0);~b~0 := ~b~0 - ~a~0;~q~0 := ~q~0 - ~p~0;~s~0 := ~s~0 - ~r~0; {4513#(or (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))))} is VALID [2022-04-27 12:52:20,477 INFO L290 TraceCheckUtils]: 44: Hoare triple {4513#(or (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))))} assume !!(~a~0 != ~b~0); {4513#(or (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))))} is VALID [2022-04-27 12:52:20,477 INFO L284 TraceCheckUtils]: 43: Hoare quadruple {4305#true} {4513#(or (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))))} #78#return; {4513#(or (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))))} is VALID [2022-04-27 12:52:20,477 INFO L290 TraceCheckUtils]: 42: Hoare triple {4305#true} assume true; {4305#true} is VALID [2022-04-27 12:52:20,477 INFO L290 TraceCheckUtils]: 41: Hoare triple {4305#true} assume !(0 == ~cond); {4305#true} is VALID [2022-04-27 12:52:20,477 INFO L290 TraceCheckUtils]: 40: Hoare triple {4305#true} ~cond := #in~cond; {4305#true} is VALID [2022-04-27 12:52:20,477 INFO L272 TraceCheckUtils]: 39: Hoare triple {4513#(or (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))))} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {4305#true} is VALID [2022-04-27 12:52:20,478 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {4305#true} {4513#(or (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))))} #76#return; {4513#(or (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))))} is VALID [2022-04-27 12:52:20,478 INFO L290 TraceCheckUtils]: 37: Hoare triple {4305#true} assume true; {4305#true} is VALID [2022-04-27 12:52:20,478 INFO L290 TraceCheckUtils]: 36: Hoare triple {4305#true} assume !(0 == ~cond); {4305#true} is VALID [2022-04-27 12:52:20,478 INFO L290 TraceCheckUtils]: 35: Hoare triple {4305#true} ~cond := #in~cond; {4305#true} is VALID [2022-04-27 12:52:20,478 INFO L272 TraceCheckUtils]: 34: Hoare triple {4513#(or (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))))} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {4305#true} is VALID [2022-04-27 12:52:20,479 INFO L284 TraceCheckUtils]: 33: Hoare quadruple {4305#true} {4513#(or (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))))} #74#return; {4513#(or (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))))} is VALID [2022-04-27 12:52:20,479 INFO L290 TraceCheckUtils]: 32: Hoare triple {4305#true} assume true; {4305#true} is VALID [2022-04-27 12:52:20,479 INFO L290 TraceCheckUtils]: 31: Hoare triple {4305#true} assume !(0 == ~cond); {4305#true} is VALID [2022-04-27 12:52:20,479 INFO L290 TraceCheckUtils]: 30: Hoare triple {4305#true} ~cond := #in~cond; {4305#true} is VALID [2022-04-27 12:52:20,479 INFO L272 TraceCheckUtils]: 29: Hoare triple {4513#(or (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))))} call __VERIFIER_assert((if 1 == ~p~0 * ~s~0 - ~r~0 * ~q~0 then 1 else 0)); {4305#true} is VALID [2022-04-27 12:52:20,479 INFO L290 TraceCheckUtils]: 28: Hoare triple {4513#(or (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))))} assume !false; {4513#(or (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))))} is VALID [2022-04-27 12:52:20,480 INFO L290 TraceCheckUtils]: 27: Hoare triple {4305#true} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1; {4513#(or (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))))} is VALID [2022-04-27 12:52:20,480 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {4305#true} {4305#true} #72#return; {4305#true} is VALID [2022-04-27 12:52:20,480 INFO L290 TraceCheckUtils]: 25: Hoare triple {4305#true} assume true; {4305#true} is VALID [2022-04-27 12:52:20,480 INFO L290 TraceCheckUtils]: 24: Hoare triple {4305#true} assume !(0 == ~cond); {4305#true} is VALID [2022-04-27 12:52:20,480 INFO L290 TraceCheckUtils]: 23: Hoare triple {4305#true} ~cond := #in~cond; {4305#true} is VALID [2022-04-27 12:52:20,480 INFO L272 TraceCheckUtils]: 22: Hoare triple {4305#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {4305#true} is VALID [2022-04-27 12:52:20,480 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {4305#true} {4305#true} #70#return; {4305#true} is VALID [2022-04-27 12:52:20,480 INFO L290 TraceCheckUtils]: 20: Hoare triple {4305#true} assume true; {4305#true} is VALID [2022-04-27 12:52:20,480 INFO L290 TraceCheckUtils]: 19: Hoare triple {4305#true} assume !(0 == ~cond); {4305#true} is VALID [2022-04-27 12:52:20,480 INFO L290 TraceCheckUtils]: 18: Hoare triple {4305#true} ~cond := #in~cond; {4305#true} is VALID [2022-04-27 12:52:20,480 INFO L272 TraceCheckUtils]: 17: Hoare triple {4305#true} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {4305#true} is VALID [2022-04-27 12:52:20,480 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {4305#true} {4305#true} #68#return; {4305#true} is VALID [2022-04-27 12:52:20,480 INFO L290 TraceCheckUtils]: 15: Hoare triple {4305#true} assume true; {4305#true} is VALID [2022-04-27 12:52:20,480 INFO L290 TraceCheckUtils]: 14: Hoare triple {4305#true} assume !(0 == ~cond); {4305#true} is VALID [2022-04-27 12:52:20,480 INFO L290 TraceCheckUtils]: 13: Hoare triple {4305#true} ~cond := #in~cond; {4305#true} is VALID [2022-04-27 12:52:20,481 INFO L272 TraceCheckUtils]: 12: Hoare triple {4305#true} call assume_abort_if_not((if ~y~0 >= 0 && ~y~0 <= 2 then 1 else 0)); {4305#true} is VALID [2022-04-27 12:52:20,481 INFO L290 TraceCheckUtils]: 11: Hoare triple {4305#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {4305#true} is VALID [2022-04-27 12:52:20,481 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {4305#true} {4305#true} #66#return; {4305#true} is VALID [2022-04-27 12:52:20,481 INFO L290 TraceCheckUtils]: 9: Hoare triple {4305#true} assume true; {4305#true} is VALID [2022-04-27 12:52:20,481 INFO L290 TraceCheckUtils]: 8: Hoare triple {4305#true} assume !(0 == ~cond); {4305#true} is VALID [2022-04-27 12:52:20,481 INFO L290 TraceCheckUtils]: 7: Hoare triple {4305#true} ~cond := #in~cond; {4305#true} is VALID [2022-04-27 12:52:20,481 INFO L272 TraceCheckUtils]: 6: Hoare triple {4305#true} call assume_abort_if_not((if ~x~0 >= 0 && ~x~0 <= 2 then 1 else 0)); {4305#true} is VALID [2022-04-27 12:52:20,481 INFO L290 TraceCheckUtils]: 5: Hoare triple {4305#true} havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~s~0;havoc ~x~0;havoc ~y~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4; {4305#true} is VALID [2022-04-27 12:52:20,481 INFO L272 TraceCheckUtils]: 4: Hoare triple {4305#true} call #t~ret6 := main(); {4305#true} is VALID [2022-04-27 12:52:20,481 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4305#true} {4305#true} #88#return; {4305#true} is VALID [2022-04-27 12:52:20,481 INFO L290 TraceCheckUtils]: 2: Hoare triple {4305#true} assume true; {4305#true} is VALID [2022-04-27 12:52:20,481 INFO L290 TraceCheckUtils]: 1: Hoare triple {4305#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(10, 2);call #Ultimate.allocInit(12, 3); {4305#true} is VALID [2022-04-27 12:52:20,481 INFO L272 TraceCheckUtils]: 0: Hoare triple {4305#true} call ULTIMATE.init(); {4305#true} is VALID [2022-04-27 12:52:20,481 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 22 proven. 1 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-04-27 12:52:20,482 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 12:52:20,482 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1143089572] [2022-04-27 12:52:20,482 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 12:52:20,482 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [660346297] [2022-04-27 12:52:20,482 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [660346297] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 12:52:20,482 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-27 12:52:20,482 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 8] total 15 [2022-04-27 12:52:20,484 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1455469365] [2022-04-27 12:52:20,484 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-27 12:52:20,485 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 13 states have (on average 2.3076923076923075) internal successors, (30), 11 states have internal predecessors, (30), 7 states have call successors, (17), 2 states have call predecessors, (17), 3 states have return successors, (16), 7 states have call predecessors, (16), 5 states have call successors, (16) Word has length 61 [2022-04-27 12:52:20,485 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 12:52:20,485 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 15 states, 13 states have (on average 2.3076923076923075) internal successors, (30), 11 states have internal predecessors, (30), 7 states have call successors, (17), 2 states have call predecessors, (17), 3 states have return successors, (16), 7 states have call predecessors, (16), 5 states have call successors, (16) [2022-04-27 12:52:20,762 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 63 edges. 63 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 12:52:20,762 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-04-27 12:52:20,762 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 12:52:20,763 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-04-27 12:52:20,763 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=168, Unknown=0, NotChecked=0, Total=210 [2022-04-27 12:52:20,763 INFO L87 Difference]: Start difference. First operand 96 states and 114 transitions. Second operand has 15 states, 13 states have (on average 2.3076923076923075) internal successors, (30), 11 states have internal predecessors, (30), 7 states have call successors, (17), 2 states have call predecessors, (17), 3 states have return successors, (16), 7 states have call predecessors, (16), 5 states have call successors, (16) [2022-04-27 12:52:22,877 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:52:22,878 INFO L93 Difference]: Finished difference Result 133 states and 166 transitions. [2022-04-27 12:52:22,878 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-04-27 12:52:22,878 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 13 states have (on average 2.3076923076923075) internal successors, (30), 11 states have internal predecessors, (30), 7 states have call successors, (17), 2 states have call predecessors, (17), 3 states have return successors, (16), 7 states have call predecessors, (16), 5 states have call successors, (16) Word has length 61 [2022-04-27 12:52:22,879 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 12:52:22,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 13 states have (on average 2.3076923076923075) internal successors, (30), 11 states have internal predecessors, (30), 7 states have call successors, (17), 2 states have call predecessors, (17), 3 states have return successors, (16), 7 states have call predecessors, (16), 5 states have call successors, (16) [2022-04-27 12:52:22,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 98 transitions. [2022-04-27 12:52:22,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 13 states have (on average 2.3076923076923075) internal successors, (30), 11 states have internal predecessors, (30), 7 states have call successors, (17), 2 states have call predecessors, (17), 3 states have return successors, (16), 7 states have call predecessors, (16), 5 states have call successors, (16) [2022-04-27 12:52:22,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 98 transitions. [2022-04-27 12:52:22,892 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 14 states and 98 transitions. [2022-04-27 12:52:22,999 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 98 edges. 98 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 12:52:23,003 INFO L225 Difference]: With dead ends: 133 [2022-04-27 12:52:23,004 INFO L226 Difference]: Without dead ends: 122 [2022-04-27 12:52:23,007 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 106 SyntacticMatches, 2 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=75, Invalid=305, Unknown=0, NotChecked=0, Total=380 [2022-04-27 12:52:23,008 INFO L413 NwaCegarLoop]: 31 mSDtfsCounter, 38 mSDsluCounter, 128 mSDsCounter, 0 mSdLazyCounter, 518 mSolverCounterSat, 55 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 159 SdHoareTripleChecker+Invalid, 573 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 518 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-04-27 12:52:23,009 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 159 Invalid, 573 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 518 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2022-04-27 12:52:23,010 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2022-04-27 12:52:23,107 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 107. [2022-04-27 12:52:23,107 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 12:52:23,109 INFO L82 GeneralOperation]: Start isEquivalent. First operand 122 states. Second operand has 107 states, 65 states have (on average 1.0923076923076922) internal successors, (71), 68 states have internal predecessors, (71), 25 states have call successors, (25), 17 states have call predecessors, (25), 16 states have return successors, (23), 21 states have call predecessors, (23), 23 states have call successors, (23) [2022-04-27 12:52:23,109 INFO L74 IsIncluded]: Start isIncluded. First operand 122 states. Second operand has 107 states, 65 states have (on average 1.0923076923076922) internal successors, (71), 68 states have internal predecessors, (71), 25 states have call successors, (25), 17 states have call predecessors, (25), 16 states have return successors, (23), 21 states have call predecessors, (23), 23 states have call successors, (23) [2022-04-27 12:52:23,110 INFO L87 Difference]: Start difference. First operand 122 states. Second operand has 107 states, 65 states have (on average 1.0923076923076922) internal successors, (71), 68 states have internal predecessors, (71), 25 states have call successors, (25), 17 states have call predecessors, (25), 16 states have return successors, (23), 21 states have call predecessors, (23), 23 states have call successors, (23) [2022-04-27 12:52:23,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:52:23,112 INFO L93 Difference]: Finished difference Result 122 states and 145 transitions. [2022-04-27 12:52:23,112 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 145 transitions. [2022-04-27 12:52:23,112 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 12:52:23,112 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 12:52:23,113 INFO L74 IsIncluded]: Start isIncluded. First operand has 107 states, 65 states have (on average 1.0923076923076922) internal successors, (71), 68 states have internal predecessors, (71), 25 states have call successors, (25), 17 states have call predecessors, (25), 16 states have return successors, (23), 21 states have call predecessors, (23), 23 states have call successors, (23) Second operand 122 states. [2022-04-27 12:52:23,113 INFO L87 Difference]: Start difference. First operand has 107 states, 65 states have (on average 1.0923076923076922) internal successors, (71), 68 states have internal predecessors, (71), 25 states have call successors, (25), 17 states have call predecessors, (25), 16 states have return successors, (23), 21 states have call predecessors, (23), 23 states have call successors, (23) Second operand 122 states. [2022-04-27 12:52:23,115 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:52:23,115 INFO L93 Difference]: Finished difference Result 122 states and 145 transitions. [2022-04-27 12:52:23,115 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 145 transitions. [2022-04-27 12:52:23,116 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 12:52:23,116 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 12:52:23,116 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 12:52:23,116 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 12:52:23,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 107 states, 65 states have (on average 1.0923076923076922) internal successors, (71), 68 states have internal predecessors, (71), 25 states have call successors, (25), 17 states have call predecessors, (25), 16 states have return successors, (23), 21 states have call predecessors, (23), 23 states have call successors, (23) [2022-04-27 12:52:23,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 119 transitions. [2022-04-27 12:52:23,120 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 119 transitions. Word has length 61 [2022-04-27 12:52:23,120 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 12:52:23,120 INFO L495 AbstractCegarLoop]: Abstraction has 107 states and 119 transitions. [2022-04-27 12:52:23,120 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 13 states have (on average 2.3076923076923075) internal successors, (30), 11 states have internal predecessors, (30), 7 states have call successors, (17), 2 states have call predecessors, (17), 3 states have return successors, (16), 7 states have call predecessors, (16), 5 states have call successors, (16) [2022-04-27 12:52:23,120 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 119 transitions. [2022-04-27 12:52:23,121 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2022-04-27 12:52:23,121 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 12:52:23,121 INFO L195 NwaCegarLoop]: trace histogram [7, 6, 6, 4, 4, 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, 1, 1] [2022-04-27 12:52:23,144 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-04-27 12:52:23,339 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable8 [2022-04-27 12:52:23,339 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 12:52:23,339 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 12:52:23,339 INFO L85 PathProgramCache]: Analyzing trace with hash 2064127436, now seen corresponding path program 1 times [2022-04-27 12:52:23,339 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 12:52:23,339 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1731545497] [2022-04-27 12:52:23,339 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 12:52:23,340 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 12:52:23,351 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 12:52:23,352 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1557222481] [2022-04-27 12:52:23,352 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 12:52:23,352 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 12:52:23,352 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 12:52:23,353 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-27 12:52:23,354 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-27 12:52:23,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 12:52:23,396 INFO L263 TraceCheckSpWp]: Trace formula consists of 177 conjuncts, 10 conjunts are in the unsatisfiable core [2022-04-27 12:52:23,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 12:52:23,406 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 12:52:23,828 INFO L272 TraceCheckUtils]: 0: Hoare triple {5295#true} call ULTIMATE.init(); {5295#true} is VALID [2022-04-27 12:52:23,828 INFO L290 TraceCheckUtils]: 1: Hoare triple {5295#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(10, 2);call #Ultimate.allocInit(12, 3); {5295#true} is VALID [2022-04-27 12:52:23,828 INFO L290 TraceCheckUtils]: 2: Hoare triple {5295#true} assume true; {5295#true} is VALID [2022-04-27 12:52:23,828 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5295#true} {5295#true} #88#return; {5295#true} is VALID [2022-04-27 12:52:23,828 INFO L272 TraceCheckUtils]: 4: Hoare triple {5295#true} call #t~ret6 := main(); {5295#true} is VALID [2022-04-27 12:52:23,828 INFO L290 TraceCheckUtils]: 5: Hoare triple {5295#true} havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~s~0;havoc ~x~0;havoc ~y~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4; {5295#true} is VALID [2022-04-27 12:52:23,828 INFO L272 TraceCheckUtils]: 6: Hoare triple {5295#true} call assume_abort_if_not((if ~x~0 >= 0 && ~x~0 <= 2 then 1 else 0)); {5295#true} is VALID [2022-04-27 12:52:23,828 INFO L290 TraceCheckUtils]: 7: Hoare triple {5295#true} ~cond := #in~cond; {5321#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-04-27 12:52:23,829 INFO L290 TraceCheckUtils]: 8: Hoare triple {5321#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} assume !(0 == ~cond); {5325#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-27 12:52:23,829 INFO L290 TraceCheckUtils]: 9: Hoare triple {5325#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {5325#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-27 12:52:23,830 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {5325#(not (= |assume_abort_if_not_#in~cond| 0))} {5295#true} #66#return; {5332#(and (<= 0 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-27 12:52:23,830 INFO L290 TraceCheckUtils]: 11: Hoare triple {5332#(and (<= 0 main_~x~0) (<= main_~x~0 2))} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {5332#(and (<= 0 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-27 12:52:23,830 INFO L272 TraceCheckUtils]: 12: Hoare triple {5332#(and (<= 0 main_~x~0) (<= main_~x~0 2))} call assume_abort_if_not((if ~y~0 >= 0 && ~y~0 <= 2 then 1 else 0)); {5295#true} is VALID [2022-04-27 12:52:23,830 INFO L290 TraceCheckUtils]: 13: Hoare triple {5295#true} ~cond := #in~cond; {5295#true} is VALID [2022-04-27 12:52:23,830 INFO L290 TraceCheckUtils]: 14: Hoare triple {5295#true} assume !(0 == ~cond); {5295#true} is VALID [2022-04-27 12:52:23,830 INFO L290 TraceCheckUtils]: 15: Hoare triple {5295#true} assume true; {5295#true} is VALID [2022-04-27 12:52:23,831 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {5295#true} {5332#(and (<= 0 main_~x~0) (<= main_~x~0 2))} #68#return; {5332#(and (<= 0 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-27 12:52:23,831 INFO L272 TraceCheckUtils]: 17: Hoare triple {5332#(and (<= 0 main_~x~0) (<= main_~x~0 2))} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {5295#true} is VALID [2022-04-27 12:52:23,831 INFO L290 TraceCheckUtils]: 18: Hoare triple {5295#true} ~cond := #in~cond; {5295#true} is VALID [2022-04-27 12:52:23,831 INFO L290 TraceCheckUtils]: 19: Hoare triple {5295#true} assume !(0 == ~cond); {5295#true} is VALID [2022-04-27 12:52:23,831 INFO L290 TraceCheckUtils]: 20: Hoare triple {5295#true} assume true; {5295#true} is VALID [2022-04-27 12:52:23,831 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {5295#true} {5332#(and (<= 0 main_~x~0) (<= main_~x~0 2))} #70#return; {5332#(and (<= 0 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-27 12:52:23,831 INFO L272 TraceCheckUtils]: 22: Hoare triple {5332#(and (<= 0 main_~x~0) (<= main_~x~0 2))} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {5295#true} is VALID [2022-04-27 12:52:23,831 INFO L290 TraceCheckUtils]: 23: Hoare triple {5295#true} ~cond := #in~cond; {5295#true} is VALID [2022-04-27 12:52:23,831 INFO L290 TraceCheckUtils]: 24: Hoare triple {5295#true} assume !(0 == ~cond); {5295#true} is VALID [2022-04-27 12:52:23,831 INFO L290 TraceCheckUtils]: 25: Hoare triple {5295#true} assume true; {5295#true} is VALID [2022-04-27 12:52:23,832 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {5295#true} {5332#(and (<= 0 main_~x~0) (<= main_~x~0 2))} #72#return; {5332#(and (<= 0 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-27 12:52:23,832 INFO L290 TraceCheckUtils]: 27: Hoare triple {5332#(and (<= 0 main_~x~0) (<= main_~x~0 2))} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1; {5384#(<= main_~a~0 2)} is VALID [2022-04-27 12:52:23,832 INFO L290 TraceCheckUtils]: 28: Hoare triple {5384#(<= main_~a~0 2)} assume !false; {5384#(<= main_~a~0 2)} is VALID [2022-04-27 12:52:23,833 INFO L272 TraceCheckUtils]: 29: Hoare triple {5384#(<= main_~a~0 2)} call __VERIFIER_assert((if 1 == ~p~0 * ~s~0 - ~r~0 * ~q~0 then 1 else 0)); {5295#true} is VALID [2022-04-27 12:52:23,833 INFO L290 TraceCheckUtils]: 30: Hoare triple {5295#true} ~cond := #in~cond; {5295#true} is VALID [2022-04-27 12:52:23,833 INFO L290 TraceCheckUtils]: 31: Hoare triple {5295#true} assume !(0 == ~cond); {5295#true} is VALID [2022-04-27 12:52:23,833 INFO L290 TraceCheckUtils]: 32: Hoare triple {5295#true} assume true; {5295#true} is VALID [2022-04-27 12:52:23,833 INFO L284 TraceCheckUtils]: 33: Hoare quadruple {5295#true} {5384#(<= main_~a~0 2)} #74#return; {5384#(<= main_~a~0 2)} is VALID [2022-04-27 12:52:23,833 INFO L272 TraceCheckUtils]: 34: Hoare triple {5384#(<= main_~a~0 2)} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {5295#true} is VALID [2022-04-27 12:52:23,833 INFO L290 TraceCheckUtils]: 35: Hoare triple {5295#true} ~cond := #in~cond; {5295#true} is VALID [2022-04-27 12:52:23,834 INFO L290 TraceCheckUtils]: 36: Hoare triple {5295#true} assume !(0 == ~cond); {5295#true} is VALID [2022-04-27 12:52:23,834 INFO L290 TraceCheckUtils]: 37: Hoare triple {5295#true} assume true; {5295#true} is VALID [2022-04-27 12:52:23,834 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {5295#true} {5384#(<= main_~a~0 2)} #76#return; {5384#(<= main_~a~0 2)} is VALID [2022-04-27 12:52:23,834 INFO L272 TraceCheckUtils]: 39: Hoare triple {5384#(<= main_~a~0 2)} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {5295#true} is VALID [2022-04-27 12:52:23,834 INFO L290 TraceCheckUtils]: 40: Hoare triple {5295#true} ~cond := #in~cond; {5295#true} is VALID [2022-04-27 12:52:23,834 INFO L290 TraceCheckUtils]: 41: Hoare triple {5295#true} assume !(0 == ~cond); {5295#true} is VALID [2022-04-27 12:52:23,834 INFO L290 TraceCheckUtils]: 42: Hoare triple {5295#true} assume true; {5295#true} is VALID [2022-04-27 12:52:23,835 INFO L284 TraceCheckUtils]: 43: Hoare quadruple {5295#true} {5384#(<= main_~a~0 2)} #78#return; {5384#(<= main_~a~0 2)} is VALID [2022-04-27 12:52:23,835 INFO L290 TraceCheckUtils]: 44: Hoare triple {5384#(<= main_~a~0 2)} assume !!(~a~0 != ~b~0); {5384#(<= main_~a~0 2)} is VALID [2022-04-27 12:52:23,836 INFO L290 TraceCheckUtils]: 45: Hoare triple {5384#(<= main_~a~0 2)} assume ~a~0 > ~b~0;~a~0 := ~a~0 - ~b~0;~p~0 := ~p~0 - ~q~0;~r~0 := ~r~0 - ~s~0; {5439#(and (< 0 main_~a~0) (< main_~b~0 2))} is VALID [2022-04-27 12:52:23,836 INFO L290 TraceCheckUtils]: 46: Hoare triple {5439#(and (< 0 main_~a~0) (< main_~b~0 2))} assume !false; {5439#(and (< 0 main_~a~0) (< main_~b~0 2))} is VALID [2022-04-27 12:52:23,836 INFO L272 TraceCheckUtils]: 47: Hoare triple {5439#(and (< 0 main_~a~0) (< main_~b~0 2))} call __VERIFIER_assert((if 1 == ~p~0 * ~s~0 - ~r~0 * ~q~0 then 1 else 0)); {5295#true} is VALID [2022-04-27 12:52:23,836 INFO L290 TraceCheckUtils]: 48: Hoare triple {5295#true} ~cond := #in~cond; {5295#true} is VALID [2022-04-27 12:52:23,837 INFO L290 TraceCheckUtils]: 49: Hoare triple {5295#true} assume !(0 == ~cond); {5295#true} is VALID [2022-04-27 12:52:23,837 INFO L290 TraceCheckUtils]: 50: Hoare triple {5295#true} assume true; {5295#true} is VALID [2022-04-27 12:52:23,837 INFO L284 TraceCheckUtils]: 51: Hoare quadruple {5295#true} {5439#(and (< 0 main_~a~0) (< main_~b~0 2))} #74#return; {5439#(and (< 0 main_~a~0) (< main_~b~0 2))} is VALID [2022-04-27 12:52:23,837 INFO L272 TraceCheckUtils]: 52: Hoare triple {5439#(and (< 0 main_~a~0) (< main_~b~0 2))} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {5295#true} is VALID [2022-04-27 12:52:23,837 INFO L290 TraceCheckUtils]: 53: Hoare triple {5295#true} ~cond := #in~cond; {5295#true} is VALID [2022-04-27 12:52:23,837 INFO L290 TraceCheckUtils]: 54: Hoare triple {5295#true} assume !(0 == ~cond); {5295#true} is VALID [2022-04-27 12:52:23,837 INFO L290 TraceCheckUtils]: 55: Hoare triple {5295#true} assume true; {5295#true} is VALID [2022-04-27 12:52:23,838 INFO L284 TraceCheckUtils]: 56: Hoare quadruple {5295#true} {5439#(and (< 0 main_~a~0) (< main_~b~0 2))} #76#return; {5439#(and (< 0 main_~a~0) (< main_~b~0 2))} is VALID [2022-04-27 12:52:23,838 INFO L272 TraceCheckUtils]: 57: Hoare triple {5439#(and (< 0 main_~a~0) (< main_~b~0 2))} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {5295#true} is VALID [2022-04-27 12:52:23,838 INFO L290 TraceCheckUtils]: 58: Hoare triple {5295#true} ~cond := #in~cond; {5295#true} is VALID [2022-04-27 12:52:23,838 INFO L290 TraceCheckUtils]: 59: Hoare triple {5295#true} assume !(0 == ~cond); {5295#true} is VALID [2022-04-27 12:52:23,838 INFO L290 TraceCheckUtils]: 60: Hoare triple {5295#true} assume true; {5295#true} is VALID [2022-04-27 12:52:23,839 INFO L284 TraceCheckUtils]: 61: Hoare quadruple {5295#true} {5439#(and (< 0 main_~a~0) (< main_~b~0 2))} #78#return; {5439#(and (< 0 main_~a~0) (< main_~b~0 2))} is VALID [2022-04-27 12:52:23,839 INFO L290 TraceCheckUtils]: 62: Hoare triple {5439#(and (< 0 main_~a~0) (< main_~b~0 2))} assume !!(~a~0 != ~b~0); {5491#(and (< 0 main_~a~0) (not (= main_~b~0 main_~a~0)) (< main_~b~0 2))} is VALID [2022-04-27 12:52:23,840 INFO L290 TraceCheckUtils]: 63: Hoare triple {5491#(and (< 0 main_~a~0) (not (= main_~b~0 main_~a~0)) (< main_~b~0 2))} assume !(~a~0 > ~b~0);~b~0 := ~b~0 - ~a~0;~q~0 := ~q~0 - ~p~0;~s~0 := ~s~0 - ~r~0; {5296#false} is VALID [2022-04-27 12:52:23,840 INFO L290 TraceCheckUtils]: 64: Hoare triple {5296#false} assume !false; {5296#false} is VALID [2022-04-27 12:52:23,840 INFO L272 TraceCheckUtils]: 65: Hoare triple {5296#false} call __VERIFIER_assert((if 1 == ~p~0 * ~s~0 - ~r~0 * ~q~0 then 1 else 0)); {5296#false} is VALID [2022-04-27 12:52:23,840 INFO L290 TraceCheckUtils]: 66: Hoare triple {5296#false} ~cond := #in~cond; {5296#false} is VALID [2022-04-27 12:52:23,840 INFO L290 TraceCheckUtils]: 67: Hoare triple {5296#false} assume 0 == ~cond; {5296#false} is VALID [2022-04-27 12:52:23,840 INFO L290 TraceCheckUtils]: 68: Hoare triple {5296#false} assume !false; {5296#false} is VALID [2022-04-27 12:52:23,840 INFO L134 CoverageAnalysis]: Checked inductivity of 106 backedges. 16 proven. 15 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2022-04-27 12:52:23,840 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 12:52:24,314 INFO L290 TraceCheckUtils]: 68: Hoare triple {5296#false} assume !false; {5296#false} is VALID [2022-04-27 12:52:24,315 INFO L290 TraceCheckUtils]: 67: Hoare triple {5296#false} assume 0 == ~cond; {5296#false} is VALID [2022-04-27 12:52:24,315 INFO L290 TraceCheckUtils]: 66: Hoare triple {5296#false} ~cond := #in~cond; {5296#false} is VALID [2022-04-27 12:52:24,315 INFO L272 TraceCheckUtils]: 65: Hoare triple {5296#false} call __VERIFIER_assert((if 1 == ~p~0 * ~s~0 - ~r~0 * ~q~0 then 1 else 0)); {5296#false} is VALID [2022-04-27 12:52:24,315 INFO L290 TraceCheckUtils]: 64: Hoare triple {5296#false} assume !false; {5296#false} is VALID [2022-04-27 12:52:24,315 INFO L290 TraceCheckUtils]: 63: Hoare triple {5525#(< main_~b~0 main_~a~0)} assume !(~a~0 > ~b~0);~b~0 := ~b~0 - ~a~0;~q~0 := ~q~0 - ~p~0;~s~0 := ~s~0 - ~r~0; {5296#false} is VALID [2022-04-27 12:52:24,315 INFO L290 TraceCheckUtils]: 62: Hoare triple {5529#(or (< main_~b~0 main_~a~0) (= main_~b~0 main_~a~0))} assume !!(~a~0 != ~b~0); {5525#(< main_~b~0 main_~a~0)} is VALID [2022-04-27 12:52:24,316 INFO L284 TraceCheckUtils]: 61: Hoare quadruple {5295#true} {5529#(or (< main_~b~0 main_~a~0) (= main_~b~0 main_~a~0))} #78#return; {5529#(or (< main_~b~0 main_~a~0) (= main_~b~0 main_~a~0))} is VALID [2022-04-27 12:52:24,316 INFO L290 TraceCheckUtils]: 60: Hoare triple {5295#true} assume true; {5295#true} is VALID [2022-04-27 12:52:24,316 INFO L290 TraceCheckUtils]: 59: Hoare triple {5295#true} assume !(0 == ~cond); {5295#true} is VALID [2022-04-27 12:52:24,316 INFO L290 TraceCheckUtils]: 58: Hoare triple {5295#true} ~cond := #in~cond; {5295#true} is VALID [2022-04-27 12:52:24,316 INFO L272 TraceCheckUtils]: 57: Hoare triple {5529#(or (< main_~b~0 main_~a~0) (= main_~b~0 main_~a~0))} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {5295#true} is VALID [2022-04-27 12:52:24,317 INFO L284 TraceCheckUtils]: 56: Hoare quadruple {5295#true} {5529#(or (< main_~b~0 main_~a~0) (= main_~b~0 main_~a~0))} #76#return; {5529#(or (< main_~b~0 main_~a~0) (= main_~b~0 main_~a~0))} is VALID [2022-04-27 12:52:24,317 INFO L290 TraceCheckUtils]: 55: Hoare triple {5295#true} assume true; {5295#true} is VALID [2022-04-27 12:52:24,317 INFO L290 TraceCheckUtils]: 54: Hoare triple {5295#true} assume !(0 == ~cond); {5295#true} is VALID [2022-04-27 12:52:24,317 INFO L290 TraceCheckUtils]: 53: Hoare triple {5295#true} ~cond := #in~cond; {5295#true} is VALID [2022-04-27 12:52:24,317 INFO L272 TraceCheckUtils]: 52: Hoare triple {5529#(or (< main_~b~0 main_~a~0) (= main_~b~0 main_~a~0))} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {5295#true} is VALID [2022-04-27 12:52:24,318 INFO L284 TraceCheckUtils]: 51: Hoare quadruple {5295#true} {5529#(or (< main_~b~0 main_~a~0) (= main_~b~0 main_~a~0))} #74#return; {5529#(or (< main_~b~0 main_~a~0) (= main_~b~0 main_~a~0))} is VALID [2022-04-27 12:52:24,318 INFO L290 TraceCheckUtils]: 50: Hoare triple {5295#true} assume true; {5295#true} is VALID [2022-04-27 12:52:24,318 INFO L290 TraceCheckUtils]: 49: Hoare triple {5295#true} assume !(0 == ~cond); {5295#true} is VALID [2022-04-27 12:52:24,318 INFO L290 TraceCheckUtils]: 48: Hoare triple {5295#true} ~cond := #in~cond; {5295#true} is VALID [2022-04-27 12:52:24,318 INFO L272 TraceCheckUtils]: 47: Hoare triple {5529#(or (< main_~b~0 main_~a~0) (= main_~b~0 main_~a~0))} call __VERIFIER_assert((if 1 == ~p~0 * ~s~0 - ~r~0 * ~q~0 then 1 else 0)); {5295#true} is VALID [2022-04-27 12:52:24,318 INFO L290 TraceCheckUtils]: 46: Hoare triple {5529#(or (< main_~b~0 main_~a~0) (= main_~b~0 main_~a~0))} assume !false; {5529#(or (< main_~b~0 main_~a~0) (= main_~b~0 main_~a~0))} is VALID [2022-04-27 12:52:24,319 INFO L290 TraceCheckUtils]: 45: Hoare triple {5384#(<= main_~a~0 2)} assume ~a~0 > ~b~0;~a~0 := ~a~0 - ~b~0;~p~0 := ~p~0 - ~q~0;~r~0 := ~r~0 - ~s~0; {5529#(or (< main_~b~0 main_~a~0) (= main_~b~0 main_~a~0))} is VALID [2022-04-27 12:52:24,319 INFO L290 TraceCheckUtils]: 44: Hoare triple {5384#(<= main_~a~0 2)} assume !!(~a~0 != ~b~0); {5384#(<= main_~a~0 2)} is VALID [2022-04-27 12:52:24,320 INFO L284 TraceCheckUtils]: 43: Hoare quadruple {5295#true} {5384#(<= main_~a~0 2)} #78#return; {5384#(<= main_~a~0 2)} is VALID [2022-04-27 12:52:24,320 INFO L290 TraceCheckUtils]: 42: Hoare triple {5295#true} assume true; {5295#true} is VALID [2022-04-27 12:52:24,320 INFO L290 TraceCheckUtils]: 41: Hoare triple {5295#true} assume !(0 == ~cond); {5295#true} is VALID [2022-04-27 12:52:24,320 INFO L290 TraceCheckUtils]: 40: Hoare triple {5295#true} ~cond := #in~cond; {5295#true} is VALID [2022-04-27 12:52:24,320 INFO L272 TraceCheckUtils]: 39: Hoare triple {5384#(<= main_~a~0 2)} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {5295#true} is VALID [2022-04-27 12:52:24,320 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {5295#true} {5384#(<= main_~a~0 2)} #76#return; {5384#(<= main_~a~0 2)} is VALID [2022-04-27 12:52:24,321 INFO L290 TraceCheckUtils]: 37: Hoare triple {5295#true} assume true; {5295#true} is VALID [2022-04-27 12:52:24,321 INFO L290 TraceCheckUtils]: 36: Hoare triple {5295#true} assume !(0 == ~cond); {5295#true} is VALID [2022-04-27 12:52:24,321 INFO L290 TraceCheckUtils]: 35: Hoare triple {5295#true} ~cond := #in~cond; {5295#true} is VALID [2022-04-27 12:52:24,321 INFO L272 TraceCheckUtils]: 34: Hoare triple {5384#(<= main_~a~0 2)} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {5295#true} is VALID [2022-04-27 12:52:24,321 INFO L284 TraceCheckUtils]: 33: Hoare quadruple {5295#true} {5384#(<= main_~a~0 2)} #74#return; {5384#(<= main_~a~0 2)} is VALID [2022-04-27 12:52:24,321 INFO L290 TraceCheckUtils]: 32: Hoare triple {5295#true} assume true; {5295#true} is VALID [2022-04-27 12:52:24,321 INFO L290 TraceCheckUtils]: 31: Hoare triple {5295#true} assume !(0 == ~cond); {5295#true} is VALID [2022-04-27 12:52:24,321 INFO L290 TraceCheckUtils]: 30: Hoare triple {5295#true} ~cond := #in~cond; {5295#true} is VALID [2022-04-27 12:52:24,321 INFO L272 TraceCheckUtils]: 29: Hoare triple {5384#(<= main_~a~0 2)} call __VERIFIER_assert((if 1 == ~p~0 * ~s~0 - ~r~0 * ~q~0 then 1 else 0)); {5295#true} is VALID [2022-04-27 12:52:24,322 INFO L290 TraceCheckUtils]: 28: Hoare triple {5384#(<= main_~a~0 2)} assume !false; {5384#(<= main_~a~0 2)} is VALID [2022-04-27 12:52:24,322 INFO L290 TraceCheckUtils]: 27: Hoare triple {5635#(<= main_~x~0 2)} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1; {5384#(<= main_~a~0 2)} is VALID [2022-04-27 12:52:24,322 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {5295#true} {5635#(<= main_~x~0 2)} #72#return; {5635#(<= main_~x~0 2)} is VALID [2022-04-27 12:52:24,323 INFO L290 TraceCheckUtils]: 25: Hoare triple {5295#true} assume true; {5295#true} is VALID [2022-04-27 12:52:24,323 INFO L290 TraceCheckUtils]: 24: Hoare triple {5295#true} assume !(0 == ~cond); {5295#true} is VALID [2022-04-27 12:52:24,323 INFO L290 TraceCheckUtils]: 23: Hoare triple {5295#true} ~cond := #in~cond; {5295#true} is VALID [2022-04-27 12:52:24,323 INFO L272 TraceCheckUtils]: 22: Hoare triple {5635#(<= main_~x~0 2)} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {5295#true} is VALID [2022-04-27 12:52:24,323 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {5295#true} {5635#(<= main_~x~0 2)} #70#return; {5635#(<= main_~x~0 2)} is VALID [2022-04-27 12:52:24,323 INFO L290 TraceCheckUtils]: 20: Hoare triple {5295#true} assume true; {5295#true} is VALID [2022-04-27 12:52:24,323 INFO L290 TraceCheckUtils]: 19: Hoare triple {5295#true} assume !(0 == ~cond); {5295#true} is VALID [2022-04-27 12:52:24,323 INFO L290 TraceCheckUtils]: 18: Hoare triple {5295#true} ~cond := #in~cond; {5295#true} is VALID [2022-04-27 12:52:24,323 INFO L272 TraceCheckUtils]: 17: Hoare triple {5635#(<= main_~x~0 2)} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {5295#true} is VALID [2022-04-27 12:52:24,324 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {5295#true} {5635#(<= main_~x~0 2)} #68#return; {5635#(<= main_~x~0 2)} is VALID [2022-04-27 12:52:24,324 INFO L290 TraceCheckUtils]: 15: Hoare triple {5295#true} assume true; {5295#true} is VALID [2022-04-27 12:52:24,324 INFO L290 TraceCheckUtils]: 14: Hoare triple {5295#true} assume !(0 == ~cond); {5295#true} is VALID [2022-04-27 12:52:24,324 INFO L290 TraceCheckUtils]: 13: Hoare triple {5295#true} ~cond := #in~cond; {5295#true} is VALID [2022-04-27 12:52:24,324 INFO L272 TraceCheckUtils]: 12: Hoare triple {5635#(<= main_~x~0 2)} call assume_abort_if_not((if ~y~0 >= 0 && ~y~0 <= 2 then 1 else 0)); {5295#true} is VALID [2022-04-27 12:52:24,324 INFO L290 TraceCheckUtils]: 11: Hoare triple {5635#(<= main_~x~0 2)} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {5635#(<= main_~x~0 2)} is VALID [2022-04-27 12:52:24,325 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {5325#(not (= |assume_abort_if_not_#in~cond| 0))} {5295#true} #66#return; {5635#(<= main_~x~0 2)} is VALID [2022-04-27 12:52:24,325 INFO L290 TraceCheckUtils]: 9: Hoare triple {5325#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {5325#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-27 12:52:24,325 INFO L290 TraceCheckUtils]: 8: Hoare triple {5696#(or (not (= |assume_abort_if_not_#in~cond| 0)) (= assume_abort_if_not_~cond 0))} assume !(0 == ~cond); {5325#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-27 12:52:24,326 INFO L290 TraceCheckUtils]: 7: Hoare triple {5295#true} ~cond := #in~cond; {5696#(or (not (= |assume_abort_if_not_#in~cond| 0)) (= assume_abort_if_not_~cond 0))} is VALID [2022-04-27 12:52:24,326 INFO L272 TraceCheckUtils]: 6: Hoare triple {5295#true} call assume_abort_if_not((if ~x~0 >= 0 && ~x~0 <= 2 then 1 else 0)); {5295#true} is VALID [2022-04-27 12:52:24,326 INFO L290 TraceCheckUtils]: 5: Hoare triple {5295#true} havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~s~0;havoc ~x~0;havoc ~y~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4; {5295#true} is VALID [2022-04-27 12:52:24,326 INFO L272 TraceCheckUtils]: 4: Hoare triple {5295#true} call #t~ret6 := main(); {5295#true} is VALID [2022-04-27 12:52:24,326 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5295#true} {5295#true} #88#return; {5295#true} is VALID [2022-04-27 12:52:24,326 INFO L290 TraceCheckUtils]: 2: Hoare triple {5295#true} assume true; {5295#true} is VALID [2022-04-27 12:52:24,326 INFO L290 TraceCheckUtils]: 1: Hoare triple {5295#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(10, 2);call #Ultimate.allocInit(12, 3); {5295#true} is VALID [2022-04-27 12:52:24,326 INFO L272 TraceCheckUtils]: 0: Hoare triple {5295#true} call ULTIMATE.init(); {5295#true} is VALID [2022-04-27 12:52:24,326 INFO L134 CoverageAnalysis]: Checked inductivity of 106 backedges. 16 proven. 15 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2022-04-27 12:52:24,326 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 12:52:24,326 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1731545497] [2022-04-27 12:52:24,326 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 12:52:24,327 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1557222481] [2022-04-27 12:52:24,327 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1557222481] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 12:52:24,327 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-27 12:52:24,327 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 12 [2022-04-27 12:52:24,327 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [24999972] [2022-04-27 12:52:24,327 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-27 12:52:24,327 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.6666666666666665) internal successors, (32), 12 states have internal predecessors, (32), 7 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (18), 6 states have call predecessors, (18), 6 states have call successors, (18) Word has length 69 [2022-04-27 12:52:24,328 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 12:52:24,328 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 12 states, 12 states have (on average 2.6666666666666665) internal successors, (32), 12 states have internal predecessors, (32), 7 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (18), 6 states have call predecessors, (18), 6 states have call successors, (18) [2022-04-27 12:52:24,378 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-27 12:52:24,378 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-04-27 12:52:24,378 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 12:52:24,378 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-04-27 12:52:24,379 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2022-04-27 12:52:24,379 INFO L87 Difference]: Start difference. First operand 107 states and 119 transitions. Second operand has 12 states, 12 states have (on average 2.6666666666666665) internal successors, (32), 12 states have internal predecessors, (32), 7 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (18), 6 states have call predecessors, (18), 6 states have call successors, (18) [2022-04-27 12:52:24,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:52:24,801 INFO L93 Difference]: Finished difference Result 138 states and 152 transitions. [2022-04-27 12:52:24,801 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-27 12:52:24,801 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.6666666666666665) internal successors, (32), 12 states have internal predecessors, (32), 7 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (18), 6 states have call predecessors, (18), 6 states have call successors, (18) Word has length 69 [2022-04-27 12:52:24,802 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 12:52:24,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 2.6666666666666665) internal successors, (32), 12 states have internal predecessors, (32), 7 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (18), 6 states have call predecessors, (18), 6 states have call successors, (18) [2022-04-27 12:52:24,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 71 transitions. [2022-04-27 12:52:24,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 2.6666666666666665) internal successors, (32), 12 states have internal predecessors, (32), 7 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (18), 6 states have call predecessors, (18), 6 states have call successors, (18) [2022-04-27 12:52:24,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 71 transitions. [2022-04-27 12:52:24,804 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 9 states and 71 transitions. [2022-04-27 12:52:24,855 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 71 edges. 71 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 12:52:24,857 INFO L225 Difference]: With dead ends: 138 [2022-04-27 12:52:24,857 INFO L226 Difference]: Without dead ends: 86 [2022-04-27 12:52:24,857 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 142 GetRequests, 127 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=63, Invalid=209, Unknown=0, NotChecked=0, Total=272 [2022-04-27 12:52:24,858 INFO L413 NwaCegarLoop]: 37 mSDtfsCounter, 23 mSDsluCounter, 104 mSDsCounter, 0 mSdLazyCounter, 117 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 141 SdHoareTripleChecker+Invalid, 146 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 117 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-27 12:52:24,858 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 141 Invalid, 146 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 117 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-27 12:52:24,858 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2022-04-27 12:52:24,924 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 86. [2022-04-27 12:52:24,925 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 12:52:24,925 INFO L82 GeneralOperation]: Start isEquivalent. First operand 86 states. Second operand has 86 states, 52 states have (on average 1.0576923076923077) internal successors, (55), 54 states have internal predecessors, (55), 20 states have call successors, (20), 14 states have call predecessors, (20), 13 states have return successors, (18), 17 states have call predecessors, (18), 18 states have call successors, (18) [2022-04-27 12:52:24,925 INFO L74 IsIncluded]: Start isIncluded. First operand 86 states. Second operand has 86 states, 52 states have (on average 1.0576923076923077) internal successors, (55), 54 states have internal predecessors, (55), 20 states have call successors, (20), 14 states have call predecessors, (20), 13 states have return successors, (18), 17 states have call predecessors, (18), 18 states have call successors, (18) [2022-04-27 12:52:24,925 INFO L87 Difference]: Start difference. First operand 86 states. Second operand has 86 states, 52 states have (on average 1.0576923076923077) internal successors, (55), 54 states have internal predecessors, (55), 20 states have call successors, (20), 14 states have call predecessors, (20), 13 states have return successors, (18), 17 states have call predecessors, (18), 18 states have call successors, (18) [2022-04-27 12:52:24,926 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:52:24,927 INFO L93 Difference]: Finished difference Result 86 states and 93 transitions. [2022-04-27 12:52:24,927 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 93 transitions. [2022-04-27 12:52:24,927 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 12:52:24,927 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 12:52:24,927 INFO L74 IsIncluded]: Start isIncluded. First operand has 86 states, 52 states have (on average 1.0576923076923077) internal successors, (55), 54 states have internal predecessors, (55), 20 states have call successors, (20), 14 states have call predecessors, (20), 13 states have return successors, (18), 17 states have call predecessors, (18), 18 states have call successors, (18) Second operand 86 states. [2022-04-27 12:52:24,927 INFO L87 Difference]: Start difference. First operand has 86 states, 52 states have (on average 1.0576923076923077) internal successors, (55), 54 states have internal predecessors, (55), 20 states have call successors, (20), 14 states have call predecessors, (20), 13 states have return successors, (18), 17 states have call predecessors, (18), 18 states have call successors, (18) Second operand 86 states. [2022-04-27 12:52:24,928 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:52:24,928 INFO L93 Difference]: Finished difference Result 86 states and 93 transitions. [2022-04-27 12:52:24,928 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 93 transitions. [2022-04-27 12:52:24,929 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 12:52:24,929 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 12:52:24,929 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 12:52:24,929 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 12:52:24,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 52 states have (on average 1.0576923076923077) internal successors, (55), 54 states have internal predecessors, (55), 20 states have call successors, (20), 14 states have call predecessors, (20), 13 states have return successors, (18), 17 states have call predecessors, (18), 18 states have call successors, (18) [2022-04-27 12:52:24,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 93 transitions. [2022-04-27 12:52:24,930 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 93 transitions. Word has length 69 [2022-04-27 12:52:24,930 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 12:52:24,930 INFO L495 AbstractCegarLoop]: Abstraction has 86 states and 93 transitions. [2022-04-27 12:52:24,931 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 2.6666666666666665) internal successors, (32), 12 states have internal predecessors, (32), 7 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (18), 6 states have call predecessors, (18), 6 states have call successors, (18) [2022-04-27 12:52:24,931 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 93 transitions. [2022-04-27 12:52:24,931 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2022-04-27 12:52:24,931 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 12:52:24,931 INFO L195 NwaCegarLoop]: trace histogram [7, 6, 6, 4, 4, 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, 1, 1] [2022-04-27 12:52:24,949 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-04-27 12:52:25,132 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2022-04-27 12:52:25,132 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 12:52:25,132 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 12:52:25,132 INFO L85 PathProgramCache]: Analyzing trace with hash 1872855628, now seen corresponding path program 2 times [2022-04-27 12:52:25,133 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 12:52:25,133 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [708486479] [2022-04-27 12:52:25,133 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 12:52:25,133 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 12:52:25,143 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 12:52:25,144 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [930462167] [2022-04-27 12:52:25,144 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-27 12:52:25,144 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 12:52:25,144 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 12:52:25,145 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-27 12:52:25,175 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-27 12:52:25,184 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-27 12:52:25,184 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-27 12:52:25,184 INFO L263 TraceCheckSpWp]: Trace formula consists of 177 conjuncts, 10 conjunts are in the unsatisfiable core [2022-04-27 12:52:25,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 12:52:25,214 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 12:52:25,565 INFO L272 TraceCheckUtils]: 0: Hoare triple {6224#true} call ULTIMATE.init(); {6224#true} is VALID [2022-04-27 12:52:25,565 INFO L290 TraceCheckUtils]: 1: Hoare triple {6224#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(10, 2);call #Ultimate.allocInit(12, 3); {6224#true} is VALID [2022-04-27 12:52:25,565 INFO L290 TraceCheckUtils]: 2: Hoare triple {6224#true} assume true; {6224#true} is VALID [2022-04-27 12:52:25,565 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6224#true} {6224#true} #88#return; {6224#true} is VALID [2022-04-27 12:52:25,565 INFO L272 TraceCheckUtils]: 4: Hoare triple {6224#true} call #t~ret6 := main(); {6224#true} is VALID [2022-04-27 12:52:25,565 INFO L290 TraceCheckUtils]: 5: Hoare triple {6224#true} havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~s~0;havoc ~x~0;havoc ~y~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4; {6224#true} is VALID [2022-04-27 12:52:25,565 INFO L272 TraceCheckUtils]: 6: Hoare triple {6224#true} call assume_abort_if_not((if ~x~0 >= 0 && ~x~0 <= 2 then 1 else 0)); {6224#true} is VALID [2022-04-27 12:52:25,565 INFO L290 TraceCheckUtils]: 7: Hoare triple {6224#true} ~cond := #in~cond; {6224#true} is VALID [2022-04-27 12:52:25,565 INFO L290 TraceCheckUtils]: 8: Hoare triple {6224#true} assume !(0 == ~cond); {6224#true} is VALID [2022-04-27 12:52:25,565 INFO L290 TraceCheckUtils]: 9: Hoare triple {6224#true} assume true; {6224#true} is VALID [2022-04-27 12:52:25,565 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {6224#true} {6224#true} #66#return; {6224#true} is VALID [2022-04-27 12:52:25,565 INFO L290 TraceCheckUtils]: 11: Hoare triple {6224#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {6224#true} is VALID [2022-04-27 12:52:25,566 INFO L272 TraceCheckUtils]: 12: Hoare triple {6224#true} call assume_abort_if_not((if ~y~0 >= 0 && ~y~0 <= 2 then 1 else 0)); {6224#true} is VALID [2022-04-27 12:52:25,566 INFO L290 TraceCheckUtils]: 13: Hoare triple {6224#true} ~cond := #in~cond; {6268#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-04-27 12:52:25,566 INFO L290 TraceCheckUtils]: 14: Hoare triple {6268#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} assume !(0 == ~cond); {6272#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-27 12:52:25,566 INFO L290 TraceCheckUtils]: 15: Hoare triple {6272#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {6272#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-27 12:52:25,567 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {6272#(not (= |assume_abort_if_not_#in~cond| 0))} {6224#true} #68#return; {6279#(and (<= 0 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-27 12:52:25,567 INFO L272 TraceCheckUtils]: 17: Hoare triple {6279#(and (<= 0 main_~y~0) (<= main_~y~0 2))} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {6224#true} is VALID [2022-04-27 12:52:25,567 INFO L290 TraceCheckUtils]: 18: Hoare triple {6224#true} ~cond := #in~cond; {6224#true} is VALID [2022-04-27 12:52:25,567 INFO L290 TraceCheckUtils]: 19: Hoare triple {6224#true} assume !(0 == ~cond); {6224#true} is VALID [2022-04-27 12:52:25,567 INFO L290 TraceCheckUtils]: 20: Hoare triple {6224#true} assume true; {6224#true} is VALID [2022-04-27 12:52:25,568 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {6224#true} {6279#(and (<= 0 main_~y~0) (<= main_~y~0 2))} #70#return; {6279#(and (<= 0 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-27 12:52:25,568 INFO L272 TraceCheckUtils]: 22: Hoare triple {6279#(and (<= 0 main_~y~0) (<= main_~y~0 2))} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {6224#true} is VALID [2022-04-27 12:52:25,568 INFO L290 TraceCheckUtils]: 23: Hoare triple {6224#true} ~cond := #in~cond; {6224#true} is VALID [2022-04-27 12:52:25,568 INFO L290 TraceCheckUtils]: 24: Hoare triple {6224#true} assume !(0 == ~cond); {6224#true} is VALID [2022-04-27 12:52:25,568 INFO L290 TraceCheckUtils]: 25: Hoare triple {6224#true} assume true; {6224#true} is VALID [2022-04-27 12:52:25,568 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {6224#true} {6279#(and (<= 0 main_~y~0) (<= main_~y~0 2))} #72#return; {6279#(and (<= 0 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-27 12:52:25,569 INFO L290 TraceCheckUtils]: 27: Hoare triple {6279#(and (<= 0 main_~y~0) (<= main_~y~0 2))} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1; {6313#(<= main_~b~0 2)} is VALID [2022-04-27 12:52:25,569 INFO L290 TraceCheckUtils]: 28: Hoare triple {6313#(<= main_~b~0 2)} assume !false; {6313#(<= main_~b~0 2)} is VALID [2022-04-27 12:52:25,569 INFO L272 TraceCheckUtils]: 29: Hoare triple {6313#(<= main_~b~0 2)} call __VERIFIER_assert((if 1 == ~p~0 * ~s~0 - ~r~0 * ~q~0 then 1 else 0)); {6224#true} is VALID [2022-04-27 12:52:25,569 INFO L290 TraceCheckUtils]: 30: Hoare triple {6224#true} ~cond := #in~cond; {6224#true} is VALID [2022-04-27 12:52:25,569 INFO L290 TraceCheckUtils]: 31: Hoare triple {6224#true} assume !(0 == ~cond); {6224#true} is VALID [2022-04-27 12:52:25,569 INFO L290 TraceCheckUtils]: 32: Hoare triple {6224#true} assume true; {6224#true} is VALID [2022-04-27 12:52:25,570 INFO L284 TraceCheckUtils]: 33: Hoare quadruple {6224#true} {6313#(<= main_~b~0 2)} #74#return; {6313#(<= main_~b~0 2)} is VALID [2022-04-27 12:52:25,570 INFO L272 TraceCheckUtils]: 34: Hoare triple {6313#(<= main_~b~0 2)} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {6224#true} is VALID [2022-04-27 12:52:25,570 INFO L290 TraceCheckUtils]: 35: Hoare triple {6224#true} ~cond := #in~cond; {6224#true} is VALID [2022-04-27 12:52:25,570 INFO L290 TraceCheckUtils]: 36: Hoare triple {6224#true} assume !(0 == ~cond); {6224#true} is VALID [2022-04-27 12:52:25,570 INFO L290 TraceCheckUtils]: 37: Hoare triple {6224#true} assume true; {6224#true} is VALID [2022-04-27 12:52:25,570 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {6224#true} {6313#(<= main_~b~0 2)} #76#return; {6313#(<= main_~b~0 2)} is VALID [2022-04-27 12:52:25,570 INFO L272 TraceCheckUtils]: 39: Hoare triple {6313#(<= main_~b~0 2)} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {6224#true} is VALID [2022-04-27 12:52:25,570 INFO L290 TraceCheckUtils]: 40: Hoare triple {6224#true} ~cond := #in~cond; {6224#true} is VALID [2022-04-27 12:52:25,571 INFO L290 TraceCheckUtils]: 41: Hoare triple {6224#true} assume !(0 == ~cond); {6224#true} is VALID [2022-04-27 12:52:25,571 INFO L290 TraceCheckUtils]: 42: Hoare triple {6224#true} assume true; {6224#true} is VALID [2022-04-27 12:52:25,571 INFO L284 TraceCheckUtils]: 43: Hoare quadruple {6224#true} {6313#(<= main_~b~0 2)} #78#return; {6313#(<= main_~b~0 2)} is VALID [2022-04-27 12:52:25,571 INFO L290 TraceCheckUtils]: 44: Hoare triple {6313#(<= main_~b~0 2)} assume !!(~a~0 != ~b~0); {6365#(and (<= main_~b~0 2) (not (= main_~b~0 main_~a~0)))} is VALID [2022-04-27 12:52:25,572 INFO L290 TraceCheckUtils]: 45: Hoare triple {6365#(and (<= main_~b~0 2) (not (= main_~b~0 main_~a~0)))} assume !(~a~0 > ~b~0);~b~0 := ~b~0 - ~a~0;~q~0 := ~q~0 - ~p~0;~s~0 := ~s~0 - ~r~0; {6369#(and (< main_~a~0 2) (< 0 main_~b~0))} is VALID [2022-04-27 12:52:25,572 INFO L290 TraceCheckUtils]: 46: Hoare triple {6369#(and (< main_~a~0 2) (< 0 main_~b~0))} assume !false; {6369#(and (< main_~a~0 2) (< 0 main_~b~0))} is VALID [2022-04-27 12:52:25,572 INFO L272 TraceCheckUtils]: 47: Hoare triple {6369#(and (< main_~a~0 2) (< 0 main_~b~0))} call __VERIFIER_assert((if 1 == ~p~0 * ~s~0 - ~r~0 * ~q~0 then 1 else 0)); {6224#true} is VALID [2022-04-27 12:52:25,573 INFO L290 TraceCheckUtils]: 48: Hoare triple {6224#true} ~cond := #in~cond; {6224#true} is VALID [2022-04-27 12:52:25,573 INFO L290 TraceCheckUtils]: 49: Hoare triple {6224#true} assume !(0 == ~cond); {6224#true} is VALID [2022-04-27 12:52:25,573 INFO L290 TraceCheckUtils]: 50: Hoare triple {6224#true} assume true; {6224#true} is VALID [2022-04-27 12:52:25,573 INFO L284 TraceCheckUtils]: 51: Hoare quadruple {6224#true} {6369#(and (< main_~a~0 2) (< 0 main_~b~0))} #74#return; {6369#(and (< main_~a~0 2) (< 0 main_~b~0))} is VALID [2022-04-27 12:52:25,573 INFO L272 TraceCheckUtils]: 52: Hoare triple {6369#(and (< main_~a~0 2) (< 0 main_~b~0))} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {6224#true} is VALID [2022-04-27 12:52:25,573 INFO L290 TraceCheckUtils]: 53: Hoare triple {6224#true} ~cond := #in~cond; {6224#true} is VALID [2022-04-27 12:52:25,573 INFO L290 TraceCheckUtils]: 54: Hoare triple {6224#true} assume !(0 == ~cond); {6224#true} is VALID [2022-04-27 12:52:25,573 INFO L290 TraceCheckUtils]: 55: Hoare triple {6224#true} assume true; {6224#true} is VALID [2022-04-27 12:52:25,574 INFO L284 TraceCheckUtils]: 56: Hoare quadruple {6224#true} {6369#(and (< main_~a~0 2) (< 0 main_~b~0))} #76#return; {6369#(and (< main_~a~0 2) (< 0 main_~b~0))} is VALID [2022-04-27 12:52:25,574 INFO L272 TraceCheckUtils]: 57: Hoare triple {6369#(and (< main_~a~0 2) (< 0 main_~b~0))} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {6224#true} is VALID [2022-04-27 12:52:25,574 INFO L290 TraceCheckUtils]: 58: Hoare triple {6224#true} ~cond := #in~cond; {6224#true} is VALID [2022-04-27 12:52:25,574 INFO L290 TraceCheckUtils]: 59: Hoare triple {6224#true} assume !(0 == ~cond); {6224#true} is VALID [2022-04-27 12:52:25,574 INFO L290 TraceCheckUtils]: 60: Hoare triple {6224#true} assume true; {6224#true} is VALID [2022-04-27 12:52:25,575 INFO L284 TraceCheckUtils]: 61: Hoare quadruple {6224#true} {6369#(and (< main_~a~0 2) (< 0 main_~b~0))} #78#return; {6369#(and (< main_~a~0 2) (< 0 main_~b~0))} is VALID [2022-04-27 12:52:25,575 INFO L290 TraceCheckUtils]: 62: Hoare triple {6369#(and (< main_~a~0 2) (< 0 main_~b~0))} assume !!(~a~0 != ~b~0); {6369#(and (< main_~a~0 2) (< 0 main_~b~0))} is VALID [2022-04-27 12:52:25,576 INFO L290 TraceCheckUtils]: 63: Hoare triple {6369#(and (< main_~a~0 2) (< 0 main_~b~0))} assume ~a~0 > ~b~0;~a~0 := ~a~0 - ~b~0;~p~0 := ~p~0 - ~q~0;~r~0 := ~r~0 - ~s~0; {6225#false} is VALID [2022-04-27 12:52:25,576 INFO L290 TraceCheckUtils]: 64: Hoare triple {6225#false} assume !false; {6225#false} is VALID [2022-04-27 12:52:25,576 INFO L272 TraceCheckUtils]: 65: Hoare triple {6225#false} call __VERIFIER_assert((if 1 == ~p~0 * ~s~0 - ~r~0 * ~q~0 then 1 else 0)); {6225#false} is VALID [2022-04-27 12:52:25,576 INFO L290 TraceCheckUtils]: 66: Hoare triple {6225#false} ~cond := #in~cond; {6225#false} is VALID [2022-04-27 12:52:25,576 INFO L290 TraceCheckUtils]: 67: Hoare triple {6225#false} assume 0 == ~cond; {6225#false} is VALID [2022-04-27 12:52:25,576 INFO L290 TraceCheckUtils]: 68: Hoare triple {6225#false} assume !false; {6225#false} is VALID [2022-04-27 12:52:25,576 INFO L134 CoverageAnalysis]: Checked inductivity of 106 backedges. 19 proven. 12 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2022-04-27 12:52:25,576 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 12:52:25,937 INFO L290 TraceCheckUtils]: 68: Hoare triple {6225#false} assume !false; {6225#false} is VALID [2022-04-27 12:52:25,937 INFO L290 TraceCheckUtils]: 67: Hoare triple {6225#false} assume 0 == ~cond; {6225#false} is VALID [2022-04-27 12:52:25,937 INFO L290 TraceCheckUtils]: 66: Hoare triple {6225#false} ~cond := #in~cond; {6225#false} is VALID [2022-04-27 12:52:25,937 INFO L272 TraceCheckUtils]: 65: Hoare triple {6225#false} call __VERIFIER_assert((if 1 == ~p~0 * ~s~0 - ~r~0 * ~q~0 then 1 else 0)); {6225#false} is VALID [2022-04-27 12:52:25,937 INFO L290 TraceCheckUtils]: 64: Hoare triple {6225#false} assume !false; {6225#false} is VALID [2022-04-27 12:52:25,938 INFO L290 TraceCheckUtils]: 63: Hoare triple {6454#(not (< main_~b~0 main_~a~0))} assume ~a~0 > ~b~0;~a~0 := ~a~0 - ~b~0;~p~0 := ~p~0 - ~q~0;~r~0 := ~r~0 - ~s~0; {6225#false} is VALID [2022-04-27 12:52:25,938 INFO L290 TraceCheckUtils]: 62: Hoare triple {6454#(not (< main_~b~0 main_~a~0))} assume !!(~a~0 != ~b~0); {6454#(not (< main_~b~0 main_~a~0))} is VALID [2022-04-27 12:52:25,939 INFO L284 TraceCheckUtils]: 61: Hoare quadruple {6224#true} {6454#(not (< main_~b~0 main_~a~0))} #78#return; {6454#(not (< main_~b~0 main_~a~0))} is VALID [2022-04-27 12:52:25,939 INFO L290 TraceCheckUtils]: 60: Hoare triple {6224#true} assume true; {6224#true} is VALID [2022-04-27 12:52:25,939 INFO L290 TraceCheckUtils]: 59: Hoare triple {6224#true} assume !(0 == ~cond); {6224#true} is VALID [2022-04-27 12:52:25,939 INFO L290 TraceCheckUtils]: 58: Hoare triple {6224#true} ~cond := #in~cond; {6224#true} is VALID [2022-04-27 12:52:25,939 INFO L272 TraceCheckUtils]: 57: Hoare triple {6454#(not (< main_~b~0 main_~a~0))} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {6224#true} is VALID [2022-04-27 12:52:25,939 INFO L284 TraceCheckUtils]: 56: Hoare quadruple {6224#true} {6454#(not (< main_~b~0 main_~a~0))} #76#return; {6454#(not (< main_~b~0 main_~a~0))} is VALID [2022-04-27 12:52:25,939 INFO L290 TraceCheckUtils]: 55: Hoare triple {6224#true} assume true; {6224#true} is VALID [2022-04-27 12:52:25,939 INFO L290 TraceCheckUtils]: 54: Hoare triple {6224#true} assume !(0 == ~cond); {6224#true} is VALID [2022-04-27 12:52:25,940 INFO L290 TraceCheckUtils]: 53: Hoare triple {6224#true} ~cond := #in~cond; {6224#true} is VALID [2022-04-27 12:52:25,940 INFO L272 TraceCheckUtils]: 52: Hoare triple {6454#(not (< main_~b~0 main_~a~0))} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {6224#true} is VALID [2022-04-27 12:52:25,940 INFO L284 TraceCheckUtils]: 51: Hoare quadruple {6224#true} {6454#(not (< main_~b~0 main_~a~0))} #74#return; {6454#(not (< main_~b~0 main_~a~0))} is VALID [2022-04-27 12:52:25,940 INFO L290 TraceCheckUtils]: 50: Hoare triple {6224#true} assume true; {6224#true} is VALID [2022-04-27 12:52:25,940 INFO L290 TraceCheckUtils]: 49: Hoare triple {6224#true} assume !(0 == ~cond); {6224#true} is VALID [2022-04-27 12:52:25,940 INFO L290 TraceCheckUtils]: 48: Hoare triple {6224#true} ~cond := #in~cond; {6224#true} is VALID [2022-04-27 12:52:25,940 INFO L272 TraceCheckUtils]: 47: Hoare triple {6454#(not (< main_~b~0 main_~a~0))} call __VERIFIER_assert((if 1 == ~p~0 * ~s~0 - ~r~0 * ~q~0 then 1 else 0)); {6224#true} is VALID [2022-04-27 12:52:25,941 INFO L290 TraceCheckUtils]: 46: Hoare triple {6454#(not (< main_~b~0 main_~a~0))} assume !false; {6454#(not (< main_~b~0 main_~a~0))} is VALID [2022-04-27 12:52:25,941 INFO L290 TraceCheckUtils]: 45: Hoare triple {6509#(or (< main_~b~0 main_~a~0) (<= (* main_~a~0 2) main_~b~0))} assume !(~a~0 > ~b~0);~b~0 := ~b~0 - ~a~0;~q~0 := ~q~0 - ~p~0;~s~0 := ~s~0 - ~r~0; {6454#(not (< main_~b~0 main_~a~0))} is VALID [2022-04-27 12:52:25,942 INFO L290 TraceCheckUtils]: 44: Hoare triple {6313#(<= main_~b~0 2)} assume !!(~a~0 != ~b~0); {6509#(or (< main_~b~0 main_~a~0) (<= (* main_~a~0 2) main_~b~0))} is VALID [2022-04-27 12:52:25,942 INFO L284 TraceCheckUtils]: 43: Hoare quadruple {6224#true} {6313#(<= main_~b~0 2)} #78#return; {6313#(<= main_~b~0 2)} is VALID [2022-04-27 12:52:25,943 INFO L290 TraceCheckUtils]: 42: Hoare triple {6224#true} assume true; {6224#true} is VALID [2022-04-27 12:52:25,943 INFO L290 TraceCheckUtils]: 41: Hoare triple {6224#true} assume !(0 == ~cond); {6224#true} is VALID [2022-04-27 12:52:25,943 INFO L290 TraceCheckUtils]: 40: Hoare triple {6224#true} ~cond := #in~cond; {6224#true} is VALID [2022-04-27 12:52:25,943 INFO L272 TraceCheckUtils]: 39: Hoare triple {6313#(<= main_~b~0 2)} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {6224#true} is VALID [2022-04-27 12:52:25,943 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {6224#true} {6313#(<= main_~b~0 2)} #76#return; {6313#(<= main_~b~0 2)} is VALID [2022-04-27 12:52:25,943 INFO L290 TraceCheckUtils]: 37: Hoare triple {6224#true} assume true; {6224#true} is VALID [2022-04-27 12:52:25,943 INFO L290 TraceCheckUtils]: 36: Hoare triple {6224#true} assume !(0 == ~cond); {6224#true} is VALID [2022-04-27 12:52:25,943 INFO L290 TraceCheckUtils]: 35: Hoare triple {6224#true} ~cond := #in~cond; {6224#true} is VALID [2022-04-27 12:52:25,943 INFO L272 TraceCheckUtils]: 34: Hoare triple {6313#(<= main_~b~0 2)} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {6224#true} is VALID [2022-04-27 12:52:25,944 INFO L284 TraceCheckUtils]: 33: Hoare quadruple {6224#true} {6313#(<= main_~b~0 2)} #74#return; {6313#(<= main_~b~0 2)} is VALID [2022-04-27 12:52:25,944 INFO L290 TraceCheckUtils]: 32: Hoare triple {6224#true} assume true; {6224#true} is VALID [2022-04-27 12:52:25,944 INFO L290 TraceCheckUtils]: 31: Hoare triple {6224#true} assume !(0 == ~cond); {6224#true} is VALID [2022-04-27 12:52:25,944 INFO L290 TraceCheckUtils]: 30: Hoare triple {6224#true} ~cond := #in~cond; {6224#true} is VALID [2022-04-27 12:52:25,944 INFO L272 TraceCheckUtils]: 29: Hoare triple {6313#(<= main_~b~0 2)} call __VERIFIER_assert((if 1 == ~p~0 * ~s~0 - ~r~0 * ~q~0 then 1 else 0)); {6224#true} is VALID [2022-04-27 12:52:25,944 INFO L290 TraceCheckUtils]: 28: Hoare triple {6313#(<= main_~b~0 2)} assume !false; {6313#(<= main_~b~0 2)} is VALID [2022-04-27 12:52:25,945 INFO L290 TraceCheckUtils]: 27: Hoare triple {6564#(<= main_~y~0 2)} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1; {6313#(<= main_~b~0 2)} is VALID [2022-04-27 12:52:25,945 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {6224#true} {6564#(<= main_~y~0 2)} #72#return; {6564#(<= main_~y~0 2)} is VALID [2022-04-27 12:52:25,945 INFO L290 TraceCheckUtils]: 25: Hoare triple {6224#true} assume true; {6224#true} is VALID [2022-04-27 12:52:25,945 INFO L290 TraceCheckUtils]: 24: Hoare triple {6224#true} assume !(0 == ~cond); {6224#true} is VALID [2022-04-27 12:52:25,945 INFO L290 TraceCheckUtils]: 23: Hoare triple {6224#true} ~cond := #in~cond; {6224#true} is VALID [2022-04-27 12:52:25,945 INFO L272 TraceCheckUtils]: 22: Hoare triple {6564#(<= main_~y~0 2)} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {6224#true} is VALID [2022-04-27 12:52:25,946 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {6224#true} {6564#(<= main_~y~0 2)} #70#return; {6564#(<= main_~y~0 2)} is VALID [2022-04-27 12:52:25,946 INFO L290 TraceCheckUtils]: 20: Hoare triple {6224#true} assume true; {6224#true} is VALID [2022-04-27 12:52:25,946 INFO L290 TraceCheckUtils]: 19: Hoare triple {6224#true} assume !(0 == ~cond); {6224#true} is VALID [2022-04-27 12:52:25,946 INFO L290 TraceCheckUtils]: 18: Hoare triple {6224#true} ~cond := #in~cond; {6224#true} is VALID [2022-04-27 12:52:25,946 INFO L272 TraceCheckUtils]: 17: Hoare triple {6564#(<= main_~y~0 2)} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {6224#true} is VALID [2022-04-27 12:52:25,946 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {6272#(not (= |assume_abort_if_not_#in~cond| 0))} {6224#true} #68#return; {6564#(<= main_~y~0 2)} is VALID [2022-04-27 12:52:25,947 INFO L290 TraceCheckUtils]: 15: Hoare triple {6272#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {6272#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-27 12:52:25,947 INFO L290 TraceCheckUtils]: 14: Hoare triple {6607#(or (not (= |assume_abort_if_not_#in~cond| 0)) (= assume_abort_if_not_~cond 0))} assume !(0 == ~cond); {6272#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-27 12:52:25,947 INFO L290 TraceCheckUtils]: 13: Hoare triple {6224#true} ~cond := #in~cond; {6607#(or (not (= |assume_abort_if_not_#in~cond| 0)) (= assume_abort_if_not_~cond 0))} is VALID [2022-04-27 12:52:25,947 INFO L272 TraceCheckUtils]: 12: Hoare triple {6224#true} call assume_abort_if_not((if ~y~0 >= 0 && ~y~0 <= 2 then 1 else 0)); {6224#true} is VALID [2022-04-27 12:52:25,948 INFO L290 TraceCheckUtils]: 11: Hoare triple {6224#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {6224#true} is VALID [2022-04-27 12:52:25,948 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {6224#true} {6224#true} #66#return; {6224#true} is VALID [2022-04-27 12:52:25,948 INFO L290 TraceCheckUtils]: 9: Hoare triple {6224#true} assume true; {6224#true} is VALID [2022-04-27 12:52:25,948 INFO L290 TraceCheckUtils]: 8: Hoare triple {6224#true} assume !(0 == ~cond); {6224#true} is VALID [2022-04-27 12:52:25,948 INFO L290 TraceCheckUtils]: 7: Hoare triple {6224#true} ~cond := #in~cond; {6224#true} is VALID [2022-04-27 12:52:25,948 INFO L272 TraceCheckUtils]: 6: Hoare triple {6224#true} call assume_abort_if_not((if ~x~0 >= 0 && ~x~0 <= 2 then 1 else 0)); {6224#true} is VALID [2022-04-27 12:52:25,948 INFO L290 TraceCheckUtils]: 5: Hoare triple {6224#true} havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~s~0;havoc ~x~0;havoc ~y~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4; {6224#true} is VALID [2022-04-27 12:52:25,948 INFO L272 TraceCheckUtils]: 4: Hoare triple {6224#true} call #t~ret6 := main(); {6224#true} is VALID [2022-04-27 12:52:25,948 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6224#true} {6224#true} #88#return; {6224#true} is VALID [2022-04-27 12:52:25,948 INFO L290 TraceCheckUtils]: 2: Hoare triple {6224#true} assume true; {6224#true} is VALID [2022-04-27 12:52:25,948 INFO L290 TraceCheckUtils]: 1: Hoare triple {6224#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(10, 2);call #Ultimate.allocInit(12, 3); {6224#true} is VALID [2022-04-27 12:52:25,948 INFO L272 TraceCheckUtils]: 0: Hoare triple {6224#true} call ULTIMATE.init(); {6224#true} is VALID [2022-04-27 12:52:25,948 INFO L134 CoverageAnalysis]: Checked inductivity of 106 backedges. 19 proven. 12 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2022-04-27 12:52:25,948 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 12:52:25,949 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [708486479] [2022-04-27 12:52:25,949 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 12:52:25,949 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [930462167] [2022-04-27 12:52:25,949 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [930462167] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 12:52:25,949 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-27 12:52:25,949 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 12 [2022-04-27 12:52:25,949 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [101082773] [2022-04-27 12:52:25,949 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-27 12:52:25,950 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.6666666666666665) internal successors, (32), 10 states have internal predecessors, (32), 7 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (17), 6 states have call predecessors, (17), 6 states have call successors, (17) Word has length 69 [2022-04-27 12:52:25,950 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 12:52:25,950 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 12 states, 12 states have (on average 2.6666666666666665) internal successors, (32), 10 states have internal predecessors, (32), 7 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (17), 6 states have call predecessors, (17), 6 states have call successors, (17) [2022-04-27 12:52:25,999 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 67 edges. 67 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 12:52:25,999 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-04-27 12:52:25,999 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 12:52:26,000 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-04-27 12:52:26,000 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2022-04-27 12:52:26,000 INFO L87 Difference]: Start difference. First operand 86 states and 93 transitions. Second operand has 12 states, 12 states have (on average 2.6666666666666665) internal successors, (32), 10 states have internal predecessors, (32), 7 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (17), 6 states have call predecessors, (17), 6 states have call successors, (17) [2022-04-27 12:52:26,418 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:52:26,418 INFO L93 Difference]: Finished difference Result 90 states and 96 transitions. [2022-04-27 12:52:26,418 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-27 12:52:26,419 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.6666666666666665) internal successors, (32), 10 states have internal predecessors, (32), 7 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (17), 6 states have call predecessors, (17), 6 states have call successors, (17) Word has length 69 [2022-04-27 12:52:26,419 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 12:52:26,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 2.6666666666666665) internal successors, (32), 10 states have internal predecessors, (32), 7 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (17), 6 states have call predecessors, (17), 6 states have call successors, (17) [2022-04-27 12:52:26,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 61 transitions. [2022-04-27 12:52:26,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 2.6666666666666665) internal successors, (32), 10 states have internal predecessors, (32), 7 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (17), 6 states have call predecessors, (17), 6 states have call successors, (17) [2022-04-27 12:52:26,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 61 transitions. [2022-04-27 12:52:26,420 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 9 states and 61 transitions. [2022-04-27 12:52:26,483 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 61 edges. 61 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 12:52:26,483 INFO L225 Difference]: With dead ends: 90 [2022-04-27 12:52:26,483 INFO L226 Difference]: Without dead ends: 0 [2022-04-27 12:52:26,483 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 142 GetRequests, 126 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=59, Invalid=213, Unknown=0, NotChecked=0, Total=272 [2022-04-27 12:52:26,484 INFO L413 NwaCegarLoop]: 30 mSDtfsCounter, 13 mSDsluCounter, 144 mSDsCounter, 0 mSdLazyCounter, 145 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 174 SdHoareTripleChecker+Invalid, 163 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 145 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-27 12:52:26,484 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 174 Invalid, 163 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 145 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-27 12:52:26,484 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-04-27 12:52:26,484 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-04-27 12:52:26,484 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 12:52:26,484 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-27 12:52:26,485 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-27 12:52:26,485 INFO L87 Difference]: Start difference. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-27 12:52:26,485 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:52:26,485 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-27 12:52:26,485 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-27 12:52:26,485 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 12:52:26,485 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 12:52:26,485 INFO L74 IsIncluded]: Start isIncluded. First operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 0 states. [2022-04-27 12:52:26,485 INFO L87 Difference]: Start difference. First operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 0 states. [2022-04-27 12:52:26,485 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:52:26,485 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-27 12:52:26,485 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-27 12:52:26,485 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 12:52:26,485 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 12:52:26,485 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 12:52:26,485 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 12:52:26,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-27 12:52:26,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-04-27 12:52:26,486 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 69 [2022-04-27 12:52:26,486 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 12:52:26,486 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-04-27 12:52:26,486 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 2.6666666666666665) internal successors, (32), 10 states have internal predecessors, (32), 7 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (17), 6 states have call predecessors, (17), 6 states have call successors, (17) [2022-04-27 12:52:26,486 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-27 12:52:26,486 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 12:52:26,488 INFO L805 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-04-27 12:52:26,505 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-27 12:52:26,699 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2022-04-27 12:52:26,701 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-04-27 12:52:29,182 INFO L899 garLoopResultBuilder]: For program point reach_errorEXIT(line 4) no Hoare annotation was computed. [2022-04-27 12:52:29,184 INFO L899 garLoopResultBuilder]: For program point reach_errorENTRY(line 4) no Hoare annotation was computed. [2022-04-27 12:52:29,184 INFO L899 garLoopResultBuilder]: For program point reach_errorFINAL(line 4) no Hoare annotation was computed. [2022-04-27 12:52:29,184 INFO L902 garLoopResultBuilder]: At program point assume_abort_if_notENTRY(lines 7 9) the Hoare annotation is: true [2022-04-27 12:52:29,184 INFO L899 garLoopResultBuilder]: For program point L8(line 8) no Hoare annotation was computed. [2022-04-27 12:52:29,184 INFO L899 garLoopResultBuilder]: For program point L8-2(lines 7 9) no Hoare annotation was computed. [2022-04-27 12:52:29,185 INFO L899 garLoopResultBuilder]: For program point assume_abort_if_notEXIT(lines 7 9) no Hoare annotation was computed. [2022-04-27 12:52:29,185 INFO L895 garLoopResultBuilder]: At program point L35-2(lines 35 52) the Hoare annotation is: (let ((.cse0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))) (let ((.cse1 (<= 1 main_~x~0)) (.cse2 (= main_~s~0 1)) (.cse3 (= main_~a~0 .cse0)) (.cse4 (<= 1 main_~y~0)) (.cse5 (= main_~p~0 1))) (or (and (= main_~b~0 .cse0) (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) .cse1 (<= main_~y~0 2) .cse2 .cse3 .cse4 (= main_~a~0 main_~x~0) .cse5) (and (= main_~b~0 main_~a~0) .cse1 .cse2 .cse3 (= main_~b~0 main_~y~0) (= main_~q~0 0) .cse4 (<= main_~x~0 2) .cse5)))) [2022-04-27 12:52:29,185 INFO L895 garLoopResultBuilder]: At program point L25(line 25) the Hoare annotation is: (and (<= 0 main_~y~0) (<= 1 main_~x~0) (<= main_~y~0 2) (<= main_~x~0 2)) [2022-04-27 12:52:29,185 INFO L899 garLoopResultBuilder]: For program point mainEXIT(lines 18 59) no Hoare annotation was computed. [2022-04-27 12:52:29,186 INFO L895 garLoopResultBuilder]: At program point L56(line 56) the Hoare annotation is: (let ((.cse1 (<= 1 main_~x~0)) (.cse2 (<= main_~y~0 2)) (.cse3 (<= 1 main_~y~0)) (.cse4 (<= main_~x~0 2))) (or (let ((.cse0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))) (and (= main_~b~0 .cse0) (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) .cse1 .cse2 (= main_~a~0 .cse0) .cse3 .cse4)) (and .cse1 .cse2 (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) .cse3 .cse4))) [2022-04-27 12:52:29,186 INFO L895 garLoopResultBuilder]: At program point L54(line 54) the Hoare annotation is: (let ((.cse0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))) (let ((.cse1 (<= 1 main_~x~0)) (.cse2 (= main_~s~0 1)) (.cse3 (= main_~a~0 .cse0)) (.cse4 (<= 1 main_~y~0)) (.cse5 (= main_~p~0 1))) (or (and (= main_~b~0 .cse0) (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) .cse1 (<= main_~y~0 2) .cse2 .cse3 .cse4 (= main_~a~0 main_~x~0) .cse5) (and (= main_~b~0 main_~a~0) .cse1 .cse2 .cse3 (= main_~b~0 main_~y~0) (= main_~q~0 0) .cse4 (<= main_~x~0 2) .cse5)))) [2022-04-27 12:52:29,186 INFO L899 garLoopResultBuilder]: For program point mainFINAL(lines 18 59) no Hoare annotation was computed. [2022-04-27 12:52:29,186 INFO L899 garLoopResultBuilder]: For program point L38(lines 35 52) no Hoare annotation was computed. [2022-04-27 12:52:29,187 INFO L895 garLoopResultBuilder]: At program point L36(line 36) the Hoare annotation is: (let ((.cse1 (<= main_~y~0 2)) (.cse2 (= main_~s~0 1)) (.cse7 (= main_~a~0 main_~x~0)) (.cse10 (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))) (.cse0 (<= 1 main_~x~0)) (.cse3 (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))) (.cse4 (= main_~b~0 main_~y~0)) (.cse5 (= main_~q~0 0)) (.cse6 (<= 1 main_~y~0)) (.cse8 (<= main_~x~0 2)) (.cse9 (= main_~p~0 1))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9) (and .cse10 .cse0 .cse1 .cse2 .cse3 (< main_~a~0 2) (< 0 main_~b~0) .cse6 .cse7 .cse9) (and .cse10 .cse0 .cse3 .cse4 (< 0 main_~a~0) .cse5 .cse6 (< main_~b~0 2) .cse8 .cse9))) [2022-04-27 12:52:29,187 INFO L895 garLoopResultBuilder]: At program point L36-1(line 36) the Hoare annotation is: (let ((.cse1 (<= main_~y~0 2)) (.cse2 (= main_~s~0 1)) (.cse7 (= main_~a~0 main_~x~0)) (.cse10 (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))) (.cse0 (<= 1 main_~x~0)) (.cse3 (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))) (.cse4 (= main_~b~0 main_~y~0)) (.cse5 (= main_~q~0 0)) (.cse6 (<= 1 main_~y~0)) (.cse8 (<= main_~x~0 2)) (.cse9 (= main_~p~0 1))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9) (and .cse10 .cse0 .cse1 .cse2 .cse3 (< main_~a~0 2) (< 0 main_~b~0) .cse6 .cse7 .cse9) (and .cse10 .cse0 .cse3 .cse4 (< 0 main_~a~0) .cse5 .cse6 (< main_~b~0 2) .cse8 .cse9))) [2022-04-27 12:52:29,187 INFO L902 garLoopResultBuilder]: At program point mainENTRY(lines 18 59) the Hoare annotation is: true [2022-04-27 12:52:29,187 INFO L899 garLoopResultBuilder]: For program point L26(line 26) no Hoare annotation was computed. [2022-04-27 12:52:29,187 INFO L899 garLoopResultBuilder]: For program point L57(line 57) no Hoare annotation was computed. [2022-04-27 12:52:29,187 INFO L895 garLoopResultBuilder]: At program point L24(line 24) the Hoare annotation is: (and (<= 0 main_~x~0) (<= main_~x~0 2)) [2022-04-27 12:52:29,187 INFO L895 garLoopResultBuilder]: At program point L24-1(line 24) the Hoare annotation is: (and (<= 0 main_~y~0) (<= main_~y~0 2) (<= 0 main_~x~0) (<= main_~x~0 2)) [2022-04-27 12:52:29,187 INFO L895 garLoopResultBuilder]: At program point L55(line 55) the Hoare annotation is: (let ((.cse5 (= main_~a~0 main_~x~0)) (.cse1 (<= 1 main_~x~0)) (.cse2 (<= main_~y~0 2)) (.cse3 (= main_~s~0 1)) (.cse7 (= main_~b~0 main_~y~0)) (.cse8 (= main_~q~0 0)) (.cse4 (<= 1 main_~y~0)) (.cse9 (<= main_~x~0 2)) (.cse6 (= main_~p~0 1))) (or (let ((.cse0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))) (and (= main_~b~0 .cse0) (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) .cse1 .cse2 .cse3 (= main_~a~0 .cse0) .cse4 .cse5 .cse6)) (and (= main_~r~0 0) .cse1 .cse2 .cse3 .cse7 .cse8 .cse4 .cse5 .cse9 .cse6) (and (= main_~b~0 main_~a~0) .cse1 .cse2 .cse3 .cse7 .cse8 .cse4 .cse9 .cse6))) [2022-04-27 12:52:29,187 INFO L902 garLoopResultBuilder]: At program point L22(line 22) the Hoare annotation is: true [2022-04-27 12:52:29,187 INFO L899 garLoopResultBuilder]: For program point L22-1(line 22) no Hoare annotation was computed. [2022-04-27 12:52:29,187 INFO L899 garLoopResultBuilder]: For program point L43(lines 43 51) no Hoare annotation was computed. [2022-04-27 12:52:29,187 INFO L895 garLoopResultBuilder]: At program point L43-2(lines 35 52) the Hoare annotation is: (let ((.cse1 (<= main_~y~0 2)) (.cse2 (= main_~s~0 1)) (.cse7 (= main_~a~0 main_~x~0)) (.cse10 (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))) (.cse0 (<= 1 main_~x~0)) (.cse3 (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))) (.cse4 (= main_~b~0 main_~y~0)) (.cse5 (= main_~q~0 0)) (.cse6 (<= 1 main_~y~0)) (.cse8 (<= main_~x~0 2)) (.cse9 (= main_~p~0 1))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9) (and .cse10 .cse0 .cse1 .cse2 .cse3 (< main_~a~0 2) (< 0 main_~b~0) .cse6 .cse7 .cse9) (and .cse10 .cse0 .cse3 .cse4 (< 0 main_~a~0) .cse5 .cse6 (< main_~b~0 2) .cse8 .cse9))) [2022-04-27 12:52:29,187 INFO L895 garLoopResultBuilder]: At program point L37(line 37) the Hoare annotation is: (let ((.cse3 (= main_~b~0 main_~y~0)) (.cse4 (= main_~q~0 0)) (.cse6 (<= main_~x~0 2)) (.cse0 (<= 1 main_~x~0)) (.cse8 (<= main_~y~0 2)) (.cse1 (= main_~s~0 1)) (.cse2 (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))) (.cse5 (<= 1 main_~y~0)) (.cse9 (= main_~a~0 main_~x~0)) (.cse7 (= main_~p~0 1))) (or (and .cse0 .cse1 .cse2 .cse3 (< 0 main_~a~0) .cse4 .cse5 (< main_~b~0 2) .cse6 .cse7) (and .cse0 .cse8 .cse1 .cse2 .cse3 .cse4 .cse5 .cse9 .cse6 .cse7) (and (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) .cse0 .cse8 .cse1 .cse2 (< main_~a~0 2) (< 0 main_~b~0) .cse5 .cse9 .cse7))) [2022-04-27 12:52:29,187 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2022-04-27 12:52:29,188 INFO L895 garLoopResultBuilder]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|)) [2022-04-27 12:52:29,188 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2022-04-27 12:52:29,188 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-04-27 12:52:29,188 INFO L902 garLoopResultBuilder]: At program point L-1(line -1) the Hoare annotation is: true [2022-04-27 12:52:29,188 INFO L902 garLoopResultBuilder]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2022-04-27 12:52:29,188 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2022-04-27 12:52:29,188 INFO L902 garLoopResultBuilder]: At program point __VERIFIER_assertENTRY(lines 10 16) the Hoare annotation is: true [2022-04-27 12:52:29,188 INFO L899 garLoopResultBuilder]: For program point L12(lines 12 13) no Hoare annotation was computed. [2022-04-27 12:52:29,188 INFO L899 garLoopResultBuilder]: For program point L11(lines 11 14) no Hoare annotation was computed. [2022-04-27 12:52:29,189 INFO L899 garLoopResultBuilder]: For program point __VERIFIER_assertEXIT(lines 10 16) no Hoare annotation was computed. [2022-04-27 12:52:29,189 INFO L899 garLoopResultBuilder]: For program point L11-2(lines 10 16) no Hoare annotation was computed. [2022-04-27 12:52:29,189 INFO L899 garLoopResultBuilder]: For program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 13) no Hoare annotation was computed. [2022-04-27 12:52:29,198 INFO L356 BasicCegarLoop]: Path program histogram: [2, 2, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 12:52:29,202 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-04-27 12:52:29,206 WARN L170 areAnnotationChecker]: reach_errorENTRY has no Hoare annotation [2022-04-27 12:52:29,206 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2022-04-27 12:52:29,206 WARN L170 areAnnotationChecker]: L8 has no Hoare annotation [2022-04-27 12:52:29,206 WARN L170 areAnnotationChecker]: L11 has no Hoare annotation [2022-04-27 12:52:29,207 WARN L170 areAnnotationChecker]: reach_errorFINAL has no Hoare annotation [2022-04-27 12:52:29,207 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2022-04-27 12:52:29,207 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2022-04-27 12:52:29,207 WARN L170 areAnnotationChecker]: L8 has no Hoare annotation [2022-04-27 12:52:29,207 WARN L170 areAnnotationChecker]: L8 has no Hoare annotation [2022-04-27 12:52:29,207 WARN L170 areAnnotationChecker]: L22-1 has no Hoare annotation [2022-04-27 12:52:29,207 WARN L170 areAnnotationChecker]: L11 has no Hoare annotation [2022-04-27 12:52:29,207 WARN L170 areAnnotationChecker]: L11 has no Hoare annotation [2022-04-27 12:52:29,207 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2022-04-27 12:52:29,207 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2022-04-27 12:52:29,207 WARN L170 areAnnotationChecker]: L8-2 has no Hoare annotation [2022-04-27 12:52:29,207 WARN L170 areAnnotationChecker]: L22-1 has no Hoare annotation [2022-04-27 12:52:29,207 WARN L170 areAnnotationChecker]: L12 has no Hoare annotation [2022-04-27 12:52:29,207 WARN L170 areAnnotationChecker]: L12 has no Hoare annotation [2022-04-27 12:52:29,207 WARN L170 areAnnotationChecker]: L11-2 has no Hoare annotation [2022-04-27 12:52:29,207 WARN L170 areAnnotationChecker]: assume_abort_if_notEXIT has no Hoare annotation [2022-04-27 12:52:29,207 WARN L170 areAnnotationChecker]: assume_abort_if_notEXIT has no Hoare annotation [2022-04-27 12:52:29,207 WARN L170 areAnnotationChecker]: assume_abort_if_notEXIT has no Hoare annotation [2022-04-27 12:52:29,207 WARN L170 areAnnotationChecker]: assume_abort_if_notEXIT has no Hoare annotation [2022-04-27 12:52:29,207 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-27 12:52:29,207 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-27 12:52:29,207 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-27 12:52:29,208 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-27 12:52:29,208 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-27 12:52:29,208 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-27 12:52:29,208 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-27 12:52:29,208 WARN L170 areAnnotationChecker]: L26 has no Hoare annotation [2022-04-27 12:52:29,208 WARN L170 areAnnotationChecker]: L26 has no Hoare annotation [2022-04-27 12:52:29,208 WARN L170 areAnnotationChecker]: L38 has no Hoare annotation [2022-04-27 12:52:29,208 WARN L170 areAnnotationChecker]: L38 has no Hoare annotation [2022-04-27 12:52:29,208 WARN L170 areAnnotationChecker]: L38 has no Hoare annotation [2022-04-27 12:52:29,208 WARN L170 areAnnotationChecker]: L57 has no Hoare annotation [2022-04-27 12:52:29,208 WARN L170 areAnnotationChecker]: L57 has no Hoare annotation [2022-04-27 12:52:29,213 WARN L170 areAnnotationChecker]: L43 has no Hoare annotation [2022-04-27 12:52:29,214 WARN L170 areAnnotationChecker]: L43 has no Hoare annotation [2022-04-27 12:52:29,214 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2022-04-27 12:52:29,214 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2022-04-27 12:52:29,214 INFO L163 areAnnotationChecker]: CFG has 17 edges. 17 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2022-04-27 12:52:29,224 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.04 12:52:29 BoogieIcfgContainer [2022-04-27 12:52:29,224 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-04-27 12:52:29,225 INFO L158 Benchmark]: Toolchain (without parser) took 77302.17ms. Allocated memory was 177.2MB in the beginning and 220.2MB in the end (delta: 43.0MB). Free memory was 125.6MB in the beginning and 139.9MB in the end (delta: -14.3MB). Peak memory consumption was 101.3MB. Max. memory is 8.0GB. [2022-04-27 12:52:29,225 INFO L158 Benchmark]: CDTParser took 0.10ms. Allocated memory is still 177.2MB. Free memory is still 142.2MB. There was no memory consumed. Max. memory is 8.0GB. [2022-04-27 12:52:29,225 INFO L158 Benchmark]: CACSL2BoogieTranslator took 259.02ms. Allocated memory is still 177.2MB. Free memory was 125.4MB in the beginning and 150.7MB in the end (delta: -25.3MB). Peak memory consumption was 13.7MB. Max. memory is 8.0GB. [2022-04-27 12:52:29,225 INFO L158 Benchmark]: Boogie Preprocessor took 30.85ms. Allocated memory is still 177.2MB. Free memory was 150.7MB in the beginning and 149.1MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-04-27 12:52:29,225 INFO L158 Benchmark]: RCFGBuilder took 285.51ms. Allocated memory is still 177.2MB. Free memory was 149.1MB in the beginning and 137.6MB in the end (delta: 11.5MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2022-04-27 12:52:29,226 INFO L158 Benchmark]: TraceAbstraction took 76716.93ms. Allocated memory was 177.2MB in the beginning and 220.2MB in the end (delta: 43.0MB). Free memory was 136.9MB in the beginning and 139.9MB in the end (delta: -3.0MB). Peak memory consumption was 112.8MB. Max. memory is 8.0GB. [2022-04-27 12:52:29,227 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - AssertionsEnabledResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.10ms. Allocated memory is still 177.2MB. Free memory is still 142.2MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 259.02ms. Allocated memory is still 177.2MB. Free memory was 125.4MB in the beginning and 150.7MB in the end (delta: -25.3MB). Peak memory consumption was 13.7MB. Max. memory is 8.0GB. * Boogie Preprocessor took 30.85ms. Allocated memory is still 177.2MB. Free memory was 150.7MB in the beginning and 149.1MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 285.51ms. Allocated memory is still 177.2MB. Free memory was 149.1MB in the beginning and 137.6MB in the end (delta: 11.5MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * TraceAbstraction took 76716.93ms. Allocated memory was 177.2MB in the beginning and 220.2MB in the end (delta: 43.0MB). Free memory was 136.9MB in the beginning and 139.9MB in the end (delta: -3.0MB). Peak memory consumption was 112.8MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 13]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 6 procedures, 40 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 76.6s, OverallIterations: 11, TraceHistogramMax: 7, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 8.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 2.5s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 280 SdHoareTripleChecker+Valid, 3.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 216 mSDsluCounter, 1589 SdHoareTripleChecker+Invalid, 3.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1194 mSDsCounter, 249 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1840 IncrementalHoareTripleChecker+Invalid, 2089 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 249 mSolverCounterUnsat, 395 mSDtfsCounter, 1840 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 869 GetRequests, 750 SyntacticMatches, 6 SemanticMatches, 113 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 209 ImplicationChecksByTransitivity, 1.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=107occurred in iteration=9, InterpolantAutomatonStates: 95, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.7s AutomataMinimizationTime, 11 MinimizatonAttempts, 40 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 18 LocationsWithAnnotation, 69 PreInvPairs, 101 NumberOfFragments, 867 HoareAnnotationTreeSize, 69 FomulaSimplifications, 594 FormulaSimplificationTreeSizeReduction, 0.3s HoareSimplificationTime, 18 FomulaSimplificationsInter, 2458 FormulaSimplificationTreeSizeReductionInter, 2.1s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 61.0s InterpolantComputationTime, 556 NumberOfCodeBlocks, 556 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 849 ConstructedInterpolants, 0 QuantifiedInterpolants, 2635 SizeOfPredicates, 38 NumberOfNonLiveVariables, 1423 ConjunctsInSsa, 187 ConjunctsInUnsatCore, 16 InterpolantComputations, 6 PerfectInterpolantSequences, 908/1002 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 35]: Loop Invariant Derived loop invariant: ((((((((((1 <= x && y <= 2) && s == 1) && a == y * r + p * x) && b == y) && q == 0) && 1 <= y) && a == x) && x <= 2) && p == 1) || (((((((((b == q * x + y * s && 1 <= x) && y <= 2) && s == 1) && a == y * r + p * x) && a < 2) && 0 < b) && 1 <= y) && a == x) && p == 1)) || (((((((((b == q * x + y * s && 1 <= x) && a == y * r + p * x) && b == y) && 0 < a) && q == 0) && 1 <= y) && b < 2) && x <= 2) && p == 1) RESULT: Ultimate proved your program to be correct! [2022-04-27 12:52:29,248 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...