/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/egcd3-ll_valuebound50.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-fb4f59a-m [2022-04-27 13:13:27,239 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-27 13:13:27,241 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-27 13:13:27,276 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-27 13:13:27,277 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-27 13:13:27,278 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-27 13:13:27,290 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-27 13:13:27,291 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-27 13:13:27,294 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-27 13:13:27,298 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-27 13:13:27,299 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-27 13:13:27,301 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-27 13:13:27,301 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-27 13:13:27,303 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-27 13:13:27,304 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-27 13:13:27,305 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-27 13:13:27,306 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-27 13:13:27,307 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-27 13:13:27,312 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-27 13:13:27,317 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-27 13:13:27,319 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-27 13:13:27,320 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-27 13:13:27,321 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-27 13:13:27,322 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-27 13:13:27,322 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-27 13:13:27,324 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-27 13:13:27,325 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-27 13:13:27,325 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-27 13:13:27,325 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-27 13:13:27,326 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-27 13:13:27,326 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-27 13:13:27,326 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-27 13:13:27,331 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-27 13:13:27,332 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-27 13:13:27,333 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-27 13:13:27,334 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-27 13:13:27,334 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-27 13:13:27,334 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-27 13:13:27,335 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-27 13:13:27,335 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-27 13:13:27,335 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-27 13:13:27,337 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-27 13:13:27,337 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 13:13:27,371 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-27 13:13:27,371 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-27 13:13:27,371 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-04-27 13:13:27,372 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-04-27 13:13:27,372 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-04-27 13:13:27,372 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-04-27 13:13:27,373 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-04-27 13:13:27,373 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-04-27 13:13:27,373 INFO L138 SettingsManager]: * Use SBE=true [2022-04-27 13:13:27,374 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-27 13:13:27,374 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-27 13:13:27,374 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-27 13:13:27,374 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-27 13:13:27,374 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-27 13:13:27,374 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-27 13:13:27,374 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-27 13:13:27,375 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-27 13:13:27,375 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-27 13:13:27,375 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-27 13:13:27,375 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-27 13:13:27,375 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-27 13:13:27,375 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-27 13:13:27,375 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-27 13:13:27,376 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-27 13:13:27,376 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-27 13:13:27,376 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-27 13:13:27,376 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-04-27 13:13:27,376 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-04-27 13:13:27,376 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-04-27 13:13:27,376 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-04-27 13:13:27,377 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-04-27 13:13:27,377 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-04-27 13:13:27,377 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-27 13:13:27,377 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 13:13:27,586 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-27 13:13:27,606 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-27 13:13:27,608 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-27 13:13:27,609 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-27 13:13:27,609 INFO L275 PluginConnector]: CDTParser initialized [2022-04-27 13:13:27,610 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/nla-digbench-scaling/egcd3-ll_valuebound50.c [2022-04-27 13:13:27,658 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6b9092c42/ca1fcde7818d4e53bec4cb959a6c5914/FLAG871eb90e6 [2022-04-27 13:13:28,066 INFO L306 CDTParser]: Found 1 translation units. [2022-04-27 13:13:28,067 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/egcd3-ll_valuebound50.c [2022-04-27 13:13:28,077 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6b9092c42/ca1fcde7818d4e53bec4cb959a6c5914/FLAG871eb90e6 [2022-04-27 13:13:28,089 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6b9092c42/ca1fcde7818d4e53bec4cb959a6c5914 [2022-04-27 13:13:28,091 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-27 13:13:28,092 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-27 13:13:28,094 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-27 13:13:28,094 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-27 13:13:28,096 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-27 13:13:28,097 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.04 01:13:28" (1/1) ... [2022-04-27 13:13:28,098 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7b53f8b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 01:13:28, skipping insertion in model container [2022-04-27 13:13:28,098 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.04 01:13:28" (1/1) ... [2022-04-27 13:13:28,103 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-27 13:13:28,121 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-27 13:13:28,258 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/egcd3-ll_valuebound50.c[490,503] [2022-04-27 13:13:28,280 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-27 13:13:28,287 INFO L203 MainTranslator]: Completed pre-run [2022-04-27 13:13:28,297 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/egcd3-ll_valuebound50.c[490,503] [2022-04-27 13:13:28,307 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-27 13:13:28,317 INFO L208 MainTranslator]: Completed translation [2022-04-27 13:13:28,317 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 01:13:28 WrapperNode [2022-04-27 13:13:28,317 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-27 13:13:28,318 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-27 13:13:28,318 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-27 13:13:28,318 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-27 13:13:28,325 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 01:13:28" (1/1) ... [2022-04-27 13:13:28,325 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 01:13:28" (1/1) ... [2022-04-27 13:13:28,330 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 01:13:28" (1/1) ... [2022-04-27 13:13:28,330 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 01:13:28" (1/1) ... [2022-04-27 13:13:28,336 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 01:13:28" (1/1) ... [2022-04-27 13:13:28,340 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 01:13:28" (1/1) ... [2022-04-27 13:13:28,341 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 01:13:28" (1/1) ... [2022-04-27 13:13:28,342 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-27 13:13:28,343 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-27 13:13:28,343 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-27 13:13:28,343 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-27 13:13:28,344 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 01:13:28" (1/1) ... [2022-04-27 13:13:28,356 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-27 13:13:28,366 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 13:13:28,375 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 13:13:28,394 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 13:13:28,405 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-27 13:13:28,406 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-27 13:13:28,406 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-27 13:13:28,406 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-27 13:13:28,406 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-27 13:13:28,406 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-27 13:13:28,406 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-27 13:13:28,406 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-27 13:13:28,406 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-27 13:13:28,407 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-27 13:13:28,407 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-04-27 13:13:28,407 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-27 13:13:28,407 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-27 13:13:28,407 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-27 13:13:28,407 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-27 13:13:28,407 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-27 13:13:28,407 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-27 13:13:28,408 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-27 13:13:28,408 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-27 13:13:28,408 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-27 13:13:28,454 INFO L234 CfgBuilder]: Building ICFG [2022-04-27 13:13:28,455 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-27 13:13:28,712 INFO L275 CfgBuilder]: Performing block encoding [2022-04-27 13:13:28,719 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-27 13:13:28,730 INFO L299 CfgBuilder]: Removed 3 assume(true) statements. [2022-04-27 13:13:28,732 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.04 01:13:28 BoogieIcfgContainer [2022-04-27 13:13:28,732 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-27 13:13:28,734 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-27 13:13:28,734 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-27 13:13:28,737 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-27 13:13:28,737 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.04 01:13:28" (1/3) ... [2022-04-27 13:13:28,738 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@44a2d014 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.04 01:13:28, skipping insertion in model container [2022-04-27 13:13:28,738 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 01:13:28" (2/3) ... [2022-04-27 13:13:28,738 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@44a2d014 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.04 01:13:28, skipping insertion in model container [2022-04-27 13:13:28,738 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.04 01:13:28" (3/3) ... [2022-04-27 13:13:28,739 INFO L111 eAbstractionObserver]: Analyzing ICFG egcd3-ll_valuebound50.c [2022-04-27 13:13:28,754 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-04-27 13:13:28,754 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-27 13:13:28,819 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-27 13:13:28,828 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@3b9fc068, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@5af36b3 [2022-04-27 13:13:28,828 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-27 13:13:28,836 INFO L276 IsEmpty]: Start isEmpty. Operand has 40 states, 23 states have (on average 1.5217391304347827) internal successors, (35), 24 states have internal predecessors, (35), 11 states have call successors, (11), 4 states have call predecessors, (11), 4 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-27 13:13:28,844 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-04-27 13:13:28,844 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 13:13:28,845 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 13:13:28,845 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 13:13:28,850 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 13:13:28,850 INFO L85 PathProgramCache]: Analyzing trace with hash 1237885594, now seen corresponding path program 1 times [2022-04-27 13:13:28,858 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 13:13:28,859 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [73556929] [2022-04-27 13:13:28,860 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 13:13:28,860 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 13:13:28,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 13:13:29,052 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 13:13:29,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 13:13:29,078 INFO L290 TraceCheckUtils]: 0: Hoare triple {64#(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(11, 2);call #Ultimate.allocInit(12, 3); {43#true} is VALID [2022-04-27 13:13:29,079 INFO L290 TraceCheckUtils]: 1: Hoare triple {43#true} assume true; {43#true} is VALID [2022-04-27 13:13:29,079 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {43#true} {43#true} #112#return; {43#true} is VALID [2022-04-27 13:13:29,080 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-27 13:13:29,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 13:13:29,090 INFO L290 TraceCheckUtils]: 0: Hoare triple {43#true} ~cond := #in~cond; {43#true} is VALID [2022-04-27 13:13:29,111 INFO L290 TraceCheckUtils]: 1: Hoare triple {43#true} assume 0 == ~cond;assume false; {44#false} is VALID [2022-04-27 13:13:29,111 INFO L290 TraceCheckUtils]: 2: Hoare triple {44#false} assume true; {44#false} is VALID [2022-04-27 13:13:29,112 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {44#false} {43#true} #94#return; {44#false} is VALID [2022-04-27 13:13:29,112 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-04-27 13:13:29,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 13:13:29,118 INFO L290 TraceCheckUtils]: 0: Hoare triple {43#true} ~cond := #in~cond; {43#true} is VALID [2022-04-27 13:13:29,119 INFO L290 TraceCheckUtils]: 1: Hoare triple {43#true} assume 0 == ~cond;assume false; {44#false} is VALID [2022-04-27 13:13:29,119 INFO L290 TraceCheckUtils]: 2: Hoare triple {44#false} assume true; {44#false} is VALID [2022-04-27 13:13:29,119 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {44#false} {44#false} #96#return; {44#false} is VALID [2022-04-27 13:13:29,120 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-04-27 13:13:29,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 13:13:29,126 INFO L290 TraceCheckUtils]: 0: Hoare triple {43#true} ~cond := #in~cond; {43#true} is VALID [2022-04-27 13:13:29,127 INFO L290 TraceCheckUtils]: 1: Hoare triple {43#true} assume 0 == ~cond;assume false; {44#false} is VALID [2022-04-27 13:13:29,127 INFO L290 TraceCheckUtils]: 2: Hoare triple {44#false} assume true; {44#false} is VALID [2022-04-27 13:13:29,127 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {44#false} {44#false} #98#return; {44#false} is VALID [2022-04-27 13:13:29,128 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-04-27 13:13:29,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 13:13:29,133 INFO L290 TraceCheckUtils]: 0: Hoare triple {43#true} ~cond := #in~cond; {43#true} is VALID [2022-04-27 13:13:29,134 INFO L290 TraceCheckUtils]: 1: Hoare triple {43#true} assume 0 == ~cond;assume false; {44#false} is VALID [2022-04-27 13:13:29,134 INFO L290 TraceCheckUtils]: 2: Hoare triple {44#false} assume true; {44#false} is VALID [2022-04-27 13:13:29,134 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {44#false} {44#false} #100#return; {44#false} is VALID [2022-04-27 13:13:29,135 INFO L272 TraceCheckUtils]: 0: Hoare triple {43#true} call ULTIMATE.init(); {64#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 13:13:29,135 INFO L290 TraceCheckUtils]: 1: Hoare triple {64#(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(11, 2);call #Ultimate.allocInit(12, 3); {43#true} is VALID [2022-04-27 13:13:29,136 INFO L290 TraceCheckUtils]: 2: Hoare triple {43#true} assume true; {43#true} is VALID [2022-04-27 13:13:29,136 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {43#true} {43#true} #112#return; {43#true} is VALID [2022-04-27 13:13:29,136 INFO L272 TraceCheckUtils]: 4: Hoare triple {43#true} call #t~ret6 := main(); {43#true} is VALID [2022-04-27 13:13:29,136 INFO L290 TraceCheckUtils]: 5: Hoare triple {43#true} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~s~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4; {43#true} is VALID [2022-04-27 13:13:29,137 INFO L272 TraceCheckUtils]: 6: Hoare triple {43#true} call assume_abort_if_not((if ~x~0 >= 0 && ~x~0 <= 50 then 1 else 0)); {43#true} is VALID [2022-04-27 13:13:29,137 INFO L290 TraceCheckUtils]: 7: Hoare triple {43#true} ~cond := #in~cond; {43#true} is VALID [2022-04-27 13:13:29,137 INFO L290 TraceCheckUtils]: 8: Hoare triple {43#true} assume 0 == ~cond;assume false; {44#false} is VALID [2022-04-27 13:13:29,137 INFO L290 TraceCheckUtils]: 9: Hoare triple {44#false} assume true; {44#false} is VALID [2022-04-27 13:13:29,138 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {44#false} {43#true} #94#return; {44#false} is VALID [2022-04-27 13:13:29,138 INFO L290 TraceCheckUtils]: 11: Hoare triple {44#false} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {44#false} is VALID [2022-04-27 13:13:29,138 INFO L272 TraceCheckUtils]: 12: Hoare triple {44#false} call assume_abort_if_not((if ~y~0 >= 0 && ~y~0 <= 50 then 1 else 0)); {43#true} is VALID [2022-04-27 13:13:29,138 INFO L290 TraceCheckUtils]: 13: Hoare triple {43#true} ~cond := #in~cond; {43#true} is VALID [2022-04-27 13:13:29,139 INFO L290 TraceCheckUtils]: 14: Hoare triple {43#true} assume 0 == ~cond;assume false; {44#false} is VALID [2022-04-27 13:13:29,139 INFO L290 TraceCheckUtils]: 15: Hoare triple {44#false} assume true; {44#false} is VALID [2022-04-27 13:13:29,139 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {44#false} {44#false} #96#return; {44#false} is VALID [2022-04-27 13:13:29,139 INFO L272 TraceCheckUtils]: 17: Hoare triple {44#false} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {43#true} is VALID [2022-04-27 13:13:29,140 INFO L290 TraceCheckUtils]: 18: Hoare triple {43#true} ~cond := #in~cond; {43#true} is VALID [2022-04-27 13:13:29,140 INFO L290 TraceCheckUtils]: 19: Hoare triple {43#true} assume 0 == ~cond;assume false; {44#false} is VALID [2022-04-27 13:13:29,140 INFO L290 TraceCheckUtils]: 20: Hoare triple {44#false} assume true; {44#false} is VALID [2022-04-27 13:13:29,141 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {44#false} {44#false} #98#return; {44#false} is VALID [2022-04-27 13:13:29,141 INFO L272 TraceCheckUtils]: 22: Hoare triple {44#false} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {43#true} is VALID [2022-04-27 13:13:29,141 INFO L290 TraceCheckUtils]: 23: Hoare triple {43#true} ~cond := #in~cond; {43#true} is VALID [2022-04-27 13:13:29,141 INFO L290 TraceCheckUtils]: 24: Hoare triple {43#true} assume 0 == ~cond;assume false; {44#false} is VALID [2022-04-27 13:13:29,142 INFO L290 TraceCheckUtils]: 25: Hoare triple {44#false} assume true; {44#false} is VALID [2022-04-27 13:13:29,142 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {44#false} {44#false} #100#return; {44#false} is VALID [2022-04-27 13:13:29,142 INFO L290 TraceCheckUtils]: 27: Hoare triple {44#false} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1; {44#false} is VALID [2022-04-27 13:13:29,142 INFO L290 TraceCheckUtils]: 28: Hoare triple {44#false} assume false; {44#false} is VALID [2022-04-27 13:13:29,142 INFO L272 TraceCheckUtils]: 29: Hoare triple {44#false} call __VERIFIER_assert((if ~p~0 * ~x~0 - ~q~0 * ~x~0 + ~r~0 * ~y~0 - ~s~0 * ~y~0 == ~a~0 then 1 else 0)); {44#false} is VALID [2022-04-27 13:13:29,143 INFO L290 TraceCheckUtils]: 30: Hoare triple {44#false} ~cond := #in~cond; {44#false} is VALID [2022-04-27 13:13:29,143 INFO L290 TraceCheckUtils]: 31: Hoare triple {44#false} assume 0 == ~cond; {44#false} is VALID [2022-04-27 13:13:29,143 INFO L290 TraceCheckUtils]: 32: Hoare triple {44#false} assume !false; {44#false} is VALID [2022-04-27 13:13:29,143 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 13:13:29,144 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 13:13:29,144 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [73556929] [2022-04-27 13:13:29,145 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [73556929] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 13:13:29,145 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 13:13:29,145 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-27 13:13:29,146 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1223504656] [2022-04-27 13:13:29,147 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 13:13:29,151 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 13:13:29,152 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 13:13:29,155 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 13:13:29,186 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 13:13:29,187 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-27 13:13:29,187 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 13:13:29,216 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-27 13:13:29,217 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-27 13:13:29,221 INFO L87 Difference]: Start difference. First operand has 40 states, 23 states have (on average 1.5217391304347827) internal successors, (35), 24 states have internal predecessors, (35), 11 states have call successors, (11), 4 states have call predecessors, (11), 4 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) 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 13:13:29,441 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:13:29,441 INFO L93 Difference]: Finished difference Result 73 states and 115 transitions. [2022-04-27 13:13:29,441 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-27 13:13:29,442 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 13:13:29,442 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 13:13:29,443 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 13:13:29,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 115 transitions. [2022-04-27 13:13:29,464 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 13:13:29,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 115 transitions. [2022-04-27 13:13:29,473 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 115 transitions. [2022-04-27 13:13:29,606 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 115 edges. 115 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 13:13:29,616 INFO L225 Difference]: With dead ends: 73 [2022-04-27 13:13:29,616 INFO L226 Difference]: Without dead ends: 35 [2022-04-27 13:13:29,619 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 13:13:29,622 INFO L413 NwaCegarLoop]: 40 mSDtfsCounter, 24 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 43 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 13:13:29,623 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 43 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 13:13:29,636 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2022-04-27 13:13:29,653 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2022-04-27 13:13:29,654 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 13:13:29,654 INFO L82 GeneralOperation]: Start isEquivalent. First operand 35 states. Second operand has 35 states, 20 states have (on average 1.2) internal successors, (24), 21 states have internal predecessors, (24), 11 states have call successors, (11), 4 states have call predecessors, (11), 3 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-27 13:13:29,655 INFO L74 IsIncluded]: Start isIncluded. First operand 35 states. Second operand has 35 states, 20 states have (on average 1.2) internal successors, (24), 21 states have internal predecessors, (24), 11 states have call successors, (11), 4 states have call predecessors, (11), 3 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-27 13:13:29,656 INFO L87 Difference]: Start difference. First operand 35 states. Second operand has 35 states, 20 states have (on average 1.2) internal successors, (24), 21 states have internal predecessors, (24), 11 states have call successors, (11), 4 states have call predecessors, (11), 3 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-27 13:13:29,661 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:13:29,661 INFO L93 Difference]: Finished difference Result 35 states and 44 transitions. [2022-04-27 13:13:29,661 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 44 transitions. [2022-04-27 13:13:29,662 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 13:13:29,662 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 13:13:29,664 INFO L74 IsIncluded]: Start isIncluded. First operand has 35 states, 20 states have (on average 1.2) internal successors, (24), 21 states have internal predecessors, (24), 11 states have call successors, (11), 4 states have call predecessors, (11), 3 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) Second operand 35 states. [2022-04-27 13:13:29,665 INFO L87 Difference]: Start difference. First operand has 35 states, 20 states have (on average 1.2) internal successors, (24), 21 states have internal predecessors, (24), 11 states have call successors, (11), 4 states have call predecessors, (11), 3 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) Second operand 35 states. [2022-04-27 13:13:29,671 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:13:29,671 INFO L93 Difference]: Finished difference Result 35 states and 44 transitions. [2022-04-27 13:13:29,671 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 44 transitions. [2022-04-27 13:13:29,672 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 13:13:29,672 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 13:13:29,673 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 13:13:29,673 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 13:13:29,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 20 states have (on average 1.2) internal successors, (24), 21 states have internal predecessors, (24), 11 states have call successors, (11), 4 states have call predecessors, (11), 3 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-27 13:13:29,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 44 transitions. [2022-04-27 13:13:29,678 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 44 transitions. Word has length 33 [2022-04-27 13:13:29,679 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 13:13:29,679 INFO L495 AbstractCegarLoop]: Abstraction has 35 states and 44 transitions. [2022-04-27 13:13:29,680 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 13:13:29,680 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 44 transitions. [2022-04-27 13:13:29,682 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-04-27 13:13:29,682 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 13:13:29,682 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, 1] [2022-04-27 13:13:29,682 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-27 13:13:29,682 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 13:13:29,683 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 13:13:29,683 INFO L85 PathProgramCache]: Analyzing trace with hash 1569470122, now seen corresponding path program 1 times [2022-04-27 13:13:29,683 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 13:13:29,683 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [785061896] [2022-04-27 13:13:29,683 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 13:13:29,683 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 13:13:29,731 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 13:13:29,732 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [793983530] [2022-04-27 13:13:29,732 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 13:13:29,733 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 13:13:29,733 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 13:13:29,739 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 13:13:29,748 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 13:13:29,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 13:13:29,818 INFO L263 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-27 13:13:29,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 13:13:29,835 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 13:13:30,026 INFO L272 TraceCheckUtils]: 0: Hoare triple {294#true} call ULTIMATE.init(); {294#true} is VALID [2022-04-27 13:13:30,027 INFO L290 TraceCheckUtils]: 1: Hoare triple {294#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(11, 2);call #Ultimate.allocInit(12, 3); {294#true} is VALID [2022-04-27 13:13:30,027 INFO L290 TraceCheckUtils]: 2: Hoare triple {294#true} assume true; {294#true} is VALID [2022-04-27 13:13:30,027 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {294#true} {294#true} #112#return; {294#true} is VALID [2022-04-27 13:13:30,027 INFO L272 TraceCheckUtils]: 4: Hoare triple {294#true} call #t~ret6 := main(); {294#true} is VALID [2022-04-27 13:13:30,027 INFO L290 TraceCheckUtils]: 5: Hoare triple {294#true} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~s~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4; {294#true} is VALID [2022-04-27 13:13:30,028 INFO L272 TraceCheckUtils]: 6: Hoare triple {294#true} call assume_abort_if_not((if ~x~0 >= 0 && ~x~0 <= 50 then 1 else 0)); {294#true} is VALID [2022-04-27 13:13:30,028 INFO L290 TraceCheckUtils]: 7: Hoare triple {294#true} ~cond := #in~cond; {294#true} is VALID [2022-04-27 13:13:30,028 INFO L290 TraceCheckUtils]: 8: Hoare triple {294#true} assume !(0 == ~cond); {294#true} is VALID [2022-04-27 13:13:30,028 INFO L290 TraceCheckUtils]: 9: Hoare triple {294#true} assume true; {294#true} is VALID [2022-04-27 13:13:30,029 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {294#true} {294#true} #94#return; {294#true} is VALID [2022-04-27 13:13:30,029 INFO L290 TraceCheckUtils]: 11: Hoare triple {294#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {294#true} is VALID [2022-04-27 13:13:30,029 INFO L272 TraceCheckUtils]: 12: Hoare triple {294#true} call assume_abort_if_not((if ~y~0 >= 0 && ~y~0 <= 50 then 1 else 0)); {294#true} is VALID [2022-04-27 13:13:30,029 INFO L290 TraceCheckUtils]: 13: Hoare triple {294#true} ~cond := #in~cond; {294#true} is VALID [2022-04-27 13:13:30,029 INFO L290 TraceCheckUtils]: 14: Hoare triple {294#true} assume !(0 == ~cond); {294#true} is VALID [2022-04-27 13:13:30,030 INFO L290 TraceCheckUtils]: 15: Hoare triple {294#true} assume true; {294#true} is VALID [2022-04-27 13:13:30,030 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {294#true} {294#true} #96#return; {294#true} is VALID [2022-04-27 13:13:30,030 INFO L272 TraceCheckUtils]: 17: Hoare triple {294#true} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {294#true} is VALID [2022-04-27 13:13:30,030 INFO L290 TraceCheckUtils]: 18: Hoare triple {294#true} ~cond := #in~cond; {294#true} is VALID [2022-04-27 13:13:30,030 INFO L290 TraceCheckUtils]: 19: Hoare triple {294#true} assume !(0 == ~cond); {294#true} is VALID [2022-04-27 13:13:30,031 INFO L290 TraceCheckUtils]: 20: Hoare triple {294#true} assume true; {294#true} is VALID [2022-04-27 13:13:30,031 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {294#true} {294#true} #98#return; {294#true} is VALID [2022-04-27 13:13:30,031 INFO L272 TraceCheckUtils]: 22: Hoare triple {294#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {294#true} is VALID [2022-04-27 13:13:30,032 INFO L290 TraceCheckUtils]: 23: Hoare triple {294#true} ~cond := #in~cond; {368#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-04-27 13:13:30,032 INFO L290 TraceCheckUtils]: 24: Hoare triple {368#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} assume !(0 == ~cond); {372#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-27 13:13:30,033 INFO L290 TraceCheckUtils]: 25: Hoare triple {372#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {372#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-27 13:13:30,033 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {372#(not (= |assume_abort_if_not_#in~cond| 0))} {294#true} #100#return; {379#(<= 1 main_~y~0)} is VALID [2022-04-27 13:13:30,034 INFO L290 TraceCheckUtils]: 27: Hoare triple {379#(<= 1 main_~y~0)} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1; {383#(<= 1 main_~b~0)} is VALID [2022-04-27 13:13:30,035 INFO L290 TraceCheckUtils]: 28: Hoare triple {383#(<= 1 main_~b~0)} assume !false; {383#(<= 1 main_~b~0)} is VALID [2022-04-27 13:13:30,035 INFO L290 TraceCheckUtils]: 29: Hoare triple {383#(<= 1 main_~b~0)} assume !(0 != ~b~0); {295#false} is VALID [2022-04-27 13:13:30,036 INFO L272 TraceCheckUtils]: 30: Hoare triple {295#false} call __VERIFIER_assert((if ~p~0 * ~x~0 - ~q~0 * ~x~0 + ~r~0 * ~y~0 - ~s~0 * ~y~0 == ~a~0 then 1 else 0)); {295#false} is VALID [2022-04-27 13:13:30,036 INFO L290 TraceCheckUtils]: 31: Hoare triple {295#false} ~cond := #in~cond; {295#false} is VALID [2022-04-27 13:13:30,036 INFO L290 TraceCheckUtils]: 32: Hoare triple {295#false} assume 0 == ~cond; {295#false} is VALID [2022-04-27 13:13:30,036 INFO L290 TraceCheckUtils]: 33: Hoare triple {295#false} assume !false; {295#false} is VALID [2022-04-27 13:13:30,045 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-04-27 13:13:30,045 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-27 13:13:30,045 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 13:13:30,045 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [785061896] [2022-04-27 13:13:30,046 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 13:13:30,046 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [793983530] [2022-04-27 13:13:30,046 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [793983530] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 13:13:30,046 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 13:13:30,046 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-27 13:13:30,047 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1821336254] [2022-04-27 13:13:30,047 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 13:13:30,048 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 1 states have call successors, (5) Word has length 34 [2022-04-27 13:13:30,048 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 13:13:30,049 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 1 states have call successors, (5) [2022-04-27 13:13:30,072 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 28 edges. 28 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 13:13:30,073 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-27 13:13:30,073 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 13:13:30,073 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-27 13:13:30,074 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-04-27 13:13:30,074 INFO L87 Difference]: Start difference. First operand 35 states and 44 transitions. Second operand has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 1 states have call successors, (5) [2022-04-27 13:13:30,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:13:30,417 INFO L93 Difference]: Finished difference Result 54 states and 69 transitions. [2022-04-27 13:13:30,417 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-27 13:13:30,417 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 1 states have call successors, (5) Word has length 34 [2022-04-27 13:13:30,417 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 13:13:30,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 1 states have call successors, (5) [2022-04-27 13:13:30,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 69 transitions. [2022-04-27 13:13:30,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 1 states have call successors, (5) [2022-04-27 13:13:30,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 69 transitions. [2022-04-27 13:13:30,423 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 69 transitions. [2022-04-27 13:13:30,482 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 13:13:30,484 INFO L225 Difference]: With dead ends: 54 [2022-04-27 13:13:30,484 INFO L226 Difference]: Without dead ends: 47 [2022-04-27 13:13:30,485 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-04-27 13:13:30,486 INFO L413 NwaCegarLoop]: 38 mSDtfsCounter, 31 mSDsluCounter, 95 mSDsCounter, 0 mSdLazyCounter, 76 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 133 SdHoareTripleChecker+Invalid, 85 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 76 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-27 13:13:30,486 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 133 Invalid, 85 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 76 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-27 13:13:30,487 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2022-04-27 13:13:30,502 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 37. [2022-04-27 13:13:30,502 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 13:13:30,503 INFO L82 GeneralOperation]: Start isEquivalent. First operand 47 states. Second operand has 37 states, 22 states have (on average 1.1818181818181819) internal successors, (26), 23 states have internal predecessors, (26), 11 states have call successors, (11), 4 states have call predecessors, (11), 3 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-27 13:13:30,503 INFO L74 IsIncluded]: Start isIncluded. First operand 47 states. Second operand has 37 states, 22 states have (on average 1.1818181818181819) internal successors, (26), 23 states have internal predecessors, (26), 11 states have call successors, (11), 4 states have call predecessors, (11), 3 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-27 13:13:30,503 INFO L87 Difference]: Start difference. First operand 47 states. Second operand has 37 states, 22 states have (on average 1.1818181818181819) internal successors, (26), 23 states have internal predecessors, (26), 11 states have call successors, (11), 4 states have call predecessors, (11), 3 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-27 13:13:30,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:13:30,506 INFO L93 Difference]: Finished difference Result 47 states and 62 transitions. [2022-04-27 13:13:30,507 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 62 transitions. [2022-04-27 13:13:30,507 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 13:13:30,508 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 13:13:30,508 INFO L74 IsIncluded]: Start isIncluded. First operand has 37 states, 22 states have (on average 1.1818181818181819) internal successors, (26), 23 states have internal predecessors, (26), 11 states have call successors, (11), 4 states have call predecessors, (11), 3 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) Second operand 47 states. [2022-04-27 13:13:30,511 INFO L87 Difference]: Start difference. First operand has 37 states, 22 states have (on average 1.1818181818181819) internal successors, (26), 23 states have internal predecessors, (26), 11 states have call successors, (11), 4 states have call predecessors, (11), 3 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) Second operand 47 states. [2022-04-27 13:13:30,514 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:13:30,514 INFO L93 Difference]: Finished difference Result 47 states and 62 transitions. [2022-04-27 13:13:30,514 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 62 transitions. [2022-04-27 13:13:30,515 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 13:13:30,515 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 13:13:30,515 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 13:13:30,515 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 13:13:30,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 22 states have (on average 1.1818181818181819) internal successors, (26), 23 states have internal predecessors, (26), 11 states have call successors, (11), 4 states have call predecessors, (11), 3 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-27 13:13:30,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 46 transitions. [2022-04-27 13:13:30,517 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 46 transitions. Word has length 34 [2022-04-27 13:13:30,517 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 13:13:30,518 INFO L495 AbstractCegarLoop]: Abstraction has 37 states and 46 transitions. [2022-04-27 13:13:30,518 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 1 states have call successors, (5) [2022-04-27 13:13:30,518 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 46 transitions. [2022-04-27 13:13:30,519 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-04-27 13:13:30,519 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 13:13:30,519 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, 1, 1, 1, 1] [2022-04-27 13:13:30,548 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-04-27 13:13:30,738 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 13:13:30,739 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 13:13:30,739 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 13:13:30,739 INFO L85 PathProgramCache]: Analyzing trace with hash 1443363578, now seen corresponding path program 1 times [2022-04-27 13:13:30,740 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 13:13:30,740 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [735993448] [2022-04-27 13:13:30,740 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 13:13:30,740 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 13:13:30,758 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 13:13:30,758 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [482853368] [2022-04-27 13:13:30,758 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 13:13:30,758 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 13:13:30,759 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 13:13:30,760 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 13:13:30,761 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 13:13:30,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 13:13:30,812 INFO L263 TraceCheckSpWp]: Trace formula consists of 117 conjuncts, 19 conjunts are in the unsatisfiable core [2022-04-27 13:13:30,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 13:13:30,829 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 13:13:31,171 INFO L272 TraceCheckUtils]: 0: Hoare triple {636#true} call ULTIMATE.init(); {636#true} is VALID [2022-04-27 13:13:31,171 INFO L290 TraceCheckUtils]: 1: Hoare triple {636#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(11, 2);call #Ultimate.allocInit(12, 3); {636#true} is VALID [2022-04-27 13:13:31,171 INFO L290 TraceCheckUtils]: 2: Hoare triple {636#true} assume true; {636#true} is VALID [2022-04-27 13:13:31,171 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {636#true} {636#true} #112#return; {636#true} is VALID [2022-04-27 13:13:31,172 INFO L272 TraceCheckUtils]: 4: Hoare triple {636#true} call #t~ret6 := main(); {636#true} is VALID [2022-04-27 13:13:31,172 INFO L290 TraceCheckUtils]: 5: Hoare triple {636#true} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~s~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4; {636#true} is VALID [2022-04-27 13:13:31,172 INFO L272 TraceCheckUtils]: 6: Hoare triple {636#true} call assume_abort_if_not((if ~x~0 >= 0 && ~x~0 <= 50 then 1 else 0)); {636#true} is VALID [2022-04-27 13:13:31,172 INFO L290 TraceCheckUtils]: 7: Hoare triple {636#true} ~cond := #in~cond; {636#true} is VALID [2022-04-27 13:13:31,172 INFO L290 TraceCheckUtils]: 8: Hoare triple {636#true} assume !(0 == ~cond); {636#true} is VALID [2022-04-27 13:13:31,173 INFO L290 TraceCheckUtils]: 9: Hoare triple {636#true} assume true; {636#true} is VALID [2022-04-27 13:13:31,173 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {636#true} {636#true} #94#return; {636#true} is VALID [2022-04-27 13:13:31,173 INFO L290 TraceCheckUtils]: 11: Hoare triple {636#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {636#true} is VALID [2022-04-27 13:13:31,173 INFO L272 TraceCheckUtils]: 12: Hoare triple {636#true} call assume_abort_if_not((if ~y~0 >= 0 && ~y~0 <= 50 then 1 else 0)); {636#true} is VALID [2022-04-27 13:13:31,173 INFO L290 TraceCheckUtils]: 13: Hoare triple {636#true} ~cond := #in~cond; {680#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-04-27 13:13:31,174 INFO L290 TraceCheckUtils]: 14: Hoare triple {680#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} assume !(0 == ~cond); {684#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-27 13:13:31,177 INFO L290 TraceCheckUtils]: 15: Hoare triple {684#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {684#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-27 13:13:31,177 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {684#(not (= |assume_abort_if_not_#in~cond| 0))} {636#true} #96#return; {691#(and (<= 0 main_~y~0) (<= main_~y~0 50))} is VALID [2022-04-27 13:13:31,178 INFO L272 TraceCheckUtils]: 17: Hoare triple {691#(and (<= 0 main_~y~0) (<= main_~y~0 50))} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {636#true} is VALID [2022-04-27 13:13:31,178 INFO L290 TraceCheckUtils]: 18: Hoare triple {636#true} ~cond := #in~cond; {636#true} is VALID [2022-04-27 13:13:31,178 INFO L290 TraceCheckUtils]: 19: Hoare triple {636#true} assume !(0 == ~cond); {636#true} is VALID [2022-04-27 13:13:31,179 INFO L290 TraceCheckUtils]: 20: Hoare triple {636#true} assume true; {636#true} is VALID [2022-04-27 13:13:31,179 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {636#true} {691#(and (<= 0 main_~y~0) (<= main_~y~0 50))} #98#return; {691#(and (<= 0 main_~y~0) (<= main_~y~0 50))} is VALID [2022-04-27 13:13:31,179 INFO L272 TraceCheckUtils]: 22: Hoare triple {691#(and (<= 0 main_~y~0) (<= main_~y~0 50))} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {636#true} is VALID [2022-04-27 13:13:31,180 INFO L290 TraceCheckUtils]: 23: Hoare triple {636#true} ~cond := #in~cond; {680#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-04-27 13:13:31,180 INFO L290 TraceCheckUtils]: 24: Hoare triple {680#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} assume !(0 == ~cond); {684#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-27 13:13:31,181 INFO L290 TraceCheckUtils]: 25: Hoare triple {684#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {684#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-27 13:13:31,186 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {684#(not (= |assume_abort_if_not_#in~cond| 0))} {691#(and (<= 0 main_~y~0) (<= main_~y~0 50))} #100#return; {722#(and (<= 1 main_~y~0) (<= main_~y~0 50))} is VALID [2022-04-27 13:13:31,187 INFO L290 TraceCheckUtils]: 27: Hoare triple {722#(and (<= 1 main_~y~0) (<= main_~y~0 50))} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1; {726#(and (= main_~r~0 0) (<= 1 main_~y~0) (= main_~a~0 main_~x~0) (<= main_~y~0 50) (= main_~p~0 1))} is VALID [2022-04-27 13:13:31,189 INFO L290 TraceCheckUtils]: 28: Hoare triple {726#(and (= main_~r~0 0) (<= 1 main_~y~0) (= main_~a~0 main_~x~0) (<= main_~y~0 50) (= main_~p~0 1))} assume !false; {726#(and (= main_~r~0 0) (<= 1 main_~y~0) (= main_~a~0 main_~x~0) (<= main_~y~0 50) (= main_~p~0 1))} is VALID [2022-04-27 13:13:31,189 INFO L290 TraceCheckUtils]: 29: Hoare triple {726#(and (= main_~r~0 0) (<= 1 main_~y~0) (= main_~a~0 main_~x~0) (<= main_~y~0 50) (= main_~p~0 1))} assume !!(0 != ~b~0);havoc ~c~0;havoc ~k~0;~c~0 := ~a~0;~k~0 := 0; {726#(and (= main_~r~0 0) (<= 1 main_~y~0) (= main_~a~0 main_~x~0) (<= main_~y~0 50) (= main_~p~0 1))} is VALID [2022-04-27 13:13:31,190 INFO L290 TraceCheckUtils]: 30: Hoare triple {726#(and (= main_~r~0 0) (<= 1 main_~y~0) (= main_~a~0 main_~x~0) (<= main_~y~0 50) (= main_~p~0 1))} assume !false; {726#(and (= main_~r~0 0) (<= 1 main_~y~0) (= main_~a~0 main_~x~0) (<= main_~y~0 50) (= main_~p~0 1))} is VALID [2022-04-27 13:13:31,192 INFO L290 TraceCheckUtils]: 31: Hoare triple {726#(and (= main_~r~0 0) (<= 1 main_~y~0) (= main_~a~0 main_~x~0) (<= main_~y~0 50) (= main_~p~0 1))} assume !!(~c~0 >= ~b~0);havoc ~d~0;havoc ~v~0;~d~0 := 1;~v~0 := ~b~0; {726#(and (= main_~r~0 0) (<= 1 main_~y~0) (= main_~a~0 main_~x~0) (<= main_~y~0 50) (= main_~p~0 1))} is VALID [2022-04-27 13:13:31,193 INFO L290 TraceCheckUtils]: 32: Hoare triple {726#(and (= main_~r~0 0) (<= 1 main_~y~0) (= main_~a~0 main_~x~0) (<= main_~y~0 50) (= main_~p~0 1))} assume !false; {726#(and (= main_~r~0 0) (<= 1 main_~y~0) (= main_~a~0 main_~x~0) (<= main_~y~0 50) (= main_~p~0 1))} is VALID [2022-04-27 13:13:31,206 INFO L272 TraceCheckUtils]: 33: Hoare triple {726#(and (= main_~r~0 0) (<= 1 main_~y~0) (= main_~a~0 main_~x~0) (<= main_~y~0 50) (= main_~p~0 1))} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {745#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 13:13:31,206 INFO L290 TraceCheckUtils]: 34: Hoare triple {745#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {749#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 13:13:31,208 INFO L290 TraceCheckUtils]: 35: Hoare triple {749#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {637#false} is VALID [2022-04-27 13:13:31,208 INFO L290 TraceCheckUtils]: 36: Hoare triple {637#false} assume !false; {637#false} is VALID [2022-04-27 13:13:31,208 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 9 proven. 3 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-04-27 13:13:31,209 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 13:13:31,514 INFO L290 TraceCheckUtils]: 36: Hoare triple {637#false} assume !false; {637#false} is VALID [2022-04-27 13:13:31,515 INFO L290 TraceCheckUtils]: 35: Hoare triple {749#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {637#false} is VALID [2022-04-27 13:13:31,515 INFO L290 TraceCheckUtils]: 34: Hoare triple {745#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {749#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 13:13:31,517 INFO L272 TraceCheckUtils]: 33: Hoare triple {765#(= 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)); {745#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 13:13:31,517 INFO L290 TraceCheckUtils]: 32: Hoare triple {765#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} assume !false; {765#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} is VALID [2022-04-27 13:13:31,517 INFO L290 TraceCheckUtils]: 31: Hoare triple {765#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} assume !!(~c~0 >= ~b~0);havoc ~d~0;havoc ~v~0;~d~0 := 1;~v~0 := ~b~0; {765#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} is VALID [2022-04-27 13:13:31,518 INFO L290 TraceCheckUtils]: 30: Hoare triple {765#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} assume !false; {765#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} is VALID [2022-04-27 13:13:31,518 INFO L290 TraceCheckUtils]: 29: Hoare triple {765#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} assume !!(0 != ~b~0);havoc ~c~0;havoc ~k~0;~c~0 := ~a~0;~k~0 := 0; {765#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} is VALID [2022-04-27 13:13:31,519 INFO L290 TraceCheckUtils]: 28: Hoare triple {765#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} assume !false; {765#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} is VALID [2022-04-27 13:13:31,519 INFO L290 TraceCheckUtils]: 27: Hoare triple {636#true} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1; {765#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} is VALID [2022-04-27 13:13:31,519 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {636#true} {636#true} #100#return; {636#true} is VALID [2022-04-27 13:13:31,520 INFO L290 TraceCheckUtils]: 25: Hoare triple {636#true} assume true; {636#true} is VALID [2022-04-27 13:13:31,520 INFO L290 TraceCheckUtils]: 24: Hoare triple {636#true} assume !(0 == ~cond); {636#true} is VALID [2022-04-27 13:13:31,520 INFO L290 TraceCheckUtils]: 23: Hoare triple {636#true} ~cond := #in~cond; {636#true} is VALID [2022-04-27 13:13:31,520 INFO L272 TraceCheckUtils]: 22: Hoare triple {636#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {636#true} is VALID [2022-04-27 13:13:31,521 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {636#true} {636#true} #98#return; {636#true} is VALID [2022-04-27 13:13:31,521 INFO L290 TraceCheckUtils]: 20: Hoare triple {636#true} assume true; {636#true} is VALID [2022-04-27 13:13:31,521 INFO L290 TraceCheckUtils]: 19: Hoare triple {636#true} assume !(0 == ~cond); {636#true} is VALID [2022-04-27 13:13:31,521 INFO L290 TraceCheckUtils]: 18: Hoare triple {636#true} ~cond := #in~cond; {636#true} is VALID [2022-04-27 13:13:31,521 INFO L272 TraceCheckUtils]: 17: Hoare triple {636#true} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {636#true} is VALID [2022-04-27 13:13:31,521 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {636#true} {636#true} #96#return; {636#true} is VALID [2022-04-27 13:13:31,521 INFO L290 TraceCheckUtils]: 15: Hoare triple {636#true} assume true; {636#true} is VALID [2022-04-27 13:13:31,521 INFO L290 TraceCheckUtils]: 14: Hoare triple {636#true} assume !(0 == ~cond); {636#true} is VALID [2022-04-27 13:13:31,522 INFO L290 TraceCheckUtils]: 13: Hoare triple {636#true} ~cond := #in~cond; {636#true} is VALID [2022-04-27 13:13:31,522 INFO L272 TraceCheckUtils]: 12: Hoare triple {636#true} call assume_abort_if_not((if ~y~0 >= 0 && ~y~0 <= 50 then 1 else 0)); {636#true} is VALID [2022-04-27 13:13:31,522 INFO L290 TraceCheckUtils]: 11: Hoare triple {636#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {636#true} is VALID [2022-04-27 13:13:31,522 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {636#true} {636#true} #94#return; {636#true} is VALID [2022-04-27 13:13:31,522 INFO L290 TraceCheckUtils]: 9: Hoare triple {636#true} assume true; {636#true} is VALID [2022-04-27 13:13:31,522 INFO L290 TraceCheckUtils]: 8: Hoare triple {636#true} assume !(0 == ~cond); {636#true} is VALID [2022-04-27 13:13:31,522 INFO L290 TraceCheckUtils]: 7: Hoare triple {636#true} ~cond := #in~cond; {636#true} is VALID [2022-04-27 13:13:31,524 INFO L272 TraceCheckUtils]: 6: Hoare triple {636#true} call assume_abort_if_not((if ~x~0 >= 0 && ~x~0 <= 50 then 1 else 0)); {636#true} is VALID [2022-04-27 13:13:31,527 INFO L290 TraceCheckUtils]: 5: Hoare triple {636#true} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~s~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4; {636#true} is VALID [2022-04-27 13:13:31,527 INFO L272 TraceCheckUtils]: 4: Hoare triple {636#true} call #t~ret6 := main(); {636#true} is VALID [2022-04-27 13:13:31,527 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {636#true} {636#true} #112#return; {636#true} is VALID [2022-04-27 13:13:31,528 INFO L290 TraceCheckUtils]: 2: Hoare triple {636#true} assume true; {636#true} is VALID [2022-04-27 13:13:31,528 INFO L290 TraceCheckUtils]: 1: Hoare triple {636#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(11, 2);call #Ultimate.allocInit(12, 3); {636#true} is VALID [2022-04-27 13:13:31,528 INFO L272 TraceCheckUtils]: 0: Hoare triple {636#true} call ULTIMATE.init(); {636#true} is VALID [2022-04-27 13:13:31,529 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 13:13:31,531 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 13:13:31,531 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [735993448] [2022-04-27 13:13:31,531 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 13:13:31,532 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [482853368] [2022-04-27 13:13:31,533 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [482853368] provided 1 perfect and 1 imperfect interpolant sequences [2022-04-27 13:13:31,533 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-04-27 13:13:31,533 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [9] total 10 [2022-04-27 13:13:31,533 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1844220827] [2022-04-27 13:13:31,533 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 13:13:31,535 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 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 37 [2022-04-27 13:13:31,536 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 13:13:31,536 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 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 13:13:31,557 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 28 edges. 28 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 13:13:31,558 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-27 13:13:31,558 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 13:13:31,558 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-27 13:13:31,558 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2022-04-27 13:13:31,559 INFO L87 Difference]: Start difference. First operand 37 states and 46 transitions. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 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 13:13:31,759 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:13:31,759 INFO L93 Difference]: Finished difference Result 53 states and 67 transitions. [2022-04-27 13:13:31,760 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-27 13:13:31,760 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 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 37 [2022-04-27 13:13:31,760 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 13:13:31,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 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 13:13:31,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 67 transitions. [2022-04-27 13:13:31,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 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 13:13:31,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 67 transitions. [2022-04-27 13:13:31,764 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 67 transitions. [2022-04-27 13:13:31,842 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 13:13:31,847 INFO L225 Difference]: With dead ends: 53 [2022-04-27 13:13:31,847 INFO L226 Difference]: Without dead ends: 51 [2022-04-27 13:13:31,848 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 64 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2022-04-27 13:13:31,850 INFO L413 NwaCegarLoop]: 43 mSDtfsCounter, 9 mSDsluCounter, 107 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 150 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 13:13:31,852 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 150 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 13:13:31,853 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2022-04-27 13:13:31,880 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 50. [2022-04-27 13:13:31,880 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 13:13:31,882 INFO L82 GeneralOperation]: Start isEquivalent. First operand 51 states. Second operand has 50 states, 30 states have (on average 1.2) internal successors, (36), 31 states have internal predecessors, (36), 15 states have call successors, (15), 5 states have call predecessors, (15), 4 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2022-04-27 13:13:31,883 INFO L74 IsIncluded]: Start isIncluded. First operand 51 states. Second operand has 50 states, 30 states have (on average 1.2) internal successors, (36), 31 states have internal predecessors, (36), 15 states have call successors, (15), 5 states have call predecessors, (15), 4 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2022-04-27 13:13:31,883 INFO L87 Difference]: Start difference. First operand 51 states. Second operand has 50 states, 30 states have (on average 1.2) internal successors, (36), 31 states have internal predecessors, (36), 15 states have call successors, (15), 5 states have call predecessors, (15), 4 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2022-04-27 13:13:31,888 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:13:31,889 INFO L93 Difference]: Finished difference Result 51 states and 65 transitions. [2022-04-27 13:13:31,889 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 65 transitions. [2022-04-27 13:13:31,892 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 13:13:31,892 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 13:13:31,893 INFO L74 IsIncluded]: Start isIncluded. First operand has 50 states, 30 states have (on average 1.2) internal successors, (36), 31 states have internal predecessors, (36), 15 states have call successors, (15), 5 states have call predecessors, (15), 4 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) Second operand 51 states. [2022-04-27 13:13:31,893 INFO L87 Difference]: Start difference. First operand has 50 states, 30 states have (on average 1.2) internal successors, (36), 31 states have internal predecessors, (36), 15 states have call successors, (15), 5 states have call predecessors, (15), 4 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) Second operand 51 states. [2022-04-27 13:13:31,896 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:13:31,896 INFO L93 Difference]: Finished difference Result 51 states and 65 transitions. [2022-04-27 13:13:31,896 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 65 transitions. [2022-04-27 13:13:31,897 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 13:13:31,897 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 13:13:31,897 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 13:13:31,897 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 13:13:31,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 30 states have (on average 1.2) internal successors, (36), 31 states have internal predecessors, (36), 15 states have call successors, (15), 5 states have call predecessors, (15), 4 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2022-04-27 13:13:31,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 64 transitions. [2022-04-27 13:13:31,905 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 64 transitions. Word has length 37 [2022-04-27 13:13:31,905 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 13:13:31,905 INFO L495 AbstractCegarLoop]: Abstraction has 50 states and 64 transitions. [2022-04-27 13:13:31,905 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 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 13:13:31,905 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 64 transitions. [2022-04-27 13:13:31,906 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-04-27 13:13:31,906 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 13:13:31,906 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, 1] [2022-04-27 13:13:31,931 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-04-27 13:13:32,127 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 13:13:32,128 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 13:13:32,128 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 13:13:32,128 INFO L85 PathProgramCache]: Analyzing trace with hash 584996456, now seen corresponding path program 1 times [2022-04-27 13:13:32,128 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 13:13:32,129 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1225726283] [2022-04-27 13:13:32,129 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 13:13:32,129 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 13:13:32,146 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 13:13:32,146 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [449619360] [2022-04-27 13:13:32,146 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 13:13:32,146 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 13:13:32,146 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 13:13:32,147 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 13:13:32,158 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 13:13:32,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 13:13:32,201 INFO L263 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 9 conjunts are in the unsatisfiable core [2022-04-27 13:13:32,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 13:13:32,211 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 13:13:32,363 INFO L272 TraceCheckUtils]: 0: Hoare triple {1126#true} call ULTIMATE.init(); {1126#true} is VALID [2022-04-27 13:13:32,363 INFO L290 TraceCheckUtils]: 1: Hoare triple {1126#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(11, 2);call #Ultimate.allocInit(12, 3); {1126#true} is VALID [2022-04-27 13:13:32,363 INFO L290 TraceCheckUtils]: 2: Hoare triple {1126#true} assume true; {1126#true} is VALID [2022-04-27 13:13:32,364 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1126#true} {1126#true} #112#return; {1126#true} is VALID [2022-04-27 13:13:32,364 INFO L272 TraceCheckUtils]: 4: Hoare triple {1126#true} call #t~ret6 := main(); {1126#true} is VALID [2022-04-27 13:13:32,364 INFO L290 TraceCheckUtils]: 5: Hoare triple {1126#true} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~s~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4; {1126#true} is VALID [2022-04-27 13:13:32,364 INFO L272 TraceCheckUtils]: 6: Hoare triple {1126#true} call assume_abort_if_not((if ~x~0 >= 0 && ~x~0 <= 50 then 1 else 0)); {1126#true} is VALID [2022-04-27 13:13:32,364 INFO L290 TraceCheckUtils]: 7: Hoare triple {1126#true} ~cond := #in~cond; {1126#true} is VALID [2022-04-27 13:13:32,364 INFO L290 TraceCheckUtils]: 8: Hoare triple {1126#true} assume !(0 == ~cond); {1126#true} is VALID [2022-04-27 13:13:32,364 INFO L290 TraceCheckUtils]: 9: Hoare triple {1126#true} assume true; {1126#true} is VALID [2022-04-27 13:13:32,364 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1126#true} {1126#true} #94#return; {1126#true} is VALID [2022-04-27 13:13:32,365 INFO L290 TraceCheckUtils]: 11: Hoare triple {1126#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {1126#true} is VALID [2022-04-27 13:13:32,365 INFO L272 TraceCheckUtils]: 12: Hoare triple {1126#true} call assume_abort_if_not((if ~y~0 >= 0 && ~y~0 <= 50 then 1 else 0)); {1126#true} is VALID [2022-04-27 13:13:32,365 INFO L290 TraceCheckUtils]: 13: Hoare triple {1126#true} ~cond := #in~cond; {1126#true} is VALID [2022-04-27 13:13:32,365 INFO L290 TraceCheckUtils]: 14: Hoare triple {1126#true} assume !(0 == ~cond); {1126#true} is VALID [2022-04-27 13:13:32,365 INFO L290 TraceCheckUtils]: 15: Hoare triple {1126#true} assume true; {1126#true} is VALID [2022-04-27 13:13:32,365 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {1126#true} {1126#true} #96#return; {1126#true} is VALID [2022-04-27 13:13:32,365 INFO L272 TraceCheckUtils]: 17: Hoare triple {1126#true} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {1126#true} is VALID [2022-04-27 13:13:32,365 INFO L290 TraceCheckUtils]: 18: Hoare triple {1126#true} ~cond := #in~cond; {1185#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-04-27 13:13:32,366 INFO L290 TraceCheckUtils]: 19: Hoare triple {1185#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} assume !(0 == ~cond); {1189#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-27 13:13:32,366 INFO L290 TraceCheckUtils]: 20: Hoare triple {1189#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {1189#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-27 13:13:32,367 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {1189#(not (= |assume_abort_if_not_#in~cond| 0))} {1126#true} #98#return; {1196#(<= 1 main_~x~0)} is VALID [2022-04-27 13:13:32,367 INFO L272 TraceCheckUtils]: 22: Hoare triple {1196#(<= 1 main_~x~0)} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {1126#true} is VALID [2022-04-27 13:13:32,367 INFO L290 TraceCheckUtils]: 23: Hoare triple {1126#true} ~cond := #in~cond; {1126#true} is VALID [2022-04-27 13:13:32,367 INFO L290 TraceCheckUtils]: 24: Hoare triple {1126#true} assume !(0 == ~cond); {1126#true} is VALID [2022-04-27 13:13:32,367 INFO L290 TraceCheckUtils]: 25: Hoare triple {1126#true} assume true; {1126#true} is VALID [2022-04-27 13:13:32,368 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {1126#true} {1196#(<= 1 main_~x~0)} #100#return; {1196#(<= 1 main_~x~0)} is VALID [2022-04-27 13:13:32,368 INFO L290 TraceCheckUtils]: 27: Hoare triple {1196#(<= 1 main_~x~0)} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1; {1215#(<= 1 main_~a~0)} is VALID [2022-04-27 13:13:32,369 INFO L290 TraceCheckUtils]: 28: Hoare triple {1215#(<= 1 main_~a~0)} assume !false; {1215#(<= 1 main_~a~0)} is VALID [2022-04-27 13:13:32,369 INFO L290 TraceCheckUtils]: 29: Hoare triple {1215#(<= 1 main_~a~0)} assume !!(0 != ~b~0);havoc ~c~0;havoc ~k~0;~c~0 := ~a~0;~k~0 := 0; {1222#(<= 1 main_~c~0)} is VALID [2022-04-27 13:13:32,369 INFO L290 TraceCheckUtils]: 30: Hoare triple {1222#(<= 1 main_~c~0)} assume !false; {1222#(<= 1 main_~c~0)} is VALID [2022-04-27 13:13:32,370 INFO L290 TraceCheckUtils]: 31: Hoare triple {1222#(<= 1 main_~c~0)} assume !(~c~0 >= ~b~0); {1222#(<= 1 main_~c~0)} is VALID [2022-04-27 13:13:32,370 INFO L290 TraceCheckUtils]: 32: Hoare triple {1222#(<= 1 main_~c~0)} ~a~0 := ~b~0;~b~0 := ~c~0;havoc ~temp~0;~temp~0 := ~p~0;~p~0 := ~q~0;~q~0 := ~temp~0 - ~q~0 * ~k~0;~temp~0 := ~r~0;~r~0 := ~s~0;~s~0 := ~temp~0 - ~s~0 * ~k~0; {1232#(<= 1 main_~b~0)} is VALID [2022-04-27 13:13:32,371 INFO L290 TraceCheckUtils]: 33: Hoare triple {1232#(<= 1 main_~b~0)} assume !false; {1232#(<= 1 main_~b~0)} is VALID [2022-04-27 13:13:32,371 INFO L290 TraceCheckUtils]: 34: Hoare triple {1232#(<= 1 main_~b~0)} assume !(0 != ~b~0); {1127#false} is VALID [2022-04-27 13:13:32,371 INFO L272 TraceCheckUtils]: 35: Hoare triple {1127#false} call __VERIFIER_assert((if ~p~0 * ~x~0 - ~q~0 * ~x~0 + ~r~0 * ~y~0 - ~s~0 * ~y~0 == ~a~0 then 1 else 0)); {1127#false} is VALID [2022-04-27 13:13:32,371 INFO L290 TraceCheckUtils]: 36: Hoare triple {1127#false} ~cond := #in~cond; {1127#false} is VALID [2022-04-27 13:13:32,372 INFO L290 TraceCheckUtils]: 37: Hoare triple {1127#false} assume 0 == ~cond; {1127#false} is VALID [2022-04-27 13:13:32,372 INFO L290 TraceCheckUtils]: 38: Hoare triple {1127#false} assume !false; {1127#false} is VALID [2022-04-27 13:13:32,372 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 6 proven. 5 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-04-27 13:13:32,372 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 13:13:32,606 INFO L290 TraceCheckUtils]: 38: Hoare triple {1127#false} assume !false; {1127#false} is VALID [2022-04-27 13:13:32,606 INFO L290 TraceCheckUtils]: 37: Hoare triple {1127#false} assume 0 == ~cond; {1127#false} is VALID [2022-04-27 13:13:32,606 INFO L290 TraceCheckUtils]: 36: Hoare triple {1127#false} ~cond := #in~cond; {1127#false} is VALID [2022-04-27 13:13:32,607 INFO L272 TraceCheckUtils]: 35: Hoare triple {1127#false} call __VERIFIER_assert((if ~p~0 * ~x~0 - ~q~0 * ~x~0 + ~r~0 * ~y~0 - ~s~0 * ~y~0 == ~a~0 then 1 else 0)); {1127#false} is VALID [2022-04-27 13:13:32,608 INFO L290 TraceCheckUtils]: 34: Hoare triple {1232#(<= 1 main_~b~0)} assume !(0 != ~b~0); {1127#false} is VALID [2022-04-27 13:13:32,608 INFO L290 TraceCheckUtils]: 33: Hoare triple {1232#(<= 1 main_~b~0)} assume !false; {1232#(<= 1 main_~b~0)} is VALID [2022-04-27 13:13:32,608 INFO L290 TraceCheckUtils]: 32: Hoare triple {1222#(<= 1 main_~c~0)} ~a~0 := ~b~0;~b~0 := ~c~0;havoc ~temp~0;~temp~0 := ~p~0;~p~0 := ~q~0;~q~0 := ~temp~0 - ~q~0 * ~k~0;~temp~0 := ~r~0;~r~0 := ~s~0;~s~0 := ~temp~0 - ~s~0 * ~k~0; {1232#(<= 1 main_~b~0)} is VALID [2022-04-27 13:13:32,609 INFO L290 TraceCheckUtils]: 31: Hoare triple {1222#(<= 1 main_~c~0)} assume !(~c~0 >= ~b~0); {1222#(<= 1 main_~c~0)} is VALID [2022-04-27 13:13:32,609 INFO L290 TraceCheckUtils]: 30: Hoare triple {1222#(<= 1 main_~c~0)} assume !false; {1222#(<= 1 main_~c~0)} is VALID [2022-04-27 13:13:32,610 INFO L290 TraceCheckUtils]: 29: Hoare triple {1215#(<= 1 main_~a~0)} assume !!(0 != ~b~0);havoc ~c~0;havoc ~k~0;~c~0 := ~a~0;~k~0 := 0; {1222#(<= 1 main_~c~0)} is VALID [2022-04-27 13:13:32,610 INFO L290 TraceCheckUtils]: 28: Hoare triple {1215#(<= 1 main_~a~0)} assume !false; {1215#(<= 1 main_~a~0)} is VALID [2022-04-27 13:13:32,610 INFO L290 TraceCheckUtils]: 27: Hoare triple {1196#(<= 1 main_~x~0)} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1; {1215#(<= 1 main_~a~0)} is VALID [2022-04-27 13:13:32,611 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {1126#true} {1196#(<= 1 main_~x~0)} #100#return; {1196#(<= 1 main_~x~0)} is VALID [2022-04-27 13:13:32,611 INFO L290 TraceCheckUtils]: 25: Hoare triple {1126#true} assume true; {1126#true} is VALID [2022-04-27 13:13:32,611 INFO L290 TraceCheckUtils]: 24: Hoare triple {1126#true} assume !(0 == ~cond); {1126#true} is VALID [2022-04-27 13:13:32,611 INFO L290 TraceCheckUtils]: 23: Hoare triple {1126#true} ~cond := #in~cond; {1126#true} is VALID [2022-04-27 13:13:32,611 INFO L272 TraceCheckUtils]: 22: Hoare triple {1196#(<= 1 main_~x~0)} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {1126#true} is VALID [2022-04-27 13:13:32,612 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {1189#(not (= |assume_abort_if_not_#in~cond| 0))} {1126#true} #98#return; {1196#(<= 1 main_~x~0)} is VALID [2022-04-27 13:13:32,612 INFO L290 TraceCheckUtils]: 20: Hoare triple {1189#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {1189#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-27 13:13:32,613 INFO L290 TraceCheckUtils]: 19: Hoare triple {1311#(or (not (= |assume_abort_if_not_#in~cond| 0)) (= assume_abort_if_not_~cond 0))} assume !(0 == ~cond); {1189#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-27 13:13:32,613 INFO L290 TraceCheckUtils]: 18: Hoare triple {1126#true} ~cond := #in~cond; {1311#(or (not (= |assume_abort_if_not_#in~cond| 0)) (= assume_abort_if_not_~cond 0))} is VALID [2022-04-27 13:13:32,613 INFO L272 TraceCheckUtils]: 17: Hoare triple {1126#true} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {1126#true} is VALID [2022-04-27 13:13:32,613 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {1126#true} {1126#true} #96#return; {1126#true} is VALID [2022-04-27 13:13:32,613 INFO L290 TraceCheckUtils]: 15: Hoare triple {1126#true} assume true; {1126#true} is VALID [2022-04-27 13:13:32,614 INFO L290 TraceCheckUtils]: 14: Hoare triple {1126#true} assume !(0 == ~cond); {1126#true} is VALID [2022-04-27 13:13:32,614 INFO L290 TraceCheckUtils]: 13: Hoare triple {1126#true} ~cond := #in~cond; {1126#true} is VALID [2022-04-27 13:13:32,614 INFO L272 TraceCheckUtils]: 12: Hoare triple {1126#true} call assume_abort_if_not((if ~y~0 >= 0 && ~y~0 <= 50 then 1 else 0)); {1126#true} is VALID [2022-04-27 13:13:32,614 INFO L290 TraceCheckUtils]: 11: Hoare triple {1126#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {1126#true} is VALID [2022-04-27 13:13:32,614 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1126#true} {1126#true} #94#return; {1126#true} is VALID [2022-04-27 13:13:32,614 INFO L290 TraceCheckUtils]: 9: Hoare triple {1126#true} assume true; {1126#true} is VALID [2022-04-27 13:13:32,614 INFO L290 TraceCheckUtils]: 8: Hoare triple {1126#true} assume !(0 == ~cond); {1126#true} is VALID [2022-04-27 13:13:32,614 INFO L290 TraceCheckUtils]: 7: Hoare triple {1126#true} ~cond := #in~cond; {1126#true} is VALID [2022-04-27 13:13:32,614 INFO L272 TraceCheckUtils]: 6: Hoare triple {1126#true} call assume_abort_if_not((if ~x~0 >= 0 && ~x~0 <= 50 then 1 else 0)); {1126#true} is VALID [2022-04-27 13:13:32,615 INFO L290 TraceCheckUtils]: 5: Hoare triple {1126#true} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~s~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4; {1126#true} is VALID [2022-04-27 13:13:32,615 INFO L272 TraceCheckUtils]: 4: Hoare triple {1126#true} call #t~ret6 := main(); {1126#true} is VALID [2022-04-27 13:13:32,615 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1126#true} {1126#true} #112#return; {1126#true} is VALID [2022-04-27 13:13:32,615 INFO L290 TraceCheckUtils]: 2: Hoare triple {1126#true} assume true; {1126#true} is VALID [2022-04-27 13:13:32,615 INFO L290 TraceCheckUtils]: 1: Hoare triple {1126#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(11, 2);call #Ultimate.allocInit(12, 3); {1126#true} is VALID [2022-04-27 13:13:32,615 INFO L272 TraceCheckUtils]: 0: Hoare triple {1126#true} call ULTIMATE.init(); {1126#true} is VALID [2022-04-27 13:13:32,615 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 6 proven. 5 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-04-27 13:13:32,616 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 13:13:32,616 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1225726283] [2022-04-27 13:13:32,616 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 13:13:32,616 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [449619360] [2022-04-27 13:13:32,616 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [449619360] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 13:13:32,616 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-27 13:13:32,616 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 9 [2022-04-27 13:13:32,616 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [620902468] [2022-04-27 13:13:32,616 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-27 13:13:32,617 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.5555555555555554) internal successors, (23), 8 states have internal predecessors, (23), 3 states have call successors, (7), 2 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 39 [2022-04-27 13:13:32,617 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 13:13:32,618 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 9 states, 9 states have (on average 2.5555555555555554) internal successors, (23), 8 states have internal predecessors, (23), 3 states have call successors, (7), 2 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 13:13:32,641 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 13:13:32,641 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-04-27 13:13:32,641 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 13:13:32,642 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-04-27 13:13:32,642 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2022-04-27 13:13:32,642 INFO L87 Difference]: Start difference. First operand 50 states and 64 transitions. Second operand has 9 states, 9 states have (on average 2.5555555555555554) internal successors, (23), 8 states have internal predecessors, (23), 3 states have call successors, (7), 2 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 13:13:33,364 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:13:33,364 INFO L93 Difference]: Finished difference Result 103 states and 143 transitions. [2022-04-27 13:13:33,364 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-27 13:13:33,365 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.5555555555555554) internal successors, (23), 8 states have internal predecessors, (23), 3 states have call successors, (7), 2 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 39 [2022-04-27 13:13:33,365 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 13:13:33,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 2.5555555555555554) internal successors, (23), 8 states have internal predecessors, (23), 3 states have call successors, (7), 2 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 13:13:33,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 108 transitions. [2022-04-27 13:13:33,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 2.5555555555555554) internal successors, (23), 8 states have internal predecessors, (23), 3 states have call successors, (7), 2 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 13:13:33,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 108 transitions. [2022-04-27 13:13:33,370 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 9 states and 108 transitions. [2022-04-27 13:13:33,474 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 108 edges. 108 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 13:13:33,477 INFO L225 Difference]: With dead ends: 103 [2022-04-27 13:13:33,478 INFO L226 Difference]: Without dead ends: 96 [2022-04-27 13:13:33,478 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 69 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=135, Unknown=0, NotChecked=0, Total=182 [2022-04-27 13:13:33,480 INFO L413 NwaCegarLoop]: 52 mSDtfsCounter, 60 mSDsluCounter, 186 mSDsCounter, 0 mSdLazyCounter, 166 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 238 SdHoareTripleChecker+Invalid, 212 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 166 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-27 13:13:33,481 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 238 Invalid, 212 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 166 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-27 13:13:33,482 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2022-04-27 13:13:33,568 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 71. [2022-04-27 13:13:33,568 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 13:13:33,569 INFO L82 GeneralOperation]: Start isEquivalent. First operand 96 states. Second operand has 71 states, 47 states have (on average 1.2553191489361701) internal successors, (59), 48 states have internal predecessors, (59), 19 states have call successors, (19), 5 states have call predecessors, (19), 4 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2022-04-27 13:13:33,569 INFO L74 IsIncluded]: Start isIncluded. First operand 96 states. Second operand has 71 states, 47 states have (on average 1.2553191489361701) internal successors, (59), 48 states have internal predecessors, (59), 19 states have call successors, (19), 5 states have call predecessors, (19), 4 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2022-04-27 13:13:33,570 INFO L87 Difference]: Start difference. First operand 96 states. Second operand has 71 states, 47 states have (on average 1.2553191489361701) internal successors, (59), 48 states have internal predecessors, (59), 19 states have call successors, (19), 5 states have call predecessors, (19), 4 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2022-04-27 13:13:33,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:13:33,576 INFO L93 Difference]: Finished difference Result 96 states and 136 transitions. [2022-04-27 13:13:33,576 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 136 transitions. [2022-04-27 13:13:33,576 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 13:13:33,576 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 13:13:33,577 INFO L74 IsIncluded]: Start isIncluded. First operand has 71 states, 47 states have (on average 1.2553191489361701) internal successors, (59), 48 states have internal predecessors, (59), 19 states have call successors, (19), 5 states have call predecessors, (19), 4 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) Second operand 96 states. [2022-04-27 13:13:33,577 INFO L87 Difference]: Start difference. First operand has 71 states, 47 states have (on average 1.2553191489361701) internal successors, (59), 48 states have internal predecessors, (59), 19 states have call successors, (19), 5 states have call predecessors, (19), 4 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) Second operand 96 states. [2022-04-27 13:13:33,582 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:13:33,582 INFO L93 Difference]: Finished difference Result 96 states and 136 transitions. [2022-04-27 13:13:33,583 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 136 transitions. [2022-04-27 13:13:33,583 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 13:13:33,583 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 13:13:33,583 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 13:13:33,583 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 13:13:33,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 47 states have (on average 1.2553191489361701) internal successors, (59), 48 states have internal predecessors, (59), 19 states have call successors, (19), 5 states have call predecessors, (19), 4 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2022-04-27 13:13:33,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 95 transitions. [2022-04-27 13:13:33,587 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 95 transitions. Word has length 39 [2022-04-27 13:13:33,587 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 13:13:33,587 INFO L495 AbstractCegarLoop]: Abstraction has 71 states and 95 transitions. [2022-04-27 13:13:33,587 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.5555555555555554) internal successors, (23), 8 states have internal predecessors, (23), 3 states have call successors, (7), 2 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 13:13:33,587 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 95 transitions. [2022-04-27 13:13:33,588 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2022-04-27 13:13:33,588 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 13:13:33,588 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, 1, 1, 1, 1] [2022-04-27 13:13:33,616 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 13:13:33,809 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 13:13:33,809 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 13:13:33,810 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 13:13:33,810 INFO L85 PathProgramCache]: Analyzing trace with hash -1286298951, now seen corresponding path program 1 times [2022-04-27 13:13:33,810 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 13:13:33,810 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [309155284] [2022-04-27 13:13:33,810 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 13:13:33,810 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 13:13:33,825 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 13:13:33,826 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1397441692] [2022-04-27 13:13:33,826 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 13:13:33,826 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 13:13:33,826 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 13:13:33,827 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 13:13:33,836 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 13:13:33,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 13:13:33,882 INFO L263 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 23 conjunts are in the unsatisfiable core [2022-04-27 13:13:33,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 13:13:33,896 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 13:13:34,667 INFO L272 TraceCheckUtils]: 0: Hoare triple {1837#true} call ULTIMATE.init(); {1837#true} is VALID [2022-04-27 13:13:34,667 INFO L290 TraceCheckUtils]: 1: Hoare triple {1837#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(11, 2);call #Ultimate.allocInit(12, 3); {1837#true} is VALID [2022-04-27 13:13:34,667 INFO L290 TraceCheckUtils]: 2: Hoare triple {1837#true} assume true; {1837#true} is VALID [2022-04-27 13:13:34,667 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1837#true} {1837#true} #112#return; {1837#true} is VALID [2022-04-27 13:13:34,668 INFO L272 TraceCheckUtils]: 4: Hoare triple {1837#true} call #t~ret6 := main(); {1837#true} is VALID [2022-04-27 13:13:34,668 INFO L290 TraceCheckUtils]: 5: Hoare triple {1837#true} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~s~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4; {1837#true} is VALID [2022-04-27 13:13:34,668 INFO L272 TraceCheckUtils]: 6: Hoare triple {1837#true} call assume_abort_if_not((if ~x~0 >= 0 && ~x~0 <= 50 then 1 else 0)); {1837#true} is VALID [2022-04-27 13:13:34,673 INFO L290 TraceCheckUtils]: 7: Hoare triple {1837#true} ~cond := #in~cond; {1863#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-04-27 13:13:34,674 INFO L290 TraceCheckUtils]: 8: Hoare triple {1863#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} assume !(0 == ~cond); {1867#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-27 13:13:34,674 INFO L290 TraceCheckUtils]: 9: Hoare triple {1867#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {1867#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-27 13:13:34,675 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1867#(not (= |assume_abort_if_not_#in~cond| 0))} {1837#true} #94#return; {1874#(and (<= 0 main_~x~0) (<= main_~x~0 50))} is VALID [2022-04-27 13:13:34,675 INFO L290 TraceCheckUtils]: 11: Hoare triple {1874#(and (<= 0 main_~x~0) (<= main_~x~0 50))} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {1874#(and (<= 0 main_~x~0) (<= main_~x~0 50))} is VALID [2022-04-27 13:13:34,676 INFO L272 TraceCheckUtils]: 12: Hoare triple {1874#(and (<= 0 main_~x~0) (<= main_~x~0 50))} call assume_abort_if_not((if ~y~0 >= 0 && ~y~0 <= 50 then 1 else 0)); {1837#true} is VALID [2022-04-27 13:13:34,676 INFO L290 TraceCheckUtils]: 13: Hoare triple {1837#true} ~cond := #in~cond; {1863#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-04-27 13:13:34,676 INFO L290 TraceCheckUtils]: 14: Hoare triple {1863#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} assume !(0 == ~cond); {1867#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-27 13:13:34,677 INFO L290 TraceCheckUtils]: 15: Hoare triple {1867#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {1867#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-27 13:13:34,677 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {1867#(not (= |assume_abort_if_not_#in~cond| 0))} {1874#(and (<= 0 main_~x~0) (<= main_~x~0 50))} #96#return; {1893#(and (<= 0 main_~y~0) (<= 0 main_~x~0) (<= main_~x~0 50) (<= main_~y~0 50))} is VALID [2022-04-27 13:13:34,678 INFO L272 TraceCheckUtils]: 17: Hoare triple {1893#(and (<= 0 main_~y~0) (<= 0 main_~x~0) (<= main_~x~0 50) (<= main_~y~0 50))} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {1837#true} is VALID [2022-04-27 13:13:34,678 INFO L290 TraceCheckUtils]: 18: Hoare triple {1837#true} ~cond := #in~cond; {1837#true} is VALID [2022-04-27 13:13:34,678 INFO L290 TraceCheckUtils]: 19: Hoare triple {1837#true} assume !(0 == ~cond); {1837#true} is VALID [2022-04-27 13:13:34,678 INFO L290 TraceCheckUtils]: 20: Hoare triple {1837#true} assume true; {1837#true} is VALID [2022-04-27 13:13:34,678 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {1837#true} {1893#(and (<= 0 main_~y~0) (<= 0 main_~x~0) (<= main_~x~0 50) (<= main_~y~0 50))} #98#return; {1893#(and (<= 0 main_~y~0) (<= 0 main_~x~0) (<= main_~x~0 50) (<= main_~y~0 50))} is VALID [2022-04-27 13:13:34,679 INFO L272 TraceCheckUtils]: 22: Hoare triple {1893#(and (<= 0 main_~y~0) (<= 0 main_~x~0) (<= main_~x~0 50) (<= main_~y~0 50))} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {1837#true} is VALID [2022-04-27 13:13:34,679 INFO L290 TraceCheckUtils]: 23: Hoare triple {1837#true} ~cond := #in~cond; {1837#true} is VALID [2022-04-27 13:13:34,679 INFO L290 TraceCheckUtils]: 24: Hoare triple {1837#true} assume !(0 == ~cond); {1837#true} is VALID [2022-04-27 13:13:34,679 INFO L290 TraceCheckUtils]: 25: Hoare triple {1837#true} assume true; {1837#true} is VALID [2022-04-27 13:13:34,680 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {1837#true} {1893#(and (<= 0 main_~y~0) (<= 0 main_~x~0) (<= main_~x~0 50) (<= main_~y~0 50))} #100#return; {1893#(and (<= 0 main_~y~0) (<= 0 main_~x~0) (<= main_~x~0 50) (<= main_~y~0 50))} is VALID [2022-04-27 13:13:34,680 INFO L290 TraceCheckUtils]: 27: Hoare triple {1893#(and (<= 0 main_~y~0) (<= 0 main_~x~0) (<= main_~x~0 50) (<= main_~y~0 50))} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1; {1927#(and (<= 0 main_~y~0) (= main_~s~0 1) (<= 0 main_~x~0) (<= main_~x~0 50) (<= main_~a~0 main_~x~0) (= main_~b~0 main_~y~0) (= main_~q~0 0) (<= main_~y~0 50))} is VALID [2022-04-27 13:13:34,681 INFO L290 TraceCheckUtils]: 28: Hoare triple {1927#(and (<= 0 main_~y~0) (= main_~s~0 1) (<= 0 main_~x~0) (<= main_~x~0 50) (<= main_~a~0 main_~x~0) (= main_~b~0 main_~y~0) (= main_~q~0 0) (<= main_~y~0 50))} assume !false; {1927#(and (<= 0 main_~y~0) (= main_~s~0 1) (<= 0 main_~x~0) (<= main_~x~0 50) (<= main_~a~0 main_~x~0) (= main_~b~0 main_~y~0) (= main_~q~0 0) (<= main_~y~0 50))} is VALID [2022-04-27 13:13:34,681 INFO L290 TraceCheckUtils]: 29: Hoare triple {1927#(and (<= 0 main_~y~0) (= main_~s~0 1) (<= 0 main_~x~0) (<= main_~x~0 50) (<= main_~a~0 main_~x~0) (= main_~b~0 main_~y~0) (= main_~q~0 0) (<= main_~y~0 50))} assume !!(0 != ~b~0);havoc ~c~0;havoc ~k~0;~c~0 := ~a~0;~k~0 := 0; {1934#(and (<= 0 main_~y~0) (<= main_~c~0 main_~x~0) (= main_~s~0 1) (<= 0 main_~x~0) (<= main_~x~0 50) (= main_~b~0 main_~y~0) (not (= main_~b~0 0)) (= main_~q~0 0) (<= main_~y~0 50))} is VALID [2022-04-27 13:13:34,682 INFO L290 TraceCheckUtils]: 30: Hoare triple {1934#(and (<= 0 main_~y~0) (<= main_~c~0 main_~x~0) (= main_~s~0 1) (<= 0 main_~x~0) (<= main_~x~0 50) (= main_~b~0 main_~y~0) (not (= main_~b~0 0)) (= main_~q~0 0) (<= main_~y~0 50))} assume !false; {1934#(and (<= 0 main_~y~0) (<= main_~c~0 main_~x~0) (= main_~s~0 1) (<= 0 main_~x~0) (<= main_~x~0 50) (= main_~b~0 main_~y~0) (not (= main_~b~0 0)) (= main_~q~0 0) (<= main_~y~0 50))} is VALID [2022-04-27 13:13:34,683 INFO L290 TraceCheckUtils]: 31: Hoare triple {1934#(and (<= 0 main_~y~0) (<= main_~c~0 main_~x~0) (= main_~s~0 1) (<= 0 main_~x~0) (<= main_~x~0 50) (= main_~b~0 main_~y~0) (not (= main_~b~0 0)) (= main_~q~0 0) (<= main_~y~0 50))} assume !!(~c~0 >= ~b~0);havoc ~d~0;havoc ~v~0;~d~0 := 1;~v~0 := ~b~0; {1941#(and (<= 0 main_~y~0) (<= main_~b~0 main_~x~0) (= main_~s~0 1) (<= main_~x~0 50) (= main_~b~0 main_~y~0) (not (= main_~b~0 0)) (= main_~q~0 0))} is VALID [2022-04-27 13:13:34,683 INFO L290 TraceCheckUtils]: 32: Hoare triple {1941#(and (<= 0 main_~y~0) (<= main_~b~0 main_~x~0) (= main_~s~0 1) (<= main_~x~0 50) (= main_~b~0 main_~y~0) (not (= main_~b~0 0)) (= main_~q~0 0))} assume !false; {1941#(and (<= 0 main_~y~0) (<= main_~b~0 main_~x~0) (= main_~s~0 1) (<= main_~x~0 50) (= main_~b~0 main_~y~0) (not (= main_~b~0 0)) (= main_~q~0 0))} is VALID [2022-04-27 13:13:34,683 INFO L272 TraceCheckUtils]: 33: Hoare triple {1941#(and (<= 0 main_~y~0) (<= main_~b~0 main_~x~0) (= main_~s~0 1) (<= main_~x~0 50) (= main_~b~0 main_~y~0) (not (= main_~b~0 0)) (= main_~q~0 0))} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {1837#true} is VALID [2022-04-27 13:13:34,683 INFO L290 TraceCheckUtils]: 34: Hoare triple {1837#true} ~cond := #in~cond; {1837#true} is VALID [2022-04-27 13:13:34,683 INFO L290 TraceCheckUtils]: 35: Hoare triple {1837#true} assume !(0 == ~cond); {1837#true} is VALID [2022-04-27 13:13:34,684 INFO L290 TraceCheckUtils]: 36: Hoare triple {1837#true} assume true; {1837#true} is VALID [2022-04-27 13:13:34,684 INFO L284 TraceCheckUtils]: 37: Hoare quadruple {1837#true} {1941#(and (<= 0 main_~y~0) (<= main_~b~0 main_~x~0) (= main_~s~0 1) (<= main_~x~0 50) (= main_~b~0 main_~y~0) (not (= main_~b~0 0)) (= main_~q~0 0))} #102#return; {1941#(and (<= 0 main_~y~0) (<= main_~b~0 main_~x~0) (= main_~s~0 1) (<= main_~x~0 50) (= main_~b~0 main_~y~0) (not (= main_~b~0 0)) (= main_~q~0 0))} is VALID [2022-04-27 13:13:34,685 INFO L272 TraceCheckUtils]: 38: Hoare triple {1941#(and (<= 0 main_~y~0) (<= main_~b~0 main_~x~0) (= main_~s~0 1) (<= main_~x~0 50) (= main_~b~0 main_~y~0) (not (= main_~b~0 0)) (= main_~q~0 0))} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {1963#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 13:13:34,686 INFO L290 TraceCheckUtils]: 39: Hoare triple {1963#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1967#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 13:13:34,686 INFO L290 TraceCheckUtils]: 40: Hoare triple {1967#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1838#false} is VALID [2022-04-27 13:13:34,686 INFO L290 TraceCheckUtils]: 41: Hoare triple {1838#false} assume !false; {1838#false} is VALID [2022-04-27 13:13:34,687 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 2 proven. 12 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-04-27 13:13:34,687 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 13:13:35,062 INFO L290 TraceCheckUtils]: 41: Hoare triple {1838#false} assume !false; {1838#false} is VALID [2022-04-27 13:13:35,063 INFO L290 TraceCheckUtils]: 40: Hoare triple {1967#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1838#false} is VALID [2022-04-27 13:13:35,063 INFO L290 TraceCheckUtils]: 39: Hoare triple {1963#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1967#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 13:13:35,064 INFO L272 TraceCheckUtils]: 38: Hoare triple {1983#(= 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)); {1963#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 13:13:35,065 INFO L284 TraceCheckUtils]: 37: Hoare quadruple {1837#true} {1983#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} #102#return; {1983#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} is VALID [2022-04-27 13:13:35,065 INFO L290 TraceCheckUtils]: 36: Hoare triple {1837#true} assume true; {1837#true} is VALID [2022-04-27 13:13:35,065 INFO L290 TraceCheckUtils]: 35: Hoare triple {1837#true} assume !(0 == ~cond); {1837#true} is VALID [2022-04-27 13:13:35,065 INFO L290 TraceCheckUtils]: 34: Hoare triple {1837#true} ~cond := #in~cond; {1837#true} is VALID [2022-04-27 13:13:35,065 INFO L272 TraceCheckUtils]: 33: Hoare triple {1983#(= 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)); {1837#true} is VALID [2022-04-27 13:13:35,066 INFO L290 TraceCheckUtils]: 32: Hoare triple {1983#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} assume !false; {1983#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} is VALID [2022-04-27 13:13:35,066 INFO L290 TraceCheckUtils]: 31: Hoare triple {2005#(or (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (not (<= main_~b~0 main_~c~0)))} assume !!(~c~0 >= ~b~0);havoc ~d~0;havoc ~v~0;~d~0 := 1;~v~0 := ~b~0; {1983#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} is VALID [2022-04-27 13:13:35,066 INFO L290 TraceCheckUtils]: 30: Hoare triple {2005#(or (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (not (<= main_~b~0 main_~c~0)))} assume !false; {2005#(or (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (not (<= main_~b~0 main_~c~0)))} is VALID [2022-04-27 13:13:35,067 INFO L290 TraceCheckUtils]: 29: Hoare triple {2012#(or (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (= main_~b~0 0) (< main_~a~0 main_~b~0))} assume !!(0 != ~b~0);havoc ~c~0;havoc ~k~0;~c~0 := ~a~0;~k~0 := 0; {2005#(or (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (not (<= main_~b~0 main_~c~0)))} is VALID [2022-04-27 13:13:35,067 INFO L290 TraceCheckUtils]: 28: Hoare triple {2012#(or (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (= main_~b~0 0) (< main_~a~0 main_~b~0))} assume !false; {2012#(or (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (= main_~b~0 0) (< main_~a~0 main_~b~0))} is VALID [2022-04-27 13:13:35,068 INFO L290 TraceCheckUtils]: 27: Hoare triple {1837#true} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1; {2012#(or (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (= main_~b~0 0) (< main_~a~0 main_~b~0))} is VALID [2022-04-27 13:13:35,068 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {1837#true} {1837#true} #100#return; {1837#true} is VALID [2022-04-27 13:13:35,068 INFO L290 TraceCheckUtils]: 25: Hoare triple {1837#true} assume true; {1837#true} is VALID [2022-04-27 13:13:35,068 INFO L290 TraceCheckUtils]: 24: Hoare triple {1837#true} assume !(0 == ~cond); {1837#true} is VALID [2022-04-27 13:13:35,068 INFO L290 TraceCheckUtils]: 23: Hoare triple {1837#true} ~cond := #in~cond; {1837#true} is VALID [2022-04-27 13:13:35,068 INFO L272 TraceCheckUtils]: 22: Hoare triple {1837#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {1837#true} is VALID [2022-04-27 13:13:35,068 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {1837#true} {1837#true} #98#return; {1837#true} is VALID [2022-04-27 13:13:35,068 INFO L290 TraceCheckUtils]: 20: Hoare triple {1837#true} assume true; {1837#true} is VALID [2022-04-27 13:13:35,069 INFO L290 TraceCheckUtils]: 19: Hoare triple {1837#true} assume !(0 == ~cond); {1837#true} is VALID [2022-04-27 13:13:35,069 INFO L290 TraceCheckUtils]: 18: Hoare triple {1837#true} ~cond := #in~cond; {1837#true} is VALID [2022-04-27 13:13:35,069 INFO L272 TraceCheckUtils]: 17: Hoare triple {1837#true} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {1837#true} is VALID [2022-04-27 13:13:35,069 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {1837#true} {1837#true} #96#return; {1837#true} is VALID [2022-04-27 13:13:35,069 INFO L290 TraceCheckUtils]: 15: Hoare triple {1837#true} assume true; {1837#true} is VALID [2022-04-27 13:13:35,070 INFO L290 TraceCheckUtils]: 14: Hoare triple {1837#true} assume !(0 == ~cond); {1837#true} is VALID [2022-04-27 13:13:35,070 INFO L290 TraceCheckUtils]: 13: Hoare triple {1837#true} ~cond := #in~cond; {1837#true} is VALID [2022-04-27 13:13:35,070 INFO L272 TraceCheckUtils]: 12: Hoare triple {1837#true} call assume_abort_if_not((if ~y~0 >= 0 && ~y~0 <= 50 then 1 else 0)); {1837#true} is VALID [2022-04-27 13:13:35,070 INFO L290 TraceCheckUtils]: 11: Hoare triple {1837#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {1837#true} is VALID [2022-04-27 13:13:35,070 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1837#true} {1837#true} #94#return; {1837#true} is VALID [2022-04-27 13:13:35,070 INFO L290 TraceCheckUtils]: 9: Hoare triple {1837#true} assume true; {1837#true} is VALID [2022-04-27 13:13:35,070 INFO L290 TraceCheckUtils]: 8: Hoare triple {1837#true} assume !(0 == ~cond); {1837#true} is VALID [2022-04-27 13:13:35,071 INFO L290 TraceCheckUtils]: 7: Hoare triple {1837#true} ~cond := #in~cond; {1837#true} is VALID [2022-04-27 13:13:35,071 INFO L272 TraceCheckUtils]: 6: Hoare triple {1837#true} call assume_abort_if_not((if ~x~0 >= 0 && ~x~0 <= 50 then 1 else 0)); {1837#true} is VALID [2022-04-27 13:13:35,071 INFO L290 TraceCheckUtils]: 5: Hoare triple {1837#true} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~s~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4; {1837#true} is VALID [2022-04-27 13:13:35,071 INFO L272 TraceCheckUtils]: 4: Hoare triple {1837#true} call #t~ret6 := main(); {1837#true} is VALID [2022-04-27 13:13:35,071 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1837#true} {1837#true} #112#return; {1837#true} is VALID [2022-04-27 13:13:35,071 INFO L290 TraceCheckUtils]: 2: Hoare triple {1837#true} assume true; {1837#true} is VALID [2022-04-27 13:13:35,071 INFO L290 TraceCheckUtils]: 1: Hoare triple {1837#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(11, 2);call #Ultimate.allocInit(12, 3); {1837#true} is VALID [2022-04-27 13:13:35,071 INFO L272 TraceCheckUtils]: 0: Hoare triple {1837#true} call ULTIMATE.init(); {1837#true} is VALID [2022-04-27 13:13:35,072 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 13:13:35,072 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 13:13:35,072 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [309155284] [2022-04-27 13:13:35,073 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 13:13:35,073 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1397441692] [2022-04-27 13:13:35,073 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1397441692] provided 1 perfect and 1 imperfect interpolant sequences [2022-04-27 13:13:35,073 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-04-27 13:13:35,073 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [11] total 14 [2022-04-27 13:13:35,073 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [793791866] [2022-04-27 13:13:35,073 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 13:13:35,074 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 6 states have internal predecessors, (19), 2 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 42 [2022-04-27 13:13:35,076 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 13:13:35,076 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 6 states have internal predecessors, (19), 2 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2022-04-27 13:13:35,100 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 33 edges. 33 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 13:13:35,101 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-27 13:13:35,101 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 13:13:35,101 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-27 13:13:35,101 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=139, Unknown=0, NotChecked=0, Total=182 [2022-04-27 13:13:35,102 INFO L87 Difference]: Start difference. First operand 71 states and 95 transitions. Second operand has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 6 states have internal predecessors, (19), 2 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2022-04-27 13:13:35,440 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:13:35,441 INFO L93 Difference]: Finished difference Result 79 states and 102 transitions. [2022-04-27 13:13:35,441 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-27 13:13:35,441 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 6 states have internal predecessors, (19), 2 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 42 [2022-04-27 13:13:35,442 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 13:13:35,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 6 states have internal predecessors, (19), 2 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2022-04-27 13:13:35,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 67 transitions. [2022-04-27 13:13:35,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 6 states have internal predecessors, (19), 2 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2022-04-27 13:13:35,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 67 transitions. [2022-04-27 13:13:35,447 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 67 transitions. [2022-04-27 13:13:35,504 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 13:13:35,505 INFO L225 Difference]: With dead ends: 79 [2022-04-27 13:13:35,506 INFO L226 Difference]: Without dead ends: 77 [2022-04-27 13:13:35,506 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 70 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=163, Unknown=0, NotChecked=0, Total=210 [2022-04-27 13:13:35,507 INFO L413 NwaCegarLoop]: 44 mSDtfsCounter, 27 mSDsluCounter, 125 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 169 SdHoareTripleChecker+Invalid, 80 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-27 13:13:35,507 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 169 Invalid, 80 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-27 13:13:35,507 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2022-04-27 13:13:35,580 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 75. [2022-04-27 13:13:35,580 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 13:13:35,581 INFO L82 GeneralOperation]: Start isEquivalent. First operand 77 states. Second operand has 75 states, 50 states have (on average 1.24) internal successors, (62), 51 states have internal predecessors, (62), 19 states have call successors, (19), 6 states have call predecessors, (19), 5 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2022-04-27 13:13:35,582 INFO L74 IsIncluded]: Start isIncluded. First operand 77 states. Second operand has 75 states, 50 states have (on average 1.24) internal successors, (62), 51 states have internal predecessors, (62), 19 states have call successors, (19), 6 states have call predecessors, (19), 5 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2022-04-27 13:13:35,582 INFO L87 Difference]: Start difference. First operand 77 states. Second operand has 75 states, 50 states have (on average 1.24) internal successors, (62), 51 states have internal predecessors, (62), 19 states have call successors, (19), 6 states have call predecessors, (19), 5 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2022-04-27 13:13:35,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:13:35,587 INFO L93 Difference]: Finished difference Result 77 states and 100 transitions. [2022-04-27 13:13:35,587 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 100 transitions. [2022-04-27 13:13:35,587 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 13:13:35,588 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 13:13:35,588 INFO L74 IsIncluded]: Start isIncluded. First operand has 75 states, 50 states have (on average 1.24) internal successors, (62), 51 states have internal predecessors, (62), 19 states have call successors, (19), 6 states have call predecessors, (19), 5 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) Second operand 77 states. [2022-04-27 13:13:35,588 INFO L87 Difference]: Start difference. First operand has 75 states, 50 states have (on average 1.24) internal successors, (62), 51 states have internal predecessors, (62), 19 states have call successors, (19), 6 states have call predecessors, (19), 5 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) Second operand 77 states. [2022-04-27 13:13:35,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:13:35,593 INFO L93 Difference]: Finished difference Result 77 states and 100 transitions. [2022-04-27 13:13:35,593 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 100 transitions. [2022-04-27 13:13:35,595 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 13:13:35,595 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 13:13:35,595 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 13:13:35,595 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 13:13:35,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 50 states have (on average 1.24) internal successors, (62), 51 states have internal predecessors, (62), 19 states have call successors, (19), 6 states have call predecessors, (19), 5 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2022-04-27 13:13:35,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 98 transitions. [2022-04-27 13:13:35,599 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 98 transitions. Word has length 42 [2022-04-27 13:13:35,599 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 13:13:35,599 INFO L495 AbstractCegarLoop]: Abstraction has 75 states and 98 transitions. [2022-04-27 13:13:35,601 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 6 states have internal predecessors, (19), 2 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2022-04-27 13:13:35,601 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 98 transitions. [2022-04-27 13:13:35,602 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2022-04-27 13:13:35,602 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 13:13:35,602 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 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, 1] [2022-04-27 13:13:35,630 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-04-27 13:13:35,827 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 13:13:35,828 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 13:13:35,828 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 13:13:35,828 INFO L85 PathProgramCache]: Analyzing trace with hash -974923140, now seen corresponding path program 1 times [2022-04-27 13:13:35,828 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 13:13:35,828 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [915026829] [2022-04-27 13:13:35,828 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 13:13:35,828 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 13:13:35,842 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 13:13:35,842 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [837750983] [2022-04-27 13:13:35,842 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 13:13:35,842 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 13:13:35,842 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 13:13:35,843 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 13:13:35,852 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 13:13:35,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 13:13:35,889 INFO L263 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 30 conjunts are in the unsatisfiable core [2022-04-27 13:13:35,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 13:13:35,900 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 13:13:36,444 INFO L272 TraceCheckUtils]: 0: Hoare triple {2488#true} call ULTIMATE.init(); {2488#true} is VALID [2022-04-27 13:13:36,444 INFO L290 TraceCheckUtils]: 1: Hoare triple {2488#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(11, 2);call #Ultimate.allocInit(12, 3); {2488#true} is VALID [2022-04-27 13:13:36,444 INFO L290 TraceCheckUtils]: 2: Hoare triple {2488#true} assume true; {2488#true} is VALID [2022-04-27 13:13:36,445 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2488#true} {2488#true} #112#return; {2488#true} is VALID [2022-04-27 13:13:36,445 INFO L272 TraceCheckUtils]: 4: Hoare triple {2488#true} call #t~ret6 := main(); {2488#true} is VALID [2022-04-27 13:13:36,445 INFO L290 TraceCheckUtils]: 5: Hoare triple {2488#true} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~s~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4; {2488#true} is VALID [2022-04-27 13:13:36,445 INFO L272 TraceCheckUtils]: 6: Hoare triple {2488#true} call assume_abort_if_not((if ~x~0 >= 0 && ~x~0 <= 50 then 1 else 0)); {2488#true} is VALID [2022-04-27 13:13:36,445 INFO L290 TraceCheckUtils]: 7: Hoare triple {2488#true} ~cond := #in~cond; {2488#true} is VALID [2022-04-27 13:13:36,445 INFO L290 TraceCheckUtils]: 8: Hoare triple {2488#true} assume !(0 == ~cond); {2488#true} is VALID [2022-04-27 13:13:36,446 INFO L290 TraceCheckUtils]: 9: Hoare triple {2488#true} assume true; {2488#true} is VALID [2022-04-27 13:13:36,446 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {2488#true} {2488#true} #94#return; {2488#true} is VALID [2022-04-27 13:13:36,446 INFO L290 TraceCheckUtils]: 11: Hoare triple {2488#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {2488#true} is VALID [2022-04-27 13:13:36,446 INFO L272 TraceCheckUtils]: 12: Hoare triple {2488#true} call assume_abort_if_not((if ~y~0 >= 0 && ~y~0 <= 50 then 1 else 0)); {2488#true} is VALID [2022-04-27 13:13:36,446 INFO L290 TraceCheckUtils]: 13: Hoare triple {2488#true} ~cond := #in~cond; {2532#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-04-27 13:13:36,447 INFO L290 TraceCheckUtils]: 14: Hoare triple {2532#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} assume !(0 == ~cond); {2536#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-27 13:13:36,447 INFO L290 TraceCheckUtils]: 15: Hoare triple {2536#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {2536#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-27 13:13:36,448 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {2536#(not (= |assume_abort_if_not_#in~cond| 0))} {2488#true} #96#return; {2543#(and (<= 0 main_~y~0) (<= main_~y~0 50))} is VALID [2022-04-27 13:13:36,448 INFO L272 TraceCheckUtils]: 17: Hoare triple {2543#(and (<= 0 main_~y~0) (<= main_~y~0 50))} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {2488#true} is VALID [2022-04-27 13:13:36,448 INFO L290 TraceCheckUtils]: 18: Hoare triple {2488#true} ~cond := #in~cond; {2532#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-04-27 13:13:36,448 INFO L290 TraceCheckUtils]: 19: Hoare triple {2532#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} assume !(0 == ~cond); {2536#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-27 13:13:36,449 INFO L290 TraceCheckUtils]: 20: Hoare triple {2536#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {2536#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-27 13:13:36,449 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {2536#(not (= |assume_abort_if_not_#in~cond| 0))} {2543#(and (<= 0 main_~y~0) (<= main_~y~0 50))} #98#return; {2559#(and (<= 0 main_~y~0) (<= 1 main_~x~0) (<= main_~y~0 50))} is VALID [2022-04-27 13:13:36,449 INFO L272 TraceCheckUtils]: 22: Hoare triple {2559#(and (<= 0 main_~y~0) (<= 1 main_~x~0) (<= main_~y~0 50))} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {2488#true} is VALID [2022-04-27 13:13:36,450 INFO L290 TraceCheckUtils]: 23: Hoare triple {2488#true} ~cond := #in~cond; {2488#true} is VALID [2022-04-27 13:13:36,450 INFO L290 TraceCheckUtils]: 24: Hoare triple {2488#true} assume !(0 == ~cond); {2488#true} is VALID [2022-04-27 13:13:36,450 INFO L290 TraceCheckUtils]: 25: Hoare triple {2488#true} assume true; {2488#true} is VALID [2022-04-27 13:13:36,450 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {2488#true} {2559#(and (<= 0 main_~y~0) (<= 1 main_~x~0) (<= main_~y~0 50))} #100#return; {2559#(and (<= 0 main_~y~0) (<= 1 main_~x~0) (<= main_~y~0 50))} is VALID [2022-04-27 13:13:36,451 INFO L290 TraceCheckUtils]: 27: Hoare triple {2559#(and (<= 0 main_~y~0) (<= 1 main_~x~0) (<= main_~y~0 50))} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1; {2578#(and (<= 0 main_~y~0) (<= 1 main_~x~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (<= main_~x~0 main_~a~0) (<= main_~y~0 50))} is VALID [2022-04-27 13:13:36,451 INFO L290 TraceCheckUtils]: 28: Hoare triple {2578#(and (<= 0 main_~y~0) (<= 1 main_~x~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (<= main_~x~0 main_~a~0) (<= main_~y~0 50))} assume !false; {2578#(and (<= 0 main_~y~0) (<= 1 main_~x~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (<= main_~x~0 main_~a~0) (<= main_~y~0 50))} is VALID [2022-04-27 13:13:36,452 INFO L290 TraceCheckUtils]: 29: Hoare triple {2578#(and (<= 0 main_~y~0) (<= 1 main_~x~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (<= main_~x~0 main_~a~0) (<= main_~y~0 50))} assume !!(0 != ~b~0);havoc ~c~0;havoc ~k~0;~c~0 := ~a~0;~k~0 := 0; {2585#(and (<= 0 main_~y~0) (<= 1 main_~x~0) (= main_~s~0 1) (<= main_~x~0 main_~c~0) (= main_~b~0 main_~y~0) (= main_~q~0 0) (<= main_~y~0 50))} is VALID [2022-04-27 13:13:36,452 INFO L290 TraceCheckUtils]: 30: Hoare triple {2585#(and (<= 0 main_~y~0) (<= 1 main_~x~0) (= main_~s~0 1) (<= main_~x~0 main_~c~0) (= main_~b~0 main_~y~0) (= main_~q~0 0) (<= main_~y~0 50))} assume !false; {2585#(and (<= 0 main_~y~0) (<= 1 main_~x~0) (= main_~s~0 1) (<= main_~x~0 main_~c~0) (= main_~b~0 main_~y~0) (= main_~q~0 0) (<= main_~y~0 50))} is VALID [2022-04-27 13:13:36,453 INFO L290 TraceCheckUtils]: 31: Hoare triple {2585#(and (<= 0 main_~y~0) (<= 1 main_~x~0) (= main_~s~0 1) (<= main_~x~0 main_~c~0) (= main_~b~0 main_~y~0) (= main_~q~0 0) (<= main_~y~0 50))} assume !(~c~0 >= ~b~0); {2592#(and (<= 1 main_~x~0) (< main_~x~0 main_~b~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (<= main_~y~0 50))} is VALID [2022-04-27 13:13:36,454 INFO L290 TraceCheckUtils]: 32: Hoare triple {2592#(and (<= 1 main_~x~0) (< main_~x~0 main_~b~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (<= main_~y~0 50))} ~a~0 := ~b~0;~b~0 := ~c~0;havoc ~temp~0;~temp~0 := ~p~0;~p~0 := ~q~0;~q~0 := ~temp~0 - ~q~0 * ~k~0;~temp~0 := ~r~0;~r~0 := ~s~0;~s~0 := ~temp~0 - ~s~0 * ~k~0; {2596#(and (<= 1 main_~x~0) (= main_~p~0 0) (= main_~r~0 1) (= main_~a~0 main_~y~0) (< main_~x~0 main_~a~0) (<= main_~y~0 50))} is VALID [2022-04-27 13:13:36,454 INFO L290 TraceCheckUtils]: 33: Hoare triple {2596#(and (<= 1 main_~x~0) (= main_~p~0 0) (= main_~r~0 1) (= main_~a~0 main_~y~0) (< main_~x~0 main_~a~0) (<= main_~y~0 50))} assume !false; {2596#(and (<= 1 main_~x~0) (= main_~p~0 0) (= main_~r~0 1) (= main_~a~0 main_~y~0) (< main_~x~0 main_~a~0) (<= main_~y~0 50))} is VALID [2022-04-27 13:13:36,455 INFO L290 TraceCheckUtils]: 34: Hoare triple {2596#(and (<= 1 main_~x~0) (= main_~p~0 0) (= main_~r~0 1) (= main_~a~0 main_~y~0) (< main_~x~0 main_~a~0) (<= main_~y~0 50))} assume !!(0 != ~b~0);havoc ~c~0;havoc ~k~0;~c~0 := ~a~0;~k~0 := 0; {2596#(and (<= 1 main_~x~0) (= main_~p~0 0) (= main_~r~0 1) (= main_~a~0 main_~y~0) (< main_~x~0 main_~a~0) (<= main_~y~0 50))} is VALID [2022-04-27 13:13:36,455 INFO L290 TraceCheckUtils]: 35: Hoare triple {2596#(and (<= 1 main_~x~0) (= main_~p~0 0) (= main_~r~0 1) (= main_~a~0 main_~y~0) (< main_~x~0 main_~a~0) (<= main_~y~0 50))} assume !false; {2596#(and (<= 1 main_~x~0) (= main_~p~0 0) (= main_~r~0 1) (= main_~a~0 main_~y~0) (< main_~x~0 main_~a~0) (<= main_~y~0 50))} is VALID [2022-04-27 13:13:36,456 INFO L290 TraceCheckUtils]: 36: Hoare triple {2596#(and (<= 1 main_~x~0) (= main_~p~0 0) (= main_~r~0 1) (= main_~a~0 main_~y~0) (< main_~x~0 main_~a~0) (<= main_~y~0 50))} assume !!(~c~0 >= ~b~0);havoc ~d~0;havoc ~v~0;~d~0 := 1;~v~0 := ~b~0; {2596#(and (<= 1 main_~x~0) (= main_~p~0 0) (= main_~r~0 1) (= main_~a~0 main_~y~0) (< main_~x~0 main_~a~0) (<= main_~y~0 50))} is VALID [2022-04-27 13:13:36,456 INFO L290 TraceCheckUtils]: 37: Hoare triple {2596#(and (<= 1 main_~x~0) (= main_~p~0 0) (= main_~r~0 1) (= main_~a~0 main_~y~0) (< main_~x~0 main_~a~0) (<= main_~y~0 50))} assume !false; {2596#(and (<= 1 main_~x~0) (= main_~p~0 0) (= main_~r~0 1) (= main_~a~0 main_~y~0) (< main_~x~0 main_~a~0) (<= main_~y~0 50))} is VALID [2022-04-27 13:13:36,457 INFO L272 TraceCheckUtils]: 38: Hoare triple {2596#(and (<= 1 main_~x~0) (= main_~p~0 0) (= main_~r~0 1) (= main_~a~0 main_~y~0) (< main_~x~0 main_~a~0) (<= main_~y~0 50))} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {2615#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 13:13:36,457 INFO L290 TraceCheckUtils]: 39: Hoare triple {2615#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {2619#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 13:13:36,458 INFO L290 TraceCheckUtils]: 40: Hoare triple {2619#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {2489#false} is VALID [2022-04-27 13:13:36,458 INFO L290 TraceCheckUtils]: 41: Hoare triple {2489#false} assume !false; {2489#false} is VALID [2022-04-27 13:13:36,458 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 6 proven. 10 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-04-27 13:13:36,458 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 13:13:36,816 INFO L290 TraceCheckUtils]: 41: Hoare triple {2489#false} assume !false; {2489#false} is VALID [2022-04-27 13:13:36,816 INFO L290 TraceCheckUtils]: 40: Hoare triple {2619#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {2489#false} is VALID [2022-04-27 13:13:36,817 INFO L290 TraceCheckUtils]: 39: Hoare triple {2615#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {2619#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 13:13:36,818 INFO L272 TraceCheckUtils]: 38: Hoare triple {2635#(= 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)); {2615#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 13:13:36,818 INFO L290 TraceCheckUtils]: 37: Hoare triple {2635#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} assume !false; {2635#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} is VALID [2022-04-27 13:13:36,819 INFO L290 TraceCheckUtils]: 36: Hoare triple {2635#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} assume !!(~c~0 >= ~b~0);havoc ~d~0;havoc ~v~0;~d~0 := 1;~v~0 := ~b~0; {2635#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} is VALID [2022-04-27 13:13:36,819 INFO L290 TraceCheckUtils]: 35: Hoare triple {2635#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} assume !false; {2635#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} is VALID [2022-04-27 13:13:36,820 INFO L290 TraceCheckUtils]: 34: Hoare triple {2635#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} assume !!(0 != ~b~0);havoc ~c~0;havoc ~k~0;~c~0 := ~a~0;~k~0 := 0; {2635#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} is VALID [2022-04-27 13:13:36,820 INFO L290 TraceCheckUtils]: 33: Hoare triple {2635#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} assume !false; {2635#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} is VALID [2022-04-27 13:13:36,821 INFO L290 TraceCheckUtils]: 32: Hoare triple {2654#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} ~a~0 := ~b~0;~b~0 := ~c~0;havoc ~temp~0;~temp~0 := ~p~0;~p~0 := ~q~0;~q~0 := ~temp~0 - ~q~0 * ~k~0;~temp~0 := ~r~0;~r~0 := ~s~0;~s~0 := ~temp~0 - ~s~0 * ~k~0; {2635#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} is VALID [2022-04-27 13:13:36,823 INFO L290 TraceCheckUtils]: 31: Hoare triple {2658#(or (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (<= main_~b~0 main_~c~0))} assume !(~c~0 >= ~b~0); {2654#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} is VALID [2022-04-27 13:13:36,828 INFO L290 TraceCheckUtils]: 30: Hoare triple {2658#(or (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (<= main_~b~0 main_~c~0))} assume !false; {2658#(or (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (<= main_~b~0 main_~c~0))} is VALID [2022-04-27 13:13:36,829 INFO L290 TraceCheckUtils]: 29: Hoare triple {2665#(or (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (<= main_~b~0 main_~a~0))} assume !!(0 != ~b~0);havoc ~c~0;havoc ~k~0;~c~0 := ~a~0;~k~0 := 0; {2658#(or (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (<= main_~b~0 main_~c~0))} is VALID [2022-04-27 13:13:36,829 INFO L290 TraceCheckUtils]: 28: Hoare triple {2665#(or (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (<= main_~b~0 main_~a~0))} assume !false; {2665#(or (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (<= main_~b~0 main_~a~0))} is VALID [2022-04-27 13:13:36,830 INFO L290 TraceCheckUtils]: 27: Hoare triple {2488#true} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1; {2665#(or (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (<= main_~b~0 main_~a~0))} is VALID [2022-04-27 13:13:36,830 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {2488#true} {2488#true} #100#return; {2488#true} is VALID [2022-04-27 13:13:36,830 INFO L290 TraceCheckUtils]: 25: Hoare triple {2488#true} assume true; {2488#true} is VALID [2022-04-27 13:13:36,830 INFO L290 TraceCheckUtils]: 24: Hoare triple {2488#true} assume !(0 == ~cond); {2488#true} is VALID [2022-04-27 13:13:36,830 INFO L290 TraceCheckUtils]: 23: Hoare triple {2488#true} ~cond := #in~cond; {2488#true} is VALID [2022-04-27 13:13:36,830 INFO L272 TraceCheckUtils]: 22: Hoare triple {2488#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {2488#true} is VALID [2022-04-27 13:13:36,831 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {2488#true} {2488#true} #98#return; {2488#true} is VALID [2022-04-27 13:13:36,831 INFO L290 TraceCheckUtils]: 20: Hoare triple {2488#true} assume true; {2488#true} is VALID [2022-04-27 13:13:36,831 INFO L290 TraceCheckUtils]: 19: Hoare triple {2488#true} assume !(0 == ~cond); {2488#true} is VALID [2022-04-27 13:13:36,831 INFO L290 TraceCheckUtils]: 18: Hoare triple {2488#true} ~cond := #in~cond; {2488#true} is VALID [2022-04-27 13:13:36,831 INFO L272 TraceCheckUtils]: 17: Hoare triple {2488#true} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {2488#true} is VALID [2022-04-27 13:13:36,831 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {2488#true} {2488#true} #96#return; {2488#true} is VALID [2022-04-27 13:13:36,831 INFO L290 TraceCheckUtils]: 15: Hoare triple {2488#true} assume true; {2488#true} is VALID [2022-04-27 13:13:36,831 INFO L290 TraceCheckUtils]: 14: Hoare triple {2488#true} assume !(0 == ~cond); {2488#true} is VALID [2022-04-27 13:13:36,831 INFO L290 TraceCheckUtils]: 13: Hoare triple {2488#true} ~cond := #in~cond; {2488#true} is VALID [2022-04-27 13:13:36,832 INFO L272 TraceCheckUtils]: 12: Hoare triple {2488#true} call assume_abort_if_not((if ~y~0 >= 0 && ~y~0 <= 50 then 1 else 0)); {2488#true} is VALID [2022-04-27 13:13:36,832 INFO L290 TraceCheckUtils]: 11: Hoare triple {2488#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {2488#true} is VALID [2022-04-27 13:13:36,832 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {2488#true} {2488#true} #94#return; {2488#true} is VALID [2022-04-27 13:13:36,832 INFO L290 TraceCheckUtils]: 9: Hoare triple {2488#true} assume true; {2488#true} is VALID [2022-04-27 13:13:36,832 INFO L290 TraceCheckUtils]: 8: Hoare triple {2488#true} assume !(0 == ~cond); {2488#true} is VALID [2022-04-27 13:13:36,832 INFO L290 TraceCheckUtils]: 7: Hoare triple {2488#true} ~cond := #in~cond; {2488#true} is VALID [2022-04-27 13:13:36,832 INFO L272 TraceCheckUtils]: 6: Hoare triple {2488#true} call assume_abort_if_not((if ~x~0 >= 0 && ~x~0 <= 50 then 1 else 0)); {2488#true} is VALID [2022-04-27 13:13:36,832 INFO L290 TraceCheckUtils]: 5: Hoare triple {2488#true} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~s~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4; {2488#true} is VALID [2022-04-27 13:13:36,833 INFO L272 TraceCheckUtils]: 4: Hoare triple {2488#true} call #t~ret6 := main(); {2488#true} is VALID [2022-04-27 13:13:36,833 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2488#true} {2488#true} #112#return; {2488#true} is VALID [2022-04-27 13:13:36,833 INFO L290 TraceCheckUtils]: 2: Hoare triple {2488#true} assume true; {2488#true} is VALID [2022-04-27 13:13:36,833 INFO L290 TraceCheckUtils]: 1: Hoare triple {2488#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(11, 2);call #Ultimate.allocInit(12, 3); {2488#true} is VALID [2022-04-27 13:13:36,833 INFO L272 TraceCheckUtils]: 0: Hoare triple {2488#true} call ULTIMATE.init(); {2488#true} is VALID [2022-04-27 13:13:36,833 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-04-27 13:13:36,834 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 13:13:36,834 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [915026829] [2022-04-27 13:13:36,834 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 13:13:36,834 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [837750983] [2022-04-27 13:13:36,834 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [837750983] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 13:13:36,834 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-27 13:13:36,834 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 8] total 16 [2022-04-27 13:13:36,834 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1191581297] [2022-04-27 13:13:36,834 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-27 13:13:36,835 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 2.3333333333333335) internal successors, (35), 13 states have internal predecessors, (35), 5 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) Word has length 42 [2022-04-27 13:13:36,835 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 13:13:36,836 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 16 states, 15 states have (on average 2.3333333333333335) internal successors, (35), 13 states have internal predecessors, (35), 5 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2022-04-27 13:13:36,876 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 53 edges. 53 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 13:13:36,877 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-04-27 13:13:36,877 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 13:13:36,877 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-04-27 13:13:36,877 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=190, Unknown=0, NotChecked=0, Total=240 [2022-04-27 13:13:36,878 INFO L87 Difference]: Start difference. First operand 75 states and 98 transitions. Second operand has 16 states, 15 states have (on average 2.3333333333333335) internal successors, (35), 13 states have internal predecessors, (35), 5 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2022-04-27 13:13:43,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:13:43,132 INFO L93 Difference]: Finished difference Result 118 states and 159 transitions. [2022-04-27 13:13:43,132 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-04-27 13:13:43,132 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 2.3333333333333335) internal successors, (35), 13 states have internal predecessors, (35), 5 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) Word has length 42 [2022-04-27 13:13:43,133 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 13:13:43,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 15 states have (on average 2.3333333333333335) internal successors, (35), 13 states have internal predecessors, (35), 5 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2022-04-27 13:13:43,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 121 transitions. [2022-04-27 13:13:43,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 15 states have (on average 2.3333333333333335) internal successors, (35), 13 states have internal predecessors, (35), 5 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2022-04-27 13:13:43,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 121 transitions. [2022-04-27 13:13:43,138 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 16 states and 121 transitions. [2022-04-27 13:13:43,266 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 121 edges. 121 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 13:13:43,268 INFO L225 Difference]: With dead ends: 118 [2022-04-27 13:13:43,268 INFO L226 Difference]: Without dead ends: 116 [2022-04-27 13:13:43,268 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 68 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 88 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=132, Invalid=468, Unknown=0, NotChecked=0, Total=600 [2022-04-27 13:13:43,269 INFO L413 NwaCegarLoop]: 47 mSDtfsCounter, 95 mSDsluCounter, 211 mSDsCounter, 0 mSdLazyCounter, 385 mSolverCounterSat, 94 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 96 SdHoareTripleChecker+Valid, 258 SdHoareTripleChecker+Invalid, 479 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 94 IncrementalHoareTripleChecker+Valid, 385 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2022-04-27 13:13:43,269 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [96 Valid, 258 Invalid, 479 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [94 Valid, 385 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2022-04-27 13:13:43,269 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2022-04-27 13:13:43,451 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 105. [2022-04-27 13:13:43,452 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 13:13:43,452 INFO L82 GeneralOperation]: Start isEquivalent. First operand 116 states. Second operand has 105 states, 71 states have (on average 1.2535211267605635) internal successors, (89), 72 states have internal predecessors, (89), 27 states have call successors, (27), 7 states have call predecessors, (27), 6 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) [2022-04-27 13:13:43,452 INFO L74 IsIncluded]: Start isIncluded. First operand 116 states. Second operand has 105 states, 71 states have (on average 1.2535211267605635) internal successors, (89), 72 states have internal predecessors, (89), 27 states have call successors, (27), 7 states have call predecessors, (27), 6 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) [2022-04-27 13:13:43,453 INFO L87 Difference]: Start difference. First operand 116 states. Second operand has 105 states, 71 states have (on average 1.2535211267605635) internal successors, (89), 72 states have internal predecessors, (89), 27 states have call successors, (27), 7 states have call predecessors, (27), 6 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) [2022-04-27 13:13:43,457 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:13:43,457 INFO L93 Difference]: Finished difference Result 116 states and 157 transitions. [2022-04-27 13:13:43,458 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 157 transitions. [2022-04-27 13:13:43,458 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 13:13:43,458 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 13:13:43,459 INFO L74 IsIncluded]: Start isIncluded. First operand has 105 states, 71 states have (on average 1.2535211267605635) internal successors, (89), 72 states have internal predecessors, (89), 27 states have call successors, (27), 7 states have call predecessors, (27), 6 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) Second operand 116 states. [2022-04-27 13:13:43,459 INFO L87 Difference]: Start difference. First operand has 105 states, 71 states have (on average 1.2535211267605635) internal successors, (89), 72 states have internal predecessors, (89), 27 states have call successors, (27), 7 states have call predecessors, (27), 6 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) Second operand 116 states. [2022-04-27 13:13:43,463 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:13:43,463 INFO L93 Difference]: Finished difference Result 116 states and 157 transitions. [2022-04-27 13:13:43,464 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 157 transitions. [2022-04-27 13:13:43,464 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 13:13:43,464 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 13:13:43,464 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 13:13:43,464 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 13:13:43,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 71 states have (on average 1.2535211267605635) internal successors, (89), 72 states have internal predecessors, (89), 27 states have call successors, (27), 7 states have call predecessors, (27), 6 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) [2022-04-27 13:13:43,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 141 transitions. [2022-04-27 13:13:43,468 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 141 transitions. Word has length 42 [2022-04-27 13:13:43,468 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 13:13:43,469 INFO L495 AbstractCegarLoop]: Abstraction has 105 states and 141 transitions. [2022-04-27 13:13:43,469 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 2.3333333333333335) internal successors, (35), 13 states have internal predecessors, (35), 5 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2022-04-27 13:13:43,469 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 141 transitions. [2022-04-27 13:13:43,469 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2022-04-27 13:13:43,469 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 13:13:43,469 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, 1, 1, 1, 1] [2022-04-27 13:13:43,487 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 13:13:43,679 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 13:13:43,679 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 13:13:43,680 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 13:13:43,680 INFO L85 PathProgramCache]: Analyzing trace with hash 81990170, now seen corresponding path program 1 times [2022-04-27 13:13:43,680 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 13:13:43,680 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1304778036] [2022-04-27 13:13:43,680 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 13:13:43,680 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 13:13:43,700 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 13:13:43,700 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [556339950] [2022-04-27 13:13:43,700 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 13:13:43,700 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 13:13:43,701 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 13:13:43,704 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 13:13:43,705 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 13:13:43,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 13:13:43,741 INFO L263 TraceCheckSpWp]: Trace formula consists of 135 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-27 13:13:43,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 13:13:43,750 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 13:13:47,914 INFO L272 TraceCheckUtils]: 0: Hoare triple {3342#true} call ULTIMATE.init(); {3342#true} is VALID [2022-04-27 13:13:47,914 INFO L290 TraceCheckUtils]: 1: Hoare triple {3342#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(11, 2);call #Ultimate.allocInit(12, 3); {3342#true} is VALID [2022-04-27 13:13:47,914 INFO L290 TraceCheckUtils]: 2: Hoare triple {3342#true} assume true; {3342#true} is VALID [2022-04-27 13:13:47,914 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3342#true} {3342#true} #112#return; {3342#true} is VALID [2022-04-27 13:13:47,914 INFO L272 TraceCheckUtils]: 4: Hoare triple {3342#true} call #t~ret6 := main(); {3342#true} is VALID [2022-04-27 13:13:47,914 INFO L290 TraceCheckUtils]: 5: Hoare triple {3342#true} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~s~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4; {3342#true} is VALID [2022-04-27 13:13:47,914 INFO L272 TraceCheckUtils]: 6: Hoare triple {3342#true} call assume_abort_if_not((if ~x~0 >= 0 && ~x~0 <= 50 then 1 else 0)); {3342#true} is VALID [2022-04-27 13:13:47,914 INFO L290 TraceCheckUtils]: 7: Hoare triple {3342#true} ~cond := #in~cond; {3342#true} is VALID [2022-04-27 13:13:47,914 INFO L290 TraceCheckUtils]: 8: Hoare triple {3342#true} assume !(0 == ~cond); {3342#true} is VALID [2022-04-27 13:13:47,914 INFO L290 TraceCheckUtils]: 9: Hoare triple {3342#true} assume true; {3342#true} is VALID [2022-04-27 13:13:47,914 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {3342#true} {3342#true} #94#return; {3342#true} is VALID [2022-04-27 13:13:47,915 INFO L290 TraceCheckUtils]: 11: Hoare triple {3342#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {3342#true} is VALID [2022-04-27 13:13:47,915 INFO L272 TraceCheckUtils]: 12: Hoare triple {3342#true} call assume_abort_if_not((if ~y~0 >= 0 && ~y~0 <= 50 then 1 else 0)); {3342#true} is VALID [2022-04-27 13:13:47,915 INFO L290 TraceCheckUtils]: 13: Hoare triple {3342#true} ~cond := #in~cond; {3342#true} is VALID [2022-04-27 13:13:47,915 INFO L290 TraceCheckUtils]: 14: Hoare triple {3342#true} assume !(0 == ~cond); {3342#true} is VALID [2022-04-27 13:13:47,915 INFO L290 TraceCheckUtils]: 15: Hoare triple {3342#true} assume true; {3342#true} is VALID [2022-04-27 13:13:47,915 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {3342#true} {3342#true} #96#return; {3342#true} is VALID [2022-04-27 13:13:47,915 INFO L272 TraceCheckUtils]: 17: Hoare triple {3342#true} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {3342#true} is VALID [2022-04-27 13:13:47,915 INFO L290 TraceCheckUtils]: 18: Hoare triple {3342#true} ~cond := #in~cond; {3342#true} is VALID [2022-04-27 13:13:47,915 INFO L290 TraceCheckUtils]: 19: Hoare triple {3342#true} assume !(0 == ~cond); {3342#true} is VALID [2022-04-27 13:13:47,915 INFO L290 TraceCheckUtils]: 20: Hoare triple {3342#true} assume true; {3342#true} is VALID [2022-04-27 13:13:47,916 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {3342#true} {3342#true} #98#return; {3342#true} is VALID [2022-04-27 13:13:47,916 INFO L272 TraceCheckUtils]: 22: Hoare triple {3342#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {3342#true} is VALID [2022-04-27 13:13:47,916 INFO L290 TraceCheckUtils]: 23: Hoare triple {3342#true} ~cond := #in~cond; {3342#true} is VALID [2022-04-27 13:13:47,916 INFO L290 TraceCheckUtils]: 24: Hoare triple {3342#true} assume !(0 == ~cond); {3342#true} is VALID [2022-04-27 13:13:47,916 INFO L290 TraceCheckUtils]: 25: Hoare triple {3342#true} assume true; {3342#true} is VALID [2022-04-27 13:13:47,916 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {3342#true} {3342#true} #100#return; {3342#true} is VALID [2022-04-27 13:13:47,916 INFO L290 TraceCheckUtils]: 27: Hoare triple {3342#true} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1; {3342#true} is VALID [2022-04-27 13:13:47,916 INFO L290 TraceCheckUtils]: 28: Hoare triple {3342#true} assume !false; {3342#true} is VALID [2022-04-27 13:13:47,923 INFO L290 TraceCheckUtils]: 29: Hoare triple {3342#true} assume !!(0 != ~b~0);havoc ~c~0;havoc ~k~0;~c~0 := ~a~0;~k~0 := 0; {3434#(and (= main_~c~0 main_~a~0) (= main_~k~0 0))} is VALID [2022-04-27 13:13:47,924 INFO L290 TraceCheckUtils]: 30: Hoare triple {3434#(and (= main_~c~0 main_~a~0) (= main_~k~0 0))} assume !false; {3434#(and (= main_~c~0 main_~a~0) (= main_~k~0 0))} is VALID [2022-04-27 13:13:47,924 INFO L290 TraceCheckUtils]: 31: Hoare triple {3434#(and (= main_~c~0 main_~a~0) (= main_~k~0 0))} assume !!(~c~0 >= ~b~0);havoc ~d~0;havoc ~v~0;~d~0 := 1;~v~0 := ~b~0; {3434#(and (= main_~c~0 main_~a~0) (= main_~k~0 0))} is VALID [2022-04-27 13:13:47,925 INFO L290 TraceCheckUtils]: 32: Hoare triple {3434#(and (= main_~c~0 main_~a~0) (= main_~k~0 0))} assume !false; {3434#(and (= main_~c~0 main_~a~0) (= main_~k~0 0))} is VALID [2022-04-27 13:13:47,925 INFO L272 TraceCheckUtils]: 33: Hoare triple {3434#(and (= main_~c~0 main_~a~0) (= main_~k~0 0))} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {3342#true} is VALID [2022-04-27 13:13:47,925 INFO L290 TraceCheckUtils]: 34: Hoare triple {3342#true} ~cond := #in~cond; {3342#true} is VALID [2022-04-27 13:13:47,925 INFO L290 TraceCheckUtils]: 35: Hoare triple {3342#true} assume !(0 == ~cond); {3342#true} is VALID [2022-04-27 13:13:47,925 INFO L290 TraceCheckUtils]: 36: Hoare triple {3342#true} assume true; {3342#true} is VALID [2022-04-27 13:13:47,927 INFO L284 TraceCheckUtils]: 37: Hoare quadruple {3342#true} {3434#(and (= main_~c~0 main_~a~0) (= main_~k~0 0))} #102#return; {3434#(and (= main_~c~0 main_~a~0) (= main_~k~0 0))} is VALID [2022-04-27 13:13:47,927 INFO L272 TraceCheckUtils]: 38: Hoare triple {3434#(and (= main_~c~0 main_~a~0) (= main_~k~0 0))} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {3342#true} is VALID [2022-04-27 13:13:47,927 INFO L290 TraceCheckUtils]: 39: Hoare triple {3342#true} ~cond := #in~cond; {3342#true} is VALID [2022-04-27 13:13:47,927 INFO L290 TraceCheckUtils]: 40: Hoare triple {3342#true} assume !(0 == ~cond); {3342#true} is VALID [2022-04-27 13:13:47,927 INFO L290 TraceCheckUtils]: 41: Hoare triple {3342#true} assume true; {3342#true} is VALID [2022-04-27 13:13:47,928 INFO L284 TraceCheckUtils]: 42: Hoare quadruple {3342#true} {3434#(and (= main_~c~0 main_~a~0) (= main_~k~0 0))} #104#return; {3434#(and (= main_~c~0 main_~a~0) (= main_~k~0 0))} is VALID [2022-04-27 13:13:47,929 INFO L272 TraceCheckUtils]: 43: Hoare triple {3434#(and (= main_~c~0 main_~a~0) (= main_~k~0 0))} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {3477#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 13:13:47,930 INFO L290 TraceCheckUtils]: 44: Hoare triple {3477#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {3481#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 13:13:47,930 INFO L290 TraceCheckUtils]: 45: Hoare triple {3481#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {3343#false} is VALID [2022-04-27 13:13:47,930 INFO L290 TraceCheckUtils]: 46: Hoare triple {3343#false} assume !false; {3343#false} is VALID [2022-04-27 13:13:47,930 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 13:13:47,930 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-27 13:13:47,931 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 13:13:47,931 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1304778036] [2022-04-27 13:13:47,931 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 13:13:47,931 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [556339950] [2022-04-27 13:13:47,931 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [556339950] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 13:13:47,931 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 13:13:47,931 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-27 13:13:47,931 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1160663050] [2022-04-27 13:13:47,931 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 13:13:47,932 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.8) internal successors, (19), 4 states have internal predecessors, (19), 2 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 47 [2022-04-27 13:13:47,932 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 13:13:47,932 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 3.8) internal successors, (19), 4 states have internal predecessors, (19), 2 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-04-27 13:13:47,961 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 13:13:47,961 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-27 13:13:47,961 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 13:13:47,962 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-27 13:13:47,962 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-27 13:13:47,962 INFO L87 Difference]: Start difference. First operand 105 states and 141 transitions. Second operand has 5 states, 5 states have (on average 3.8) internal successors, (19), 4 states have internal predecessors, (19), 2 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-04-27 13:13:48,448 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:13:48,448 INFO L93 Difference]: Finished difference Result 151 states and 213 transitions. [2022-04-27 13:13:48,448 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-27 13:13:48,449 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.8) internal successors, (19), 4 states have internal predecessors, (19), 2 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 47 [2022-04-27 13:13:48,449 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 13:13:48,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.8) internal successors, (19), 4 states have internal predecessors, (19), 2 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-04-27 13:13:48,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 65 transitions. [2022-04-27 13:13:48,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.8) internal successors, (19), 4 states have internal predecessors, (19), 2 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-04-27 13:13:48,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 65 transitions. [2022-04-27 13:13:48,452 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 65 transitions. [2022-04-27 13:13:48,505 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 13:13:48,508 INFO L225 Difference]: With dead ends: 151 [2022-04-27 13:13:48,508 INFO L226 Difference]: Without dead ends: 149 [2022-04-27 13:13:48,508 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 43 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 13:13:48,509 INFO L413 NwaCegarLoop]: 42 mSDtfsCounter, 8 mSDsluCounter, 104 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 146 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 13:13:48,509 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 146 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 13:13:48,510 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2022-04-27 13:13:48,805 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 143. [2022-04-27 13:13:48,805 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 13:13:48,806 INFO L82 GeneralOperation]: Start isEquivalent. First operand 149 states. Second operand has 143 states, 88 states have (on average 1.2840909090909092) internal successors, (113), 89 states have internal predecessors, (113), 47 states have call successors, (47), 8 states have call predecessors, (47), 7 states have return successors, (45), 45 states have call predecessors, (45), 45 states have call successors, (45) [2022-04-27 13:13:48,806 INFO L74 IsIncluded]: Start isIncluded. First operand 149 states. Second operand has 143 states, 88 states have (on average 1.2840909090909092) internal successors, (113), 89 states have internal predecessors, (113), 47 states have call successors, (47), 8 states have call predecessors, (47), 7 states have return successors, (45), 45 states have call predecessors, (45), 45 states have call successors, (45) [2022-04-27 13:13:48,806 INFO L87 Difference]: Start difference. First operand 149 states. Second operand has 143 states, 88 states have (on average 1.2840909090909092) internal successors, (113), 89 states have internal predecessors, (113), 47 states have call successors, (47), 8 states have call predecessors, (47), 7 states have return successors, (45), 45 states have call predecessors, (45), 45 states have call successors, (45) [2022-04-27 13:13:48,812 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:13:48,813 INFO L93 Difference]: Finished difference Result 149 states and 211 transitions. [2022-04-27 13:13:48,813 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 211 transitions. [2022-04-27 13:13:48,813 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 13:13:48,814 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 13:13:48,814 INFO L74 IsIncluded]: Start isIncluded. First operand has 143 states, 88 states have (on average 1.2840909090909092) internal successors, (113), 89 states have internal predecessors, (113), 47 states have call successors, (47), 8 states have call predecessors, (47), 7 states have return successors, (45), 45 states have call predecessors, (45), 45 states have call successors, (45) Second operand 149 states. [2022-04-27 13:13:48,815 INFO L87 Difference]: Start difference. First operand has 143 states, 88 states have (on average 1.2840909090909092) internal successors, (113), 89 states have internal predecessors, (113), 47 states have call successors, (47), 8 states have call predecessors, (47), 7 states have return successors, (45), 45 states have call predecessors, (45), 45 states have call successors, (45) Second operand 149 states. [2022-04-27 13:13:48,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:13:48,821 INFO L93 Difference]: Finished difference Result 149 states and 211 transitions. [2022-04-27 13:13:48,821 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 211 transitions. [2022-04-27 13:13:48,822 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 13:13:48,822 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 13:13:48,822 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 13:13:48,822 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 13:13:48,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 143 states, 88 states have (on average 1.2840909090909092) internal successors, (113), 89 states have internal predecessors, (113), 47 states have call successors, (47), 8 states have call predecessors, (47), 7 states have return successors, (45), 45 states have call predecessors, (45), 45 states have call successors, (45) [2022-04-27 13:13:48,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 205 transitions. [2022-04-27 13:13:48,828 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 205 transitions. Word has length 47 [2022-04-27 13:13:48,828 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 13:13:48,829 INFO L495 AbstractCegarLoop]: Abstraction has 143 states and 205 transitions. [2022-04-27 13:13:48,829 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.8) internal successors, (19), 4 states have internal predecessors, (19), 2 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-04-27 13:13:48,829 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 205 transitions. [2022-04-27 13:13:48,829 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2022-04-27 13:13:48,829 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 13:13:48,830 INFO L195 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1] [2022-04-27 13:13:48,856 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 13:13:49,045 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 13:13:49,046 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 13:13:49,046 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 13:13:49,046 INFO L85 PathProgramCache]: Analyzing trace with hash 1524769911, now seen corresponding path program 1 times [2022-04-27 13:13:49,046 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 13:13:49,046 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1973577636] [2022-04-27 13:13:49,046 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 13:13:49,046 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 13:13:49,063 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 13:13:49,063 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [904737306] [2022-04-27 13:13:49,063 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 13:13:49,064 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 13:13:49,064 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 13:13:49,073 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 13:13:49,108 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 13:13:49,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 13:13:49,142 INFO L263 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 35 conjunts are in the unsatisfiable core [2022-04-27 13:13:49,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 13:13:49,158 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 13:13:51,655 INFO L272 TraceCheckUtils]: 0: Hoare triple {4245#true} call ULTIMATE.init(); {4245#true} is VALID [2022-04-27 13:13:51,655 INFO L290 TraceCheckUtils]: 1: Hoare triple {4245#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(11, 2);call #Ultimate.allocInit(12, 3); {4245#true} is VALID [2022-04-27 13:13:51,655 INFO L290 TraceCheckUtils]: 2: Hoare triple {4245#true} assume true; {4245#true} is VALID [2022-04-27 13:13:51,656 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4245#true} {4245#true} #112#return; {4245#true} is VALID [2022-04-27 13:13:51,656 INFO L272 TraceCheckUtils]: 4: Hoare triple {4245#true} call #t~ret6 := main(); {4245#true} is VALID [2022-04-27 13:13:51,656 INFO L290 TraceCheckUtils]: 5: Hoare triple {4245#true} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~s~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4; {4245#true} is VALID [2022-04-27 13:13:51,656 INFO L272 TraceCheckUtils]: 6: Hoare triple {4245#true} call assume_abort_if_not((if ~x~0 >= 0 && ~x~0 <= 50 then 1 else 0)); {4245#true} is VALID [2022-04-27 13:13:51,656 INFO L290 TraceCheckUtils]: 7: Hoare triple {4245#true} ~cond := #in~cond; {4245#true} is VALID [2022-04-27 13:13:51,656 INFO L290 TraceCheckUtils]: 8: Hoare triple {4245#true} assume !(0 == ~cond); {4245#true} is VALID [2022-04-27 13:13:51,656 INFO L290 TraceCheckUtils]: 9: Hoare triple {4245#true} assume true; {4245#true} is VALID [2022-04-27 13:13:51,656 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {4245#true} {4245#true} #94#return; {4245#true} is VALID [2022-04-27 13:13:51,656 INFO L290 TraceCheckUtils]: 11: Hoare triple {4245#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {4245#true} is VALID [2022-04-27 13:13:51,656 INFO L272 TraceCheckUtils]: 12: Hoare triple {4245#true} call assume_abort_if_not((if ~y~0 >= 0 && ~y~0 <= 50 then 1 else 0)); {4245#true} is VALID [2022-04-27 13:13:51,656 INFO L290 TraceCheckUtils]: 13: Hoare triple {4245#true} ~cond := #in~cond; {4245#true} is VALID [2022-04-27 13:13:51,656 INFO L290 TraceCheckUtils]: 14: Hoare triple {4245#true} assume !(0 == ~cond); {4245#true} is VALID [2022-04-27 13:13:51,656 INFO L290 TraceCheckUtils]: 15: Hoare triple {4245#true} assume true; {4245#true} is VALID [2022-04-27 13:13:51,656 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {4245#true} {4245#true} #96#return; {4245#true} is VALID [2022-04-27 13:13:51,657 INFO L272 TraceCheckUtils]: 17: Hoare triple {4245#true} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {4245#true} is VALID [2022-04-27 13:13:51,657 INFO L290 TraceCheckUtils]: 18: Hoare triple {4245#true} ~cond := #in~cond; {4304#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-04-27 13:13:51,657 INFO L290 TraceCheckUtils]: 19: Hoare triple {4304#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} assume !(0 == ~cond); {4308#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-27 13:13:51,657 INFO L290 TraceCheckUtils]: 20: Hoare triple {4308#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {4308#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-27 13:13:51,658 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {4308#(not (= |assume_abort_if_not_#in~cond| 0))} {4245#true} #98#return; {4315#(<= 1 main_~x~0)} is VALID [2022-04-27 13:13:51,658 INFO L272 TraceCheckUtils]: 22: Hoare triple {4315#(<= 1 main_~x~0)} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {4245#true} is VALID [2022-04-27 13:13:51,658 INFO L290 TraceCheckUtils]: 23: Hoare triple {4245#true} ~cond := #in~cond; {4245#true} is VALID [2022-04-27 13:13:51,658 INFO L290 TraceCheckUtils]: 24: Hoare triple {4245#true} assume !(0 == ~cond); {4245#true} is VALID [2022-04-27 13:13:51,658 INFO L290 TraceCheckUtils]: 25: Hoare triple {4245#true} assume true; {4245#true} is VALID [2022-04-27 13:13:51,658 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {4245#true} {4315#(<= 1 main_~x~0)} #100#return; {4315#(<= 1 main_~x~0)} is VALID [2022-04-27 13:13:51,659 INFO L290 TraceCheckUtils]: 27: Hoare triple {4315#(<= 1 main_~x~0)} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1; {4334#(and (= main_~r~0 0) (<= 1 main_~x~0) (<= 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 13:13:51,659 INFO L290 TraceCheckUtils]: 28: Hoare triple {4334#(and (= main_~r~0 0) (<= 1 main_~x~0) (<= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} assume !false; {4334#(and (= main_~r~0 0) (<= 1 main_~x~0) (<= 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 13:13:51,660 INFO L290 TraceCheckUtils]: 29: Hoare triple {4334#(and (= main_~r~0 0) (<= 1 main_~x~0) (<= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} assume !!(0 != ~b~0);havoc ~c~0;havoc ~k~0;~c~0 := ~a~0;~k~0 := 0; {4341#(and (= main_~r~0 0) (<= 1 main_~x~0) (= main_~k~0 0) (<= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~c~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-27 13:13:51,660 INFO L290 TraceCheckUtils]: 30: Hoare triple {4341#(and (= main_~r~0 0) (<= 1 main_~x~0) (= main_~k~0 0) (<= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~c~0 main_~x~0) (= main_~p~0 1))} assume !false; {4341#(and (= main_~r~0 0) (<= 1 main_~x~0) (= main_~k~0 0) (<= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~c~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-27 13:13:51,661 INFO L290 TraceCheckUtils]: 31: Hoare triple {4341#(and (= main_~r~0 0) (<= 1 main_~x~0) (= main_~k~0 0) (<= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~c~0 main_~x~0) (= main_~p~0 1))} assume !(~c~0 >= ~b~0); {4348#(and (= main_~r~0 0) (<= 1 main_~x~0) (< main_~c~0 main_~y~0) (= main_~k~0 0) (= main_~q~0 0) (= main_~c~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-27 13:13:51,661 INFO L290 TraceCheckUtils]: 32: Hoare triple {4348#(and (= main_~r~0 0) (<= 1 main_~x~0) (< main_~c~0 main_~y~0) (= main_~k~0 0) (= main_~q~0 0) (= main_~c~0 main_~x~0) (= main_~p~0 1))} ~a~0 := ~b~0;~b~0 := ~c~0;havoc ~temp~0;~temp~0 := ~p~0;~p~0 := ~q~0;~q~0 := ~temp~0 - ~q~0 * ~k~0;~temp~0 := ~r~0;~r~0 := ~s~0;~s~0 := ~temp~0 - ~s~0 * ~k~0; {4352#(and (= main_~s~0 0) (<= 1 main_~x~0) (< main_~x~0 main_~y~0) (= main_~b~0 main_~x~0) (= main_~q~0 1))} is VALID [2022-04-27 13:13:51,662 INFO L290 TraceCheckUtils]: 33: Hoare triple {4352#(and (= main_~s~0 0) (<= 1 main_~x~0) (< main_~x~0 main_~y~0) (= main_~b~0 main_~x~0) (= main_~q~0 1))} assume !false; {4352#(and (= main_~s~0 0) (<= 1 main_~x~0) (< main_~x~0 main_~y~0) (= main_~b~0 main_~x~0) (= main_~q~0 1))} is VALID [2022-04-27 13:13:51,662 INFO L290 TraceCheckUtils]: 34: Hoare triple {4352#(and (= main_~s~0 0) (<= 1 main_~x~0) (< main_~x~0 main_~y~0) (= main_~b~0 main_~x~0) (= main_~q~0 1))} assume !!(0 != ~b~0);havoc ~c~0;havoc ~k~0;~c~0 := ~a~0;~k~0 := 0; {4352#(and (= main_~s~0 0) (<= 1 main_~x~0) (< main_~x~0 main_~y~0) (= main_~b~0 main_~x~0) (= main_~q~0 1))} is VALID [2022-04-27 13:13:51,662 INFO L290 TraceCheckUtils]: 35: Hoare triple {4352#(and (= main_~s~0 0) (<= 1 main_~x~0) (< main_~x~0 main_~y~0) (= main_~b~0 main_~x~0) (= main_~q~0 1))} assume !false; {4352#(and (= main_~s~0 0) (<= 1 main_~x~0) (< main_~x~0 main_~y~0) (= main_~b~0 main_~x~0) (= main_~q~0 1))} is VALID [2022-04-27 13:13:51,663 INFO L290 TraceCheckUtils]: 36: Hoare triple {4352#(and (= main_~s~0 0) (<= 1 main_~x~0) (< main_~x~0 main_~y~0) (= main_~b~0 main_~x~0) (= main_~q~0 1))} assume !!(~c~0 >= ~b~0);havoc ~d~0;havoc ~v~0;~d~0 := 1;~v~0 := ~b~0; {4352#(and (= main_~s~0 0) (<= 1 main_~x~0) (< main_~x~0 main_~y~0) (= main_~b~0 main_~x~0) (= main_~q~0 1))} is VALID [2022-04-27 13:13:51,663 INFO L290 TraceCheckUtils]: 37: Hoare triple {4352#(and (= main_~s~0 0) (<= 1 main_~x~0) (< main_~x~0 main_~y~0) (= main_~b~0 main_~x~0) (= main_~q~0 1))} assume !false; {4352#(and (= main_~s~0 0) (<= 1 main_~x~0) (< main_~x~0 main_~y~0) (= main_~b~0 main_~x~0) (= main_~q~0 1))} is VALID [2022-04-27 13:13:51,663 INFO L272 TraceCheckUtils]: 38: Hoare triple {4352#(and (= main_~s~0 0) (<= 1 main_~x~0) (< main_~x~0 main_~y~0) (= main_~b~0 main_~x~0) (= main_~q~0 1))} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {4245#true} is VALID [2022-04-27 13:13:51,663 INFO L290 TraceCheckUtils]: 39: Hoare triple {4245#true} ~cond := #in~cond; {4374#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-27 13:13:51,664 INFO L290 TraceCheckUtils]: 40: Hoare triple {4374#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {4378#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 13:13:51,664 INFO L290 TraceCheckUtils]: 41: Hoare triple {4378#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {4378#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 13:13:51,665 INFO L284 TraceCheckUtils]: 42: Hoare quadruple {4378#(not (= |__VERIFIER_assert_#in~cond| 0))} {4352#(and (= main_~s~0 0) (<= 1 main_~x~0) (< main_~x~0 main_~y~0) (= main_~b~0 main_~x~0) (= main_~q~0 1))} #102#return; {4352#(and (= main_~s~0 0) (<= 1 main_~x~0) (< main_~x~0 main_~y~0) (= main_~b~0 main_~x~0) (= main_~q~0 1))} is VALID [2022-04-27 13:13:51,665 INFO L272 TraceCheckUtils]: 43: Hoare triple {4352#(and (= main_~s~0 0) (<= 1 main_~x~0) (< main_~x~0 main_~y~0) (= main_~b~0 main_~x~0) (= main_~q~0 1))} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {4388#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 13:13:51,666 INFO L290 TraceCheckUtils]: 44: Hoare triple {4388#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {4392#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 13:13:51,666 INFO L290 TraceCheckUtils]: 45: Hoare triple {4392#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {4246#false} is VALID [2022-04-27 13:13:51,666 INFO L290 TraceCheckUtils]: 46: Hoare triple {4246#false} assume !false; {4246#false} is VALID [2022-04-27 13:13:51,666 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 7 proven. 8 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-04-27 13:13:51,666 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 13:15:21,441 INFO L290 TraceCheckUtils]: 46: Hoare triple {4246#false} assume !false; {4246#false} is VALID [2022-04-27 13:15:21,441 INFO L290 TraceCheckUtils]: 45: Hoare triple {4392#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {4246#false} is VALID [2022-04-27 13:15:21,442 INFO L290 TraceCheckUtils]: 44: Hoare triple {4388#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {4392#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 13:15:21,443 INFO L272 TraceCheckUtils]: 43: Hoare triple {4408#(= 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)); {4388#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 13:15:21,444 INFO L284 TraceCheckUtils]: 42: Hoare quadruple {4245#true} {4408#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} #102#return; {4408#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} is VALID [2022-04-27 13:15:21,444 INFO L290 TraceCheckUtils]: 41: Hoare triple {4245#true} assume true; {4245#true} is VALID [2022-04-27 13:15:21,444 INFO L290 TraceCheckUtils]: 40: Hoare triple {4245#true} assume !(0 == ~cond); {4245#true} is VALID [2022-04-27 13:15:21,444 INFO L290 TraceCheckUtils]: 39: Hoare triple {4245#true} ~cond := #in~cond; {4245#true} is VALID [2022-04-27 13:15:21,444 INFO L272 TraceCheckUtils]: 38: Hoare triple {4408#(= 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)); {4245#true} is VALID [2022-04-27 13:15:21,444 INFO L290 TraceCheckUtils]: 37: Hoare triple {4408#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} assume !false; {4408#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} is VALID [2022-04-27 13:15:21,446 INFO L290 TraceCheckUtils]: 36: Hoare triple {4408#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} assume !!(~c~0 >= ~b~0);havoc ~d~0;havoc ~v~0;~d~0 := 1;~v~0 := ~b~0; {4408#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} is VALID [2022-04-27 13:15:21,447 INFO L290 TraceCheckUtils]: 35: Hoare triple {4408#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} assume !false; {4408#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} is VALID [2022-04-27 13:15:21,447 INFO L290 TraceCheckUtils]: 34: Hoare triple {4408#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} assume !!(0 != ~b~0);havoc ~c~0;havoc ~k~0;~c~0 := ~a~0;~k~0 := 0; {4408#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} is VALID [2022-04-27 13:15:21,447 INFO L290 TraceCheckUtils]: 33: Hoare triple {4408#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} assume !false; {4408#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} is VALID [2022-04-27 13:15:21,565 INFO L290 TraceCheckUtils]: 32: Hoare triple {4442#(forall ((main_~s~0 Int)) (= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) main_~c~0))} ~a~0 := ~b~0;~b~0 := ~c~0;havoc ~temp~0;~temp~0 := ~p~0;~p~0 := ~q~0;~q~0 := ~temp~0 - ~q~0 * ~k~0;~temp~0 := ~r~0;~r~0 := ~s~0;~s~0 := ~temp~0 - ~s~0 * ~k~0; {4408#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} is VALID [2022-04-27 13:15:21,565 INFO L290 TraceCheckUtils]: 31: Hoare triple {4446#(or (forall ((main_~s~0 Int)) (= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) main_~c~0)) (<= main_~b~0 main_~c~0))} assume !(~c~0 >= ~b~0); {4442#(forall ((main_~s~0 Int)) (= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) main_~c~0))} is VALID [2022-04-27 13:15:21,566 INFO L290 TraceCheckUtils]: 30: Hoare triple {4446#(or (forall ((main_~s~0 Int)) (= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) main_~c~0)) (<= main_~b~0 main_~c~0))} assume !false; {4446#(or (forall ((main_~s~0 Int)) (= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) main_~c~0)) (<= main_~b~0 main_~c~0))} is VALID [2022-04-27 13:15:21,567 INFO L290 TraceCheckUtils]: 29: Hoare triple {4453#(or (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))) (<= main_~b~0 main_~a~0))} assume !!(0 != ~b~0);havoc ~c~0;havoc ~k~0;~c~0 := ~a~0;~k~0 := 0; {4446#(or (forall ((main_~s~0 Int)) (= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) main_~c~0)) (<= main_~b~0 main_~c~0))} is VALID [2022-04-27 13:15:21,567 INFO L290 TraceCheckUtils]: 28: Hoare triple {4453#(or (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))) (<= main_~b~0 main_~a~0))} assume !false; {4453#(or (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))) (<= main_~b~0 main_~a~0))} is VALID [2022-04-27 13:15:21,567 INFO L290 TraceCheckUtils]: 27: Hoare triple {4245#true} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1; {4453#(or (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))) (<= main_~b~0 main_~a~0))} is VALID [2022-04-27 13:15:21,567 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {4245#true} {4245#true} #100#return; {4245#true} is VALID [2022-04-27 13:15:21,568 INFO L290 TraceCheckUtils]: 25: Hoare triple {4245#true} assume true; {4245#true} is VALID [2022-04-27 13:15:21,568 INFO L290 TraceCheckUtils]: 24: Hoare triple {4245#true} assume !(0 == ~cond); {4245#true} is VALID [2022-04-27 13:15:21,568 INFO L290 TraceCheckUtils]: 23: Hoare triple {4245#true} ~cond := #in~cond; {4245#true} is VALID [2022-04-27 13:15:21,568 INFO L272 TraceCheckUtils]: 22: Hoare triple {4245#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {4245#true} is VALID [2022-04-27 13:15:21,568 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {4245#true} {4245#true} #98#return; {4245#true} is VALID [2022-04-27 13:15:21,568 INFO L290 TraceCheckUtils]: 20: Hoare triple {4245#true} assume true; {4245#true} is VALID [2022-04-27 13:15:21,568 INFO L290 TraceCheckUtils]: 19: Hoare triple {4245#true} assume !(0 == ~cond); {4245#true} is VALID [2022-04-27 13:15:21,568 INFO L290 TraceCheckUtils]: 18: Hoare triple {4245#true} ~cond := #in~cond; {4245#true} is VALID [2022-04-27 13:15:21,568 INFO L272 TraceCheckUtils]: 17: Hoare triple {4245#true} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {4245#true} is VALID [2022-04-27 13:15:21,568 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {4245#true} {4245#true} #96#return; {4245#true} is VALID [2022-04-27 13:15:21,568 INFO L290 TraceCheckUtils]: 15: Hoare triple {4245#true} assume true; {4245#true} is VALID [2022-04-27 13:15:21,568 INFO L290 TraceCheckUtils]: 14: Hoare triple {4245#true} assume !(0 == ~cond); {4245#true} is VALID [2022-04-27 13:15:21,568 INFO L290 TraceCheckUtils]: 13: Hoare triple {4245#true} ~cond := #in~cond; {4245#true} is VALID [2022-04-27 13:15:21,568 INFO L272 TraceCheckUtils]: 12: Hoare triple {4245#true} call assume_abort_if_not((if ~y~0 >= 0 && ~y~0 <= 50 then 1 else 0)); {4245#true} is VALID [2022-04-27 13:15:21,568 INFO L290 TraceCheckUtils]: 11: Hoare triple {4245#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {4245#true} is VALID [2022-04-27 13:15:21,568 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {4245#true} {4245#true} #94#return; {4245#true} is VALID [2022-04-27 13:15:21,569 INFO L290 TraceCheckUtils]: 9: Hoare triple {4245#true} assume true; {4245#true} is VALID [2022-04-27 13:15:21,569 INFO L290 TraceCheckUtils]: 8: Hoare triple {4245#true} assume !(0 == ~cond); {4245#true} is VALID [2022-04-27 13:15:21,569 INFO L290 TraceCheckUtils]: 7: Hoare triple {4245#true} ~cond := #in~cond; {4245#true} is VALID [2022-04-27 13:15:21,569 INFO L272 TraceCheckUtils]: 6: Hoare triple {4245#true} call assume_abort_if_not((if ~x~0 >= 0 && ~x~0 <= 50 then 1 else 0)); {4245#true} is VALID [2022-04-27 13:15:21,569 INFO L290 TraceCheckUtils]: 5: Hoare triple {4245#true} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~s~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4; {4245#true} is VALID [2022-04-27 13:15:21,569 INFO L272 TraceCheckUtils]: 4: Hoare triple {4245#true} call #t~ret6 := main(); {4245#true} is VALID [2022-04-27 13:15:21,569 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4245#true} {4245#true} #112#return; {4245#true} is VALID [2022-04-27 13:15:21,569 INFO L290 TraceCheckUtils]: 2: Hoare triple {4245#true} assume true; {4245#true} is VALID [2022-04-27 13:15:21,569 INFO L290 TraceCheckUtils]: 1: Hoare triple {4245#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(11, 2);call #Ultimate.allocInit(12, 3); {4245#true} is VALID [2022-04-27 13:15:21,569 INFO L272 TraceCheckUtils]: 0: Hoare triple {4245#true} call ULTIMATE.init(); {4245#true} is VALID [2022-04-27 13:15:21,569 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-04-27 13:15:21,569 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 13:15:21,569 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1973577636] [2022-04-27 13:15:21,570 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 13:15:21,570 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [904737306] [2022-04-27 13:15:21,570 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [904737306] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 13:15:21,570 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-27 13:15:21,570 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 8] total 17 [2022-04-27 13:15:21,570 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1352606919] [2022-04-27 13:15:21,570 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-27 13:15:21,571 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 2.411764705882353) internal successors, (41), 15 states have internal predecessors, (41), 4 states have call successors, (11), 2 states have call predecessors, (11), 3 states have return successors, (9), 4 states have call predecessors, (9), 4 states have call successors, (9) Word has length 47 [2022-04-27 13:15:21,571 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 13:15:21,571 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 17 states, 17 states have (on average 2.411764705882353) internal successors, (41), 15 states have internal predecessors, (41), 4 states have call successors, (11), 2 states have call predecessors, (11), 3 states have return successors, (9), 4 states have call predecessors, (9), 4 states have call successors, (9) [2022-04-27 13:15:21,712 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 13:15:21,713 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-04-27 13:15:21,713 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 13:15:21,713 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-04-27 13:15:21,713 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=229, Unknown=0, NotChecked=0, Total=272 [2022-04-27 13:15:21,713 INFO L87 Difference]: Start difference. First operand 143 states and 205 transitions. Second operand has 17 states, 17 states have (on average 2.411764705882353) internal successors, (41), 15 states have internal predecessors, (41), 4 states have call successors, (11), 2 states have call predecessors, (11), 3 states have return successors, (9), 4 states have call predecessors, (9), 4 states have call successors, (9) [2022-04-27 13:15:24,525 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:15:24,526 INFO L93 Difference]: Finished difference Result 190 states and 269 transitions. [2022-04-27 13:15:24,526 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-04-27 13:15:24,526 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 2.411764705882353) internal successors, (41), 15 states have internal predecessors, (41), 4 states have call successors, (11), 2 states have call predecessors, (11), 3 states have return successors, (9), 4 states have call predecessors, (9), 4 states have call successors, (9) Word has length 47 [2022-04-27 13:15:24,526 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 13:15:24,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 17 states have (on average 2.411764705882353) internal successors, (41), 15 states have internal predecessors, (41), 4 states have call successors, (11), 2 states have call predecessors, (11), 3 states have return successors, (9), 4 states have call predecessors, (9), 4 states have call successors, (9) [2022-04-27 13:15:24,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 124 transitions. [2022-04-27 13:15:24,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 17 states have (on average 2.411764705882353) internal successors, (41), 15 states have internal predecessors, (41), 4 states have call successors, (11), 2 states have call predecessors, (11), 3 states have return successors, (9), 4 states have call predecessors, (9), 4 states have call successors, (9) [2022-04-27 13:15:24,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 124 transitions. [2022-04-27 13:15:24,533 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 20 states and 124 transitions. [2022-04-27 13:15:24,749 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 124 edges. 124 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 13:15:24,754 INFO L225 Difference]: With dead ends: 190 [2022-04-27 13:15:24,754 INFO L226 Difference]: Without dead ends: 188 [2022-04-27 13:15:24,755 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 80 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 120 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=116, Invalid=586, Unknown=0, NotChecked=0, Total=702 [2022-04-27 13:15:24,755 INFO L413 NwaCegarLoop]: 41 mSDtfsCounter, 68 mSDsluCounter, 259 mSDsCounter, 0 mSdLazyCounter, 459 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 300 SdHoareTripleChecker+Invalid, 563 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 459 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 70 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-04-27 13:15:24,755 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [69 Valid, 300 Invalid, 563 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 459 Invalid, 0 Unknown, 70 Unchecked, 0.7s Time] [2022-04-27 13:15:24,756 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188 states. [2022-04-27 13:15:25,105 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188 to 176. [2022-04-27 13:15:25,106 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 13:15:25,106 INFO L82 GeneralOperation]: Start isEquivalent. First operand 188 states. Second operand has 176 states, 114 states have (on average 1.280701754385965) internal successors, (146), 118 states have internal predecessors, (146), 53 states have call successors, (53), 9 states have call predecessors, (53), 8 states have return successors, (51), 48 states have call predecessors, (51), 51 states have call successors, (51) [2022-04-27 13:15:25,107 INFO L74 IsIncluded]: Start isIncluded. First operand 188 states. Second operand has 176 states, 114 states have (on average 1.280701754385965) internal successors, (146), 118 states have internal predecessors, (146), 53 states have call successors, (53), 9 states have call predecessors, (53), 8 states have return successors, (51), 48 states have call predecessors, (51), 51 states have call successors, (51) [2022-04-27 13:15:25,107 INFO L87 Difference]: Start difference. First operand 188 states. Second operand has 176 states, 114 states have (on average 1.280701754385965) internal successors, (146), 118 states have internal predecessors, (146), 53 states have call successors, (53), 9 states have call predecessors, (53), 8 states have return successors, (51), 48 states have call predecessors, (51), 51 states have call successors, (51) [2022-04-27 13:15:25,115 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:15:25,115 INFO L93 Difference]: Finished difference Result 188 states and 267 transitions. [2022-04-27 13:15:25,115 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 267 transitions. [2022-04-27 13:15:25,116 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 13:15:25,116 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 13:15:25,117 INFO L74 IsIncluded]: Start isIncluded. First operand has 176 states, 114 states have (on average 1.280701754385965) internal successors, (146), 118 states have internal predecessors, (146), 53 states have call successors, (53), 9 states have call predecessors, (53), 8 states have return successors, (51), 48 states have call predecessors, (51), 51 states have call successors, (51) Second operand 188 states. [2022-04-27 13:15:25,118 INFO L87 Difference]: Start difference. First operand has 176 states, 114 states have (on average 1.280701754385965) internal successors, (146), 118 states have internal predecessors, (146), 53 states have call successors, (53), 9 states have call predecessors, (53), 8 states have return successors, (51), 48 states have call predecessors, (51), 51 states have call successors, (51) Second operand 188 states. [2022-04-27 13:15:25,125 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:15:25,125 INFO L93 Difference]: Finished difference Result 188 states and 267 transitions. [2022-04-27 13:15:25,125 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 267 transitions. [2022-04-27 13:15:25,126 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 13:15:25,127 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 13:15:25,127 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 13:15:25,127 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 13:15:25,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 176 states, 114 states have (on average 1.280701754385965) internal successors, (146), 118 states have internal predecessors, (146), 53 states have call successors, (53), 9 states have call predecessors, (53), 8 states have return successors, (51), 48 states have call predecessors, (51), 51 states have call successors, (51) [2022-04-27 13:15:25,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176 states to 176 states and 250 transitions. [2022-04-27 13:15:25,134 INFO L78 Accepts]: Start accepts. Automaton has 176 states and 250 transitions. Word has length 47 [2022-04-27 13:15:25,135 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 13:15:25,135 INFO L495 AbstractCegarLoop]: Abstraction has 176 states and 250 transitions. [2022-04-27 13:15:25,135 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 2.411764705882353) internal successors, (41), 15 states have internal predecessors, (41), 4 states have call successors, (11), 2 states have call predecessors, (11), 3 states have return successors, (9), 4 states have call predecessors, (9), 4 states have call successors, (9) [2022-04-27 13:15:25,135 INFO L276 IsEmpty]: Start isEmpty. Operand 176 states and 250 transitions. [2022-04-27 13:15:25,136 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2022-04-27 13:15:25,136 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 13:15:25,136 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 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] [2022-04-27 13:15:25,154 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 13:15:25,343 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 13:15:25,344 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 13:15:25,344 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 13:15:25,344 INFO L85 PathProgramCache]: Analyzing trace with hash 1836145722, now seen corresponding path program 2 times [2022-04-27 13:15:25,344 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 13:15:25,344 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1234357066] [2022-04-27 13:15:25,344 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 13:15:25,344 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 13:15:25,358 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 13:15:25,358 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [868999110] [2022-04-27 13:15:25,358 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-27 13:15:25,359 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 13:15:25,359 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 13:15:25,360 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 13:15:25,362 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 13:15:25,406 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-27 13:15:25,406 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-27 13:15:25,407 INFO L263 TraceCheckSpWp]: Trace formula consists of 161 conjuncts, 5 conjunts are in the unsatisfiable core [2022-04-27 13:15:25,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 13:15:25,417 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 13:15:25,555 INFO L272 TraceCheckUtils]: 0: Hoare triple {5520#true} call ULTIMATE.init(); {5520#true} is VALID [2022-04-27 13:15:25,555 INFO L290 TraceCheckUtils]: 1: Hoare triple {5520#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(11, 2);call #Ultimate.allocInit(12, 3); {5520#true} is VALID [2022-04-27 13:15:25,555 INFO L290 TraceCheckUtils]: 2: Hoare triple {5520#true} assume true; {5520#true} is VALID [2022-04-27 13:15:25,555 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5520#true} {5520#true} #112#return; {5520#true} is VALID [2022-04-27 13:15:25,555 INFO L272 TraceCheckUtils]: 4: Hoare triple {5520#true} call #t~ret6 := main(); {5520#true} is VALID [2022-04-27 13:15:25,555 INFO L290 TraceCheckUtils]: 5: Hoare triple {5520#true} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~s~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4; {5520#true} is VALID [2022-04-27 13:15:25,555 INFO L272 TraceCheckUtils]: 6: Hoare triple {5520#true} call assume_abort_if_not((if ~x~0 >= 0 && ~x~0 <= 50 then 1 else 0)); {5520#true} is VALID [2022-04-27 13:15:25,555 INFO L290 TraceCheckUtils]: 7: Hoare triple {5520#true} ~cond := #in~cond; {5520#true} is VALID [2022-04-27 13:15:25,555 INFO L290 TraceCheckUtils]: 8: Hoare triple {5520#true} assume !(0 == ~cond); {5520#true} is VALID [2022-04-27 13:15:25,556 INFO L290 TraceCheckUtils]: 9: Hoare triple {5520#true} assume true; {5520#true} is VALID [2022-04-27 13:15:25,556 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {5520#true} {5520#true} #94#return; {5520#true} is VALID [2022-04-27 13:15:25,556 INFO L290 TraceCheckUtils]: 11: Hoare triple {5520#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {5520#true} is VALID [2022-04-27 13:15:25,556 INFO L272 TraceCheckUtils]: 12: Hoare triple {5520#true} call assume_abort_if_not((if ~y~0 >= 0 && ~y~0 <= 50 then 1 else 0)); {5520#true} is VALID [2022-04-27 13:15:25,556 INFO L290 TraceCheckUtils]: 13: Hoare triple {5520#true} ~cond := #in~cond; {5520#true} is VALID [2022-04-27 13:15:25,556 INFO L290 TraceCheckUtils]: 14: Hoare triple {5520#true} assume !(0 == ~cond); {5520#true} is VALID [2022-04-27 13:15:25,556 INFO L290 TraceCheckUtils]: 15: Hoare triple {5520#true} assume true; {5520#true} is VALID [2022-04-27 13:15:25,556 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {5520#true} {5520#true} #96#return; {5520#true} is VALID [2022-04-27 13:15:25,556 INFO L272 TraceCheckUtils]: 17: Hoare triple {5520#true} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {5520#true} is VALID [2022-04-27 13:15:25,556 INFO L290 TraceCheckUtils]: 18: Hoare triple {5520#true} ~cond := #in~cond; {5520#true} is VALID [2022-04-27 13:15:25,556 INFO L290 TraceCheckUtils]: 19: Hoare triple {5520#true} assume !(0 == ~cond); {5520#true} is VALID [2022-04-27 13:15:25,556 INFO L290 TraceCheckUtils]: 20: Hoare triple {5520#true} assume true; {5520#true} is VALID [2022-04-27 13:15:25,556 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {5520#true} {5520#true} #98#return; {5520#true} is VALID [2022-04-27 13:15:25,556 INFO L272 TraceCheckUtils]: 22: Hoare triple {5520#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {5520#true} is VALID [2022-04-27 13:15:25,556 INFO L290 TraceCheckUtils]: 23: Hoare triple {5520#true} ~cond := #in~cond; {5520#true} is VALID [2022-04-27 13:15:25,557 INFO L290 TraceCheckUtils]: 24: Hoare triple {5520#true} assume !(0 == ~cond); {5520#true} is VALID [2022-04-27 13:15:25,557 INFO L290 TraceCheckUtils]: 25: Hoare triple {5520#true} assume true; {5520#true} is VALID [2022-04-27 13:15:25,557 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {5520#true} {5520#true} #100#return; {5520#true} is VALID [2022-04-27 13:15:25,557 INFO L290 TraceCheckUtils]: 27: Hoare triple {5520#true} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1; {5520#true} is VALID [2022-04-27 13:15:25,557 INFO L290 TraceCheckUtils]: 28: Hoare triple {5520#true} assume !false; {5520#true} is VALID [2022-04-27 13:15:25,557 INFO L290 TraceCheckUtils]: 29: Hoare triple {5520#true} assume !!(0 != ~b~0);havoc ~c~0;havoc ~k~0;~c~0 := ~a~0;~k~0 := 0; {5520#true} is VALID [2022-04-27 13:15:25,557 INFO L290 TraceCheckUtils]: 30: Hoare triple {5520#true} assume !false; {5520#true} is VALID [2022-04-27 13:15:25,557 INFO L290 TraceCheckUtils]: 31: Hoare triple {5520#true} assume !(~c~0 >= ~b~0); {5618#(not (<= main_~b~0 main_~c~0))} is VALID [2022-04-27 13:15:25,558 INFO L290 TraceCheckUtils]: 32: Hoare triple {5618#(not (<= main_~b~0 main_~c~0))} ~a~0 := ~b~0;~b~0 := ~c~0;havoc ~temp~0;~temp~0 := ~p~0;~p~0 := ~q~0;~q~0 := ~temp~0 - ~q~0 * ~k~0;~temp~0 := ~r~0;~r~0 := ~s~0;~s~0 := ~temp~0 - ~s~0 * ~k~0; {5622#(< main_~b~0 main_~a~0)} is VALID [2022-04-27 13:15:25,558 INFO L290 TraceCheckUtils]: 33: Hoare triple {5622#(< main_~b~0 main_~a~0)} assume !false; {5622#(< main_~b~0 main_~a~0)} is VALID [2022-04-27 13:15:25,558 INFO L290 TraceCheckUtils]: 34: Hoare triple {5622#(< main_~b~0 main_~a~0)} assume !!(0 != ~b~0);havoc ~c~0;havoc ~k~0;~c~0 := ~a~0;~k~0 := 0; {5629#(< main_~b~0 main_~c~0)} is VALID [2022-04-27 13:15:25,559 INFO L290 TraceCheckUtils]: 35: Hoare triple {5629#(< main_~b~0 main_~c~0)} assume !false; {5629#(< main_~b~0 main_~c~0)} is VALID [2022-04-27 13:15:25,559 INFO L290 TraceCheckUtils]: 36: Hoare triple {5629#(< main_~b~0 main_~c~0)} assume !(~c~0 >= ~b~0); {5521#false} is VALID [2022-04-27 13:15:25,559 INFO L290 TraceCheckUtils]: 37: Hoare triple {5521#false} ~a~0 := ~b~0;~b~0 := ~c~0;havoc ~temp~0;~temp~0 := ~p~0;~p~0 := ~q~0;~q~0 := ~temp~0 - ~q~0 * ~k~0;~temp~0 := ~r~0;~r~0 := ~s~0;~s~0 := ~temp~0 - ~s~0 * ~k~0; {5521#false} is VALID [2022-04-27 13:15:25,559 INFO L290 TraceCheckUtils]: 38: Hoare triple {5521#false} assume !false; {5521#false} is VALID [2022-04-27 13:15:25,560 INFO L290 TraceCheckUtils]: 39: Hoare triple {5521#false} assume !!(0 != ~b~0);havoc ~c~0;havoc ~k~0;~c~0 := ~a~0;~k~0 := 0; {5521#false} is VALID [2022-04-27 13:15:25,560 INFO L290 TraceCheckUtils]: 40: Hoare triple {5521#false} assume !false; {5521#false} is VALID [2022-04-27 13:15:25,560 INFO L290 TraceCheckUtils]: 41: Hoare triple {5521#false} assume !!(~c~0 >= ~b~0);havoc ~d~0;havoc ~v~0;~d~0 := 1;~v~0 := ~b~0; {5521#false} is VALID [2022-04-27 13:15:25,560 INFO L290 TraceCheckUtils]: 42: Hoare triple {5521#false} assume !false; {5521#false} is VALID [2022-04-27 13:15:25,560 INFO L272 TraceCheckUtils]: 43: Hoare triple {5521#false} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {5521#false} is VALID [2022-04-27 13:15:25,560 INFO L290 TraceCheckUtils]: 44: Hoare triple {5521#false} ~cond := #in~cond; {5521#false} is VALID [2022-04-27 13:15:25,560 INFO L290 TraceCheckUtils]: 45: Hoare triple {5521#false} assume 0 == ~cond; {5521#false} is VALID [2022-04-27 13:15:25,560 INFO L290 TraceCheckUtils]: 46: Hoare triple {5521#false} assume !false; {5521#false} is VALID [2022-04-27 13:15:25,560 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-04-27 13:15:25,560 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-27 13:15:25,560 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 13:15:25,560 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1234357066] [2022-04-27 13:15:25,560 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 13:15:25,560 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [868999110] [2022-04-27 13:15:25,561 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [868999110] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 13:15:25,561 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 13:15:25,561 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-27 13:15:25,561 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [624182566] [2022-04-27 13:15:25,561 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 13:15:25,561 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.2) internal successors, (26), 5 states have internal predecessors, (26), 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 47 [2022-04-27 13:15:25,562 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 13:15:25,562 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 5.2) internal successors, (26), 5 states have internal predecessors, (26), 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 13:15:25,595 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 38 edges. 38 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 13:15:25,595 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-27 13:15:25,595 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 13:15:25,596 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-27 13:15:25,596 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-27 13:15:25,596 INFO L87 Difference]: Start difference. First operand 176 states and 250 transitions. Second operand has 5 states, 5 states have (on average 5.2) internal successors, (26), 5 states have internal predecessors, (26), 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 13:15:26,156 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:15:26,156 INFO L93 Difference]: Finished difference Result 217 states and 303 transitions. [2022-04-27 13:15:26,156 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-27 13:15:26,157 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.2) internal successors, (26), 5 states have internal predecessors, (26), 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 47 [2022-04-27 13:15:26,157 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 13:15:26,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 5.2) internal successors, (26), 5 states have internal predecessors, (26), 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 13:15:26,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 102 transitions. [2022-04-27 13:15:26,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 5.2) internal successors, (26), 5 states have internal predecessors, (26), 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 13:15:26,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 102 transitions. [2022-04-27 13:15:26,164 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 102 transitions. [2022-04-27 13:15:26,239 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 102 edges. 102 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 13:15:26,241 INFO L225 Difference]: With dead ends: 217 [2022-04-27 13:15:26,241 INFO L226 Difference]: Without dead ends: 136 [2022-04-27 13:15:26,242 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-04-27 13:15:26,243 INFO L413 NwaCegarLoop]: 57 mSDtfsCounter, 18 mSDsluCounter, 98 mSDsCounter, 0 mSdLazyCounter, 82 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 155 SdHoareTripleChecker+Invalid, 91 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 82 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-27 13:15:26,243 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 155 Invalid, 91 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 82 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-27 13:15:26,243 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2022-04-27 13:15:26,496 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 113. [2022-04-27 13:15:26,496 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 13:15:26,496 INFO L82 GeneralOperation]: Start isEquivalent. First operand 136 states. Second operand has 113 states, 69 states have (on average 1.1884057971014492) internal successors, (82), 72 states have internal predecessors, (82), 35 states have call successors, (35), 9 states have call predecessors, (35), 8 states have return successors, (33), 31 states have call predecessors, (33), 33 states have call successors, (33) [2022-04-27 13:15:26,497 INFO L74 IsIncluded]: Start isIncluded. First operand 136 states. Second operand has 113 states, 69 states have (on average 1.1884057971014492) internal successors, (82), 72 states have internal predecessors, (82), 35 states have call successors, (35), 9 states have call predecessors, (35), 8 states have return successors, (33), 31 states have call predecessors, (33), 33 states have call successors, (33) [2022-04-27 13:15:26,497 INFO L87 Difference]: Start difference. First operand 136 states. Second operand has 113 states, 69 states have (on average 1.1884057971014492) internal successors, (82), 72 states have internal predecessors, (82), 35 states have call successors, (35), 9 states have call predecessors, (35), 8 states have return successors, (33), 31 states have call predecessors, (33), 33 states have call successors, (33) [2022-04-27 13:15:26,503 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:15:26,503 INFO L93 Difference]: Finished difference Result 136 states and 185 transitions. [2022-04-27 13:15:26,503 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 185 transitions. [2022-04-27 13:15:26,504 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 13:15:26,504 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 13:15:26,504 INFO L74 IsIncluded]: Start isIncluded. First operand has 113 states, 69 states have (on average 1.1884057971014492) internal successors, (82), 72 states have internal predecessors, (82), 35 states have call successors, (35), 9 states have call predecessors, (35), 8 states have return successors, (33), 31 states have call predecessors, (33), 33 states have call successors, (33) Second operand 136 states. [2022-04-27 13:15:26,505 INFO L87 Difference]: Start difference. First operand has 113 states, 69 states have (on average 1.1884057971014492) internal successors, (82), 72 states have internal predecessors, (82), 35 states have call successors, (35), 9 states have call predecessors, (35), 8 states have return successors, (33), 31 states have call predecessors, (33), 33 states have call successors, (33) Second operand 136 states. [2022-04-27 13:15:26,509 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:15:26,509 INFO L93 Difference]: Finished difference Result 136 states and 185 transitions. [2022-04-27 13:15:26,509 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 185 transitions. [2022-04-27 13:15:26,510 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 13:15:26,510 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 13:15:26,510 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 13:15:26,510 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 13:15:26,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 113 states, 69 states have (on average 1.1884057971014492) internal successors, (82), 72 states have internal predecessors, (82), 35 states have call successors, (35), 9 states have call predecessors, (35), 8 states have return successors, (33), 31 states have call predecessors, (33), 33 states have call successors, (33) [2022-04-27 13:15:26,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 150 transitions. [2022-04-27 13:15:26,514 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 150 transitions. Word has length 47 [2022-04-27 13:15:26,514 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 13:15:26,514 INFO L495 AbstractCegarLoop]: Abstraction has 113 states and 150 transitions. [2022-04-27 13:15:26,514 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.2) internal successors, (26), 5 states have internal predecessors, (26), 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 13:15:26,514 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 150 transitions. [2022-04-27 13:15:26,514 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2022-04-27 13:15:26,514 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 13:15:26,515 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, 1, 1, 1] [2022-04-27 13:15:26,543 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 13:15:26,737 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 13:15:26,737 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 13:15:26,738 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 13:15:26,738 INFO L85 PathProgramCache]: Analyzing trace with hash -1952108775, now seen corresponding path program 1 times [2022-04-27 13:15:26,738 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 13:15:26,738 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [542277941] [2022-04-27 13:15:26,738 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 13:15:26,738 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 13:15:26,749 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 13:15:26,749 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [781147337] [2022-04-27 13:15:26,749 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 13:15:26,749 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 13:15:26,749 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 13:15:26,750 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 13:15:26,755 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 13:15:26,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 13:15:26,796 INFO L263 TraceCheckSpWp]: Trace formula consists of 144 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-27 13:15:26,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 13:15:26,805 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 13:15:26,938 INFO L272 TraceCheckUtils]: 0: Hoare triple {6455#true} call ULTIMATE.init(); {6455#true} is VALID [2022-04-27 13:15:26,938 INFO L290 TraceCheckUtils]: 1: Hoare triple {6455#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(11, 2);call #Ultimate.allocInit(12, 3); {6455#true} is VALID [2022-04-27 13:15:26,939 INFO L290 TraceCheckUtils]: 2: Hoare triple {6455#true} assume true; {6455#true} is VALID [2022-04-27 13:15:26,939 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6455#true} {6455#true} #112#return; {6455#true} is VALID [2022-04-27 13:15:26,939 INFO L272 TraceCheckUtils]: 4: Hoare triple {6455#true} call #t~ret6 := main(); {6455#true} is VALID [2022-04-27 13:15:26,939 INFO L290 TraceCheckUtils]: 5: Hoare triple {6455#true} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~s~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4; {6455#true} is VALID [2022-04-27 13:15:26,939 INFO L272 TraceCheckUtils]: 6: Hoare triple {6455#true} call assume_abort_if_not((if ~x~0 >= 0 && ~x~0 <= 50 then 1 else 0)); {6455#true} is VALID [2022-04-27 13:15:26,939 INFO L290 TraceCheckUtils]: 7: Hoare triple {6455#true} ~cond := #in~cond; {6455#true} is VALID [2022-04-27 13:15:26,939 INFO L290 TraceCheckUtils]: 8: Hoare triple {6455#true} assume !(0 == ~cond); {6455#true} is VALID [2022-04-27 13:15:26,939 INFO L290 TraceCheckUtils]: 9: Hoare triple {6455#true} assume true; {6455#true} is VALID [2022-04-27 13:15:26,939 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {6455#true} {6455#true} #94#return; {6455#true} is VALID [2022-04-27 13:15:26,939 INFO L290 TraceCheckUtils]: 11: Hoare triple {6455#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {6455#true} is VALID [2022-04-27 13:15:26,939 INFO L272 TraceCheckUtils]: 12: Hoare triple {6455#true} call assume_abort_if_not((if ~y~0 >= 0 && ~y~0 <= 50 then 1 else 0)); {6455#true} is VALID [2022-04-27 13:15:26,939 INFO L290 TraceCheckUtils]: 13: Hoare triple {6455#true} ~cond := #in~cond; {6455#true} is VALID [2022-04-27 13:15:26,939 INFO L290 TraceCheckUtils]: 14: Hoare triple {6455#true} assume !(0 == ~cond); {6455#true} is VALID [2022-04-27 13:15:26,939 INFO L290 TraceCheckUtils]: 15: Hoare triple {6455#true} assume true; {6455#true} is VALID [2022-04-27 13:15:26,939 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {6455#true} {6455#true} #96#return; {6455#true} is VALID [2022-04-27 13:15:26,940 INFO L272 TraceCheckUtils]: 17: Hoare triple {6455#true} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {6455#true} is VALID [2022-04-27 13:15:26,940 INFO L290 TraceCheckUtils]: 18: Hoare triple {6455#true} ~cond := #in~cond; {6455#true} is VALID [2022-04-27 13:15:26,940 INFO L290 TraceCheckUtils]: 19: Hoare triple {6455#true} assume !(0 == ~cond); {6455#true} is VALID [2022-04-27 13:15:26,940 INFO L290 TraceCheckUtils]: 20: Hoare triple {6455#true} assume true; {6455#true} is VALID [2022-04-27 13:15:26,940 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {6455#true} {6455#true} #98#return; {6455#true} is VALID [2022-04-27 13:15:26,940 INFO L272 TraceCheckUtils]: 22: Hoare triple {6455#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {6455#true} is VALID [2022-04-27 13:15:26,940 INFO L290 TraceCheckUtils]: 23: Hoare triple {6455#true} ~cond := #in~cond; {6455#true} is VALID [2022-04-27 13:15:26,940 INFO L290 TraceCheckUtils]: 24: Hoare triple {6455#true} assume !(0 == ~cond); {6455#true} is VALID [2022-04-27 13:15:26,940 INFO L290 TraceCheckUtils]: 25: Hoare triple {6455#true} assume true; {6455#true} is VALID [2022-04-27 13:15:26,940 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {6455#true} {6455#true} #100#return; {6455#true} is VALID [2022-04-27 13:15:26,940 INFO L290 TraceCheckUtils]: 27: Hoare triple {6455#true} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1; {6455#true} is VALID [2022-04-27 13:15:26,940 INFO L290 TraceCheckUtils]: 28: Hoare triple {6455#true} assume !false; {6455#true} is VALID [2022-04-27 13:15:26,940 INFO L290 TraceCheckUtils]: 29: Hoare triple {6455#true} assume !!(0 != ~b~0);havoc ~c~0;havoc ~k~0;~c~0 := ~a~0;~k~0 := 0; {6455#true} is VALID [2022-04-27 13:15:26,940 INFO L290 TraceCheckUtils]: 30: Hoare triple {6455#true} assume !false; {6455#true} is VALID [2022-04-27 13:15:26,941 INFO L290 TraceCheckUtils]: 31: Hoare triple {6455#true} assume !!(~c~0 >= ~b~0);havoc ~d~0;havoc ~v~0;~d~0 := 1;~v~0 := ~b~0; {6553#(and (= main_~b~0 main_~v~0) (= main_~d~0 1))} is VALID [2022-04-27 13:15:26,942 INFO L290 TraceCheckUtils]: 32: Hoare triple {6553#(and (= main_~b~0 main_~v~0) (= main_~d~0 1))} assume !false; {6553#(and (= main_~b~0 main_~v~0) (= main_~d~0 1))} is VALID [2022-04-27 13:15:26,942 INFO L272 TraceCheckUtils]: 33: Hoare triple {6553#(and (= main_~b~0 main_~v~0) (= main_~d~0 1))} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {6455#true} is VALID [2022-04-27 13:15:26,942 INFO L290 TraceCheckUtils]: 34: Hoare triple {6455#true} ~cond := #in~cond; {6455#true} is VALID [2022-04-27 13:15:26,942 INFO L290 TraceCheckUtils]: 35: Hoare triple {6455#true} assume !(0 == ~cond); {6455#true} is VALID [2022-04-27 13:15:26,942 INFO L290 TraceCheckUtils]: 36: Hoare triple {6455#true} assume true; {6455#true} is VALID [2022-04-27 13:15:26,943 INFO L284 TraceCheckUtils]: 37: Hoare quadruple {6455#true} {6553#(and (= main_~b~0 main_~v~0) (= main_~d~0 1))} #102#return; {6553#(and (= main_~b~0 main_~v~0) (= main_~d~0 1))} is VALID [2022-04-27 13:15:26,943 INFO L272 TraceCheckUtils]: 38: Hoare triple {6553#(and (= main_~b~0 main_~v~0) (= main_~d~0 1))} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {6455#true} is VALID [2022-04-27 13:15:26,943 INFO L290 TraceCheckUtils]: 39: Hoare triple {6455#true} ~cond := #in~cond; {6455#true} is VALID [2022-04-27 13:15:26,943 INFO L290 TraceCheckUtils]: 40: Hoare triple {6455#true} assume !(0 == ~cond); {6455#true} is VALID [2022-04-27 13:15:26,943 INFO L290 TraceCheckUtils]: 41: Hoare triple {6455#true} assume true; {6455#true} is VALID [2022-04-27 13:15:26,944 INFO L284 TraceCheckUtils]: 42: Hoare quadruple {6455#true} {6553#(and (= main_~b~0 main_~v~0) (= main_~d~0 1))} #104#return; {6553#(and (= main_~b~0 main_~v~0) (= main_~d~0 1))} is VALID [2022-04-27 13:15:26,944 INFO L272 TraceCheckUtils]: 43: Hoare triple {6553#(and (= main_~b~0 main_~v~0) (= main_~d~0 1))} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {6455#true} is VALID [2022-04-27 13:15:26,944 INFO L290 TraceCheckUtils]: 44: Hoare triple {6455#true} ~cond := #in~cond; {6455#true} is VALID [2022-04-27 13:15:26,944 INFO L290 TraceCheckUtils]: 45: Hoare triple {6455#true} assume !(0 == ~cond); {6455#true} is VALID [2022-04-27 13:15:26,944 INFO L290 TraceCheckUtils]: 46: Hoare triple {6455#true} assume true; {6455#true} is VALID [2022-04-27 13:15:26,945 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {6455#true} {6553#(and (= main_~b~0 main_~v~0) (= main_~d~0 1))} #106#return; {6553#(and (= main_~b~0 main_~v~0) (= main_~d~0 1))} is VALID [2022-04-27 13:15:26,945 INFO L272 TraceCheckUtils]: 48: Hoare triple {6553#(and (= main_~b~0 main_~v~0) (= main_~d~0 1))} call __VERIFIER_assert((if ~v~0 == ~b~0 * ~d~0 then 1 else 0)); {6605#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 13:15:26,945 INFO L290 TraceCheckUtils]: 49: Hoare triple {6605#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {6609#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 13:15:26,946 INFO L290 TraceCheckUtils]: 50: Hoare triple {6609#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {6456#false} is VALID [2022-04-27 13:15:26,946 INFO L290 TraceCheckUtils]: 51: Hoare triple {6456#false} assume !false; {6456#false} is VALID [2022-04-27 13:15:26,946 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 13:15:26,946 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-27 13:15:26,946 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 13:15:26,946 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [542277941] [2022-04-27 13:15:26,946 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 13:15:26,946 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [781147337] [2022-04-27 13:15:26,947 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [781147337] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 13:15:26,947 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 13:15:26,947 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-27 13:15:26,947 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [340256354] [2022-04-27 13:15:26,947 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 13:15:26,947 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.8) internal successors, (19), 4 states have internal predecessors, (19), 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 52 [2022-04-27 13:15:26,947 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 13:15:26,948 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 3.8) internal successors, (19), 4 states have internal predecessors, (19), 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 13:15:26,973 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 37 edges. 37 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 13:15:26,973 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-27 13:15:26,973 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 13:15:26,974 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-27 13:15:26,974 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-27 13:15:26,974 INFO L87 Difference]: Start difference. First operand 113 states and 150 transitions. Second operand has 5 states, 5 states have (on average 3.8) internal successors, (19), 4 states have internal predecessors, (19), 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 13:15:27,514 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:15:27,514 INFO L93 Difference]: Finished difference Result 163 states and 230 transitions. [2022-04-27 13:15:27,515 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-27 13:15:27,515 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.8) internal successors, (19), 4 states have internal predecessors, (19), 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 52 [2022-04-27 13:15:27,515 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 13:15:27,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.8) internal successors, (19), 4 states have internal predecessors, (19), 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 13:15:27,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 65 transitions. [2022-04-27 13:15:27,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.8) internal successors, (19), 4 states have internal predecessors, (19), 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 13:15:27,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 65 transitions. [2022-04-27 13:15:27,517 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 65 transitions. [2022-04-27 13:15:27,579 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 13:15:27,582 INFO L225 Difference]: With dead ends: 163 [2022-04-27 13:15:27,582 INFO L226 Difference]: Without dead ends: 161 [2022-04-27 13:15:27,583 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 48 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 13:15:27,583 INFO L413 NwaCegarLoop]: 46 mSDtfsCounter, 9 mSDsluCounter, 110 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 156 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 13:15:27,584 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 156 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 13:15:27,584 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2022-04-27 13:15:27,935 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 144. [2022-04-27 13:15:27,936 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 13:15:27,936 INFO L82 GeneralOperation]: Start isEquivalent. First operand 161 states. Second operand has 144 states, 77 states have (on average 1.1688311688311688) internal successors, (90), 85 states have internal predecessors, (90), 57 states have call successors, (57), 10 states have call predecessors, (57), 9 states have return successors, (55), 48 states have call predecessors, (55), 55 states have call successors, (55) [2022-04-27 13:15:27,937 INFO L74 IsIncluded]: Start isIncluded. First operand 161 states. Second operand has 144 states, 77 states have (on average 1.1688311688311688) internal successors, (90), 85 states have internal predecessors, (90), 57 states have call successors, (57), 10 states have call predecessors, (57), 9 states have return successors, (55), 48 states have call predecessors, (55), 55 states have call successors, (55) [2022-04-27 13:15:27,937 INFO L87 Difference]: Start difference. First operand 161 states. Second operand has 144 states, 77 states have (on average 1.1688311688311688) internal successors, (90), 85 states have internal predecessors, (90), 57 states have call successors, (57), 10 states have call predecessors, (57), 9 states have return successors, (55), 48 states have call predecessors, (55), 55 states have call successors, (55) [2022-04-27 13:15:27,942 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:15:27,942 INFO L93 Difference]: Finished difference Result 161 states and 228 transitions. [2022-04-27 13:15:27,942 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 228 transitions. [2022-04-27 13:15:27,943 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 13:15:27,944 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 13:15:27,944 INFO L74 IsIncluded]: Start isIncluded. First operand has 144 states, 77 states have (on average 1.1688311688311688) internal successors, (90), 85 states have internal predecessors, (90), 57 states have call successors, (57), 10 states have call predecessors, (57), 9 states have return successors, (55), 48 states have call predecessors, (55), 55 states have call successors, (55) Second operand 161 states. [2022-04-27 13:15:27,944 INFO L87 Difference]: Start difference. First operand has 144 states, 77 states have (on average 1.1688311688311688) internal successors, (90), 85 states have internal predecessors, (90), 57 states have call successors, (57), 10 states have call predecessors, (57), 9 states have return successors, (55), 48 states have call predecessors, (55), 55 states have call successors, (55) Second operand 161 states. [2022-04-27 13:15:27,949 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:15:27,949 INFO L93 Difference]: Finished difference Result 161 states and 228 transitions. [2022-04-27 13:15:27,949 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 228 transitions. [2022-04-27 13:15:27,950 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 13:15:27,950 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 13:15:27,950 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 13:15:27,950 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 13:15:27,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 144 states, 77 states have (on average 1.1688311688311688) internal successors, (90), 85 states have internal predecessors, (90), 57 states have call successors, (57), 10 states have call predecessors, (57), 9 states have return successors, (55), 48 states have call predecessors, (55), 55 states have call successors, (55) [2022-04-27 13:15:27,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 202 transitions. [2022-04-27 13:15:27,956 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 202 transitions. Word has length 52 [2022-04-27 13:15:27,956 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 13:15:27,956 INFO L495 AbstractCegarLoop]: Abstraction has 144 states and 202 transitions. [2022-04-27 13:15:27,956 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.8) internal successors, (19), 4 states have internal predecessors, (19), 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 13:15:27,956 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 202 transitions. [2022-04-27 13:15:27,957 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2022-04-27 13:15:27,957 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 13:15:27,957 INFO L195 NwaCegarLoop]: trace histogram [5, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 13:15:27,982 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 13:15:28,171 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 13:15:28,171 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 13:15:28,172 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 13:15:28,172 INFO L85 PathProgramCache]: Analyzing trace with hash 188363668, now seen corresponding path program 1 times [2022-04-27 13:15:28,172 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 13:15:28,172 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2082642854] [2022-04-27 13:15:28,172 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 13:15:28,172 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 13:15:28,199 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 13:15:28,199 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1437482219] [2022-04-27 13:15:28,199 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 13:15:28,199 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 13:15:28,199 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 13:15:28,200 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 13:15:28,201 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 13:15:28,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 13:15:28,247 INFO L263 TraceCheckSpWp]: Trace formula consists of 177 conjuncts, 45 conjunts are in the unsatisfiable core [2022-04-27 13:15:28,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 13:15:28,260 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 13:15:28,879 INFO L272 TraceCheckUtils]: 0: Hoare triple {7431#true} call ULTIMATE.init(); {7431#true} is VALID [2022-04-27 13:15:28,879 INFO L290 TraceCheckUtils]: 1: Hoare triple {7431#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(11, 2);call #Ultimate.allocInit(12, 3); {7431#true} is VALID [2022-04-27 13:15:28,879 INFO L290 TraceCheckUtils]: 2: Hoare triple {7431#true} assume true; {7431#true} is VALID [2022-04-27 13:15:28,879 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7431#true} {7431#true} #112#return; {7431#true} is VALID [2022-04-27 13:15:28,879 INFO L272 TraceCheckUtils]: 4: Hoare triple {7431#true} call #t~ret6 := main(); {7431#true} is VALID [2022-04-27 13:15:28,880 INFO L290 TraceCheckUtils]: 5: Hoare triple {7431#true} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~s~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4; {7431#true} is VALID [2022-04-27 13:15:28,880 INFO L272 TraceCheckUtils]: 6: Hoare triple {7431#true} call assume_abort_if_not((if ~x~0 >= 0 && ~x~0 <= 50 then 1 else 0)); {7431#true} is VALID [2022-04-27 13:15:28,880 INFO L290 TraceCheckUtils]: 7: Hoare triple {7431#true} ~cond := #in~cond; {7431#true} is VALID [2022-04-27 13:15:28,880 INFO L290 TraceCheckUtils]: 8: Hoare triple {7431#true} assume !(0 == ~cond); {7431#true} is VALID [2022-04-27 13:15:28,880 INFO L290 TraceCheckUtils]: 9: Hoare triple {7431#true} assume true; {7431#true} is VALID [2022-04-27 13:15:28,880 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {7431#true} {7431#true} #94#return; {7431#true} is VALID [2022-04-27 13:15:28,880 INFO L290 TraceCheckUtils]: 11: Hoare triple {7431#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {7431#true} is VALID [2022-04-27 13:15:28,880 INFO L272 TraceCheckUtils]: 12: Hoare triple {7431#true} call assume_abort_if_not((if ~y~0 >= 0 && ~y~0 <= 50 then 1 else 0)); {7431#true} is VALID [2022-04-27 13:15:28,880 INFO L290 TraceCheckUtils]: 13: Hoare triple {7431#true} ~cond := #in~cond; {7431#true} is VALID [2022-04-27 13:15:28,880 INFO L290 TraceCheckUtils]: 14: Hoare triple {7431#true} assume !(0 == ~cond); {7431#true} is VALID [2022-04-27 13:15:28,880 INFO L290 TraceCheckUtils]: 15: Hoare triple {7431#true} assume true; {7431#true} is VALID [2022-04-27 13:15:28,881 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {7431#true} {7431#true} #96#return; {7431#true} is VALID [2022-04-27 13:15:28,881 INFO L272 TraceCheckUtils]: 17: Hoare triple {7431#true} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {7431#true} is VALID [2022-04-27 13:15:28,881 INFO L290 TraceCheckUtils]: 18: Hoare triple {7431#true} ~cond := #in~cond; {7431#true} is VALID [2022-04-27 13:15:28,881 INFO L290 TraceCheckUtils]: 19: Hoare triple {7431#true} assume !(0 == ~cond); {7431#true} is VALID [2022-04-27 13:15:28,881 INFO L290 TraceCheckUtils]: 20: Hoare triple {7431#true} assume true; {7431#true} is VALID [2022-04-27 13:15:28,881 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {7431#true} {7431#true} #98#return; {7431#true} is VALID [2022-04-27 13:15:28,881 INFO L272 TraceCheckUtils]: 22: Hoare triple {7431#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {7431#true} is VALID [2022-04-27 13:15:28,881 INFO L290 TraceCheckUtils]: 23: Hoare triple {7431#true} ~cond := #in~cond; {7431#true} is VALID [2022-04-27 13:15:28,881 INFO L290 TraceCheckUtils]: 24: Hoare triple {7431#true} assume !(0 == ~cond); {7431#true} is VALID [2022-04-27 13:15:28,881 INFO L290 TraceCheckUtils]: 25: Hoare triple {7431#true} assume true; {7431#true} is VALID [2022-04-27 13:15:28,881 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {7431#true} {7431#true} #100#return; {7431#true} is VALID [2022-04-27 13:15:28,882 INFO L290 TraceCheckUtils]: 27: Hoare triple {7431#true} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1; {7517#(and (= main_~r~0 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 13:15:28,882 INFO L290 TraceCheckUtils]: 28: Hoare triple {7517#(and (= main_~r~0 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; {7517#(and (= main_~r~0 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 13:15:28,883 INFO L290 TraceCheckUtils]: 29: Hoare triple {7517#(and (= main_~r~0 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 !!(0 != ~b~0);havoc ~c~0;havoc ~k~0;~c~0 := ~a~0;~k~0 := 0; {7524#(and (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~c~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-27 13:15:28,883 INFO L290 TraceCheckUtils]: 30: Hoare triple {7524#(and (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~c~0 main_~x~0) (= main_~p~0 1))} assume !false; {7524#(and (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~c~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-27 13:15:28,884 INFO L290 TraceCheckUtils]: 31: Hoare triple {7524#(and (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~c~0 main_~x~0) (= main_~p~0 1))} assume !!(~c~0 >= ~b~0);havoc ~d~0;havoc ~v~0;~d~0 := 1;~v~0 := ~b~0; {7531#(and (= main_~b~0 main_~v~0) (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~d~0 1) (= main_~q~0 0) (= main_~c~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-27 13:15:28,884 INFO L290 TraceCheckUtils]: 32: Hoare triple {7531#(and (= main_~b~0 main_~v~0) (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~d~0 1) (= main_~q~0 0) (= main_~c~0 main_~x~0) (= main_~p~0 1))} assume !false; {7531#(and (= main_~b~0 main_~v~0) (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~d~0 1) (= main_~q~0 0) (= main_~c~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-27 13:15:28,884 INFO L272 TraceCheckUtils]: 33: Hoare triple {7531#(and (= main_~b~0 main_~v~0) (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~d~0 1) (= main_~q~0 0) (= main_~c~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)); {7431#true} is VALID [2022-04-27 13:15:28,884 INFO L290 TraceCheckUtils]: 34: Hoare triple {7431#true} ~cond := #in~cond; {7431#true} is VALID [2022-04-27 13:15:28,885 INFO L290 TraceCheckUtils]: 35: Hoare triple {7431#true} assume !(0 == ~cond); {7431#true} is VALID [2022-04-27 13:15:28,885 INFO L290 TraceCheckUtils]: 36: Hoare triple {7431#true} assume true; {7431#true} is VALID [2022-04-27 13:15:28,886 INFO L284 TraceCheckUtils]: 37: Hoare quadruple {7431#true} {7531#(and (= main_~b~0 main_~v~0) (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~d~0 1) (= main_~q~0 0) (= main_~c~0 main_~x~0) (= main_~p~0 1))} #102#return; {7531#(and (= main_~b~0 main_~v~0) (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~d~0 1) (= main_~q~0 0) (= main_~c~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-27 13:15:28,886 INFO L272 TraceCheckUtils]: 38: Hoare triple {7531#(and (= main_~b~0 main_~v~0) (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~d~0 1) (= main_~q~0 0) (= main_~c~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)); {7431#true} is VALID [2022-04-27 13:15:28,886 INFO L290 TraceCheckUtils]: 39: Hoare triple {7431#true} ~cond := #in~cond; {7431#true} is VALID [2022-04-27 13:15:28,886 INFO L290 TraceCheckUtils]: 40: Hoare triple {7431#true} assume !(0 == ~cond); {7431#true} is VALID [2022-04-27 13:15:28,886 INFO L290 TraceCheckUtils]: 41: Hoare triple {7431#true} assume true; {7431#true} is VALID [2022-04-27 13:15:28,887 INFO L284 TraceCheckUtils]: 42: Hoare quadruple {7431#true} {7531#(and (= main_~b~0 main_~v~0) (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~d~0 1) (= main_~q~0 0) (= main_~c~0 main_~x~0) (= main_~p~0 1))} #104#return; {7531#(and (= main_~b~0 main_~v~0) (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~d~0 1) (= main_~q~0 0) (= main_~c~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-27 13:15:28,887 INFO L272 TraceCheckUtils]: 43: Hoare triple {7531#(and (= main_~b~0 main_~v~0) (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~d~0 1) (= main_~q~0 0) (= main_~c~0 main_~x~0) (= main_~p~0 1))} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {7431#true} is VALID [2022-04-27 13:15:28,887 INFO L290 TraceCheckUtils]: 44: Hoare triple {7431#true} ~cond := #in~cond; {7431#true} is VALID [2022-04-27 13:15:28,887 INFO L290 TraceCheckUtils]: 45: Hoare triple {7431#true} assume !(0 == ~cond); {7431#true} is VALID [2022-04-27 13:15:28,887 INFO L290 TraceCheckUtils]: 46: Hoare triple {7431#true} assume true; {7431#true} is VALID [2022-04-27 13:15:28,888 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {7431#true} {7531#(and (= main_~b~0 main_~v~0) (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~d~0 1) (= main_~q~0 0) (= main_~c~0 main_~x~0) (= main_~p~0 1))} #106#return; {7531#(and (= main_~b~0 main_~v~0) (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~d~0 1) (= main_~q~0 0) (= main_~c~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-27 13:15:28,888 INFO L272 TraceCheckUtils]: 48: Hoare triple {7531#(and (= main_~b~0 main_~v~0) (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~d~0 1) (= main_~q~0 0) (= main_~c~0 main_~x~0) (= main_~p~0 1))} call __VERIFIER_assert((if ~v~0 == ~b~0 * ~d~0 then 1 else 0)); {7431#true} is VALID [2022-04-27 13:15:28,888 INFO L290 TraceCheckUtils]: 49: Hoare triple {7431#true} ~cond := #in~cond; {7431#true} is VALID [2022-04-27 13:15:28,888 INFO L290 TraceCheckUtils]: 50: Hoare triple {7431#true} assume !(0 == ~cond); {7431#true} is VALID [2022-04-27 13:15:28,888 INFO L290 TraceCheckUtils]: 51: Hoare triple {7431#true} assume true; {7431#true} is VALID [2022-04-27 13:15:28,889 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {7431#true} {7531#(and (= main_~b~0 main_~v~0) (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~d~0 1) (= main_~q~0 0) (= main_~c~0 main_~x~0) (= main_~p~0 1))} #108#return; {7531#(and (= main_~b~0 main_~v~0) (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~d~0 1) (= main_~q~0 0) (= main_~c~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-27 13:15:28,890 INFO L290 TraceCheckUtils]: 53: Hoare triple {7531#(and (= main_~b~0 main_~v~0) (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~d~0 1) (= main_~q~0 0) (= main_~c~0 main_~x~0) (= main_~p~0 1))} assume !(~c~0 >= 2 * ~v~0); {7531#(and (= main_~b~0 main_~v~0) (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~d~0 1) (= main_~q~0 0) (= main_~c~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-27 13:15:28,890 INFO L290 TraceCheckUtils]: 54: Hoare triple {7531#(and (= main_~b~0 main_~v~0) (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~d~0 1) (= main_~q~0 0) (= main_~c~0 main_~x~0) (= main_~p~0 1))} ~c~0 := ~c~0 - ~v~0;~k~0 := ~k~0 + ~d~0; {7601#(and (= main_~r~0 0) (= main_~s~0 1) (= (+ main_~x~0 (* (- 1) main_~b~0)) main_~c~0) (= main_~b~0 main_~y~0) (= main_~k~0 1) (= main_~q~0 0) (= main_~p~0 1))} is VALID [2022-04-27 13:15:28,891 INFO L290 TraceCheckUtils]: 55: Hoare triple {7601#(and (= main_~r~0 0) (= main_~s~0 1) (= (+ main_~x~0 (* (- 1) main_~b~0)) main_~c~0) (= main_~b~0 main_~y~0) (= main_~k~0 1) (= main_~q~0 0) (= main_~p~0 1))} assume !false; {7601#(and (= main_~r~0 0) (= main_~s~0 1) (= (+ main_~x~0 (* (- 1) main_~b~0)) main_~c~0) (= main_~b~0 main_~y~0) (= main_~k~0 1) (= main_~q~0 0) (= main_~p~0 1))} is VALID [2022-04-27 13:15:28,892 INFO L290 TraceCheckUtils]: 56: Hoare triple {7601#(and (= main_~r~0 0) (= main_~s~0 1) (= (+ main_~x~0 (* (- 1) main_~b~0)) main_~c~0) (= main_~b~0 main_~y~0) (= main_~k~0 1) (= main_~q~0 0) (= main_~p~0 1))} assume !(~c~0 >= ~b~0); {7601#(and (= main_~r~0 0) (= main_~s~0 1) (= (+ main_~x~0 (* (- 1) main_~b~0)) main_~c~0) (= main_~b~0 main_~y~0) (= main_~k~0 1) (= main_~q~0 0) (= main_~p~0 1))} is VALID [2022-04-27 13:15:28,892 INFO L290 TraceCheckUtils]: 57: Hoare triple {7601#(and (= main_~r~0 0) (= main_~s~0 1) (= (+ main_~x~0 (* (- 1) main_~b~0)) main_~c~0) (= main_~b~0 main_~y~0) (= main_~k~0 1) (= main_~q~0 0) (= main_~p~0 1))} ~a~0 := ~b~0;~b~0 := ~c~0;havoc ~temp~0;~temp~0 := ~p~0;~p~0 := ~q~0;~q~0 := ~temp~0 - ~q~0 * ~k~0;~temp~0 := ~r~0;~r~0 := ~s~0;~s~0 := ~temp~0 - ~s~0 * ~k~0; {7611#(and (= main_~p~0 0) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~b~0 (+ (* (- 1) main_~a~0) main_~x~0)) (= main_~q~0 1) (= (+ main_~s~0 1) 0))} is VALID [2022-04-27 13:15:28,893 INFO L290 TraceCheckUtils]: 58: Hoare triple {7611#(and (= main_~p~0 0) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~b~0 (+ (* (- 1) main_~a~0) main_~x~0)) (= main_~q~0 1) (= (+ main_~s~0 1) 0))} assume !false; {7611#(and (= main_~p~0 0) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~b~0 (+ (* (- 1) main_~a~0) main_~x~0)) (= main_~q~0 1) (= (+ main_~s~0 1) 0))} is VALID [2022-04-27 13:15:28,893 INFO L290 TraceCheckUtils]: 59: Hoare triple {7611#(and (= main_~p~0 0) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~b~0 (+ (* (- 1) main_~a~0) main_~x~0)) (= main_~q~0 1) (= (+ main_~s~0 1) 0))} assume !(0 != ~b~0); {7618#(and (= main_~p~0 0) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~q~0 1) (= (+ main_~s~0 1) 0) (= (+ (* (- 1) main_~a~0) main_~x~0) 0))} is VALID [2022-04-27 13:15:28,894 INFO L272 TraceCheckUtils]: 60: Hoare triple {7618#(and (= main_~p~0 0) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~q~0 1) (= (+ main_~s~0 1) 0) (= (+ (* (- 1) main_~a~0) main_~x~0) 0))} call __VERIFIER_assert((if ~p~0 * ~x~0 - ~q~0 * ~x~0 + ~r~0 * ~y~0 - ~s~0 * ~y~0 == ~a~0 then 1 else 0)); {7622#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 13:15:28,895 INFO L290 TraceCheckUtils]: 61: Hoare triple {7622#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {7626#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 13:15:28,895 INFO L290 TraceCheckUtils]: 62: Hoare triple {7626#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {7432#false} is VALID [2022-04-27 13:15:28,895 INFO L290 TraceCheckUtils]: 63: Hoare triple {7432#false} assume !false; {7432#false} is VALID [2022-04-27 13:15:28,895 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 8 proven. 4 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2022-04-27 13:15:28,896 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 13:15:29,430 INFO L290 TraceCheckUtils]: 63: Hoare triple {7432#false} assume !false; {7432#false} is VALID [2022-04-27 13:15:29,430 INFO L290 TraceCheckUtils]: 62: Hoare triple {7626#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {7432#false} is VALID [2022-04-27 13:15:29,431 INFO L290 TraceCheckUtils]: 61: Hoare triple {7622#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {7626#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 13:15:29,432 INFO L272 TraceCheckUtils]: 60: Hoare triple {7642#(= (+ (* main_~q~0 main_~x~0) main_~a~0 (* main_~y~0 main_~s~0)) (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} call __VERIFIER_assert((if ~p~0 * ~x~0 - ~q~0 * ~x~0 + ~r~0 * ~y~0 - ~s~0 * ~y~0 == ~a~0 then 1 else 0)); {7622#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 13:15:29,432 INFO L290 TraceCheckUtils]: 59: Hoare triple {7646#(or (= (+ (* main_~q~0 main_~x~0) main_~a~0 (* main_~y~0 main_~s~0)) (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))) (not (= main_~b~0 0)))} assume !(0 != ~b~0); {7642#(= (+ (* main_~q~0 main_~x~0) main_~a~0 (* main_~y~0 main_~s~0)) (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} is VALID [2022-04-27 13:15:29,433 INFO L290 TraceCheckUtils]: 58: Hoare triple {7646#(or (= (+ (* main_~q~0 main_~x~0) main_~a~0 (* main_~y~0 main_~s~0)) (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))) (not (= main_~b~0 0)))} assume !false; {7646#(or (= (+ (* main_~q~0 main_~x~0) main_~a~0 (* main_~y~0 main_~s~0)) (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))) (not (= main_~b~0 0)))} is VALID [2022-04-27 13:15:29,600 INFO L290 TraceCheckUtils]: 57: Hoare triple {7653#(or (not (= main_~c~0 0)) (= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) main_~b~0 (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))))} ~a~0 := ~b~0;~b~0 := ~c~0;havoc ~temp~0;~temp~0 := ~p~0;~p~0 := ~q~0;~q~0 := ~temp~0 - ~q~0 * ~k~0;~temp~0 := ~r~0;~r~0 := ~s~0;~s~0 := ~temp~0 - ~s~0 * ~k~0; {7646#(or (= (+ (* main_~q~0 main_~x~0) main_~a~0 (* main_~y~0 main_~s~0)) (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))) (not (= main_~b~0 0)))} is VALID [2022-04-27 13:15:29,600 INFO L290 TraceCheckUtils]: 56: Hoare triple {7653#(or (not (= main_~c~0 0)) (= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) main_~b~0 (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))))} assume !(~c~0 >= ~b~0); {7653#(or (not (= main_~c~0 0)) (= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) main_~b~0 (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))))} is VALID [2022-04-27 13:15:29,601 INFO L290 TraceCheckUtils]: 55: Hoare triple {7653#(or (not (= main_~c~0 0)) (= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) main_~b~0 (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))))} assume !false; {7653#(or (not (= main_~c~0 0)) (= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) main_~b~0 (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))))} is VALID [2022-04-27 13:15:29,642 INFO L290 TraceCheckUtils]: 54: Hoare triple {7663#(or (not (= (+ main_~c~0 (* (- 1) main_~v~0)) 0)) (= (+ main_~b~0 (* (+ main_~p~0 (* (- 1) main_~q~0 (+ main_~d~0 main_~k~0))) main_~x~0) (* (+ (* (- 1) (* main_~s~0 (+ main_~d~0 main_~k~0))) main_~r~0) main_~y~0)) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))))} ~c~0 := ~c~0 - ~v~0;~k~0 := ~k~0 + ~d~0; {7653#(or (not (= main_~c~0 0)) (= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) main_~b~0 (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))))} is VALID [2022-04-27 13:15:29,642 INFO L290 TraceCheckUtils]: 53: Hoare triple {7663#(or (not (= (+ main_~c~0 (* (- 1) main_~v~0)) 0)) (= (+ main_~b~0 (* (+ main_~p~0 (* (- 1) main_~q~0 (+ main_~d~0 main_~k~0))) main_~x~0) (* (+ (* (- 1) (* main_~s~0 (+ main_~d~0 main_~k~0))) main_~r~0) main_~y~0)) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))))} assume !(~c~0 >= 2 * ~v~0); {7663#(or (not (= (+ main_~c~0 (* (- 1) main_~v~0)) 0)) (= (+ main_~b~0 (* (+ main_~p~0 (* (- 1) main_~q~0 (+ main_~d~0 main_~k~0))) main_~x~0) (* (+ (* (- 1) (* main_~s~0 (+ main_~d~0 main_~k~0))) main_~r~0) main_~y~0)) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))))} is VALID [2022-04-27 13:15:29,643 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {7431#true} {7663#(or (not (= (+ main_~c~0 (* (- 1) main_~v~0)) 0)) (= (+ main_~b~0 (* (+ main_~p~0 (* (- 1) main_~q~0 (+ main_~d~0 main_~k~0))) main_~x~0) (* (+ (* (- 1) (* main_~s~0 (+ main_~d~0 main_~k~0))) main_~r~0) main_~y~0)) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))))} #108#return; {7663#(or (not (= (+ main_~c~0 (* (- 1) main_~v~0)) 0)) (= (+ main_~b~0 (* (+ main_~p~0 (* (- 1) main_~q~0 (+ main_~d~0 main_~k~0))) main_~x~0) (* (+ (* (- 1) (* main_~s~0 (+ main_~d~0 main_~k~0))) main_~r~0) main_~y~0)) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))))} is VALID [2022-04-27 13:15:29,643 INFO L290 TraceCheckUtils]: 51: Hoare triple {7431#true} assume true; {7431#true} is VALID [2022-04-27 13:15:29,643 INFO L290 TraceCheckUtils]: 50: Hoare triple {7431#true} assume !(0 == ~cond); {7431#true} is VALID [2022-04-27 13:15:29,644 INFO L290 TraceCheckUtils]: 49: Hoare triple {7431#true} ~cond := #in~cond; {7431#true} is VALID [2022-04-27 13:15:29,644 INFO L272 TraceCheckUtils]: 48: Hoare triple {7663#(or (not (= (+ main_~c~0 (* (- 1) main_~v~0)) 0)) (= (+ main_~b~0 (* (+ main_~p~0 (* (- 1) main_~q~0 (+ main_~d~0 main_~k~0))) main_~x~0) (* (+ (* (- 1) (* main_~s~0 (+ main_~d~0 main_~k~0))) main_~r~0) main_~y~0)) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))))} call __VERIFIER_assert((if ~v~0 == ~b~0 * ~d~0 then 1 else 0)); {7431#true} is VALID [2022-04-27 13:15:29,644 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {7431#true} {7663#(or (not (= (+ main_~c~0 (* (- 1) main_~v~0)) 0)) (= (+ main_~b~0 (* (+ main_~p~0 (* (- 1) main_~q~0 (+ main_~d~0 main_~k~0))) main_~x~0) (* (+ (* (- 1) (* main_~s~0 (+ main_~d~0 main_~k~0))) main_~r~0) main_~y~0)) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))))} #106#return; {7663#(or (not (= (+ main_~c~0 (* (- 1) main_~v~0)) 0)) (= (+ main_~b~0 (* (+ main_~p~0 (* (- 1) main_~q~0 (+ main_~d~0 main_~k~0))) main_~x~0) (* (+ (* (- 1) (* main_~s~0 (+ main_~d~0 main_~k~0))) main_~r~0) main_~y~0)) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))))} is VALID [2022-04-27 13:15:29,644 INFO L290 TraceCheckUtils]: 46: Hoare triple {7431#true} assume true; {7431#true} is VALID [2022-04-27 13:15:29,645 INFO L290 TraceCheckUtils]: 45: Hoare triple {7431#true} assume !(0 == ~cond); {7431#true} is VALID [2022-04-27 13:15:29,645 INFO L290 TraceCheckUtils]: 44: Hoare triple {7431#true} ~cond := #in~cond; {7431#true} is VALID [2022-04-27 13:15:29,645 INFO L272 TraceCheckUtils]: 43: Hoare triple {7663#(or (not (= (+ main_~c~0 (* (- 1) main_~v~0)) 0)) (= (+ main_~b~0 (* (+ main_~p~0 (* (- 1) main_~q~0 (+ main_~d~0 main_~k~0))) main_~x~0) (* (+ (* (- 1) (* main_~s~0 (+ main_~d~0 main_~k~0))) main_~r~0) main_~y~0)) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))))} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {7431#true} is VALID [2022-04-27 13:15:29,645 INFO L284 TraceCheckUtils]: 42: Hoare quadruple {7431#true} {7663#(or (not (= (+ main_~c~0 (* (- 1) main_~v~0)) 0)) (= (+ main_~b~0 (* (+ main_~p~0 (* (- 1) main_~q~0 (+ main_~d~0 main_~k~0))) main_~x~0) (* (+ (* (- 1) (* main_~s~0 (+ main_~d~0 main_~k~0))) main_~r~0) main_~y~0)) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))))} #104#return; {7663#(or (not (= (+ main_~c~0 (* (- 1) main_~v~0)) 0)) (= (+ main_~b~0 (* (+ main_~p~0 (* (- 1) main_~q~0 (+ main_~d~0 main_~k~0))) main_~x~0) (* (+ (* (- 1) (* main_~s~0 (+ main_~d~0 main_~k~0))) main_~r~0) main_~y~0)) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))))} is VALID [2022-04-27 13:15:29,645 INFO L290 TraceCheckUtils]: 41: Hoare triple {7431#true} assume true; {7431#true} is VALID [2022-04-27 13:15:29,646 INFO L290 TraceCheckUtils]: 40: Hoare triple {7431#true} assume !(0 == ~cond); {7431#true} is VALID [2022-04-27 13:15:29,646 INFO L290 TraceCheckUtils]: 39: Hoare triple {7431#true} ~cond := #in~cond; {7431#true} is VALID [2022-04-27 13:15:29,646 INFO L272 TraceCheckUtils]: 38: Hoare triple {7663#(or (not (= (+ main_~c~0 (* (- 1) main_~v~0)) 0)) (= (+ main_~b~0 (* (+ main_~p~0 (* (- 1) main_~q~0 (+ main_~d~0 main_~k~0))) main_~x~0) (* (+ (* (- 1) (* main_~s~0 (+ main_~d~0 main_~k~0))) main_~r~0) main_~y~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)); {7431#true} is VALID [2022-04-27 13:15:29,646 INFO L284 TraceCheckUtils]: 37: Hoare quadruple {7431#true} {7663#(or (not (= (+ main_~c~0 (* (- 1) main_~v~0)) 0)) (= (+ main_~b~0 (* (+ main_~p~0 (* (- 1) main_~q~0 (+ main_~d~0 main_~k~0))) main_~x~0) (* (+ (* (- 1) (* main_~s~0 (+ main_~d~0 main_~k~0))) main_~r~0) main_~y~0)) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))))} #102#return; {7663#(or (not (= (+ main_~c~0 (* (- 1) main_~v~0)) 0)) (= (+ main_~b~0 (* (+ main_~p~0 (* (- 1) main_~q~0 (+ main_~d~0 main_~k~0))) main_~x~0) (* (+ (* (- 1) (* main_~s~0 (+ main_~d~0 main_~k~0))) main_~r~0) main_~y~0)) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))))} is VALID [2022-04-27 13:15:29,647 INFO L290 TraceCheckUtils]: 36: Hoare triple {7431#true} assume true; {7431#true} is VALID [2022-04-27 13:15:29,647 INFO L290 TraceCheckUtils]: 35: Hoare triple {7431#true} assume !(0 == ~cond); {7431#true} is VALID [2022-04-27 13:15:29,647 INFO L290 TraceCheckUtils]: 34: Hoare triple {7431#true} ~cond := #in~cond; {7431#true} is VALID [2022-04-27 13:15:29,647 INFO L272 TraceCheckUtils]: 33: Hoare triple {7663#(or (not (= (+ main_~c~0 (* (- 1) main_~v~0)) 0)) (= (+ main_~b~0 (* (+ main_~p~0 (* (- 1) main_~q~0 (+ main_~d~0 main_~k~0))) main_~x~0) (* (+ (* (- 1) (* main_~s~0 (+ main_~d~0 main_~k~0))) main_~r~0) main_~y~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)); {7431#true} is VALID [2022-04-27 13:15:29,647 INFO L290 TraceCheckUtils]: 32: Hoare triple {7663#(or (not (= (+ main_~c~0 (* (- 1) main_~v~0)) 0)) (= (+ main_~b~0 (* (+ main_~p~0 (* (- 1) main_~q~0 (+ main_~d~0 main_~k~0))) main_~x~0) (* (+ (* (- 1) (* main_~s~0 (+ main_~d~0 main_~k~0))) main_~r~0) main_~y~0)) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))))} assume !false; {7663#(or (not (= (+ main_~c~0 (* (- 1) main_~v~0)) 0)) (= (+ main_~b~0 (* (+ main_~p~0 (* (- 1) main_~q~0 (+ main_~d~0 main_~k~0))) main_~x~0) (* (+ (* (- 1) (* main_~s~0 (+ main_~d~0 main_~k~0))) main_~r~0) main_~y~0)) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))))} is VALID [2022-04-27 13:15:29,648 INFO L290 TraceCheckUtils]: 31: Hoare triple {7733#(or (= (+ (* main_~x~0 (+ main_~p~0 (* (- 1) (+ main_~k~0 1) main_~q~0))) main_~b~0 (* main_~y~0 (+ main_~r~0 (* (* (+ main_~k~0 1) main_~s~0) (- 1))))) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (not (= (+ main_~c~0 (* (- 1) main_~b~0)) 0)))} assume !!(~c~0 >= ~b~0);havoc ~d~0;havoc ~v~0;~d~0 := 1;~v~0 := ~b~0; {7663#(or (not (= (+ main_~c~0 (* (- 1) main_~v~0)) 0)) (= (+ main_~b~0 (* (+ main_~p~0 (* (- 1) main_~q~0 (+ main_~d~0 main_~k~0))) main_~x~0) (* (+ (* (- 1) (* main_~s~0 (+ main_~d~0 main_~k~0))) main_~r~0) main_~y~0)) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))))} is VALID [2022-04-27 13:15:29,648 INFO L290 TraceCheckUtils]: 30: Hoare triple {7733#(or (= (+ (* main_~x~0 (+ main_~p~0 (* (- 1) (+ main_~k~0 1) main_~q~0))) main_~b~0 (* main_~y~0 (+ main_~r~0 (* (* (+ main_~k~0 1) main_~s~0) (- 1))))) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (not (= (+ main_~c~0 (* (- 1) main_~b~0)) 0)))} assume !false; {7733#(or (= (+ (* main_~x~0 (+ main_~p~0 (* (- 1) (+ main_~k~0 1) main_~q~0))) main_~b~0 (* main_~y~0 (+ main_~r~0 (* (* (+ main_~k~0 1) main_~s~0) (- 1))))) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (not (= (+ main_~c~0 (* (- 1) main_~b~0)) 0)))} is VALID [2022-04-27 13:15:29,649 INFO L290 TraceCheckUtils]: 29: Hoare triple {7740#(or (= (+ (* (+ main_~r~0 (* (- 1) main_~s~0)) main_~y~0) main_~b~0 (* main_~x~0 (+ main_~p~0 (* (- 1) main_~q~0)))) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (not (= (+ main_~a~0 (* (- 1) main_~b~0)) 0)))} assume !!(0 != ~b~0);havoc ~c~0;havoc ~k~0;~c~0 := ~a~0;~k~0 := 0; {7733#(or (= (+ (* main_~x~0 (+ main_~p~0 (* (- 1) (+ main_~k~0 1) main_~q~0))) main_~b~0 (* main_~y~0 (+ main_~r~0 (* (* (+ main_~k~0 1) main_~s~0) (- 1))))) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (not (= (+ main_~c~0 (* (- 1) main_~b~0)) 0)))} is VALID [2022-04-27 13:15:29,649 INFO L290 TraceCheckUtils]: 28: Hoare triple {7740#(or (= (+ (* (+ main_~r~0 (* (- 1) main_~s~0)) main_~y~0) main_~b~0 (* main_~x~0 (+ main_~p~0 (* (- 1) main_~q~0)))) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (not (= (+ main_~a~0 (* (- 1) main_~b~0)) 0)))} assume !false; {7740#(or (= (+ (* (+ main_~r~0 (* (- 1) main_~s~0)) main_~y~0) main_~b~0 (* main_~x~0 (+ main_~p~0 (* (- 1) main_~q~0)))) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (not (= (+ main_~a~0 (* (- 1) main_~b~0)) 0)))} is VALID [2022-04-27 13:15:29,650 INFO L290 TraceCheckUtils]: 27: Hoare triple {7431#true} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1; {7740#(or (= (+ (* (+ main_~r~0 (* (- 1) main_~s~0)) main_~y~0) main_~b~0 (* main_~x~0 (+ main_~p~0 (* (- 1) main_~q~0)))) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (not (= (+ main_~a~0 (* (- 1) main_~b~0)) 0)))} is VALID [2022-04-27 13:15:29,650 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {7431#true} {7431#true} #100#return; {7431#true} is VALID [2022-04-27 13:15:29,650 INFO L290 TraceCheckUtils]: 25: Hoare triple {7431#true} assume true; {7431#true} is VALID [2022-04-27 13:15:29,650 INFO L290 TraceCheckUtils]: 24: Hoare triple {7431#true} assume !(0 == ~cond); {7431#true} is VALID [2022-04-27 13:15:29,650 INFO L290 TraceCheckUtils]: 23: Hoare triple {7431#true} ~cond := #in~cond; {7431#true} is VALID [2022-04-27 13:15:29,650 INFO L272 TraceCheckUtils]: 22: Hoare triple {7431#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {7431#true} is VALID [2022-04-27 13:15:29,650 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {7431#true} {7431#true} #98#return; {7431#true} is VALID [2022-04-27 13:15:29,650 INFO L290 TraceCheckUtils]: 20: Hoare triple {7431#true} assume true; {7431#true} is VALID [2022-04-27 13:15:29,650 INFO L290 TraceCheckUtils]: 19: Hoare triple {7431#true} assume !(0 == ~cond); {7431#true} is VALID [2022-04-27 13:15:29,650 INFO L290 TraceCheckUtils]: 18: Hoare triple {7431#true} ~cond := #in~cond; {7431#true} is VALID [2022-04-27 13:15:29,650 INFO L272 TraceCheckUtils]: 17: Hoare triple {7431#true} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {7431#true} is VALID [2022-04-27 13:15:29,650 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {7431#true} {7431#true} #96#return; {7431#true} is VALID [2022-04-27 13:15:29,650 INFO L290 TraceCheckUtils]: 15: Hoare triple {7431#true} assume true; {7431#true} is VALID [2022-04-27 13:15:29,651 INFO L290 TraceCheckUtils]: 14: Hoare triple {7431#true} assume !(0 == ~cond); {7431#true} is VALID [2022-04-27 13:15:29,651 INFO L290 TraceCheckUtils]: 13: Hoare triple {7431#true} ~cond := #in~cond; {7431#true} is VALID [2022-04-27 13:15:29,651 INFO L272 TraceCheckUtils]: 12: Hoare triple {7431#true} call assume_abort_if_not((if ~y~0 >= 0 && ~y~0 <= 50 then 1 else 0)); {7431#true} is VALID [2022-04-27 13:15:29,651 INFO L290 TraceCheckUtils]: 11: Hoare triple {7431#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {7431#true} is VALID [2022-04-27 13:15:29,651 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {7431#true} {7431#true} #94#return; {7431#true} is VALID [2022-04-27 13:15:29,651 INFO L290 TraceCheckUtils]: 9: Hoare triple {7431#true} assume true; {7431#true} is VALID [2022-04-27 13:15:29,651 INFO L290 TraceCheckUtils]: 8: Hoare triple {7431#true} assume !(0 == ~cond); {7431#true} is VALID [2022-04-27 13:15:29,651 INFO L290 TraceCheckUtils]: 7: Hoare triple {7431#true} ~cond := #in~cond; {7431#true} is VALID [2022-04-27 13:15:29,651 INFO L272 TraceCheckUtils]: 6: Hoare triple {7431#true} call assume_abort_if_not((if ~x~0 >= 0 && ~x~0 <= 50 then 1 else 0)); {7431#true} is VALID [2022-04-27 13:15:29,651 INFO L290 TraceCheckUtils]: 5: Hoare triple {7431#true} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~s~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4; {7431#true} is VALID [2022-04-27 13:15:29,652 INFO L272 TraceCheckUtils]: 4: Hoare triple {7431#true} call #t~ret6 := main(); {7431#true} is VALID [2022-04-27 13:15:29,652 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7431#true} {7431#true} #112#return; {7431#true} is VALID [2022-04-27 13:15:29,652 INFO L290 TraceCheckUtils]: 2: Hoare triple {7431#true} assume true; {7431#true} is VALID [2022-04-27 13:15:29,652 INFO L290 TraceCheckUtils]: 1: Hoare triple {7431#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(11, 2);call #Ultimate.allocInit(12, 3); {7431#true} is VALID [2022-04-27 13:15:29,652 INFO L272 TraceCheckUtils]: 0: Hoare triple {7431#true} call ULTIMATE.init(); {7431#true} is VALID [2022-04-27 13:15:29,652 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 8 proven. 4 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2022-04-27 13:15:29,653 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 13:15:29,653 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2082642854] [2022-04-27 13:15:29,653 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 13:15:29,653 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1437482219] [2022-04-27 13:15:29,653 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1437482219] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 13:15:29,653 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-27 13:15:29,653 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 16 [2022-04-27 13:15:29,653 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [504135798] [2022-04-27 13:15:29,653 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-27 13:15:29,654 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 14 states have (on average 2.7857142857142856) internal successors, (39), 15 states have internal predecessors, (39), 5 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) Word has length 64 [2022-04-27 13:15:29,654 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 13:15:29,654 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 16 states, 14 states have (on average 2.7857142857142856) internal successors, (39), 15 states have internal predecessors, (39), 5 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) [2022-04-27 13:15:29,833 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 13:15:29,834 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-04-27 13:15:29,834 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 13:15:29,834 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-04-27 13:15:29,834 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=196, Unknown=0, NotChecked=0, Total=240 [2022-04-27 13:15:29,834 INFO L87 Difference]: Start difference. First operand 144 states and 202 transitions. Second operand has 16 states, 14 states have (on average 2.7857142857142856) internal successors, (39), 15 states have internal predecessors, (39), 5 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) [2022-04-27 13:15:41,225 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:15:41,225 INFO L93 Difference]: Finished difference Result 331 states and 487 transitions. [2022-04-27 13:15:41,225 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2022-04-27 13:15:41,226 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 14 states have (on average 2.7857142857142856) internal successors, (39), 15 states have internal predecessors, (39), 5 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) Word has length 64 [2022-04-27 13:15:41,227 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 13:15:41,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 14 states have (on average 2.7857142857142856) internal successors, (39), 15 states have internal predecessors, (39), 5 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) [2022-04-27 13:15:41,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 283 transitions. [2022-04-27 13:15:41,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 14 states have (on average 2.7857142857142856) internal successors, (39), 15 states have internal predecessors, (39), 5 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) [2022-04-27 13:15:41,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 283 transitions. [2022-04-27 13:15:41,239 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 29 states and 283 transitions. [2022-04-27 13:15:44,860 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 283 edges. 283 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 13:15:44,868 INFO L225 Difference]: With dead ends: 331 [2022-04-27 13:15:44,868 INFO L226 Difference]: Without dead ends: 326 [2022-04-27 13:15:44,869 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 148 GetRequests, 112 SyntacticMatches, 1 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 235 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=275, Invalid=1057, Unknown=0, NotChecked=0, Total=1332 [2022-04-27 13:15:44,869 INFO L413 NwaCegarLoop]: 79 mSDtfsCounter, 137 mSDsluCounter, 316 mSDsCounter, 0 mSdLazyCounter, 797 mSolverCounterSat, 233 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 149 SdHoareTripleChecker+Valid, 395 SdHoareTripleChecker+Invalid, 1030 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 233 IncrementalHoareTripleChecker+Valid, 797 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.4s IncrementalHoareTripleChecker+Time [2022-04-27 13:15:44,869 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [149 Valid, 395 Invalid, 1030 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [233 Valid, 797 Invalid, 0 Unknown, 0 Unchecked, 4.4s Time] [2022-04-27 13:15:44,870 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 326 states. [2022-04-27 13:15:45,577 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 326 to 250. [2022-04-27 13:15:45,577 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 13:15:45,578 INFO L82 GeneralOperation]: Start isEquivalent. First operand 326 states. Second operand has 250 states, 146 states have (on average 1.1986301369863013) internal successors, (175), 153 states have internal predecessors, (175), 89 states have call successors, (89), 15 states have call predecessors, (89), 14 states have return successors, (87), 81 states have call predecessors, (87), 87 states have call successors, (87) [2022-04-27 13:15:45,578 INFO L74 IsIncluded]: Start isIncluded. First operand 326 states. Second operand has 250 states, 146 states have (on average 1.1986301369863013) internal successors, (175), 153 states have internal predecessors, (175), 89 states have call successors, (89), 15 states have call predecessors, (89), 14 states have return successors, (87), 81 states have call predecessors, (87), 87 states have call successors, (87) [2022-04-27 13:15:45,579 INFO L87 Difference]: Start difference. First operand 326 states. Second operand has 250 states, 146 states have (on average 1.1986301369863013) internal successors, (175), 153 states have internal predecessors, (175), 89 states have call successors, (89), 15 states have call predecessors, (89), 14 states have return successors, (87), 81 states have call predecessors, (87), 87 states have call successors, (87) [2022-04-27 13:15:45,592 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:15:45,592 INFO L93 Difference]: Finished difference Result 326 states and 478 transitions. [2022-04-27 13:15:45,592 INFO L276 IsEmpty]: Start isEmpty. Operand 326 states and 478 transitions. [2022-04-27 13:15:45,594 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 13:15:45,594 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 13:15:45,594 INFO L74 IsIncluded]: Start isIncluded. First operand has 250 states, 146 states have (on average 1.1986301369863013) internal successors, (175), 153 states have internal predecessors, (175), 89 states have call successors, (89), 15 states have call predecessors, (89), 14 states have return successors, (87), 81 states have call predecessors, (87), 87 states have call successors, (87) Second operand 326 states. [2022-04-27 13:15:45,595 INFO L87 Difference]: Start difference. First operand has 250 states, 146 states have (on average 1.1986301369863013) internal successors, (175), 153 states have internal predecessors, (175), 89 states have call successors, (89), 15 states have call predecessors, (89), 14 states have return successors, (87), 81 states have call predecessors, (87), 87 states have call successors, (87) Second operand 326 states. [2022-04-27 13:15:45,608 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:15:45,608 INFO L93 Difference]: Finished difference Result 326 states and 478 transitions. [2022-04-27 13:15:45,608 INFO L276 IsEmpty]: Start isEmpty. Operand 326 states and 478 transitions. [2022-04-27 13:15:45,610 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 13:15:45,610 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 13:15:45,610 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 13:15:45,610 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 13:15:45,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 250 states, 146 states have (on average 1.1986301369863013) internal successors, (175), 153 states have internal predecessors, (175), 89 states have call successors, (89), 15 states have call predecessors, (89), 14 states have return successors, (87), 81 states have call predecessors, (87), 87 states have call successors, (87) [2022-04-27 13:15:45,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 250 states and 351 transitions. [2022-04-27 13:15:45,618 INFO L78 Accepts]: Start accepts. Automaton has 250 states and 351 transitions. Word has length 64 [2022-04-27 13:15:45,618 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 13:15:45,619 INFO L495 AbstractCegarLoop]: Abstraction has 250 states and 351 transitions. [2022-04-27 13:15:45,619 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 14 states have (on average 2.7857142857142856) internal successors, (39), 15 states have internal predecessors, (39), 5 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) [2022-04-27 13:15:45,619 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 351 transitions. [2022-04-27 13:15:45,619 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2022-04-27 13:15:45,619 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 13:15:45,620 INFO L195 NwaCegarLoop]: trace histogram [8, 7, 7, 4, 4, 4, 2, 2, 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, 1, 1, 1] [2022-04-27 13:15:45,636 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2022-04-27 13:15:45,825 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 13:15:45,825 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 13:15:45,826 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 13:15:45,826 INFO L85 PathProgramCache]: Analyzing trace with hash -298771846, now seen corresponding path program 1 times [2022-04-27 13:15:45,826 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 13:15:45,826 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [425630443] [2022-04-27 13:15:45,826 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 13:15:45,826 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 13:15:45,843 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 13:15:45,843 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [684011572] [2022-04-27 13:15:45,843 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 13:15:45,843 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 13:15:45,843 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 13:15:45,844 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-27 13:15:45,845 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-04-27 13:15:45,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 13:15:45,890 INFO L263 TraceCheckSpWp]: Trace formula consists of 186 conjuncts, 11 conjunts are in the unsatisfiable core [2022-04-27 13:15:45,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 13:15:45,902 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 13:15:46,096 INFO L272 TraceCheckUtils]: 0: Hoare triple {9463#true} call ULTIMATE.init(); {9463#true} is VALID [2022-04-27 13:15:46,096 INFO L290 TraceCheckUtils]: 1: Hoare triple {9463#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(11, 2);call #Ultimate.allocInit(12, 3); {9463#true} is VALID [2022-04-27 13:15:46,096 INFO L290 TraceCheckUtils]: 2: Hoare triple {9463#true} assume true; {9463#true} is VALID [2022-04-27 13:15:46,096 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {9463#true} {9463#true} #112#return; {9463#true} is VALID [2022-04-27 13:15:46,096 INFO L272 TraceCheckUtils]: 4: Hoare triple {9463#true} call #t~ret6 := main(); {9463#true} is VALID [2022-04-27 13:15:46,096 INFO L290 TraceCheckUtils]: 5: Hoare triple {9463#true} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~s~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4; {9463#true} is VALID [2022-04-27 13:15:46,096 INFO L272 TraceCheckUtils]: 6: Hoare triple {9463#true} call assume_abort_if_not((if ~x~0 >= 0 && ~x~0 <= 50 then 1 else 0)); {9463#true} is VALID [2022-04-27 13:15:46,096 INFO L290 TraceCheckUtils]: 7: Hoare triple {9463#true} ~cond := #in~cond; {9463#true} is VALID [2022-04-27 13:15:46,096 INFO L290 TraceCheckUtils]: 8: Hoare triple {9463#true} assume !(0 == ~cond); {9463#true} is VALID [2022-04-27 13:15:46,097 INFO L290 TraceCheckUtils]: 9: Hoare triple {9463#true} assume true; {9463#true} is VALID [2022-04-27 13:15:46,097 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {9463#true} {9463#true} #94#return; {9463#true} is VALID [2022-04-27 13:15:46,097 INFO L290 TraceCheckUtils]: 11: Hoare triple {9463#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {9463#true} is VALID [2022-04-27 13:15:46,097 INFO L272 TraceCheckUtils]: 12: Hoare triple {9463#true} call assume_abort_if_not((if ~y~0 >= 0 && ~y~0 <= 50 then 1 else 0)); {9463#true} is VALID [2022-04-27 13:15:46,097 INFO L290 TraceCheckUtils]: 13: Hoare triple {9463#true} ~cond := #in~cond; {9463#true} is VALID [2022-04-27 13:15:46,097 INFO L290 TraceCheckUtils]: 14: Hoare triple {9463#true} assume !(0 == ~cond); {9463#true} is VALID [2022-04-27 13:15:46,097 INFO L290 TraceCheckUtils]: 15: Hoare triple {9463#true} assume true; {9463#true} is VALID [2022-04-27 13:15:46,097 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {9463#true} {9463#true} #96#return; {9463#true} is VALID [2022-04-27 13:15:46,097 INFO L272 TraceCheckUtils]: 17: Hoare triple {9463#true} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {9463#true} is VALID [2022-04-27 13:15:46,097 INFO L290 TraceCheckUtils]: 18: Hoare triple {9463#true} ~cond := #in~cond; {9463#true} is VALID [2022-04-27 13:15:46,097 INFO L290 TraceCheckUtils]: 19: Hoare triple {9463#true} assume !(0 == ~cond); {9463#true} is VALID [2022-04-27 13:15:46,097 INFO L290 TraceCheckUtils]: 20: Hoare triple {9463#true} assume true; {9463#true} is VALID [2022-04-27 13:15:46,097 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {9463#true} {9463#true} #98#return; {9463#true} is VALID [2022-04-27 13:15:46,097 INFO L272 TraceCheckUtils]: 22: Hoare triple {9463#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {9463#true} is VALID [2022-04-27 13:15:46,097 INFO L290 TraceCheckUtils]: 23: Hoare triple {9463#true} ~cond := #in~cond; {9463#true} is VALID [2022-04-27 13:15:46,097 INFO L290 TraceCheckUtils]: 24: Hoare triple {9463#true} assume !(0 == ~cond); {9463#true} is VALID [2022-04-27 13:15:46,098 INFO L290 TraceCheckUtils]: 25: Hoare triple {9463#true} assume true; {9463#true} is VALID [2022-04-27 13:15:46,098 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {9463#true} {9463#true} #100#return; {9463#true} is VALID [2022-04-27 13:15:46,098 INFO L290 TraceCheckUtils]: 27: Hoare triple {9463#true} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1; {9463#true} is VALID [2022-04-27 13:15:46,098 INFO L290 TraceCheckUtils]: 28: Hoare triple {9463#true} assume !false; {9463#true} is VALID [2022-04-27 13:15:46,098 INFO L290 TraceCheckUtils]: 29: Hoare triple {9463#true} assume !!(0 != ~b~0);havoc ~c~0;havoc ~k~0;~c~0 := ~a~0;~k~0 := 0; {9463#true} is VALID [2022-04-27 13:15:46,098 INFO L290 TraceCheckUtils]: 30: Hoare triple {9463#true} assume !false; {9463#true} is VALID [2022-04-27 13:15:46,098 INFO L290 TraceCheckUtils]: 31: Hoare triple {9463#true} assume !!(~c~0 >= ~b~0);havoc ~d~0;havoc ~v~0;~d~0 := 1;~v~0 := ~b~0; {9561#(and (= main_~b~0 main_~v~0) (= main_~d~0 1))} is VALID [2022-04-27 13:15:46,098 INFO L290 TraceCheckUtils]: 32: Hoare triple {9561#(and (= main_~b~0 main_~v~0) (= main_~d~0 1))} assume !false; {9561#(and (= main_~b~0 main_~v~0) (= main_~d~0 1))} is VALID [2022-04-27 13:15:46,099 INFO L272 TraceCheckUtils]: 33: Hoare triple {9561#(and (= main_~b~0 main_~v~0) (= main_~d~0 1))} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {9463#true} is VALID [2022-04-27 13:15:46,099 INFO L290 TraceCheckUtils]: 34: Hoare triple {9463#true} ~cond := #in~cond; {9463#true} is VALID [2022-04-27 13:15:46,099 INFO L290 TraceCheckUtils]: 35: Hoare triple {9463#true} assume !(0 == ~cond); {9463#true} is VALID [2022-04-27 13:15:46,099 INFO L290 TraceCheckUtils]: 36: Hoare triple {9463#true} assume true; {9463#true} is VALID [2022-04-27 13:15:46,099 INFO L284 TraceCheckUtils]: 37: Hoare quadruple {9463#true} {9561#(and (= main_~b~0 main_~v~0) (= main_~d~0 1))} #102#return; {9561#(and (= main_~b~0 main_~v~0) (= main_~d~0 1))} is VALID [2022-04-27 13:15:46,100 INFO L272 TraceCheckUtils]: 38: Hoare triple {9561#(and (= main_~b~0 main_~v~0) (= main_~d~0 1))} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {9463#true} is VALID [2022-04-27 13:15:46,100 INFO L290 TraceCheckUtils]: 39: Hoare triple {9463#true} ~cond := #in~cond; {9463#true} is VALID [2022-04-27 13:15:46,100 INFO L290 TraceCheckUtils]: 40: Hoare triple {9463#true} assume !(0 == ~cond); {9463#true} is VALID [2022-04-27 13:15:46,100 INFO L290 TraceCheckUtils]: 41: Hoare triple {9463#true} assume true; {9463#true} is VALID [2022-04-27 13:15:46,100 INFO L284 TraceCheckUtils]: 42: Hoare quadruple {9463#true} {9561#(and (= main_~b~0 main_~v~0) (= main_~d~0 1))} #104#return; {9561#(and (= main_~b~0 main_~v~0) (= main_~d~0 1))} is VALID [2022-04-27 13:15:46,100 INFO L272 TraceCheckUtils]: 43: Hoare triple {9561#(and (= main_~b~0 main_~v~0) (= main_~d~0 1))} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {9463#true} is VALID [2022-04-27 13:15:46,100 INFO L290 TraceCheckUtils]: 44: Hoare triple {9463#true} ~cond := #in~cond; {9463#true} is VALID [2022-04-27 13:15:46,100 INFO L290 TraceCheckUtils]: 45: Hoare triple {9463#true} assume !(0 == ~cond); {9463#true} is VALID [2022-04-27 13:15:46,101 INFO L290 TraceCheckUtils]: 46: Hoare triple {9463#true} assume true; {9463#true} is VALID [2022-04-27 13:15:46,101 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {9463#true} {9561#(and (= main_~b~0 main_~v~0) (= main_~d~0 1))} #106#return; {9561#(and (= main_~b~0 main_~v~0) (= main_~d~0 1))} is VALID [2022-04-27 13:15:46,101 INFO L272 TraceCheckUtils]: 48: Hoare triple {9561#(and (= main_~b~0 main_~v~0) (= main_~d~0 1))} call __VERIFIER_assert((if ~v~0 == ~b~0 * ~d~0 then 1 else 0)); {9463#true} is VALID [2022-04-27 13:15:46,101 INFO L290 TraceCheckUtils]: 49: Hoare triple {9463#true} ~cond := #in~cond; {9463#true} is VALID [2022-04-27 13:15:46,101 INFO L290 TraceCheckUtils]: 50: Hoare triple {9463#true} assume !(0 == ~cond); {9463#true} is VALID [2022-04-27 13:15:46,101 INFO L290 TraceCheckUtils]: 51: Hoare triple {9463#true} assume true; {9463#true} is VALID [2022-04-27 13:15:46,102 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {9463#true} {9561#(and (= main_~b~0 main_~v~0) (= main_~d~0 1))} #108#return; {9561#(and (= main_~b~0 main_~v~0) (= main_~d~0 1))} is VALID [2022-04-27 13:15:46,102 INFO L290 TraceCheckUtils]: 53: Hoare triple {9561#(and (= main_~b~0 main_~v~0) (= main_~d~0 1))} assume !!(~c~0 >= 2 * ~v~0);~d~0 := 2 * ~d~0;~v~0 := 2 * ~v~0; {9628#(and (= main_~v~0 (* main_~b~0 2)) (= main_~d~0 2))} is VALID [2022-04-27 13:15:46,103 INFO L290 TraceCheckUtils]: 54: Hoare triple {9628#(and (= main_~v~0 (* main_~b~0 2)) (= main_~d~0 2))} assume !false; {9628#(and (= main_~v~0 (* main_~b~0 2)) (= main_~d~0 2))} is VALID [2022-04-27 13:15:46,103 INFO L272 TraceCheckUtils]: 55: Hoare triple {9628#(and (= main_~v~0 (* main_~b~0 2)) (= main_~d~0 2))} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {9463#true} is VALID [2022-04-27 13:15:46,103 INFO L290 TraceCheckUtils]: 56: Hoare triple {9463#true} ~cond := #in~cond; {9463#true} is VALID [2022-04-27 13:15:46,103 INFO L290 TraceCheckUtils]: 57: Hoare triple {9463#true} assume !(0 == ~cond); {9463#true} is VALID [2022-04-27 13:15:46,103 INFO L290 TraceCheckUtils]: 58: Hoare triple {9463#true} assume true; {9463#true} is VALID [2022-04-27 13:15:46,112 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {9463#true} {9628#(and (= main_~v~0 (* main_~b~0 2)) (= main_~d~0 2))} #102#return; {9628#(and (= main_~v~0 (* main_~b~0 2)) (= main_~d~0 2))} is VALID [2022-04-27 13:15:46,112 INFO L272 TraceCheckUtils]: 60: Hoare triple {9628#(and (= main_~v~0 (* main_~b~0 2)) (= main_~d~0 2))} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {9463#true} is VALID [2022-04-27 13:15:46,112 INFO L290 TraceCheckUtils]: 61: Hoare triple {9463#true} ~cond := #in~cond; {9463#true} is VALID [2022-04-27 13:15:46,112 INFO L290 TraceCheckUtils]: 62: Hoare triple {9463#true} assume !(0 == ~cond); {9463#true} is VALID [2022-04-27 13:15:46,112 INFO L290 TraceCheckUtils]: 63: Hoare triple {9463#true} assume true; {9463#true} is VALID [2022-04-27 13:15:46,113 INFO L284 TraceCheckUtils]: 64: Hoare quadruple {9463#true} {9628#(and (= main_~v~0 (* main_~b~0 2)) (= main_~d~0 2))} #104#return; {9628#(and (= main_~v~0 (* main_~b~0 2)) (= main_~d~0 2))} is VALID [2022-04-27 13:15:46,113 INFO L272 TraceCheckUtils]: 65: Hoare triple {9628#(and (= main_~v~0 (* main_~b~0 2)) (= main_~d~0 2))} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {9463#true} is VALID [2022-04-27 13:15:46,113 INFO L290 TraceCheckUtils]: 66: Hoare triple {9463#true} ~cond := #in~cond; {9463#true} is VALID [2022-04-27 13:15:46,113 INFO L290 TraceCheckUtils]: 67: Hoare triple {9463#true} assume !(0 == ~cond); {9463#true} is VALID [2022-04-27 13:15:46,113 INFO L290 TraceCheckUtils]: 68: Hoare triple {9463#true} assume true; {9463#true} is VALID [2022-04-27 13:15:46,114 INFO L284 TraceCheckUtils]: 69: Hoare quadruple {9463#true} {9628#(and (= main_~v~0 (* main_~b~0 2)) (= main_~d~0 2))} #106#return; {9628#(and (= main_~v~0 (* main_~b~0 2)) (= main_~d~0 2))} is VALID [2022-04-27 13:15:46,115 INFO L272 TraceCheckUtils]: 70: Hoare triple {9628#(and (= main_~v~0 (* main_~b~0 2)) (= main_~d~0 2))} call __VERIFIER_assert((if ~v~0 == ~b~0 * ~d~0 then 1 else 0)); {9680#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 13:15:46,115 INFO L290 TraceCheckUtils]: 71: Hoare triple {9680#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {9684#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 13:15:46,115 INFO L290 TraceCheckUtils]: 72: Hoare triple {9684#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {9464#false} is VALID [2022-04-27 13:15:46,116 INFO L290 TraceCheckUtils]: 73: Hoare triple {9464#false} assume !false; {9464#false} is VALID [2022-04-27 13:15:46,116 INFO L134 CoverageAnalysis]: Checked inductivity of 127 backedges. 14 proven. 5 refuted. 0 times theorem prover too weak. 108 trivial. 0 not checked. [2022-04-27 13:15:46,116 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 13:15:46,395 INFO L290 TraceCheckUtils]: 73: Hoare triple {9464#false} assume !false; {9464#false} is VALID [2022-04-27 13:15:46,395 INFO L290 TraceCheckUtils]: 72: Hoare triple {9684#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {9464#false} is VALID [2022-04-27 13:15:46,396 INFO L290 TraceCheckUtils]: 71: Hoare triple {9680#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {9684#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 13:15:46,396 INFO L272 TraceCheckUtils]: 70: Hoare triple {9700#(= main_~v~0 (* main_~d~0 main_~b~0))} call __VERIFIER_assert((if ~v~0 == ~b~0 * ~d~0 then 1 else 0)); {9680#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 13:15:46,397 INFO L284 TraceCheckUtils]: 69: Hoare quadruple {9463#true} {9700#(= main_~v~0 (* main_~d~0 main_~b~0))} #106#return; {9700#(= main_~v~0 (* main_~d~0 main_~b~0))} is VALID [2022-04-27 13:15:46,397 INFO L290 TraceCheckUtils]: 68: Hoare triple {9463#true} assume true; {9463#true} is VALID [2022-04-27 13:15:46,397 INFO L290 TraceCheckUtils]: 67: Hoare triple {9463#true} assume !(0 == ~cond); {9463#true} is VALID [2022-04-27 13:15:46,397 INFO L290 TraceCheckUtils]: 66: Hoare triple {9463#true} ~cond := #in~cond; {9463#true} is VALID [2022-04-27 13:15:46,397 INFO L272 TraceCheckUtils]: 65: Hoare triple {9700#(= main_~v~0 (* main_~d~0 main_~b~0))} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {9463#true} is VALID [2022-04-27 13:15:46,398 INFO L284 TraceCheckUtils]: 64: Hoare quadruple {9463#true} {9700#(= main_~v~0 (* main_~d~0 main_~b~0))} #104#return; {9700#(= main_~v~0 (* main_~d~0 main_~b~0))} is VALID [2022-04-27 13:15:46,398 INFO L290 TraceCheckUtils]: 63: Hoare triple {9463#true} assume true; {9463#true} is VALID [2022-04-27 13:15:46,398 INFO L290 TraceCheckUtils]: 62: Hoare triple {9463#true} assume !(0 == ~cond); {9463#true} is VALID [2022-04-27 13:15:46,398 INFO L290 TraceCheckUtils]: 61: Hoare triple {9463#true} ~cond := #in~cond; {9463#true} is VALID [2022-04-27 13:15:46,398 INFO L272 TraceCheckUtils]: 60: Hoare triple {9700#(= main_~v~0 (* main_~d~0 main_~b~0))} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {9463#true} is VALID [2022-04-27 13:15:46,399 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {9463#true} {9700#(= main_~v~0 (* main_~d~0 main_~b~0))} #102#return; {9700#(= main_~v~0 (* main_~d~0 main_~b~0))} is VALID [2022-04-27 13:15:46,399 INFO L290 TraceCheckUtils]: 58: Hoare triple {9463#true} assume true; {9463#true} is VALID [2022-04-27 13:15:46,399 INFO L290 TraceCheckUtils]: 57: Hoare triple {9463#true} assume !(0 == ~cond); {9463#true} is VALID [2022-04-27 13:15:46,399 INFO L290 TraceCheckUtils]: 56: Hoare triple {9463#true} ~cond := #in~cond; {9463#true} is VALID [2022-04-27 13:15:46,400 INFO L272 TraceCheckUtils]: 55: Hoare triple {9700#(= main_~v~0 (* main_~d~0 main_~b~0))} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {9463#true} is VALID [2022-04-27 13:15:46,400 INFO L290 TraceCheckUtils]: 54: Hoare triple {9700#(= main_~v~0 (* main_~d~0 main_~b~0))} assume !false; {9700#(= main_~v~0 (* main_~d~0 main_~b~0))} is VALID [2022-04-27 13:15:46,402 INFO L290 TraceCheckUtils]: 53: Hoare triple {9700#(= main_~v~0 (* main_~d~0 main_~b~0))} assume !!(~c~0 >= 2 * ~v~0);~d~0 := 2 * ~d~0;~v~0 := 2 * ~v~0; {9700#(= main_~v~0 (* main_~d~0 main_~b~0))} is VALID [2022-04-27 13:15:46,402 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {9463#true} {9700#(= main_~v~0 (* main_~d~0 main_~b~0))} #108#return; {9700#(= main_~v~0 (* main_~d~0 main_~b~0))} is VALID [2022-04-27 13:15:46,402 INFO L290 TraceCheckUtils]: 51: Hoare triple {9463#true} assume true; {9463#true} is VALID [2022-04-27 13:15:46,402 INFO L290 TraceCheckUtils]: 50: Hoare triple {9463#true} assume !(0 == ~cond); {9463#true} is VALID [2022-04-27 13:15:46,402 INFO L290 TraceCheckUtils]: 49: Hoare triple {9463#true} ~cond := #in~cond; {9463#true} is VALID [2022-04-27 13:15:46,402 INFO L272 TraceCheckUtils]: 48: Hoare triple {9700#(= main_~v~0 (* main_~d~0 main_~b~0))} call __VERIFIER_assert((if ~v~0 == ~b~0 * ~d~0 then 1 else 0)); {9463#true} is VALID [2022-04-27 13:15:46,403 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {9463#true} {9700#(= main_~v~0 (* main_~d~0 main_~b~0))} #106#return; {9700#(= main_~v~0 (* main_~d~0 main_~b~0))} is VALID [2022-04-27 13:15:46,403 INFO L290 TraceCheckUtils]: 46: Hoare triple {9463#true} assume true; {9463#true} is VALID [2022-04-27 13:15:46,403 INFO L290 TraceCheckUtils]: 45: Hoare triple {9463#true} assume !(0 == ~cond); {9463#true} is VALID [2022-04-27 13:15:46,403 INFO L290 TraceCheckUtils]: 44: Hoare triple {9463#true} ~cond := #in~cond; {9463#true} is VALID [2022-04-27 13:15:46,403 INFO L272 TraceCheckUtils]: 43: Hoare triple {9700#(= main_~v~0 (* main_~d~0 main_~b~0))} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {9463#true} is VALID [2022-04-27 13:15:46,404 INFO L284 TraceCheckUtils]: 42: Hoare quadruple {9463#true} {9700#(= main_~v~0 (* main_~d~0 main_~b~0))} #104#return; {9700#(= main_~v~0 (* main_~d~0 main_~b~0))} is VALID [2022-04-27 13:15:46,404 INFO L290 TraceCheckUtils]: 41: Hoare triple {9463#true} assume true; {9463#true} is VALID [2022-04-27 13:15:46,404 INFO L290 TraceCheckUtils]: 40: Hoare triple {9463#true} assume !(0 == ~cond); {9463#true} is VALID [2022-04-27 13:15:46,404 INFO L290 TraceCheckUtils]: 39: Hoare triple {9463#true} ~cond := #in~cond; {9463#true} is VALID [2022-04-27 13:15:46,404 INFO L272 TraceCheckUtils]: 38: Hoare triple {9700#(= main_~v~0 (* main_~d~0 main_~b~0))} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {9463#true} is VALID [2022-04-27 13:15:46,405 INFO L284 TraceCheckUtils]: 37: Hoare quadruple {9463#true} {9700#(= main_~v~0 (* main_~d~0 main_~b~0))} #102#return; {9700#(= main_~v~0 (* main_~d~0 main_~b~0))} is VALID [2022-04-27 13:15:46,405 INFO L290 TraceCheckUtils]: 36: Hoare triple {9463#true} assume true; {9463#true} is VALID [2022-04-27 13:15:46,405 INFO L290 TraceCheckUtils]: 35: Hoare triple {9463#true} assume !(0 == ~cond); {9463#true} is VALID [2022-04-27 13:15:46,405 INFO L290 TraceCheckUtils]: 34: Hoare triple {9463#true} ~cond := #in~cond; {9463#true} is VALID [2022-04-27 13:15:46,405 INFO L272 TraceCheckUtils]: 33: Hoare triple {9700#(= main_~v~0 (* main_~d~0 main_~b~0))} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {9463#true} is VALID [2022-04-27 13:15:46,405 INFO L290 TraceCheckUtils]: 32: Hoare triple {9700#(= main_~v~0 (* main_~d~0 main_~b~0))} assume !false; {9700#(= main_~v~0 (* main_~d~0 main_~b~0))} is VALID [2022-04-27 13:15:46,406 INFO L290 TraceCheckUtils]: 31: Hoare triple {9463#true} assume !!(~c~0 >= ~b~0);havoc ~d~0;havoc ~v~0;~d~0 := 1;~v~0 := ~b~0; {9700#(= main_~v~0 (* main_~d~0 main_~b~0))} is VALID [2022-04-27 13:15:46,406 INFO L290 TraceCheckUtils]: 30: Hoare triple {9463#true} assume !false; {9463#true} is VALID [2022-04-27 13:15:46,406 INFO L290 TraceCheckUtils]: 29: Hoare triple {9463#true} assume !!(0 != ~b~0);havoc ~c~0;havoc ~k~0;~c~0 := ~a~0;~k~0 := 0; {9463#true} is VALID [2022-04-27 13:15:46,406 INFO L290 TraceCheckUtils]: 28: Hoare triple {9463#true} assume !false; {9463#true} is VALID [2022-04-27 13:15:46,406 INFO L290 TraceCheckUtils]: 27: Hoare triple {9463#true} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1; {9463#true} is VALID [2022-04-27 13:15:46,406 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {9463#true} {9463#true} #100#return; {9463#true} is VALID [2022-04-27 13:15:46,406 INFO L290 TraceCheckUtils]: 25: Hoare triple {9463#true} assume true; {9463#true} is VALID [2022-04-27 13:15:46,406 INFO L290 TraceCheckUtils]: 24: Hoare triple {9463#true} assume !(0 == ~cond); {9463#true} is VALID [2022-04-27 13:15:46,406 INFO L290 TraceCheckUtils]: 23: Hoare triple {9463#true} ~cond := #in~cond; {9463#true} is VALID [2022-04-27 13:15:46,406 INFO L272 TraceCheckUtils]: 22: Hoare triple {9463#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {9463#true} is VALID [2022-04-27 13:15:46,406 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {9463#true} {9463#true} #98#return; {9463#true} is VALID [2022-04-27 13:15:46,406 INFO L290 TraceCheckUtils]: 20: Hoare triple {9463#true} assume true; {9463#true} is VALID [2022-04-27 13:15:46,406 INFO L290 TraceCheckUtils]: 19: Hoare triple {9463#true} assume !(0 == ~cond); {9463#true} is VALID [2022-04-27 13:15:46,406 INFO L290 TraceCheckUtils]: 18: Hoare triple {9463#true} ~cond := #in~cond; {9463#true} is VALID [2022-04-27 13:15:46,407 INFO L272 TraceCheckUtils]: 17: Hoare triple {9463#true} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {9463#true} is VALID [2022-04-27 13:15:46,407 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {9463#true} {9463#true} #96#return; {9463#true} is VALID [2022-04-27 13:15:46,407 INFO L290 TraceCheckUtils]: 15: Hoare triple {9463#true} assume true; {9463#true} is VALID [2022-04-27 13:15:46,407 INFO L290 TraceCheckUtils]: 14: Hoare triple {9463#true} assume !(0 == ~cond); {9463#true} is VALID [2022-04-27 13:15:46,408 INFO L290 TraceCheckUtils]: 13: Hoare triple {9463#true} ~cond := #in~cond; {9463#true} is VALID [2022-04-27 13:15:46,409 INFO L272 TraceCheckUtils]: 12: Hoare triple {9463#true} call assume_abort_if_not((if ~y~0 >= 0 && ~y~0 <= 50 then 1 else 0)); {9463#true} is VALID [2022-04-27 13:15:46,409 INFO L290 TraceCheckUtils]: 11: Hoare triple {9463#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {9463#true} is VALID [2022-04-27 13:15:46,409 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {9463#true} {9463#true} #94#return; {9463#true} is VALID [2022-04-27 13:15:46,410 INFO L290 TraceCheckUtils]: 9: Hoare triple {9463#true} assume true; {9463#true} is VALID [2022-04-27 13:15:46,410 INFO L290 TraceCheckUtils]: 8: Hoare triple {9463#true} assume !(0 == ~cond); {9463#true} is VALID [2022-04-27 13:15:46,410 INFO L290 TraceCheckUtils]: 7: Hoare triple {9463#true} ~cond := #in~cond; {9463#true} is VALID [2022-04-27 13:15:46,410 INFO L272 TraceCheckUtils]: 6: Hoare triple {9463#true} call assume_abort_if_not((if ~x~0 >= 0 && ~x~0 <= 50 then 1 else 0)); {9463#true} is VALID [2022-04-27 13:15:46,410 INFO L290 TraceCheckUtils]: 5: Hoare triple {9463#true} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~s~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4; {9463#true} is VALID [2022-04-27 13:15:46,410 INFO L272 TraceCheckUtils]: 4: Hoare triple {9463#true} call #t~ret6 := main(); {9463#true} is VALID [2022-04-27 13:15:46,410 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {9463#true} {9463#true} #112#return; {9463#true} is VALID [2022-04-27 13:15:46,410 INFO L290 TraceCheckUtils]: 2: Hoare triple {9463#true} assume true; {9463#true} is VALID [2022-04-27 13:15:46,410 INFO L290 TraceCheckUtils]: 1: Hoare triple {9463#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(11, 2);call #Ultimate.allocInit(12, 3); {9463#true} is VALID [2022-04-27 13:15:46,410 INFO L272 TraceCheckUtils]: 0: Hoare triple {9463#true} call ULTIMATE.init(); {9463#true} is VALID [2022-04-27 13:15:46,411 INFO L134 CoverageAnalysis]: Checked inductivity of 127 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 113 trivial. 0 not checked. [2022-04-27 13:15:46,411 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 13:15:46,411 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [425630443] [2022-04-27 13:15:46,411 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 13:15:46,411 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [684011572] [2022-04-27 13:15:46,411 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [684011572] provided 1 perfect and 1 imperfect interpolant sequences [2022-04-27 13:15:46,411 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-04-27 13:15:46,411 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 7 [2022-04-27 13:15:46,411 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [669956306] [2022-04-27 13:15:46,412 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 13:15:46,412 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.0) internal successors, (20), 4 states have internal predecessors, (20), 2 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) Word has length 74 [2022-04-27 13:15:46,412 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 13:15:46,412 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 4.0) internal successors, (20), 4 states have internal predecessors, (20), 2 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2022-04-27 13:15:46,443 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 40 edges. 40 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 13:15:46,444 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-27 13:15:46,444 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 13:15:46,444 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-27 13:15:46,444 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-04-27 13:15:46,444 INFO L87 Difference]: Start difference. First operand 250 states and 351 transitions. Second operand has 5 states, 5 states have (on average 4.0) internal successors, (20), 4 states have internal predecessors, (20), 2 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2022-04-27 13:15:47,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:15:47,193 INFO L93 Difference]: Finished difference Result 256 states and 356 transitions. [2022-04-27 13:15:47,193 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-27 13:15:47,194 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.0) internal successors, (20), 4 states have internal predecessors, (20), 2 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) Word has length 74 [2022-04-27 13:15:47,194 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 13:15:47,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 4.0) internal successors, (20), 4 states have internal predecessors, (20), 2 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2022-04-27 13:15:47,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 53 transitions. [2022-04-27 13:15:47,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 4.0) internal successors, (20), 4 states have internal predecessors, (20), 2 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2022-04-27 13:15:47,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 53 transitions. [2022-04-27 13:15:47,196 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 53 transitions. [2022-04-27 13:15:47,245 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 53 edges. 53 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 13:15:47,251 INFO L225 Difference]: With dead ends: 256 [2022-04-27 13:15:47,253 INFO L226 Difference]: Without dead ends: 254 [2022-04-27 13:15:47,253 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 148 GetRequests, 140 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-04-27 13:15:47,254 INFO L413 NwaCegarLoop]: 42 mSDtfsCounter, 9 mSDsluCounter, 97 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 139 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 13:15:47,255 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 139 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 13:15:47,255 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 254 states. [2022-04-27 13:15:47,875 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 254 to 254. [2022-04-27 13:15:47,875 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 13:15:47,875 INFO L82 GeneralOperation]: Start isEquivalent. First operand 254 states. Second operand has 254 states, 149 states have (on average 1.1946308724832215) internal successors, (178), 156 states have internal predecessors, (178), 89 states have call successors, (89), 16 states have call predecessors, (89), 15 states have return successors, (87), 81 states have call predecessors, (87), 87 states have call successors, (87) [2022-04-27 13:15:47,876 INFO L74 IsIncluded]: Start isIncluded. First operand 254 states. Second operand has 254 states, 149 states have (on average 1.1946308724832215) internal successors, (178), 156 states have internal predecessors, (178), 89 states have call successors, (89), 16 states have call predecessors, (89), 15 states have return successors, (87), 81 states have call predecessors, (87), 87 states have call successors, (87) [2022-04-27 13:15:47,883 INFO L87 Difference]: Start difference. First operand 254 states. Second operand has 254 states, 149 states have (on average 1.1946308724832215) internal successors, (178), 156 states have internal predecessors, (178), 89 states have call successors, (89), 16 states have call predecessors, (89), 15 states have return successors, (87), 81 states have call predecessors, (87), 87 states have call successors, (87) [2022-04-27 13:15:47,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:15:47,891 INFO L93 Difference]: Finished difference Result 254 states and 354 transitions. [2022-04-27 13:15:47,891 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states and 354 transitions. [2022-04-27 13:15:47,892 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 13:15:47,892 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 13:15:47,892 INFO L74 IsIncluded]: Start isIncluded. First operand has 254 states, 149 states have (on average 1.1946308724832215) internal successors, (178), 156 states have internal predecessors, (178), 89 states have call successors, (89), 16 states have call predecessors, (89), 15 states have return successors, (87), 81 states have call predecessors, (87), 87 states have call successors, (87) Second operand 254 states. [2022-04-27 13:15:47,893 INFO L87 Difference]: Start difference. First operand has 254 states, 149 states have (on average 1.1946308724832215) internal successors, (178), 156 states have internal predecessors, (178), 89 states have call successors, (89), 16 states have call predecessors, (89), 15 states have return successors, (87), 81 states have call predecessors, (87), 87 states have call successors, (87) Second operand 254 states. [2022-04-27 13:15:47,900 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:15:47,900 INFO L93 Difference]: Finished difference Result 254 states and 354 transitions. [2022-04-27 13:15:47,900 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states and 354 transitions. [2022-04-27 13:15:47,901 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 13:15:47,901 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 13:15:47,901 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 13:15:47,901 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 13:15:47,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 254 states, 149 states have (on average 1.1946308724832215) internal successors, (178), 156 states have internal predecessors, (178), 89 states have call successors, (89), 16 states have call predecessors, (89), 15 states have return successors, (87), 81 states have call predecessors, (87), 87 states have call successors, (87) [2022-04-27 13:15:47,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 254 states to 254 states and 354 transitions. [2022-04-27 13:15:47,910 INFO L78 Accepts]: Start accepts. Automaton has 254 states and 354 transitions. Word has length 74 [2022-04-27 13:15:47,910 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 13:15:47,910 INFO L495 AbstractCegarLoop]: Abstraction has 254 states and 354 transitions. [2022-04-27 13:15:47,910 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.0) internal successors, (20), 4 states have internal predecessors, (20), 2 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2022-04-27 13:15:47,910 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states and 354 transitions. [2022-04-27 13:15:47,911 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2022-04-27 13:15:47,911 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 13:15:47,911 INFO L195 NwaCegarLoop]: trace histogram [5, 4, 4, 4, 4, 4, 4, 3, 3, 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, 1, 1, 1, 1, 1, 1] [2022-04-27 13:15:47,934 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2022-04-27 13:15:48,127 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2022-04-27 13:15:48,127 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 13:15:48,128 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 13:15:48,128 INFO L85 PathProgramCache]: Analyzing trace with hash -2089538094, now seen corresponding path program 1 times [2022-04-27 13:15:48,128 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 13:15:48,128 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2029502506] [2022-04-27 13:15:48,128 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 13:15:48,128 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 13:15:48,145 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 13:15:48,145 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [253486453] [2022-04-27 13:15:48,145 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 13:15:48,145 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 13:15:48,145 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 13:15:48,150 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-27 13:15:48,171 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2022-04-27 13:15:48,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 13:15:48,208 INFO L263 TraceCheckSpWp]: Trace formula consists of 209 conjuncts, 38 conjunts are in the unsatisfiable core [2022-04-27 13:15:48,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 13:15:48,224 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 13:15:52,674 INFO L272 TraceCheckUtils]: 0: Hoare triple {11233#true} call ULTIMATE.init(); {11233#true} is VALID [2022-04-27 13:15:52,674 INFO L290 TraceCheckUtils]: 1: Hoare triple {11233#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(11, 2);call #Ultimate.allocInit(12, 3); {11233#true} is VALID [2022-04-27 13:15:52,674 INFO L290 TraceCheckUtils]: 2: Hoare triple {11233#true} assume true; {11233#true} is VALID [2022-04-27 13:15:52,674 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {11233#true} {11233#true} #112#return; {11233#true} is VALID [2022-04-27 13:15:52,674 INFO L272 TraceCheckUtils]: 4: Hoare triple {11233#true} call #t~ret6 := main(); {11233#true} is VALID [2022-04-27 13:15:52,674 INFO L290 TraceCheckUtils]: 5: Hoare triple {11233#true} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~s~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4; {11233#true} is VALID [2022-04-27 13:15:52,674 INFO L272 TraceCheckUtils]: 6: Hoare triple {11233#true} call assume_abort_if_not((if ~x~0 >= 0 && ~x~0 <= 50 then 1 else 0)); {11233#true} is VALID [2022-04-27 13:15:52,674 INFO L290 TraceCheckUtils]: 7: Hoare triple {11233#true} ~cond := #in~cond; {11233#true} is VALID [2022-04-27 13:15:52,674 INFO L290 TraceCheckUtils]: 8: Hoare triple {11233#true} assume !(0 == ~cond); {11233#true} is VALID [2022-04-27 13:15:52,674 INFO L290 TraceCheckUtils]: 9: Hoare triple {11233#true} assume true; {11233#true} is VALID [2022-04-27 13:15:52,674 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {11233#true} {11233#true} #94#return; {11233#true} is VALID [2022-04-27 13:15:52,674 INFO L290 TraceCheckUtils]: 11: Hoare triple {11233#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {11233#true} is VALID [2022-04-27 13:15:52,675 INFO L272 TraceCheckUtils]: 12: Hoare triple {11233#true} call assume_abort_if_not((if ~y~0 >= 0 && ~y~0 <= 50 then 1 else 0)); {11233#true} is VALID [2022-04-27 13:15:52,675 INFO L290 TraceCheckUtils]: 13: Hoare triple {11233#true} ~cond := #in~cond; {11233#true} is VALID [2022-04-27 13:15:52,675 INFO L290 TraceCheckUtils]: 14: Hoare triple {11233#true} assume !(0 == ~cond); {11233#true} is VALID [2022-04-27 13:15:52,675 INFO L290 TraceCheckUtils]: 15: Hoare triple {11233#true} assume true; {11233#true} is VALID [2022-04-27 13:15:52,675 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {11233#true} {11233#true} #96#return; {11233#true} is VALID [2022-04-27 13:15:52,675 INFO L272 TraceCheckUtils]: 17: Hoare triple {11233#true} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {11233#true} is VALID [2022-04-27 13:15:52,675 INFO L290 TraceCheckUtils]: 18: Hoare triple {11233#true} ~cond := #in~cond; {11233#true} is VALID [2022-04-27 13:15:52,675 INFO L290 TraceCheckUtils]: 19: Hoare triple {11233#true} assume !(0 == ~cond); {11233#true} is VALID [2022-04-27 13:15:52,675 INFO L290 TraceCheckUtils]: 20: Hoare triple {11233#true} assume true; {11233#true} is VALID [2022-04-27 13:15:52,675 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {11233#true} {11233#true} #98#return; {11233#true} is VALID [2022-04-27 13:15:52,675 INFO L272 TraceCheckUtils]: 22: Hoare triple {11233#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {11233#true} is VALID [2022-04-27 13:15:52,675 INFO L290 TraceCheckUtils]: 23: Hoare triple {11233#true} ~cond := #in~cond; {11233#true} is VALID [2022-04-27 13:15:52,675 INFO L290 TraceCheckUtils]: 24: Hoare triple {11233#true} assume !(0 == ~cond); {11233#true} is VALID [2022-04-27 13:15:52,675 INFO L290 TraceCheckUtils]: 25: Hoare triple {11233#true} assume true; {11233#true} is VALID [2022-04-27 13:15:52,675 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {11233#true} {11233#true} #100#return; {11233#true} is VALID [2022-04-27 13:15:52,676 INFO L290 TraceCheckUtils]: 27: Hoare triple {11233#true} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1; {11319#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-27 13:15:52,676 INFO L290 TraceCheckUtils]: 28: Hoare triple {11319#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} assume !false; {11319#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-27 13:15:52,677 INFO L290 TraceCheckUtils]: 29: Hoare triple {11319#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} assume !!(0 != ~b~0);havoc ~c~0;havoc ~k~0;~c~0 := ~a~0;~k~0 := 0; {11326#(and (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~q~0 0) (= main_~c~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-27 13:15:52,677 INFO L290 TraceCheckUtils]: 30: Hoare triple {11326#(and (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~q~0 0) (= main_~c~0 main_~x~0) (= main_~p~0 1))} assume !false; {11326#(and (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~q~0 0) (= main_~c~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-27 13:15:52,677 INFO L290 TraceCheckUtils]: 31: Hoare triple {11326#(and (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~q~0 0) (= main_~c~0 main_~x~0) (= main_~p~0 1))} assume !(~c~0 >= ~b~0); {11326#(and (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~q~0 0) (= main_~c~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-27 13:15:52,678 INFO L290 TraceCheckUtils]: 32: Hoare triple {11326#(and (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~q~0 0) (= main_~c~0 main_~x~0) (= main_~p~0 1))} ~a~0 := ~b~0;~b~0 := ~c~0;havoc ~temp~0;~temp~0 := ~p~0;~p~0 := ~q~0;~q~0 := ~temp~0 - ~q~0 * ~k~0;~temp~0 := ~r~0;~r~0 := ~s~0;~s~0 := ~temp~0 - ~s~0 * ~k~0; {11336#(and (= main_~s~0 0) (= main_~b~0 main_~x~0) (= main_~q~0 1))} is VALID [2022-04-27 13:15:52,678 INFO L290 TraceCheckUtils]: 33: Hoare triple {11336#(and (= main_~s~0 0) (= main_~b~0 main_~x~0) (= main_~q~0 1))} assume !false; {11336#(and (= main_~s~0 0) (= main_~b~0 main_~x~0) (= main_~q~0 1))} is VALID [2022-04-27 13:15:52,679 INFO L290 TraceCheckUtils]: 34: Hoare triple {11336#(and (= main_~s~0 0) (= main_~b~0 main_~x~0) (= main_~q~0 1))} assume !!(0 != ~b~0);havoc ~c~0;havoc ~k~0;~c~0 := ~a~0;~k~0 := 0; {11336#(and (= main_~s~0 0) (= main_~b~0 main_~x~0) (= main_~q~0 1))} is VALID [2022-04-27 13:15:52,679 INFO L290 TraceCheckUtils]: 35: Hoare triple {11336#(and (= main_~s~0 0) (= main_~b~0 main_~x~0) (= main_~q~0 1))} assume !false; {11336#(and (= main_~s~0 0) (= main_~b~0 main_~x~0) (= main_~q~0 1))} is VALID [2022-04-27 13:15:52,679 INFO L290 TraceCheckUtils]: 36: Hoare triple {11336#(and (= main_~s~0 0) (= main_~b~0 main_~x~0) (= main_~q~0 1))} assume !!(~c~0 >= ~b~0);havoc ~d~0;havoc ~v~0;~d~0 := 1;~v~0 := ~b~0; {11336#(and (= main_~s~0 0) (= main_~b~0 main_~x~0) (= main_~q~0 1))} is VALID [2022-04-27 13:15:52,680 INFO L290 TraceCheckUtils]: 37: Hoare triple {11336#(and (= main_~s~0 0) (= main_~b~0 main_~x~0) (= main_~q~0 1))} assume !false; {11336#(and (= main_~s~0 0) (= main_~b~0 main_~x~0) (= main_~q~0 1))} is VALID [2022-04-27 13:15:52,680 INFO L272 TraceCheckUtils]: 38: Hoare triple {11336#(and (= main_~s~0 0) (= main_~b~0 main_~x~0) (= main_~q~0 1))} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {11233#true} is VALID [2022-04-27 13:15:52,680 INFO L290 TraceCheckUtils]: 39: Hoare triple {11233#true} ~cond := #in~cond; {11233#true} is VALID [2022-04-27 13:15:52,680 INFO L290 TraceCheckUtils]: 40: Hoare triple {11233#true} assume !(0 == ~cond); {11233#true} is VALID [2022-04-27 13:15:52,680 INFO L290 TraceCheckUtils]: 41: Hoare triple {11233#true} assume true; {11233#true} is VALID [2022-04-27 13:15:52,681 INFO L284 TraceCheckUtils]: 42: Hoare quadruple {11233#true} {11336#(and (= main_~s~0 0) (= main_~b~0 main_~x~0) (= main_~q~0 1))} #102#return; {11336#(and (= main_~s~0 0) (= main_~b~0 main_~x~0) (= main_~q~0 1))} is VALID [2022-04-27 13:15:52,681 INFO L272 TraceCheckUtils]: 43: Hoare triple {11336#(and (= main_~s~0 0) (= main_~b~0 main_~x~0) (= main_~q~0 1))} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {11233#true} is VALID [2022-04-27 13:15:52,682 INFO L290 TraceCheckUtils]: 44: Hoare triple {11233#true} ~cond := #in~cond; {11373#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-27 13:15:52,682 INFO L290 TraceCheckUtils]: 45: Hoare triple {11373#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {11377#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 13:15:52,682 INFO L290 TraceCheckUtils]: 46: Hoare triple {11377#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {11377#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 13:15:52,683 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {11377#(not (= |__VERIFIER_assert_#in~cond| 0))} {11336#(and (= main_~s~0 0) (= main_~b~0 main_~x~0) (= main_~q~0 1))} #104#return; {11336#(and (= main_~s~0 0) (= main_~b~0 main_~x~0) (= main_~q~0 1))} is VALID [2022-04-27 13:15:52,683 INFO L272 TraceCheckUtils]: 48: Hoare triple {11336#(and (= main_~s~0 0) (= main_~b~0 main_~x~0) (= main_~q~0 1))} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {11233#true} is VALID [2022-04-27 13:15:52,683 INFO L290 TraceCheckUtils]: 49: Hoare triple {11233#true} ~cond := #in~cond; {11233#true} is VALID [2022-04-27 13:15:52,683 INFO L290 TraceCheckUtils]: 50: Hoare triple {11233#true} assume !(0 == ~cond); {11233#true} is VALID [2022-04-27 13:15:52,683 INFO L290 TraceCheckUtils]: 51: Hoare triple {11233#true} assume true; {11233#true} is VALID [2022-04-27 13:15:52,684 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {11233#true} {11336#(and (= main_~s~0 0) (= main_~b~0 main_~x~0) (= main_~q~0 1))} #106#return; {11336#(and (= main_~s~0 0) (= main_~b~0 main_~x~0) (= main_~q~0 1))} is VALID [2022-04-27 13:15:52,684 INFO L272 TraceCheckUtils]: 53: Hoare triple {11336#(and (= main_~s~0 0) (= main_~b~0 main_~x~0) (= main_~q~0 1))} call __VERIFIER_assert((if ~v~0 == ~b~0 * ~d~0 then 1 else 0)); {11233#true} is VALID [2022-04-27 13:15:52,684 INFO L290 TraceCheckUtils]: 54: Hoare triple {11233#true} ~cond := #in~cond; {11233#true} is VALID [2022-04-27 13:15:52,684 INFO L290 TraceCheckUtils]: 55: Hoare triple {11233#true} assume !(0 == ~cond); {11233#true} is VALID [2022-04-27 13:15:52,684 INFO L290 TraceCheckUtils]: 56: Hoare triple {11233#true} assume true; {11233#true} is VALID [2022-04-27 13:15:52,685 INFO L284 TraceCheckUtils]: 57: Hoare quadruple {11233#true} {11336#(and (= main_~s~0 0) (= main_~b~0 main_~x~0) (= main_~q~0 1))} #108#return; {11336#(and (= main_~s~0 0) (= main_~b~0 main_~x~0) (= main_~q~0 1))} is VALID [2022-04-27 13:15:52,685 INFO L290 TraceCheckUtils]: 58: Hoare triple {11336#(and (= main_~s~0 0) (= main_~b~0 main_~x~0) (= main_~q~0 1))} assume !(~c~0 >= 2 * ~v~0); {11336#(and (= main_~s~0 0) (= main_~b~0 main_~x~0) (= main_~q~0 1))} is VALID [2022-04-27 13:15:52,685 INFO L290 TraceCheckUtils]: 59: Hoare triple {11336#(and (= main_~s~0 0) (= main_~b~0 main_~x~0) (= main_~q~0 1))} ~c~0 := ~c~0 - ~v~0;~k~0 := ~k~0 + ~d~0; {11336#(and (= main_~s~0 0) (= main_~b~0 main_~x~0) (= main_~q~0 1))} is VALID [2022-04-27 13:15:52,686 INFO L290 TraceCheckUtils]: 60: Hoare triple {11336#(and (= main_~s~0 0) (= main_~b~0 main_~x~0) (= main_~q~0 1))} assume !false; {11336#(and (= main_~s~0 0) (= main_~b~0 main_~x~0) (= main_~q~0 1))} is VALID [2022-04-27 13:15:52,686 INFO L290 TraceCheckUtils]: 61: Hoare triple {11336#(and (= main_~s~0 0) (= main_~b~0 main_~x~0) (= main_~q~0 1))} assume !(~c~0 >= ~b~0); {11336#(and (= main_~s~0 0) (= main_~b~0 main_~x~0) (= main_~q~0 1))} is VALID [2022-04-27 13:15:52,686 INFO L290 TraceCheckUtils]: 62: Hoare triple {11336#(and (= main_~s~0 0) (= main_~b~0 main_~x~0) (= main_~q~0 1))} ~a~0 := ~b~0;~b~0 := ~c~0;havoc ~temp~0;~temp~0 := ~p~0;~p~0 := ~q~0;~q~0 := ~temp~0 - ~q~0 * ~k~0;~temp~0 := ~r~0;~r~0 := ~s~0;~s~0 := ~temp~0 - ~s~0 * ~k~0; {11429#(and (= main_~r~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-27 13:15:52,687 INFO L290 TraceCheckUtils]: 63: Hoare triple {11429#(and (= main_~r~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} assume !false; {11429#(and (= main_~r~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-27 13:15:52,687 INFO L290 TraceCheckUtils]: 64: Hoare triple {11429#(and (= main_~r~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} assume !!(0 != ~b~0);havoc ~c~0;havoc ~k~0;~c~0 := ~a~0;~k~0 := 0; {11429#(and (= main_~r~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-27 13:15:52,687 INFO L290 TraceCheckUtils]: 65: Hoare triple {11429#(and (= main_~r~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} assume !false; {11429#(and (= main_~r~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-27 13:15:52,688 INFO L290 TraceCheckUtils]: 66: Hoare triple {11429#(and (= main_~r~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} assume !!(~c~0 >= ~b~0);havoc ~d~0;havoc ~v~0;~d~0 := 1;~v~0 := ~b~0; {11429#(and (= main_~r~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-27 13:15:52,688 INFO L290 TraceCheckUtils]: 67: Hoare triple {11429#(and (= main_~r~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} assume !false; {11429#(and (= main_~r~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-27 13:15:52,689 INFO L272 TraceCheckUtils]: 68: Hoare triple {11429#(and (= main_~r~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)); {11448#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 13:15:52,689 INFO L290 TraceCheckUtils]: 69: Hoare triple {11448#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {11452#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 13:15:52,689 INFO L290 TraceCheckUtils]: 70: Hoare triple {11452#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {11234#false} is VALID [2022-04-27 13:15:52,689 INFO L290 TraceCheckUtils]: 71: Hoare triple {11234#false} assume !false; {11234#false} is VALID [2022-04-27 13:15:52,690 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 10 proven. 26 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2022-04-27 13:15:52,690 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 13:16:11,052 INFO L290 TraceCheckUtils]: 71: Hoare triple {11234#false} assume !false; {11234#false} is VALID [2022-04-27 13:16:11,052 INFO L290 TraceCheckUtils]: 70: Hoare triple {11452#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {11234#false} is VALID [2022-04-27 13:16:11,053 INFO L290 TraceCheckUtils]: 69: Hoare triple {11448#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {11452#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 13:16:11,053 INFO L272 TraceCheckUtils]: 68: Hoare triple {11468#(= 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)); {11448#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 13:16:11,054 INFO L290 TraceCheckUtils]: 67: Hoare triple {11468#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} assume !false; {11468#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} is VALID [2022-04-27 13:16:11,067 INFO L290 TraceCheckUtils]: 66: Hoare triple {11468#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} assume !!(~c~0 >= ~b~0);havoc ~d~0;havoc ~v~0;~d~0 := 1;~v~0 := ~b~0; {11468#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} is VALID [2022-04-27 13:16:11,068 INFO L290 TraceCheckUtils]: 65: Hoare triple {11468#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} assume !false; {11468#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} is VALID [2022-04-27 13:16:11,068 INFO L290 TraceCheckUtils]: 64: Hoare triple {11468#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} assume !!(0 != ~b~0);havoc ~c~0;havoc ~k~0;~c~0 := ~a~0;~k~0 := 0; {11468#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} is VALID [2022-04-27 13:16:11,069 INFO L290 TraceCheckUtils]: 63: Hoare triple {11468#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} assume !false; {11468#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} is VALID [2022-04-27 13:16:11,069 INFO L290 TraceCheckUtils]: 62: Hoare triple {11487#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} ~a~0 := ~b~0;~b~0 := ~c~0;havoc ~temp~0;~temp~0 := ~p~0;~p~0 := ~q~0;~q~0 := ~temp~0 - ~q~0 * ~k~0;~temp~0 := ~r~0;~r~0 := ~s~0;~s~0 := ~temp~0 - ~s~0 * ~k~0; {11468#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} is VALID [2022-04-27 13:16:11,069 INFO L290 TraceCheckUtils]: 61: Hoare triple {11487#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} assume !(~c~0 >= ~b~0); {11487#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} is VALID [2022-04-27 13:16:11,070 INFO L290 TraceCheckUtils]: 60: Hoare triple {11487#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} assume !false; {11487#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} is VALID [2022-04-27 13:16:11,070 INFO L290 TraceCheckUtils]: 59: Hoare triple {11487#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} ~c~0 := ~c~0 - ~v~0;~k~0 := ~k~0 + ~d~0; {11487#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} is VALID [2022-04-27 13:16:11,071 INFO L290 TraceCheckUtils]: 58: Hoare triple {11487#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} assume !(~c~0 >= 2 * ~v~0); {11487#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} is VALID [2022-04-27 13:16:11,071 INFO L284 TraceCheckUtils]: 57: Hoare quadruple {11233#true} {11487#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} #108#return; {11487#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} is VALID [2022-04-27 13:16:11,072 INFO L290 TraceCheckUtils]: 56: Hoare triple {11233#true} assume true; {11233#true} is VALID [2022-04-27 13:16:11,072 INFO L290 TraceCheckUtils]: 55: Hoare triple {11233#true} assume !(0 == ~cond); {11233#true} is VALID [2022-04-27 13:16:11,072 INFO L290 TraceCheckUtils]: 54: Hoare triple {11233#true} ~cond := #in~cond; {11233#true} is VALID [2022-04-27 13:16:11,072 INFO L272 TraceCheckUtils]: 53: Hoare triple {11487#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} call __VERIFIER_assert((if ~v~0 == ~b~0 * ~d~0 then 1 else 0)); {11233#true} is VALID [2022-04-27 13:16:11,073 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {11233#true} {11487#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} #106#return; {11487#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} is VALID [2022-04-27 13:16:11,073 INFO L290 TraceCheckUtils]: 51: Hoare triple {11233#true} assume true; {11233#true} is VALID [2022-04-27 13:16:11,073 INFO L290 TraceCheckUtils]: 50: Hoare triple {11233#true} assume !(0 == ~cond); {11233#true} is VALID [2022-04-27 13:16:11,073 INFO L290 TraceCheckUtils]: 49: Hoare triple {11233#true} ~cond := #in~cond; {11233#true} is VALID [2022-04-27 13:16:11,073 INFO L272 TraceCheckUtils]: 48: Hoare triple {11487#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {11233#true} is VALID [2022-04-27 13:16:11,074 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {11377#(not (= |__VERIFIER_assert_#in~cond| 0))} {11233#true} #104#return; {11487#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} is VALID [2022-04-27 13:16:11,074 INFO L290 TraceCheckUtils]: 46: Hoare triple {11377#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {11377#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 13:16:11,074 INFO L290 TraceCheckUtils]: 45: Hoare triple {11542#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} assume !(0 == ~cond); {11377#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 13:16:11,075 INFO L290 TraceCheckUtils]: 44: Hoare triple {11233#true} ~cond := #in~cond; {11542#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-27 13:16:11,075 INFO L272 TraceCheckUtils]: 43: Hoare triple {11233#true} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {11233#true} is VALID [2022-04-27 13:16:11,075 INFO L284 TraceCheckUtils]: 42: Hoare quadruple {11233#true} {11233#true} #102#return; {11233#true} is VALID [2022-04-27 13:16:11,075 INFO L290 TraceCheckUtils]: 41: Hoare triple {11233#true} assume true; {11233#true} is VALID [2022-04-27 13:16:11,075 INFO L290 TraceCheckUtils]: 40: Hoare triple {11233#true} assume !(0 == ~cond); {11233#true} is VALID [2022-04-27 13:16:11,075 INFO L290 TraceCheckUtils]: 39: Hoare triple {11233#true} ~cond := #in~cond; {11233#true} is VALID [2022-04-27 13:16:11,075 INFO L272 TraceCheckUtils]: 38: Hoare triple {11233#true} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {11233#true} is VALID [2022-04-27 13:16:11,075 INFO L290 TraceCheckUtils]: 37: Hoare triple {11233#true} assume !false; {11233#true} is VALID [2022-04-27 13:16:11,075 INFO L290 TraceCheckUtils]: 36: Hoare triple {11233#true} assume !!(~c~0 >= ~b~0);havoc ~d~0;havoc ~v~0;~d~0 := 1;~v~0 := ~b~0; {11233#true} is VALID [2022-04-27 13:16:11,076 INFO L290 TraceCheckUtils]: 35: Hoare triple {11233#true} assume !false; {11233#true} is VALID [2022-04-27 13:16:11,076 INFO L290 TraceCheckUtils]: 34: Hoare triple {11233#true} assume !!(0 != ~b~0);havoc ~c~0;havoc ~k~0;~c~0 := ~a~0;~k~0 := 0; {11233#true} is VALID [2022-04-27 13:16:11,076 INFO L290 TraceCheckUtils]: 33: Hoare triple {11233#true} assume !false; {11233#true} is VALID [2022-04-27 13:16:11,076 INFO L290 TraceCheckUtils]: 32: Hoare triple {11233#true} ~a~0 := ~b~0;~b~0 := ~c~0;havoc ~temp~0;~temp~0 := ~p~0;~p~0 := ~q~0;~q~0 := ~temp~0 - ~q~0 * ~k~0;~temp~0 := ~r~0;~r~0 := ~s~0;~s~0 := ~temp~0 - ~s~0 * ~k~0; {11233#true} is VALID [2022-04-27 13:16:11,076 INFO L290 TraceCheckUtils]: 31: Hoare triple {11233#true} assume !(~c~0 >= ~b~0); {11233#true} is VALID [2022-04-27 13:16:11,076 INFO L290 TraceCheckUtils]: 30: Hoare triple {11233#true} assume !false; {11233#true} is VALID [2022-04-27 13:16:11,076 INFO L290 TraceCheckUtils]: 29: Hoare triple {11233#true} assume !!(0 != ~b~0);havoc ~c~0;havoc ~k~0;~c~0 := ~a~0;~k~0 := 0; {11233#true} is VALID [2022-04-27 13:16:11,076 INFO L290 TraceCheckUtils]: 28: Hoare triple {11233#true} assume !false; {11233#true} is VALID [2022-04-27 13:16:11,076 INFO L290 TraceCheckUtils]: 27: Hoare triple {11233#true} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1; {11233#true} is VALID [2022-04-27 13:16:11,076 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {11233#true} {11233#true} #100#return; {11233#true} is VALID [2022-04-27 13:16:11,076 INFO L290 TraceCheckUtils]: 25: Hoare triple {11233#true} assume true; {11233#true} is VALID [2022-04-27 13:16:11,076 INFO L290 TraceCheckUtils]: 24: Hoare triple {11233#true} assume !(0 == ~cond); {11233#true} is VALID [2022-04-27 13:16:11,077 INFO L290 TraceCheckUtils]: 23: Hoare triple {11233#true} ~cond := #in~cond; {11233#true} is VALID [2022-04-27 13:16:11,077 INFO L272 TraceCheckUtils]: 22: Hoare triple {11233#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {11233#true} is VALID [2022-04-27 13:16:11,077 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {11233#true} {11233#true} #98#return; {11233#true} is VALID [2022-04-27 13:16:11,077 INFO L290 TraceCheckUtils]: 20: Hoare triple {11233#true} assume true; {11233#true} is VALID [2022-04-27 13:16:11,077 INFO L290 TraceCheckUtils]: 19: Hoare triple {11233#true} assume !(0 == ~cond); {11233#true} is VALID [2022-04-27 13:16:11,077 INFO L290 TraceCheckUtils]: 18: Hoare triple {11233#true} ~cond := #in~cond; {11233#true} is VALID [2022-04-27 13:16:11,077 INFO L272 TraceCheckUtils]: 17: Hoare triple {11233#true} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {11233#true} is VALID [2022-04-27 13:16:11,077 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {11233#true} {11233#true} #96#return; {11233#true} is VALID [2022-04-27 13:16:11,077 INFO L290 TraceCheckUtils]: 15: Hoare triple {11233#true} assume true; {11233#true} is VALID [2022-04-27 13:16:11,077 INFO L290 TraceCheckUtils]: 14: Hoare triple {11233#true} assume !(0 == ~cond); {11233#true} is VALID [2022-04-27 13:16:11,077 INFO L290 TraceCheckUtils]: 13: Hoare triple {11233#true} ~cond := #in~cond; {11233#true} is VALID [2022-04-27 13:16:11,077 INFO L272 TraceCheckUtils]: 12: Hoare triple {11233#true} call assume_abort_if_not((if ~y~0 >= 0 && ~y~0 <= 50 then 1 else 0)); {11233#true} is VALID [2022-04-27 13:16:11,078 INFO L290 TraceCheckUtils]: 11: Hoare triple {11233#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {11233#true} is VALID [2022-04-27 13:16:11,078 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {11233#true} {11233#true} #94#return; {11233#true} is VALID [2022-04-27 13:16:11,078 INFO L290 TraceCheckUtils]: 9: Hoare triple {11233#true} assume true; {11233#true} is VALID [2022-04-27 13:16:11,078 INFO L290 TraceCheckUtils]: 8: Hoare triple {11233#true} assume !(0 == ~cond); {11233#true} is VALID [2022-04-27 13:16:11,078 INFO L290 TraceCheckUtils]: 7: Hoare triple {11233#true} ~cond := #in~cond; {11233#true} is VALID [2022-04-27 13:16:11,078 INFO L272 TraceCheckUtils]: 6: Hoare triple {11233#true} call assume_abort_if_not((if ~x~0 >= 0 && ~x~0 <= 50 then 1 else 0)); {11233#true} is VALID [2022-04-27 13:16:11,078 INFO L290 TraceCheckUtils]: 5: Hoare triple {11233#true} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~s~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4; {11233#true} is VALID [2022-04-27 13:16:11,078 INFO L272 TraceCheckUtils]: 4: Hoare triple {11233#true} call #t~ret6 := main(); {11233#true} is VALID [2022-04-27 13:16:11,078 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {11233#true} {11233#true} #112#return; {11233#true} is VALID [2022-04-27 13:16:11,078 INFO L290 TraceCheckUtils]: 2: Hoare triple {11233#true} assume true; {11233#true} is VALID [2022-04-27 13:16:11,078 INFO L290 TraceCheckUtils]: 1: Hoare triple {11233#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(11, 2);call #Ultimate.allocInit(12, 3); {11233#true} is VALID [2022-04-27 13:16:11,078 INFO L272 TraceCheckUtils]: 0: Hoare triple {11233#true} call ULTIMATE.init(); {11233#true} is VALID [2022-04-27 13:16:11,079 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 25 proven. 9 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2022-04-27 13:16:11,079 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 13:16:11,079 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2029502506] [2022-04-27 13:16:11,079 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 13:16:11,079 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [253486453] [2022-04-27 13:16:11,079 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [253486453] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 13:16:11,079 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-27 13:16:11,079 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8] total 13 [2022-04-27 13:16:11,080 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [181447695] [2022-04-27 13:16:11,080 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-27 13:16:11,080 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 4.3076923076923075) internal successors, (56), 12 states have internal predecessors, (56), 5 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) Word has length 72 [2022-04-27 13:16:11,081 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 13:16:11,081 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 13 states, 13 states have (on average 4.3076923076923075) internal successors, (56), 12 states have internal predecessors, (56), 5 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) [2022-04-27 13:16:11,155 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 85 edges. 85 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 13:16:11,155 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-04-27 13:16:11,155 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 13:16:11,155 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-04-27 13:16:11,155 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2022-04-27 13:16:11,156 INFO L87 Difference]: Start difference. First operand 254 states and 354 transitions. Second operand has 13 states, 13 states have (on average 4.3076923076923075) internal successors, (56), 12 states have internal predecessors, (56), 5 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) [2022-04-27 13:16:13,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:16:13,445 INFO L93 Difference]: Finished difference Result 323 states and 461 transitions. [2022-04-27 13:16:13,445 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-04-27 13:16:13,445 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 4.3076923076923075) internal successors, (56), 12 states have internal predecessors, (56), 5 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) Word has length 72 [2022-04-27 13:16:13,445 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 13:16:13,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 13 states have (on average 4.3076923076923075) internal successors, (56), 12 states have internal predecessors, (56), 5 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) [2022-04-27 13:16:13,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 135 transitions. [2022-04-27 13:16:13,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 13 states have (on average 4.3076923076923075) internal successors, (56), 12 states have internal predecessors, (56), 5 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) [2022-04-27 13:16:13,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 135 transitions. [2022-04-27 13:16:13,449 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 13 states and 135 transitions. [2022-04-27 13:16:13,588 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 135 edges. 135 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 13:16:13,594 INFO L225 Difference]: With dead ends: 323 [2022-04-27 13:16:13,594 INFO L226 Difference]: Without dead ends: 321 [2022-04-27 13:16:13,595 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 155 GetRequests, 136 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=78, Invalid=302, Unknown=0, NotChecked=0, Total=380 [2022-04-27 13:16:13,595 INFO L413 NwaCegarLoop]: 42 mSDtfsCounter, 61 mSDsluCounter, 262 mSDsCounter, 0 mSdLazyCounter, 442 mSolverCounterSat, 47 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 65 SdHoareTripleChecker+Valid, 304 SdHoareTripleChecker+Invalid, 489 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Valid, 442 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-04-27 13:16:13,595 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [65 Valid, 304 Invalid, 489 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [47 Valid, 442 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-04-27 13:16:13,596 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 321 states. [2022-04-27 13:16:14,223 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 321 to 258. [2022-04-27 13:16:14,223 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 13:16:14,224 INFO L82 GeneralOperation]: Start isEquivalent. First operand 321 states. Second operand has 258 states, 152 states have (on average 1.1907894736842106) internal successors, (181), 159 states have internal predecessors, (181), 89 states have call successors, (89), 17 states have call predecessors, (89), 16 states have return successors, (87), 81 states have call predecessors, (87), 87 states have call successors, (87) [2022-04-27 13:16:14,224 INFO L74 IsIncluded]: Start isIncluded. First operand 321 states. Second operand has 258 states, 152 states have (on average 1.1907894736842106) internal successors, (181), 159 states have internal predecessors, (181), 89 states have call successors, (89), 17 states have call predecessors, (89), 16 states have return successors, (87), 81 states have call predecessors, (87), 87 states have call successors, (87) [2022-04-27 13:16:14,224 INFO L87 Difference]: Start difference. First operand 321 states. Second operand has 258 states, 152 states have (on average 1.1907894736842106) internal successors, (181), 159 states have internal predecessors, (181), 89 states have call successors, (89), 17 states have call predecessors, (89), 16 states have return successors, (87), 81 states have call predecessors, (87), 87 states have call successors, (87) [2022-04-27 13:16:14,235 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:16:14,235 INFO L93 Difference]: Finished difference Result 321 states and 459 transitions. [2022-04-27 13:16:14,235 INFO L276 IsEmpty]: Start isEmpty. Operand 321 states and 459 transitions. [2022-04-27 13:16:14,236 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 13:16:14,236 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 13:16:14,237 INFO L74 IsIncluded]: Start isIncluded. First operand has 258 states, 152 states have (on average 1.1907894736842106) internal successors, (181), 159 states have internal predecessors, (181), 89 states have call successors, (89), 17 states have call predecessors, (89), 16 states have return successors, (87), 81 states have call predecessors, (87), 87 states have call successors, (87) Second operand 321 states. [2022-04-27 13:16:14,237 INFO L87 Difference]: Start difference. First operand has 258 states, 152 states have (on average 1.1907894736842106) internal successors, (181), 159 states have internal predecessors, (181), 89 states have call successors, (89), 17 states have call predecessors, (89), 16 states have return successors, (87), 81 states have call predecessors, (87), 87 states have call successors, (87) Second operand 321 states. [2022-04-27 13:16:14,248 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:16:14,249 INFO L93 Difference]: Finished difference Result 321 states and 459 transitions. [2022-04-27 13:16:14,249 INFO L276 IsEmpty]: Start isEmpty. Operand 321 states and 459 transitions. [2022-04-27 13:16:14,250 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 13:16:14,250 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 13:16:14,250 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 13:16:14,250 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 13:16:14,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 258 states, 152 states have (on average 1.1907894736842106) internal successors, (181), 159 states have internal predecessors, (181), 89 states have call successors, (89), 17 states have call predecessors, (89), 16 states have return successors, (87), 81 states have call predecessors, (87), 87 states have call successors, (87) [2022-04-27 13:16:14,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 258 states to 258 states and 357 transitions. [2022-04-27 13:16:14,259 INFO L78 Accepts]: Start accepts. Automaton has 258 states and 357 transitions. Word has length 72 [2022-04-27 13:16:14,259 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 13:16:14,259 INFO L495 AbstractCegarLoop]: Abstraction has 258 states and 357 transitions. [2022-04-27 13:16:14,259 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 4.3076923076923075) internal successors, (56), 12 states have internal predecessors, (56), 5 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) [2022-04-27 13:16:14,259 INFO L276 IsEmpty]: Start isEmpty. Operand 258 states and 357 transitions. [2022-04-27 13:16:14,260 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2022-04-27 13:16:14,260 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 13:16:14,260 INFO L195 NwaCegarLoop]: trace histogram [7, 6, 6, 4, 4, 4, 3, 2, 2, 2, 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, 1, 1, 1, 1] [2022-04-27 13:16:14,303 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2022-04-27 13:16:14,483 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2022-04-27 13:16:14,484 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 13:16:14,484 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 13:16:14,484 INFO L85 PathProgramCache]: Analyzing trace with hash 1984914564, now seen corresponding path program 2 times [2022-04-27 13:16:14,484 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 13:16:14,484 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1941656279] [2022-04-27 13:16:14,484 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 13:16:14,484 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 13:16:14,505 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 13:16:14,505 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1987090073] [2022-04-27 13:16:14,505 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-27 13:16:14,505 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 13:16:14,505 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 13:16:14,506 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-27 13:16:14,555 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2022-04-27 13:16:14,606 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-27 13:16:14,607 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-27 13:16:14,607 INFO L263 TraceCheckSpWp]: Trace formula consists of 205 conjuncts, 4 conjunts are in the unsatisfiable core [2022-04-27 13:16:14,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 13:16:14,620 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 13:16:14,808 INFO L272 TraceCheckUtils]: 0: Hoare triple {13265#true} call ULTIMATE.init(); {13265#true} is VALID [2022-04-27 13:16:14,809 INFO L290 TraceCheckUtils]: 1: Hoare triple {13265#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(11, 2);call #Ultimate.allocInit(12, 3); {13265#true} is VALID [2022-04-27 13:16:14,809 INFO L290 TraceCheckUtils]: 2: Hoare triple {13265#true} assume true; {13265#true} is VALID [2022-04-27 13:16:14,809 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {13265#true} {13265#true} #112#return; {13265#true} is VALID [2022-04-27 13:16:14,809 INFO L272 TraceCheckUtils]: 4: Hoare triple {13265#true} call #t~ret6 := main(); {13265#true} is VALID [2022-04-27 13:16:14,809 INFO L290 TraceCheckUtils]: 5: Hoare triple {13265#true} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~s~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4; {13265#true} is VALID [2022-04-27 13:16:14,809 INFO L272 TraceCheckUtils]: 6: Hoare triple {13265#true} call assume_abort_if_not((if ~x~0 >= 0 && ~x~0 <= 50 then 1 else 0)); {13265#true} is VALID [2022-04-27 13:16:14,809 INFO L290 TraceCheckUtils]: 7: Hoare triple {13265#true} ~cond := #in~cond; {13265#true} is VALID [2022-04-27 13:16:14,809 INFO L290 TraceCheckUtils]: 8: Hoare triple {13265#true} assume !(0 == ~cond); {13265#true} is VALID [2022-04-27 13:16:14,809 INFO L290 TraceCheckUtils]: 9: Hoare triple {13265#true} assume true; {13265#true} is VALID [2022-04-27 13:16:14,809 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {13265#true} {13265#true} #94#return; {13265#true} is VALID [2022-04-27 13:16:14,809 INFO L290 TraceCheckUtils]: 11: Hoare triple {13265#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {13265#true} is VALID [2022-04-27 13:16:14,809 INFO L272 TraceCheckUtils]: 12: Hoare triple {13265#true} call assume_abort_if_not((if ~y~0 >= 0 && ~y~0 <= 50 then 1 else 0)); {13265#true} is VALID [2022-04-27 13:16:14,809 INFO L290 TraceCheckUtils]: 13: Hoare triple {13265#true} ~cond := #in~cond; {13265#true} is VALID [2022-04-27 13:16:14,809 INFO L290 TraceCheckUtils]: 14: Hoare triple {13265#true} assume !(0 == ~cond); {13265#true} is VALID [2022-04-27 13:16:14,809 INFO L290 TraceCheckUtils]: 15: Hoare triple {13265#true} assume true; {13265#true} is VALID [2022-04-27 13:16:14,810 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {13265#true} {13265#true} #96#return; {13265#true} is VALID [2022-04-27 13:16:14,810 INFO L272 TraceCheckUtils]: 17: Hoare triple {13265#true} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {13265#true} is VALID [2022-04-27 13:16:14,810 INFO L290 TraceCheckUtils]: 18: Hoare triple {13265#true} ~cond := #in~cond; {13265#true} is VALID [2022-04-27 13:16:14,810 INFO L290 TraceCheckUtils]: 19: Hoare triple {13265#true} assume !(0 == ~cond); {13265#true} is VALID [2022-04-27 13:16:14,810 INFO L290 TraceCheckUtils]: 20: Hoare triple {13265#true} assume true; {13265#true} is VALID [2022-04-27 13:16:14,810 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {13265#true} {13265#true} #98#return; {13265#true} is VALID [2022-04-27 13:16:14,810 INFO L272 TraceCheckUtils]: 22: Hoare triple {13265#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {13265#true} is VALID [2022-04-27 13:16:14,810 INFO L290 TraceCheckUtils]: 23: Hoare triple {13265#true} ~cond := #in~cond; {13265#true} is VALID [2022-04-27 13:16:14,810 INFO L290 TraceCheckUtils]: 24: Hoare triple {13265#true} assume !(0 == ~cond); {13265#true} is VALID [2022-04-27 13:16:14,810 INFO L290 TraceCheckUtils]: 25: Hoare triple {13265#true} assume true; {13265#true} is VALID [2022-04-27 13:16:14,810 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {13265#true} {13265#true} #100#return; {13265#true} is VALID [2022-04-27 13:16:14,810 INFO L290 TraceCheckUtils]: 27: Hoare triple {13265#true} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1; {13265#true} is VALID [2022-04-27 13:16:14,810 INFO L290 TraceCheckUtils]: 28: Hoare triple {13265#true} assume !false; {13265#true} is VALID [2022-04-27 13:16:14,810 INFO L290 TraceCheckUtils]: 29: Hoare triple {13265#true} assume !!(0 != ~b~0);havoc ~c~0;havoc ~k~0;~c~0 := ~a~0;~k~0 := 0; {13265#true} is VALID [2022-04-27 13:16:14,810 INFO L290 TraceCheckUtils]: 30: Hoare triple {13265#true} assume !false; {13265#true} is VALID [2022-04-27 13:16:14,810 INFO L290 TraceCheckUtils]: 31: Hoare triple {13265#true} assume !(~c~0 >= ~b~0); {13265#true} is VALID [2022-04-27 13:16:14,811 INFO L290 TraceCheckUtils]: 32: Hoare triple {13265#true} ~a~0 := ~b~0;~b~0 := ~c~0;havoc ~temp~0;~temp~0 := ~p~0;~p~0 := ~q~0;~q~0 := ~temp~0 - ~q~0 * ~k~0;~temp~0 := ~r~0;~r~0 := ~s~0;~s~0 := ~temp~0 - ~s~0 * ~k~0; {13265#true} is VALID [2022-04-27 13:16:14,811 INFO L290 TraceCheckUtils]: 33: Hoare triple {13265#true} assume !false; {13265#true} is VALID [2022-04-27 13:16:14,811 INFO L290 TraceCheckUtils]: 34: Hoare triple {13265#true} assume !!(0 != ~b~0);havoc ~c~0;havoc ~k~0;~c~0 := ~a~0;~k~0 := 0; {13265#true} is VALID [2022-04-27 13:16:14,811 INFO L290 TraceCheckUtils]: 35: Hoare triple {13265#true} assume !false; {13265#true} is VALID [2022-04-27 13:16:14,811 INFO L290 TraceCheckUtils]: 36: Hoare triple {13265#true} assume !!(~c~0 >= ~b~0);havoc ~d~0;havoc ~v~0;~d~0 := 1;~v~0 := ~b~0; {13378#(<= main_~v~0 main_~b~0)} is VALID [2022-04-27 13:16:14,811 INFO L290 TraceCheckUtils]: 37: Hoare triple {13378#(<= main_~v~0 main_~b~0)} assume !false; {13378#(<= main_~v~0 main_~b~0)} is VALID [2022-04-27 13:16:14,811 INFO L272 TraceCheckUtils]: 38: Hoare triple {13378#(<= main_~v~0 main_~b~0)} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {13265#true} is VALID [2022-04-27 13:16:14,811 INFO L290 TraceCheckUtils]: 39: Hoare triple {13265#true} ~cond := #in~cond; {13265#true} is VALID [2022-04-27 13:16:14,812 INFO L290 TraceCheckUtils]: 40: Hoare triple {13265#true} assume !(0 == ~cond); {13265#true} is VALID [2022-04-27 13:16:14,812 INFO L290 TraceCheckUtils]: 41: Hoare triple {13265#true} assume true; {13265#true} is VALID [2022-04-27 13:16:14,812 INFO L284 TraceCheckUtils]: 42: Hoare quadruple {13265#true} {13378#(<= main_~v~0 main_~b~0)} #102#return; {13378#(<= main_~v~0 main_~b~0)} is VALID [2022-04-27 13:16:14,812 INFO L272 TraceCheckUtils]: 43: Hoare triple {13378#(<= main_~v~0 main_~b~0)} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {13265#true} is VALID [2022-04-27 13:16:14,812 INFO L290 TraceCheckUtils]: 44: Hoare triple {13265#true} ~cond := #in~cond; {13265#true} is VALID [2022-04-27 13:16:14,812 INFO L290 TraceCheckUtils]: 45: Hoare triple {13265#true} assume !(0 == ~cond); {13265#true} is VALID [2022-04-27 13:16:14,812 INFO L290 TraceCheckUtils]: 46: Hoare triple {13265#true} assume true; {13265#true} is VALID [2022-04-27 13:16:14,813 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {13265#true} {13378#(<= main_~v~0 main_~b~0)} #104#return; {13378#(<= main_~v~0 main_~b~0)} is VALID [2022-04-27 13:16:14,813 INFO L272 TraceCheckUtils]: 48: Hoare triple {13378#(<= main_~v~0 main_~b~0)} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {13265#true} is VALID [2022-04-27 13:16:14,813 INFO L290 TraceCheckUtils]: 49: Hoare triple {13265#true} ~cond := #in~cond; {13265#true} is VALID [2022-04-27 13:16:14,813 INFO L290 TraceCheckUtils]: 50: Hoare triple {13265#true} assume !(0 == ~cond); {13265#true} is VALID [2022-04-27 13:16:14,813 INFO L290 TraceCheckUtils]: 51: Hoare triple {13265#true} assume true; {13265#true} is VALID [2022-04-27 13:16:14,814 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {13265#true} {13378#(<= main_~v~0 main_~b~0)} #106#return; {13378#(<= main_~v~0 main_~b~0)} is VALID [2022-04-27 13:16:14,814 INFO L272 TraceCheckUtils]: 53: Hoare triple {13378#(<= main_~v~0 main_~b~0)} call __VERIFIER_assert((if ~v~0 == ~b~0 * ~d~0 then 1 else 0)); {13265#true} is VALID [2022-04-27 13:16:14,814 INFO L290 TraceCheckUtils]: 54: Hoare triple {13265#true} ~cond := #in~cond; {13265#true} is VALID [2022-04-27 13:16:14,814 INFO L290 TraceCheckUtils]: 55: Hoare triple {13265#true} assume !(0 == ~cond); {13265#true} is VALID [2022-04-27 13:16:14,814 INFO L290 TraceCheckUtils]: 56: Hoare triple {13265#true} assume true; {13265#true} is VALID [2022-04-27 13:16:14,819 INFO L284 TraceCheckUtils]: 57: Hoare quadruple {13265#true} {13378#(<= main_~v~0 main_~b~0)} #108#return; {13378#(<= main_~v~0 main_~b~0)} is VALID [2022-04-27 13:16:14,819 INFO L290 TraceCheckUtils]: 58: Hoare triple {13378#(<= main_~v~0 main_~b~0)} assume !(~c~0 >= 2 * ~v~0); {13445#(and (<= main_~v~0 main_~b~0) (not (<= (* main_~v~0 2) main_~c~0)))} is VALID [2022-04-27 13:16:14,820 INFO L290 TraceCheckUtils]: 59: Hoare triple {13445#(and (<= main_~v~0 main_~b~0) (not (<= (* main_~v~0 2) main_~c~0)))} ~c~0 := ~c~0 - ~v~0;~k~0 := ~k~0 + ~d~0; {13449#(< main_~c~0 main_~b~0)} is VALID [2022-04-27 13:16:14,820 INFO L290 TraceCheckUtils]: 60: Hoare triple {13449#(< main_~c~0 main_~b~0)} assume !false; {13449#(< main_~c~0 main_~b~0)} is VALID [2022-04-27 13:16:14,820 INFO L290 TraceCheckUtils]: 61: Hoare triple {13449#(< main_~c~0 main_~b~0)} assume !!(~c~0 >= ~b~0);havoc ~d~0;havoc ~v~0;~d~0 := 1;~v~0 := ~b~0; {13266#false} is VALID [2022-04-27 13:16:14,820 INFO L290 TraceCheckUtils]: 62: Hoare triple {13266#false} assume !false; {13266#false} is VALID [2022-04-27 13:16:14,820 INFO L272 TraceCheckUtils]: 63: Hoare triple {13266#false} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {13266#false} is VALID [2022-04-27 13:16:14,820 INFO L290 TraceCheckUtils]: 64: Hoare triple {13266#false} ~cond := #in~cond; {13266#false} is VALID [2022-04-27 13:16:14,821 INFO L290 TraceCheckUtils]: 65: Hoare triple {13266#false} assume !(0 == ~cond); {13266#false} is VALID [2022-04-27 13:16:14,821 INFO L290 TraceCheckUtils]: 66: Hoare triple {13266#false} assume true; {13266#false} is VALID [2022-04-27 13:16:14,821 INFO L284 TraceCheckUtils]: 67: Hoare quadruple {13266#false} {13266#false} #102#return; {13266#false} is VALID [2022-04-27 13:16:14,821 INFO L272 TraceCheckUtils]: 68: Hoare triple {13266#false} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {13266#false} is VALID [2022-04-27 13:16:14,821 INFO L290 TraceCheckUtils]: 69: Hoare triple {13266#false} ~cond := #in~cond; {13266#false} is VALID [2022-04-27 13:16:14,821 INFO L290 TraceCheckUtils]: 70: Hoare triple {13266#false} assume !(0 == ~cond); {13266#false} is VALID [2022-04-27 13:16:14,821 INFO L290 TraceCheckUtils]: 71: Hoare triple {13266#false} assume true; {13266#false} is VALID [2022-04-27 13:16:14,821 INFO L284 TraceCheckUtils]: 72: Hoare quadruple {13266#false} {13266#false} #104#return; {13266#false} is VALID [2022-04-27 13:16:14,821 INFO L272 TraceCheckUtils]: 73: Hoare triple {13266#false} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {13266#false} is VALID [2022-04-27 13:16:14,821 INFO L290 TraceCheckUtils]: 74: Hoare triple {13266#false} ~cond := #in~cond; {13266#false} is VALID [2022-04-27 13:16:14,821 INFO L290 TraceCheckUtils]: 75: Hoare triple {13266#false} assume 0 == ~cond; {13266#false} is VALID [2022-04-27 13:16:14,821 INFO L290 TraceCheckUtils]: 76: Hoare triple {13266#false} assume !false; {13266#false} is VALID [2022-04-27 13:16:14,821 INFO L134 CoverageAnalysis]: Checked inductivity of 108 backedges. 48 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2022-04-27 13:16:14,821 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-27 13:16:14,822 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 13:16:14,822 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1941656279] [2022-04-27 13:16:14,822 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 13:16:14,822 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1987090073] [2022-04-27 13:16:14,822 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1987090073] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 13:16:14,822 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 13:16:14,822 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-27 13:16:14,822 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [155259268] [2022-04-27 13:16:14,822 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 13:16:14,823 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.6) internal successors, (28), 5 states have internal predecessors, (28), 3 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) Word has length 77 [2022-04-27 13:16:14,823 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 13:16:14,823 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 5.6) internal successors, (28), 5 states have internal predecessors, (28), 3 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2022-04-27 13:16:14,871 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 13:16:14,871 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-27 13:16:14,871 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 13:16:14,871 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-27 13:16:14,871 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-04-27 13:16:14,871 INFO L87 Difference]: Start difference. First operand 258 states and 357 transitions. Second operand has 5 states, 5 states have (on average 5.6) internal successors, (28), 5 states have internal predecessors, (28), 3 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2022-04-27 13:16:15,706 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:16:15,706 INFO L93 Difference]: Finished difference Result 444 states and 610 transitions. [2022-04-27 13:16:15,706 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-27 13:16:15,706 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.6) internal successors, (28), 5 states have internal predecessors, (28), 3 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) Word has length 77 [2022-04-27 13:16:15,706 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 13:16:15,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 5.6) internal successors, (28), 5 states have internal predecessors, (28), 3 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2022-04-27 13:16:15,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 85 transitions. [2022-04-27 13:16:15,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 5.6) internal successors, (28), 5 states have internal predecessors, (28), 3 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2022-04-27 13:16:15,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 85 transitions. [2022-04-27 13:16:15,709 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 85 transitions. [2022-04-27 13:16:15,785 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 85 edges. 85 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 13:16:15,791 INFO L225 Difference]: With dead ends: 444 [2022-04-27 13:16:15,791 INFO L226 Difference]: Without dead ends: 266 [2022-04-27 13:16:15,792 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 74 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-04-27 13:16:15,792 INFO L413 NwaCegarLoop]: 45 mSDtfsCounter, 3 mSDsluCounter, 94 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 139 SdHoareTripleChecker+Invalid, 57 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 13:16:15,792 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 139 Invalid, 57 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 13:16:15,793 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 266 states. [2022-04-27 13:16:16,503 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 266 to 257. [2022-04-27 13:16:16,504 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 13:16:16,504 INFO L82 GeneralOperation]: Start isEquivalent. First operand 266 states. Second operand has 257 states, 159 states have (on average 1.1761006289308176) internal successors, (187), 161 states have internal predecessors, (187), 81 states have call successors, (81), 17 states have call predecessors, (81), 16 states have return successors, (79), 78 states have call predecessors, (79), 79 states have call successors, (79) [2022-04-27 13:16:16,505 INFO L74 IsIncluded]: Start isIncluded. First operand 266 states. Second operand has 257 states, 159 states have (on average 1.1761006289308176) internal successors, (187), 161 states have internal predecessors, (187), 81 states have call successors, (81), 17 states have call predecessors, (81), 16 states have return successors, (79), 78 states have call predecessors, (79), 79 states have call successors, (79) [2022-04-27 13:16:16,505 INFO L87 Difference]: Start difference. First operand 266 states. Second operand has 257 states, 159 states have (on average 1.1761006289308176) internal successors, (187), 161 states have internal predecessors, (187), 81 states have call successors, (81), 17 states have call predecessors, (81), 16 states have return successors, (79), 78 states have call predecessors, (79), 79 states have call successors, (79) [2022-04-27 13:16:16,512 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:16:16,512 INFO L93 Difference]: Finished difference Result 266 states and 356 transitions. [2022-04-27 13:16:16,512 INFO L276 IsEmpty]: Start isEmpty. Operand 266 states and 356 transitions. [2022-04-27 13:16:16,514 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 13:16:16,514 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 13:16:16,514 INFO L74 IsIncluded]: Start isIncluded. First operand has 257 states, 159 states have (on average 1.1761006289308176) internal successors, (187), 161 states have internal predecessors, (187), 81 states have call successors, (81), 17 states have call predecessors, (81), 16 states have return successors, (79), 78 states have call predecessors, (79), 79 states have call successors, (79) Second operand 266 states. [2022-04-27 13:16:16,515 INFO L87 Difference]: Start difference. First operand has 257 states, 159 states have (on average 1.1761006289308176) internal successors, (187), 161 states have internal predecessors, (187), 81 states have call successors, (81), 17 states have call predecessors, (81), 16 states have return successors, (79), 78 states have call predecessors, (79), 79 states have call successors, (79) Second operand 266 states. [2022-04-27 13:16:16,522 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:16:16,522 INFO L93 Difference]: Finished difference Result 266 states and 356 transitions. [2022-04-27 13:16:16,522 INFO L276 IsEmpty]: Start isEmpty. Operand 266 states and 356 transitions. [2022-04-27 13:16:16,523 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 13:16:16,523 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 13:16:16,523 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 13:16:16,523 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 13:16:16,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 257 states, 159 states have (on average 1.1761006289308176) internal successors, (187), 161 states have internal predecessors, (187), 81 states have call successors, (81), 17 states have call predecessors, (81), 16 states have return successors, (79), 78 states have call predecessors, (79), 79 states have call successors, (79) [2022-04-27 13:16:16,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 257 states to 257 states and 347 transitions. [2022-04-27 13:16:16,532 INFO L78 Accepts]: Start accepts. Automaton has 257 states and 347 transitions. Word has length 77 [2022-04-27 13:16:16,532 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 13:16:16,532 INFO L495 AbstractCegarLoop]: Abstraction has 257 states and 347 transitions. [2022-04-27 13:16:16,532 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.6) internal successors, (28), 5 states have internal predecessors, (28), 3 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2022-04-27 13:16:16,532 INFO L276 IsEmpty]: Start isEmpty. Operand 257 states and 347 transitions. [2022-04-27 13:16:16,533 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2022-04-27 13:16:16,533 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 13:16:16,533 INFO L195 NwaCegarLoop]: trace histogram [6, 5, 5, 4, 4, 4, 4, 3, 3, 2, 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, 1, 1, 1, 1] [2022-04-27 13:16:16,558 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2022-04-27 13:16:16,747 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2022-04-27 13:16:16,747 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 13:16:16,748 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 13:16:16,748 INFO L85 PathProgramCache]: Analyzing trace with hash -867272991, now seen corresponding path program 3 times [2022-04-27 13:16:16,748 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 13:16:16,748 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1102562806] [2022-04-27 13:16:16,748 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 13:16:16,748 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 13:16:16,767 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 13:16:16,768 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [748899277] [2022-04-27 13:16:16,768 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-04-27 13:16:16,768 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 13:16:16,768 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 13:16:16,769 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-27 13:16:16,807 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2022-04-27 13:16:16,839 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-04-27 13:16:16,839 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-27 13:16:16,840 INFO L263 TraceCheckSpWp]: Trace formula consists of 178 conjuncts, 60 conjunts are in the unsatisfiable core [2022-04-27 13:16:16,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 13:16:16,859 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 13:16:17,944 INFO L272 TraceCheckUtils]: 0: Hoare triple {15127#true} call ULTIMATE.init(); {15127#true} is VALID [2022-04-27 13:16:17,944 INFO L290 TraceCheckUtils]: 1: Hoare triple {15127#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(11, 2);call #Ultimate.allocInit(12, 3); {15127#true} is VALID [2022-04-27 13:16:17,944 INFO L290 TraceCheckUtils]: 2: Hoare triple {15127#true} assume true; {15127#true} is VALID [2022-04-27 13:16:17,944 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {15127#true} {15127#true} #112#return; {15127#true} is VALID [2022-04-27 13:16:17,944 INFO L272 TraceCheckUtils]: 4: Hoare triple {15127#true} call #t~ret6 := main(); {15127#true} is VALID [2022-04-27 13:16:17,944 INFO L290 TraceCheckUtils]: 5: Hoare triple {15127#true} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~s~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4; {15127#true} is VALID [2022-04-27 13:16:17,944 INFO L272 TraceCheckUtils]: 6: Hoare triple {15127#true} call assume_abort_if_not((if ~x~0 >= 0 && ~x~0 <= 50 then 1 else 0)); {15127#true} is VALID [2022-04-27 13:16:17,944 INFO L290 TraceCheckUtils]: 7: Hoare triple {15127#true} ~cond := #in~cond; {15127#true} is VALID [2022-04-27 13:16:17,944 INFO L290 TraceCheckUtils]: 8: Hoare triple {15127#true} assume !(0 == ~cond); {15127#true} is VALID [2022-04-27 13:16:17,944 INFO L290 TraceCheckUtils]: 9: Hoare triple {15127#true} assume true; {15127#true} is VALID [2022-04-27 13:16:17,944 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {15127#true} {15127#true} #94#return; {15127#true} is VALID [2022-04-27 13:16:17,944 INFO L290 TraceCheckUtils]: 11: Hoare triple {15127#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {15127#true} is VALID [2022-04-27 13:16:17,945 INFO L272 TraceCheckUtils]: 12: Hoare triple {15127#true} call assume_abort_if_not((if ~y~0 >= 0 && ~y~0 <= 50 then 1 else 0)); {15127#true} is VALID [2022-04-27 13:16:17,945 INFO L290 TraceCheckUtils]: 13: Hoare triple {15127#true} ~cond := #in~cond; {15127#true} is VALID [2022-04-27 13:16:17,945 INFO L290 TraceCheckUtils]: 14: Hoare triple {15127#true} assume !(0 == ~cond); {15127#true} is VALID [2022-04-27 13:16:17,945 INFO L290 TraceCheckUtils]: 15: Hoare triple {15127#true} assume true; {15127#true} is VALID [2022-04-27 13:16:17,945 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {15127#true} {15127#true} #96#return; {15127#true} is VALID [2022-04-27 13:16:17,945 INFO L272 TraceCheckUtils]: 17: Hoare triple {15127#true} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {15127#true} is VALID [2022-04-27 13:16:17,945 INFO L290 TraceCheckUtils]: 18: Hoare triple {15127#true} ~cond := #in~cond; {15127#true} is VALID [2022-04-27 13:16:17,945 INFO L290 TraceCheckUtils]: 19: Hoare triple {15127#true} assume !(0 == ~cond); {15127#true} is VALID [2022-04-27 13:16:17,945 INFO L290 TraceCheckUtils]: 20: Hoare triple {15127#true} assume true; {15127#true} is VALID [2022-04-27 13:16:17,945 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {15127#true} {15127#true} #98#return; {15127#true} is VALID [2022-04-27 13:16:17,945 INFO L272 TraceCheckUtils]: 22: Hoare triple {15127#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {15127#true} is VALID [2022-04-27 13:16:17,945 INFO L290 TraceCheckUtils]: 23: Hoare triple {15127#true} ~cond := #in~cond; {15127#true} is VALID [2022-04-27 13:16:17,945 INFO L290 TraceCheckUtils]: 24: Hoare triple {15127#true} assume !(0 == ~cond); {15127#true} is VALID [2022-04-27 13:16:17,945 INFO L290 TraceCheckUtils]: 25: Hoare triple {15127#true} assume true; {15127#true} is VALID [2022-04-27 13:16:17,945 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {15127#true} {15127#true} #100#return; {15127#true} is VALID [2022-04-27 13:16:17,946 INFO L290 TraceCheckUtils]: 27: Hoare triple {15127#true} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1; {15213#(and (= main_~r~0 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 13:16:17,946 INFO L290 TraceCheckUtils]: 28: Hoare triple {15213#(and (= main_~r~0 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; {15213#(and (= main_~r~0 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 13:16:17,947 INFO L290 TraceCheckUtils]: 29: Hoare triple {15213#(and (= main_~r~0 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 !!(0 != ~b~0);havoc ~c~0;havoc ~k~0;~c~0 := ~a~0;~k~0 := 0; {15220#(and (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~c~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-27 13:16:17,947 INFO L290 TraceCheckUtils]: 30: Hoare triple {15220#(and (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~c~0 main_~x~0) (= main_~p~0 1))} assume !false; {15220#(and (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~c~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-27 13:16:17,947 INFO L290 TraceCheckUtils]: 31: Hoare triple {15220#(and (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~c~0 main_~x~0) (= main_~p~0 1))} assume !(~c~0 >= ~b~0); {15227#(and (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (not (<= main_~b~0 main_~c~0)) (= main_~q~0 0) (= main_~c~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-27 13:16:17,948 INFO L290 TraceCheckUtils]: 32: Hoare triple {15227#(and (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (not (<= main_~b~0 main_~c~0)) (= main_~q~0 0) (= main_~c~0 main_~x~0) (= main_~p~0 1))} ~a~0 := ~b~0;~b~0 := ~c~0;havoc ~temp~0;~temp~0 := ~p~0;~p~0 := ~q~0;~q~0 := ~temp~0 - ~q~0 * ~k~0;~temp~0 := ~r~0;~r~0 := ~s~0;~s~0 := ~temp~0 - ~s~0 * ~k~0; {15231#(and (= main_~s~0 0) (= main_~p~0 0) (not (<= main_~a~0 main_~x~0)) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~b~0 main_~x~0) (= main_~q~0 1))} is VALID [2022-04-27 13:16:17,948 INFO L290 TraceCheckUtils]: 33: Hoare triple {15231#(and (= main_~s~0 0) (= main_~p~0 0) (not (<= main_~a~0 main_~x~0)) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~b~0 main_~x~0) (= main_~q~0 1))} assume !false; {15231#(and (= main_~s~0 0) (= main_~p~0 0) (not (<= main_~a~0 main_~x~0)) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~b~0 main_~x~0) (= main_~q~0 1))} is VALID [2022-04-27 13:16:17,949 INFO L290 TraceCheckUtils]: 34: Hoare triple {15231#(and (= main_~s~0 0) (= main_~p~0 0) (not (<= main_~a~0 main_~x~0)) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~b~0 main_~x~0) (= main_~q~0 1))} assume !!(0 != ~b~0);havoc ~c~0;havoc ~k~0;~c~0 := ~a~0;~k~0 := 0; {15238#(and (= main_~s~0 0) (= main_~p~0 0) (= main_~k~0 0) (= main_~c~0 main_~y~0) (= main_~r~0 1) (= main_~b~0 main_~x~0) (= main_~q~0 1) (not (<= main_~c~0 main_~x~0)))} is VALID [2022-04-27 13:16:17,949 INFO L290 TraceCheckUtils]: 35: Hoare triple {15238#(and (= main_~s~0 0) (= main_~p~0 0) (= main_~k~0 0) (= main_~c~0 main_~y~0) (= main_~r~0 1) (= main_~b~0 main_~x~0) (= main_~q~0 1) (not (<= main_~c~0 main_~x~0)))} assume !false; {15238#(and (= main_~s~0 0) (= main_~p~0 0) (= main_~k~0 0) (= main_~c~0 main_~y~0) (= main_~r~0 1) (= main_~b~0 main_~x~0) (= main_~q~0 1) (not (<= main_~c~0 main_~x~0)))} is VALID [2022-04-27 13:16:17,949 INFO L290 TraceCheckUtils]: 36: Hoare triple {15238#(and (= main_~s~0 0) (= main_~p~0 0) (= main_~k~0 0) (= main_~c~0 main_~y~0) (= main_~r~0 1) (= main_~b~0 main_~x~0) (= main_~q~0 1) (not (<= main_~c~0 main_~x~0)))} assume !!(~c~0 >= ~b~0);havoc ~d~0;havoc ~v~0;~d~0 := 1;~v~0 := ~b~0; {15245#(and (= main_~b~0 main_~v~0) (= main_~s~0 0) (= main_~p~0 0) (= main_~k~0 0) (= main_~c~0 main_~y~0) (= main_~r~0 1) (= main_~b~0 main_~x~0) (= main_~d~0 1) (= main_~q~0 1) (not (<= main_~c~0 main_~x~0)))} is VALID [2022-04-27 13:16:17,950 INFO L290 TraceCheckUtils]: 37: Hoare triple {15245#(and (= main_~b~0 main_~v~0) (= main_~s~0 0) (= main_~p~0 0) (= main_~k~0 0) (= main_~c~0 main_~y~0) (= main_~r~0 1) (= main_~b~0 main_~x~0) (= main_~d~0 1) (= main_~q~0 1) (not (<= main_~c~0 main_~x~0)))} assume !false; {15245#(and (= main_~b~0 main_~v~0) (= main_~s~0 0) (= main_~p~0 0) (= main_~k~0 0) (= main_~c~0 main_~y~0) (= main_~r~0 1) (= main_~b~0 main_~x~0) (= main_~d~0 1) (= main_~q~0 1) (not (<= main_~c~0 main_~x~0)))} is VALID [2022-04-27 13:16:17,950 INFO L272 TraceCheckUtils]: 38: Hoare triple {15245#(and (= main_~b~0 main_~v~0) (= main_~s~0 0) (= main_~p~0 0) (= main_~k~0 0) (= main_~c~0 main_~y~0) (= main_~r~0 1) (= main_~b~0 main_~x~0) (= main_~d~0 1) (= main_~q~0 1) (not (<= main_~c~0 main_~x~0)))} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {15127#true} is VALID [2022-04-27 13:16:17,950 INFO L290 TraceCheckUtils]: 39: Hoare triple {15127#true} ~cond := #in~cond; {15127#true} is VALID [2022-04-27 13:16:17,950 INFO L290 TraceCheckUtils]: 40: Hoare triple {15127#true} assume !(0 == ~cond); {15127#true} is VALID [2022-04-27 13:16:17,950 INFO L290 TraceCheckUtils]: 41: Hoare triple {15127#true} assume true; {15127#true} is VALID [2022-04-27 13:16:17,951 INFO L284 TraceCheckUtils]: 42: Hoare quadruple {15127#true} {15245#(and (= main_~b~0 main_~v~0) (= main_~s~0 0) (= main_~p~0 0) (= main_~k~0 0) (= main_~c~0 main_~y~0) (= main_~r~0 1) (= main_~b~0 main_~x~0) (= main_~d~0 1) (= main_~q~0 1) (not (<= main_~c~0 main_~x~0)))} #102#return; {15245#(and (= main_~b~0 main_~v~0) (= main_~s~0 0) (= main_~p~0 0) (= main_~k~0 0) (= main_~c~0 main_~y~0) (= main_~r~0 1) (= main_~b~0 main_~x~0) (= main_~d~0 1) (= main_~q~0 1) (not (<= main_~c~0 main_~x~0)))} is VALID [2022-04-27 13:16:17,951 INFO L272 TraceCheckUtils]: 43: Hoare triple {15245#(and (= main_~b~0 main_~v~0) (= main_~s~0 0) (= main_~p~0 0) (= main_~k~0 0) (= main_~c~0 main_~y~0) (= main_~r~0 1) (= main_~b~0 main_~x~0) (= main_~d~0 1) (= main_~q~0 1) (not (<= main_~c~0 main_~x~0)))} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {15127#true} is VALID [2022-04-27 13:16:17,951 INFO L290 TraceCheckUtils]: 44: Hoare triple {15127#true} ~cond := #in~cond; {15127#true} is VALID [2022-04-27 13:16:17,951 INFO L290 TraceCheckUtils]: 45: Hoare triple {15127#true} assume !(0 == ~cond); {15127#true} is VALID [2022-04-27 13:16:17,951 INFO L290 TraceCheckUtils]: 46: Hoare triple {15127#true} assume true; {15127#true} is VALID [2022-04-27 13:16:17,952 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {15127#true} {15245#(and (= main_~b~0 main_~v~0) (= main_~s~0 0) (= main_~p~0 0) (= main_~k~0 0) (= main_~c~0 main_~y~0) (= main_~r~0 1) (= main_~b~0 main_~x~0) (= main_~d~0 1) (= main_~q~0 1) (not (<= main_~c~0 main_~x~0)))} #104#return; {15245#(and (= main_~b~0 main_~v~0) (= main_~s~0 0) (= main_~p~0 0) (= main_~k~0 0) (= main_~c~0 main_~y~0) (= main_~r~0 1) (= main_~b~0 main_~x~0) (= main_~d~0 1) (= main_~q~0 1) (not (<= main_~c~0 main_~x~0)))} is VALID [2022-04-27 13:16:17,952 INFO L272 TraceCheckUtils]: 48: Hoare triple {15245#(and (= main_~b~0 main_~v~0) (= main_~s~0 0) (= main_~p~0 0) (= main_~k~0 0) (= main_~c~0 main_~y~0) (= main_~r~0 1) (= main_~b~0 main_~x~0) (= main_~d~0 1) (= main_~q~0 1) (not (<= main_~c~0 main_~x~0)))} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {15127#true} is VALID [2022-04-27 13:16:17,952 INFO L290 TraceCheckUtils]: 49: Hoare triple {15127#true} ~cond := #in~cond; {15127#true} is VALID [2022-04-27 13:16:17,952 INFO L290 TraceCheckUtils]: 50: Hoare triple {15127#true} assume !(0 == ~cond); {15127#true} is VALID [2022-04-27 13:16:17,952 INFO L290 TraceCheckUtils]: 51: Hoare triple {15127#true} assume true; {15127#true} is VALID [2022-04-27 13:16:17,953 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {15127#true} {15245#(and (= main_~b~0 main_~v~0) (= main_~s~0 0) (= main_~p~0 0) (= main_~k~0 0) (= main_~c~0 main_~y~0) (= main_~r~0 1) (= main_~b~0 main_~x~0) (= main_~d~0 1) (= main_~q~0 1) (not (<= main_~c~0 main_~x~0)))} #106#return; {15245#(and (= main_~b~0 main_~v~0) (= main_~s~0 0) (= main_~p~0 0) (= main_~k~0 0) (= main_~c~0 main_~y~0) (= main_~r~0 1) (= main_~b~0 main_~x~0) (= main_~d~0 1) (= main_~q~0 1) (not (<= main_~c~0 main_~x~0)))} is VALID [2022-04-27 13:16:17,953 INFO L272 TraceCheckUtils]: 53: Hoare triple {15245#(and (= main_~b~0 main_~v~0) (= main_~s~0 0) (= main_~p~0 0) (= main_~k~0 0) (= main_~c~0 main_~y~0) (= main_~r~0 1) (= main_~b~0 main_~x~0) (= main_~d~0 1) (= main_~q~0 1) (not (<= main_~c~0 main_~x~0)))} call __VERIFIER_assert((if ~v~0 == ~b~0 * ~d~0 then 1 else 0)); {15127#true} is VALID [2022-04-27 13:16:17,953 INFO L290 TraceCheckUtils]: 54: Hoare triple {15127#true} ~cond := #in~cond; {15127#true} is VALID [2022-04-27 13:16:17,953 INFO L290 TraceCheckUtils]: 55: Hoare triple {15127#true} assume !(0 == ~cond); {15127#true} is VALID [2022-04-27 13:16:17,953 INFO L290 TraceCheckUtils]: 56: Hoare triple {15127#true} assume true; {15127#true} is VALID [2022-04-27 13:16:17,954 INFO L284 TraceCheckUtils]: 57: Hoare quadruple {15127#true} {15245#(and (= main_~b~0 main_~v~0) (= main_~s~0 0) (= main_~p~0 0) (= main_~k~0 0) (= main_~c~0 main_~y~0) (= main_~r~0 1) (= main_~b~0 main_~x~0) (= main_~d~0 1) (= main_~q~0 1) (not (<= main_~c~0 main_~x~0)))} #108#return; {15245#(and (= main_~b~0 main_~v~0) (= main_~s~0 0) (= main_~p~0 0) (= main_~k~0 0) (= main_~c~0 main_~y~0) (= main_~r~0 1) (= main_~b~0 main_~x~0) (= main_~d~0 1) (= main_~q~0 1) (not (<= main_~c~0 main_~x~0)))} is VALID [2022-04-27 13:16:17,954 INFO L290 TraceCheckUtils]: 58: Hoare triple {15245#(and (= main_~b~0 main_~v~0) (= main_~s~0 0) (= main_~p~0 0) (= main_~k~0 0) (= main_~c~0 main_~y~0) (= main_~r~0 1) (= main_~b~0 main_~x~0) (= main_~d~0 1) (= main_~q~0 1) (not (<= main_~c~0 main_~x~0)))} assume !(~c~0 >= 2 * ~v~0); {15245#(and (= main_~b~0 main_~v~0) (= main_~s~0 0) (= main_~p~0 0) (= main_~k~0 0) (= main_~c~0 main_~y~0) (= main_~r~0 1) (= main_~b~0 main_~x~0) (= main_~d~0 1) (= main_~q~0 1) (not (<= main_~c~0 main_~x~0)))} is VALID [2022-04-27 13:16:17,955 INFO L290 TraceCheckUtils]: 59: Hoare triple {15245#(and (= main_~b~0 main_~v~0) (= main_~s~0 0) (= main_~p~0 0) (= main_~k~0 0) (= main_~c~0 main_~y~0) (= main_~r~0 1) (= main_~b~0 main_~x~0) (= main_~d~0 1) (= main_~q~0 1) (not (<= main_~c~0 main_~x~0)))} ~c~0 := ~c~0 - ~v~0;~k~0 := ~k~0 + ~d~0; {15315#(and (= main_~s~0 0) (= main_~p~0 0) (= main_~r~0 1) (= main_~b~0 main_~x~0) (= main_~k~0 1) (not (<= (+ main_~c~0 main_~b~0) main_~x~0)) (= main_~q~0 1) (= main_~y~0 (+ main_~c~0 main_~b~0)))} is VALID [2022-04-27 13:16:17,956 INFO L290 TraceCheckUtils]: 60: Hoare triple {15315#(and (= main_~s~0 0) (= main_~p~0 0) (= main_~r~0 1) (= main_~b~0 main_~x~0) (= main_~k~0 1) (not (<= (+ main_~c~0 main_~b~0) main_~x~0)) (= main_~q~0 1) (= main_~y~0 (+ main_~c~0 main_~b~0)))} assume !false; {15315#(and (= main_~s~0 0) (= main_~p~0 0) (= main_~r~0 1) (= main_~b~0 main_~x~0) (= main_~k~0 1) (not (<= (+ main_~c~0 main_~b~0) main_~x~0)) (= main_~q~0 1) (= main_~y~0 (+ main_~c~0 main_~b~0)))} is VALID [2022-04-27 13:16:17,956 INFO L290 TraceCheckUtils]: 61: Hoare triple {15315#(and (= main_~s~0 0) (= main_~p~0 0) (= main_~r~0 1) (= main_~b~0 main_~x~0) (= main_~k~0 1) (not (<= (+ main_~c~0 main_~b~0) main_~x~0)) (= main_~q~0 1) (= main_~y~0 (+ main_~c~0 main_~b~0)))} assume !(~c~0 >= ~b~0); {15322#(and (= main_~s~0 0) (= main_~p~0 0) (= main_~r~0 1) (= main_~b~0 main_~x~0) (= main_~k~0 1) (not (<= (+ main_~c~0 main_~b~0) main_~x~0)) (not (<= main_~b~0 main_~c~0)) (= main_~q~0 1) (= main_~y~0 (+ main_~c~0 main_~b~0)))} is VALID [2022-04-27 13:16:17,957 INFO L290 TraceCheckUtils]: 62: Hoare triple {15322#(and (= main_~s~0 0) (= main_~p~0 0) (= main_~r~0 1) (= main_~b~0 main_~x~0) (= main_~k~0 1) (not (<= (+ main_~c~0 main_~b~0) main_~x~0)) (not (<= main_~b~0 main_~c~0)) (= main_~q~0 1) (= main_~y~0 (+ main_~c~0 main_~b~0)))} ~a~0 := ~b~0;~b~0 := ~c~0;havoc ~temp~0;~temp~0 := ~p~0;~p~0 := ~q~0;~q~0 := ~temp~0 - ~q~0 * ~k~0;~temp~0 := ~r~0;~r~0 := ~s~0;~s~0 := ~temp~0 - ~s~0 * ~k~0; {15326#(and (not (<= main_~y~0 main_~x~0)) (= main_~s~0 1) (<= main_~a~0 main_~x~0) (not (<= (* main_~x~0 2) main_~y~0)) (= main_~b~0 (+ main_~y~0 (* (- 1) main_~x~0))) (= (* (- 1) main_~q~0) 1))} is VALID [2022-04-27 13:16:17,958 INFO L290 TraceCheckUtils]: 63: Hoare triple {15326#(and (not (<= main_~y~0 main_~x~0)) (= main_~s~0 1) (<= main_~a~0 main_~x~0) (not (<= (* main_~x~0 2) main_~y~0)) (= main_~b~0 (+ main_~y~0 (* (- 1) main_~x~0))) (= (* (- 1) main_~q~0) 1))} assume !false; {15326#(and (not (<= main_~y~0 main_~x~0)) (= main_~s~0 1) (<= main_~a~0 main_~x~0) (not (<= (* main_~x~0 2) main_~y~0)) (= main_~b~0 (+ main_~y~0 (* (- 1) main_~x~0))) (= (* (- 1) main_~q~0) 1))} is VALID [2022-04-27 13:16:17,958 INFO L290 TraceCheckUtils]: 64: Hoare triple {15326#(and (not (<= main_~y~0 main_~x~0)) (= main_~s~0 1) (<= main_~a~0 main_~x~0) (not (<= (* main_~x~0 2) main_~y~0)) (= main_~b~0 (+ main_~y~0 (* (- 1) main_~x~0))) (= (* (- 1) main_~q~0) 1))} assume !!(0 != ~b~0);havoc ~c~0;havoc ~k~0;~c~0 := ~a~0;~k~0 := 0; {15333#(and (<= main_~c~0 main_~x~0) (not (<= main_~y~0 main_~x~0)) (= main_~s~0 1) (not (<= (* main_~x~0 2) main_~y~0)) (= main_~b~0 (+ main_~y~0 (* (- 1) main_~x~0))) (= (* (- 1) main_~q~0) 1))} is VALID [2022-04-27 13:16:17,959 INFO L290 TraceCheckUtils]: 65: Hoare triple {15333#(and (<= main_~c~0 main_~x~0) (not (<= main_~y~0 main_~x~0)) (= main_~s~0 1) (not (<= (* main_~x~0 2) main_~y~0)) (= main_~b~0 (+ main_~y~0 (* (- 1) main_~x~0))) (= (* (- 1) main_~q~0) 1))} assume !false; {15333#(and (<= main_~c~0 main_~x~0) (not (<= main_~y~0 main_~x~0)) (= main_~s~0 1) (not (<= (* main_~x~0 2) main_~y~0)) (= main_~b~0 (+ main_~y~0 (* (- 1) main_~x~0))) (= (* (- 1) main_~q~0) 1))} is VALID [2022-04-27 13:16:17,959 INFO L290 TraceCheckUtils]: 66: Hoare triple {15333#(and (<= main_~c~0 main_~x~0) (not (<= main_~y~0 main_~x~0)) (= main_~s~0 1) (not (<= (* main_~x~0 2) main_~y~0)) (= main_~b~0 (+ main_~y~0 (* (- 1) main_~x~0))) (= (* (- 1) main_~q~0) 1))} assume !!(~c~0 >= ~b~0);havoc ~d~0;havoc ~v~0;~d~0 := 1;~v~0 := ~b~0; {15340#(and (= main_~y~0 (+ main_~b~0 main_~x~0)) (< main_~y~0 (* main_~x~0 2)) (= main_~s~0 1) (< main_~x~0 main_~y~0) (= (+ main_~q~0 1) 0))} is VALID [2022-04-27 13:16:17,959 INFO L290 TraceCheckUtils]: 67: Hoare triple {15340#(and (= main_~y~0 (+ main_~b~0 main_~x~0)) (< main_~y~0 (* main_~x~0 2)) (= main_~s~0 1) (< main_~x~0 main_~y~0) (= (+ main_~q~0 1) 0))} assume !false; {15340#(and (= main_~y~0 (+ main_~b~0 main_~x~0)) (< main_~y~0 (* main_~x~0 2)) (= main_~s~0 1) (< main_~x~0 main_~y~0) (= (+ main_~q~0 1) 0))} is VALID [2022-04-27 13:16:17,959 INFO L272 TraceCheckUtils]: 68: Hoare triple {15340#(and (= main_~y~0 (+ main_~b~0 main_~x~0)) (< main_~y~0 (* main_~x~0 2)) (= main_~s~0 1) (< main_~x~0 main_~y~0) (= (+ main_~q~0 1) 0))} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {15127#true} is VALID [2022-04-27 13:16:17,960 INFO L290 TraceCheckUtils]: 69: Hoare triple {15127#true} ~cond := #in~cond; {15127#true} is VALID [2022-04-27 13:16:17,960 INFO L290 TraceCheckUtils]: 70: Hoare triple {15127#true} assume !(0 == ~cond); {15127#true} is VALID [2022-04-27 13:16:17,960 INFO L290 TraceCheckUtils]: 71: Hoare triple {15127#true} assume true; {15127#true} is VALID [2022-04-27 13:16:17,960 INFO L284 TraceCheckUtils]: 72: Hoare quadruple {15127#true} {15340#(and (= main_~y~0 (+ main_~b~0 main_~x~0)) (< main_~y~0 (* main_~x~0 2)) (= main_~s~0 1) (< main_~x~0 main_~y~0) (= (+ main_~q~0 1) 0))} #102#return; {15340#(and (= main_~y~0 (+ main_~b~0 main_~x~0)) (< main_~y~0 (* main_~x~0 2)) (= main_~s~0 1) (< main_~x~0 main_~y~0) (= (+ main_~q~0 1) 0))} is VALID [2022-04-27 13:16:17,961 INFO L272 TraceCheckUtils]: 73: Hoare triple {15340#(and (= main_~y~0 (+ main_~b~0 main_~x~0)) (< main_~y~0 (* main_~x~0 2)) (= main_~s~0 1) (< main_~x~0 main_~y~0) (= (+ main_~q~0 1) 0))} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {15362#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 13:16:17,961 INFO L290 TraceCheckUtils]: 74: Hoare triple {15362#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {15366#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 13:16:17,962 INFO L290 TraceCheckUtils]: 75: Hoare triple {15366#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {15128#false} is VALID [2022-04-27 13:16:17,962 INFO L290 TraceCheckUtils]: 76: Hoare triple {15128#false} assume !false; {15128#false} is VALID [2022-04-27 13:16:17,962 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 10 proven. 22 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2022-04-27 13:16:17,962 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 13:16:19,455 INFO L290 TraceCheckUtils]: 76: Hoare triple {15128#false} assume !false; {15128#false} is VALID [2022-04-27 13:16:19,455 INFO L290 TraceCheckUtils]: 75: Hoare triple {15366#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {15128#false} is VALID [2022-04-27 13:16:19,456 INFO L290 TraceCheckUtils]: 74: Hoare triple {15362#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {15366#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 13:16:19,456 INFO L272 TraceCheckUtils]: 73: Hoare triple {15382#(= 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)); {15362#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 13:16:19,457 INFO L284 TraceCheckUtils]: 72: Hoare quadruple {15127#true} {15382#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} #102#return; {15382#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} is VALID [2022-04-27 13:16:19,457 INFO L290 TraceCheckUtils]: 71: Hoare triple {15127#true} assume true; {15127#true} is VALID [2022-04-27 13:16:19,457 INFO L290 TraceCheckUtils]: 70: Hoare triple {15127#true} assume !(0 == ~cond); {15127#true} is VALID [2022-04-27 13:16:19,457 INFO L290 TraceCheckUtils]: 69: Hoare triple {15127#true} ~cond := #in~cond; {15127#true} is VALID [2022-04-27 13:16:19,457 INFO L272 TraceCheckUtils]: 68: Hoare triple {15382#(= 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)); {15127#true} is VALID [2022-04-27 13:16:19,457 INFO L290 TraceCheckUtils]: 67: Hoare triple {15382#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} assume !false; {15382#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} is VALID [2022-04-27 13:16:19,458 INFO L290 TraceCheckUtils]: 66: Hoare triple {15404#(or (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (not (<= main_~b~0 main_~c~0)))} assume !!(~c~0 >= ~b~0);havoc ~d~0;havoc ~v~0;~d~0 := 1;~v~0 := ~b~0; {15382#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} is VALID [2022-04-27 13:16:19,458 INFO L290 TraceCheckUtils]: 65: Hoare triple {15404#(or (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (not (<= main_~b~0 main_~c~0)))} assume !false; {15404#(or (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (not (<= main_~b~0 main_~c~0)))} is VALID [2022-04-27 13:16:19,459 INFO L290 TraceCheckUtils]: 64: Hoare triple {15411#(or (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (< main_~a~0 main_~b~0))} assume !!(0 != ~b~0);havoc ~c~0;havoc ~k~0;~c~0 := ~a~0;~k~0 := 0; {15404#(or (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (not (<= main_~b~0 main_~c~0)))} is VALID [2022-04-27 13:16:19,459 INFO L290 TraceCheckUtils]: 63: Hoare triple {15411#(or (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (< main_~a~0 main_~b~0))} assume !false; {15411#(or (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (< main_~a~0 main_~b~0))} is VALID [2022-04-27 13:16:21,460 WARN L290 TraceCheckUtils]: 62: Hoare triple {15418#(or (= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) main_~c~0) (< main_~b~0 main_~c~0))} ~a~0 := ~b~0;~b~0 := ~c~0;havoc ~temp~0;~temp~0 := ~p~0;~p~0 := ~q~0;~q~0 := ~temp~0 - ~q~0 * ~k~0;~temp~0 := ~r~0;~r~0 := ~s~0;~s~0 := ~temp~0 - ~s~0 * ~k~0; {15411#(or (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (< main_~a~0 main_~b~0))} is UNKNOWN [2022-04-27 13:16:21,461 INFO L290 TraceCheckUtils]: 61: Hoare triple {15422#(or (= (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)) (+ (* main_~k~0 main_~y~0 main_~s~0) main_~c~0 (* main_~q~0 main_~k~0 main_~x~0))) (<= main_~b~0 main_~c~0))} assume !(~c~0 >= ~b~0); {15418#(or (= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) main_~c~0) (< main_~b~0 main_~c~0))} is VALID [2022-04-27 13:16:21,461 INFO L290 TraceCheckUtils]: 60: Hoare triple {15422#(or (= (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)) (+ (* main_~k~0 main_~y~0 main_~s~0) main_~c~0 (* main_~q~0 main_~k~0 main_~x~0))) (<= main_~b~0 main_~c~0))} assume !false; {15422#(or (= (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)) (+ (* main_~k~0 main_~y~0 main_~s~0) main_~c~0 (* main_~q~0 main_~k~0 main_~x~0))) (<= main_~b~0 main_~c~0))} is VALID [2022-04-27 13:16:22,438 INFO L290 TraceCheckUtils]: 59: Hoare triple {15429#(or (<= (+ main_~b~0 main_~v~0) main_~c~0) (= (+ main_~c~0 (* (- 1) main_~v~0) (* main_~y~0 main_~s~0 (+ main_~d~0 main_~k~0)) (* main_~q~0 main_~x~0 (+ main_~d~0 main_~k~0))) (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))))} ~c~0 := ~c~0 - ~v~0;~k~0 := ~k~0 + ~d~0; {15422#(or (= (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)) (+ (* main_~k~0 main_~y~0 main_~s~0) main_~c~0 (* main_~q~0 main_~k~0 main_~x~0))) (<= main_~b~0 main_~c~0))} is VALID [2022-04-27 13:16:22,439 INFO L290 TraceCheckUtils]: 58: Hoare triple {15429#(or (<= (+ main_~b~0 main_~v~0) main_~c~0) (= (+ main_~c~0 (* (- 1) main_~v~0) (* main_~y~0 main_~s~0 (+ main_~d~0 main_~k~0)) (* main_~q~0 main_~x~0 (+ main_~d~0 main_~k~0))) (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))))} assume !(~c~0 >= 2 * ~v~0); {15429#(or (<= (+ main_~b~0 main_~v~0) main_~c~0) (= (+ main_~c~0 (* (- 1) main_~v~0) (* main_~y~0 main_~s~0 (+ main_~d~0 main_~k~0)) (* main_~q~0 main_~x~0 (+ main_~d~0 main_~k~0))) (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))))} is VALID [2022-04-27 13:16:22,440 INFO L284 TraceCheckUtils]: 57: Hoare quadruple {15127#true} {15429#(or (<= (+ main_~b~0 main_~v~0) main_~c~0) (= (+ main_~c~0 (* (- 1) main_~v~0) (* main_~y~0 main_~s~0 (+ main_~d~0 main_~k~0)) (* main_~q~0 main_~x~0 (+ main_~d~0 main_~k~0))) (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))))} #108#return; {15429#(or (<= (+ main_~b~0 main_~v~0) main_~c~0) (= (+ main_~c~0 (* (- 1) main_~v~0) (* main_~y~0 main_~s~0 (+ main_~d~0 main_~k~0)) (* main_~q~0 main_~x~0 (+ main_~d~0 main_~k~0))) (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))))} is VALID [2022-04-27 13:16:22,440 INFO L290 TraceCheckUtils]: 56: Hoare triple {15127#true} assume true; {15127#true} is VALID [2022-04-27 13:16:22,440 INFO L290 TraceCheckUtils]: 55: Hoare triple {15127#true} assume !(0 == ~cond); {15127#true} is VALID [2022-04-27 13:16:22,440 INFO L290 TraceCheckUtils]: 54: Hoare triple {15127#true} ~cond := #in~cond; {15127#true} is VALID [2022-04-27 13:16:22,440 INFO L272 TraceCheckUtils]: 53: Hoare triple {15429#(or (<= (+ main_~b~0 main_~v~0) main_~c~0) (= (+ main_~c~0 (* (- 1) main_~v~0) (* main_~y~0 main_~s~0 (+ main_~d~0 main_~k~0)) (* main_~q~0 main_~x~0 (+ main_~d~0 main_~k~0))) (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))))} call __VERIFIER_assert((if ~v~0 == ~b~0 * ~d~0 then 1 else 0)); {15127#true} is VALID [2022-04-27 13:16:22,441 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {15127#true} {15429#(or (<= (+ main_~b~0 main_~v~0) main_~c~0) (= (+ main_~c~0 (* (- 1) main_~v~0) (* main_~y~0 main_~s~0 (+ main_~d~0 main_~k~0)) (* main_~q~0 main_~x~0 (+ main_~d~0 main_~k~0))) (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))))} #106#return; {15429#(or (<= (+ main_~b~0 main_~v~0) main_~c~0) (= (+ main_~c~0 (* (- 1) main_~v~0) (* main_~y~0 main_~s~0 (+ main_~d~0 main_~k~0)) (* main_~q~0 main_~x~0 (+ main_~d~0 main_~k~0))) (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))))} is VALID [2022-04-27 13:16:22,441 INFO L290 TraceCheckUtils]: 51: Hoare triple {15127#true} assume true; {15127#true} is VALID [2022-04-27 13:16:22,441 INFO L290 TraceCheckUtils]: 50: Hoare triple {15127#true} assume !(0 == ~cond); {15127#true} is VALID [2022-04-27 13:16:22,441 INFO L290 TraceCheckUtils]: 49: Hoare triple {15127#true} ~cond := #in~cond; {15127#true} is VALID [2022-04-27 13:16:22,441 INFO L272 TraceCheckUtils]: 48: Hoare triple {15429#(or (<= (+ main_~b~0 main_~v~0) main_~c~0) (= (+ main_~c~0 (* (- 1) main_~v~0) (* main_~y~0 main_~s~0 (+ main_~d~0 main_~k~0)) (* main_~q~0 main_~x~0 (+ main_~d~0 main_~k~0))) (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))))} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {15127#true} is VALID [2022-04-27 13:16:22,442 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {15127#true} {15429#(or (<= (+ main_~b~0 main_~v~0) main_~c~0) (= (+ main_~c~0 (* (- 1) main_~v~0) (* main_~y~0 main_~s~0 (+ main_~d~0 main_~k~0)) (* main_~q~0 main_~x~0 (+ main_~d~0 main_~k~0))) (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))))} #104#return; {15429#(or (<= (+ main_~b~0 main_~v~0) main_~c~0) (= (+ main_~c~0 (* (- 1) main_~v~0) (* main_~y~0 main_~s~0 (+ main_~d~0 main_~k~0)) (* main_~q~0 main_~x~0 (+ main_~d~0 main_~k~0))) (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))))} is VALID [2022-04-27 13:16:22,442 INFO L290 TraceCheckUtils]: 46: Hoare triple {15127#true} assume true; {15127#true} is VALID [2022-04-27 13:16:22,442 INFO L290 TraceCheckUtils]: 45: Hoare triple {15127#true} assume !(0 == ~cond); {15127#true} is VALID [2022-04-27 13:16:22,442 INFO L290 TraceCheckUtils]: 44: Hoare triple {15127#true} ~cond := #in~cond; {15127#true} is VALID [2022-04-27 13:16:22,442 INFO L272 TraceCheckUtils]: 43: Hoare triple {15429#(or (<= (+ main_~b~0 main_~v~0) main_~c~0) (= (+ main_~c~0 (* (- 1) main_~v~0) (* main_~y~0 main_~s~0 (+ main_~d~0 main_~k~0)) (* main_~q~0 main_~x~0 (+ main_~d~0 main_~k~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)); {15127#true} is VALID [2022-04-27 13:16:22,443 INFO L284 TraceCheckUtils]: 42: Hoare quadruple {15127#true} {15429#(or (<= (+ main_~b~0 main_~v~0) main_~c~0) (= (+ main_~c~0 (* (- 1) main_~v~0) (* main_~y~0 main_~s~0 (+ main_~d~0 main_~k~0)) (* main_~q~0 main_~x~0 (+ main_~d~0 main_~k~0))) (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))))} #102#return; {15429#(or (<= (+ main_~b~0 main_~v~0) main_~c~0) (= (+ main_~c~0 (* (- 1) main_~v~0) (* main_~y~0 main_~s~0 (+ main_~d~0 main_~k~0)) (* main_~q~0 main_~x~0 (+ main_~d~0 main_~k~0))) (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))))} is VALID [2022-04-27 13:16:22,443 INFO L290 TraceCheckUtils]: 41: Hoare triple {15127#true} assume true; {15127#true} is VALID [2022-04-27 13:16:22,443 INFO L290 TraceCheckUtils]: 40: Hoare triple {15127#true} assume !(0 == ~cond); {15127#true} is VALID [2022-04-27 13:16:22,443 INFO L290 TraceCheckUtils]: 39: Hoare triple {15127#true} ~cond := #in~cond; {15127#true} is VALID [2022-04-27 13:16:22,443 INFO L272 TraceCheckUtils]: 38: Hoare triple {15429#(or (<= (+ main_~b~0 main_~v~0) main_~c~0) (= (+ main_~c~0 (* (- 1) main_~v~0) (* main_~y~0 main_~s~0 (+ main_~d~0 main_~k~0)) (* main_~q~0 main_~x~0 (+ main_~d~0 main_~k~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)); {15127#true} is VALID [2022-04-27 13:16:22,443 INFO L290 TraceCheckUtils]: 37: Hoare triple {15429#(or (<= (+ main_~b~0 main_~v~0) main_~c~0) (= (+ main_~c~0 (* (- 1) main_~v~0) (* main_~y~0 main_~s~0 (+ main_~d~0 main_~k~0)) (* main_~q~0 main_~x~0 (+ main_~d~0 main_~k~0))) (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))))} assume !false; {15429#(or (<= (+ main_~b~0 main_~v~0) main_~c~0) (= (+ main_~c~0 (* (- 1) main_~v~0) (* main_~y~0 main_~s~0 (+ main_~d~0 main_~k~0)) (* main_~q~0 main_~x~0 (+ main_~d~0 main_~k~0))) (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))))} is VALID [2022-04-27 13:16:22,444 INFO L290 TraceCheckUtils]: 36: Hoare triple {15499#(or (<= (* main_~b~0 2) main_~c~0) (= (+ (* (+ main_~k~0 1) main_~q~0 main_~x~0) (* (+ main_~k~0 1) main_~y~0 main_~s~0) main_~c~0 (* (- 1) main_~b~0)) (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))))} assume !!(~c~0 >= ~b~0);havoc ~d~0;havoc ~v~0;~d~0 := 1;~v~0 := ~b~0; {15429#(or (<= (+ main_~b~0 main_~v~0) main_~c~0) (= (+ main_~c~0 (* (- 1) main_~v~0) (* main_~y~0 main_~s~0 (+ main_~d~0 main_~k~0)) (* main_~q~0 main_~x~0 (+ main_~d~0 main_~k~0))) (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))))} is VALID [2022-04-27 13:16:22,444 INFO L290 TraceCheckUtils]: 35: Hoare triple {15499#(or (<= (* main_~b~0 2) main_~c~0) (= (+ (* (+ main_~k~0 1) main_~q~0 main_~x~0) (* (+ main_~k~0 1) main_~y~0 main_~s~0) main_~c~0 (* (- 1) main_~b~0)) (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))))} assume !false; {15499#(or (<= (* main_~b~0 2) main_~c~0) (= (+ (* (+ main_~k~0 1) main_~q~0 main_~x~0) (* (+ main_~k~0 1) main_~y~0 main_~s~0) main_~c~0 (* (- 1) main_~b~0)) (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))))} is VALID [2022-04-27 13:16:22,445 INFO L290 TraceCheckUtils]: 34: Hoare triple {15506#(or (= (+ main_~a~0 (* (- 1) main_~b~0) (* main_~q~0 main_~x~0 1) (* main_~y~0 main_~s~0 1)) (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))) (<= (* main_~b~0 2) main_~a~0))} assume !!(0 != ~b~0);havoc ~c~0;havoc ~k~0;~c~0 := ~a~0;~k~0 := 0; {15499#(or (<= (* main_~b~0 2) main_~c~0) (= (+ (* (+ main_~k~0 1) main_~q~0 main_~x~0) (* (+ main_~k~0 1) main_~y~0 main_~s~0) main_~c~0 (* (- 1) main_~b~0)) (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))))} is VALID [2022-04-27 13:16:22,445 INFO L290 TraceCheckUtils]: 33: Hoare triple {15506#(or (= (+ main_~a~0 (* (- 1) main_~b~0) (* main_~q~0 main_~x~0 1) (* main_~y~0 main_~s~0 1)) (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))) (<= (* main_~b~0 2) main_~a~0))} assume !false; {15506#(or (= (+ main_~a~0 (* (- 1) main_~b~0) (* main_~q~0 main_~x~0 1) (* main_~y~0 main_~s~0 1)) (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))) (<= (* main_~b~0 2) main_~a~0))} is VALID [2022-04-27 13:16:24,447 WARN L290 TraceCheckUtils]: 32: Hoare triple {15513#(or (<= (* main_~c~0 2) main_~b~0) (= (+ (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0 1) (* (- 1) main_~c~0) (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0 1) main_~b~0) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))))} ~a~0 := ~b~0;~b~0 := ~c~0;havoc ~temp~0;~temp~0 := ~p~0;~p~0 := ~q~0;~q~0 := ~temp~0 - ~q~0 * ~k~0;~temp~0 := ~r~0;~r~0 := ~s~0;~s~0 := ~temp~0 - ~s~0 * ~k~0; {15506#(or (= (+ main_~a~0 (* (- 1) main_~b~0) (* main_~q~0 main_~x~0 1) (* main_~y~0 main_~s~0 1)) (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))) (<= (* main_~b~0 2) main_~a~0))} is UNKNOWN [2022-04-27 13:16:24,448 INFO L290 TraceCheckUtils]: 31: Hoare triple {15517#(or (<= (* main_~c~0 2) main_~b~0) (<= main_~b~0 main_~c~0) (= (+ (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0 1) (* (- 1) main_~c~0) (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0 1) main_~b~0) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))))} assume !(~c~0 >= ~b~0); {15513#(or (<= (* main_~c~0 2) main_~b~0) (= (+ (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0 1) (* (- 1) main_~c~0) (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0 1) main_~b~0) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))))} is VALID [2022-04-27 13:16:24,449 INFO L290 TraceCheckUtils]: 30: Hoare triple {15517#(or (<= (* main_~c~0 2) main_~b~0) (<= main_~b~0 main_~c~0) (= (+ (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0 1) (* (- 1) main_~c~0) (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0 1) main_~b~0) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))))} assume !false; {15517#(or (<= (* main_~c~0 2) main_~b~0) (<= main_~b~0 main_~c~0) (= (+ (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0 1) (* (- 1) main_~c~0) (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0 1) main_~b~0) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))))} is VALID [2022-04-27 13:16:24,449 INFO L290 TraceCheckUtils]: 29: Hoare triple {15524#(or (<= main_~b~0 main_~a~0) (<= (* main_~a~0 2) main_~b~0) (= (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)) (+ (* (- 1) main_~a~0) (* main_~y~0 main_~r~0 1) (* main_~p~0 main_~x~0 1) main_~b~0)))} assume !!(0 != ~b~0);havoc ~c~0;havoc ~k~0;~c~0 := ~a~0;~k~0 := 0; {15517#(or (<= (* main_~c~0 2) main_~b~0) (<= main_~b~0 main_~c~0) (= (+ (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0 1) (* (- 1) main_~c~0) (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0 1) main_~b~0) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))))} is VALID [2022-04-27 13:16:24,450 INFO L290 TraceCheckUtils]: 28: Hoare triple {15524#(or (<= main_~b~0 main_~a~0) (<= (* main_~a~0 2) main_~b~0) (= (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)) (+ (* (- 1) main_~a~0) (* main_~y~0 main_~r~0 1) (* main_~p~0 main_~x~0 1) main_~b~0)))} assume !false; {15524#(or (<= main_~b~0 main_~a~0) (<= (* main_~a~0 2) main_~b~0) (= (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)) (+ (* (- 1) main_~a~0) (* main_~y~0 main_~r~0 1) (* main_~p~0 main_~x~0 1) main_~b~0)))} is VALID [2022-04-27 13:16:24,450 INFO L290 TraceCheckUtils]: 27: Hoare triple {15127#true} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1; {15524#(or (<= main_~b~0 main_~a~0) (<= (* main_~a~0 2) main_~b~0) (= (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)) (+ (* (- 1) main_~a~0) (* main_~y~0 main_~r~0 1) (* main_~p~0 main_~x~0 1) main_~b~0)))} is VALID [2022-04-27 13:16:24,450 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {15127#true} {15127#true} #100#return; {15127#true} is VALID [2022-04-27 13:16:24,450 INFO L290 TraceCheckUtils]: 25: Hoare triple {15127#true} assume true; {15127#true} is VALID [2022-04-27 13:16:24,450 INFO L290 TraceCheckUtils]: 24: Hoare triple {15127#true} assume !(0 == ~cond); {15127#true} is VALID [2022-04-27 13:16:24,450 INFO L290 TraceCheckUtils]: 23: Hoare triple {15127#true} ~cond := #in~cond; {15127#true} is VALID [2022-04-27 13:16:24,450 INFO L272 TraceCheckUtils]: 22: Hoare triple {15127#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {15127#true} is VALID [2022-04-27 13:16:24,450 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {15127#true} {15127#true} #98#return; {15127#true} is VALID [2022-04-27 13:16:24,451 INFO L290 TraceCheckUtils]: 20: Hoare triple {15127#true} assume true; {15127#true} is VALID [2022-04-27 13:16:24,451 INFO L290 TraceCheckUtils]: 19: Hoare triple {15127#true} assume !(0 == ~cond); {15127#true} is VALID [2022-04-27 13:16:24,451 INFO L290 TraceCheckUtils]: 18: Hoare triple {15127#true} ~cond := #in~cond; {15127#true} is VALID [2022-04-27 13:16:24,451 INFO L272 TraceCheckUtils]: 17: Hoare triple {15127#true} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {15127#true} is VALID [2022-04-27 13:16:24,451 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {15127#true} {15127#true} #96#return; {15127#true} is VALID [2022-04-27 13:16:24,451 INFO L290 TraceCheckUtils]: 15: Hoare triple {15127#true} assume true; {15127#true} is VALID [2022-04-27 13:16:24,451 INFO L290 TraceCheckUtils]: 14: Hoare triple {15127#true} assume !(0 == ~cond); {15127#true} is VALID [2022-04-27 13:16:24,451 INFO L290 TraceCheckUtils]: 13: Hoare triple {15127#true} ~cond := #in~cond; {15127#true} is VALID [2022-04-27 13:16:24,451 INFO L272 TraceCheckUtils]: 12: Hoare triple {15127#true} call assume_abort_if_not((if ~y~0 >= 0 && ~y~0 <= 50 then 1 else 0)); {15127#true} is VALID [2022-04-27 13:16:24,451 INFO L290 TraceCheckUtils]: 11: Hoare triple {15127#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {15127#true} is VALID [2022-04-27 13:16:24,451 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {15127#true} {15127#true} #94#return; {15127#true} is VALID [2022-04-27 13:16:24,451 INFO L290 TraceCheckUtils]: 9: Hoare triple {15127#true} assume true; {15127#true} is VALID [2022-04-27 13:16:24,451 INFO L290 TraceCheckUtils]: 8: Hoare triple {15127#true} assume !(0 == ~cond); {15127#true} is VALID [2022-04-27 13:16:24,451 INFO L290 TraceCheckUtils]: 7: Hoare triple {15127#true} ~cond := #in~cond; {15127#true} is VALID [2022-04-27 13:16:24,451 INFO L272 TraceCheckUtils]: 6: Hoare triple {15127#true} call assume_abort_if_not((if ~x~0 >= 0 && ~x~0 <= 50 then 1 else 0)); {15127#true} is VALID [2022-04-27 13:16:24,451 INFO L290 TraceCheckUtils]: 5: Hoare triple {15127#true} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~s~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4; {15127#true} is VALID [2022-04-27 13:16:24,452 INFO L272 TraceCheckUtils]: 4: Hoare triple {15127#true} call #t~ret6 := main(); {15127#true} is VALID [2022-04-27 13:16:24,452 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {15127#true} {15127#true} #112#return; {15127#true} is VALID [2022-04-27 13:16:24,452 INFO L290 TraceCheckUtils]: 2: Hoare triple {15127#true} assume true; {15127#true} is VALID [2022-04-27 13:16:24,452 INFO L290 TraceCheckUtils]: 1: Hoare triple {15127#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(11, 2);call #Ultimate.allocInit(12, 3); {15127#true} is VALID [2022-04-27 13:16:24,452 INFO L272 TraceCheckUtils]: 0: Hoare triple {15127#true} call ULTIMATE.init(); {15127#true} is VALID [2022-04-27 13:16:24,452 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 14 proven. 18 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2022-04-27 13:16:24,452 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 13:16:24,452 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1102562806] [2022-04-27 13:16:24,452 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 13:16:24,452 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [748899277] [2022-04-27 13:16:24,452 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [748899277] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 13:16:24,453 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-27 13:16:24,453 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 26 [2022-04-27 13:16:24,453 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1719177636] [2022-04-27 13:16:24,453 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-27 13:16:24,453 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 2.1153846153846154) internal successors, (55), 25 states have internal predecessors, (55), 5 states have call successors, (18), 2 states have call predecessors, (18), 1 states have return successors, (15), 5 states have call predecessors, (15), 5 states have call successors, (15) Word has length 77 [2022-04-27 13:16:24,454 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 13:16:24,454 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 26 states, 26 states have (on average 2.1153846153846154) internal successors, (55), 25 states have internal predecessors, (55), 5 states have call successors, (18), 2 states have call predecessors, (18), 1 states have return successors, (15), 5 states have call predecessors, (15), 5 states have call successors, (15) [2022-04-27 13:16:25,349 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 88 edges. 88 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 13:16:25,350 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2022-04-27 13:16:25,350 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 13:16:25,350 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2022-04-27 13:16:25,350 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=128, Invalid=522, Unknown=0, NotChecked=0, Total=650 [2022-04-27 13:16:25,351 INFO L87 Difference]: Start difference. First operand 257 states and 347 transitions. Second operand has 26 states, 26 states have (on average 2.1153846153846154) internal successors, (55), 25 states have internal predecessors, (55), 5 states have call successors, (18), 2 states have call predecessors, (18), 1 states have return successors, (15), 5 states have call predecessors, (15), 5 states have call successors, (15) [2022-04-27 13:16:45,617 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-27 13:17:07,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:17:07,376 INFO L93 Difference]: Finished difference Result 424 states and 583 transitions. [2022-04-27 13:17:07,376 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2022-04-27 13:17:07,376 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 2.1153846153846154) internal successors, (55), 25 states have internal predecessors, (55), 5 states have call successors, (18), 2 states have call predecessors, (18), 1 states have return successors, (15), 5 states have call predecessors, (15), 5 states have call successors, (15) Word has length 77 [2022-04-27 13:17:07,377 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 13:17:07,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 26 states have (on average 2.1153846153846154) internal successors, (55), 25 states have internal predecessors, (55), 5 states have call successors, (18), 2 states have call predecessors, (18), 1 states have return successors, (15), 5 states have call predecessors, (15), 5 states have call successors, (15) [2022-04-27 13:17:07,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 263 transitions. [2022-04-27 13:17:07,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 26 states have (on average 2.1153846153846154) internal successors, (55), 25 states have internal predecessors, (55), 5 states have call successors, (18), 2 states have call predecessors, (18), 1 states have return successors, (15), 5 states have call predecessors, (15), 5 states have call successors, (15) [2022-04-27 13:17:07,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 263 transitions. [2022-04-27 13:17:07,386 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 36 states and 263 transitions. [2022-04-27 13:17:10,873 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 263 edges. 263 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 13:17:10,883 INFO L225 Difference]: With dead ends: 424 [2022-04-27 13:17:10,883 INFO L226 Difference]: Without dead ends: 422 [2022-04-27 13:17:10,885 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 184 GetRequests, 128 SyntacticMatches, 2 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 745 ImplicationChecksByTransitivity, 13.7s TimeCoverageRelationStatistics Valid=692, Invalid=2388, Unknown=0, NotChecked=0, Total=3080 [2022-04-27 13:17:10,885 INFO L413 NwaCegarLoop]: 75 mSDtfsCounter, 251 mSDsluCounter, 367 mSDsCounter, 0 mSdLazyCounter, 1099 mSolverCounterSat, 447 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 12.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 251 SdHoareTripleChecker+Valid, 442 SdHoareTripleChecker+Invalid, 1547 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 447 IncrementalHoareTripleChecker+Valid, 1099 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 12.7s IncrementalHoareTripleChecker+Time [2022-04-27 13:17:10,885 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [251 Valid, 442 Invalid, 1547 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [447 Valid, 1099 Invalid, 1 Unknown, 0 Unchecked, 12.7s Time] [2022-04-27 13:17:10,886 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 422 states. [2022-04-27 13:17:12,021 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 422 to 359. [2022-04-27 13:17:12,022 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 13:17:12,022 INFO L82 GeneralOperation]: Start isEquivalent. First operand 422 states. Second operand has 359 states, 218 states have (on average 1.1926605504587156) internal successors, (260), 219 states have internal predecessors, (260), 119 states have call successors, (119), 22 states have call predecessors, (119), 21 states have return successors, (117), 117 states have call predecessors, (117), 117 states have call successors, (117) [2022-04-27 13:17:12,023 INFO L74 IsIncluded]: Start isIncluded. First operand 422 states. Second operand has 359 states, 218 states have (on average 1.1926605504587156) internal successors, (260), 219 states have internal predecessors, (260), 119 states have call successors, (119), 22 states have call predecessors, (119), 21 states have return successors, (117), 117 states have call predecessors, (117), 117 states have call successors, (117) [2022-04-27 13:17:12,023 INFO L87 Difference]: Start difference. First operand 422 states. Second operand has 359 states, 218 states have (on average 1.1926605504587156) internal successors, (260), 219 states have internal predecessors, (260), 119 states have call successors, (119), 22 states have call predecessors, (119), 21 states have return successors, (117), 117 states have call predecessors, (117), 117 states have call successors, (117) [2022-04-27 13:17:12,040 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:17:12,040 INFO L93 Difference]: Finished difference Result 422 states and 581 transitions. [2022-04-27 13:17:12,040 INFO L276 IsEmpty]: Start isEmpty. Operand 422 states and 581 transitions. [2022-04-27 13:17:12,042 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 13:17:12,042 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 13:17:12,042 INFO L74 IsIncluded]: Start isIncluded. First operand has 359 states, 218 states have (on average 1.1926605504587156) internal successors, (260), 219 states have internal predecessors, (260), 119 states have call successors, (119), 22 states have call predecessors, (119), 21 states have return successors, (117), 117 states have call predecessors, (117), 117 states have call successors, (117) Second operand 422 states. [2022-04-27 13:17:12,043 INFO L87 Difference]: Start difference. First operand has 359 states, 218 states have (on average 1.1926605504587156) internal successors, (260), 219 states have internal predecessors, (260), 119 states have call successors, (119), 22 states have call predecessors, (119), 21 states have return successors, (117), 117 states have call predecessors, (117), 117 states have call successors, (117) Second operand 422 states. [2022-04-27 13:17:12,059 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:17:12,059 INFO L93 Difference]: Finished difference Result 422 states and 581 transitions. [2022-04-27 13:17:12,059 INFO L276 IsEmpty]: Start isEmpty. Operand 422 states and 581 transitions. [2022-04-27 13:17:12,061 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 13:17:12,061 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 13:17:12,061 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 13:17:12,061 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 13:17:12,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 359 states, 218 states have (on average 1.1926605504587156) internal successors, (260), 219 states have internal predecessors, (260), 119 states have call successors, (119), 22 states have call predecessors, (119), 21 states have return successors, (117), 117 states have call predecessors, (117), 117 states have call successors, (117) [2022-04-27 13:17:12,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 359 states to 359 states and 496 transitions. [2022-04-27 13:17:12,077 INFO L78 Accepts]: Start accepts. Automaton has 359 states and 496 transitions. Word has length 77 [2022-04-27 13:17:12,077 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 13:17:12,077 INFO L495 AbstractCegarLoop]: Abstraction has 359 states and 496 transitions. [2022-04-27 13:17:12,077 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 2.1153846153846154) internal successors, (55), 25 states have internal predecessors, (55), 5 states have call successors, (18), 2 states have call predecessors, (18), 1 states have return successors, (15), 5 states have call predecessors, (15), 5 states have call successors, (15) [2022-04-27 13:17:12,077 INFO L276 IsEmpty]: Start isEmpty. Operand 359 states and 496 transitions. [2022-04-27 13:17:12,078 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2022-04-27 13:17:12,078 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 13:17:12,078 INFO L195 NwaCegarLoop]: trace histogram [9, 8, 8, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1] [2022-04-27 13:17:12,103 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2022-04-27 13:17:12,291 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 13:17:12,291 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 13:17:12,292 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 13:17:12,292 INFO L85 PathProgramCache]: Analyzing trace with hash -1455197645, now seen corresponding path program 1 times [2022-04-27 13:17:12,292 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 13:17:12,292 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [954405381] [2022-04-27 13:17:12,292 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 13:17:12,292 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 13:17:12,306 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 13:17:12,306 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1101817214] [2022-04-27 13:17:12,306 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 13:17:12,307 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 13:17:12,307 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 13:17:12,314 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-27 13:17:12,347 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2022-04-27 13:17:12,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 13:17:12,393 INFO L263 TraceCheckSpWp]: Trace formula consists of 241 conjuncts, 94 conjunts are in the unsatisfiable core [2022-04-27 13:17:12,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 13:17:12,412 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 13:17:13,603 INFO L272 TraceCheckUtils]: 0: Hoare triple {17742#true} call ULTIMATE.init(); {17742#true} is VALID [2022-04-27 13:17:13,603 INFO L290 TraceCheckUtils]: 1: Hoare triple {17742#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(11, 2);call #Ultimate.allocInit(12, 3); {17742#true} is VALID [2022-04-27 13:17:13,604 INFO L290 TraceCheckUtils]: 2: Hoare triple {17742#true} assume true; {17742#true} is VALID [2022-04-27 13:17:13,604 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {17742#true} {17742#true} #112#return; {17742#true} is VALID [2022-04-27 13:17:13,604 INFO L272 TraceCheckUtils]: 4: Hoare triple {17742#true} call #t~ret6 := main(); {17742#true} is VALID [2022-04-27 13:17:13,604 INFO L290 TraceCheckUtils]: 5: Hoare triple {17742#true} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~s~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4; {17742#true} is VALID [2022-04-27 13:17:13,604 INFO L272 TraceCheckUtils]: 6: Hoare triple {17742#true} call assume_abort_if_not((if ~x~0 >= 0 && ~x~0 <= 50 then 1 else 0)); {17742#true} is VALID [2022-04-27 13:17:13,604 INFO L290 TraceCheckUtils]: 7: Hoare triple {17742#true} ~cond := #in~cond; {17742#true} is VALID [2022-04-27 13:17:13,604 INFO L290 TraceCheckUtils]: 8: Hoare triple {17742#true} assume !(0 == ~cond); {17742#true} is VALID [2022-04-27 13:17:13,604 INFO L290 TraceCheckUtils]: 9: Hoare triple {17742#true} assume true; {17742#true} is VALID [2022-04-27 13:17:13,604 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {17742#true} {17742#true} #94#return; {17742#true} is VALID [2022-04-27 13:17:13,604 INFO L290 TraceCheckUtils]: 11: Hoare triple {17742#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {17742#true} is VALID [2022-04-27 13:17:13,604 INFO L272 TraceCheckUtils]: 12: Hoare triple {17742#true} call assume_abort_if_not((if ~y~0 >= 0 && ~y~0 <= 50 then 1 else 0)); {17742#true} is VALID [2022-04-27 13:17:13,604 INFO L290 TraceCheckUtils]: 13: Hoare triple {17742#true} ~cond := #in~cond; {17742#true} is VALID [2022-04-27 13:17:13,604 INFO L290 TraceCheckUtils]: 14: Hoare triple {17742#true} assume !(0 == ~cond); {17742#true} is VALID [2022-04-27 13:17:13,604 INFO L290 TraceCheckUtils]: 15: Hoare triple {17742#true} assume true; {17742#true} is VALID [2022-04-27 13:17:13,605 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {17742#true} {17742#true} #96#return; {17742#true} is VALID [2022-04-27 13:17:13,605 INFO L272 TraceCheckUtils]: 17: Hoare triple {17742#true} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {17742#true} is VALID [2022-04-27 13:17:13,605 INFO L290 TraceCheckUtils]: 18: Hoare triple {17742#true} ~cond := #in~cond; {17742#true} is VALID [2022-04-27 13:17:13,605 INFO L290 TraceCheckUtils]: 19: Hoare triple {17742#true} assume !(0 == ~cond); {17742#true} is VALID [2022-04-27 13:17:13,605 INFO L290 TraceCheckUtils]: 20: Hoare triple {17742#true} assume true; {17742#true} is VALID [2022-04-27 13:17:13,605 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {17742#true} {17742#true} #98#return; {17742#true} is VALID [2022-04-27 13:17:13,605 INFO L272 TraceCheckUtils]: 22: Hoare triple {17742#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {17742#true} is VALID [2022-04-27 13:17:13,605 INFO L290 TraceCheckUtils]: 23: Hoare triple {17742#true} ~cond := #in~cond; {17742#true} is VALID [2022-04-27 13:17:13,605 INFO L290 TraceCheckUtils]: 24: Hoare triple {17742#true} assume !(0 == ~cond); {17742#true} is VALID [2022-04-27 13:17:13,605 INFO L290 TraceCheckUtils]: 25: Hoare triple {17742#true} assume true; {17742#true} is VALID [2022-04-27 13:17:13,605 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {17742#true} {17742#true} #100#return; {17742#true} is VALID [2022-04-27 13:17:13,605 INFO L290 TraceCheckUtils]: 27: Hoare triple {17742#true} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1; {17828#(and (= main_~r~0 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 13:17:13,606 INFO L290 TraceCheckUtils]: 28: Hoare triple {17828#(and (= main_~r~0 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; {17828#(and (= main_~r~0 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 13:17:13,606 INFO L290 TraceCheckUtils]: 29: Hoare triple {17828#(and (= main_~r~0 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 !!(0 != ~b~0);havoc ~c~0;havoc ~k~0;~c~0 := ~a~0;~k~0 := 0; {17835#(and (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~c~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-27 13:17:13,607 INFO L290 TraceCheckUtils]: 30: Hoare triple {17835#(and (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~c~0 main_~x~0) (= main_~p~0 1))} assume !false; {17835#(and (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~c~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-27 13:17:13,607 INFO L290 TraceCheckUtils]: 31: Hoare triple {17835#(and (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~c~0 main_~x~0) (= main_~p~0 1))} assume !(~c~0 >= ~b~0); {17835#(and (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~c~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-27 13:17:13,608 INFO L290 TraceCheckUtils]: 32: Hoare triple {17835#(and (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~c~0 main_~x~0) (= main_~p~0 1))} ~a~0 := ~b~0;~b~0 := ~c~0;havoc ~temp~0;~temp~0 := ~p~0;~p~0 := ~q~0;~q~0 := ~temp~0 - ~q~0 * ~k~0;~temp~0 := ~r~0;~r~0 := ~s~0;~s~0 := ~temp~0 - ~s~0 * ~k~0; {17845#(and (= main_~s~0 0) (= main_~p~0 0) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~b~0 main_~x~0) (= main_~q~0 1))} is VALID [2022-04-27 13:17:13,608 INFO L290 TraceCheckUtils]: 33: Hoare triple {17845#(and (= main_~s~0 0) (= main_~p~0 0) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~b~0 main_~x~0) (= main_~q~0 1))} assume !false; {17845#(and (= main_~s~0 0) (= main_~p~0 0) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~b~0 main_~x~0) (= main_~q~0 1))} is VALID [2022-04-27 13:17:13,608 INFO L290 TraceCheckUtils]: 34: Hoare triple {17845#(and (= main_~s~0 0) (= main_~p~0 0) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~b~0 main_~x~0) (= main_~q~0 1))} assume !!(0 != ~b~0);havoc ~c~0;havoc ~k~0;~c~0 := ~a~0;~k~0 := 0; {17852#(and (= main_~c~0 main_~a~0) (= main_~s~0 0) (= main_~p~0 0) (= main_~k~0 0) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~b~0 main_~x~0) (= main_~q~0 1))} is VALID [2022-04-27 13:17:13,609 INFO L290 TraceCheckUtils]: 35: Hoare triple {17852#(and (= main_~c~0 main_~a~0) (= main_~s~0 0) (= main_~p~0 0) (= main_~k~0 0) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~b~0 main_~x~0) (= main_~q~0 1))} assume !false; {17852#(and (= main_~c~0 main_~a~0) (= main_~s~0 0) (= main_~p~0 0) (= main_~k~0 0) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~b~0 main_~x~0) (= main_~q~0 1))} is VALID [2022-04-27 13:17:13,609 INFO L290 TraceCheckUtils]: 36: Hoare triple {17852#(and (= main_~c~0 main_~a~0) (= main_~s~0 0) (= main_~p~0 0) (= main_~k~0 0) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~b~0 main_~x~0) (= main_~q~0 1))} assume !!(~c~0 >= ~b~0);havoc ~d~0;havoc ~v~0;~d~0 := 1;~v~0 := ~b~0; {17859#(and (= main_~b~0 main_~v~0) (= main_~c~0 main_~a~0) (= main_~s~0 0) (= main_~p~0 0) (= main_~k~0 0) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~b~0 main_~x~0) (= main_~d~0 1) (= main_~q~0 1))} is VALID [2022-04-27 13:17:13,610 INFO L290 TraceCheckUtils]: 37: Hoare triple {17859#(and (= main_~b~0 main_~v~0) (= main_~c~0 main_~a~0) (= main_~s~0 0) (= main_~p~0 0) (= main_~k~0 0) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~b~0 main_~x~0) (= main_~d~0 1) (= main_~q~0 1))} assume !false; {17859#(and (= main_~b~0 main_~v~0) (= main_~c~0 main_~a~0) (= main_~s~0 0) (= main_~p~0 0) (= main_~k~0 0) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~b~0 main_~x~0) (= main_~d~0 1) (= main_~q~0 1))} is VALID [2022-04-27 13:17:13,610 INFO L272 TraceCheckUtils]: 38: Hoare triple {17859#(and (= main_~b~0 main_~v~0) (= main_~c~0 main_~a~0) (= main_~s~0 0) (= main_~p~0 0) (= main_~k~0 0) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~b~0 main_~x~0) (= main_~d~0 1) (= main_~q~0 1))} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {17742#true} is VALID [2022-04-27 13:17:13,610 INFO L290 TraceCheckUtils]: 39: Hoare triple {17742#true} ~cond := #in~cond; {17742#true} is VALID [2022-04-27 13:17:13,610 INFO L290 TraceCheckUtils]: 40: Hoare triple {17742#true} assume !(0 == ~cond); {17742#true} is VALID [2022-04-27 13:17:13,610 INFO L290 TraceCheckUtils]: 41: Hoare triple {17742#true} assume true; {17742#true} is VALID [2022-04-27 13:17:13,611 INFO L284 TraceCheckUtils]: 42: Hoare quadruple {17742#true} {17859#(and (= main_~b~0 main_~v~0) (= main_~c~0 main_~a~0) (= main_~s~0 0) (= main_~p~0 0) (= main_~k~0 0) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~b~0 main_~x~0) (= main_~d~0 1) (= main_~q~0 1))} #102#return; {17859#(and (= main_~b~0 main_~v~0) (= main_~c~0 main_~a~0) (= main_~s~0 0) (= main_~p~0 0) (= main_~k~0 0) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~b~0 main_~x~0) (= main_~d~0 1) (= main_~q~0 1))} is VALID [2022-04-27 13:17:13,611 INFO L272 TraceCheckUtils]: 43: Hoare triple {17859#(and (= main_~b~0 main_~v~0) (= main_~c~0 main_~a~0) (= main_~s~0 0) (= main_~p~0 0) (= main_~k~0 0) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~b~0 main_~x~0) (= main_~d~0 1) (= main_~q~0 1))} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {17742#true} is VALID [2022-04-27 13:17:13,611 INFO L290 TraceCheckUtils]: 44: Hoare triple {17742#true} ~cond := #in~cond; {17742#true} is VALID [2022-04-27 13:17:13,611 INFO L290 TraceCheckUtils]: 45: Hoare triple {17742#true} assume !(0 == ~cond); {17742#true} is VALID [2022-04-27 13:17:13,611 INFO L290 TraceCheckUtils]: 46: Hoare triple {17742#true} assume true; {17742#true} is VALID [2022-04-27 13:17:13,612 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {17742#true} {17859#(and (= main_~b~0 main_~v~0) (= main_~c~0 main_~a~0) (= main_~s~0 0) (= main_~p~0 0) (= main_~k~0 0) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~b~0 main_~x~0) (= main_~d~0 1) (= main_~q~0 1))} #104#return; {17859#(and (= main_~b~0 main_~v~0) (= main_~c~0 main_~a~0) (= main_~s~0 0) (= main_~p~0 0) (= main_~k~0 0) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~b~0 main_~x~0) (= main_~d~0 1) (= main_~q~0 1))} is VALID [2022-04-27 13:17:13,612 INFO L272 TraceCheckUtils]: 48: Hoare triple {17859#(and (= main_~b~0 main_~v~0) (= main_~c~0 main_~a~0) (= main_~s~0 0) (= main_~p~0 0) (= main_~k~0 0) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~b~0 main_~x~0) (= main_~d~0 1) (= main_~q~0 1))} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {17742#true} is VALID [2022-04-27 13:17:13,612 INFO L290 TraceCheckUtils]: 49: Hoare triple {17742#true} ~cond := #in~cond; {17742#true} is VALID [2022-04-27 13:17:13,612 INFO L290 TraceCheckUtils]: 50: Hoare triple {17742#true} assume !(0 == ~cond); {17742#true} is VALID [2022-04-27 13:17:13,612 INFO L290 TraceCheckUtils]: 51: Hoare triple {17742#true} assume true; {17742#true} is VALID [2022-04-27 13:17:13,613 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {17742#true} {17859#(and (= main_~b~0 main_~v~0) (= main_~c~0 main_~a~0) (= main_~s~0 0) (= main_~p~0 0) (= main_~k~0 0) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~b~0 main_~x~0) (= main_~d~0 1) (= main_~q~0 1))} #106#return; {17859#(and (= main_~b~0 main_~v~0) (= main_~c~0 main_~a~0) (= main_~s~0 0) (= main_~p~0 0) (= main_~k~0 0) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~b~0 main_~x~0) (= main_~d~0 1) (= main_~q~0 1))} is VALID [2022-04-27 13:17:13,613 INFO L272 TraceCheckUtils]: 53: Hoare triple {17859#(and (= main_~b~0 main_~v~0) (= main_~c~0 main_~a~0) (= main_~s~0 0) (= main_~p~0 0) (= main_~k~0 0) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~b~0 main_~x~0) (= main_~d~0 1) (= main_~q~0 1))} call __VERIFIER_assert((if ~v~0 == ~b~0 * ~d~0 then 1 else 0)); {17742#true} is VALID [2022-04-27 13:17:13,613 INFO L290 TraceCheckUtils]: 54: Hoare triple {17742#true} ~cond := #in~cond; {17914#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-27 13:17:13,613 INFO L290 TraceCheckUtils]: 55: Hoare triple {17914#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {17918#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 13:17:13,614 INFO L290 TraceCheckUtils]: 56: Hoare triple {17918#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {17918#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 13:17:13,614 INFO L284 TraceCheckUtils]: 57: Hoare quadruple {17918#(not (= |__VERIFIER_assert_#in~cond| 0))} {17859#(and (= main_~b~0 main_~v~0) (= main_~c~0 main_~a~0) (= main_~s~0 0) (= main_~p~0 0) (= main_~k~0 0) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~b~0 main_~x~0) (= main_~d~0 1) (= main_~q~0 1))} #108#return; {17859#(and (= main_~b~0 main_~v~0) (= main_~c~0 main_~a~0) (= main_~s~0 0) (= main_~p~0 0) (= main_~k~0 0) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~b~0 main_~x~0) (= main_~d~0 1) (= main_~q~0 1))} is VALID [2022-04-27 13:17:13,615 INFO L290 TraceCheckUtils]: 58: Hoare triple {17859#(and (= main_~b~0 main_~v~0) (= main_~c~0 main_~a~0) (= main_~s~0 0) (= main_~p~0 0) (= main_~k~0 0) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~b~0 main_~x~0) (= main_~d~0 1) (= main_~q~0 1))} assume !!(~c~0 >= 2 * ~v~0);~d~0 := 2 * ~d~0;~v~0 := 2 * ~v~0; {17928#(and (= main_~c~0 main_~a~0) (= main_~s~0 0) (= main_~v~0 (* main_~b~0 2)) (= main_~p~0 0) (= main_~k~0 0) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~b~0 main_~x~0) (= main_~d~0 2) (= main_~q~0 1))} is VALID [2022-04-27 13:17:13,615 INFO L290 TraceCheckUtils]: 59: Hoare triple {17928#(and (= main_~c~0 main_~a~0) (= main_~s~0 0) (= main_~v~0 (* main_~b~0 2)) (= main_~p~0 0) (= main_~k~0 0) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~b~0 main_~x~0) (= main_~d~0 2) (= main_~q~0 1))} assume !false; {17928#(and (= main_~c~0 main_~a~0) (= main_~s~0 0) (= main_~v~0 (* main_~b~0 2)) (= main_~p~0 0) (= main_~k~0 0) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~b~0 main_~x~0) (= main_~d~0 2) (= main_~q~0 1))} is VALID [2022-04-27 13:17:13,615 INFO L272 TraceCheckUtils]: 60: Hoare triple {17928#(and (= main_~c~0 main_~a~0) (= main_~s~0 0) (= main_~v~0 (* main_~b~0 2)) (= main_~p~0 0) (= main_~k~0 0) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~b~0 main_~x~0) (= main_~d~0 2) (= main_~q~0 1))} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {17742#true} is VALID [2022-04-27 13:17:13,616 INFO L290 TraceCheckUtils]: 61: Hoare triple {17742#true} ~cond := #in~cond; {17914#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-27 13:17:13,617 INFO L290 TraceCheckUtils]: 62: Hoare triple {17914#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {17918#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 13:17:13,617 INFO L290 TraceCheckUtils]: 63: Hoare triple {17918#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {17918#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 13:17:13,618 INFO L284 TraceCheckUtils]: 64: Hoare quadruple {17918#(not (= |__VERIFIER_assert_#in~cond| 0))} {17928#(and (= main_~c~0 main_~a~0) (= main_~s~0 0) (= main_~v~0 (* main_~b~0 2)) (= main_~p~0 0) (= main_~k~0 0) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~b~0 main_~x~0) (= main_~d~0 2) (= main_~q~0 1))} #102#return; {17928#(and (= main_~c~0 main_~a~0) (= main_~s~0 0) (= main_~v~0 (* main_~b~0 2)) (= main_~p~0 0) (= main_~k~0 0) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~b~0 main_~x~0) (= main_~d~0 2) (= main_~q~0 1))} is VALID [2022-04-27 13:17:13,618 INFO L272 TraceCheckUtils]: 65: Hoare triple {17928#(and (= main_~c~0 main_~a~0) (= main_~s~0 0) (= main_~v~0 (* main_~b~0 2)) (= main_~p~0 0) (= main_~k~0 0) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~b~0 main_~x~0) (= main_~d~0 2) (= main_~q~0 1))} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {17742#true} is VALID [2022-04-27 13:17:13,618 INFO L290 TraceCheckUtils]: 66: Hoare triple {17742#true} ~cond := #in~cond; {17914#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-27 13:17:13,618 INFO L290 TraceCheckUtils]: 67: Hoare triple {17914#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {17918#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 13:17:13,618 INFO L290 TraceCheckUtils]: 68: Hoare triple {17918#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {17918#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 13:17:13,619 INFO L284 TraceCheckUtils]: 69: Hoare quadruple {17918#(not (= |__VERIFIER_assert_#in~cond| 0))} {17928#(and (= main_~c~0 main_~a~0) (= main_~s~0 0) (= main_~v~0 (* main_~b~0 2)) (= main_~p~0 0) (= main_~k~0 0) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~b~0 main_~x~0) (= main_~d~0 2) (= main_~q~0 1))} #104#return; {17928#(and (= main_~c~0 main_~a~0) (= main_~s~0 0) (= main_~v~0 (* main_~b~0 2)) (= main_~p~0 0) (= main_~k~0 0) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~b~0 main_~x~0) (= main_~d~0 2) (= main_~q~0 1))} is VALID [2022-04-27 13:17:13,619 INFO L272 TraceCheckUtils]: 70: Hoare triple {17928#(and (= main_~c~0 main_~a~0) (= main_~s~0 0) (= main_~v~0 (* main_~b~0 2)) (= main_~p~0 0) (= main_~k~0 0) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~b~0 main_~x~0) (= main_~d~0 2) (= main_~q~0 1))} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {17742#true} is VALID [2022-04-27 13:17:13,620 INFO L290 TraceCheckUtils]: 71: Hoare triple {17742#true} ~cond := #in~cond; {17914#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-27 13:17:13,620 INFO L290 TraceCheckUtils]: 72: Hoare triple {17914#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {17918#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 13:17:13,620 INFO L290 TraceCheckUtils]: 73: Hoare triple {17918#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {17918#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 13:17:13,621 INFO L284 TraceCheckUtils]: 74: Hoare quadruple {17918#(not (= |__VERIFIER_assert_#in~cond| 0))} {17928#(and (= main_~c~0 main_~a~0) (= main_~s~0 0) (= main_~v~0 (* main_~b~0 2)) (= main_~p~0 0) (= main_~k~0 0) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~b~0 main_~x~0) (= main_~d~0 2) (= main_~q~0 1))} #106#return; {17977#(and (= main_~s~0 0) (= main_~v~0 (* main_~b~0 2)) (= main_~p~0 0) (= main_~k~0 0) (= main_~c~0 main_~y~0) (= main_~r~0 1) (= main_~b~0 main_~x~0) (= main_~d~0 2) (= main_~q~0 1))} is VALID [2022-04-27 13:17:13,621 INFO L272 TraceCheckUtils]: 75: Hoare triple {17977#(and (= main_~s~0 0) (= main_~v~0 (* main_~b~0 2)) (= main_~p~0 0) (= main_~k~0 0) (= main_~c~0 main_~y~0) (= main_~r~0 1) (= main_~b~0 main_~x~0) (= main_~d~0 2) (= main_~q~0 1))} call __VERIFIER_assert((if ~v~0 == ~b~0 * ~d~0 then 1 else 0)); {17742#true} is VALID [2022-04-27 13:17:13,622 INFO L290 TraceCheckUtils]: 76: Hoare triple {17742#true} ~cond := #in~cond; {17914#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-27 13:17:13,622 INFO L290 TraceCheckUtils]: 77: Hoare triple {17914#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {17918#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 13:17:13,622 INFO L290 TraceCheckUtils]: 78: Hoare triple {17918#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {17918#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 13:17:13,623 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {17918#(not (= |__VERIFIER_assert_#in~cond| 0))} {17977#(and (= main_~s~0 0) (= main_~v~0 (* main_~b~0 2)) (= main_~p~0 0) (= main_~k~0 0) (= main_~c~0 main_~y~0) (= main_~r~0 1) (= main_~b~0 main_~x~0) (= main_~d~0 2) (= main_~q~0 1))} #108#return; {17977#(and (= main_~s~0 0) (= main_~v~0 (* main_~b~0 2)) (= main_~p~0 0) (= main_~k~0 0) (= main_~c~0 main_~y~0) (= main_~r~0 1) (= main_~b~0 main_~x~0) (= main_~d~0 2) (= main_~q~0 1))} is VALID [2022-04-27 13:17:13,623 INFO L290 TraceCheckUtils]: 80: Hoare triple {17977#(and (= main_~s~0 0) (= main_~v~0 (* main_~b~0 2)) (= main_~p~0 0) (= main_~k~0 0) (= main_~c~0 main_~y~0) (= main_~r~0 1) (= main_~b~0 main_~x~0) (= main_~d~0 2) (= main_~q~0 1))} assume !(~c~0 >= 2 * ~v~0); {17977#(and (= main_~s~0 0) (= main_~v~0 (* main_~b~0 2)) (= main_~p~0 0) (= main_~k~0 0) (= main_~c~0 main_~y~0) (= main_~r~0 1) (= main_~b~0 main_~x~0) (= main_~d~0 2) (= main_~q~0 1))} is VALID [2022-04-27 13:17:13,624 INFO L290 TraceCheckUtils]: 81: Hoare triple {17977#(and (= main_~s~0 0) (= main_~v~0 (* main_~b~0 2)) (= main_~p~0 0) (= main_~k~0 0) (= main_~c~0 main_~y~0) (= main_~r~0 1) (= main_~b~0 main_~x~0) (= main_~d~0 2) (= main_~q~0 1))} ~c~0 := ~c~0 - ~v~0;~k~0 := ~k~0 + ~d~0; {17999#(and (= main_~s~0 0) (= main_~p~0 0) (= (+ (* (- 2) main_~b~0) main_~y~0) main_~c~0) (= main_~r~0 1) (= main_~b~0 main_~x~0) (= main_~k~0 2) (= main_~q~0 1))} is VALID [2022-04-27 13:17:13,625 INFO L290 TraceCheckUtils]: 82: Hoare triple {17999#(and (= main_~s~0 0) (= main_~p~0 0) (= (+ (* (- 2) main_~b~0) main_~y~0) main_~c~0) (= main_~r~0 1) (= main_~b~0 main_~x~0) (= main_~k~0 2) (= main_~q~0 1))} assume !false; {17999#(and (= main_~s~0 0) (= main_~p~0 0) (= (+ (* (- 2) main_~b~0) main_~y~0) main_~c~0) (= main_~r~0 1) (= main_~b~0 main_~x~0) (= main_~k~0 2) (= main_~q~0 1))} is VALID [2022-04-27 13:17:13,625 INFO L290 TraceCheckUtils]: 83: Hoare triple {17999#(and (= main_~s~0 0) (= main_~p~0 0) (= (+ (* (- 2) main_~b~0) main_~y~0) main_~c~0) (= main_~r~0 1) (= main_~b~0 main_~x~0) (= main_~k~0 2) (= main_~q~0 1))} assume !(~c~0 >= ~b~0); {17999#(and (= main_~s~0 0) (= main_~p~0 0) (= (+ (* (- 2) main_~b~0) main_~y~0) main_~c~0) (= main_~r~0 1) (= main_~b~0 main_~x~0) (= main_~k~0 2) (= main_~q~0 1))} is VALID [2022-04-27 13:17:13,626 INFO L290 TraceCheckUtils]: 84: Hoare triple {17999#(and (= main_~s~0 0) (= main_~p~0 0) (= (+ (* (- 2) main_~b~0) main_~y~0) main_~c~0) (= main_~r~0 1) (= main_~b~0 main_~x~0) (= main_~k~0 2) (= main_~q~0 1))} ~a~0 := ~b~0;~b~0 := ~c~0;havoc ~temp~0;~temp~0 := ~p~0;~p~0 := ~q~0;~q~0 := ~temp~0 - ~q~0 * ~k~0;~temp~0 := ~r~0;~r~0 := ~s~0;~s~0 := ~temp~0 - ~s~0 * ~k~0; {18009#(and (= main_~r~0 0) (= (+ (* (- 2) main_~x~0) main_~y~0) main_~b~0) (= main_~s~0 (+ (* (- 2) main_~r~0) 1)) (= main_~a~0 main_~x~0) (= (+ (* main_~p~0 2) main_~q~0) 0) (= main_~p~0 1))} is VALID [2022-04-27 13:17:13,626 INFO L290 TraceCheckUtils]: 85: Hoare triple {18009#(and (= main_~r~0 0) (= (+ (* (- 2) main_~x~0) main_~y~0) main_~b~0) (= main_~s~0 (+ (* (- 2) main_~r~0) 1)) (= main_~a~0 main_~x~0) (= (+ (* main_~p~0 2) main_~q~0) 0) (= main_~p~0 1))} assume !false; {18009#(and (= main_~r~0 0) (= (+ (* (- 2) main_~x~0) main_~y~0) main_~b~0) (= main_~s~0 (+ (* (- 2) main_~r~0) 1)) (= main_~a~0 main_~x~0) (= (+ (* main_~p~0 2) main_~q~0) 0) (= main_~p~0 1))} is VALID [2022-04-27 13:17:13,627 INFO L290 TraceCheckUtils]: 86: Hoare triple {18009#(and (= main_~r~0 0) (= (+ (* (- 2) main_~x~0) main_~y~0) main_~b~0) (= main_~s~0 (+ (* (- 2) main_~r~0) 1)) (= main_~a~0 main_~x~0) (= (+ (* main_~p~0 2) main_~q~0) 0) (= main_~p~0 1))} assume !(0 != ~b~0); {18016#(and (= main_~r~0 0) (= main_~s~0 (+ (* (- 2) main_~r~0) 1)) (= (+ (* (- 2) main_~x~0) main_~y~0) 0) (= main_~a~0 main_~x~0) (= (+ (* main_~p~0 2) main_~q~0) 0) (= main_~p~0 1))} is VALID [2022-04-27 13:17:13,628 INFO L272 TraceCheckUtils]: 87: Hoare triple {18016#(and (= main_~r~0 0) (= main_~s~0 (+ (* (- 2) main_~r~0) 1)) (= (+ (* (- 2) main_~x~0) main_~y~0) 0) (= main_~a~0 main_~x~0) (= (+ (* main_~p~0 2) main_~q~0) 0) (= main_~p~0 1))} call __VERIFIER_assert((if ~p~0 * ~x~0 - ~q~0 * ~x~0 + ~r~0 * ~y~0 - ~s~0 * ~y~0 == ~a~0 then 1 else 0)); {18020#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 13:17:13,628 INFO L290 TraceCheckUtils]: 88: Hoare triple {18020#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {18024#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 13:17:13,628 INFO L290 TraceCheckUtils]: 89: Hoare triple {18024#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {17743#false} is VALID [2022-04-27 13:17:13,628 INFO L290 TraceCheckUtils]: 90: Hoare triple {17743#false} assume !false; {17743#false} is VALID [2022-04-27 13:17:13,629 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 56 proven. 24 refuted. 0 times theorem prover too weak. 91 trivial. 0 not checked. [2022-04-27 13:17:13,629 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 13:18:37,648 INFO L290 TraceCheckUtils]: 90: Hoare triple {17743#false} assume !false; {17743#false} is VALID [2022-04-27 13:18:37,649 INFO L290 TraceCheckUtils]: 89: Hoare triple {18024#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {17743#false} is VALID [2022-04-27 13:18:37,649 INFO L290 TraceCheckUtils]: 88: Hoare triple {18020#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {18024#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 13:18:37,650 INFO L272 TraceCheckUtils]: 87: Hoare triple {18040#(= (+ (* main_~q~0 main_~x~0) main_~a~0 (* main_~y~0 main_~s~0)) (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} call __VERIFIER_assert((if ~p~0 * ~x~0 - ~q~0 * ~x~0 + ~r~0 * ~y~0 - ~s~0 * ~y~0 == ~a~0 then 1 else 0)); {18020#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 13:18:37,651 INFO L290 TraceCheckUtils]: 86: Hoare triple {18044#(or (= (+ (* main_~q~0 main_~x~0) main_~a~0 (* main_~y~0 main_~s~0)) (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))) (not (= main_~b~0 0)))} assume !(0 != ~b~0); {18040#(= (+ (* main_~q~0 main_~x~0) main_~a~0 (* main_~y~0 main_~s~0)) (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} is VALID [2022-04-27 13:18:37,651 INFO L290 TraceCheckUtils]: 85: Hoare triple {18044#(or (= (+ (* main_~q~0 main_~x~0) main_~a~0 (* main_~y~0 main_~s~0)) (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))) (not (= main_~b~0 0)))} assume !false; {18044#(or (= (+ (* main_~q~0 main_~x~0) main_~a~0 (* main_~y~0 main_~s~0)) (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))) (not (= main_~b~0 0)))} is VALID [2022-04-27 13:18:37,772 INFO L290 TraceCheckUtils]: 84: Hoare triple {18051#(or (not (= main_~c~0 0)) (= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) main_~b~0 (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))))} ~a~0 := ~b~0;~b~0 := ~c~0;havoc ~temp~0;~temp~0 := ~p~0;~p~0 := ~q~0;~q~0 := ~temp~0 - ~q~0 * ~k~0;~temp~0 := ~r~0;~r~0 := ~s~0;~s~0 := ~temp~0 - ~s~0 * ~k~0; {18044#(or (= (+ (* main_~q~0 main_~x~0) main_~a~0 (* main_~y~0 main_~s~0)) (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))) (not (= main_~b~0 0)))} is VALID [2022-04-27 13:18:37,772 INFO L290 TraceCheckUtils]: 83: Hoare triple {18051#(or (not (= main_~c~0 0)) (= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) main_~b~0 (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))))} assume !(~c~0 >= ~b~0); {18051#(or (not (= main_~c~0 0)) (= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) main_~b~0 (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))))} is VALID [2022-04-27 13:18:37,773 INFO L290 TraceCheckUtils]: 82: Hoare triple {18051#(or (not (= main_~c~0 0)) (= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) main_~b~0 (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))))} assume !false; {18051#(or (not (= main_~c~0 0)) (= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) main_~b~0 (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))))} is VALID [2022-04-27 13:18:37,815 INFO L290 TraceCheckUtils]: 81: Hoare triple {18061#(or (not (= (+ main_~c~0 (* (- 1) main_~v~0)) 0)) (= (+ main_~b~0 (* (+ main_~p~0 (* (- 1) main_~q~0 (+ main_~d~0 main_~k~0))) main_~x~0) (* (+ (* (- 1) (* main_~s~0 (+ main_~d~0 main_~k~0))) main_~r~0) main_~y~0)) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))))} ~c~0 := ~c~0 - ~v~0;~k~0 := ~k~0 + ~d~0; {18051#(or (not (= main_~c~0 0)) (= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) main_~b~0 (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))))} is VALID [2022-04-27 13:18:37,816 INFO L290 TraceCheckUtils]: 80: Hoare triple {18061#(or (not (= (+ main_~c~0 (* (- 1) main_~v~0)) 0)) (= (+ main_~b~0 (* (+ main_~p~0 (* (- 1) main_~q~0 (+ main_~d~0 main_~k~0))) main_~x~0) (* (+ (* (- 1) (* main_~s~0 (+ main_~d~0 main_~k~0))) main_~r~0) main_~y~0)) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))))} assume !(~c~0 >= 2 * ~v~0); {18061#(or (not (= (+ main_~c~0 (* (- 1) main_~v~0)) 0)) (= (+ main_~b~0 (* (+ main_~p~0 (* (- 1) main_~q~0 (+ main_~d~0 main_~k~0))) main_~x~0) (* (+ (* (- 1) (* main_~s~0 (+ main_~d~0 main_~k~0))) main_~r~0) main_~y~0)) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))))} is VALID [2022-04-27 13:18:37,817 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {17918#(not (= |__VERIFIER_assert_#in~cond| 0))} {18068#(or (not (= (+ main_~c~0 (* (- 1) main_~v~0)) 0)) (not (= main_~v~0 (* main_~d~0 main_~b~0))) (= (+ main_~b~0 (* (+ main_~p~0 (* (- 1) main_~q~0 (+ main_~d~0 main_~k~0))) main_~x~0) (* (+ (* (- 1) (* main_~s~0 (+ main_~d~0 main_~k~0))) main_~r~0) main_~y~0)) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))))} #108#return; {18061#(or (not (= (+ main_~c~0 (* (- 1) main_~v~0)) 0)) (= (+ main_~b~0 (* (+ main_~p~0 (* (- 1) main_~q~0 (+ main_~d~0 main_~k~0))) main_~x~0) (* (+ (* (- 1) (* main_~s~0 (+ main_~d~0 main_~k~0))) main_~r~0) main_~y~0)) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))))} is VALID [2022-04-27 13:18:37,817 INFO L290 TraceCheckUtils]: 78: Hoare triple {17918#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {17918#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 13:18:37,817 INFO L290 TraceCheckUtils]: 77: Hoare triple {18078#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} assume !(0 == ~cond); {17918#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 13:18:37,818 INFO L290 TraceCheckUtils]: 76: Hoare triple {17742#true} ~cond := #in~cond; {18078#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-27 13:18:37,818 INFO L272 TraceCheckUtils]: 75: Hoare triple {18068#(or (not (= (+ main_~c~0 (* (- 1) main_~v~0)) 0)) (not (= main_~v~0 (* main_~d~0 main_~b~0))) (= (+ main_~b~0 (* (+ main_~p~0 (* (- 1) main_~q~0 (+ main_~d~0 main_~k~0))) main_~x~0) (* (+ (* (- 1) (* main_~s~0 (+ main_~d~0 main_~k~0))) main_~r~0) main_~y~0)) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))))} call __VERIFIER_assert((if ~v~0 == ~b~0 * ~d~0 then 1 else 0)); {17742#true} is VALID [2022-04-27 13:18:37,819 INFO L284 TraceCheckUtils]: 74: Hoare quadruple {17918#(not (= |__VERIFIER_assert_#in~cond| 0))} {18085#(or (not (= (+ main_~c~0 (* (- 1) main_~v~0)) 0)) (not (= main_~a~0 (+ main_~c~0 (* main_~b~0 main_~k~0)))) (not (= main_~v~0 (* main_~d~0 main_~b~0))) (= (+ main_~b~0 (* (+ main_~p~0 (* (- 1) main_~q~0 (+ main_~d~0 main_~k~0))) main_~x~0) (* (+ (* (- 1) (* main_~s~0 (+ main_~d~0 main_~k~0))) main_~r~0) main_~y~0)) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))))} #106#return; {18068#(or (not (= (+ main_~c~0 (* (- 1) main_~v~0)) 0)) (not (= main_~v~0 (* main_~d~0 main_~b~0))) (= (+ main_~b~0 (* (+ main_~p~0 (* (- 1) main_~q~0 (+ main_~d~0 main_~k~0))) main_~x~0) (* (+ (* (- 1) (* main_~s~0 (+ main_~d~0 main_~k~0))) main_~r~0) main_~y~0)) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))))} is VALID [2022-04-27 13:18:37,819 INFO L290 TraceCheckUtils]: 73: Hoare triple {17918#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {17918#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 13:18:37,819 INFO L290 TraceCheckUtils]: 72: Hoare triple {18078#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} assume !(0 == ~cond); {17918#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 13:18:37,820 INFO L290 TraceCheckUtils]: 71: Hoare triple {17742#true} ~cond := #in~cond; {18078#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-27 13:18:37,820 INFO L272 TraceCheckUtils]: 70: Hoare triple {18085#(or (not (= (+ main_~c~0 (* (- 1) main_~v~0)) 0)) (not (= main_~a~0 (+ main_~c~0 (* main_~b~0 main_~k~0)))) (not (= main_~v~0 (* main_~d~0 main_~b~0))) (= (+ main_~b~0 (* (+ main_~p~0 (* (- 1) main_~q~0 (+ main_~d~0 main_~k~0))) main_~x~0) (* (+ (* (- 1) (* main_~s~0 (+ main_~d~0 main_~k~0))) main_~r~0) main_~y~0)) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))))} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {17742#true} is VALID [2022-04-27 13:18:37,821 INFO L284 TraceCheckUtils]: 69: Hoare quadruple {17918#(not (= |__VERIFIER_assert_#in~cond| 0))} {18101#(or (not (= (+ main_~c~0 (* (- 1) main_~v~0)) 0)) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))) (not (= main_~a~0 (+ main_~c~0 (* main_~b~0 main_~k~0)))) (not (= main_~v~0 (* main_~d~0 main_~b~0))) (= (+ main_~b~0 (* (+ main_~p~0 (* (- 1) main_~q~0 (+ main_~d~0 main_~k~0))) main_~x~0) (* (+ (* (- 1) (* main_~s~0 (+ main_~d~0 main_~k~0))) main_~r~0) main_~y~0)) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))))} #104#return; {18085#(or (not (= (+ main_~c~0 (* (- 1) main_~v~0)) 0)) (not (= main_~a~0 (+ main_~c~0 (* main_~b~0 main_~k~0)))) (not (= main_~v~0 (* main_~d~0 main_~b~0))) (= (+ main_~b~0 (* (+ main_~p~0 (* (- 1) main_~q~0 (+ main_~d~0 main_~k~0))) main_~x~0) (* (+ (* (- 1) (* main_~s~0 (+ main_~d~0 main_~k~0))) main_~r~0) main_~y~0)) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))))} is VALID [2022-04-27 13:18:37,821 INFO L290 TraceCheckUtils]: 68: Hoare triple {17918#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {17918#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 13:18:37,822 INFO L290 TraceCheckUtils]: 67: Hoare triple {18078#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} assume !(0 == ~cond); {17918#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 13:18:37,822 INFO L290 TraceCheckUtils]: 66: Hoare triple {17742#true} ~cond := #in~cond; {18078#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-27 13:18:37,822 INFO L272 TraceCheckUtils]: 65: Hoare triple {18101#(or (not (= (+ main_~c~0 (* (- 1) main_~v~0)) 0)) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))) (not (= main_~a~0 (+ main_~c~0 (* main_~b~0 main_~k~0)))) (not (= main_~v~0 (* main_~d~0 main_~b~0))) (= (+ main_~b~0 (* (+ main_~p~0 (* (- 1) main_~q~0 (+ main_~d~0 main_~k~0))) main_~x~0) (* (+ (* (- 1) (* main_~s~0 (+ main_~d~0 main_~k~0))) main_~r~0) main_~y~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)); {17742#true} is VALID [2022-04-27 13:18:38,858 INFO L284 TraceCheckUtils]: 64: Hoare quadruple {17918#(not (= |__VERIFIER_assert_#in~cond| 0))} {17742#true} #102#return; {18101#(or (not (= (+ main_~c~0 (* (- 1) main_~v~0)) 0)) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))) (not (= main_~a~0 (+ main_~c~0 (* main_~b~0 main_~k~0)))) (not (= main_~v~0 (* main_~d~0 main_~b~0))) (= (+ main_~b~0 (* (+ main_~p~0 (* (- 1) main_~q~0 (+ main_~d~0 main_~k~0))) main_~x~0) (* (+ (* (- 1) (* main_~s~0 (+ main_~d~0 main_~k~0))) main_~r~0) main_~y~0)) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))))} is VALID [2022-04-27 13:18:38,858 INFO L290 TraceCheckUtils]: 63: Hoare triple {17918#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {17918#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 13:18:38,859 INFO L290 TraceCheckUtils]: 62: Hoare triple {18078#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} assume !(0 == ~cond); {17918#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 13:18:38,859 INFO L290 TraceCheckUtils]: 61: Hoare triple {17742#true} ~cond := #in~cond; {18078#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-27 13:18:38,859 INFO L272 TraceCheckUtils]: 60: Hoare triple {17742#true} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {17742#true} is VALID [2022-04-27 13:18:38,859 INFO L290 TraceCheckUtils]: 59: Hoare triple {17742#true} assume !false; {17742#true} is VALID [2022-04-27 13:18:38,859 INFO L290 TraceCheckUtils]: 58: Hoare triple {17742#true} assume !!(~c~0 >= 2 * ~v~0);~d~0 := 2 * ~d~0;~v~0 := 2 * ~v~0; {17742#true} is VALID [2022-04-27 13:18:38,859 INFO L284 TraceCheckUtils]: 57: Hoare quadruple {17742#true} {17742#true} #108#return; {17742#true} is VALID [2022-04-27 13:18:38,859 INFO L290 TraceCheckUtils]: 56: Hoare triple {17742#true} assume true; {17742#true} is VALID [2022-04-27 13:18:38,859 INFO L290 TraceCheckUtils]: 55: Hoare triple {17742#true} assume !(0 == ~cond); {17742#true} is VALID [2022-04-27 13:18:38,860 INFO L290 TraceCheckUtils]: 54: Hoare triple {17742#true} ~cond := #in~cond; {17742#true} is VALID [2022-04-27 13:18:38,860 INFO L272 TraceCheckUtils]: 53: Hoare triple {17742#true} call __VERIFIER_assert((if ~v~0 == ~b~0 * ~d~0 then 1 else 0)); {17742#true} is VALID [2022-04-27 13:18:38,860 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {17742#true} {17742#true} #106#return; {17742#true} is VALID [2022-04-27 13:18:38,860 INFO L290 TraceCheckUtils]: 51: Hoare triple {17742#true} assume true; {17742#true} is VALID [2022-04-27 13:18:38,860 INFO L290 TraceCheckUtils]: 50: Hoare triple {17742#true} assume !(0 == ~cond); {17742#true} is VALID [2022-04-27 13:18:38,860 INFO L290 TraceCheckUtils]: 49: Hoare triple {17742#true} ~cond := #in~cond; {17742#true} is VALID [2022-04-27 13:18:38,860 INFO L272 TraceCheckUtils]: 48: Hoare triple {17742#true} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {17742#true} is VALID [2022-04-27 13:18:38,860 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {17742#true} {17742#true} #104#return; {17742#true} is VALID [2022-04-27 13:18:38,860 INFO L290 TraceCheckUtils]: 46: Hoare triple {17742#true} assume true; {17742#true} is VALID [2022-04-27 13:18:38,860 INFO L290 TraceCheckUtils]: 45: Hoare triple {17742#true} assume !(0 == ~cond); {17742#true} is VALID [2022-04-27 13:18:38,860 INFO L290 TraceCheckUtils]: 44: Hoare triple {17742#true} ~cond := #in~cond; {17742#true} is VALID [2022-04-27 13:18:38,860 INFO L272 TraceCheckUtils]: 43: Hoare triple {17742#true} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {17742#true} is VALID [2022-04-27 13:18:38,860 INFO L284 TraceCheckUtils]: 42: Hoare quadruple {17742#true} {17742#true} #102#return; {17742#true} is VALID [2022-04-27 13:18:38,860 INFO L290 TraceCheckUtils]: 41: Hoare triple {17742#true} assume true; {17742#true} is VALID [2022-04-27 13:18:38,860 INFO L290 TraceCheckUtils]: 40: Hoare triple {17742#true} assume !(0 == ~cond); {17742#true} is VALID [2022-04-27 13:18:38,860 INFO L290 TraceCheckUtils]: 39: Hoare triple {17742#true} ~cond := #in~cond; {17742#true} is VALID [2022-04-27 13:18:38,861 INFO L272 TraceCheckUtils]: 38: Hoare triple {17742#true} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {17742#true} is VALID [2022-04-27 13:18:38,861 INFO L290 TraceCheckUtils]: 37: Hoare triple {17742#true} assume !false; {17742#true} is VALID [2022-04-27 13:18:38,861 INFO L290 TraceCheckUtils]: 36: Hoare triple {17742#true} assume !!(~c~0 >= ~b~0);havoc ~d~0;havoc ~v~0;~d~0 := 1;~v~0 := ~b~0; {17742#true} is VALID [2022-04-27 13:18:38,861 INFO L290 TraceCheckUtils]: 35: Hoare triple {17742#true} assume !false; {17742#true} is VALID [2022-04-27 13:18:38,861 INFO L290 TraceCheckUtils]: 34: Hoare triple {17742#true} assume !!(0 != ~b~0);havoc ~c~0;havoc ~k~0;~c~0 := ~a~0;~k~0 := 0; {17742#true} is VALID [2022-04-27 13:18:38,861 INFO L290 TraceCheckUtils]: 33: Hoare triple {17742#true} assume !false; {17742#true} is VALID [2022-04-27 13:18:38,861 INFO L290 TraceCheckUtils]: 32: Hoare triple {17742#true} ~a~0 := ~b~0;~b~0 := ~c~0;havoc ~temp~0;~temp~0 := ~p~0;~p~0 := ~q~0;~q~0 := ~temp~0 - ~q~0 * ~k~0;~temp~0 := ~r~0;~r~0 := ~s~0;~s~0 := ~temp~0 - ~s~0 * ~k~0; {17742#true} is VALID [2022-04-27 13:18:38,861 INFO L290 TraceCheckUtils]: 31: Hoare triple {17742#true} assume !(~c~0 >= ~b~0); {17742#true} is VALID [2022-04-27 13:18:38,861 INFO L290 TraceCheckUtils]: 30: Hoare triple {17742#true} assume !false; {17742#true} is VALID [2022-04-27 13:18:38,861 INFO L290 TraceCheckUtils]: 29: Hoare triple {17742#true} assume !!(0 != ~b~0);havoc ~c~0;havoc ~k~0;~c~0 := ~a~0;~k~0 := 0; {17742#true} is VALID [2022-04-27 13:18:38,861 INFO L290 TraceCheckUtils]: 28: Hoare triple {17742#true} assume !false; {17742#true} is VALID [2022-04-27 13:18:38,861 INFO L290 TraceCheckUtils]: 27: Hoare triple {17742#true} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1; {17742#true} is VALID [2022-04-27 13:18:38,861 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {17742#true} {17742#true} #100#return; {17742#true} is VALID [2022-04-27 13:18:38,861 INFO L290 TraceCheckUtils]: 25: Hoare triple {17742#true} assume true; {17742#true} is VALID [2022-04-27 13:18:38,861 INFO L290 TraceCheckUtils]: 24: Hoare triple {17742#true} assume !(0 == ~cond); {17742#true} is VALID [2022-04-27 13:18:38,861 INFO L290 TraceCheckUtils]: 23: Hoare triple {17742#true} ~cond := #in~cond; {17742#true} is VALID [2022-04-27 13:18:38,862 INFO L272 TraceCheckUtils]: 22: Hoare triple {17742#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {17742#true} is VALID [2022-04-27 13:18:38,862 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {17742#true} {17742#true} #98#return; {17742#true} is VALID [2022-04-27 13:18:38,862 INFO L290 TraceCheckUtils]: 20: Hoare triple {17742#true} assume true; {17742#true} is VALID [2022-04-27 13:18:38,862 INFO L290 TraceCheckUtils]: 19: Hoare triple {17742#true} assume !(0 == ~cond); {17742#true} is VALID [2022-04-27 13:18:38,862 INFO L290 TraceCheckUtils]: 18: Hoare triple {17742#true} ~cond := #in~cond; {17742#true} is VALID [2022-04-27 13:18:38,862 INFO L272 TraceCheckUtils]: 17: Hoare triple {17742#true} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {17742#true} is VALID [2022-04-27 13:18:38,862 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {17742#true} {17742#true} #96#return; {17742#true} is VALID [2022-04-27 13:18:38,862 INFO L290 TraceCheckUtils]: 15: Hoare triple {17742#true} assume true; {17742#true} is VALID [2022-04-27 13:18:38,862 INFO L290 TraceCheckUtils]: 14: Hoare triple {17742#true} assume !(0 == ~cond); {17742#true} is VALID [2022-04-27 13:18:38,862 INFO L290 TraceCheckUtils]: 13: Hoare triple {17742#true} ~cond := #in~cond; {17742#true} is VALID [2022-04-27 13:18:38,862 INFO L272 TraceCheckUtils]: 12: Hoare triple {17742#true} call assume_abort_if_not((if ~y~0 >= 0 && ~y~0 <= 50 then 1 else 0)); {17742#true} is VALID [2022-04-27 13:18:38,862 INFO L290 TraceCheckUtils]: 11: Hoare triple {17742#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {17742#true} is VALID [2022-04-27 13:18:38,863 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {17742#true} {17742#true} #94#return; {17742#true} is VALID [2022-04-27 13:18:38,863 INFO L290 TraceCheckUtils]: 9: Hoare triple {17742#true} assume true; {17742#true} is VALID [2022-04-27 13:18:38,863 INFO L290 TraceCheckUtils]: 8: Hoare triple {17742#true} assume !(0 == ~cond); {17742#true} is VALID [2022-04-27 13:18:38,863 INFO L290 TraceCheckUtils]: 7: Hoare triple {17742#true} ~cond := #in~cond; {17742#true} is VALID [2022-04-27 13:18:38,863 INFO L272 TraceCheckUtils]: 6: Hoare triple {17742#true} call assume_abort_if_not((if ~x~0 >= 0 && ~x~0 <= 50 then 1 else 0)); {17742#true} is VALID [2022-04-27 13:18:38,863 INFO L290 TraceCheckUtils]: 5: Hoare triple {17742#true} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~s~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4; {17742#true} is VALID [2022-04-27 13:18:38,863 INFO L272 TraceCheckUtils]: 4: Hoare triple {17742#true} call #t~ret6 := main(); {17742#true} is VALID [2022-04-27 13:18:38,863 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {17742#true} {17742#true} #112#return; {17742#true} is VALID [2022-04-27 13:18:38,863 INFO L290 TraceCheckUtils]: 2: Hoare triple {17742#true} assume true; {17742#true} is VALID [2022-04-27 13:18:38,863 INFO L290 TraceCheckUtils]: 1: Hoare triple {17742#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(11, 2);call #Ultimate.allocInit(12, 3); {17742#true} is VALID [2022-04-27 13:18:38,863 INFO L272 TraceCheckUtils]: 0: Hoare triple {17742#true} call ULTIMATE.init(); {17742#true} is VALID [2022-04-27 13:18:38,863 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 73 proven. 4 refuted. 0 times theorem prover too weak. 94 trivial. 0 not checked. [2022-04-27 13:18:38,864 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 13:18:38,864 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [954405381] [2022-04-27 13:18:38,864 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 13:18:38,864 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1101817214] [2022-04-27 13:18:38,864 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1101817214] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 13:18:38,864 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-27 13:18:38,864 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 13] total 24 [2022-04-27 13:18:38,864 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1117067781] [2022-04-27 13:18:38,864 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-27 13:18:38,865 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 19 states have (on average 2.8421052631578947) internal successors, (54), 20 states have internal predecessors, (54), 9 states have call successors, (23), 2 states have call predecessors, (23), 2 states have return successors, (21), 8 states have call predecessors, (21), 7 states have call successors, (21) Word has length 91 [2022-04-27 13:18:38,866 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 13:18:38,866 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 24 states, 19 states have (on average 2.8421052631578947) internal successors, (54), 20 states have internal predecessors, (54), 9 states have call successors, (23), 2 states have call predecessors, (23), 2 states have return successors, (21), 8 states have call predecessors, (21), 7 states have call successors, (21) [2022-04-27 13:18:41,027 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 98 edges. 97 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-27 13:18:41,027 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2022-04-27 13:18:41,028 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 13:18:41,028 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-04-27 13:18:41,028 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=104, Invalid=448, Unknown=0, NotChecked=0, Total=552 [2022-04-27 13:18:41,028 INFO L87 Difference]: Start difference. First operand 359 states and 496 transitions. Second operand has 24 states, 19 states have (on average 2.8421052631578947) internal successors, (54), 20 states have internal predecessors, (54), 9 states have call successors, (23), 2 states have call predecessors, (23), 2 states have return successors, (21), 8 states have call predecessors, (21), 7 states have call successors, (21) [2022-04-27 13:18:59,236 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.32s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-27 13:19:05,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:19:05,370 INFO L93 Difference]: Finished difference Result 470 states and 642 transitions. [2022-04-27 13:19:05,370 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2022-04-27 13:19:05,370 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 19 states have (on average 2.8421052631578947) internal successors, (54), 20 states have internal predecessors, (54), 9 states have call successors, (23), 2 states have call predecessors, (23), 2 states have return successors, (21), 8 states have call predecessors, (21), 7 states have call successors, (21) Word has length 91 [2022-04-27 13:19:05,370 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 13:19:05,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 19 states have (on average 2.8421052631578947) internal successors, (54), 20 states have internal predecessors, (54), 9 states have call successors, (23), 2 states have call predecessors, (23), 2 states have return successors, (21), 8 states have call predecessors, (21), 7 states have call successors, (21) [2022-04-27 13:19:05,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 232 transitions. [2022-04-27 13:19:05,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 19 states have (on average 2.8421052631578947) internal successors, (54), 20 states have internal predecessors, (54), 9 states have call successors, (23), 2 states have call predecessors, (23), 2 states have return successors, (21), 8 states have call predecessors, (21), 7 states have call successors, (21) [2022-04-27 13:19:05,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 232 transitions. [2022-04-27 13:19:05,382 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 38 states and 232 transitions. [2022-04-27 13:19:15,364 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 232 edges. 228 inductive. 0 not inductive. 4 times theorem prover too weak to decide inductivity. [2022-04-27 13:19:15,381 INFO L225 Difference]: With dead ends: 470 [2022-04-27 13:19:15,381 INFO L226 Difference]: Without dead ends: 466 [2022-04-27 13:19:15,382 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 222 GetRequests, 171 SyntacticMatches, 2 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 512 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=503, Invalid=2047, Unknown=0, NotChecked=0, Total=2550 [2022-04-27 13:19:15,383 INFO L413 NwaCegarLoop]: 56 mSDtfsCounter, 147 mSDsluCounter, 337 mSDsCounter, 0 mSdLazyCounter, 1396 mSolverCounterSat, 311 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 154 SdHoareTripleChecker+Valid, 393 SdHoareTripleChecker+Invalid, 1707 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 311 IncrementalHoareTripleChecker+Valid, 1396 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.3s IncrementalHoareTripleChecker+Time [2022-04-27 13:19:15,383 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [154 Valid, 393 Invalid, 1707 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [311 Valid, 1396 Invalid, 0 Unknown, 0 Unchecked, 7.3s Time] [2022-04-27 13:19:15,383 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 466 states. [2022-04-27 13:19:16,543 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 466 to 370. [2022-04-27 13:19:16,543 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 13:19:16,544 INFO L82 GeneralOperation]: Start isEquivalent. First operand 466 states. Second operand has 370 states, 213 states have (on average 1.192488262910798) internal successors, (254), 213 states have internal predecessors, (254), 130 states have call successors, (130), 27 states have call predecessors, (130), 26 states have return successors, (129), 129 states have call predecessors, (129), 129 states have call successors, (129) [2022-04-27 13:19:16,544 INFO L74 IsIncluded]: Start isIncluded. First operand 466 states. Second operand has 370 states, 213 states have (on average 1.192488262910798) internal successors, (254), 213 states have internal predecessors, (254), 130 states have call successors, (130), 27 states have call predecessors, (130), 26 states have return successors, (129), 129 states have call predecessors, (129), 129 states have call successors, (129) [2022-04-27 13:19:16,545 INFO L87 Difference]: Start difference. First operand 466 states. Second operand has 370 states, 213 states have (on average 1.192488262910798) internal successors, (254), 213 states have internal predecessors, (254), 130 states have call successors, (130), 27 states have call predecessors, (130), 26 states have return successors, (129), 129 states have call predecessors, (129), 129 states have call successors, (129) [2022-04-27 13:19:16,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:19:16,563 INFO L93 Difference]: Finished difference Result 466 states and 631 transitions. [2022-04-27 13:19:16,563 INFO L276 IsEmpty]: Start isEmpty. Operand 466 states and 631 transitions. [2022-04-27 13:19:16,564 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 13:19:16,565 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 13:19:16,565 INFO L74 IsIncluded]: Start isIncluded. First operand has 370 states, 213 states have (on average 1.192488262910798) internal successors, (254), 213 states have internal predecessors, (254), 130 states have call successors, (130), 27 states have call predecessors, (130), 26 states have return successors, (129), 129 states have call predecessors, (129), 129 states have call successors, (129) Second operand 466 states. [2022-04-27 13:19:16,566 INFO L87 Difference]: Start difference. First operand has 370 states, 213 states have (on average 1.192488262910798) internal successors, (254), 213 states have internal predecessors, (254), 130 states have call successors, (130), 27 states have call predecessors, (130), 26 states have return successors, (129), 129 states have call predecessors, (129), 129 states have call successors, (129) Second operand 466 states. [2022-04-27 13:19:16,582 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:19:16,583 INFO L93 Difference]: Finished difference Result 466 states and 631 transitions. [2022-04-27 13:19:16,583 INFO L276 IsEmpty]: Start isEmpty. Operand 466 states and 631 transitions. [2022-04-27 13:19:16,584 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 13:19:16,584 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 13:19:16,584 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 13:19:16,585 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 13:19:16,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 370 states, 213 states have (on average 1.192488262910798) internal successors, (254), 213 states have internal predecessors, (254), 130 states have call successors, (130), 27 states have call predecessors, (130), 26 states have return successors, (129), 129 states have call predecessors, (129), 129 states have call successors, (129) [2022-04-27 13:19:16,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 370 states to 370 states and 513 transitions. [2022-04-27 13:19:16,598 INFO L78 Accepts]: Start accepts. Automaton has 370 states and 513 transitions. Word has length 91 [2022-04-27 13:19:16,598 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 13:19:16,599 INFO L495 AbstractCegarLoop]: Abstraction has 370 states and 513 transitions. [2022-04-27 13:19:16,599 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 19 states have (on average 2.8421052631578947) internal successors, (54), 20 states have internal predecessors, (54), 9 states have call successors, (23), 2 states have call predecessors, (23), 2 states have return successors, (21), 8 states have call predecessors, (21), 7 states have call successors, (21) [2022-04-27 13:19:16,599 INFO L276 IsEmpty]: Start isEmpty. Operand 370 states and 513 transitions. [2022-04-27 13:19:16,600 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2022-04-27 13:19:16,600 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 13:19:16,600 INFO L195 NwaCegarLoop]: trace histogram [11, 10, 10, 4, 4, 4, 3, 3, 3, 3, 3, 3, 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, 1, 1] [2022-04-27 13:19:16,625 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Ended with exit code 0 [2022-04-27 13:19:16,815 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2022-04-27 13:19:16,815 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 13:19:16,816 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 13:19:16,816 INFO L85 PathProgramCache]: Analyzing trace with hash -801999833, now seen corresponding path program 1 times [2022-04-27 13:19:16,816 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 13:19:16,817 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [67697491] [2022-04-27 13:19:16,817 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 13:19:16,817 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 13:19:16,832 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 13:19:16,832 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1064092079] [2022-04-27 13:19:16,832 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 13:19:16,832 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 13:19:16,833 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 13:19:16,837 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-27 13:19:16,869 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2022-04-27 13:19:16,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 13:19:16,910 INFO L263 TraceCheckSpWp]: Trace formula consists of 225 conjuncts, 25 conjunts are in the unsatisfiable core [2022-04-27 13:19:16,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 13:19:16,928 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 13:19:17,423 INFO L272 TraceCheckUtils]: 0: Hoare triple {20623#true} call ULTIMATE.init(); {20623#true} is VALID [2022-04-27 13:19:17,423 INFO L290 TraceCheckUtils]: 1: Hoare triple {20623#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(11, 2);call #Ultimate.allocInit(12, 3); {20623#true} is VALID [2022-04-27 13:19:17,424 INFO L290 TraceCheckUtils]: 2: Hoare triple {20623#true} assume true; {20623#true} is VALID [2022-04-27 13:19:17,424 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {20623#true} {20623#true} #112#return; {20623#true} is VALID [2022-04-27 13:19:17,424 INFO L272 TraceCheckUtils]: 4: Hoare triple {20623#true} call #t~ret6 := main(); {20623#true} is VALID [2022-04-27 13:19:17,424 INFO L290 TraceCheckUtils]: 5: Hoare triple {20623#true} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~s~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4; {20623#true} is VALID [2022-04-27 13:19:17,424 INFO L272 TraceCheckUtils]: 6: Hoare triple {20623#true} call assume_abort_if_not((if ~x~0 >= 0 && ~x~0 <= 50 then 1 else 0)); {20623#true} is VALID [2022-04-27 13:19:17,424 INFO L290 TraceCheckUtils]: 7: Hoare triple {20623#true} ~cond := #in~cond; {20623#true} is VALID [2022-04-27 13:19:17,424 INFO L290 TraceCheckUtils]: 8: Hoare triple {20623#true} assume !(0 == ~cond); {20623#true} is VALID [2022-04-27 13:19:17,424 INFO L290 TraceCheckUtils]: 9: Hoare triple {20623#true} assume true; {20623#true} is VALID [2022-04-27 13:19:17,424 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {20623#true} {20623#true} #94#return; {20623#true} is VALID [2022-04-27 13:19:17,424 INFO L290 TraceCheckUtils]: 11: Hoare triple {20623#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {20623#true} is VALID [2022-04-27 13:19:17,424 INFO L272 TraceCheckUtils]: 12: Hoare triple {20623#true} call assume_abort_if_not((if ~y~0 >= 0 && ~y~0 <= 50 then 1 else 0)); {20623#true} is VALID [2022-04-27 13:19:17,425 INFO L290 TraceCheckUtils]: 13: Hoare triple {20623#true} ~cond := #in~cond; {20623#true} is VALID [2022-04-27 13:19:17,425 INFO L290 TraceCheckUtils]: 14: Hoare triple {20623#true} assume !(0 == ~cond); {20623#true} is VALID [2022-04-27 13:19:17,425 INFO L290 TraceCheckUtils]: 15: Hoare triple {20623#true} assume true; {20623#true} is VALID [2022-04-27 13:19:17,425 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {20623#true} {20623#true} #96#return; {20623#true} is VALID [2022-04-27 13:19:17,425 INFO L272 TraceCheckUtils]: 17: Hoare triple {20623#true} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {20623#true} is VALID [2022-04-27 13:19:17,425 INFO L290 TraceCheckUtils]: 18: Hoare triple {20623#true} ~cond := #in~cond; {20623#true} is VALID [2022-04-27 13:19:17,425 INFO L290 TraceCheckUtils]: 19: Hoare triple {20623#true} assume !(0 == ~cond); {20623#true} is VALID [2022-04-27 13:19:17,425 INFO L290 TraceCheckUtils]: 20: Hoare triple {20623#true} assume true; {20623#true} is VALID [2022-04-27 13:19:17,425 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {20623#true} {20623#true} #98#return; {20623#true} is VALID [2022-04-27 13:19:17,425 INFO L272 TraceCheckUtils]: 22: Hoare triple {20623#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {20623#true} is VALID [2022-04-27 13:19:17,425 INFO L290 TraceCheckUtils]: 23: Hoare triple {20623#true} ~cond := #in~cond; {20623#true} is VALID [2022-04-27 13:19:17,425 INFO L290 TraceCheckUtils]: 24: Hoare triple {20623#true} assume !(0 == ~cond); {20623#true} is VALID [2022-04-27 13:19:17,425 INFO L290 TraceCheckUtils]: 25: Hoare triple {20623#true} assume true; {20623#true} is VALID [2022-04-27 13:19:17,425 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {20623#true} {20623#true} #100#return; {20623#true} is VALID [2022-04-27 13:19:17,426 INFO L290 TraceCheckUtils]: 27: Hoare triple {20623#true} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1; {20623#true} is VALID [2022-04-27 13:19:17,426 INFO L290 TraceCheckUtils]: 28: Hoare triple {20623#true} assume !false; {20623#true} is VALID [2022-04-27 13:19:17,426 INFO L290 TraceCheckUtils]: 29: Hoare triple {20623#true} assume !!(0 != ~b~0);havoc ~c~0;havoc ~k~0;~c~0 := ~a~0;~k~0 := 0; {20715#(and (= main_~c~0 main_~a~0) (= main_~k~0 0))} is VALID [2022-04-27 13:19:17,426 INFO L290 TraceCheckUtils]: 30: Hoare triple {20715#(and (= main_~c~0 main_~a~0) (= main_~k~0 0))} assume !false; {20715#(and (= main_~c~0 main_~a~0) (= main_~k~0 0))} is VALID [2022-04-27 13:19:17,427 INFO L290 TraceCheckUtils]: 31: Hoare triple {20715#(and (= main_~c~0 main_~a~0) (= main_~k~0 0))} assume !!(~c~0 >= ~b~0);havoc ~d~0;havoc ~v~0;~d~0 := 1;~v~0 := ~b~0; {20722#(and (= main_~b~0 main_~v~0) (= main_~c~0 main_~a~0) (= main_~k~0 0) (= main_~d~0 1))} is VALID [2022-04-27 13:19:17,427 INFO L290 TraceCheckUtils]: 32: Hoare triple {20722#(and (= main_~b~0 main_~v~0) (= main_~c~0 main_~a~0) (= main_~k~0 0) (= main_~d~0 1))} assume !false; {20722#(and (= main_~b~0 main_~v~0) (= main_~c~0 main_~a~0) (= main_~k~0 0) (= main_~d~0 1))} is VALID [2022-04-27 13:19:17,427 INFO L272 TraceCheckUtils]: 33: Hoare triple {20722#(and (= main_~b~0 main_~v~0) (= main_~c~0 main_~a~0) (= main_~k~0 0) (= main_~d~0 1))} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {20623#true} is VALID [2022-04-27 13:19:17,427 INFO L290 TraceCheckUtils]: 34: Hoare triple {20623#true} ~cond := #in~cond; {20623#true} is VALID [2022-04-27 13:19:17,427 INFO L290 TraceCheckUtils]: 35: Hoare triple {20623#true} assume !(0 == ~cond); {20623#true} is VALID [2022-04-27 13:19:17,427 INFO L290 TraceCheckUtils]: 36: Hoare triple {20623#true} assume true; {20623#true} is VALID [2022-04-27 13:19:17,428 INFO L284 TraceCheckUtils]: 37: Hoare quadruple {20623#true} {20722#(and (= main_~b~0 main_~v~0) (= main_~c~0 main_~a~0) (= main_~k~0 0) (= main_~d~0 1))} #102#return; {20722#(and (= main_~b~0 main_~v~0) (= main_~c~0 main_~a~0) (= main_~k~0 0) (= main_~d~0 1))} is VALID [2022-04-27 13:19:17,428 INFO L272 TraceCheckUtils]: 38: Hoare triple {20722#(and (= main_~b~0 main_~v~0) (= main_~c~0 main_~a~0) (= main_~k~0 0) (= main_~d~0 1))} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {20623#true} is VALID [2022-04-27 13:19:17,428 INFO L290 TraceCheckUtils]: 39: Hoare triple {20623#true} ~cond := #in~cond; {20623#true} is VALID [2022-04-27 13:19:17,428 INFO L290 TraceCheckUtils]: 40: Hoare triple {20623#true} assume !(0 == ~cond); {20623#true} is VALID [2022-04-27 13:19:17,428 INFO L290 TraceCheckUtils]: 41: Hoare triple {20623#true} assume true; {20623#true} is VALID [2022-04-27 13:19:17,429 INFO L284 TraceCheckUtils]: 42: Hoare quadruple {20623#true} {20722#(and (= main_~b~0 main_~v~0) (= main_~c~0 main_~a~0) (= main_~k~0 0) (= main_~d~0 1))} #104#return; {20722#(and (= main_~b~0 main_~v~0) (= main_~c~0 main_~a~0) (= main_~k~0 0) (= main_~d~0 1))} is VALID [2022-04-27 13:19:17,429 INFO L272 TraceCheckUtils]: 43: Hoare triple {20722#(and (= main_~b~0 main_~v~0) (= main_~c~0 main_~a~0) (= main_~k~0 0) (= main_~d~0 1))} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {20623#true} is VALID [2022-04-27 13:19:17,429 INFO L290 TraceCheckUtils]: 44: Hoare triple {20623#true} ~cond := #in~cond; {20623#true} is VALID [2022-04-27 13:19:17,429 INFO L290 TraceCheckUtils]: 45: Hoare triple {20623#true} assume !(0 == ~cond); {20623#true} is VALID [2022-04-27 13:19:17,429 INFO L290 TraceCheckUtils]: 46: Hoare triple {20623#true} assume true; {20623#true} is VALID [2022-04-27 13:19:17,430 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {20623#true} {20722#(and (= main_~b~0 main_~v~0) (= main_~c~0 main_~a~0) (= main_~k~0 0) (= main_~d~0 1))} #106#return; {20722#(and (= main_~b~0 main_~v~0) (= main_~c~0 main_~a~0) (= main_~k~0 0) (= main_~d~0 1))} is VALID [2022-04-27 13:19:17,430 INFO L272 TraceCheckUtils]: 48: Hoare triple {20722#(and (= main_~b~0 main_~v~0) (= main_~c~0 main_~a~0) (= main_~k~0 0) (= main_~d~0 1))} call __VERIFIER_assert((if ~v~0 == ~b~0 * ~d~0 then 1 else 0)); {20623#true} is VALID [2022-04-27 13:19:17,430 INFO L290 TraceCheckUtils]: 49: Hoare triple {20623#true} ~cond := #in~cond; {20623#true} is VALID [2022-04-27 13:19:17,430 INFO L290 TraceCheckUtils]: 50: Hoare triple {20623#true} assume !(0 == ~cond); {20623#true} is VALID [2022-04-27 13:19:17,430 INFO L290 TraceCheckUtils]: 51: Hoare triple {20623#true} assume true; {20623#true} is VALID [2022-04-27 13:19:17,430 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {20623#true} {20722#(and (= main_~b~0 main_~v~0) (= main_~c~0 main_~a~0) (= main_~k~0 0) (= main_~d~0 1))} #108#return; {20722#(and (= main_~b~0 main_~v~0) (= main_~c~0 main_~a~0) (= main_~k~0 0) (= main_~d~0 1))} is VALID [2022-04-27 13:19:17,431 INFO L290 TraceCheckUtils]: 53: Hoare triple {20722#(and (= main_~b~0 main_~v~0) (= main_~c~0 main_~a~0) (= main_~k~0 0) (= main_~d~0 1))} assume !!(~c~0 >= 2 * ~v~0);~d~0 := 2 * ~d~0;~v~0 := 2 * ~v~0; {20789#(and (= main_~c~0 main_~a~0) (= main_~v~0 (* main_~b~0 2)) (= main_~k~0 0) (= main_~d~0 2))} is VALID [2022-04-27 13:19:17,431 INFO L290 TraceCheckUtils]: 54: Hoare triple {20789#(and (= main_~c~0 main_~a~0) (= main_~v~0 (* main_~b~0 2)) (= main_~k~0 0) (= main_~d~0 2))} assume !false; {20789#(and (= main_~c~0 main_~a~0) (= main_~v~0 (* main_~b~0 2)) (= main_~k~0 0) (= main_~d~0 2))} is VALID [2022-04-27 13:19:17,431 INFO L272 TraceCheckUtils]: 55: Hoare triple {20789#(and (= main_~c~0 main_~a~0) (= main_~v~0 (* main_~b~0 2)) (= main_~k~0 0) (= main_~d~0 2))} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {20623#true} is VALID [2022-04-27 13:19:17,431 INFO L290 TraceCheckUtils]: 56: Hoare triple {20623#true} ~cond := #in~cond; {20623#true} is VALID [2022-04-27 13:19:17,431 INFO L290 TraceCheckUtils]: 57: Hoare triple {20623#true} assume !(0 == ~cond); {20623#true} is VALID [2022-04-27 13:19:17,431 INFO L290 TraceCheckUtils]: 58: Hoare triple {20623#true} assume true; {20623#true} is VALID [2022-04-27 13:19:17,432 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {20623#true} {20789#(and (= main_~c~0 main_~a~0) (= main_~v~0 (* main_~b~0 2)) (= main_~k~0 0) (= main_~d~0 2))} #102#return; {20789#(and (= main_~c~0 main_~a~0) (= main_~v~0 (* main_~b~0 2)) (= main_~k~0 0) (= main_~d~0 2))} is VALID [2022-04-27 13:19:17,432 INFO L272 TraceCheckUtils]: 60: Hoare triple {20789#(and (= main_~c~0 main_~a~0) (= main_~v~0 (* main_~b~0 2)) (= main_~k~0 0) (= main_~d~0 2))} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {20623#true} is VALID [2022-04-27 13:19:17,432 INFO L290 TraceCheckUtils]: 61: Hoare triple {20623#true} ~cond := #in~cond; {20623#true} is VALID [2022-04-27 13:19:17,432 INFO L290 TraceCheckUtils]: 62: Hoare triple {20623#true} assume !(0 == ~cond); {20623#true} is VALID [2022-04-27 13:19:17,432 INFO L290 TraceCheckUtils]: 63: Hoare triple {20623#true} assume true; {20623#true} is VALID [2022-04-27 13:19:17,433 INFO L284 TraceCheckUtils]: 64: Hoare quadruple {20623#true} {20789#(and (= main_~c~0 main_~a~0) (= main_~v~0 (* main_~b~0 2)) (= main_~k~0 0) (= main_~d~0 2))} #104#return; {20789#(and (= main_~c~0 main_~a~0) (= main_~v~0 (* main_~b~0 2)) (= main_~k~0 0) (= main_~d~0 2))} is VALID [2022-04-27 13:19:17,433 INFO L272 TraceCheckUtils]: 65: Hoare triple {20789#(and (= main_~c~0 main_~a~0) (= main_~v~0 (* main_~b~0 2)) (= main_~k~0 0) (= main_~d~0 2))} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {20623#true} is VALID [2022-04-27 13:19:17,433 INFO L290 TraceCheckUtils]: 66: Hoare triple {20623#true} ~cond := #in~cond; {20623#true} is VALID [2022-04-27 13:19:17,433 INFO L290 TraceCheckUtils]: 67: Hoare triple {20623#true} assume !(0 == ~cond); {20623#true} is VALID [2022-04-27 13:19:17,433 INFO L290 TraceCheckUtils]: 68: Hoare triple {20623#true} assume true; {20623#true} is VALID [2022-04-27 13:19:17,434 INFO L284 TraceCheckUtils]: 69: Hoare quadruple {20623#true} {20789#(and (= main_~c~0 main_~a~0) (= main_~v~0 (* main_~b~0 2)) (= main_~k~0 0) (= main_~d~0 2))} #106#return; {20789#(and (= main_~c~0 main_~a~0) (= main_~v~0 (* main_~b~0 2)) (= main_~k~0 0) (= main_~d~0 2))} is VALID [2022-04-27 13:19:17,434 INFO L272 TraceCheckUtils]: 70: Hoare triple {20789#(and (= main_~c~0 main_~a~0) (= main_~v~0 (* main_~b~0 2)) (= main_~k~0 0) (= main_~d~0 2))} call __VERIFIER_assert((if ~v~0 == ~b~0 * ~d~0 then 1 else 0)); {20623#true} is VALID [2022-04-27 13:19:17,434 INFO L290 TraceCheckUtils]: 71: Hoare triple {20623#true} ~cond := #in~cond; {20623#true} is VALID [2022-04-27 13:19:17,434 INFO L290 TraceCheckUtils]: 72: Hoare triple {20623#true} assume !(0 == ~cond); {20623#true} is VALID [2022-04-27 13:19:17,434 INFO L290 TraceCheckUtils]: 73: Hoare triple {20623#true} assume true; {20623#true} is VALID [2022-04-27 13:19:17,435 INFO L284 TraceCheckUtils]: 74: Hoare quadruple {20623#true} {20789#(and (= main_~c~0 main_~a~0) (= main_~v~0 (* main_~b~0 2)) (= main_~k~0 0) (= main_~d~0 2))} #108#return; {20789#(and (= main_~c~0 main_~a~0) (= main_~v~0 (* main_~b~0 2)) (= main_~k~0 0) (= main_~d~0 2))} is VALID [2022-04-27 13:19:17,435 INFO L290 TraceCheckUtils]: 75: Hoare triple {20789#(and (= main_~c~0 main_~a~0) (= main_~v~0 (* main_~b~0 2)) (= main_~k~0 0) (= main_~d~0 2))} assume !(~c~0 >= 2 * ~v~0); {20856#(and (= main_~c~0 main_~a~0) (= main_~v~0 (* main_~b~0 2)) (= main_~k~0 0) (= main_~d~0 2) (not (<= (* main_~v~0 2) main_~c~0)))} is VALID [2022-04-27 13:19:17,436 INFO L290 TraceCheckUtils]: 76: Hoare triple {20856#(and (= main_~c~0 main_~a~0) (= main_~v~0 (* main_~b~0 2)) (= main_~k~0 0) (= main_~d~0 2) (not (<= (* main_~v~0 2) main_~c~0)))} ~c~0 := ~c~0 - ~v~0;~k~0 := ~k~0 + ~d~0; {20860#(and (= (+ (* (- 2) main_~b~0) main_~a~0) main_~c~0) (= main_~k~0 2) (not (<= (* main_~b~0 4) main_~a~0)))} is VALID [2022-04-27 13:19:17,436 INFO L290 TraceCheckUtils]: 77: Hoare triple {20860#(and (= (+ (* (- 2) main_~b~0) main_~a~0) main_~c~0) (= main_~k~0 2) (not (<= (* main_~b~0 4) main_~a~0)))} assume !false; {20860#(and (= (+ (* (- 2) main_~b~0) main_~a~0) main_~c~0) (= main_~k~0 2) (not (<= (* main_~b~0 4) main_~a~0)))} is VALID [2022-04-27 13:19:17,437 INFO L290 TraceCheckUtils]: 78: Hoare triple {20860#(and (= (+ (* (- 2) main_~b~0) main_~a~0) main_~c~0) (= main_~k~0 2) (not (<= (* main_~b~0 4) main_~a~0)))} assume !!(~c~0 >= ~b~0);havoc ~d~0;havoc ~v~0;~d~0 := 1;~v~0 := ~b~0; {20867#(and (<= main_~b~0 main_~c~0) (= (+ (* (- 2) main_~b~0) main_~a~0) main_~c~0) (= main_~k~0 2) (not (<= (* main_~b~0 4) main_~a~0)))} is VALID [2022-04-27 13:19:17,437 INFO L290 TraceCheckUtils]: 79: Hoare triple {20867#(and (<= main_~b~0 main_~c~0) (= (+ (* (- 2) main_~b~0) main_~a~0) main_~c~0) (= main_~k~0 2) (not (<= (* main_~b~0 4) main_~a~0)))} assume !false; {20867#(and (<= main_~b~0 main_~c~0) (= (+ (* (- 2) main_~b~0) main_~a~0) main_~c~0) (= main_~k~0 2) (not (<= (* main_~b~0 4) main_~a~0)))} is VALID [2022-04-27 13:19:17,437 INFO L272 TraceCheckUtils]: 80: Hoare triple {20867#(and (<= main_~b~0 main_~c~0) (= (+ (* (- 2) main_~b~0) main_~a~0) main_~c~0) (= main_~k~0 2) (not (<= (* main_~b~0 4) main_~a~0)))} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {20623#true} is VALID [2022-04-27 13:19:17,437 INFO L290 TraceCheckUtils]: 81: Hoare triple {20623#true} ~cond := #in~cond; {20623#true} is VALID [2022-04-27 13:19:17,437 INFO L290 TraceCheckUtils]: 82: Hoare triple {20623#true} assume !(0 == ~cond); {20623#true} is VALID [2022-04-27 13:19:17,437 INFO L290 TraceCheckUtils]: 83: Hoare triple {20623#true} assume true; {20623#true} is VALID [2022-04-27 13:19:17,438 INFO L284 TraceCheckUtils]: 84: Hoare quadruple {20623#true} {20867#(and (<= main_~b~0 main_~c~0) (= (+ (* (- 2) main_~b~0) main_~a~0) main_~c~0) (= main_~k~0 2) (not (<= (* main_~b~0 4) main_~a~0)))} #102#return; {20867#(and (<= main_~b~0 main_~c~0) (= (+ (* (- 2) main_~b~0) main_~a~0) main_~c~0) (= main_~k~0 2) (not (<= (* main_~b~0 4) main_~a~0)))} is VALID [2022-04-27 13:19:17,438 INFO L272 TraceCheckUtils]: 85: Hoare triple {20867#(and (<= main_~b~0 main_~c~0) (= (+ (* (- 2) main_~b~0) main_~a~0) main_~c~0) (= main_~k~0 2) (not (<= (* main_~b~0 4) main_~a~0)))} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {20623#true} is VALID [2022-04-27 13:19:17,438 INFO L290 TraceCheckUtils]: 86: Hoare triple {20623#true} ~cond := #in~cond; {20623#true} is VALID [2022-04-27 13:19:17,438 INFO L290 TraceCheckUtils]: 87: Hoare triple {20623#true} assume !(0 == ~cond); {20623#true} is VALID [2022-04-27 13:19:17,438 INFO L290 TraceCheckUtils]: 88: Hoare triple {20623#true} assume true; {20623#true} is VALID [2022-04-27 13:19:17,439 INFO L284 TraceCheckUtils]: 89: Hoare quadruple {20623#true} {20867#(and (<= main_~b~0 main_~c~0) (= (+ (* (- 2) main_~b~0) main_~a~0) main_~c~0) (= main_~k~0 2) (not (<= (* main_~b~0 4) main_~a~0)))} #104#return; {20867#(and (<= main_~b~0 main_~c~0) (= (+ (* (- 2) main_~b~0) main_~a~0) main_~c~0) (= main_~k~0 2) (not (<= (* main_~b~0 4) main_~a~0)))} is VALID [2022-04-27 13:19:17,439 INFO L272 TraceCheckUtils]: 90: Hoare triple {20867#(and (<= main_~b~0 main_~c~0) (= (+ (* (- 2) main_~b~0) main_~a~0) main_~c~0) (= main_~k~0 2) (not (<= (* main_~b~0 4) main_~a~0)))} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {20904#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 13:19:17,440 INFO L290 TraceCheckUtils]: 91: Hoare triple {20904#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {20908#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 13:19:17,440 INFO L290 TraceCheckUtils]: 92: Hoare triple {20908#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {20624#false} is VALID [2022-04-27 13:19:17,440 INFO L290 TraceCheckUtils]: 93: Hoare triple {20624#false} assume !false; {20624#false} is VALID [2022-04-27 13:19:17,440 INFO L134 CoverageAnalysis]: Checked inductivity of 240 backedges. 20 proven. 16 refuted. 0 times theorem prover too weak. 204 trivial. 0 not checked. [2022-04-27 13:19:17,440 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 13:19:18,281 INFO L290 TraceCheckUtils]: 93: Hoare triple {20624#false} assume !false; {20624#false} is VALID [2022-04-27 13:19:18,281 INFO L290 TraceCheckUtils]: 92: Hoare triple {20908#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {20624#false} is VALID [2022-04-27 13:19:18,281 INFO L290 TraceCheckUtils]: 91: Hoare triple {20904#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {20908#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 13:19:18,282 INFO L272 TraceCheckUtils]: 90: Hoare triple {20924#(= main_~a~0 (+ main_~c~0 (* main_~b~0 main_~k~0)))} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {20904#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 13:19:18,283 INFO L284 TraceCheckUtils]: 89: Hoare quadruple {20623#true} {20924#(= main_~a~0 (+ main_~c~0 (* main_~b~0 main_~k~0)))} #104#return; {20924#(= main_~a~0 (+ main_~c~0 (* main_~b~0 main_~k~0)))} is VALID [2022-04-27 13:19:18,283 INFO L290 TraceCheckUtils]: 88: Hoare triple {20623#true} assume true; {20623#true} is VALID [2022-04-27 13:19:18,283 INFO L290 TraceCheckUtils]: 87: Hoare triple {20623#true} assume !(0 == ~cond); {20623#true} is VALID [2022-04-27 13:19:18,283 INFO L290 TraceCheckUtils]: 86: Hoare triple {20623#true} ~cond := #in~cond; {20623#true} is VALID [2022-04-27 13:19:18,283 INFO L272 TraceCheckUtils]: 85: Hoare triple {20924#(= main_~a~0 (+ main_~c~0 (* main_~b~0 main_~k~0)))} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {20623#true} is VALID [2022-04-27 13:19:18,283 INFO L284 TraceCheckUtils]: 84: Hoare quadruple {20623#true} {20924#(= main_~a~0 (+ main_~c~0 (* main_~b~0 main_~k~0)))} #102#return; {20924#(= main_~a~0 (+ main_~c~0 (* main_~b~0 main_~k~0)))} is VALID [2022-04-27 13:19:18,283 INFO L290 TraceCheckUtils]: 83: Hoare triple {20623#true} assume true; {20623#true} is VALID [2022-04-27 13:19:18,284 INFO L290 TraceCheckUtils]: 82: Hoare triple {20623#true} assume !(0 == ~cond); {20623#true} is VALID [2022-04-27 13:19:18,284 INFO L290 TraceCheckUtils]: 81: Hoare triple {20623#true} ~cond := #in~cond; {20623#true} is VALID [2022-04-27 13:19:18,284 INFO L272 TraceCheckUtils]: 80: Hoare triple {20924#(= main_~a~0 (+ main_~c~0 (* main_~b~0 main_~k~0)))} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {20623#true} is VALID [2022-04-27 13:19:18,284 INFO L290 TraceCheckUtils]: 79: Hoare triple {20924#(= main_~a~0 (+ main_~c~0 (* main_~b~0 main_~k~0)))} assume !false; {20924#(= main_~a~0 (+ main_~c~0 (* main_~b~0 main_~k~0)))} is VALID [2022-04-27 13:19:18,284 INFO L290 TraceCheckUtils]: 78: Hoare triple {20961#(or (= main_~a~0 (+ main_~c~0 (* main_~b~0 main_~k~0))) (not (<= main_~b~0 main_~c~0)))} assume !!(~c~0 >= ~b~0);havoc ~d~0;havoc ~v~0;~d~0 := 1;~v~0 := ~b~0; {20924#(= main_~a~0 (+ main_~c~0 (* main_~b~0 main_~k~0)))} is VALID [2022-04-27 13:19:18,285 INFO L290 TraceCheckUtils]: 77: Hoare triple {20961#(or (= main_~a~0 (+ main_~c~0 (* main_~b~0 main_~k~0))) (not (<= main_~b~0 main_~c~0)))} assume !false; {20961#(or (= main_~a~0 (+ main_~c~0 (* main_~b~0 main_~k~0))) (not (<= main_~b~0 main_~c~0)))} is VALID [2022-04-27 13:19:18,287 INFO L290 TraceCheckUtils]: 76: Hoare triple {20968#(or (not (<= (+ main_~b~0 main_~v~0) main_~c~0)) (= main_~a~0 (+ main_~c~0 (* main_~b~0 (+ main_~d~0 main_~k~0)) (* (- 1) main_~v~0))))} ~c~0 := ~c~0 - ~v~0;~k~0 := ~k~0 + ~d~0; {20961#(or (= main_~a~0 (+ main_~c~0 (* main_~b~0 main_~k~0))) (not (<= main_~b~0 main_~c~0)))} is VALID [2022-04-27 13:19:18,287 INFO L290 TraceCheckUtils]: 75: Hoare triple {20972#(or (not (<= (+ main_~b~0 main_~v~0) main_~c~0)) (= main_~a~0 (+ main_~c~0 (* main_~b~0 (+ main_~d~0 main_~k~0)) (* (- 1) main_~v~0))) (<= (* main_~v~0 2) main_~c~0))} assume !(~c~0 >= 2 * ~v~0); {20968#(or (not (<= (+ main_~b~0 main_~v~0) main_~c~0)) (= main_~a~0 (+ main_~c~0 (* main_~b~0 (+ main_~d~0 main_~k~0)) (* (- 1) main_~v~0))))} is VALID [2022-04-27 13:19:18,288 INFO L284 TraceCheckUtils]: 74: Hoare quadruple {20623#true} {20972#(or (not (<= (+ main_~b~0 main_~v~0) main_~c~0)) (= main_~a~0 (+ main_~c~0 (* main_~b~0 (+ main_~d~0 main_~k~0)) (* (- 1) main_~v~0))) (<= (* main_~v~0 2) main_~c~0))} #108#return; {20972#(or (not (<= (+ main_~b~0 main_~v~0) main_~c~0)) (= main_~a~0 (+ main_~c~0 (* main_~b~0 (+ main_~d~0 main_~k~0)) (* (- 1) main_~v~0))) (<= (* main_~v~0 2) main_~c~0))} is VALID [2022-04-27 13:19:18,288 INFO L290 TraceCheckUtils]: 73: Hoare triple {20623#true} assume true; {20623#true} is VALID [2022-04-27 13:19:18,288 INFO L290 TraceCheckUtils]: 72: Hoare triple {20623#true} assume !(0 == ~cond); {20623#true} is VALID [2022-04-27 13:19:18,288 INFO L290 TraceCheckUtils]: 71: Hoare triple {20623#true} ~cond := #in~cond; {20623#true} is VALID [2022-04-27 13:19:18,288 INFO L272 TraceCheckUtils]: 70: Hoare triple {20972#(or (not (<= (+ main_~b~0 main_~v~0) main_~c~0)) (= main_~a~0 (+ main_~c~0 (* main_~b~0 (+ main_~d~0 main_~k~0)) (* (- 1) main_~v~0))) (<= (* main_~v~0 2) main_~c~0))} call __VERIFIER_assert((if ~v~0 == ~b~0 * ~d~0 then 1 else 0)); {20623#true} is VALID [2022-04-27 13:19:18,288 INFO L284 TraceCheckUtils]: 69: Hoare quadruple {20623#true} {20972#(or (not (<= (+ main_~b~0 main_~v~0) main_~c~0)) (= main_~a~0 (+ main_~c~0 (* main_~b~0 (+ main_~d~0 main_~k~0)) (* (- 1) main_~v~0))) (<= (* main_~v~0 2) main_~c~0))} #106#return; {20972#(or (not (<= (+ main_~b~0 main_~v~0) main_~c~0)) (= main_~a~0 (+ main_~c~0 (* main_~b~0 (+ main_~d~0 main_~k~0)) (* (- 1) main_~v~0))) (<= (* main_~v~0 2) main_~c~0))} is VALID [2022-04-27 13:19:18,288 INFO L290 TraceCheckUtils]: 68: Hoare triple {20623#true} assume true; {20623#true} is VALID [2022-04-27 13:19:18,288 INFO L290 TraceCheckUtils]: 67: Hoare triple {20623#true} assume !(0 == ~cond); {20623#true} is VALID [2022-04-27 13:19:18,289 INFO L290 TraceCheckUtils]: 66: Hoare triple {20623#true} ~cond := #in~cond; {20623#true} is VALID [2022-04-27 13:19:18,289 INFO L272 TraceCheckUtils]: 65: Hoare triple {20972#(or (not (<= (+ main_~b~0 main_~v~0) main_~c~0)) (= main_~a~0 (+ main_~c~0 (* main_~b~0 (+ main_~d~0 main_~k~0)) (* (- 1) main_~v~0))) (<= (* main_~v~0 2) main_~c~0))} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {20623#true} is VALID [2022-04-27 13:19:18,289 INFO L284 TraceCheckUtils]: 64: Hoare quadruple {20623#true} {20972#(or (not (<= (+ main_~b~0 main_~v~0) main_~c~0)) (= main_~a~0 (+ main_~c~0 (* main_~b~0 (+ main_~d~0 main_~k~0)) (* (- 1) main_~v~0))) (<= (* main_~v~0 2) main_~c~0))} #104#return; {20972#(or (not (<= (+ main_~b~0 main_~v~0) main_~c~0)) (= main_~a~0 (+ main_~c~0 (* main_~b~0 (+ main_~d~0 main_~k~0)) (* (- 1) main_~v~0))) (<= (* main_~v~0 2) main_~c~0))} is VALID [2022-04-27 13:19:18,289 INFO L290 TraceCheckUtils]: 63: Hoare triple {20623#true} assume true; {20623#true} is VALID [2022-04-27 13:19:18,289 INFO L290 TraceCheckUtils]: 62: Hoare triple {20623#true} assume !(0 == ~cond); {20623#true} is VALID [2022-04-27 13:19:18,289 INFO L290 TraceCheckUtils]: 61: Hoare triple {20623#true} ~cond := #in~cond; {20623#true} is VALID [2022-04-27 13:19:18,290 INFO L272 TraceCheckUtils]: 60: Hoare triple {20972#(or (not (<= (+ main_~b~0 main_~v~0) main_~c~0)) (= main_~a~0 (+ main_~c~0 (* main_~b~0 (+ main_~d~0 main_~k~0)) (* (- 1) main_~v~0))) (<= (* main_~v~0 2) main_~c~0))} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {20623#true} is VALID [2022-04-27 13:19:18,290 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {20623#true} {20972#(or (not (<= (+ main_~b~0 main_~v~0) main_~c~0)) (= main_~a~0 (+ main_~c~0 (* main_~b~0 (+ main_~d~0 main_~k~0)) (* (- 1) main_~v~0))) (<= (* main_~v~0 2) main_~c~0))} #102#return; {20972#(or (not (<= (+ main_~b~0 main_~v~0) main_~c~0)) (= main_~a~0 (+ main_~c~0 (* main_~b~0 (+ main_~d~0 main_~k~0)) (* (- 1) main_~v~0))) (<= (* main_~v~0 2) main_~c~0))} is VALID [2022-04-27 13:19:18,290 INFO L290 TraceCheckUtils]: 58: Hoare triple {20623#true} assume true; {20623#true} is VALID [2022-04-27 13:19:18,290 INFO L290 TraceCheckUtils]: 57: Hoare triple {20623#true} assume !(0 == ~cond); {20623#true} is VALID [2022-04-27 13:19:18,290 INFO L290 TraceCheckUtils]: 56: Hoare triple {20623#true} ~cond := #in~cond; {20623#true} is VALID [2022-04-27 13:19:18,290 INFO L272 TraceCheckUtils]: 55: Hoare triple {20972#(or (not (<= (+ main_~b~0 main_~v~0) main_~c~0)) (= main_~a~0 (+ main_~c~0 (* main_~b~0 (+ main_~d~0 main_~k~0)) (* (- 1) main_~v~0))) (<= (* main_~v~0 2) main_~c~0))} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {20623#true} is VALID [2022-04-27 13:19:18,291 INFO L290 TraceCheckUtils]: 54: Hoare triple {20972#(or (not (<= (+ main_~b~0 main_~v~0) main_~c~0)) (= main_~a~0 (+ main_~c~0 (* main_~b~0 (+ main_~d~0 main_~k~0)) (* (- 1) main_~v~0))) (<= (* main_~v~0 2) main_~c~0))} assume !false; {20972#(or (not (<= (+ main_~b~0 main_~v~0) main_~c~0)) (= main_~a~0 (+ main_~c~0 (* main_~b~0 (+ main_~d~0 main_~k~0)) (* (- 1) main_~v~0))) (<= (* main_~v~0 2) main_~c~0))} is VALID [2022-04-27 13:19:18,293 INFO L290 TraceCheckUtils]: 53: Hoare triple {21039#(or (<= (* main_~v~0 4) main_~c~0) (= main_~a~0 (+ main_~c~0 (* (+ main_~k~0 (* main_~d~0 2)) main_~b~0) (* (- 2) main_~v~0))) (not (<= (+ (* main_~v~0 2) main_~b~0) main_~c~0)))} assume !!(~c~0 >= 2 * ~v~0);~d~0 := 2 * ~d~0;~v~0 := 2 * ~v~0; {20972#(or (not (<= (+ main_~b~0 main_~v~0) main_~c~0)) (= main_~a~0 (+ main_~c~0 (* main_~b~0 (+ main_~d~0 main_~k~0)) (* (- 1) main_~v~0))) (<= (* main_~v~0 2) main_~c~0))} is VALID [2022-04-27 13:19:18,293 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {20623#true} {21039#(or (<= (* main_~v~0 4) main_~c~0) (= main_~a~0 (+ main_~c~0 (* (+ main_~k~0 (* main_~d~0 2)) main_~b~0) (* (- 2) main_~v~0))) (not (<= (+ (* main_~v~0 2) main_~b~0) main_~c~0)))} #108#return; {21039#(or (<= (* main_~v~0 4) main_~c~0) (= main_~a~0 (+ main_~c~0 (* (+ main_~k~0 (* main_~d~0 2)) main_~b~0) (* (- 2) main_~v~0))) (not (<= (+ (* main_~v~0 2) main_~b~0) main_~c~0)))} is VALID [2022-04-27 13:19:18,293 INFO L290 TraceCheckUtils]: 51: Hoare triple {20623#true} assume true; {20623#true} is VALID [2022-04-27 13:19:18,293 INFO L290 TraceCheckUtils]: 50: Hoare triple {20623#true} assume !(0 == ~cond); {20623#true} is VALID [2022-04-27 13:19:18,294 INFO L290 TraceCheckUtils]: 49: Hoare triple {20623#true} ~cond := #in~cond; {20623#true} is VALID [2022-04-27 13:19:18,294 INFO L272 TraceCheckUtils]: 48: Hoare triple {21039#(or (<= (* main_~v~0 4) main_~c~0) (= main_~a~0 (+ main_~c~0 (* (+ main_~k~0 (* main_~d~0 2)) main_~b~0) (* (- 2) main_~v~0))) (not (<= (+ (* main_~v~0 2) main_~b~0) main_~c~0)))} call __VERIFIER_assert((if ~v~0 == ~b~0 * ~d~0 then 1 else 0)); {20623#true} is VALID [2022-04-27 13:19:18,294 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {20623#true} {21039#(or (<= (* main_~v~0 4) main_~c~0) (= main_~a~0 (+ main_~c~0 (* (+ main_~k~0 (* main_~d~0 2)) main_~b~0) (* (- 2) main_~v~0))) (not (<= (+ (* main_~v~0 2) main_~b~0) main_~c~0)))} #106#return; {21039#(or (<= (* main_~v~0 4) main_~c~0) (= main_~a~0 (+ main_~c~0 (* (+ main_~k~0 (* main_~d~0 2)) main_~b~0) (* (- 2) main_~v~0))) (not (<= (+ (* main_~v~0 2) main_~b~0) main_~c~0)))} is VALID [2022-04-27 13:19:18,294 INFO L290 TraceCheckUtils]: 46: Hoare triple {20623#true} assume true; {20623#true} is VALID [2022-04-27 13:19:18,294 INFO L290 TraceCheckUtils]: 45: Hoare triple {20623#true} assume !(0 == ~cond); {20623#true} is VALID [2022-04-27 13:19:18,294 INFO L290 TraceCheckUtils]: 44: Hoare triple {20623#true} ~cond := #in~cond; {20623#true} is VALID [2022-04-27 13:19:18,294 INFO L272 TraceCheckUtils]: 43: Hoare triple {21039#(or (<= (* main_~v~0 4) main_~c~0) (= main_~a~0 (+ main_~c~0 (* (+ main_~k~0 (* main_~d~0 2)) main_~b~0) (* (- 2) main_~v~0))) (not (<= (+ (* main_~v~0 2) main_~b~0) main_~c~0)))} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {20623#true} is VALID [2022-04-27 13:19:18,295 INFO L284 TraceCheckUtils]: 42: Hoare quadruple {20623#true} {21039#(or (<= (* main_~v~0 4) main_~c~0) (= main_~a~0 (+ main_~c~0 (* (+ main_~k~0 (* main_~d~0 2)) main_~b~0) (* (- 2) main_~v~0))) (not (<= (+ (* main_~v~0 2) main_~b~0) main_~c~0)))} #104#return; {21039#(or (<= (* main_~v~0 4) main_~c~0) (= main_~a~0 (+ main_~c~0 (* (+ main_~k~0 (* main_~d~0 2)) main_~b~0) (* (- 2) main_~v~0))) (not (<= (+ (* main_~v~0 2) main_~b~0) main_~c~0)))} is VALID [2022-04-27 13:19:18,295 INFO L290 TraceCheckUtils]: 41: Hoare triple {20623#true} assume true; {20623#true} is VALID [2022-04-27 13:19:18,295 INFO L290 TraceCheckUtils]: 40: Hoare triple {20623#true} assume !(0 == ~cond); {20623#true} is VALID [2022-04-27 13:19:18,295 INFO L290 TraceCheckUtils]: 39: Hoare triple {20623#true} ~cond := #in~cond; {20623#true} is VALID [2022-04-27 13:19:18,295 INFO L272 TraceCheckUtils]: 38: Hoare triple {21039#(or (<= (* main_~v~0 4) main_~c~0) (= main_~a~0 (+ main_~c~0 (* (+ main_~k~0 (* main_~d~0 2)) main_~b~0) (* (- 2) main_~v~0))) (not (<= (+ (* main_~v~0 2) main_~b~0) main_~c~0)))} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {20623#true} is VALID [2022-04-27 13:19:18,296 INFO L284 TraceCheckUtils]: 37: Hoare quadruple {20623#true} {21039#(or (<= (* main_~v~0 4) main_~c~0) (= main_~a~0 (+ main_~c~0 (* (+ main_~k~0 (* main_~d~0 2)) main_~b~0) (* (- 2) main_~v~0))) (not (<= (+ (* main_~v~0 2) main_~b~0) main_~c~0)))} #102#return; {21039#(or (<= (* main_~v~0 4) main_~c~0) (= main_~a~0 (+ main_~c~0 (* (+ main_~k~0 (* main_~d~0 2)) main_~b~0) (* (- 2) main_~v~0))) (not (<= (+ (* main_~v~0 2) main_~b~0) main_~c~0)))} is VALID [2022-04-27 13:19:18,296 INFO L290 TraceCheckUtils]: 36: Hoare triple {20623#true} assume true; {20623#true} is VALID [2022-04-27 13:19:18,296 INFO L290 TraceCheckUtils]: 35: Hoare triple {20623#true} assume !(0 == ~cond); {20623#true} is VALID [2022-04-27 13:19:18,296 INFO L290 TraceCheckUtils]: 34: Hoare triple {20623#true} ~cond := #in~cond; {20623#true} is VALID [2022-04-27 13:19:18,296 INFO L272 TraceCheckUtils]: 33: Hoare triple {21039#(or (<= (* main_~v~0 4) main_~c~0) (= main_~a~0 (+ main_~c~0 (* (+ main_~k~0 (* main_~d~0 2)) main_~b~0) (* (- 2) main_~v~0))) (not (<= (+ (* main_~v~0 2) main_~b~0) main_~c~0)))} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {20623#true} is VALID [2022-04-27 13:19:18,297 INFO L290 TraceCheckUtils]: 32: Hoare triple {21039#(or (<= (* main_~v~0 4) main_~c~0) (= main_~a~0 (+ main_~c~0 (* (+ main_~k~0 (* main_~d~0 2)) main_~b~0) (* (- 2) main_~v~0))) (not (<= (+ (* main_~v~0 2) main_~b~0) main_~c~0)))} assume !false; {21039#(or (<= (* main_~v~0 4) main_~c~0) (= main_~a~0 (+ main_~c~0 (* (+ main_~k~0 (* main_~d~0 2)) main_~b~0) (* (- 2) main_~v~0))) (not (<= (+ (* main_~v~0 2) main_~b~0) main_~c~0)))} is VALID [2022-04-27 13:19:18,297 INFO L290 TraceCheckUtils]: 31: Hoare triple {21106#(or (not (<= (* main_~b~0 3) main_~c~0)) (= main_~a~0 (+ (* (- 2) main_~b~0) main_~c~0 (* (+ main_~k~0 2) main_~b~0))) (<= (* main_~b~0 4) main_~c~0))} assume !!(~c~0 >= ~b~0);havoc ~d~0;havoc ~v~0;~d~0 := 1;~v~0 := ~b~0; {21039#(or (<= (* main_~v~0 4) main_~c~0) (= main_~a~0 (+ main_~c~0 (* (+ main_~k~0 (* main_~d~0 2)) main_~b~0) (* (- 2) main_~v~0))) (not (<= (+ (* main_~v~0 2) main_~b~0) main_~c~0)))} is VALID [2022-04-27 13:19:18,297 INFO L290 TraceCheckUtils]: 30: Hoare triple {21106#(or (not (<= (* main_~b~0 3) main_~c~0)) (= main_~a~0 (+ (* (- 2) main_~b~0) main_~c~0 (* (+ main_~k~0 2) main_~b~0))) (<= (* main_~b~0 4) main_~c~0))} assume !false; {21106#(or (not (<= (* main_~b~0 3) main_~c~0)) (= main_~a~0 (+ (* (- 2) main_~b~0) main_~c~0 (* (+ main_~k~0 2) main_~b~0))) (<= (* main_~b~0 4) main_~c~0))} is VALID [2022-04-27 13:19:18,298 INFO L290 TraceCheckUtils]: 29: Hoare triple {20623#true} assume !!(0 != ~b~0);havoc ~c~0;havoc ~k~0;~c~0 := ~a~0;~k~0 := 0; {21106#(or (not (<= (* main_~b~0 3) main_~c~0)) (= main_~a~0 (+ (* (- 2) main_~b~0) main_~c~0 (* (+ main_~k~0 2) main_~b~0))) (<= (* main_~b~0 4) main_~c~0))} is VALID [2022-04-27 13:19:18,298 INFO L290 TraceCheckUtils]: 28: Hoare triple {20623#true} assume !false; {20623#true} is VALID [2022-04-27 13:19:18,298 INFO L290 TraceCheckUtils]: 27: Hoare triple {20623#true} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1; {20623#true} is VALID [2022-04-27 13:19:18,298 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {20623#true} {20623#true} #100#return; {20623#true} is VALID [2022-04-27 13:19:18,298 INFO L290 TraceCheckUtils]: 25: Hoare triple {20623#true} assume true; {20623#true} is VALID [2022-04-27 13:19:18,298 INFO L290 TraceCheckUtils]: 24: Hoare triple {20623#true} assume !(0 == ~cond); {20623#true} is VALID [2022-04-27 13:19:18,298 INFO L290 TraceCheckUtils]: 23: Hoare triple {20623#true} ~cond := #in~cond; {20623#true} is VALID [2022-04-27 13:19:18,298 INFO L272 TraceCheckUtils]: 22: Hoare triple {20623#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {20623#true} is VALID [2022-04-27 13:19:18,298 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {20623#true} {20623#true} #98#return; {20623#true} is VALID [2022-04-27 13:19:18,298 INFO L290 TraceCheckUtils]: 20: Hoare triple {20623#true} assume true; {20623#true} is VALID [2022-04-27 13:19:18,299 INFO L290 TraceCheckUtils]: 19: Hoare triple {20623#true} assume !(0 == ~cond); {20623#true} is VALID [2022-04-27 13:19:18,299 INFO L290 TraceCheckUtils]: 18: Hoare triple {20623#true} ~cond := #in~cond; {20623#true} is VALID [2022-04-27 13:19:18,299 INFO L272 TraceCheckUtils]: 17: Hoare triple {20623#true} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {20623#true} is VALID [2022-04-27 13:19:18,299 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {20623#true} {20623#true} #96#return; {20623#true} is VALID [2022-04-27 13:19:18,299 INFO L290 TraceCheckUtils]: 15: Hoare triple {20623#true} assume true; {20623#true} is VALID [2022-04-27 13:19:18,299 INFO L290 TraceCheckUtils]: 14: Hoare triple {20623#true} assume !(0 == ~cond); {20623#true} is VALID [2022-04-27 13:19:18,299 INFO L290 TraceCheckUtils]: 13: Hoare triple {20623#true} ~cond := #in~cond; {20623#true} is VALID [2022-04-27 13:19:18,299 INFO L272 TraceCheckUtils]: 12: Hoare triple {20623#true} call assume_abort_if_not((if ~y~0 >= 0 && ~y~0 <= 50 then 1 else 0)); {20623#true} is VALID [2022-04-27 13:19:18,299 INFO L290 TraceCheckUtils]: 11: Hoare triple {20623#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {20623#true} is VALID [2022-04-27 13:19:18,299 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {20623#true} {20623#true} #94#return; {20623#true} is VALID [2022-04-27 13:19:18,299 INFO L290 TraceCheckUtils]: 9: Hoare triple {20623#true} assume true; {20623#true} is VALID [2022-04-27 13:19:18,299 INFO L290 TraceCheckUtils]: 8: Hoare triple {20623#true} assume !(0 == ~cond); {20623#true} is VALID [2022-04-27 13:19:18,299 INFO L290 TraceCheckUtils]: 7: Hoare triple {20623#true} ~cond := #in~cond; {20623#true} is VALID [2022-04-27 13:19:18,299 INFO L272 TraceCheckUtils]: 6: Hoare triple {20623#true} call assume_abort_if_not((if ~x~0 >= 0 && ~x~0 <= 50 then 1 else 0)); {20623#true} is VALID [2022-04-27 13:19:18,299 INFO L290 TraceCheckUtils]: 5: Hoare triple {20623#true} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~s~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4; {20623#true} is VALID [2022-04-27 13:19:18,299 INFO L272 TraceCheckUtils]: 4: Hoare triple {20623#true} call #t~ret6 := main(); {20623#true} is VALID [2022-04-27 13:19:18,299 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {20623#true} {20623#true} #112#return; {20623#true} is VALID [2022-04-27 13:19:18,300 INFO L290 TraceCheckUtils]: 2: Hoare triple {20623#true} assume true; {20623#true} is VALID [2022-04-27 13:19:18,300 INFO L290 TraceCheckUtils]: 1: Hoare triple {20623#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(11, 2);call #Ultimate.allocInit(12, 3); {20623#true} is VALID [2022-04-27 13:19:18,300 INFO L272 TraceCheckUtils]: 0: Hoare triple {20623#true} call ULTIMATE.init(); {20623#true} is VALID [2022-04-27 13:19:18,300 INFO L134 CoverageAnalysis]: Checked inductivity of 240 backedges. 22 proven. 14 refuted. 0 times theorem prover too weak. 204 trivial. 0 not checked. [2022-04-27 13:19:18,300 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 13:19:18,300 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [67697491] [2022-04-27 13:19:18,300 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 13:19:18,300 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1064092079] [2022-04-27 13:19:18,300 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1064092079] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 13:19:18,300 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-27 13:19:18,300 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 16 [2022-04-27 13:19:18,301 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [431575560] [2022-04-27 13:19:18,301 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-27 13:19:18,301 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 2.3125) internal successors, (37), 15 states have internal predecessors, (37), 7 states have call successors, (28), 2 states have call predecessors, (28), 1 states have return successors, (25), 7 states have call predecessors, (25), 7 states have call successors, (25) Word has length 94 [2022-04-27 13:19:18,301 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 13:19:18,301 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 16 states, 16 states have (on average 2.3125) internal successors, (37), 15 states have internal predecessors, (37), 7 states have call successors, (28), 2 states have call predecessors, (28), 1 states have return successors, (25), 7 states have call predecessors, (25), 7 states have call successors, (25) [2022-04-27 13:19:18,388 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 90 edges. 90 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 13:19:18,389 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-04-27 13:19:18,389 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 13:19:18,389 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-04-27 13:19:18,389 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=171, Unknown=0, NotChecked=0, Total=240 [2022-04-27 13:19:18,389 INFO L87 Difference]: Start difference. First operand 370 states and 513 transitions. Second operand has 16 states, 16 states have (on average 2.3125) internal successors, (37), 15 states have internal predecessors, (37), 7 states have call successors, (28), 2 states have call predecessors, (28), 1 states have return successors, (25), 7 states have call predecessors, (25), 7 states have call successors, (25) [2022-04-27 13:19:26,131 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:19:26,131 INFO L93 Difference]: Finished difference Result 897 states and 1392 transitions. [2022-04-27 13:19:26,132 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-04-27 13:19:26,132 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 2.3125) internal successors, (37), 15 states have internal predecessors, (37), 7 states have call successors, (28), 2 states have call predecessors, (28), 1 states have return successors, (25), 7 states have call predecessors, (25), 7 states have call successors, (25) Word has length 94 [2022-04-27 13:19:26,132 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 13:19:26,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 16 states have (on average 2.3125) internal successors, (37), 15 states have internal predecessors, (37), 7 states have call successors, (28), 2 states have call predecessors, (28), 1 states have return successors, (25), 7 states have call predecessors, (25), 7 states have call successors, (25) [2022-04-27 13:19:26,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 209 transitions. [2022-04-27 13:19:26,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 16 states have (on average 2.3125) internal successors, (37), 15 states have internal predecessors, (37), 7 states have call successors, (28), 2 states have call predecessors, (28), 1 states have return successors, (25), 7 states have call predecessors, (25), 7 states have call successors, (25) [2022-04-27 13:19:26,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 209 transitions. [2022-04-27 13:19:26,141 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 24 states and 209 transitions. [2022-04-27 13:19:26,469 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 209 edges. 209 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 13:19:26,519 INFO L225 Difference]: With dead ends: 897 [2022-04-27 13:19:26,519 INFO L226 Difference]: Without dead ends: 895 [2022-04-27 13:19:26,520 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 199 GetRequests, 172 SyntacticMatches, 1 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 188 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=222, Invalid=534, Unknown=0, NotChecked=0, Total=756 [2022-04-27 13:19:26,521 INFO L413 NwaCegarLoop]: 85 mSDtfsCounter, 104 mSDsluCounter, 282 mSDsCounter, 0 mSdLazyCounter, 442 mSolverCounterSat, 173 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 110 SdHoareTripleChecker+Valid, 367 SdHoareTripleChecker+Invalid, 615 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 173 IncrementalHoareTripleChecker+Valid, 442 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2022-04-27 13:19:26,521 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [110 Valid, 367 Invalid, 615 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [173 Valid, 442 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2022-04-27 13:19:26,522 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 895 states. [2022-04-27 13:19:30,181 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 895 to 823. [2022-04-27 13:19:30,182 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 13:19:30,184 INFO L82 GeneralOperation]: Start isEquivalent. First operand 895 states. Second operand has 823 states, 395 states have (on average 1.3063291139240507) internal successors, (516), 395 states have internal predecessors, (516), 398 states have call successors, (398), 30 states have call predecessors, (398), 29 states have return successors, (397), 397 states have call predecessors, (397), 397 states have call successors, (397) [2022-04-27 13:19:30,185 INFO L74 IsIncluded]: Start isIncluded. First operand 895 states. Second operand has 823 states, 395 states have (on average 1.3063291139240507) internal successors, (516), 395 states have internal predecessors, (516), 398 states have call successors, (398), 30 states have call predecessors, (398), 29 states have return successors, (397), 397 states have call predecessors, (397), 397 states have call successors, (397) [2022-04-27 13:19:30,186 INFO L87 Difference]: Start difference. First operand 895 states. Second operand has 823 states, 395 states have (on average 1.3063291139240507) internal successors, (516), 395 states have internal predecessors, (516), 398 states have call successors, (398), 30 states have call predecessors, (398), 29 states have return successors, (397), 397 states have call predecessors, (397), 397 states have call successors, (397) [2022-04-27 13:19:30,241 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:19:30,241 INFO L93 Difference]: Finished difference Result 895 states and 1390 transitions. [2022-04-27 13:19:30,241 INFO L276 IsEmpty]: Start isEmpty. Operand 895 states and 1390 transitions. [2022-04-27 13:19:30,246 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 13:19:30,246 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 13:19:30,247 INFO L74 IsIncluded]: Start isIncluded. First operand has 823 states, 395 states have (on average 1.3063291139240507) internal successors, (516), 395 states have internal predecessors, (516), 398 states have call successors, (398), 30 states have call predecessors, (398), 29 states have return successors, (397), 397 states have call predecessors, (397), 397 states have call successors, (397) Second operand 895 states. [2022-04-27 13:19:30,248 INFO L87 Difference]: Start difference. First operand has 823 states, 395 states have (on average 1.3063291139240507) internal successors, (516), 395 states have internal predecessors, (516), 398 states have call successors, (398), 30 states have call predecessors, (398), 29 states have return successors, (397), 397 states have call predecessors, (397), 397 states have call successors, (397) Second operand 895 states. [2022-04-27 13:19:30,299 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:19:30,299 INFO L93 Difference]: Finished difference Result 895 states and 1390 transitions. [2022-04-27 13:19:30,299 INFO L276 IsEmpty]: Start isEmpty. Operand 895 states and 1390 transitions. [2022-04-27 13:19:30,303 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 13:19:30,303 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 13:19:30,303 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 13:19:30,303 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 13:19:30,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 823 states, 395 states have (on average 1.3063291139240507) internal successors, (516), 395 states have internal predecessors, (516), 398 states have call successors, (398), 30 states have call predecessors, (398), 29 states have return successors, (397), 397 states have call predecessors, (397), 397 states have call successors, (397) [2022-04-27 13:19:30,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 823 states to 823 states and 1311 transitions. [2022-04-27 13:19:30,369 INFO L78 Accepts]: Start accepts. Automaton has 823 states and 1311 transitions. Word has length 94 [2022-04-27 13:19:30,369 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 13:19:30,369 INFO L495 AbstractCegarLoop]: Abstraction has 823 states and 1311 transitions. [2022-04-27 13:19:30,370 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 2.3125) internal successors, (37), 15 states have internal predecessors, (37), 7 states have call successors, (28), 2 states have call predecessors, (28), 1 states have return successors, (25), 7 states have call predecessors, (25), 7 states have call successors, (25) [2022-04-27 13:19:30,370 INFO L276 IsEmpty]: Start isEmpty. Operand 823 states and 1311 transitions. [2022-04-27 13:19:30,372 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2022-04-27 13:19:30,372 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 13:19:30,372 INFO L195 NwaCegarLoop]: trace histogram [10, 9, 9, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 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, 1, 1] [2022-04-27 13:19:30,395 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2022-04-27 13:19:30,595 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2022-04-27 13:19:30,595 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 13:19:30,596 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 13:19:30,596 INFO L85 PathProgramCache]: Analyzing trace with hash 640779908, now seen corresponding path program 1 times [2022-04-27 13:19:30,596 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 13:19:30,596 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [619453517] [2022-04-27 13:19:30,596 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 13:19:30,596 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 13:19:30,607 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 13:19:30,607 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2053750259] [2022-04-27 13:19:30,607 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 13:19:30,607 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 13:19:30,607 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 13:19:30,608 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-27 13:19:30,615 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2022-04-27 13:19:30,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 13:19:30,670 INFO L263 TraceCheckSpWp]: Trace formula consists of 238 conjuncts, 53 conjunts are in the unsatisfiable core [2022-04-27 13:19:30,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 13:19:30,688 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 13:19:31,524 INFO L272 TraceCheckUtils]: 0: Hoare triple {25876#true} call ULTIMATE.init(); {25876#true} is VALID [2022-04-27 13:19:31,525 INFO L290 TraceCheckUtils]: 1: Hoare triple {25876#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(11, 2);call #Ultimate.allocInit(12, 3); {25876#true} is VALID [2022-04-27 13:19:31,525 INFO L290 TraceCheckUtils]: 2: Hoare triple {25876#true} assume true; {25876#true} is VALID [2022-04-27 13:19:31,525 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {25876#true} {25876#true} #112#return; {25876#true} is VALID [2022-04-27 13:19:31,525 INFO L272 TraceCheckUtils]: 4: Hoare triple {25876#true} call #t~ret6 := main(); {25876#true} is VALID [2022-04-27 13:19:31,525 INFO L290 TraceCheckUtils]: 5: Hoare triple {25876#true} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~s~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4; {25876#true} is VALID [2022-04-27 13:19:31,525 INFO L272 TraceCheckUtils]: 6: Hoare triple {25876#true} call assume_abort_if_not((if ~x~0 >= 0 && ~x~0 <= 50 then 1 else 0)); {25876#true} is VALID [2022-04-27 13:19:31,525 INFO L290 TraceCheckUtils]: 7: Hoare triple {25876#true} ~cond := #in~cond; {25876#true} is VALID [2022-04-27 13:19:31,525 INFO L290 TraceCheckUtils]: 8: Hoare triple {25876#true} assume !(0 == ~cond); {25876#true} is VALID [2022-04-27 13:19:31,525 INFO L290 TraceCheckUtils]: 9: Hoare triple {25876#true} assume true; {25876#true} is VALID [2022-04-27 13:19:31,525 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {25876#true} {25876#true} #94#return; {25876#true} is VALID [2022-04-27 13:19:31,525 INFO L290 TraceCheckUtils]: 11: Hoare triple {25876#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {25876#true} is VALID [2022-04-27 13:19:31,526 INFO L272 TraceCheckUtils]: 12: Hoare triple {25876#true} call assume_abort_if_not((if ~y~0 >= 0 && ~y~0 <= 50 then 1 else 0)); {25876#true} is VALID [2022-04-27 13:19:31,526 INFO L290 TraceCheckUtils]: 13: Hoare triple {25876#true} ~cond := #in~cond; {25876#true} is VALID [2022-04-27 13:19:31,526 INFO L290 TraceCheckUtils]: 14: Hoare triple {25876#true} assume !(0 == ~cond); {25876#true} is VALID [2022-04-27 13:19:31,526 INFO L290 TraceCheckUtils]: 15: Hoare triple {25876#true} assume true; {25876#true} is VALID [2022-04-27 13:19:31,526 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {25876#true} {25876#true} #96#return; {25876#true} is VALID [2022-04-27 13:19:31,526 INFO L272 TraceCheckUtils]: 17: Hoare triple {25876#true} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {25876#true} is VALID [2022-04-27 13:19:31,526 INFO L290 TraceCheckUtils]: 18: Hoare triple {25876#true} ~cond := #in~cond; {25876#true} is VALID [2022-04-27 13:19:31,526 INFO L290 TraceCheckUtils]: 19: Hoare triple {25876#true} assume !(0 == ~cond); {25876#true} is VALID [2022-04-27 13:19:31,526 INFO L290 TraceCheckUtils]: 20: Hoare triple {25876#true} assume true; {25876#true} is VALID [2022-04-27 13:19:31,526 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {25876#true} {25876#true} #98#return; {25876#true} is VALID [2022-04-27 13:19:31,526 INFO L272 TraceCheckUtils]: 22: Hoare triple {25876#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {25876#true} is VALID [2022-04-27 13:19:31,526 INFO L290 TraceCheckUtils]: 23: Hoare triple {25876#true} ~cond := #in~cond; {25876#true} is VALID [2022-04-27 13:19:31,526 INFO L290 TraceCheckUtils]: 24: Hoare triple {25876#true} assume !(0 == ~cond); {25876#true} is VALID [2022-04-27 13:19:31,526 INFO L290 TraceCheckUtils]: 25: Hoare triple {25876#true} assume true; {25876#true} is VALID [2022-04-27 13:19:31,526 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {25876#true} {25876#true} #100#return; {25876#true} is VALID [2022-04-27 13:19:31,527 INFO L290 TraceCheckUtils]: 27: Hoare triple {25876#true} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1; {25962#(and (= main_~r~0 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 13:19:31,527 INFO L290 TraceCheckUtils]: 28: Hoare triple {25962#(and (= main_~r~0 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; {25962#(and (= main_~r~0 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 13:19:31,528 INFO L290 TraceCheckUtils]: 29: Hoare triple {25962#(and (= main_~r~0 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 !!(0 != ~b~0);havoc ~c~0;havoc ~k~0;~c~0 := ~a~0;~k~0 := 0; {25969#(and (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~c~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-27 13:19:31,528 INFO L290 TraceCheckUtils]: 30: Hoare triple {25969#(and (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~c~0 main_~x~0) (= main_~p~0 1))} assume !false; {25969#(and (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~c~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-27 13:19:31,528 INFO L290 TraceCheckUtils]: 31: Hoare triple {25969#(and (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~c~0 main_~x~0) (= main_~p~0 1))} assume !!(~c~0 >= ~b~0);havoc ~d~0;havoc ~v~0;~d~0 := 1;~v~0 := ~b~0; {25976#(and (= main_~b~0 main_~v~0) (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~d~0 1) (= main_~q~0 0) (= main_~c~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-27 13:19:31,529 INFO L290 TraceCheckUtils]: 32: Hoare triple {25976#(and (= main_~b~0 main_~v~0) (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~d~0 1) (= main_~q~0 0) (= main_~c~0 main_~x~0) (= main_~p~0 1))} assume !false; {25976#(and (= main_~b~0 main_~v~0) (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~d~0 1) (= main_~q~0 0) (= main_~c~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-27 13:19:31,529 INFO L272 TraceCheckUtils]: 33: Hoare triple {25976#(and (= main_~b~0 main_~v~0) (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~d~0 1) (= main_~q~0 0) (= main_~c~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)); {25876#true} is VALID [2022-04-27 13:19:31,529 INFO L290 TraceCheckUtils]: 34: Hoare triple {25876#true} ~cond := #in~cond; {25876#true} is VALID [2022-04-27 13:19:31,529 INFO L290 TraceCheckUtils]: 35: Hoare triple {25876#true} assume !(0 == ~cond); {25876#true} is VALID [2022-04-27 13:19:31,529 INFO L290 TraceCheckUtils]: 36: Hoare triple {25876#true} assume true; {25876#true} is VALID [2022-04-27 13:19:31,530 INFO L284 TraceCheckUtils]: 37: Hoare quadruple {25876#true} {25976#(and (= main_~b~0 main_~v~0) (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~d~0 1) (= main_~q~0 0) (= main_~c~0 main_~x~0) (= main_~p~0 1))} #102#return; {25976#(and (= main_~b~0 main_~v~0) (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~d~0 1) (= main_~q~0 0) (= main_~c~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-27 13:19:31,530 INFO L272 TraceCheckUtils]: 38: Hoare triple {25976#(and (= main_~b~0 main_~v~0) (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~d~0 1) (= main_~q~0 0) (= main_~c~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)); {25876#true} is VALID [2022-04-27 13:19:31,530 INFO L290 TraceCheckUtils]: 39: Hoare triple {25876#true} ~cond := #in~cond; {25876#true} is VALID [2022-04-27 13:19:31,530 INFO L290 TraceCheckUtils]: 40: Hoare triple {25876#true} assume !(0 == ~cond); {25876#true} is VALID [2022-04-27 13:19:31,530 INFO L290 TraceCheckUtils]: 41: Hoare triple {25876#true} assume true; {25876#true} is VALID [2022-04-27 13:19:31,531 INFO L284 TraceCheckUtils]: 42: Hoare quadruple {25876#true} {25976#(and (= main_~b~0 main_~v~0) (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~d~0 1) (= main_~q~0 0) (= main_~c~0 main_~x~0) (= main_~p~0 1))} #104#return; {25976#(and (= main_~b~0 main_~v~0) (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~d~0 1) (= main_~q~0 0) (= main_~c~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-27 13:19:31,531 INFO L272 TraceCheckUtils]: 43: Hoare triple {25976#(and (= main_~b~0 main_~v~0) (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~d~0 1) (= main_~q~0 0) (= main_~c~0 main_~x~0) (= main_~p~0 1))} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {25876#true} is VALID [2022-04-27 13:19:31,531 INFO L290 TraceCheckUtils]: 44: Hoare triple {25876#true} ~cond := #in~cond; {25876#true} is VALID [2022-04-27 13:19:31,531 INFO L290 TraceCheckUtils]: 45: Hoare triple {25876#true} assume !(0 == ~cond); {25876#true} is VALID [2022-04-27 13:19:31,531 INFO L290 TraceCheckUtils]: 46: Hoare triple {25876#true} assume true; {25876#true} is VALID [2022-04-27 13:19:31,532 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {25876#true} {25976#(and (= main_~b~0 main_~v~0) (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~d~0 1) (= main_~q~0 0) (= main_~c~0 main_~x~0) (= main_~p~0 1))} #106#return; {25976#(and (= main_~b~0 main_~v~0) (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~d~0 1) (= main_~q~0 0) (= main_~c~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-27 13:19:31,532 INFO L272 TraceCheckUtils]: 48: Hoare triple {25976#(and (= main_~b~0 main_~v~0) (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~d~0 1) (= main_~q~0 0) (= main_~c~0 main_~x~0) (= main_~p~0 1))} call __VERIFIER_assert((if ~v~0 == ~b~0 * ~d~0 then 1 else 0)); {25876#true} is VALID [2022-04-27 13:19:31,532 INFO L290 TraceCheckUtils]: 49: Hoare triple {25876#true} ~cond := #in~cond; {26031#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-27 13:19:31,533 INFO L290 TraceCheckUtils]: 50: Hoare triple {26031#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {26035#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 13:19:31,533 INFO L290 TraceCheckUtils]: 51: Hoare triple {26035#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {26035#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 13:19:31,534 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {26035#(not (= |__VERIFIER_assert_#in~cond| 0))} {25976#(and (= main_~b~0 main_~v~0) (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~d~0 1) (= main_~q~0 0) (= main_~c~0 main_~x~0) (= main_~p~0 1))} #108#return; {25976#(and (= main_~b~0 main_~v~0) (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~d~0 1) (= main_~q~0 0) (= main_~c~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-27 13:19:31,534 INFO L290 TraceCheckUtils]: 53: Hoare triple {25976#(and (= main_~b~0 main_~v~0) (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~d~0 1) (= main_~q~0 0) (= main_~c~0 main_~x~0) (= main_~p~0 1))} assume !!(~c~0 >= 2 * ~v~0);~d~0 := 2 * ~d~0;~v~0 := 2 * ~v~0; {26045#(and (= main_~r~0 0) (= main_~v~0 (* main_~b~0 2)) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~d~0 2) (= main_~q~0 0) (= main_~c~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-27 13:19:31,535 INFO L290 TraceCheckUtils]: 54: Hoare triple {26045#(and (= main_~r~0 0) (= main_~v~0 (* main_~b~0 2)) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~d~0 2) (= main_~q~0 0) (= main_~c~0 main_~x~0) (= main_~p~0 1))} assume !false; {26045#(and (= main_~r~0 0) (= main_~v~0 (* main_~b~0 2)) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~d~0 2) (= main_~q~0 0) (= main_~c~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-27 13:19:31,535 INFO L272 TraceCheckUtils]: 55: Hoare triple {26045#(and (= main_~r~0 0) (= main_~v~0 (* main_~b~0 2)) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~d~0 2) (= main_~q~0 0) (= main_~c~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)); {25876#true} is VALID [2022-04-27 13:19:31,535 INFO L290 TraceCheckUtils]: 56: Hoare triple {25876#true} ~cond := #in~cond; {25876#true} is VALID [2022-04-27 13:19:31,535 INFO L290 TraceCheckUtils]: 57: Hoare triple {25876#true} assume !(0 == ~cond); {25876#true} is VALID [2022-04-27 13:19:31,535 INFO L290 TraceCheckUtils]: 58: Hoare triple {25876#true} assume true; {25876#true} is VALID [2022-04-27 13:19:31,538 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {25876#true} {26045#(and (= main_~r~0 0) (= main_~v~0 (* main_~b~0 2)) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~d~0 2) (= main_~q~0 0) (= main_~c~0 main_~x~0) (= main_~p~0 1))} #102#return; {26045#(and (= main_~r~0 0) (= main_~v~0 (* main_~b~0 2)) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~d~0 2) (= main_~q~0 0) (= main_~c~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-27 13:19:31,538 INFO L272 TraceCheckUtils]: 60: Hoare triple {26045#(and (= main_~r~0 0) (= main_~v~0 (* main_~b~0 2)) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~d~0 2) (= main_~q~0 0) (= main_~c~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)); {25876#true} is VALID [2022-04-27 13:19:31,538 INFO L290 TraceCheckUtils]: 61: Hoare triple {25876#true} ~cond := #in~cond; {25876#true} is VALID [2022-04-27 13:19:31,538 INFO L290 TraceCheckUtils]: 62: Hoare triple {25876#true} assume !(0 == ~cond); {25876#true} is VALID [2022-04-27 13:19:31,538 INFO L290 TraceCheckUtils]: 63: Hoare triple {25876#true} assume true; {25876#true} is VALID [2022-04-27 13:19:31,539 INFO L284 TraceCheckUtils]: 64: Hoare quadruple {25876#true} {26045#(and (= main_~r~0 0) (= main_~v~0 (* main_~b~0 2)) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~d~0 2) (= main_~q~0 0) (= main_~c~0 main_~x~0) (= main_~p~0 1))} #104#return; {26045#(and (= main_~r~0 0) (= main_~v~0 (* main_~b~0 2)) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~d~0 2) (= main_~q~0 0) (= main_~c~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-27 13:19:31,539 INFO L272 TraceCheckUtils]: 65: Hoare triple {26045#(and (= main_~r~0 0) (= main_~v~0 (* main_~b~0 2)) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~d~0 2) (= main_~q~0 0) (= main_~c~0 main_~x~0) (= main_~p~0 1))} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {25876#true} is VALID [2022-04-27 13:19:31,539 INFO L290 TraceCheckUtils]: 66: Hoare triple {25876#true} ~cond := #in~cond; {25876#true} is VALID [2022-04-27 13:19:31,539 INFO L290 TraceCheckUtils]: 67: Hoare triple {25876#true} assume !(0 == ~cond); {25876#true} is VALID [2022-04-27 13:19:31,539 INFO L290 TraceCheckUtils]: 68: Hoare triple {25876#true} assume true; {25876#true} is VALID [2022-04-27 13:19:31,540 INFO L284 TraceCheckUtils]: 69: Hoare quadruple {25876#true} {26045#(and (= main_~r~0 0) (= main_~v~0 (* main_~b~0 2)) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~d~0 2) (= main_~q~0 0) (= main_~c~0 main_~x~0) (= main_~p~0 1))} #106#return; {26045#(and (= main_~r~0 0) (= main_~v~0 (* main_~b~0 2)) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~d~0 2) (= main_~q~0 0) (= main_~c~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-27 13:19:31,540 INFO L272 TraceCheckUtils]: 70: Hoare triple {26045#(and (= main_~r~0 0) (= main_~v~0 (* main_~b~0 2)) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~d~0 2) (= main_~q~0 0) (= main_~c~0 main_~x~0) (= main_~p~0 1))} call __VERIFIER_assert((if ~v~0 == ~b~0 * ~d~0 then 1 else 0)); {25876#true} is VALID [2022-04-27 13:19:31,540 INFO L290 TraceCheckUtils]: 71: Hoare triple {25876#true} ~cond := #in~cond; {26031#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-27 13:19:31,541 INFO L290 TraceCheckUtils]: 72: Hoare triple {26031#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {26035#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 13:19:31,541 INFO L290 TraceCheckUtils]: 73: Hoare triple {26035#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {26035#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 13:19:31,542 INFO L284 TraceCheckUtils]: 74: Hoare quadruple {26035#(not (= |__VERIFIER_assert_#in~cond| 0))} {26045#(and (= main_~r~0 0) (= main_~v~0 (* main_~b~0 2)) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~d~0 2) (= main_~q~0 0) (= main_~c~0 main_~x~0) (= main_~p~0 1))} #108#return; {26109#(and (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~v~0 (* main_~d~0 main_~y~0)) (= main_~d~0 2) (= main_~q~0 0) (= main_~c~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-27 13:19:31,542 INFO L290 TraceCheckUtils]: 75: Hoare triple {26109#(and (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~v~0 (* main_~d~0 main_~y~0)) (= main_~d~0 2) (= main_~q~0 0) (= main_~c~0 main_~x~0) (= main_~p~0 1))} assume !(~c~0 >= 2 * ~v~0); {26109#(and (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~v~0 (* main_~d~0 main_~y~0)) (= main_~d~0 2) (= main_~q~0 0) (= main_~c~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-27 13:19:31,543 INFO L290 TraceCheckUtils]: 76: Hoare triple {26109#(and (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~v~0 (* main_~d~0 main_~y~0)) (= main_~d~0 2) (= main_~q~0 0) (= main_~c~0 main_~x~0) (= main_~p~0 1))} ~c~0 := ~c~0 - ~v~0;~k~0 := ~k~0 + ~d~0; {26116#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~k~0 2) (= main_~q~0 0) (= (+ (* (- 1) main_~c~0) main_~x~0) (* main_~k~0 main_~y~0)) (= main_~p~0 1))} is VALID [2022-04-27 13:19:31,544 INFO L290 TraceCheckUtils]: 77: Hoare triple {26116#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~k~0 2) (= main_~q~0 0) (= (+ (* (- 1) main_~c~0) main_~x~0) (* main_~k~0 main_~y~0)) (= main_~p~0 1))} assume !false; {26116#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~k~0 2) (= main_~q~0 0) (= (+ (* (- 1) main_~c~0) main_~x~0) (* main_~k~0 main_~y~0)) (= main_~p~0 1))} is VALID [2022-04-27 13:19:31,544 INFO L290 TraceCheckUtils]: 78: Hoare triple {26116#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~k~0 2) (= main_~q~0 0) (= (+ (* (- 1) main_~c~0) main_~x~0) (* main_~k~0 main_~y~0)) (= main_~p~0 1))} assume !(~c~0 >= ~b~0); {26116#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~k~0 2) (= main_~q~0 0) (= (+ (* (- 1) main_~c~0) main_~x~0) (* main_~k~0 main_~y~0)) (= main_~p~0 1))} is VALID [2022-04-27 13:19:31,545 INFO L290 TraceCheckUtils]: 79: Hoare triple {26116#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~k~0 2) (= main_~q~0 0) (= (+ (* (- 1) main_~c~0) main_~x~0) (* main_~k~0 main_~y~0)) (= main_~p~0 1))} ~a~0 := ~b~0;~b~0 := ~c~0;havoc ~temp~0;~temp~0 := ~p~0;~p~0 := ~q~0;~q~0 := ~temp~0 - ~q~0 * ~k~0;~temp~0 := ~r~0;~r~0 := ~s~0;~s~0 := ~temp~0 - ~s~0 * ~k~0; {26126#(and (= (+ main_~s~0 2) 0) (= main_~q~0 1) (= main_~b~0 (+ main_~x~0 (* (- 2) main_~y~0))))} is VALID [2022-04-27 13:19:31,545 INFO L290 TraceCheckUtils]: 80: Hoare triple {26126#(and (= (+ main_~s~0 2) 0) (= main_~q~0 1) (= main_~b~0 (+ main_~x~0 (* (- 2) main_~y~0))))} assume !false; {26126#(and (= (+ main_~s~0 2) 0) (= main_~q~0 1) (= main_~b~0 (+ main_~x~0 (* (- 2) main_~y~0))))} is VALID [2022-04-27 13:19:31,545 INFO L290 TraceCheckUtils]: 81: Hoare triple {26126#(and (= (+ main_~s~0 2) 0) (= main_~q~0 1) (= main_~b~0 (+ main_~x~0 (* (- 2) main_~y~0))))} assume !!(0 != ~b~0);havoc ~c~0;havoc ~k~0;~c~0 := ~a~0;~k~0 := 0; {26126#(and (= (+ main_~s~0 2) 0) (= main_~q~0 1) (= main_~b~0 (+ main_~x~0 (* (- 2) main_~y~0))))} is VALID [2022-04-27 13:19:31,546 INFO L290 TraceCheckUtils]: 82: Hoare triple {26126#(and (= (+ main_~s~0 2) 0) (= main_~q~0 1) (= main_~b~0 (+ main_~x~0 (* (- 2) main_~y~0))))} assume !false; {26126#(and (= (+ main_~s~0 2) 0) (= main_~q~0 1) (= main_~b~0 (+ main_~x~0 (* (- 2) main_~y~0))))} is VALID [2022-04-27 13:19:31,546 INFO L290 TraceCheckUtils]: 83: Hoare triple {26126#(and (= (+ main_~s~0 2) 0) (= main_~q~0 1) (= main_~b~0 (+ main_~x~0 (* (- 2) main_~y~0))))} assume !!(~c~0 >= ~b~0);havoc ~d~0;havoc ~v~0;~d~0 := 1;~v~0 := ~b~0; {26126#(and (= (+ main_~s~0 2) 0) (= main_~q~0 1) (= main_~b~0 (+ main_~x~0 (* (- 2) main_~y~0))))} is VALID [2022-04-27 13:19:31,546 INFO L290 TraceCheckUtils]: 84: Hoare triple {26126#(and (= (+ main_~s~0 2) 0) (= main_~q~0 1) (= main_~b~0 (+ main_~x~0 (* (- 2) main_~y~0))))} assume !false; {26126#(and (= (+ main_~s~0 2) 0) (= main_~q~0 1) (= main_~b~0 (+ main_~x~0 (* (- 2) main_~y~0))))} is VALID [2022-04-27 13:19:31,547 INFO L272 TraceCheckUtils]: 85: Hoare triple {26126#(and (= (+ main_~s~0 2) 0) (= main_~q~0 1) (= main_~b~0 (+ main_~x~0 (* (- 2) main_~y~0))))} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {25876#true} is VALID [2022-04-27 13:19:31,547 INFO L290 TraceCheckUtils]: 86: Hoare triple {25876#true} ~cond := #in~cond; {25876#true} is VALID [2022-04-27 13:19:31,547 INFO L290 TraceCheckUtils]: 87: Hoare triple {25876#true} assume !(0 == ~cond); {25876#true} is VALID [2022-04-27 13:19:31,547 INFO L290 TraceCheckUtils]: 88: Hoare triple {25876#true} assume true; {25876#true} is VALID [2022-04-27 13:19:31,547 INFO L284 TraceCheckUtils]: 89: Hoare quadruple {25876#true} {26126#(and (= (+ main_~s~0 2) 0) (= main_~q~0 1) (= main_~b~0 (+ main_~x~0 (* (- 2) main_~y~0))))} #102#return; {26126#(and (= (+ main_~s~0 2) 0) (= main_~q~0 1) (= main_~b~0 (+ main_~x~0 (* (- 2) main_~y~0))))} is VALID [2022-04-27 13:19:31,548 INFO L272 TraceCheckUtils]: 90: Hoare triple {26126#(and (= (+ main_~s~0 2) 0) (= main_~q~0 1) (= main_~b~0 (+ main_~x~0 (* (- 2) main_~y~0))))} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {26160#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 13:19:31,548 INFO L290 TraceCheckUtils]: 91: Hoare triple {26160#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {26164#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 13:19:31,549 INFO L290 TraceCheckUtils]: 92: Hoare triple {26164#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {25877#false} is VALID [2022-04-27 13:19:31,549 INFO L290 TraceCheckUtils]: 93: Hoare triple {25877#false} assume !false; {25877#false} is VALID [2022-04-27 13:19:31,549 INFO L134 CoverageAnalysis]: Checked inductivity of 206 backedges. 43 proven. 37 refuted. 0 times theorem prover too weak. 126 trivial. 0 not checked. [2022-04-27 13:19:31,549 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 13:19:48,416 INFO L290 TraceCheckUtils]: 93: Hoare triple {25877#false} assume !false; {25877#false} is VALID [2022-04-27 13:19:48,417 INFO L290 TraceCheckUtils]: 92: Hoare triple {26164#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {25877#false} is VALID [2022-04-27 13:19:48,417 INFO L290 TraceCheckUtils]: 91: Hoare triple {26160#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {26164#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 13:19:48,418 INFO L272 TraceCheckUtils]: 90: Hoare triple {26180#(= 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)); {26160#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 13:19:48,418 INFO L284 TraceCheckUtils]: 89: Hoare quadruple {25876#true} {26180#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} #102#return; {26180#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} is VALID [2022-04-27 13:19:48,419 INFO L290 TraceCheckUtils]: 88: Hoare triple {25876#true} assume true; {25876#true} is VALID [2022-04-27 13:19:48,419 INFO L290 TraceCheckUtils]: 87: Hoare triple {25876#true} assume !(0 == ~cond); {25876#true} is VALID [2022-04-27 13:19:48,419 INFO L290 TraceCheckUtils]: 86: Hoare triple {25876#true} ~cond := #in~cond; {25876#true} is VALID [2022-04-27 13:19:48,419 INFO L272 TraceCheckUtils]: 85: Hoare triple {26180#(= 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)); {25876#true} is VALID [2022-04-27 13:19:48,419 INFO L290 TraceCheckUtils]: 84: Hoare triple {26180#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} assume !false; {26180#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} is VALID [2022-04-27 13:19:48,419 INFO L290 TraceCheckUtils]: 83: Hoare triple {26180#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} assume !!(~c~0 >= ~b~0);havoc ~d~0;havoc ~v~0;~d~0 := 1;~v~0 := ~b~0; {26180#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} is VALID [2022-04-27 13:19:48,420 INFO L290 TraceCheckUtils]: 82: Hoare triple {26180#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} assume !false; {26180#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} is VALID [2022-04-27 13:19:48,420 INFO L290 TraceCheckUtils]: 81: Hoare triple {26180#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} assume !!(0 != ~b~0);havoc ~c~0;havoc ~k~0;~c~0 := ~a~0;~k~0 := 0; {26180#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} is VALID [2022-04-27 13:19:48,420 INFO L290 TraceCheckUtils]: 80: Hoare triple {26180#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} assume !false; {26180#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} is VALID [2022-04-27 13:19:50,198 INFO L290 TraceCheckUtils]: 79: Hoare triple {26214#(= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) main_~c~0)} ~a~0 := ~b~0;~b~0 := ~c~0;havoc ~temp~0;~temp~0 := ~p~0;~p~0 := ~q~0;~q~0 := ~temp~0 - ~q~0 * ~k~0;~temp~0 := ~r~0;~r~0 := ~s~0;~s~0 := ~temp~0 - ~s~0 * ~k~0; {26180#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} is VALID [2022-04-27 13:19:50,199 INFO L290 TraceCheckUtils]: 78: Hoare triple {26214#(= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) main_~c~0)} assume !(~c~0 >= ~b~0); {26214#(= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) main_~c~0)} is VALID [2022-04-27 13:19:50,199 INFO L290 TraceCheckUtils]: 77: Hoare triple {26214#(= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) main_~c~0)} assume !false; {26214#(= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) main_~c~0)} is VALID [2022-04-27 13:19:52,201 WARN L290 TraceCheckUtils]: 76: Hoare triple {26224#(= (+ main_~c~0 (* (- 1) main_~v~0)) (+ (* (+ main_~p~0 (* (- 1) main_~q~0 (+ main_~d~0 main_~k~0))) main_~x~0) (* (+ (* (- 1) (* main_~s~0 (+ main_~d~0 main_~k~0))) main_~r~0) main_~y~0)))} ~c~0 := ~c~0 - ~v~0;~k~0 := ~k~0 + ~d~0; {26214#(= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) main_~c~0)} is UNKNOWN [2022-04-27 13:19:52,201 INFO L290 TraceCheckUtils]: 75: Hoare triple {26224#(= (+ main_~c~0 (* (- 1) main_~v~0)) (+ (* (+ main_~p~0 (* (- 1) main_~q~0 (+ main_~d~0 main_~k~0))) main_~x~0) (* (+ (* (- 1) (* main_~s~0 (+ main_~d~0 main_~k~0))) main_~r~0) main_~y~0)))} assume !(~c~0 >= 2 * ~v~0); {26224#(= (+ main_~c~0 (* (- 1) main_~v~0)) (+ (* (+ main_~p~0 (* (- 1) main_~q~0 (+ main_~d~0 main_~k~0))) main_~x~0) (* (+ (* (- 1) (* main_~s~0 (+ main_~d~0 main_~k~0))) main_~r~0) main_~y~0)))} is VALID [2022-04-27 13:19:52,202 INFO L284 TraceCheckUtils]: 74: Hoare quadruple {26035#(not (= |__VERIFIER_assert_#in~cond| 0))} {26231#(or (= (+ main_~c~0 (* (- 1) main_~v~0)) (+ (* (+ main_~p~0 (* (- 1) main_~q~0 (+ main_~d~0 main_~k~0))) main_~x~0) (* (+ (* (- 1) (* main_~s~0 (+ main_~d~0 main_~k~0))) main_~r~0) main_~y~0))) (not (= main_~v~0 (* main_~d~0 main_~b~0))))} #108#return; {26224#(= (+ main_~c~0 (* (- 1) main_~v~0)) (+ (* (+ main_~p~0 (* (- 1) main_~q~0 (+ main_~d~0 main_~k~0))) main_~x~0) (* (+ (* (- 1) (* main_~s~0 (+ main_~d~0 main_~k~0))) main_~r~0) main_~y~0)))} is VALID [2022-04-27 13:19:52,203 INFO L290 TraceCheckUtils]: 73: Hoare triple {26035#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {26035#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 13:19:52,203 INFO L290 TraceCheckUtils]: 72: Hoare triple {26241#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} assume !(0 == ~cond); {26035#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 13:19:52,203 INFO L290 TraceCheckUtils]: 71: Hoare triple {25876#true} ~cond := #in~cond; {26241#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-27 13:19:52,204 INFO L272 TraceCheckUtils]: 70: Hoare triple {26231#(or (= (+ main_~c~0 (* (- 1) main_~v~0)) (+ (* (+ main_~p~0 (* (- 1) main_~q~0 (+ main_~d~0 main_~k~0))) main_~x~0) (* (+ (* (- 1) (* main_~s~0 (+ main_~d~0 main_~k~0))) main_~r~0) main_~y~0))) (not (= main_~v~0 (* main_~d~0 main_~b~0))))} call __VERIFIER_assert((if ~v~0 == ~b~0 * ~d~0 then 1 else 0)); {25876#true} is VALID [2022-04-27 13:19:52,204 INFO L284 TraceCheckUtils]: 69: Hoare quadruple {25876#true} {26231#(or (= (+ main_~c~0 (* (- 1) main_~v~0)) (+ (* (+ main_~p~0 (* (- 1) main_~q~0 (+ main_~d~0 main_~k~0))) main_~x~0) (* (+ (* (- 1) (* main_~s~0 (+ main_~d~0 main_~k~0))) main_~r~0) main_~y~0))) (not (= main_~v~0 (* main_~d~0 main_~b~0))))} #106#return; {26231#(or (= (+ main_~c~0 (* (- 1) main_~v~0)) (+ (* (+ main_~p~0 (* (- 1) main_~q~0 (+ main_~d~0 main_~k~0))) main_~x~0) (* (+ (* (- 1) (* main_~s~0 (+ main_~d~0 main_~k~0))) main_~r~0) main_~y~0))) (not (= main_~v~0 (* main_~d~0 main_~b~0))))} is VALID [2022-04-27 13:19:52,205 INFO L290 TraceCheckUtils]: 68: Hoare triple {25876#true} assume true; {25876#true} is VALID [2022-04-27 13:19:52,205 INFO L290 TraceCheckUtils]: 67: Hoare triple {25876#true} assume !(0 == ~cond); {25876#true} is VALID [2022-04-27 13:19:52,205 INFO L290 TraceCheckUtils]: 66: Hoare triple {25876#true} ~cond := #in~cond; {25876#true} is VALID [2022-04-27 13:19:52,205 INFO L272 TraceCheckUtils]: 65: Hoare triple {26231#(or (= (+ main_~c~0 (* (- 1) main_~v~0)) (+ (* (+ main_~p~0 (* (- 1) main_~q~0 (+ main_~d~0 main_~k~0))) main_~x~0) (* (+ (* (- 1) (* main_~s~0 (+ main_~d~0 main_~k~0))) main_~r~0) main_~y~0))) (not (= main_~v~0 (* main_~d~0 main_~b~0))))} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {25876#true} is VALID [2022-04-27 13:19:52,206 INFO L284 TraceCheckUtils]: 64: Hoare quadruple {25876#true} {26231#(or (= (+ main_~c~0 (* (- 1) main_~v~0)) (+ (* (+ main_~p~0 (* (- 1) main_~q~0 (+ main_~d~0 main_~k~0))) main_~x~0) (* (+ (* (- 1) (* main_~s~0 (+ main_~d~0 main_~k~0))) main_~r~0) main_~y~0))) (not (= main_~v~0 (* main_~d~0 main_~b~0))))} #104#return; {26231#(or (= (+ main_~c~0 (* (- 1) main_~v~0)) (+ (* (+ main_~p~0 (* (- 1) main_~q~0 (+ main_~d~0 main_~k~0))) main_~x~0) (* (+ (* (- 1) (* main_~s~0 (+ main_~d~0 main_~k~0))) main_~r~0) main_~y~0))) (not (= main_~v~0 (* main_~d~0 main_~b~0))))} is VALID [2022-04-27 13:19:52,206 INFO L290 TraceCheckUtils]: 63: Hoare triple {25876#true} assume true; {25876#true} is VALID [2022-04-27 13:19:52,206 INFO L290 TraceCheckUtils]: 62: Hoare triple {25876#true} assume !(0 == ~cond); {25876#true} is VALID [2022-04-27 13:19:52,206 INFO L290 TraceCheckUtils]: 61: Hoare triple {25876#true} ~cond := #in~cond; {25876#true} is VALID [2022-04-27 13:19:52,206 INFO L272 TraceCheckUtils]: 60: Hoare triple {26231#(or (= (+ main_~c~0 (* (- 1) main_~v~0)) (+ (* (+ main_~p~0 (* (- 1) main_~q~0 (+ main_~d~0 main_~k~0))) main_~x~0) (* (+ (* (- 1) (* main_~s~0 (+ main_~d~0 main_~k~0))) main_~r~0) main_~y~0))) (not (= main_~v~0 (* main_~d~0 main_~b~0))))} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {25876#true} is VALID [2022-04-27 13:19:52,207 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {25876#true} {26231#(or (= (+ main_~c~0 (* (- 1) main_~v~0)) (+ (* (+ main_~p~0 (* (- 1) main_~q~0 (+ main_~d~0 main_~k~0))) main_~x~0) (* (+ (* (- 1) (* main_~s~0 (+ main_~d~0 main_~k~0))) main_~r~0) main_~y~0))) (not (= main_~v~0 (* main_~d~0 main_~b~0))))} #102#return; {26231#(or (= (+ main_~c~0 (* (- 1) main_~v~0)) (+ (* (+ main_~p~0 (* (- 1) main_~q~0 (+ main_~d~0 main_~k~0))) main_~x~0) (* (+ (* (- 1) (* main_~s~0 (+ main_~d~0 main_~k~0))) main_~r~0) main_~y~0))) (not (= main_~v~0 (* main_~d~0 main_~b~0))))} is VALID [2022-04-27 13:19:52,207 INFO L290 TraceCheckUtils]: 58: Hoare triple {25876#true} assume true; {25876#true} is VALID [2022-04-27 13:19:52,207 INFO L290 TraceCheckUtils]: 57: Hoare triple {25876#true} assume !(0 == ~cond); {25876#true} is VALID [2022-04-27 13:19:52,207 INFO L290 TraceCheckUtils]: 56: Hoare triple {25876#true} ~cond := #in~cond; {25876#true} is VALID [2022-04-27 13:19:52,207 INFO L272 TraceCheckUtils]: 55: Hoare triple {26231#(or (= (+ main_~c~0 (* (- 1) main_~v~0)) (+ (* (+ main_~p~0 (* (- 1) main_~q~0 (+ main_~d~0 main_~k~0))) main_~x~0) (* (+ (* (- 1) (* main_~s~0 (+ main_~d~0 main_~k~0))) main_~r~0) main_~y~0))) (not (= main_~v~0 (* main_~d~0 main_~b~0))))} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {25876#true} is VALID [2022-04-27 13:19:52,208 INFO L290 TraceCheckUtils]: 54: Hoare triple {26231#(or (= (+ main_~c~0 (* (- 1) main_~v~0)) (+ (* (+ main_~p~0 (* (- 1) main_~q~0 (+ main_~d~0 main_~k~0))) main_~x~0) (* (+ (* (- 1) (* main_~s~0 (+ main_~d~0 main_~k~0))) main_~r~0) main_~y~0))) (not (= main_~v~0 (* main_~d~0 main_~b~0))))} assume !false; {26231#(or (= (+ main_~c~0 (* (- 1) main_~v~0)) (+ (* (+ main_~p~0 (* (- 1) main_~q~0 (+ main_~d~0 main_~k~0))) main_~x~0) (* (+ (* (- 1) (* main_~s~0 (+ main_~d~0 main_~k~0))) main_~r~0) main_~y~0))) (not (= main_~v~0 (* main_~d~0 main_~b~0))))} is VALID [2022-04-27 13:19:52,330 INFO L290 TraceCheckUtils]: 53: Hoare triple {26296#(or (= (+ (* (- 1) (* main_~b~0 (* main_~d~0 2))) main_~c~0) (+ (* main_~y~0 (+ (* (- 1) (* (+ main_~k~0 (* main_~d~0 2)) main_~s~0)) main_~r~0)) (* (+ main_~p~0 (* (- 1) (+ main_~k~0 (* main_~d~0 2)) main_~q~0)) main_~x~0))) (not (= (* main_~v~0 2) (* main_~b~0 (* main_~d~0 2)))))} assume !!(~c~0 >= 2 * ~v~0);~d~0 := 2 * ~d~0;~v~0 := 2 * ~v~0; {26231#(or (= (+ main_~c~0 (* (- 1) main_~v~0)) (+ (* (+ main_~p~0 (* (- 1) main_~q~0 (+ main_~d~0 main_~k~0))) main_~x~0) (* (+ (* (- 1) (* main_~s~0 (+ main_~d~0 main_~k~0))) main_~r~0) main_~y~0))) (not (= main_~v~0 (* main_~d~0 main_~b~0))))} is VALID [2022-04-27 13:19:52,331 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {25876#true} {26296#(or (= (+ (* (- 1) (* main_~b~0 (* main_~d~0 2))) main_~c~0) (+ (* main_~y~0 (+ (* (- 1) (* (+ main_~k~0 (* main_~d~0 2)) main_~s~0)) main_~r~0)) (* (+ main_~p~0 (* (- 1) (+ main_~k~0 (* main_~d~0 2)) main_~q~0)) main_~x~0))) (not (= (* main_~v~0 2) (* main_~b~0 (* main_~d~0 2)))))} #108#return; {26296#(or (= (+ (* (- 1) (* main_~b~0 (* main_~d~0 2))) main_~c~0) (+ (* main_~y~0 (+ (* (- 1) (* (+ main_~k~0 (* main_~d~0 2)) main_~s~0)) main_~r~0)) (* (+ main_~p~0 (* (- 1) (+ main_~k~0 (* main_~d~0 2)) main_~q~0)) main_~x~0))) (not (= (* main_~v~0 2) (* main_~b~0 (* main_~d~0 2)))))} is VALID [2022-04-27 13:19:52,331 INFO L290 TraceCheckUtils]: 51: Hoare triple {25876#true} assume true; {25876#true} is VALID [2022-04-27 13:19:52,331 INFO L290 TraceCheckUtils]: 50: Hoare triple {25876#true} assume !(0 == ~cond); {25876#true} is VALID [2022-04-27 13:19:52,331 INFO L290 TraceCheckUtils]: 49: Hoare triple {25876#true} ~cond := #in~cond; {25876#true} is VALID [2022-04-27 13:19:52,331 INFO L272 TraceCheckUtils]: 48: Hoare triple {26296#(or (= (+ (* (- 1) (* main_~b~0 (* main_~d~0 2))) main_~c~0) (+ (* main_~y~0 (+ (* (- 1) (* (+ main_~k~0 (* main_~d~0 2)) main_~s~0)) main_~r~0)) (* (+ main_~p~0 (* (- 1) (+ main_~k~0 (* main_~d~0 2)) main_~q~0)) main_~x~0))) (not (= (* main_~v~0 2) (* main_~b~0 (* main_~d~0 2)))))} call __VERIFIER_assert((if ~v~0 == ~b~0 * ~d~0 then 1 else 0)); {25876#true} is VALID [2022-04-27 13:19:52,332 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {25876#true} {26296#(or (= (+ (* (- 1) (* main_~b~0 (* main_~d~0 2))) main_~c~0) (+ (* main_~y~0 (+ (* (- 1) (* (+ main_~k~0 (* main_~d~0 2)) main_~s~0)) main_~r~0)) (* (+ main_~p~0 (* (- 1) (+ main_~k~0 (* main_~d~0 2)) main_~q~0)) main_~x~0))) (not (= (* main_~v~0 2) (* main_~b~0 (* main_~d~0 2)))))} #106#return; {26296#(or (= (+ (* (- 1) (* main_~b~0 (* main_~d~0 2))) main_~c~0) (+ (* main_~y~0 (+ (* (- 1) (* (+ main_~k~0 (* main_~d~0 2)) main_~s~0)) main_~r~0)) (* (+ main_~p~0 (* (- 1) (+ main_~k~0 (* main_~d~0 2)) main_~q~0)) main_~x~0))) (not (= (* main_~v~0 2) (* main_~b~0 (* main_~d~0 2)))))} is VALID [2022-04-27 13:19:52,332 INFO L290 TraceCheckUtils]: 46: Hoare triple {25876#true} assume true; {25876#true} is VALID [2022-04-27 13:19:52,332 INFO L290 TraceCheckUtils]: 45: Hoare triple {25876#true} assume !(0 == ~cond); {25876#true} is VALID [2022-04-27 13:19:52,332 INFO L290 TraceCheckUtils]: 44: Hoare triple {25876#true} ~cond := #in~cond; {25876#true} is VALID [2022-04-27 13:19:52,333 INFO L272 TraceCheckUtils]: 43: Hoare triple {26296#(or (= (+ (* (- 1) (* main_~b~0 (* main_~d~0 2))) main_~c~0) (+ (* main_~y~0 (+ (* (- 1) (* (+ main_~k~0 (* main_~d~0 2)) main_~s~0)) main_~r~0)) (* (+ main_~p~0 (* (- 1) (+ main_~k~0 (* main_~d~0 2)) main_~q~0)) main_~x~0))) (not (= (* main_~v~0 2) (* main_~b~0 (* main_~d~0 2)))))} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {25876#true} is VALID [2022-04-27 13:19:52,333 INFO L284 TraceCheckUtils]: 42: Hoare quadruple {25876#true} {26296#(or (= (+ (* (- 1) (* main_~b~0 (* main_~d~0 2))) main_~c~0) (+ (* main_~y~0 (+ (* (- 1) (* (+ main_~k~0 (* main_~d~0 2)) main_~s~0)) main_~r~0)) (* (+ main_~p~0 (* (- 1) (+ main_~k~0 (* main_~d~0 2)) main_~q~0)) main_~x~0))) (not (= (* main_~v~0 2) (* main_~b~0 (* main_~d~0 2)))))} #104#return; {26296#(or (= (+ (* (- 1) (* main_~b~0 (* main_~d~0 2))) main_~c~0) (+ (* main_~y~0 (+ (* (- 1) (* (+ main_~k~0 (* main_~d~0 2)) main_~s~0)) main_~r~0)) (* (+ main_~p~0 (* (- 1) (+ main_~k~0 (* main_~d~0 2)) main_~q~0)) main_~x~0))) (not (= (* main_~v~0 2) (* main_~b~0 (* main_~d~0 2)))))} is VALID [2022-04-27 13:19:52,333 INFO L290 TraceCheckUtils]: 41: Hoare triple {25876#true} assume true; {25876#true} is VALID [2022-04-27 13:19:52,333 INFO L290 TraceCheckUtils]: 40: Hoare triple {25876#true} assume !(0 == ~cond); {25876#true} is VALID [2022-04-27 13:19:52,333 INFO L290 TraceCheckUtils]: 39: Hoare triple {25876#true} ~cond := #in~cond; {25876#true} is VALID [2022-04-27 13:19:52,333 INFO L272 TraceCheckUtils]: 38: Hoare triple {26296#(or (= (+ (* (- 1) (* main_~b~0 (* main_~d~0 2))) main_~c~0) (+ (* main_~y~0 (+ (* (- 1) (* (+ main_~k~0 (* main_~d~0 2)) main_~s~0)) main_~r~0)) (* (+ main_~p~0 (* (- 1) (+ main_~k~0 (* main_~d~0 2)) main_~q~0)) main_~x~0))) (not (= (* main_~v~0 2) (* main_~b~0 (* main_~d~0 2)))))} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {25876#true} is VALID [2022-04-27 13:19:52,334 INFO L284 TraceCheckUtils]: 37: Hoare quadruple {25876#true} {26296#(or (= (+ (* (- 1) (* main_~b~0 (* main_~d~0 2))) main_~c~0) (+ (* main_~y~0 (+ (* (- 1) (* (+ main_~k~0 (* main_~d~0 2)) main_~s~0)) main_~r~0)) (* (+ main_~p~0 (* (- 1) (+ main_~k~0 (* main_~d~0 2)) main_~q~0)) main_~x~0))) (not (= (* main_~v~0 2) (* main_~b~0 (* main_~d~0 2)))))} #102#return; {26296#(or (= (+ (* (- 1) (* main_~b~0 (* main_~d~0 2))) main_~c~0) (+ (* main_~y~0 (+ (* (- 1) (* (+ main_~k~0 (* main_~d~0 2)) main_~s~0)) main_~r~0)) (* (+ main_~p~0 (* (- 1) (+ main_~k~0 (* main_~d~0 2)) main_~q~0)) main_~x~0))) (not (= (* main_~v~0 2) (* main_~b~0 (* main_~d~0 2)))))} is VALID [2022-04-27 13:19:52,334 INFO L290 TraceCheckUtils]: 36: Hoare triple {25876#true} assume true; {25876#true} is VALID [2022-04-27 13:19:52,334 INFO L290 TraceCheckUtils]: 35: Hoare triple {25876#true} assume !(0 == ~cond); {25876#true} is VALID [2022-04-27 13:19:52,334 INFO L290 TraceCheckUtils]: 34: Hoare triple {25876#true} ~cond := #in~cond; {25876#true} is VALID [2022-04-27 13:19:52,334 INFO L272 TraceCheckUtils]: 33: Hoare triple {26296#(or (= (+ (* (- 1) (* main_~b~0 (* main_~d~0 2))) main_~c~0) (+ (* main_~y~0 (+ (* (- 1) (* (+ main_~k~0 (* main_~d~0 2)) main_~s~0)) main_~r~0)) (* (+ main_~p~0 (* (- 1) (+ main_~k~0 (* main_~d~0 2)) main_~q~0)) main_~x~0))) (not (= (* main_~v~0 2) (* main_~b~0 (* main_~d~0 2)))))} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {25876#true} is VALID [2022-04-27 13:19:52,335 INFO L290 TraceCheckUtils]: 32: Hoare triple {26296#(or (= (+ (* (- 1) (* main_~b~0 (* main_~d~0 2))) main_~c~0) (+ (* main_~y~0 (+ (* (- 1) (* (+ main_~k~0 (* main_~d~0 2)) main_~s~0)) main_~r~0)) (* (+ main_~p~0 (* (- 1) (+ main_~k~0 (* main_~d~0 2)) main_~q~0)) main_~x~0))) (not (= (* main_~v~0 2) (* main_~b~0 (* main_~d~0 2)))))} assume !false; {26296#(or (= (+ (* (- 1) (* main_~b~0 (* main_~d~0 2))) main_~c~0) (+ (* main_~y~0 (+ (* (- 1) (* (+ main_~k~0 (* main_~d~0 2)) main_~s~0)) main_~r~0)) (* (+ main_~p~0 (* (- 1) (+ main_~k~0 (* main_~d~0 2)) main_~q~0)) main_~x~0))) (not (= (* main_~v~0 2) (* main_~b~0 (* main_~d~0 2)))))} is VALID [2022-04-27 13:19:52,336 INFO L290 TraceCheckUtils]: 31: Hoare triple {26363#(= (+ (* (- 2) main_~b~0) main_~c~0) (+ (* main_~y~0 (+ (* (* (+ main_~k~0 2) main_~s~0) (- 1)) main_~r~0)) (* main_~x~0 (+ main_~p~0 (* (- 1) (+ main_~k~0 2) main_~q~0)))))} assume !!(~c~0 >= ~b~0);havoc ~d~0;havoc ~v~0;~d~0 := 1;~v~0 := ~b~0; {26296#(or (= (+ (* (- 1) (* main_~b~0 (* main_~d~0 2))) main_~c~0) (+ (* main_~y~0 (+ (* (- 1) (* (+ main_~k~0 (* main_~d~0 2)) main_~s~0)) main_~r~0)) (* (+ main_~p~0 (* (- 1) (+ main_~k~0 (* main_~d~0 2)) main_~q~0)) main_~x~0))) (not (= (* main_~v~0 2) (* main_~b~0 (* main_~d~0 2)))))} is VALID [2022-04-27 13:19:52,336 INFO L290 TraceCheckUtils]: 30: Hoare triple {26363#(= (+ (* (- 2) main_~b~0) main_~c~0) (+ (* main_~y~0 (+ (* (* (+ main_~k~0 2) main_~s~0) (- 1)) main_~r~0)) (* main_~x~0 (+ main_~p~0 (* (- 1) (+ main_~k~0 2) main_~q~0)))))} assume !false; {26363#(= (+ (* (- 2) main_~b~0) main_~c~0) (+ (* main_~y~0 (+ (* (* (+ main_~k~0 2) main_~s~0) (- 1)) main_~r~0)) (* main_~x~0 (+ main_~p~0 (* (- 1) (+ main_~k~0 2) main_~q~0)))))} is VALID [2022-04-27 13:19:52,337 INFO L290 TraceCheckUtils]: 29: Hoare triple {26370#(= (+ (* main_~x~0 (+ main_~p~0 (* (- 2) main_~q~0))) (* (+ (* (- 2) main_~s~0) main_~r~0) main_~y~0)) (+ (* (- 2) main_~b~0) main_~a~0))} assume !!(0 != ~b~0);havoc ~c~0;havoc ~k~0;~c~0 := ~a~0;~k~0 := 0; {26363#(= (+ (* (- 2) main_~b~0) main_~c~0) (+ (* main_~y~0 (+ (* (* (+ main_~k~0 2) main_~s~0) (- 1)) main_~r~0)) (* main_~x~0 (+ main_~p~0 (* (- 1) (+ main_~k~0 2) main_~q~0)))))} is VALID [2022-04-27 13:19:52,337 INFO L290 TraceCheckUtils]: 28: Hoare triple {26370#(= (+ (* main_~x~0 (+ main_~p~0 (* (- 2) main_~q~0))) (* (+ (* (- 2) main_~s~0) main_~r~0) main_~y~0)) (+ (* (- 2) main_~b~0) main_~a~0))} assume !false; {26370#(= (+ (* main_~x~0 (+ main_~p~0 (* (- 2) main_~q~0))) (* (+ (* (- 2) main_~s~0) main_~r~0) main_~y~0)) (+ (* (- 2) main_~b~0) main_~a~0))} is VALID [2022-04-27 13:19:52,337 INFO L290 TraceCheckUtils]: 27: Hoare triple {25876#true} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1; {26370#(= (+ (* main_~x~0 (+ main_~p~0 (* (- 2) main_~q~0))) (* (+ (* (- 2) main_~s~0) main_~r~0) main_~y~0)) (+ (* (- 2) main_~b~0) main_~a~0))} is VALID [2022-04-27 13:19:52,337 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {25876#true} {25876#true} #100#return; {25876#true} is VALID [2022-04-27 13:19:52,337 INFO L290 TraceCheckUtils]: 25: Hoare triple {25876#true} assume true; {25876#true} is VALID [2022-04-27 13:19:52,338 INFO L290 TraceCheckUtils]: 24: Hoare triple {25876#true} assume !(0 == ~cond); {25876#true} is VALID [2022-04-27 13:19:52,338 INFO L290 TraceCheckUtils]: 23: Hoare triple {25876#true} ~cond := #in~cond; {25876#true} is VALID [2022-04-27 13:19:52,338 INFO L272 TraceCheckUtils]: 22: Hoare triple {25876#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {25876#true} is VALID [2022-04-27 13:19:52,338 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {25876#true} {25876#true} #98#return; {25876#true} is VALID [2022-04-27 13:19:52,338 INFO L290 TraceCheckUtils]: 20: Hoare triple {25876#true} assume true; {25876#true} is VALID [2022-04-27 13:19:52,338 INFO L290 TraceCheckUtils]: 19: Hoare triple {25876#true} assume !(0 == ~cond); {25876#true} is VALID [2022-04-27 13:19:52,338 INFO L290 TraceCheckUtils]: 18: Hoare triple {25876#true} ~cond := #in~cond; {25876#true} is VALID [2022-04-27 13:19:52,338 INFO L272 TraceCheckUtils]: 17: Hoare triple {25876#true} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {25876#true} is VALID [2022-04-27 13:19:52,338 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {25876#true} {25876#true} #96#return; {25876#true} is VALID [2022-04-27 13:19:52,338 INFO L290 TraceCheckUtils]: 15: Hoare triple {25876#true} assume true; {25876#true} is VALID [2022-04-27 13:19:52,338 INFO L290 TraceCheckUtils]: 14: Hoare triple {25876#true} assume !(0 == ~cond); {25876#true} is VALID [2022-04-27 13:19:52,338 INFO L290 TraceCheckUtils]: 13: Hoare triple {25876#true} ~cond := #in~cond; {25876#true} is VALID [2022-04-27 13:19:52,338 INFO L272 TraceCheckUtils]: 12: Hoare triple {25876#true} call assume_abort_if_not((if ~y~0 >= 0 && ~y~0 <= 50 then 1 else 0)); {25876#true} is VALID [2022-04-27 13:19:52,338 INFO L290 TraceCheckUtils]: 11: Hoare triple {25876#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {25876#true} is VALID [2022-04-27 13:19:52,338 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {25876#true} {25876#true} #94#return; {25876#true} is VALID [2022-04-27 13:19:52,338 INFO L290 TraceCheckUtils]: 9: Hoare triple {25876#true} assume true; {25876#true} is VALID [2022-04-27 13:19:52,338 INFO L290 TraceCheckUtils]: 8: Hoare triple {25876#true} assume !(0 == ~cond); {25876#true} is VALID [2022-04-27 13:19:52,339 INFO L290 TraceCheckUtils]: 7: Hoare triple {25876#true} ~cond := #in~cond; {25876#true} is VALID [2022-04-27 13:19:52,339 INFO L272 TraceCheckUtils]: 6: Hoare triple {25876#true} call assume_abort_if_not((if ~x~0 >= 0 && ~x~0 <= 50 then 1 else 0)); {25876#true} is VALID [2022-04-27 13:19:52,339 INFO L290 TraceCheckUtils]: 5: Hoare triple {25876#true} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~s~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4; {25876#true} is VALID [2022-04-27 13:19:52,339 INFO L272 TraceCheckUtils]: 4: Hoare triple {25876#true} call #t~ret6 := main(); {25876#true} is VALID [2022-04-27 13:19:52,339 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {25876#true} {25876#true} #112#return; {25876#true} is VALID [2022-04-27 13:19:52,339 INFO L290 TraceCheckUtils]: 2: Hoare triple {25876#true} assume true; {25876#true} is VALID [2022-04-27 13:19:52,339 INFO L290 TraceCheckUtils]: 1: Hoare triple {25876#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(11, 2);call #Ultimate.allocInit(12, 3); {25876#true} is VALID [2022-04-27 13:19:52,339 INFO L272 TraceCheckUtils]: 0: Hoare triple {25876#true} call ULTIMATE.init(); {25876#true} is VALID [2022-04-27 13:19:52,339 INFO L134 CoverageAnalysis]: Checked inductivity of 206 backedges. 38 proven. 24 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2022-04-27 13:19:52,339 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 13:19:52,339 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [619453517] [2022-04-27 13:19:52,340 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 13:19:52,340 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2053750259] [2022-04-27 13:19:52,340 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2053750259] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 13:19:52,340 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-27 13:19:52,340 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 21 [2022-04-27 13:19:52,340 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [479501651] [2022-04-27 13:19:52,340 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-27 13:19:52,340 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 2.5714285714285716) internal successors, (54), 20 states have internal predecessors, (54), 7 states have call successors, (26), 2 states have call predecessors, (26), 2 states have return successors, (23), 9 states have call predecessors, (23), 7 states have call successors, (23) Word has length 94 [2022-04-27 13:19:52,341 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 13:19:52,341 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 21 states, 21 states have (on average 2.5714285714285716) internal successors, (54), 20 states have internal predecessors, (54), 7 states have call successors, (26), 2 states have call predecessors, (26), 2 states have return successors, (23), 9 states have call predecessors, (23), 7 states have call successors, (23) [2022-04-27 13:19:53,415 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 103 edges. 103 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 13:19:53,415 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-04-27 13:19:53,416 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 13:19:53,416 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-04-27 13:19:53,416 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=348, Unknown=0, NotChecked=0, Total=420 [2022-04-27 13:19:53,416 INFO L87 Difference]: Start difference. First operand 823 states and 1311 transitions. Second operand has 21 states, 21 states have (on average 2.5714285714285716) internal successors, (54), 20 states have internal predecessors, (54), 7 states have call successors, (26), 2 states have call predecessors, (26), 2 states have return successors, (23), 9 states have call predecessors, (23), 7 states have call successors, (23) [2022-04-27 13:20:04,745 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.31s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-27 13:20:06,755 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-27 13:20:09,071 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.57s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-27 13:20:12,039 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-27 13:20:26,629 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:20:26,629 INFO L93 Difference]: Finished difference Result 929 states and 1490 transitions. [2022-04-27 13:20:26,629 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-04-27 13:20:26,629 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 2.5714285714285716) internal successors, (54), 20 states have internal predecessors, (54), 7 states have call successors, (26), 2 states have call predecessors, (26), 2 states have return successors, (23), 9 states have call predecessors, (23), 7 states have call successors, (23) Word has length 94 [2022-04-27 13:20:26,630 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 13:20:26,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 21 states have (on average 2.5714285714285716) internal successors, (54), 20 states have internal predecessors, (54), 7 states have call successors, (26), 2 states have call predecessors, (26), 2 states have return successors, (23), 9 states have call predecessors, (23), 7 states have call successors, (23) [2022-04-27 13:20:26,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 138 transitions. [2022-04-27 13:20:26,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 21 states have (on average 2.5714285714285716) internal successors, (54), 20 states have internal predecessors, (54), 7 states have call successors, (26), 2 states have call predecessors, (26), 2 states have return successors, (23), 9 states have call predecessors, (23), 7 states have call successors, (23) [2022-04-27 13:20:26,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 138 transitions. [2022-04-27 13:20:26,634 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 17 states and 138 transitions. [2022-04-27 13:20:29,900 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 138 edges. 138 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 13:20:29,900 INFO L225 Difference]: With dead ends: 929 [2022-04-27 13:20:29,900 INFO L226 Difference]: Without dead ends: 0 [2022-04-27 13:20:29,903 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 201 GetRequests, 165 SyntacticMatches, 4 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 187 ImplicationChecksByTransitivity, 6.6s TimeCoverageRelationStatistics Valid=230, Invalid=892, Unknown=0, NotChecked=0, Total=1122 [2022-04-27 13:20:29,903 INFO L413 NwaCegarLoop]: 47 mSDtfsCounter, 80 mSDsluCounter, 278 mSDsCounter, 0 mSdLazyCounter, 750 mSolverCounterSat, 203 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 12.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 80 SdHoareTripleChecker+Valid, 325 SdHoareTripleChecker+Invalid, 954 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 203 IncrementalHoareTripleChecker+Valid, 750 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 12.6s IncrementalHoareTripleChecker+Time [2022-04-27 13:20:29,903 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [80 Valid, 325 Invalid, 954 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [203 Valid, 750 Invalid, 1 Unknown, 0 Unchecked, 12.6s Time] [2022-04-27 13:20:29,903 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-04-27 13:20:29,904 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-04-27 13:20:29,904 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 13:20:29,904 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 13:20:29,904 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 13:20:29,904 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 13:20:29,904 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:20:29,904 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-27 13:20:29,904 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-27 13:20:29,904 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 13:20:29,904 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 13:20:29,905 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 13:20:29,905 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 13:20:29,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:20:29,905 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-27 13:20:29,905 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-27 13:20:29,905 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 13:20:29,905 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 13:20:29,905 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 13:20:29,905 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 13:20:29,905 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 13:20:29,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-04-27 13:20:29,906 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 94 [2022-04-27 13:20:29,906 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 13:20:29,906 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-04-27 13:20:29,906 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 2.5714285714285716) internal successors, (54), 20 states have internal predecessors, (54), 7 states have call successors, (26), 2 states have call predecessors, (26), 2 states have return successors, (23), 9 states have call predecessors, (23), 7 states have call successors, (23) [2022-04-27 13:20:29,906 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-27 13:20:29,906 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 13:20:29,909 INFO L805 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-04-27 13:20:29,928 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Forceful destruction successful, exit code 0 [2022-04-27 13:20:30,123 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2022-04-27 13:20:30,125 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-04-27 13:20:38,345 WARN L232 SmtUtils]: Spent 7.51s on a formula simplification. DAG size of input: 464 DAG size of output: 472 (called from [L 182] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.or) [2022-04-27 13:20:45,768 WARN L232 SmtUtils]: Spent 7.29s on a formula simplification. DAG size of input: 465 DAG size of output: 468 (called from [L 182] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.or) [2022-04-27 13:20:57,384 WARN L232 SmtUtils]: Spent 11.57s on a formula simplification. DAG size of input: 406 DAG size of output: 404 (called from [L 182] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.or) [2022-04-27 13:21:04,716 WARN L232 SmtUtils]: Spent 7.29s on a formula simplification. DAG size of input: 466 DAG size of output: 471 (called from [L 182] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.or) [2022-04-27 13:21:12,387 WARN L232 SmtUtils]: Spent 7.62s on a formula simplification. DAG size of input: 472 DAG size of output: 473 (called from [L 182] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.or) [2022-04-27 13:21:19,996 WARN L232 SmtUtils]: Spent 7.56s on a formula simplification. DAG size of input: 472 DAG size of output: 473 (called from [L 182] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.or) [2022-04-27 13:21:28,849 WARN L232 SmtUtils]: Spent 7.65s on a formula simplification. DAG size of input: 166 DAG size of output: 54 (called from [L 149] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.combineInter) [2022-04-27 13:22:01,827 WARN L232 SmtUtils]: Spent 32.96s on a formula simplification. DAG size of input: 392 DAG size of output: 52 (called from [L 149] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.combineInter) [2022-04-27 13:22:53,015 WARN L232 SmtUtils]: Spent 51.15s on a formula simplification. DAG size of input: 388 DAG size of output: 52 (called from [L 149] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.combineInter) [2022-04-27 13:23:23,991 WARN L232 SmtUtils]: Spent 30.96s on a formula simplification. DAG size of input: 333 DAG size of output: 58 (called from [L 149] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.combineInter) [2022-04-27 13:24:25,044 WARN L232 SmtUtils]: Spent 1.02m on a formula simplification. DAG size of input: 391 DAG size of output: 52 (called from [L 149] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.combineInter) [2022-04-27 13:25:19,522 WARN L232 SmtUtils]: Spent 54.46s on a formula simplification. DAG size of input: 398 DAG size of output: 52 (called from [L 149] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.combineInter) [2022-04-27 13:26:21,119 WARN L232 SmtUtils]: Spent 1.03m on a formula simplification. DAG size of input: 398 DAG size of output: 52 (called from [L 149] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.combineInter) [2022-04-27 13:26:21,130 INFO L899 garLoopResultBuilder]: For program point reach_errorEXIT(line 4) no Hoare annotation was computed. [2022-04-27 13:26:21,130 INFO L899 garLoopResultBuilder]: For program point reach_errorENTRY(line 4) no Hoare annotation was computed. [2022-04-27 13:26:21,130 INFO L899 garLoopResultBuilder]: For program point reach_errorFINAL(line 4) no Hoare annotation was computed. [2022-04-27 13:26:21,130 INFO L902 garLoopResultBuilder]: At program point assume_abort_if_notENTRY(lines 7 9) the Hoare annotation is: true [2022-04-27 13:26:21,130 INFO L899 garLoopResultBuilder]: For program point L8(line 8) no Hoare annotation was computed. [2022-04-27 13:26:21,130 INFO L899 garLoopResultBuilder]: For program point L8-2(lines 7 9) no Hoare annotation was computed. [2022-04-27 13:26:21,131 INFO L899 garLoopResultBuilder]: For program point assume_abort_if_notEXIT(lines 7 9) no Hoare annotation was computed. [2022-04-27 13:26:21,131 INFO L895 garLoopResultBuilder]: At program point L35-2(lines 35 73) the Hoare annotation is: (let ((.cse1 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))) (let ((.cse0 (= main_~a~0 .cse1)) (.cse2 (<= 1 main_~y~0)) (.cse3 (<= main_~y~0 50))) (or (and (< main_~b~0 main_~a~0) (or (= main_~a~0 (+ main_~c~0 (* main_~b~0 main_~k~0))) (not (<= (* main_~b~0 3) main_~c~0)) (<= (* main_~b~0 4) main_~c~0)) (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (<= 1 main_~x~0) .cse0 (or (= .cse1 (+ (* main_~k~0 main_~y~0 main_~s~0) main_~c~0 (* main_~q~0 main_~k~0 main_~x~0))) (<= main_~b~0 main_~c~0)) .cse2 .cse3) (and (= main_~s~0 1) .cse0 (<= 1 main_~a~0) (= main_~b~0 main_~y~0) (= main_~q~0 0) .cse2 (= main_~a~0 main_~x~0) .cse3 (= main_~p~0 1))))) [2022-04-27 13:26:21,131 INFO L895 garLoopResultBuilder]: At program point L35-3(lines 35 73) the Hoare annotation is: (let ((.cse0 (* main_~q~0 main_~x~0)) (.cse1 (* main_~y~0 main_~s~0))) (let ((.cse2 (= main_~b~0 (+ .cse0 .cse1)))) (and (< main_~b~0 main_~a~0) (<= 1 main_~x~0) (= (+ .cse0 main_~a~0 .cse1) (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))) (or .cse2 (= main_~b~0 0)) (or .cse2 (<= main_~b~0 main_~c~0)) (<= 1 main_~y~0) (<= main_~y~0 50)))) [2022-04-27 13:26:21,131 INFO L899 garLoopResultBuilder]: For program point mainEXIT(lines 18 76) no Hoare annotation was computed. [2022-04-27 13:26:21,131 INFO L895 garLoopResultBuilder]: At program point L52(line 52) the Hoare annotation is: (let ((.cse4 (* main_~y~0 main_~r~0)) (.cse5 (* main_~p~0 main_~x~0))) (let ((.cse0 (= main_~a~0 (+ .cse4 .cse5))) (.cse1 (= (+ (* main_~d~0 main_~y~0 main_~s~0) (* main_~k~0 main_~y~0 main_~s~0) main_~c~0 (* main_~q~0 main_~k~0 main_~x~0) (* main_~d~0 main_~q~0 main_~x~0)) (+ .cse4 main_~v~0 .cse5))) (.cse2 (<= 1 main_~y~0)) (.cse3 (<= main_~y~0 50))) (or (and (< main_~b~0 main_~a~0) (= main_~v~0 (* main_~d~0 main_~b~0)) (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (<= 1 main_~x~0) .cse0 .cse1 .cse2 .cse3) (and (= main_~a~0 (+ main_~c~0 (* main_~b~0 main_~k~0))) (= main_~s~0 1) .cse0 .cse1 (<= 1 main_~a~0) (= main_~b~0 main_~y~0) (= main_~q~0 0) .cse2 (= main_~a~0 main_~x~0) .cse3 (= main_~p~0 1))))) [2022-04-27 13:26:21,131 INFO L899 garLoopResultBuilder]: For program point L36(lines 36 37) no Hoare annotation was computed. [2022-04-27 13:26:21,131 INFO L902 garLoopResultBuilder]: At program point L24(line 24) the Hoare annotation is: true [2022-04-27 13:26:21,131 INFO L895 garLoopResultBuilder]: At program point L24-1(line 24) the Hoare annotation is: (and (<= 0 main_~y~0) (<= main_~y~0 50)) [2022-04-27 13:26:21,131 INFO L899 garLoopResultBuilder]: For program point L53(lines 49 59) no Hoare annotation was computed. [2022-04-27 13:26:21,131 INFO L895 garLoopResultBuilder]: At program point L49-2(lines 49 59) the Hoare annotation is: (let ((.cse4 (* main_~y~0 main_~r~0)) (.cse5 (* main_~p~0 main_~x~0))) (let ((.cse0 (= main_~a~0 (+ .cse4 .cse5))) (.cse1 (= (+ (* main_~d~0 main_~y~0 main_~s~0) (* main_~k~0 main_~y~0 main_~s~0) main_~c~0 (* main_~q~0 main_~k~0 main_~x~0) (* main_~d~0 main_~q~0 main_~x~0)) (+ .cse4 main_~v~0 .cse5))) (.cse2 (<= 1 main_~y~0)) (.cse3 (<= main_~y~0 50))) (or (and (< main_~b~0 main_~a~0) (= main_~v~0 (* main_~d~0 main_~b~0)) (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (<= 1 main_~x~0) .cse0 .cse1 .cse2 .cse3) (and (= main_~a~0 (+ main_~c~0 (* main_~b~0 main_~k~0))) (= main_~s~0 1) .cse0 .cse1 (<= 1 main_~a~0) (= main_~b~0 main_~y~0) (= main_~q~0 0) .cse2 (= main_~a~0 main_~x~0) .cse3 (= main_~p~0 1))))) [2022-04-27 13:26:21,131 INFO L899 garLoopResultBuilder]: For program point L49-3(lines 49 59) no Hoare annotation was computed. [2022-04-27 13:26:21,131 INFO L899 garLoopResultBuilder]: For program point L74(line 74) no Hoare annotation was computed. [2022-04-27 13:26:21,131 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 50)) [2022-04-27 13:26:21,132 INFO L895 garLoopResultBuilder]: At program point L50(line 50) the Hoare annotation is: (let ((.cse4 (* main_~y~0 main_~r~0)) (.cse5 (* main_~p~0 main_~x~0))) (let ((.cse0 (= main_~a~0 (+ .cse4 .cse5))) (.cse1 (= (+ (* main_~d~0 main_~y~0 main_~s~0) (* main_~k~0 main_~y~0 main_~s~0) main_~c~0 (* main_~q~0 main_~k~0 main_~x~0) (* main_~d~0 main_~q~0 main_~x~0)) (+ .cse4 main_~v~0 .cse5))) (.cse2 (<= 1 main_~y~0)) (.cse3 (<= main_~y~0 50))) (or (and (< main_~b~0 main_~a~0) (= main_~v~0 (* main_~d~0 main_~b~0)) (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (<= 1 main_~x~0) .cse0 .cse1 .cse2 .cse3) (and (= main_~a~0 (+ main_~c~0 (* main_~b~0 main_~k~0))) (= main_~s~0 1) .cse0 .cse1 (<= 1 main_~a~0) (= main_~b~0 main_~y~0) (= main_~q~0 0) .cse2 (= main_~a~0 main_~x~0) .cse3 (= main_~p~0 1))))) [2022-04-27 13:26:21,132 INFO L895 garLoopResultBuilder]: At program point L50-1(line 50) the Hoare annotation is: (let ((.cse4 (* main_~y~0 main_~r~0)) (.cse5 (* main_~p~0 main_~x~0))) (let ((.cse0 (= main_~a~0 (+ main_~c~0 (* main_~b~0 main_~k~0)))) (.cse1 (= main_~a~0 (+ .cse4 .cse5))) (.cse2 (<= 1 main_~y~0)) (.cse3 (<= main_~y~0 50))) (or (and (< main_~b~0 main_~a~0) (= main_~v~0 (* main_~d~0 main_~b~0)) .cse0 (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (<= 1 main_~x~0) .cse1 .cse2 .cse3) (and .cse0 (= main_~s~0 1) .cse1 (= (+ (* main_~d~0 main_~y~0 main_~s~0) (* main_~k~0 main_~y~0 main_~s~0) main_~c~0 (* main_~q~0 main_~k~0 main_~x~0) (* main_~d~0 main_~q~0 main_~x~0)) (+ .cse4 main_~v~0 .cse5)) (<= 1 main_~a~0) (= main_~b~0 main_~y~0) (= main_~q~0 0) .cse2 (= main_~a~0 main_~x~0) .cse3 (= main_~p~0 1))))) [2022-04-27 13:26:21,132 INFO L899 garLoopResultBuilder]: For program point mainFINAL(lines 18 76) no Hoare annotation was computed. [2022-04-27 13:26:21,132 INFO L895 garLoopResultBuilder]: At program point L42-2(lines 42 62) the Hoare annotation is: (let ((.cse14 (* main_~y~0 main_~r~0)) (.cse15 (* main_~p~0 main_~x~0))) (let ((.cse11 (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))) (.cse12 (<= 1 main_~x~0)) (.cse0 (= main_~k~0 0)) (.cse10 (= main_~v~0 (* main_~d~0 main_~b~0))) (.cse1 (= main_~s~0 1)) (.cse2 (= main_~a~0 (+ .cse14 .cse15))) (.cse13 (= (+ (* main_~d~0 main_~y~0 main_~s~0) (* main_~k~0 main_~y~0 main_~s~0) main_~c~0 (* main_~q~0 main_~k~0 main_~x~0) (* main_~d~0 main_~q~0 main_~x~0)) (+ .cse14 main_~v~0 .cse15))) (.cse3 (<= 1 main_~a~0)) (.cse4 (= main_~b~0 main_~y~0)) (.cse5 (= main_~q~0 0)) (.cse6 (<= 1 main_~y~0)) (.cse7 (= main_~a~0 main_~x~0)) (.cse8 (<= main_~y~0 50)) (.cse9 (= main_~p~0 1))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (= main_~c~0 main_~x~0) .cse8 .cse9) (and (< main_~b~0 main_~a~0) .cse10 .cse11 .cse12 .cse2 .cse13 .cse6 .cse8) (and (= main_~c~0 main_~a~0) .cse11 .cse12 .cse0 .cse2 (< main_~b~0 main_~c~0) .cse6 .cse8) (and .cse10 .cse1 .cse2 .cse13 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9)))) [2022-04-27 13:26:21,132 INFO L899 garLoopResultBuilder]: For program point L42-3(lines 42 62) no Hoare annotation was computed. [2022-04-27 13:26:21,132 INFO L902 garLoopResultBuilder]: At program point mainENTRY(lines 18 76) the Hoare annotation is: true [2022-04-27 13:26:21,132 INFO L899 garLoopResultBuilder]: For program point L26(line 26) no Hoare annotation was computed. [2022-04-27 13:26:21,132 INFO L902 garLoopResultBuilder]: At program point L22(line 22) the Hoare annotation is: true [2022-04-27 13:26:21,132 INFO L899 garLoopResultBuilder]: For program point L22-1(line 22) no Hoare annotation was computed. [2022-04-27 13:26:21,132 INFO L895 garLoopResultBuilder]: At program point L51(line 51) the Hoare annotation is: (let ((.cse4 (* main_~y~0 main_~r~0)) (.cse5 (* main_~p~0 main_~x~0))) (let ((.cse0 (= main_~a~0 (+ main_~c~0 (* main_~b~0 main_~k~0)))) (.cse1 (= main_~a~0 (+ .cse4 .cse5))) (.cse2 (<= 1 main_~y~0)) (.cse3 (<= main_~y~0 50))) (or (and (< main_~b~0 main_~a~0) (= main_~v~0 (* main_~d~0 main_~b~0)) .cse0 (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (<= 1 main_~x~0) .cse1 .cse2 .cse3) (and .cse0 (= main_~s~0 1) .cse1 (= (+ (* main_~d~0 main_~y~0 main_~s~0) (* main_~k~0 main_~y~0 main_~s~0) main_~c~0 (* main_~q~0 main_~k~0 main_~x~0) (* main_~d~0 main_~q~0 main_~x~0)) (+ .cse4 main_~v~0 .cse5)) (<= 1 main_~a~0) (= main_~b~0 main_~y~0) (= main_~q~0 0) .cse2 (= main_~a~0 main_~x~0) .cse3 (= main_~p~0 1))))) [2022-04-27 13:26:21,132 INFO L899 garLoopResultBuilder]: For program point L43(lines 43 44) no Hoare annotation was computed. [2022-04-27 13:26:21,132 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2022-04-27 13:26:21,133 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 13:26:21,133 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2022-04-27 13:26:21,133 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-04-27 13:26:21,133 INFO L902 garLoopResultBuilder]: At program point L-1(line -1) the Hoare annotation is: true [2022-04-27 13:26:21,133 INFO L902 garLoopResultBuilder]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2022-04-27 13:26:21,133 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2022-04-27 13:26:21,133 INFO L902 garLoopResultBuilder]: At program point __VERIFIER_assertENTRY(lines 10 16) the Hoare annotation is: true [2022-04-27 13:26:21,133 INFO L899 garLoopResultBuilder]: For program point L12(lines 12 13) no Hoare annotation was computed. [2022-04-27 13:26:21,133 INFO L899 garLoopResultBuilder]: For program point L11(lines 11 14) no Hoare annotation was computed. [2022-04-27 13:26:21,133 INFO L899 garLoopResultBuilder]: For program point __VERIFIER_assertEXIT(lines 10 16) no Hoare annotation was computed. [2022-04-27 13:26:21,133 INFO L899 garLoopResultBuilder]: For program point L11-2(lines 10 16) no Hoare annotation was computed. [2022-04-27 13:26:21,133 INFO L899 garLoopResultBuilder]: For program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 13) no Hoare annotation was computed. [2022-04-27 13:26:21,136 INFO L356 BasicCegarLoop]: Path program histogram: [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 13:26:21,137 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-04-27 13:26:21,140 WARN L170 areAnnotationChecker]: reach_errorENTRY has no Hoare annotation [2022-04-27 13:26:21,140 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2022-04-27 13:26:21,147 WARN L170 areAnnotationChecker]: L8 has no Hoare annotation [2022-04-27 13:26:21,147 WARN L170 areAnnotationChecker]: L11 has no Hoare annotation [2022-04-27 13:26:21,147 WARN L170 areAnnotationChecker]: reach_errorFINAL has no Hoare annotation [2022-04-27 13:26:21,147 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2022-04-27 13:26:21,147 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2022-04-27 13:26:21,147 WARN L170 areAnnotationChecker]: L8 has no Hoare annotation [2022-04-27 13:26:21,147 WARN L170 areAnnotationChecker]: L8 has no Hoare annotation [2022-04-27 13:26:21,148 WARN L170 areAnnotationChecker]: L22-1 has no Hoare annotation [2022-04-27 13:26:21,148 WARN L170 areAnnotationChecker]: L11 has no Hoare annotation [2022-04-27 13:26:21,148 WARN L170 areAnnotationChecker]: L11 has no Hoare annotation [2022-04-27 13:26:21,148 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2022-04-27 13:26:21,148 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2022-04-27 13:26:21,148 WARN L170 areAnnotationChecker]: L8-2 has no Hoare annotation [2022-04-27 13:26:21,148 WARN L170 areAnnotationChecker]: L22-1 has no Hoare annotation [2022-04-27 13:26:21,148 WARN L170 areAnnotationChecker]: L12 has no Hoare annotation [2022-04-27 13:26:21,148 WARN L170 areAnnotationChecker]: L12 has no Hoare annotation [2022-04-27 13:26:21,148 WARN L170 areAnnotationChecker]: L11-2 has no Hoare annotation [2022-04-27 13:26:21,148 WARN L170 areAnnotationChecker]: assume_abort_if_notEXIT has no Hoare annotation [2022-04-27 13:26:21,148 WARN L170 areAnnotationChecker]: assume_abort_if_notEXIT has no Hoare annotation [2022-04-27 13:26:21,148 WARN L170 areAnnotationChecker]: assume_abort_if_notEXIT has no Hoare annotation [2022-04-27 13:26:21,148 WARN L170 areAnnotationChecker]: assume_abort_if_notEXIT has no Hoare annotation [2022-04-27 13:26:21,148 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-27 13:26:21,148 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-27 13:26:21,148 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-27 13:26:21,148 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-27 13:26:21,148 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-27 13:26:21,148 WARN L170 areAnnotationChecker]: L26 has no Hoare annotation [2022-04-27 13:26:21,148 WARN L170 areAnnotationChecker]: L26 has no Hoare annotation [2022-04-27 13:26:21,148 WARN L170 areAnnotationChecker]: L53 has no Hoare annotation [2022-04-27 13:26:21,148 WARN L170 areAnnotationChecker]: L53 has no Hoare annotation [2022-04-27 13:26:21,149 WARN L170 areAnnotationChecker]: L53 has no Hoare annotation [2022-04-27 13:26:21,149 WARN L170 areAnnotationChecker]: L74 has no Hoare annotation [2022-04-27 13:26:21,152 WARN L170 areAnnotationChecker]: L36 has no Hoare annotation [2022-04-27 13:26:21,153 WARN L170 areAnnotationChecker]: L49-3 has no Hoare annotation [2022-04-27 13:26:21,153 WARN L170 areAnnotationChecker]: L49-3 has no Hoare annotation [2022-04-27 13:26:21,153 WARN L170 areAnnotationChecker]: L49-3 has no Hoare annotation [2022-04-27 13:26:21,156 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2022-04-27 13:26:21,156 WARN L170 areAnnotationChecker]: L74 has no Hoare annotation [2022-04-27 13:26:21,156 WARN L170 areAnnotationChecker]: L36 has no Hoare annotation [2022-04-27 13:26:21,156 WARN L170 areAnnotationChecker]: L36 has no Hoare annotation [2022-04-27 13:26:21,156 WARN L170 areAnnotationChecker]: L42-3 has no Hoare annotation [2022-04-27 13:26:21,156 WARN L170 areAnnotationChecker]: L42-3 has no Hoare annotation [2022-04-27 13:26:21,156 WARN L170 areAnnotationChecker]: L43 has no Hoare annotation [2022-04-27 13:26:21,156 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2022-04-27 13:26:21,156 WARN L170 areAnnotationChecker]: L42-3 has no Hoare annotation [2022-04-27 13:26:21,156 WARN L170 areAnnotationChecker]: L43 has no Hoare annotation [2022-04-27 13:26:21,156 WARN L170 areAnnotationChecker]: L43 has no Hoare annotation [2022-04-27 13:26:21,156 INFO L163 areAnnotationChecker]: CFG has 15 edges. 15 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2022-04-27 13:26:21,169 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.04 01:26:21 BoogieIcfgContainer [2022-04-27 13:26:21,169 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-04-27 13:26:21,170 INFO L158 Benchmark]: Toolchain (without parser) took 773077.92ms. Allocated memory was 169.9MB in the beginning and 294.6MB in the end (delta: 124.8MB). Free memory was 118.6MB in the beginning and 95.4MB in the end (delta: 23.2MB). Peak memory consumption was 156.9MB. Max. memory is 8.0GB. [2022-04-27 13:26:21,170 INFO L158 Benchmark]: CDTParser took 0.08ms. Allocated memory is still 169.9MB. Free memory is still 134.8MB. There was no memory consumed. Max. memory is 8.0GB. [2022-04-27 13:26:21,170 INFO L158 Benchmark]: CACSL2BoogieTranslator took 223.24ms. Allocated memory is still 169.9MB. Free memory was 118.4MB in the beginning and 145.5MB in the end (delta: -27.2MB). Peak memory consumption was 5.7MB. Max. memory is 8.0GB. [2022-04-27 13:26:21,171 INFO L158 Benchmark]: Boogie Preprocessor took 24.78ms. Allocated memory is still 169.9MB. Free memory was 145.5MB in the beginning and 144.1MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-04-27 13:26:21,171 INFO L158 Benchmark]: RCFGBuilder took 389.35ms. Allocated memory is still 169.9MB. Free memory was 144.1MB in the beginning and 130.9MB in the end (delta: 13.1MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2022-04-27 13:26:21,171 INFO L158 Benchmark]: TraceAbstraction took 772435.36ms. Allocated memory was 169.9MB in the beginning and 294.6MB in the end (delta: 124.8MB). Free memory was 130.4MB in the beginning and 95.4MB in the end (delta: 35.1MB). Peak memory consumption was 168.8MB. Max. memory is 8.0GB. [2022-04-27 13:26:21,172 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - AssertionsEnabledResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.08ms. Allocated memory is still 169.9MB. Free memory is still 134.8MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 223.24ms. Allocated memory is still 169.9MB. Free memory was 118.4MB in the beginning and 145.5MB in the end (delta: -27.2MB). Peak memory consumption was 5.7MB. Max. memory is 8.0GB. * Boogie Preprocessor took 24.78ms. Allocated memory is still 169.9MB. Free memory was 145.5MB in the beginning and 144.1MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 389.35ms. Allocated memory is still 169.9MB. Free memory was 144.1MB in the beginning and 130.9MB in the end (delta: 13.1MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * TraceAbstraction took 772435.36ms. Allocated memory was 169.9MB in the beginning and 294.6MB in the end (delta: 124.8MB). Free memory was 130.4MB in the beginning and 95.4MB in the end (delta: 35.1MB). Peak memory consumption was 168.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, 43 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 772.3s, OverallIterations: 18, TraceHistogramMax: 11, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 157.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 351.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 2 mSolverCounterUnknown, 1203 SdHoareTripleChecker+Valid, 42.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1141 mSDsluCounter, 4252 SdHoareTripleChecker+Invalid, 42.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 70 IncrementalHoareTripleChecker+Unchecked, 3331 mSDsCounter, 1630 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 6408 IncrementalHoareTripleChecker+Invalid, 8110 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1630 mSolverCounterUnsat, 921 mSDtfsCounter, 6408 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1972 GetRequests, 1628 SyntacticMatches, 18 SemanticMatches, 326 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2162 ImplicationChecksByTransitivity, 27.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=823occurred in iteration=17, InterpolantAutomatonStates: 250, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 10.9s AutomataMinimizationTime, 18 MinimizatonAttempts, 486 StatesRemovedByMinimization, 15 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 18 LocationsWithAnnotation, 565 PreInvPairs, 1178 NumberOfFragments, 1020 HoareAnnotationTreeSize, 565 FomulaSimplifications, 286527 FormulaSimplificationTreeSizeReduction, 49.9s HoareSimplificationTime, 18 FomulaSimplificationsInter, 738012 FormulaSimplificationTreeSizeReductionInter, 301.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 242.7s InterpolantComputationTime, 1063 NumberOfCodeBlocks, 1042 NumberOfCodeBlocksAsserted, 22 NumberOfCheckSat, 1806 ConstructedInterpolants, 3 QuantifiedInterpolants, 9373 SizeOfPredicates, 99 NumberOfNonLiveVariables, 2865 ConjunctsInSsa, 472 ConjunctsInUnsatCore, 30 InterpolantComputations, 9 PerfectInterpolantSequences, 2231/2489 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: 49]: Loop Invariant Derived loop invariant: (((((((b < a && v == d * b) && b == q * x + y * s) && 1 <= x) && a == y * r + p * x) && d * y * s + k * y * s + c + q * k * x + d * q * x == y * r + v + p * x) && 1 <= y) && y <= 50) || ((((((((((a == c + b * k && s == 1) && a == y * r + p * x) && d * y * s + k * y * s + c + q * k * x + d * q * x == y * r + v + p * x) && 1 <= a) && b == y) && q == 0) && 1 <= y) && a == x) && y <= 50) && p == 1) - InvariantResult [Line: 35]: Loop Invariant Derived loop invariant: (((((((b < a && ((a == c + b * k || !(b * 3 <= c)) || b * 4 <= c)) && b == q * x + y * s) && 1 <= x) && a == y * r + p * x) && (y * r + p * x == k * y * s + c + q * k * x || b <= c)) && 1 <= y) && y <= 50) || ((((((((s == 1 && a == y * r + p * x) && 1 <= a) && b == y) && q == 0) && 1 <= y) && a == x) && y <= 50) && p == 1) - InvariantResult [Line: 42]: Loop Invariant Derived loop invariant: ((((((((((((k == 0 && s == 1) && a == y * r + p * x) && 1 <= a) && b == y) && q == 0) && 1 <= y) && a == x) && c == x) && y <= 50) && p == 1) || (((((((b < a && v == d * b) && b == q * x + y * s) && 1 <= x) && a == y * r + p * x) && d * y * s + k * y * s + c + q * k * x + d * q * x == y * r + v + p * x) && 1 <= y) && y <= 50)) || (((((((c == a && b == q * x + y * s) && 1 <= x) && k == 0) && a == y * r + p * x) && b < c) && 1 <= y) && y <= 50)) || ((((((((((v == d * b && s == 1) && a == y * r + p * x) && d * y * s + k * y * s + c + q * k * x + d * q * x == y * r + v + p * x) && 1 <= a) && b == y) && q == 0) && 1 <= y) && a == x) && y <= 50) && p == 1) RESULT: Ultimate proved your program to be correct! [2022-04-27 13:26:21,299 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request...