/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/prodbin-ll_valuebound100.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-34549b5 [2022-04-07 15:12:33,488 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-07 15:12:33,491 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-07 15:12:33,523 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-07 15:12:33,525 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-07 15:12:33,527 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-07 15:12:33,530 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-07 15:12:33,532 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-07 15:12:33,533 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-07 15:12:33,537 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-07 15:12:33,538 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-07 15:12:33,540 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-07 15:12:33,541 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-07 15:12:33,542 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-07 15:12:33,543 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-07 15:12:33,544 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-07 15:12:33,545 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-07 15:12:33,546 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-07 15:12:33,550 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-07 15:12:33,551 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-07 15:12:33,552 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-07 15:12:33,554 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-07 15:12:33,555 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-07 15:12:33,555 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-07 15:12:33,557 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-07 15:12:33,559 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-07 15:12:33,559 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-07 15:12:33,559 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-07 15:12:33,560 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-07 15:12:33,560 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-07 15:12:33,561 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-07 15:12:33,561 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-07 15:12:33,562 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-07 15:12:33,562 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-07 15:12:33,563 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-07 15:12:33,563 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-07 15:12:33,564 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-07 15:12:33,564 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-07 15:12:33,564 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-07 15:12:33,564 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-07 15:12:33,565 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-07 15:12:33,566 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-07 15:12:33,566 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-07 15:12:33,583 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-07 15:12:33,583 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-07 15:12:33,583 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-04-07 15:12:33,584 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-04-07 15:12:33,584 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-04-07 15:12:33,584 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-04-07 15:12:33,585 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-04-07 15:12:33,585 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-04-07 15:12:33,585 INFO L138 SettingsManager]: * Use SBE=true [2022-04-07 15:12:33,585 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-07 15:12:33,585 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-07 15:12:33,585 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-07 15:12:33,586 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-07 15:12:33,586 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-07 15:12:33,586 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-07 15:12:33,586 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-07 15:12:33,586 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-07 15:12:33,586 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-07 15:12:33,586 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-07 15:12:33,587 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-07 15:12:33,587 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-07 15:12:33,587 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-07 15:12:33,587 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-07 15:12:33,587 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-07 15:12:33,587 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-07 15:12:33,587 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-07 15:12:33,588 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-04-07 15:12:33,588 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-04-07 15:12:33,588 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-04-07 15:12:33,588 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-04-07 15:12:33,588 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-04-07 15:12:33,588 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-04-07 15:12:33,588 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-07 15:12:33,589 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-07 15:12:33,792 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-07 15:12:33,811 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-07 15:12:33,813 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-07 15:12:33,814 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-07 15:12:33,815 INFO L275 PluginConnector]: CDTParser initialized [2022-04-07 15:12:33,816 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/nla-digbench-scaling/prodbin-ll_valuebound100.c [2022-04-07 15:12:33,872 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/60e6d1822/b7b51d6c791c436a828cbc0a3b47160d/FLAGeef13c9f0 [2022-04-07 15:12:34,242 INFO L306 CDTParser]: Found 1 translation units. [2022-04-07 15:12:34,242 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/prodbin-ll_valuebound100.c [2022-04-07 15:12:34,247 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/60e6d1822/b7b51d6c791c436a828cbc0a3b47160d/FLAGeef13c9f0 [2022-04-07 15:12:34,257 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/60e6d1822/b7b51d6c791c436a828cbc0a3b47160d [2022-04-07 15:12:34,259 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-07 15:12:34,260 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-07 15:12:34,262 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-07 15:12:34,262 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-07 15:12:34,264 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-07 15:12:34,265 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.04 03:12:34" (1/1) ... [2022-04-07 15:12:34,266 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@608003ed and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 03:12:34, skipping insertion in model container [2022-04-07 15:12:34,267 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.04 03:12:34" (1/1) ... [2022-04-07 15:12:34,275 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-07 15:12:34,285 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-07 15:12:34,447 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/prodbin-ll_valuebound100.c[537,550] [2022-04-07 15:12:34,473 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-07 15:12:34,487 INFO L203 MainTranslator]: Completed pre-run [2022-04-07 15:12:34,503 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/prodbin-ll_valuebound100.c[537,550] [2022-04-07 15:12:34,520 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-07 15:12:34,531 INFO L208 MainTranslator]: Completed translation [2022-04-07 15:12:34,536 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 03:12:34 WrapperNode [2022-04-07 15:12:34,536 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-07 15:12:34,537 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-07 15:12:34,537 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-07 15:12:34,537 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-07 15:12:34,547 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 03:12:34" (1/1) ... [2022-04-07 15:12:34,547 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 03:12:34" (1/1) ... [2022-04-07 15:12:34,553 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 03:12:34" (1/1) ... [2022-04-07 15:12:34,553 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 03:12:34" (1/1) ... [2022-04-07 15:12:34,569 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 03:12:34" (1/1) ... [2022-04-07 15:12:34,574 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 03:12:34" (1/1) ... [2022-04-07 15:12:34,576 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 03:12:34" (1/1) ... [2022-04-07 15:12:34,582 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-07 15:12:34,583 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-07 15:12:34,583 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-07 15:12:34,583 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-07 15:12:34,585 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 03:12:34" (1/1) ... [2022-04-07 15:12:34,590 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-07 15:12:34,602 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-07 15:12:34,616 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-07 15:12:34,629 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-07 15:12:34,664 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-07 15:12:34,664 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-07 15:12:34,664 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-07 15:12:34,664 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-07 15:12:34,665 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-07 15:12:34,665 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-07 15:12:34,665 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-07 15:12:34,665 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-07 15:12:34,665 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-07 15:12:34,665 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-07 15:12:34,665 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-04-07 15:12:34,665 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-07 15:12:34,665 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-07 15:12:34,665 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-07 15:12:34,666 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-07 15:12:34,666 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-07 15:12:34,666 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-07 15:12:34,666 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-07 15:12:34,666 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-07 15:12:34,666 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-07 15:12:34,714 INFO L234 CfgBuilder]: Building ICFG [2022-04-07 15:12:34,716 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-07 15:12:34,841 INFO L275 CfgBuilder]: Performing block encoding [2022-04-07 15:12:34,847 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-07 15:12:34,847 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-07 15:12:34,849 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.04 03:12:34 BoogieIcfgContainer [2022-04-07 15:12:34,849 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-07 15:12:34,850 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-07 15:12:34,850 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-07 15:12:34,853 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-07 15:12:34,853 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.04 03:12:34" (1/3) ... [2022-04-07 15:12:34,854 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@c4aa858 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.04 03:12:34, skipping insertion in model container [2022-04-07 15:12:34,854 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 03:12:34" (2/3) ... [2022-04-07 15:12:34,854 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@c4aa858 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.04 03:12:34, skipping insertion in model container [2022-04-07 15:12:34,854 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.04 03:12:34" (3/3) ... [2022-04-07 15:12:34,856 INFO L111 eAbstractionObserver]: Analyzing ICFG prodbin-ll_valuebound100.c [2022-04-07 15:12:34,860 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-04-07 15:12:34,860 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-07 15:12:34,895 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-07 15:12:34,900 INFO L340 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP [2022-04-07 15:12:34,900 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-07 15:12:34,917 INFO L276 IsEmpty]: Start isEmpty. Operand has 32 states, 19 states have (on average 1.368421052631579) internal successors, (26), 20 states have internal predecessors, (26), 7 states have call successors, (7), 4 states have call predecessors, (7), 4 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-07 15:12:34,921 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-04-07 15:12:34,922 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 15:12:34,922 INFO L499 BasicCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-07 15:12:34,923 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 15:12:34,927 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 15:12:34,933 INFO L85 PathProgramCache]: Analyzing trace with hash -589322634, now seen corresponding path program 1 times [2022-04-07 15:12:34,941 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 15:12:34,942 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1062324654] [2022-04-07 15:12:34,942 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 15:12:34,943 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 15:12:35,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 15:12:35,098 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-07 15:12:35,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 15:12:35,125 INFO L290 TraceCheckUtils]: 0: Hoare triple {52#(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(13, 2);call #Ultimate.allocInit(12, 3); {35#true} is VALID [2022-04-07 15:12:35,126 INFO L290 TraceCheckUtils]: 1: Hoare triple {35#true} assume true; {35#true} is VALID [2022-04-07 15:12:35,126 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {35#true} {35#true} #71#return; {35#true} is VALID [2022-04-07 15:12:35,127 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-07 15:12:35,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 15:12:35,144 INFO L290 TraceCheckUtils]: 0: Hoare triple {35#true} ~cond := #in~cond; {35#true} is VALID [2022-04-07 15:12:35,145 INFO L290 TraceCheckUtils]: 1: Hoare triple {35#true} assume 0 == ~cond;assume false; {36#false} is VALID [2022-04-07 15:12:35,146 INFO L290 TraceCheckUtils]: 2: Hoare triple {36#false} assume true; {36#false} is VALID [2022-04-07 15:12:35,146 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {36#false} {35#true} #61#return; {36#false} is VALID [2022-04-07 15:12:35,148 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-04-07 15:12:35,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 15:12:35,169 INFO L290 TraceCheckUtils]: 0: Hoare triple {35#true} ~cond := #in~cond; {35#true} is VALID [2022-04-07 15:12:35,171 INFO L290 TraceCheckUtils]: 1: Hoare triple {35#true} assume 0 == ~cond;assume false; {36#false} is VALID [2022-04-07 15:12:35,171 INFO L290 TraceCheckUtils]: 2: Hoare triple {36#false} assume true; {36#false} is VALID [2022-04-07 15:12:35,172 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {36#false} {36#false} #63#return; {36#false} is VALID [2022-04-07 15:12:35,172 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-04-07 15:12:35,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 15:12:35,181 INFO L290 TraceCheckUtils]: 0: Hoare triple {35#true} ~cond := #in~cond; {35#true} is VALID [2022-04-07 15:12:35,181 INFO L290 TraceCheckUtils]: 1: Hoare triple {35#true} assume 0 == ~cond;assume false; {36#false} is VALID [2022-04-07 15:12:35,182 INFO L290 TraceCheckUtils]: 2: Hoare triple {36#false} assume true; {36#false} is VALID [2022-04-07 15:12:35,182 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {36#false} {36#false} #65#return; {36#false} is VALID [2022-04-07 15:12:35,183 INFO L272 TraceCheckUtils]: 0: Hoare triple {35#true} call ULTIMATE.init(); {52#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-07 15:12:35,184 INFO L290 TraceCheckUtils]: 1: Hoare triple {52#(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(13, 2);call #Ultimate.allocInit(12, 3); {35#true} is VALID [2022-04-07 15:12:35,184 INFO L290 TraceCheckUtils]: 2: Hoare triple {35#true} assume true; {35#true} is VALID [2022-04-07 15:12:35,184 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {35#true} {35#true} #71#return; {35#true} is VALID [2022-04-07 15:12:35,184 INFO L272 TraceCheckUtils]: 4: Hoare triple {35#true} call #t~ret6 := main(); {35#true} is VALID [2022-04-07 15:12:35,185 INFO L290 TraceCheckUtils]: 5: Hoare triple {35#true} havoc ~a~0;havoc ~b~0;havoc ~x~0;havoc ~y~0;havoc ~z~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~a~0 := #t~nondet4;havoc #t~nondet4; {35#true} is VALID [2022-04-07 15:12:35,185 INFO L272 TraceCheckUtils]: 6: Hoare triple {35#true} call assume_abort_if_not((if ~a~0 >= 0 && ~a~0 <= 100 then 1 else 0)); {35#true} is VALID [2022-04-07 15:12:35,185 INFO L290 TraceCheckUtils]: 7: Hoare triple {35#true} ~cond := #in~cond; {35#true} is VALID [2022-04-07 15:12:35,186 INFO L290 TraceCheckUtils]: 8: Hoare triple {35#true} assume 0 == ~cond;assume false; {36#false} is VALID [2022-04-07 15:12:35,186 INFO L290 TraceCheckUtils]: 9: Hoare triple {36#false} assume true; {36#false} is VALID [2022-04-07 15:12:35,186 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {36#false} {35#true} #61#return; {36#false} is VALID [2022-04-07 15:12:35,186 INFO L290 TraceCheckUtils]: 11: Hoare triple {36#false} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~b~0 := #t~nondet5;havoc #t~nondet5; {36#false} is VALID [2022-04-07 15:12:35,186 INFO L272 TraceCheckUtils]: 12: Hoare triple {36#false} call assume_abort_if_not((if ~b~0 >= 0 && ~b~0 <= 100 then 1 else 0)); {35#true} is VALID [2022-04-07 15:12:35,187 INFO L290 TraceCheckUtils]: 13: Hoare triple {35#true} ~cond := #in~cond; {35#true} is VALID [2022-04-07 15:12:35,187 INFO L290 TraceCheckUtils]: 14: Hoare triple {35#true} assume 0 == ~cond;assume false; {36#false} is VALID [2022-04-07 15:12:35,187 INFO L290 TraceCheckUtils]: 15: Hoare triple {36#false} assume true; {36#false} is VALID [2022-04-07 15:12:35,187 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {36#false} {36#false} #63#return; {36#false} is VALID [2022-04-07 15:12:35,188 INFO L272 TraceCheckUtils]: 17: Hoare triple {36#false} call assume_abort_if_not((if ~b~0 >= 1 then 1 else 0)); {35#true} is VALID [2022-04-07 15:12:35,188 INFO L290 TraceCheckUtils]: 18: Hoare triple {35#true} ~cond := #in~cond; {35#true} is VALID [2022-04-07 15:12:35,188 INFO L290 TraceCheckUtils]: 19: Hoare triple {35#true} assume 0 == ~cond;assume false; {36#false} is VALID [2022-04-07 15:12:35,189 INFO L290 TraceCheckUtils]: 20: Hoare triple {36#false} assume true; {36#false} is VALID [2022-04-07 15:12:35,189 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {36#false} {36#false} #65#return; {36#false} is VALID [2022-04-07 15:12:35,189 INFO L290 TraceCheckUtils]: 22: Hoare triple {36#false} ~x~0 := ~a~0;~y~0 := ~b~0;~z~0 := 0; {36#false} is VALID [2022-04-07 15:12:35,189 INFO L290 TraceCheckUtils]: 23: Hoare triple {36#false} assume false; {36#false} is VALID [2022-04-07 15:12:35,189 INFO L272 TraceCheckUtils]: 24: Hoare triple {36#false} call __VERIFIER_assert((if ~z~0 == ~a~0 * ~b~0 then 1 else 0)); {36#false} is VALID [2022-04-07 15:12:35,190 INFO L290 TraceCheckUtils]: 25: Hoare triple {36#false} ~cond := #in~cond; {36#false} is VALID [2022-04-07 15:12:35,190 INFO L290 TraceCheckUtils]: 26: Hoare triple {36#false} assume 0 == ~cond; {36#false} is VALID [2022-04-07 15:12:35,190 INFO L290 TraceCheckUtils]: 27: Hoare triple {36#false} assume !false; {36#false} is VALID [2022-04-07 15:12:35,190 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-04-07 15:12:35,191 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 15:12:35,191 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1062324654] [2022-04-07 15:12:35,192 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1062324654] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-07 15:12:35,192 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-07 15:12:35,192 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-07 15:12:35,194 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [474897192] [2022-04-07 15:12:35,194 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-07 15:12:35,199 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, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 28 [2022-04-07 15:12:35,201 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 15:12:35,203 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, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-07 15:12:35,229 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 22 edges. 22 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 15:12:35,230 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-07 15:12:35,230 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 15:12:35,258 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-07 15:12:35,258 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-07 15:12:35,261 INFO L87 Difference]: Start difference. First operand has 32 states, 19 states have (on average 1.368421052631579) internal successors, (26), 20 states have internal predecessors, (26), 7 states have call successors, (7), 4 states have call predecessors, (7), 4 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Second operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-07 15:12:35,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 15:12:35,392 INFO L93 Difference]: Finished difference Result 57 states and 77 transitions. [2022-04-07 15:12:35,393 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-07 15:12:35,393 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, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 28 [2022-04-07 15:12:35,393 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 15:12:35,394 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, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-07 15:12:35,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 77 transitions. [2022-04-07 15:12:35,404 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, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-07 15:12:35,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 77 transitions. [2022-04-07 15:12:35,410 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 77 transitions. [2022-04-07 15:12:35,527 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 77 edges. 77 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 15:12:35,543 INFO L225 Difference]: With dead ends: 57 [2022-04-07 15:12:35,544 INFO L226 Difference]: Without dead ends: 27 [2022-04-07 15:12:35,550 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 12 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-07 15:12:35,557 INFO L913 BasicCegarLoop]: 31 mSDtfsCounter, 19 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 34 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-07 15:12:35,558 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [24 Valid, 34 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-07 15:12:35,576 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2022-04-07 15:12:35,600 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2022-04-07 15:12:35,600 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 15:12:35,601 INFO L82 GeneralOperation]: Start isEquivalent. First operand 27 states. Second operand has 27 states, 16 states have (on average 1.1875) internal successors, (19), 17 states have internal predecessors, (19), 7 states have call successors, (7), 4 states have call predecessors, (7), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-07 15:12:35,601 INFO L74 IsIncluded]: Start isIncluded. First operand 27 states. Second operand has 27 states, 16 states have (on average 1.1875) internal successors, (19), 17 states have internal predecessors, (19), 7 states have call successors, (7), 4 states have call predecessors, (7), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-07 15:12:35,602 INFO L87 Difference]: Start difference. First operand 27 states. Second operand has 27 states, 16 states have (on average 1.1875) internal successors, (19), 17 states have internal predecessors, (19), 7 states have call successors, (7), 4 states have call predecessors, (7), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-07 15:12:35,606 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 15:12:35,606 INFO L93 Difference]: Finished difference Result 27 states and 31 transitions. [2022-04-07 15:12:35,606 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 31 transitions. [2022-04-07 15:12:35,606 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 15:12:35,607 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 15:12:35,607 INFO L74 IsIncluded]: Start isIncluded. First operand has 27 states, 16 states have (on average 1.1875) internal successors, (19), 17 states have internal predecessors, (19), 7 states have call successors, (7), 4 states have call predecessors, (7), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand 27 states. [2022-04-07 15:12:35,607 INFO L87 Difference]: Start difference. First operand has 27 states, 16 states have (on average 1.1875) internal successors, (19), 17 states have internal predecessors, (19), 7 states have call successors, (7), 4 states have call predecessors, (7), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand 27 states. [2022-04-07 15:12:35,610 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 15:12:35,611 INFO L93 Difference]: Finished difference Result 27 states and 31 transitions. [2022-04-07 15:12:35,611 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 31 transitions. [2022-04-07 15:12:35,611 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 15:12:35,611 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 15:12:35,611 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 15:12:35,612 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 15:12:35,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 16 states have (on average 1.1875) internal successors, (19), 17 states have internal predecessors, (19), 7 states have call successors, (7), 4 states have call predecessors, (7), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-07 15:12:35,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 31 transitions. [2022-04-07 15:12:35,615 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 31 transitions. Word has length 28 [2022-04-07 15:12:35,616 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 15:12:35,616 INFO L478 AbstractCegarLoop]: Abstraction has 27 states and 31 transitions. [2022-04-07 15:12:35,616 INFO L479 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, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-07 15:12:35,616 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 31 transitions. [2022-04-07 15:12:35,617 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-04-07 15:12:35,617 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 15:12:35,617 INFO L499 BasicCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-07 15:12:35,617 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-07 15:12:35,618 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 15:12:35,618 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 15:12:35,618 INFO L85 PathProgramCache]: Analyzing trace with hash -1736242504, now seen corresponding path program 1 times [2022-04-07 15:12:35,619 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 15:12:35,619 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [46476652] [2022-04-07 15:12:35,622 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 15:12:35,622 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 15:12:35,646 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-07 15:12:35,646 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1352452898] [2022-04-07 15:12:35,646 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 15:12:35,647 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 15:12:35,647 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-07 15:12:35,648 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-07 15:12:35,649 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-07 15:12:35,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 15:12:35,708 INFO L263 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 9 conjunts are in the unsatisfiable core [2022-04-07 15:12:35,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 15:12:35,722 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-07 15:12:35,871 INFO L272 TraceCheckUtils]: 0: Hoare triple {224#true} call ULTIMATE.init(); {224#true} is VALID [2022-04-07 15:12:35,871 INFO L290 TraceCheckUtils]: 1: Hoare triple {224#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(13, 2);call #Ultimate.allocInit(12, 3); {224#true} is VALID [2022-04-07 15:12:35,872 INFO L290 TraceCheckUtils]: 2: Hoare triple {224#true} assume true; {224#true} is VALID [2022-04-07 15:12:35,872 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {224#true} {224#true} #71#return; {224#true} is VALID [2022-04-07 15:12:35,872 INFO L272 TraceCheckUtils]: 4: Hoare triple {224#true} call #t~ret6 := main(); {224#true} is VALID [2022-04-07 15:12:35,872 INFO L290 TraceCheckUtils]: 5: Hoare triple {224#true} havoc ~a~0;havoc ~b~0;havoc ~x~0;havoc ~y~0;havoc ~z~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~a~0 := #t~nondet4;havoc #t~nondet4; {224#true} is VALID [2022-04-07 15:12:35,872 INFO L272 TraceCheckUtils]: 6: Hoare triple {224#true} call assume_abort_if_not((if ~a~0 >= 0 && ~a~0 <= 100 then 1 else 0)); {224#true} is VALID [2022-04-07 15:12:35,873 INFO L290 TraceCheckUtils]: 7: Hoare triple {224#true} ~cond := #in~cond; {224#true} is VALID [2022-04-07 15:12:35,873 INFO L290 TraceCheckUtils]: 8: Hoare triple {224#true} assume !(0 == ~cond); {224#true} is VALID [2022-04-07 15:12:35,873 INFO L290 TraceCheckUtils]: 9: Hoare triple {224#true} assume true; {224#true} is VALID [2022-04-07 15:12:35,873 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {224#true} {224#true} #61#return; {224#true} is VALID [2022-04-07 15:12:35,873 INFO L290 TraceCheckUtils]: 11: Hoare triple {224#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~b~0 := #t~nondet5;havoc #t~nondet5; {224#true} is VALID [2022-04-07 15:12:35,873 INFO L272 TraceCheckUtils]: 12: Hoare triple {224#true} call assume_abort_if_not((if ~b~0 >= 0 && ~b~0 <= 100 then 1 else 0)); {224#true} is VALID [2022-04-07 15:12:35,874 INFO L290 TraceCheckUtils]: 13: Hoare triple {224#true} ~cond := #in~cond; {224#true} is VALID [2022-04-07 15:12:35,874 INFO L290 TraceCheckUtils]: 14: Hoare triple {224#true} assume !(0 == ~cond); {224#true} is VALID [2022-04-07 15:12:35,874 INFO L290 TraceCheckUtils]: 15: Hoare triple {224#true} assume true; {224#true} is VALID [2022-04-07 15:12:35,874 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {224#true} {224#true} #63#return; {224#true} is VALID [2022-04-07 15:12:35,874 INFO L272 TraceCheckUtils]: 17: Hoare triple {224#true} call assume_abort_if_not((if ~b~0 >= 1 then 1 else 0)); {224#true} is VALID [2022-04-07 15:12:35,874 INFO L290 TraceCheckUtils]: 18: Hoare triple {224#true} ~cond := #in~cond; {224#true} is VALID [2022-04-07 15:12:35,875 INFO L290 TraceCheckUtils]: 19: Hoare triple {224#true} assume !(0 == ~cond); {224#true} is VALID [2022-04-07 15:12:35,875 INFO L290 TraceCheckUtils]: 20: Hoare triple {224#true} assume true; {224#true} is VALID [2022-04-07 15:12:35,875 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {224#true} {224#true} #65#return; {224#true} is VALID [2022-04-07 15:12:35,876 INFO L290 TraceCheckUtils]: 22: Hoare triple {224#true} ~x~0 := ~a~0;~y~0 := ~b~0;~z~0 := 0; {295#(and (= main_~z~0 0) (= main_~b~0 main_~y~0) (= main_~a~0 main_~x~0))} is VALID [2022-04-07 15:12:35,876 INFO L290 TraceCheckUtils]: 23: Hoare triple {295#(and (= main_~z~0 0) (= main_~b~0 main_~y~0) (= main_~a~0 main_~x~0))} assume !false; {295#(and (= main_~z~0 0) (= main_~b~0 main_~y~0) (= main_~a~0 main_~x~0))} is VALID [2022-04-07 15:12:35,877 INFO L272 TraceCheckUtils]: 24: Hoare triple {295#(and (= main_~z~0 0) (= main_~b~0 main_~y~0) (= main_~a~0 main_~x~0))} call __VERIFIER_assert((if ~z~0 + ~x~0 * ~y~0 == ~a~0 * ~b~0 then 1 else 0)); {302#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-07 15:12:35,878 INFO L290 TraceCheckUtils]: 25: Hoare triple {302#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {306#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-07 15:12:35,878 INFO L290 TraceCheckUtils]: 26: Hoare triple {306#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {225#false} is VALID [2022-04-07 15:12:35,879 INFO L290 TraceCheckUtils]: 27: Hoare triple {225#false} assume !false; {225#false} is VALID [2022-04-07 15:12:35,879 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-04-07 15:12:35,879 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-07 15:12:35,879 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 15:12:35,879 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [46476652] [2022-04-07 15:12:35,879 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-07 15:12:35,880 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1352452898] [2022-04-07 15:12:35,880 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1352452898] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-07 15:12:35,880 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-07 15:12:35,880 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-07 15:12:35,881 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1651497382] [2022-04-07 15:12:35,881 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-07 15:12:35,881 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 28 [2022-04-07 15:12:35,882 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 15:12:35,882 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2022-04-07 15:12:35,901 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 22 edges. 22 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 15:12:35,901 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-07 15:12:35,902 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 15:12:35,903 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-07 15:12:35,904 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-07 15:12:35,904 INFO L87 Difference]: Start difference. First operand 27 states and 31 transitions. Second operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2022-04-07 15:12:36,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 15:12:36,077 INFO L93 Difference]: Finished difference Result 39 states and 45 transitions. [2022-04-07 15:12:36,077 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-07 15:12:36,077 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 28 [2022-04-07 15:12:36,078 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 15:12:36,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2022-04-07 15:12:36,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 45 transitions. [2022-04-07 15:12:36,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2022-04-07 15:12:36,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 45 transitions. [2022-04-07 15:12:36,082 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 45 transitions. [2022-04-07 15:12:36,122 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 45 edges. 45 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 15:12:36,126 INFO L225 Difference]: With dead ends: 39 [2022-04-07 15:12:36,127 INFO L226 Difference]: Without dead ends: 37 [2022-04-07 15:12:36,127 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 24 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-07 15:12:36,129 INFO L913 BasicCegarLoop]: 25 mSDtfsCounter, 8 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 87 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-07 15:12:36,130 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [9 Valid, 87 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-07 15:12:36,132 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2022-04-07 15:12:36,141 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 33. [2022-04-07 15:12:36,141 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 15:12:36,141 INFO L82 GeneralOperation]: Start isEquivalent. First operand 37 states. Second operand has 33 states, 20 states have (on average 1.15) internal successors, (23), 22 states have internal predecessors, (23), 8 states have call successors, (8), 5 states have call predecessors, (8), 4 states have return successors, (6), 5 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-07 15:12:36,142 INFO L74 IsIncluded]: Start isIncluded. First operand 37 states. Second operand has 33 states, 20 states have (on average 1.15) internal successors, (23), 22 states have internal predecessors, (23), 8 states have call successors, (8), 5 states have call predecessors, (8), 4 states have return successors, (6), 5 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-07 15:12:36,144 INFO L87 Difference]: Start difference. First operand 37 states. Second operand has 33 states, 20 states have (on average 1.15) internal successors, (23), 22 states have internal predecessors, (23), 8 states have call successors, (8), 5 states have call predecessors, (8), 4 states have return successors, (6), 5 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-07 15:12:36,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 15:12:36,149 INFO L93 Difference]: Finished difference Result 37 states and 43 transitions. [2022-04-07 15:12:36,151 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 43 transitions. [2022-04-07 15:12:36,154 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 15:12:36,154 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 15:12:36,156 INFO L74 IsIncluded]: Start isIncluded. First operand has 33 states, 20 states have (on average 1.15) internal successors, (23), 22 states have internal predecessors, (23), 8 states have call successors, (8), 5 states have call predecessors, (8), 4 states have return successors, (6), 5 states have call predecessors, (6), 6 states have call successors, (6) Second operand 37 states. [2022-04-07 15:12:36,156 INFO L87 Difference]: Start difference. First operand has 33 states, 20 states have (on average 1.15) internal successors, (23), 22 states have internal predecessors, (23), 8 states have call successors, (8), 5 states have call predecessors, (8), 4 states have return successors, (6), 5 states have call predecessors, (6), 6 states have call successors, (6) Second operand 37 states. [2022-04-07 15:12:36,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 15:12:36,164 INFO L93 Difference]: Finished difference Result 37 states and 43 transitions. [2022-04-07 15:12:36,164 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 43 transitions. [2022-04-07 15:12:36,168 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 15:12:36,168 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 15:12:36,168 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 15:12:36,168 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 15:12:36,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 20 states have (on average 1.15) internal successors, (23), 22 states have internal predecessors, (23), 8 states have call successors, (8), 5 states have call predecessors, (8), 4 states have return successors, (6), 5 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-07 15:12:36,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 37 transitions. [2022-04-07 15:12:36,171 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 37 transitions. Word has length 28 [2022-04-07 15:12:36,171 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 15:12:36,171 INFO L478 AbstractCegarLoop]: Abstraction has 33 states and 37 transitions. [2022-04-07 15:12:36,172 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2022-04-07 15:12:36,172 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 37 transitions. [2022-04-07 15:12:36,173 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-04-07 15:12:36,173 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 15:12:36,173 INFO L499 BasicCegarLoop]: trace histogram [3, 3, 3, 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-07 15:12:36,199 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-07 15:12:36,387 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 15:12:36,388 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 15:12:36,389 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 15:12:36,389 INFO L85 PathProgramCache]: Analyzing trace with hash 1911690432, now seen corresponding path program 1 times [2022-04-07 15:12:36,389 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 15:12:36,389 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [8438733] [2022-04-07 15:12:36,389 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 15:12:36,389 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 15:12:36,530 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-07 15:12:36,530 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [530444878] [2022-04-07 15:12:36,530 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 15:12:36,530 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 15:12:36,531 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-07 15:12:36,539 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-07 15:12:36,593 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-07 15:12:36,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 15:12:36,648 INFO L263 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-07 15:12:36,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 15:12:36,662 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-07 15:12:36,882 INFO L272 TraceCheckUtils]: 0: Hoare triple {491#true} call ULTIMATE.init(); {491#true} is VALID [2022-04-07 15:12:36,882 INFO L290 TraceCheckUtils]: 1: Hoare triple {491#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(13, 2);call #Ultimate.allocInit(12, 3); {491#true} is VALID [2022-04-07 15:12:36,882 INFO L290 TraceCheckUtils]: 2: Hoare triple {491#true} assume true; {491#true} is VALID [2022-04-07 15:12:36,883 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {491#true} {491#true} #71#return; {491#true} is VALID [2022-04-07 15:12:36,883 INFO L272 TraceCheckUtils]: 4: Hoare triple {491#true} call #t~ret6 := main(); {491#true} is VALID [2022-04-07 15:12:36,883 INFO L290 TraceCheckUtils]: 5: Hoare triple {491#true} havoc ~a~0;havoc ~b~0;havoc ~x~0;havoc ~y~0;havoc ~z~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~a~0 := #t~nondet4;havoc #t~nondet4; {491#true} is VALID [2022-04-07 15:12:36,883 INFO L272 TraceCheckUtils]: 6: Hoare triple {491#true} call assume_abort_if_not((if ~a~0 >= 0 && ~a~0 <= 100 then 1 else 0)); {491#true} is VALID [2022-04-07 15:12:36,883 INFO L290 TraceCheckUtils]: 7: Hoare triple {491#true} ~cond := #in~cond; {491#true} is VALID [2022-04-07 15:12:36,883 INFO L290 TraceCheckUtils]: 8: Hoare triple {491#true} assume !(0 == ~cond); {491#true} is VALID [2022-04-07 15:12:36,884 INFO L290 TraceCheckUtils]: 9: Hoare triple {491#true} assume true; {491#true} is VALID [2022-04-07 15:12:36,884 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {491#true} {491#true} #61#return; {491#true} is VALID [2022-04-07 15:12:36,884 INFO L290 TraceCheckUtils]: 11: Hoare triple {491#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~b~0 := #t~nondet5;havoc #t~nondet5; {491#true} is VALID [2022-04-07 15:12:36,884 INFO L272 TraceCheckUtils]: 12: Hoare triple {491#true} call assume_abort_if_not((if ~b~0 >= 0 && ~b~0 <= 100 then 1 else 0)); {491#true} is VALID [2022-04-07 15:12:36,884 INFO L290 TraceCheckUtils]: 13: Hoare triple {491#true} ~cond := #in~cond; {491#true} is VALID [2022-04-07 15:12:36,884 INFO L290 TraceCheckUtils]: 14: Hoare triple {491#true} assume !(0 == ~cond); {491#true} is VALID [2022-04-07 15:12:36,884 INFO L290 TraceCheckUtils]: 15: Hoare triple {491#true} assume true; {491#true} is VALID [2022-04-07 15:12:36,885 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {491#true} {491#true} #63#return; {491#true} is VALID [2022-04-07 15:12:36,885 INFO L272 TraceCheckUtils]: 17: Hoare triple {491#true} call assume_abort_if_not((if ~b~0 >= 1 then 1 else 0)); {491#true} is VALID [2022-04-07 15:12:36,885 INFO L290 TraceCheckUtils]: 18: Hoare triple {491#true} ~cond := #in~cond; {550#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-04-07 15:12:36,886 INFO L290 TraceCheckUtils]: 19: Hoare triple {550#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} assume !(0 == ~cond); {554#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-07 15:12:36,886 INFO L290 TraceCheckUtils]: 20: Hoare triple {554#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {554#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-07 15:12:36,887 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {554#(not (= |assume_abort_if_not_#in~cond| 0))} {491#true} #65#return; {561#(<= 1 main_~b~0)} is VALID [2022-04-07 15:12:36,888 INFO L290 TraceCheckUtils]: 22: Hoare triple {561#(<= 1 main_~b~0)} ~x~0 := ~a~0;~y~0 := ~b~0;~z~0 := 0; {565#(<= 1 main_~y~0)} is VALID [2022-04-07 15:12:36,888 INFO L290 TraceCheckUtils]: 23: Hoare triple {565#(<= 1 main_~y~0)} assume !false; {565#(<= 1 main_~y~0)} is VALID [2022-04-07 15:12:36,888 INFO L272 TraceCheckUtils]: 24: Hoare triple {565#(<= 1 main_~y~0)} call __VERIFIER_assert((if ~z~0 + ~x~0 * ~y~0 == ~a~0 * ~b~0 then 1 else 0)); {491#true} is VALID [2022-04-07 15:12:36,888 INFO L290 TraceCheckUtils]: 25: Hoare triple {491#true} ~cond := #in~cond; {491#true} is VALID [2022-04-07 15:12:36,888 INFO L290 TraceCheckUtils]: 26: Hoare triple {491#true} assume !(0 == ~cond); {491#true} is VALID [2022-04-07 15:12:36,889 INFO L290 TraceCheckUtils]: 27: Hoare triple {491#true} assume true; {491#true} is VALID [2022-04-07 15:12:36,889 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {491#true} {565#(<= 1 main_~y~0)} #67#return; {565#(<= 1 main_~y~0)} is VALID [2022-04-07 15:12:36,890 INFO L290 TraceCheckUtils]: 29: Hoare triple {565#(<= 1 main_~y~0)} assume !(0 != ~y~0); {492#false} is VALID [2022-04-07 15:12:36,890 INFO L272 TraceCheckUtils]: 30: Hoare triple {492#false} call __VERIFIER_assert((if ~z~0 == ~a~0 * ~b~0 then 1 else 0)); {492#false} is VALID [2022-04-07 15:12:36,890 INFO L290 TraceCheckUtils]: 31: Hoare triple {492#false} ~cond := #in~cond; {492#false} is VALID [2022-04-07 15:12:36,890 INFO L290 TraceCheckUtils]: 32: Hoare triple {492#false} assume 0 == ~cond; {492#false} is VALID [2022-04-07 15:12:36,891 INFO L290 TraceCheckUtils]: 33: Hoare triple {492#false} assume !false; {492#false} is VALID [2022-04-07 15:12:36,891 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-04-07 15:12:36,891 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-07 15:12:36,891 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 15:12:36,891 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [8438733] [2022-04-07 15:12:36,891 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-07 15:12:36,892 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [530444878] [2022-04-07 15:12:36,892 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [530444878] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-07 15:12:36,892 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-07 15:12:36,892 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-07 15:12:36,892 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1334974838] [2022-04-07 15:12:36,892 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-07 15:12:36,893 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 5 states have internal predecessors, (19), 3 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) Word has length 34 [2022-04-07 15:12:36,893 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 15:12:36,893 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 5 states have internal predecessors, (19), 3 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-07 15:12:36,917 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 31 edges. 31 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 15:12:36,917 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-07 15:12:36,917 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 15:12:36,918 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-07 15:12:36,918 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-04-07 15:12:36,918 INFO L87 Difference]: Start difference. First operand 33 states and 37 transitions. Second operand has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 5 states have internal predecessors, (19), 3 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-07 15:12:37,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 15:12:37,104 INFO L93 Difference]: Finished difference Result 43 states and 48 transitions. [2022-04-07 15:12:37,104 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-07 15:12:37,104 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 5 states have internal predecessors, (19), 3 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) Word has length 34 [2022-04-07 15:12:37,105 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 15:12:37,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 5 states have internal predecessors, (19), 3 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-07 15:12:37,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 45 transitions. [2022-04-07 15:12:37,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 5 states have internal predecessors, (19), 3 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-07 15:12:37,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 45 transitions. [2022-04-07 15:12:37,116 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 45 transitions. [2022-04-07 15:12:37,149 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 45 edges. 45 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 15:12:37,152 INFO L225 Difference]: With dead ends: 43 [2022-04-07 15:12:37,152 INFO L226 Difference]: Without dead ends: 36 [2022-04-07 15:12:37,153 INFO L912 BasicCegarLoop]: 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-07 15:12:37,156 INFO L913 BasicCegarLoop]: 24 mSDtfsCounter, 14 mSDsluCounter, 65 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 89 SdHoareTripleChecker+Invalid, 60 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-07 15:12:37,157 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [15 Valid, 89 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-07 15:12:37,159 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2022-04-07 15:12:37,166 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 34. [2022-04-07 15:12:37,167 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 15:12:37,167 INFO L82 GeneralOperation]: Start isEquivalent. First operand 36 states. Second operand has 34 states, 21 states have (on average 1.1428571428571428) internal successors, (24), 22 states have internal predecessors, (24), 8 states have call successors, (8), 5 states have call predecessors, (8), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-07 15:12:37,167 INFO L74 IsIncluded]: Start isIncluded. First operand 36 states. Second operand has 34 states, 21 states have (on average 1.1428571428571428) internal successors, (24), 22 states have internal predecessors, (24), 8 states have call successors, (8), 5 states have call predecessors, (8), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-07 15:12:37,168 INFO L87 Difference]: Start difference. First operand 36 states. Second operand has 34 states, 21 states have (on average 1.1428571428571428) internal successors, (24), 22 states have internal predecessors, (24), 8 states have call successors, (8), 5 states have call predecessors, (8), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-07 15:12:37,169 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 15:12:37,170 INFO L93 Difference]: Finished difference Result 36 states and 41 transitions. [2022-04-07 15:12:37,170 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 41 transitions. [2022-04-07 15:12:37,170 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 15:12:37,170 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 15:12:37,170 INFO L74 IsIncluded]: Start isIncluded. First operand has 34 states, 21 states have (on average 1.1428571428571428) internal successors, (24), 22 states have internal predecessors, (24), 8 states have call successors, (8), 5 states have call predecessors, (8), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand 36 states. [2022-04-07 15:12:37,171 INFO L87 Difference]: Start difference. First operand has 34 states, 21 states have (on average 1.1428571428571428) internal successors, (24), 22 states have internal predecessors, (24), 8 states have call successors, (8), 5 states have call predecessors, (8), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand 36 states. [2022-04-07 15:12:37,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 15:12:37,172 INFO L93 Difference]: Finished difference Result 36 states and 41 transitions. [2022-04-07 15:12:37,172 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 41 transitions. [2022-04-07 15:12:37,173 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 15:12:37,173 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 15:12:37,173 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 15:12:37,173 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 15:12:37,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 21 states have (on average 1.1428571428571428) internal successors, (24), 22 states have internal predecessors, (24), 8 states have call successors, (8), 5 states have call predecessors, (8), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-07 15:12:37,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 38 transitions. [2022-04-07 15:12:37,175 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 38 transitions. Word has length 34 [2022-04-07 15:12:37,175 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 15:12:37,175 INFO L478 AbstractCegarLoop]: Abstraction has 34 states and 38 transitions. [2022-04-07 15:12:37,175 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 5 states have internal predecessors, (19), 3 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-07 15:12:37,175 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 38 transitions. [2022-04-07 15:12:37,176 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-04-07 15:12:37,176 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 15:12:37,176 INFO L499 BasicCegarLoop]: trace histogram [3, 3, 3, 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] [2022-04-07 15:12:37,202 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-07 15:12:37,398 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2022-04-07 15:12:37,399 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 15:12:37,399 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 15:12:37,399 INFO L85 PathProgramCache]: Analyzing trace with hash 2022075506, now seen corresponding path program 1 times [2022-04-07 15:12:37,400 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 15:12:37,400 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1116921071] [2022-04-07 15:12:37,400 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 15:12:37,400 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 15:12:37,422 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-07 15:12:37,422 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [452241176] [2022-04-07 15:12:37,422 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 15:12:37,422 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 15:12:37,422 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-07 15:12:37,423 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-07 15:12:37,439 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-07 15:12:37,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 15:12:37,472 INFO L263 TraceCheckSpWp]: Trace formula consists of 111 conjuncts, 23 conjunts are in the unsatisfiable core [2022-04-07 15:12:37,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 15:12:37,485 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-07 15:12:42,352 INFO L272 TraceCheckUtils]: 0: Hoare triple {783#true} call ULTIMATE.init(); {783#true} is VALID [2022-04-07 15:12:42,352 INFO L290 TraceCheckUtils]: 1: Hoare triple {783#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(13, 2);call #Ultimate.allocInit(12, 3); {783#true} is VALID [2022-04-07 15:12:42,352 INFO L290 TraceCheckUtils]: 2: Hoare triple {783#true} assume true; {783#true} is VALID [2022-04-07 15:12:42,352 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {783#true} {783#true} #71#return; {783#true} is VALID [2022-04-07 15:12:42,353 INFO L272 TraceCheckUtils]: 4: Hoare triple {783#true} call #t~ret6 := main(); {783#true} is VALID [2022-04-07 15:12:42,353 INFO L290 TraceCheckUtils]: 5: Hoare triple {783#true} havoc ~a~0;havoc ~b~0;havoc ~x~0;havoc ~y~0;havoc ~z~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~a~0 := #t~nondet4;havoc #t~nondet4; {783#true} is VALID [2022-04-07 15:12:42,354 INFO L272 TraceCheckUtils]: 6: Hoare triple {783#true} call assume_abort_if_not((if ~a~0 >= 0 && ~a~0 <= 100 then 1 else 0)); {783#true} is VALID [2022-04-07 15:12:42,355 INFO L290 TraceCheckUtils]: 7: Hoare triple {783#true} ~cond := #in~cond; {783#true} is VALID [2022-04-07 15:12:42,355 INFO L290 TraceCheckUtils]: 8: Hoare triple {783#true} assume !(0 == ~cond); {783#true} is VALID [2022-04-07 15:12:42,356 INFO L290 TraceCheckUtils]: 9: Hoare triple {783#true} assume true; {783#true} is VALID [2022-04-07 15:12:42,356 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {783#true} {783#true} #61#return; {783#true} is VALID [2022-04-07 15:12:42,369 INFO L290 TraceCheckUtils]: 11: Hoare triple {783#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~b~0 := #t~nondet5;havoc #t~nondet5; {783#true} is VALID [2022-04-07 15:12:42,369 INFO L272 TraceCheckUtils]: 12: Hoare triple {783#true} call assume_abort_if_not((if ~b~0 >= 0 && ~b~0 <= 100 then 1 else 0)); {783#true} is VALID [2022-04-07 15:12:42,369 INFO L290 TraceCheckUtils]: 13: Hoare triple {783#true} ~cond := #in~cond; {783#true} is VALID [2022-04-07 15:12:42,370 INFO L290 TraceCheckUtils]: 14: Hoare triple {783#true} assume !(0 == ~cond); {783#true} is VALID [2022-04-07 15:12:42,370 INFO L290 TraceCheckUtils]: 15: Hoare triple {783#true} assume true; {783#true} is VALID [2022-04-07 15:12:42,370 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {783#true} {783#true} #63#return; {783#true} is VALID [2022-04-07 15:12:42,370 INFO L272 TraceCheckUtils]: 17: Hoare triple {783#true} call assume_abort_if_not((if ~b~0 >= 1 then 1 else 0)); {783#true} is VALID [2022-04-07 15:12:42,370 INFO L290 TraceCheckUtils]: 18: Hoare triple {783#true} ~cond := #in~cond; {783#true} is VALID [2022-04-07 15:12:42,370 INFO L290 TraceCheckUtils]: 19: Hoare triple {783#true} assume !(0 == ~cond); {783#true} is VALID [2022-04-07 15:12:42,370 INFO L290 TraceCheckUtils]: 20: Hoare triple {783#true} assume true; {783#true} is VALID [2022-04-07 15:12:42,370 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {783#true} {783#true} #65#return; {783#true} is VALID [2022-04-07 15:12:42,371 INFO L290 TraceCheckUtils]: 22: Hoare triple {783#true} ~x~0 := ~a~0;~y~0 := ~b~0;~z~0 := 0; {854#(and (= main_~z~0 0) (= main_~b~0 main_~y~0) (= main_~a~0 main_~x~0))} is VALID [2022-04-07 15:12:42,372 INFO L290 TraceCheckUtils]: 23: Hoare triple {854#(and (= main_~z~0 0) (= main_~b~0 main_~y~0) (= main_~a~0 main_~x~0))} assume !false; {854#(and (= main_~z~0 0) (= main_~b~0 main_~y~0) (= main_~a~0 main_~x~0))} is VALID [2022-04-07 15:12:42,372 INFO L272 TraceCheckUtils]: 24: Hoare triple {854#(and (= main_~z~0 0) (= main_~b~0 main_~y~0) (= main_~a~0 main_~x~0))} call __VERIFIER_assert((if ~z~0 + ~x~0 * ~y~0 == ~a~0 * ~b~0 then 1 else 0)); {783#true} is VALID [2022-04-07 15:12:42,372 INFO L290 TraceCheckUtils]: 25: Hoare triple {783#true} ~cond := #in~cond; {783#true} is VALID [2022-04-07 15:12:42,372 INFO L290 TraceCheckUtils]: 26: Hoare triple {783#true} assume !(0 == ~cond); {783#true} is VALID [2022-04-07 15:12:42,372 INFO L290 TraceCheckUtils]: 27: Hoare triple {783#true} assume true; {783#true} is VALID [2022-04-07 15:12:42,373 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {783#true} {854#(and (= main_~z~0 0) (= main_~b~0 main_~y~0) (= main_~a~0 main_~x~0))} #67#return; {854#(and (= main_~z~0 0) (= main_~b~0 main_~y~0) (= main_~a~0 main_~x~0))} is VALID [2022-04-07 15:12:42,373 INFO L290 TraceCheckUtils]: 29: Hoare triple {854#(and (= main_~z~0 0) (= main_~b~0 main_~y~0) (= main_~a~0 main_~x~0))} assume !!(0 != ~y~0); {876#(and (= main_~z~0 0) (not (= main_~y~0 0)) (= main_~b~0 main_~y~0) (= main_~a~0 main_~x~0))} is VALID [2022-04-07 15:12:42,379 INFO L290 TraceCheckUtils]: 30: Hoare triple {876#(and (= main_~z~0 0) (not (= main_~y~0 0)) (= main_~b~0 main_~y~0) (= main_~a~0 main_~x~0))} assume 1 == (if ~y~0 < 0 && 0 != ~y~0 % 2 then ~y~0 % 2 - 2 else ~y~0 % 2);~z~0 := ~z~0 + ~x~0;~y~0 := ~y~0 - 1; {880#(and (<= 1 (mod (+ main_~y~0 1) 2)) (= main_~b~0 (+ main_~y~0 1)) (= main_~z~0 main_~x~0) (= main_~a~0 main_~x~0) (<= 0 (+ main_~y~0 1)))} is VALID [2022-04-07 15:12:42,380 INFO L290 TraceCheckUtils]: 31: Hoare triple {880#(and (<= 1 (mod (+ main_~y~0 1) 2)) (= main_~b~0 (+ main_~y~0 1)) (= main_~z~0 main_~x~0) (= main_~a~0 main_~x~0) (<= 0 (+ main_~y~0 1)))} ~x~0 := 2 * ~x~0;~y~0 := (if ~y~0 < 0 && 0 != ~y~0 % 2 then 1 + ~y~0 / 2 else ~y~0 / 2); {884#(and (= main_~a~0 main_~z~0) (<= 1 (mod main_~b~0 2)) (= (* main_~a~0 2) main_~x~0) (<= 0 main_~b~0) (= (div (+ (- 1) main_~b~0) 2) main_~y~0))} is VALID [2022-04-07 15:12:42,381 INFO L290 TraceCheckUtils]: 32: Hoare triple {884#(and (= main_~a~0 main_~z~0) (<= 1 (mod main_~b~0 2)) (= (* main_~a~0 2) main_~x~0) (<= 0 main_~b~0) (= (div (+ (- 1) main_~b~0) 2) main_~y~0))} assume !false; {884#(and (= main_~a~0 main_~z~0) (<= 1 (mod main_~b~0 2)) (= (* main_~a~0 2) main_~x~0) (<= 0 main_~b~0) (= (div (+ (- 1) main_~b~0) 2) main_~y~0))} is VALID [2022-04-07 15:12:44,384 WARN L272 TraceCheckUtils]: 33: Hoare triple {884#(and (= main_~a~0 main_~z~0) (<= 1 (mod main_~b~0 2)) (= (* main_~a~0 2) main_~x~0) (<= 0 main_~b~0) (= (div (+ (- 1) main_~b~0) 2) main_~y~0))} call __VERIFIER_assert((if ~z~0 + ~x~0 * ~y~0 == ~a~0 * ~b~0 then 1 else 0)); {891#(<= 1 |__VERIFIER_assert_#in~cond|)} is UNKNOWN [2022-04-07 15:12:44,385 INFO L290 TraceCheckUtils]: 34: Hoare triple {891#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {895#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-07 15:12:44,389 INFO L290 TraceCheckUtils]: 35: Hoare triple {895#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {784#false} is VALID [2022-04-07 15:12:44,390 INFO L290 TraceCheckUtils]: 36: Hoare triple {784#false} assume !false; {784#false} is VALID [2022-04-07 15:12:44,390 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-04-07 15:12:44,390 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-07 15:13:07,843 INFO L290 TraceCheckUtils]: 36: Hoare triple {784#false} assume !false; {784#false} is VALID [2022-04-07 15:13:07,844 INFO L290 TraceCheckUtils]: 35: Hoare triple {895#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {784#false} is VALID [2022-04-07 15:13:07,844 INFO L290 TraceCheckUtils]: 34: Hoare triple {891#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {895#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-07 15:13:07,845 INFO L272 TraceCheckUtils]: 33: Hoare triple {911#(= (+ main_~z~0 (* main_~y~0 main_~x~0)) (* main_~b~0 main_~a~0))} call __VERIFIER_assert((if ~z~0 + ~x~0 * ~y~0 == ~a~0 * ~b~0 then 1 else 0)); {891#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-07 15:13:07,846 INFO L290 TraceCheckUtils]: 32: Hoare triple {911#(= (+ main_~z~0 (* main_~y~0 main_~x~0)) (* main_~b~0 main_~a~0))} assume !false; {911#(= (+ main_~z~0 (* main_~y~0 main_~x~0)) (* main_~b~0 main_~a~0))} is VALID [2022-04-07 15:13:07,851 INFO L290 TraceCheckUtils]: 31: Hoare triple {918#(and (or (not (< main_~y~0 0)) (= (mod main_~y~0 2) 0) (= (+ main_~z~0 (* (* main_~x~0 2) (+ (div main_~y~0 2) 1))) (* main_~b~0 main_~a~0))) (or (= (+ main_~z~0 (* (* main_~x~0 2) (div main_~y~0 2))) (* main_~b~0 main_~a~0)) (and (not (= (mod main_~y~0 2) 0)) (< main_~y~0 0))))} ~x~0 := 2 * ~x~0;~y~0 := (if ~y~0 < 0 && 0 != ~y~0 % 2 then 1 + ~y~0 / 2 else ~y~0 / 2); {911#(= (+ main_~z~0 (* main_~y~0 main_~x~0)) (* main_~b~0 main_~a~0))} is VALID [2022-04-07 15:13:07,854 INFO L290 TraceCheckUtils]: 30: Hoare triple {922#(or (= (+ (* (* main_~x~0 2) (div (+ (- 1) main_~y~0) 2)) main_~z~0 main_~x~0) (* main_~b~0 main_~a~0)) (not (<= 1 (mod main_~y~0 2))) (< main_~y~0 0))} assume 1 == (if ~y~0 < 0 && 0 != ~y~0 % 2 then ~y~0 % 2 - 2 else ~y~0 % 2);~z~0 := ~z~0 + ~x~0;~y~0 := ~y~0 - 1; {918#(and (or (not (< main_~y~0 0)) (= (mod main_~y~0 2) 0) (= (+ main_~z~0 (* (* main_~x~0 2) (+ (div main_~y~0 2) 1))) (* main_~b~0 main_~a~0))) (or (= (+ main_~z~0 (* (* main_~x~0 2) (div main_~y~0 2))) (* main_~b~0 main_~a~0)) (and (not (= (mod main_~y~0 2) 0)) (< main_~y~0 0))))} is VALID [2022-04-07 15:13:07,855 INFO L290 TraceCheckUtils]: 29: Hoare triple {922#(or (= (+ (* (* main_~x~0 2) (div (+ (- 1) main_~y~0) 2)) main_~z~0 main_~x~0) (* main_~b~0 main_~a~0)) (not (<= 1 (mod main_~y~0 2))) (< main_~y~0 0))} assume !!(0 != ~y~0); {922#(or (= (+ (* (* main_~x~0 2) (div (+ (- 1) main_~y~0) 2)) main_~z~0 main_~x~0) (* main_~b~0 main_~a~0)) (not (<= 1 (mod main_~y~0 2))) (< main_~y~0 0))} is VALID [2022-04-07 15:13:07,856 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {783#true} {922#(or (= (+ (* (* main_~x~0 2) (div (+ (- 1) main_~y~0) 2)) main_~z~0 main_~x~0) (* main_~b~0 main_~a~0)) (not (<= 1 (mod main_~y~0 2))) (< main_~y~0 0))} #67#return; {922#(or (= (+ (* (* main_~x~0 2) (div (+ (- 1) main_~y~0) 2)) main_~z~0 main_~x~0) (* main_~b~0 main_~a~0)) (not (<= 1 (mod main_~y~0 2))) (< main_~y~0 0))} is VALID [2022-04-07 15:13:07,856 INFO L290 TraceCheckUtils]: 27: Hoare triple {783#true} assume true; {783#true} is VALID [2022-04-07 15:13:07,856 INFO L290 TraceCheckUtils]: 26: Hoare triple {783#true} assume !(0 == ~cond); {783#true} is VALID [2022-04-07 15:13:07,856 INFO L290 TraceCheckUtils]: 25: Hoare triple {783#true} ~cond := #in~cond; {783#true} is VALID [2022-04-07 15:13:07,857 INFO L272 TraceCheckUtils]: 24: Hoare triple {922#(or (= (+ (* (* main_~x~0 2) (div (+ (- 1) main_~y~0) 2)) main_~z~0 main_~x~0) (* main_~b~0 main_~a~0)) (not (<= 1 (mod main_~y~0 2))) (< main_~y~0 0))} call __VERIFIER_assert((if ~z~0 + ~x~0 * ~y~0 == ~a~0 * ~b~0 then 1 else 0)); {783#true} is VALID [2022-04-07 15:13:07,857 INFO L290 TraceCheckUtils]: 23: Hoare triple {922#(or (= (+ (* (* main_~x~0 2) (div (+ (- 1) main_~y~0) 2)) main_~z~0 main_~x~0) (* main_~b~0 main_~a~0)) (not (<= 1 (mod main_~y~0 2))) (< main_~y~0 0))} assume !false; {922#(or (= (+ (* (* main_~x~0 2) (div (+ (- 1) main_~y~0) 2)) main_~z~0 main_~x~0) (* main_~b~0 main_~a~0)) (not (<= 1 (mod main_~y~0 2))) (< main_~y~0 0))} is VALID [2022-04-07 15:13:09,859 WARN L290 TraceCheckUtils]: 22: Hoare triple {783#true} ~x~0 := ~a~0;~y~0 := ~b~0;~z~0 := 0; {922#(or (= (+ (* (* main_~x~0 2) (div (+ (- 1) main_~y~0) 2)) main_~z~0 main_~x~0) (* main_~b~0 main_~a~0)) (not (<= 1 (mod main_~y~0 2))) (< main_~y~0 0))} is UNKNOWN [2022-04-07 15:13:09,859 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {783#true} {783#true} #65#return; {783#true} is VALID [2022-04-07 15:13:09,859 INFO L290 TraceCheckUtils]: 20: Hoare triple {783#true} assume true; {783#true} is VALID [2022-04-07 15:13:09,859 INFO L290 TraceCheckUtils]: 19: Hoare triple {783#true} assume !(0 == ~cond); {783#true} is VALID [2022-04-07 15:13:09,859 INFO L290 TraceCheckUtils]: 18: Hoare triple {783#true} ~cond := #in~cond; {783#true} is VALID [2022-04-07 15:13:09,860 INFO L272 TraceCheckUtils]: 17: Hoare triple {783#true} call assume_abort_if_not((if ~b~0 >= 1 then 1 else 0)); {783#true} is VALID [2022-04-07 15:13:09,860 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {783#true} {783#true} #63#return; {783#true} is VALID [2022-04-07 15:13:09,860 INFO L290 TraceCheckUtils]: 15: Hoare triple {783#true} assume true; {783#true} is VALID [2022-04-07 15:13:09,860 INFO L290 TraceCheckUtils]: 14: Hoare triple {783#true} assume !(0 == ~cond); {783#true} is VALID [2022-04-07 15:13:09,860 INFO L290 TraceCheckUtils]: 13: Hoare triple {783#true} ~cond := #in~cond; {783#true} is VALID [2022-04-07 15:13:09,860 INFO L272 TraceCheckUtils]: 12: Hoare triple {783#true} call assume_abort_if_not((if ~b~0 >= 0 && ~b~0 <= 100 then 1 else 0)); {783#true} is VALID [2022-04-07 15:13:09,860 INFO L290 TraceCheckUtils]: 11: Hoare triple {783#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~b~0 := #t~nondet5;havoc #t~nondet5; {783#true} is VALID [2022-04-07 15:13:09,860 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {783#true} {783#true} #61#return; {783#true} is VALID [2022-04-07 15:13:09,860 INFO L290 TraceCheckUtils]: 9: Hoare triple {783#true} assume true; {783#true} is VALID [2022-04-07 15:13:09,861 INFO L290 TraceCheckUtils]: 8: Hoare triple {783#true} assume !(0 == ~cond); {783#true} is VALID [2022-04-07 15:13:09,861 INFO L290 TraceCheckUtils]: 7: Hoare triple {783#true} ~cond := #in~cond; {783#true} is VALID [2022-04-07 15:13:09,861 INFO L272 TraceCheckUtils]: 6: Hoare triple {783#true} call assume_abort_if_not((if ~a~0 >= 0 && ~a~0 <= 100 then 1 else 0)); {783#true} is VALID [2022-04-07 15:13:09,861 INFO L290 TraceCheckUtils]: 5: Hoare triple {783#true} havoc ~a~0;havoc ~b~0;havoc ~x~0;havoc ~y~0;havoc ~z~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~a~0 := #t~nondet4;havoc #t~nondet4; {783#true} is VALID [2022-04-07 15:13:09,861 INFO L272 TraceCheckUtils]: 4: Hoare triple {783#true} call #t~ret6 := main(); {783#true} is VALID [2022-04-07 15:13:09,861 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {783#true} {783#true} #71#return; {783#true} is VALID [2022-04-07 15:13:09,861 INFO L290 TraceCheckUtils]: 2: Hoare triple {783#true} assume true; {783#true} is VALID [2022-04-07 15:13:09,861 INFO L290 TraceCheckUtils]: 1: Hoare triple {783#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(13, 2);call #Ultimate.allocInit(12, 3); {783#true} is VALID [2022-04-07 15:13:09,861 INFO L272 TraceCheckUtils]: 0: Hoare triple {783#true} call ULTIMATE.init(); {783#true} is VALID [2022-04-07 15:13:09,862 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 2 proven. 0 refuted. 2 times theorem prover too weak. 12 trivial. 0 not checked. [2022-04-07 15:13:09,862 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 15:13:09,862 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1116921071] [2022-04-07 15:13:09,862 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-07 15:13:09,862 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [452241176] [2022-04-07 15:13:09,862 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [452241176] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-07 15:13:09,863 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-07 15:13:09,863 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 11 [2022-04-07 15:13:09,863 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1166226518] [2022-04-07 15:13:09,863 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-07 15:13:09,864 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.272727272727273) internal successors, (25), 10 states have internal predecessors, (25), 5 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) Word has length 37 [2022-04-07 15:13:09,864 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 15:13:09,864 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 11 states, 11 states have (on average 2.272727272727273) internal successors, (25), 10 states have internal predecessors, (25), 5 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2022-04-07 15:13:12,113 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 40 edges. 39 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-07 15:13:12,113 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-04-07 15:13:12,114 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 15:13:12,114 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-04-07 15:13:12,114 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=80, Unknown=2, NotChecked=0, Total=110 [2022-04-07 15:13:12,115 INFO L87 Difference]: Start difference. First operand 34 states and 38 transitions. Second operand has 11 states, 11 states have (on average 2.272727272727273) internal successors, (25), 10 states have internal predecessors, (25), 5 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2022-04-07 15:13:22,723 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.04s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-07 15:13:22,892 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 15:13:22,893 INFO L93 Difference]: Finished difference Result 56 states and 66 transitions. [2022-04-07 15:13:22,893 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-04-07 15:13:22,893 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.272727272727273) internal successors, (25), 10 states have internal predecessors, (25), 5 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) Word has length 37 [2022-04-07 15:13:22,893 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 15:13:22,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 2.272727272727273) internal successors, (25), 10 states have internal predecessors, (25), 5 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2022-04-07 15:13:22,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 63 transitions. [2022-04-07 15:13:22,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 2.272727272727273) internal successors, (25), 10 states have internal predecessors, (25), 5 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2022-04-07 15:13:22,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 63 transitions. [2022-04-07 15:13:22,899 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 12 states and 63 transitions. [2022-04-07 15:13:22,984 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 63 edges. 63 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 15:13:22,985 INFO L225 Difference]: With dead ends: 56 [2022-04-07 15:13:22,986 INFO L226 Difference]: Without dead ends: 54 [2022-04-07 15:13:22,986 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 62 SyntacticMatches, 2 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 11.8s TimeCoverageRelationStatistics Valid=61, Invalid=177, Unknown=2, NotChecked=0, Total=240 [2022-04-07 15:13:22,987 INFO L913 BasicCegarLoop]: 26 mSDtfsCounter, 20 mSDsluCounter, 113 mSDsCounter, 0 mSdLazyCounter, 135 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 139 SdHoareTripleChecker+Invalid, 153 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 135 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.2s IncrementalHoareTripleChecker+Time [2022-04-07 15:13:22,987 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [20 Valid, 139 Invalid, 153 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 135 Invalid, 0 Unknown, 0 Unchecked, 3.2s Time] [2022-04-07 15:13:22,988 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2022-04-07 15:13:23,009 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 49. [2022-04-07 15:13:23,010 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 15:13:23,010 INFO L82 GeneralOperation]: Start isEquivalent. First operand 54 states. Second operand has 49 states, 33 states have (on average 1.2424242424242424) internal successors, (41), 34 states have internal predecessors, (41), 10 states have call successors, (10), 6 states have call predecessors, (10), 5 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-07 15:13:23,015 INFO L74 IsIncluded]: Start isIncluded. First operand 54 states. Second operand has 49 states, 33 states have (on average 1.2424242424242424) internal successors, (41), 34 states have internal predecessors, (41), 10 states have call successors, (10), 6 states have call predecessors, (10), 5 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-07 15:13:23,016 INFO L87 Difference]: Start difference. First operand 54 states. Second operand has 49 states, 33 states have (on average 1.2424242424242424) internal successors, (41), 34 states have internal predecessors, (41), 10 states have call successors, (10), 6 states have call predecessors, (10), 5 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-07 15:13:23,019 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 15:13:23,019 INFO L93 Difference]: Finished difference Result 54 states and 64 transitions. [2022-04-07 15:13:23,019 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 64 transitions. [2022-04-07 15:13:23,020 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 15:13:23,020 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 15:13:23,020 INFO L74 IsIncluded]: Start isIncluded. First operand has 49 states, 33 states have (on average 1.2424242424242424) internal successors, (41), 34 states have internal predecessors, (41), 10 states have call successors, (10), 6 states have call predecessors, (10), 5 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Second operand 54 states. [2022-04-07 15:13:23,021 INFO L87 Difference]: Start difference. First operand has 49 states, 33 states have (on average 1.2424242424242424) internal successors, (41), 34 states have internal predecessors, (41), 10 states have call successors, (10), 6 states have call predecessors, (10), 5 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Second operand 54 states. [2022-04-07 15:13:23,023 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 15:13:23,023 INFO L93 Difference]: Finished difference Result 54 states and 64 transitions. [2022-04-07 15:13:23,024 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 64 transitions. [2022-04-07 15:13:23,024 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 15:13:23,024 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 15:13:23,024 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 15:13:23,024 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 15:13:23,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 33 states have (on average 1.2424242424242424) internal successors, (41), 34 states have internal predecessors, (41), 10 states have call successors, (10), 6 states have call predecessors, (10), 5 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-07 15:13:23,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 59 transitions. [2022-04-07 15:13:23,027 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 59 transitions. Word has length 37 [2022-04-07 15:13:23,027 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 15:13:23,027 INFO L478 AbstractCegarLoop]: Abstraction has 49 states and 59 transitions. [2022-04-07 15:13:23,028 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.272727272727273) internal successors, (25), 10 states have internal predecessors, (25), 5 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2022-04-07 15:13:23,028 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 59 transitions. [2022-04-07 15:13:23,029 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-04-07 15:13:23,029 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 15:13:23,029 INFO L499 BasicCegarLoop]: trace histogram [3, 3, 3, 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] [2022-04-07 15:13:23,054 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-07 15:13:23,230 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 15:13:23,230 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 15:13:23,231 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 15:13:23,231 INFO L85 PathProgramCache]: Analyzing trace with hash -497884428, now seen corresponding path program 1 times [2022-04-07 15:13:23,231 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 15:13:23,231 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1601758424] [2022-04-07 15:13:23,231 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 15:13:23,231 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 15:13:23,255 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-07 15:13:23,255 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1008997544] [2022-04-07 15:13:23,256 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 15:13:23,256 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 15:13:23,256 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-07 15:13:23,262 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-07 15:13:23,263 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-07 15:13:23,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 15:13:23,319 INFO L263 TraceCheckSpWp]: Trace formula consists of 106 conjuncts, 28 conjunts are in the unsatisfiable core [2022-04-07 15:13:23,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 15:13:23,333 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-07 15:13:24,255 INFO L272 TraceCheckUtils]: 0: Hoare triple {1280#true} call ULTIMATE.init(); {1280#true} is VALID [2022-04-07 15:13:24,255 INFO L290 TraceCheckUtils]: 1: Hoare triple {1280#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(13, 2);call #Ultimate.allocInit(12, 3); {1280#true} is VALID [2022-04-07 15:13:24,255 INFO L290 TraceCheckUtils]: 2: Hoare triple {1280#true} assume true; {1280#true} is VALID [2022-04-07 15:13:24,256 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1280#true} {1280#true} #71#return; {1280#true} is VALID [2022-04-07 15:13:24,256 INFO L272 TraceCheckUtils]: 4: Hoare triple {1280#true} call #t~ret6 := main(); {1280#true} is VALID [2022-04-07 15:13:24,256 INFO L290 TraceCheckUtils]: 5: Hoare triple {1280#true} havoc ~a~0;havoc ~b~0;havoc ~x~0;havoc ~y~0;havoc ~z~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~a~0 := #t~nondet4;havoc #t~nondet4; {1280#true} is VALID [2022-04-07 15:13:24,256 INFO L272 TraceCheckUtils]: 6: Hoare triple {1280#true} call assume_abort_if_not((if ~a~0 >= 0 && ~a~0 <= 100 then 1 else 0)); {1280#true} is VALID [2022-04-07 15:13:24,256 INFO L290 TraceCheckUtils]: 7: Hoare triple {1280#true} ~cond := #in~cond; {1280#true} is VALID [2022-04-07 15:13:24,256 INFO L290 TraceCheckUtils]: 8: Hoare triple {1280#true} assume !(0 == ~cond); {1280#true} is VALID [2022-04-07 15:13:24,256 INFO L290 TraceCheckUtils]: 9: Hoare triple {1280#true} assume true; {1280#true} is VALID [2022-04-07 15:13:24,256 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1280#true} {1280#true} #61#return; {1280#true} is VALID [2022-04-07 15:13:24,256 INFO L290 TraceCheckUtils]: 11: Hoare triple {1280#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~b~0 := #t~nondet5;havoc #t~nondet5; {1280#true} is VALID [2022-04-07 15:13:24,257 INFO L272 TraceCheckUtils]: 12: Hoare triple {1280#true} call assume_abort_if_not((if ~b~0 >= 0 && ~b~0 <= 100 then 1 else 0)); {1280#true} is VALID [2022-04-07 15:13:24,257 INFO L290 TraceCheckUtils]: 13: Hoare triple {1280#true} ~cond := #in~cond; {1280#true} is VALID [2022-04-07 15:13:24,257 INFO L290 TraceCheckUtils]: 14: Hoare triple {1280#true} assume !(0 == ~cond); {1280#true} is VALID [2022-04-07 15:13:24,257 INFO L290 TraceCheckUtils]: 15: Hoare triple {1280#true} assume true; {1280#true} is VALID [2022-04-07 15:13:24,257 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {1280#true} {1280#true} #63#return; {1280#true} is VALID [2022-04-07 15:13:24,257 INFO L272 TraceCheckUtils]: 17: Hoare triple {1280#true} call assume_abort_if_not((if ~b~0 >= 1 then 1 else 0)); {1280#true} is VALID [2022-04-07 15:13:24,258 INFO L290 TraceCheckUtils]: 18: Hoare triple {1280#true} ~cond := #in~cond; {1339#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-04-07 15:13:24,262 INFO L290 TraceCheckUtils]: 19: Hoare triple {1339#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} assume !(0 == ~cond); {1343#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-07 15:13:24,262 INFO L290 TraceCheckUtils]: 20: Hoare triple {1343#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {1343#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-07 15:13:24,263 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {1343#(not (= |assume_abort_if_not_#in~cond| 0))} {1280#true} #65#return; {1350#(<= 1 main_~b~0)} is VALID [2022-04-07 15:13:24,263 INFO L290 TraceCheckUtils]: 22: Hoare triple {1350#(<= 1 main_~b~0)} ~x~0 := ~a~0;~y~0 := ~b~0;~z~0 := 0; {1354#(and (= main_~z~0 0) (= main_~b~0 main_~y~0) (<= 1 main_~b~0) (= main_~a~0 main_~x~0))} is VALID [2022-04-07 15:13:24,264 INFO L290 TraceCheckUtils]: 23: Hoare triple {1354#(and (= main_~z~0 0) (= main_~b~0 main_~y~0) (<= 1 main_~b~0) (= main_~a~0 main_~x~0))} assume !false; {1354#(and (= main_~z~0 0) (= main_~b~0 main_~y~0) (<= 1 main_~b~0) (= main_~a~0 main_~x~0))} is VALID [2022-04-07 15:13:24,264 INFO L272 TraceCheckUtils]: 24: Hoare triple {1354#(and (= main_~z~0 0) (= main_~b~0 main_~y~0) (<= 1 main_~b~0) (= main_~a~0 main_~x~0))} call __VERIFIER_assert((if ~z~0 + ~x~0 * ~y~0 == ~a~0 * ~b~0 then 1 else 0)); {1280#true} is VALID [2022-04-07 15:13:24,264 INFO L290 TraceCheckUtils]: 25: Hoare triple {1280#true} ~cond := #in~cond; {1364#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-07 15:13:24,264 INFO L290 TraceCheckUtils]: 26: Hoare triple {1364#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {1368#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-07 15:13:24,265 INFO L290 TraceCheckUtils]: 27: Hoare triple {1368#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {1368#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-07 15:13:24,265 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {1368#(not (= |__VERIFIER_assert_#in~cond| 0))} {1354#(and (= main_~z~0 0) (= main_~b~0 main_~y~0) (<= 1 main_~b~0) (= main_~a~0 main_~x~0))} #67#return; {1354#(and (= main_~z~0 0) (= main_~b~0 main_~y~0) (<= 1 main_~b~0) (= main_~a~0 main_~x~0))} is VALID [2022-04-07 15:13:24,266 INFO L290 TraceCheckUtils]: 29: Hoare triple {1354#(and (= main_~z~0 0) (= main_~b~0 main_~y~0) (<= 1 main_~b~0) (= main_~a~0 main_~x~0))} assume !!(0 != ~y~0); {1354#(and (= main_~z~0 0) (= main_~b~0 main_~y~0) (<= 1 main_~b~0) (= main_~a~0 main_~x~0))} is VALID [2022-04-07 15:13:24,267 INFO L290 TraceCheckUtils]: 30: Hoare triple {1354#(and (= main_~z~0 0) (= main_~b~0 main_~y~0) (<= 1 main_~b~0) (= main_~a~0 main_~x~0))} assume !(1 == (if ~y~0 < 0 && 0 != ~y~0 % 2 then ~y~0 % 2 - 2 else ~y~0 % 2)); {1381#(and (= main_~z~0 0) (not (= (mod main_~y~0 2) 1)) (= main_~b~0 main_~y~0) (<= 1 main_~b~0) (= main_~a~0 main_~x~0))} is VALID [2022-04-07 15:13:24,270 INFO L290 TraceCheckUtils]: 31: Hoare triple {1381#(and (= main_~z~0 0) (not (= (mod main_~y~0 2) 1)) (= main_~b~0 main_~y~0) (<= 1 main_~b~0) (= main_~a~0 main_~x~0))} ~x~0 := 2 * ~x~0;~y~0 := (if ~y~0 < 0 && 0 != ~y~0 % 2 then 1 + ~y~0 / 2 else ~y~0 / 2); {1385#(and (= main_~z~0 0) (= main_~y~0 (div main_~b~0 2)) (= (* main_~a~0 2) main_~x~0) (not (= (mod main_~b~0 2) 1)) (<= 1 main_~b~0))} is VALID [2022-04-07 15:13:24,270 INFO L290 TraceCheckUtils]: 32: Hoare triple {1385#(and (= main_~z~0 0) (= main_~y~0 (div main_~b~0 2)) (= (* main_~a~0 2) main_~x~0) (not (= (mod main_~b~0 2) 1)) (<= 1 main_~b~0))} assume !false; {1385#(and (= main_~z~0 0) (= main_~y~0 (div main_~b~0 2)) (= (* main_~a~0 2) main_~x~0) (not (= (mod main_~b~0 2) 1)) (<= 1 main_~b~0))} is VALID [2022-04-07 15:13:24,273 INFO L272 TraceCheckUtils]: 33: Hoare triple {1385#(and (= main_~z~0 0) (= main_~y~0 (div main_~b~0 2)) (= (* main_~a~0 2) main_~x~0) (not (= (mod main_~b~0 2) 1)) (<= 1 main_~b~0))} call __VERIFIER_assert((if ~z~0 + ~x~0 * ~y~0 == ~a~0 * ~b~0 then 1 else 0)); {1392#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-07 15:13:24,273 INFO L290 TraceCheckUtils]: 34: Hoare triple {1392#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1396#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-07 15:13:24,273 INFO L290 TraceCheckUtils]: 35: Hoare triple {1396#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1281#false} is VALID [2022-04-07 15:13:24,274 INFO L290 TraceCheckUtils]: 36: Hoare triple {1281#false} assume !false; {1281#false} is VALID [2022-04-07 15:13:24,274 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 7 proven. 3 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-04-07 15:13:24,274 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-07 15:13:57,479 INFO L290 TraceCheckUtils]: 36: Hoare triple {1281#false} assume !false; {1281#false} is VALID [2022-04-07 15:13:57,479 INFO L290 TraceCheckUtils]: 35: Hoare triple {1396#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1281#false} is VALID [2022-04-07 15:13:57,480 INFO L290 TraceCheckUtils]: 34: Hoare triple {1392#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1396#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-07 15:13:57,481 INFO L272 TraceCheckUtils]: 33: Hoare triple {1412#(= (+ main_~z~0 (* main_~y~0 main_~x~0)) (* main_~b~0 main_~a~0))} call __VERIFIER_assert((if ~z~0 + ~x~0 * ~y~0 == ~a~0 * ~b~0 then 1 else 0)); {1392#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-07 15:13:57,481 INFO L290 TraceCheckUtils]: 32: Hoare triple {1412#(= (+ main_~z~0 (* main_~y~0 main_~x~0)) (* main_~b~0 main_~a~0))} assume !false; {1412#(= (+ main_~z~0 (* main_~y~0 main_~x~0)) (* main_~b~0 main_~a~0))} is VALID [2022-04-07 15:13:57,487 INFO L290 TraceCheckUtils]: 31: Hoare triple {1419#(and (or (not (< main_~y~0 0)) (= (mod main_~y~0 2) 0) (= (+ main_~z~0 (* (* main_~x~0 2) (+ (div main_~y~0 2) 1))) (* main_~b~0 main_~a~0))) (or (= (+ main_~z~0 (* (* main_~x~0 2) (div main_~y~0 2))) (* main_~b~0 main_~a~0)) (and (not (= (mod main_~y~0 2) 0)) (< main_~y~0 0))))} ~x~0 := 2 * ~x~0;~y~0 := (if ~y~0 < 0 && 0 != ~y~0 % 2 then 1 + ~y~0 / 2 else ~y~0 / 2); {1412#(= (+ main_~z~0 (* main_~y~0 main_~x~0)) (* main_~b~0 main_~a~0))} is VALID [2022-04-07 15:13:57,488 INFO L290 TraceCheckUtils]: 30: Hoare triple {1423#(or (and (<= 0 main_~y~0) (= (mod main_~y~0 2) 1)) (and (or (= (mod main_~y~0 2) 0) (= (+ main_~z~0 (* (* main_~x~0 2) (+ (div main_~y~0 2) 1))) (* main_~b~0 main_~a~0))) (or (= (+ main_~z~0 (* (* main_~x~0 2) (div main_~y~0 2))) (* main_~b~0 main_~a~0)) (not (= (mod main_~y~0 2) 0)))))} assume !(1 == (if ~y~0 < 0 && 0 != ~y~0 % 2 then ~y~0 % 2 - 2 else ~y~0 % 2)); {1419#(and (or (not (< main_~y~0 0)) (= (mod main_~y~0 2) 0) (= (+ main_~z~0 (* (* main_~x~0 2) (+ (div main_~y~0 2) 1))) (* main_~b~0 main_~a~0))) (or (= (+ main_~z~0 (* (* main_~x~0 2) (div main_~y~0 2))) (* main_~b~0 main_~a~0)) (and (not (= (mod main_~y~0 2) 0)) (< main_~y~0 0))))} is VALID [2022-04-07 15:13:57,489 INFO L290 TraceCheckUtils]: 29: Hoare triple {1423#(or (and (<= 0 main_~y~0) (= (mod main_~y~0 2) 1)) (and (or (= (mod main_~y~0 2) 0) (= (+ main_~z~0 (* (* main_~x~0 2) (+ (div main_~y~0 2) 1))) (* main_~b~0 main_~a~0))) (or (= (+ main_~z~0 (* (* main_~x~0 2) (div main_~y~0 2))) (* main_~b~0 main_~a~0)) (not (= (mod main_~y~0 2) 0)))))} assume !!(0 != ~y~0); {1423#(or (and (<= 0 main_~y~0) (= (mod main_~y~0 2) 1)) (and (or (= (mod main_~y~0 2) 0) (= (+ main_~z~0 (* (* main_~x~0 2) (+ (div main_~y~0 2) 1))) (* main_~b~0 main_~a~0))) (or (= (+ main_~z~0 (* (* main_~x~0 2) (div main_~y~0 2))) (* main_~b~0 main_~a~0)) (not (= (mod main_~y~0 2) 0)))))} is VALID [2022-04-07 15:13:57,492 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {1368#(not (= |__VERIFIER_assert_#in~cond| 0))} {1430#(or (<= 0 main_~y~0) (not (= (+ main_~z~0 (* main_~y~0 main_~x~0)) (* main_~b~0 main_~a~0))) (= (mod main_~y~0 2) 0) (= (+ main_~z~0 (* (* main_~x~0 2) (+ (div main_~y~0 2) 1))) (* main_~b~0 main_~a~0)))} #67#return; {1423#(or (and (<= 0 main_~y~0) (= (mod main_~y~0 2) 1)) (and (or (= (mod main_~y~0 2) 0) (= (+ main_~z~0 (* (* main_~x~0 2) (+ (div main_~y~0 2) 1))) (* main_~b~0 main_~a~0))) (or (= (+ main_~z~0 (* (* main_~x~0 2) (div main_~y~0 2))) (* main_~b~0 main_~a~0)) (not (= (mod main_~y~0 2) 0)))))} is VALID [2022-04-07 15:13:57,492 INFO L290 TraceCheckUtils]: 27: Hoare triple {1368#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {1368#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-07 15:13:57,493 INFO L290 TraceCheckUtils]: 26: Hoare triple {1440#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} assume !(0 == ~cond); {1368#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-07 15:13:57,493 INFO L290 TraceCheckUtils]: 25: Hoare triple {1280#true} ~cond := #in~cond; {1440#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-07 15:13:57,493 INFO L272 TraceCheckUtils]: 24: Hoare triple {1430#(or (<= 0 main_~y~0) (not (= (+ main_~z~0 (* main_~y~0 main_~x~0)) (* main_~b~0 main_~a~0))) (= (mod main_~y~0 2) 0) (= (+ main_~z~0 (* (* main_~x~0 2) (+ (div main_~y~0 2) 1))) (* main_~b~0 main_~a~0)))} call __VERIFIER_assert((if ~z~0 + ~x~0 * ~y~0 == ~a~0 * ~b~0 then 1 else 0)); {1280#true} is VALID [2022-04-07 15:13:57,494 INFO L290 TraceCheckUtils]: 23: Hoare triple {1430#(or (<= 0 main_~y~0) (not (= (+ main_~z~0 (* main_~y~0 main_~x~0)) (* main_~b~0 main_~a~0))) (= (mod main_~y~0 2) 0) (= (+ main_~z~0 (* (* main_~x~0 2) (+ (div main_~y~0 2) 1))) (* main_~b~0 main_~a~0)))} assume !false; {1430#(or (<= 0 main_~y~0) (not (= (+ main_~z~0 (* main_~y~0 main_~x~0)) (* main_~b~0 main_~a~0))) (= (mod main_~y~0 2) 0) (= (+ main_~z~0 (* (* main_~x~0 2) (+ (div main_~y~0 2) 1))) (* main_~b~0 main_~a~0)))} is VALID [2022-04-07 15:13:57,495 INFO L290 TraceCheckUtils]: 22: Hoare triple {1450#(or (= (* main_~b~0 main_~a~0) (* (* main_~a~0 2) (+ (div main_~b~0 2) 1))) (= (mod main_~b~0 2) 0) (<= 0 main_~b~0))} ~x~0 := ~a~0;~y~0 := ~b~0;~z~0 := 0; {1430#(or (<= 0 main_~y~0) (not (= (+ main_~z~0 (* main_~y~0 main_~x~0)) (* main_~b~0 main_~a~0))) (= (mod main_~y~0 2) 0) (= (+ main_~z~0 (* (* main_~x~0 2) (+ (div main_~y~0 2) 1))) (* main_~b~0 main_~a~0)))} is VALID [2022-04-07 15:13:57,496 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {1343#(not (= |assume_abort_if_not_#in~cond| 0))} {1280#true} #65#return; {1450#(or (= (* main_~b~0 main_~a~0) (* (* main_~a~0 2) (+ (div main_~b~0 2) 1))) (= (mod main_~b~0 2) 0) (<= 0 main_~b~0))} is VALID [2022-04-07 15:13:57,496 INFO L290 TraceCheckUtils]: 20: Hoare triple {1343#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {1343#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-07 15:13:57,496 INFO L290 TraceCheckUtils]: 19: Hoare triple {1463#(or (not (= |assume_abort_if_not_#in~cond| 0)) (= assume_abort_if_not_~cond 0))} assume !(0 == ~cond); {1343#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-07 15:13:57,497 INFO L290 TraceCheckUtils]: 18: Hoare triple {1280#true} ~cond := #in~cond; {1463#(or (not (= |assume_abort_if_not_#in~cond| 0)) (= assume_abort_if_not_~cond 0))} is VALID [2022-04-07 15:13:57,497 INFO L272 TraceCheckUtils]: 17: Hoare triple {1280#true} call assume_abort_if_not((if ~b~0 >= 1 then 1 else 0)); {1280#true} is VALID [2022-04-07 15:13:57,497 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {1280#true} {1280#true} #63#return; {1280#true} is VALID [2022-04-07 15:13:57,497 INFO L290 TraceCheckUtils]: 15: Hoare triple {1280#true} assume true; {1280#true} is VALID [2022-04-07 15:13:57,497 INFO L290 TraceCheckUtils]: 14: Hoare triple {1280#true} assume !(0 == ~cond); {1280#true} is VALID [2022-04-07 15:13:57,497 INFO L290 TraceCheckUtils]: 13: Hoare triple {1280#true} ~cond := #in~cond; {1280#true} is VALID [2022-04-07 15:13:57,497 INFO L272 TraceCheckUtils]: 12: Hoare triple {1280#true} call assume_abort_if_not((if ~b~0 >= 0 && ~b~0 <= 100 then 1 else 0)); {1280#true} is VALID [2022-04-07 15:13:57,498 INFO L290 TraceCheckUtils]: 11: Hoare triple {1280#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~b~0 := #t~nondet5;havoc #t~nondet5; {1280#true} is VALID [2022-04-07 15:13:57,498 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1280#true} {1280#true} #61#return; {1280#true} is VALID [2022-04-07 15:13:57,498 INFO L290 TraceCheckUtils]: 9: Hoare triple {1280#true} assume true; {1280#true} is VALID [2022-04-07 15:13:57,498 INFO L290 TraceCheckUtils]: 8: Hoare triple {1280#true} assume !(0 == ~cond); {1280#true} is VALID [2022-04-07 15:13:57,498 INFO L290 TraceCheckUtils]: 7: Hoare triple {1280#true} ~cond := #in~cond; {1280#true} is VALID [2022-04-07 15:13:57,498 INFO L272 TraceCheckUtils]: 6: Hoare triple {1280#true} call assume_abort_if_not((if ~a~0 >= 0 && ~a~0 <= 100 then 1 else 0)); {1280#true} is VALID [2022-04-07 15:13:57,498 INFO L290 TraceCheckUtils]: 5: Hoare triple {1280#true} havoc ~a~0;havoc ~b~0;havoc ~x~0;havoc ~y~0;havoc ~z~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~a~0 := #t~nondet4;havoc #t~nondet4; {1280#true} is VALID [2022-04-07 15:13:57,498 INFO L272 TraceCheckUtils]: 4: Hoare triple {1280#true} call #t~ret6 := main(); {1280#true} is VALID [2022-04-07 15:13:57,498 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1280#true} {1280#true} #71#return; {1280#true} is VALID [2022-04-07 15:13:57,499 INFO L290 TraceCheckUtils]: 2: Hoare triple {1280#true} assume true; {1280#true} is VALID [2022-04-07 15:13:57,499 INFO L290 TraceCheckUtils]: 1: Hoare triple {1280#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(13, 2);call #Ultimate.allocInit(12, 3); {1280#true} is VALID [2022-04-07 15:13:57,499 INFO L272 TraceCheckUtils]: 0: Hoare triple {1280#true} call ULTIMATE.init(); {1280#true} is VALID [2022-04-07 15:13:57,499 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 7 proven. 3 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-04-07 15:13:57,499 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 15:13:57,499 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1601758424] [2022-04-07 15:13:57,499 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-07 15:13:57,500 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1008997544] [2022-04-07 15:13:57,500 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1008997544] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-07 15:13:57,500 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-07 15:13:57,500 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 13] total 19 [2022-04-07 15:13:57,500 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [973327810] [2022-04-07 15:13:57,500 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-07 15:13:57,501 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 1.6842105263157894) internal successors, (32), 16 states have internal predecessors, (32), 5 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (7), 5 states have call predecessors, (7), 3 states have call successors, (7) Word has length 37 [2022-04-07 15:13:57,501 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 15:13:57,501 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 19 states, 19 states have (on average 1.6842105263157894) internal successors, (32), 16 states have internal predecessors, (32), 5 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (7), 5 states have call predecessors, (7), 3 states have call successors, (7) [2022-04-07 15:13:57,549 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 48 edges. 48 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 15:13:57,550 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-04-07 15:13:57,550 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 15:13:57,550 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-04-07 15:13:57,550 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=280, Unknown=0, NotChecked=0, Total=342 [2022-04-07 15:13:57,551 INFO L87 Difference]: Start difference. First operand 49 states and 59 transitions. Second operand has 19 states, 19 states have (on average 1.6842105263157894) internal successors, (32), 16 states have internal predecessors, (32), 5 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (7), 5 states have call predecessors, (7), 3 states have call successors, (7) [2022-04-07 15:14:00,127 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 15:14:00,128 INFO L93 Difference]: Finished difference Result 80 states and 96 transitions. [2022-04-07 15:14:00,128 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-04-07 15:14:00,128 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 1.6842105263157894) internal successors, (32), 16 states have internal predecessors, (32), 5 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (7), 5 states have call predecessors, (7), 3 states have call successors, (7) Word has length 37 [2022-04-07 15:14:00,128 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 15:14:00,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 19 states have (on average 1.6842105263157894) internal successors, (32), 16 states have internal predecessors, (32), 5 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (7), 5 states have call predecessors, (7), 3 states have call successors, (7) [2022-04-07 15:14:00,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 67 transitions. [2022-04-07 15:14:00,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 19 states have (on average 1.6842105263157894) internal successors, (32), 16 states have internal predecessors, (32), 5 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (7), 5 states have call predecessors, (7), 3 states have call successors, (7) [2022-04-07 15:14:00,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 67 transitions. [2022-04-07 15:14:00,133 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 17 states and 67 transitions. [2022-04-07 15:14:00,210 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-07 15:14:00,212 INFO L225 Difference]: With dead ends: 80 [2022-04-07 15:14:00,212 INFO L226 Difference]: Without dead ends: 73 [2022-04-07 15:14:00,213 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 54 SyntacticMatches, 2 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 102 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=122, Invalid=528, Unknown=0, NotChecked=0, Total=650 [2022-04-07 15:14:00,213 INFO L913 BasicCegarLoop]: 19 mSDtfsCounter, 48 mSDsluCounter, 118 mSDsCounter, 0 mSdLazyCounter, 283 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 137 SdHoareTripleChecker+Invalid, 319 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 283 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-04-07 15:14:00,214 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [50 Valid, 137 Invalid, 319 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 283 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2022-04-07 15:14:00,214 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2022-04-07 15:14:00,240 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 73. [2022-04-07 15:14:00,240 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 15:14:00,241 INFO L82 GeneralOperation]: Start isEquivalent. First operand 73 states. Second operand has 73 states, 51 states have (on average 1.2156862745098038) internal successors, (62), 54 states have internal predecessors, (62), 14 states have call successors, (14), 8 states have call predecessors, (14), 7 states have return successors, (12), 10 states have call predecessors, (12), 12 states have call successors, (12) [2022-04-07 15:14:00,241 INFO L74 IsIncluded]: Start isIncluded. First operand 73 states. Second operand has 73 states, 51 states have (on average 1.2156862745098038) internal successors, (62), 54 states have internal predecessors, (62), 14 states have call successors, (14), 8 states have call predecessors, (14), 7 states have return successors, (12), 10 states have call predecessors, (12), 12 states have call successors, (12) [2022-04-07 15:14:00,241 INFO L87 Difference]: Start difference. First operand 73 states. Second operand has 73 states, 51 states have (on average 1.2156862745098038) internal successors, (62), 54 states have internal predecessors, (62), 14 states have call successors, (14), 8 states have call predecessors, (14), 7 states have return successors, (12), 10 states have call predecessors, (12), 12 states have call successors, (12) [2022-04-07 15:14:00,244 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 15:14:00,244 INFO L93 Difference]: Finished difference Result 73 states and 88 transitions. [2022-04-07 15:14:00,244 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 88 transitions. [2022-04-07 15:14:00,245 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 15:14:00,245 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 15:14:00,245 INFO L74 IsIncluded]: Start isIncluded. First operand has 73 states, 51 states have (on average 1.2156862745098038) internal successors, (62), 54 states have internal predecessors, (62), 14 states have call successors, (14), 8 states have call predecessors, (14), 7 states have return successors, (12), 10 states have call predecessors, (12), 12 states have call successors, (12) Second operand 73 states. [2022-04-07 15:14:00,245 INFO L87 Difference]: Start difference. First operand has 73 states, 51 states have (on average 1.2156862745098038) internal successors, (62), 54 states have internal predecessors, (62), 14 states have call successors, (14), 8 states have call predecessors, (14), 7 states have return successors, (12), 10 states have call predecessors, (12), 12 states have call successors, (12) Second operand 73 states. [2022-04-07 15:14:00,248 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 15:14:00,248 INFO L93 Difference]: Finished difference Result 73 states and 88 transitions. [2022-04-07 15:14:00,248 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 88 transitions. [2022-04-07 15:14:00,248 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 15:14:00,248 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 15:14:00,248 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 15:14:00,248 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 15:14:00,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 51 states have (on average 1.2156862745098038) internal successors, (62), 54 states have internal predecessors, (62), 14 states have call successors, (14), 8 states have call predecessors, (14), 7 states have return successors, (12), 10 states have call predecessors, (12), 12 states have call successors, (12) [2022-04-07 15:14:00,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 88 transitions. [2022-04-07 15:14:00,251 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 88 transitions. Word has length 37 [2022-04-07 15:14:00,251 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 15:14:00,251 INFO L478 AbstractCegarLoop]: Abstraction has 73 states and 88 transitions. [2022-04-07 15:14:00,252 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 1.6842105263157894) internal successors, (32), 16 states have internal predecessors, (32), 5 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (7), 5 states have call predecessors, (7), 3 states have call successors, (7) [2022-04-07 15:14:00,252 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 88 transitions. [2022-04-07 15:14:00,252 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2022-04-07 15:14:00,252 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 15:14:00,252 INFO L499 BasicCegarLoop]: trace histogram [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] [2022-04-07 15:14:00,273 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2022-04-07 15:14:00,468 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 15:14:00,468 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 15:14:00,469 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 15:14:00,469 INFO L85 PathProgramCache]: Analyzing trace with hash -1351630086, now seen corresponding path program 1 times [2022-04-07 15:14:00,469 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 15:14:00,469 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [530553807] [2022-04-07 15:14:00,469 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 15:14:00,469 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 15:14:00,485 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-07 15:14:00,485 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [418407065] [2022-04-07 15:14:00,485 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 15:14:00,485 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 15:14:00,485 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-07 15:14:00,486 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-07 15:14:00,490 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-07 15:14:00,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 15:14:00,526 INFO L263 TraceCheckSpWp]: Trace formula consists of 122 conjuncts, 10 conjunts are in the unsatisfiable core [2022-04-07 15:14:00,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 15:14:00,541 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-07 15:14:06,800 INFO L272 TraceCheckUtils]: 0: Hoare triple {1895#true} call ULTIMATE.init(); {1895#true} is VALID [2022-04-07 15:14:06,801 INFO L290 TraceCheckUtils]: 1: Hoare triple {1895#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(13, 2);call #Ultimate.allocInit(12, 3); {1895#true} is VALID [2022-04-07 15:14:06,801 INFO L290 TraceCheckUtils]: 2: Hoare triple {1895#true} assume true; {1895#true} is VALID [2022-04-07 15:14:06,801 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1895#true} {1895#true} #71#return; {1895#true} is VALID [2022-04-07 15:14:06,801 INFO L272 TraceCheckUtils]: 4: Hoare triple {1895#true} call #t~ret6 := main(); {1895#true} is VALID [2022-04-07 15:14:06,801 INFO L290 TraceCheckUtils]: 5: Hoare triple {1895#true} havoc ~a~0;havoc ~b~0;havoc ~x~0;havoc ~y~0;havoc ~z~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~a~0 := #t~nondet4;havoc #t~nondet4; {1895#true} is VALID [2022-04-07 15:14:06,801 INFO L272 TraceCheckUtils]: 6: Hoare triple {1895#true} call assume_abort_if_not((if ~a~0 >= 0 && ~a~0 <= 100 then 1 else 0)); {1895#true} is VALID [2022-04-07 15:14:06,801 INFO L290 TraceCheckUtils]: 7: Hoare triple {1895#true} ~cond := #in~cond; {1895#true} is VALID [2022-04-07 15:14:06,801 INFO L290 TraceCheckUtils]: 8: Hoare triple {1895#true} assume !(0 == ~cond); {1895#true} is VALID [2022-04-07 15:14:06,801 INFO L290 TraceCheckUtils]: 9: Hoare triple {1895#true} assume true; {1895#true} is VALID [2022-04-07 15:14:06,802 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1895#true} {1895#true} #61#return; {1895#true} is VALID [2022-04-07 15:14:06,802 INFO L290 TraceCheckUtils]: 11: Hoare triple {1895#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~b~0 := #t~nondet5;havoc #t~nondet5; {1895#true} is VALID [2022-04-07 15:14:06,802 INFO L272 TraceCheckUtils]: 12: Hoare triple {1895#true} call assume_abort_if_not((if ~b~0 >= 0 && ~b~0 <= 100 then 1 else 0)); {1895#true} is VALID [2022-04-07 15:14:06,802 INFO L290 TraceCheckUtils]: 13: Hoare triple {1895#true} ~cond := #in~cond; {1895#true} is VALID [2022-04-07 15:14:06,802 INFO L290 TraceCheckUtils]: 14: Hoare triple {1895#true} assume !(0 == ~cond); {1895#true} is VALID [2022-04-07 15:14:06,802 INFO L290 TraceCheckUtils]: 15: Hoare triple {1895#true} assume true; {1895#true} is VALID [2022-04-07 15:14:06,802 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {1895#true} {1895#true} #63#return; {1895#true} is VALID [2022-04-07 15:14:06,802 INFO L272 TraceCheckUtils]: 17: Hoare triple {1895#true} call assume_abort_if_not((if ~b~0 >= 1 then 1 else 0)); {1895#true} is VALID [2022-04-07 15:14:06,802 INFO L290 TraceCheckUtils]: 18: Hoare triple {1895#true} ~cond := #in~cond; {1895#true} is VALID [2022-04-07 15:14:06,802 INFO L290 TraceCheckUtils]: 19: Hoare triple {1895#true} assume !(0 == ~cond); {1895#true} is VALID [2022-04-07 15:14:06,802 INFO L290 TraceCheckUtils]: 20: Hoare triple {1895#true} assume true; {1895#true} is VALID [2022-04-07 15:14:06,803 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {1895#true} {1895#true} #65#return; {1895#true} is VALID [2022-04-07 15:14:06,803 INFO L290 TraceCheckUtils]: 22: Hoare triple {1895#true} ~x~0 := ~a~0;~y~0 := ~b~0;~z~0 := 0; {1895#true} is VALID [2022-04-07 15:14:06,803 INFO L290 TraceCheckUtils]: 23: Hoare triple {1895#true} assume !false; {1895#true} is VALID [2022-04-07 15:14:06,803 INFO L272 TraceCheckUtils]: 24: Hoare triple {1895#true} call __VERIFIER_assert((if ~z~0 + ~x~0 * ~y~0 == ~a~0 * ~b~0 then 1 else 0)); {1895#true} is VALID [2022-04-07 15:14:06,803 INFO L290 TraceCheckUtils]: 25: Hoare triple {1895#true} ~cond := #in~cond; {1895#true} is VALID [2022-04-07 15:14:06,803 INFO L290 TraceCheckUtils]: 26: Hoare triple {1895#true} assume !(0 == ~cond); {1895#true} is VALID [2022-04-07 15:14:06,803 INFO L290 TraceCheckUtils]: 27: Hoare triple {1895#true} assume true; {1895#true} is VALID [2022-04-07 15:14:06,803 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {1895#true} {1895#true} #67#return; {1895#true} is VALID [2022-04-07 15:14:06,803 INFO L290 TraceCheckUtils]: 29: Hoare triple {1895#true} assume !!(0 != ~y~0); {1895#true} is VALID [2022-04-07 15:14:06,803 INFO L290 TraceCheckUtils]: 30: Hoare triple {1895#true} assume 1 == (if ~y~0 < 0 && 0 != ~y~0 % 2 then ~y~0 % 2 - 2 else ~y~0 % 2);~z~0 := ~z~0 + ~x~0;~y~0 := ~y~0 - 1; {1895#true} is VALID [2022-04-07 15:14:06,803 INFO L290 TraceCheckUtils]: 31: Hoare triple {1895#true} ~x~0 := 2 * ~x~0;~y~0 := (if ~y~0 < 0 && 0 != ~y~0 % 2 then 1 + ~y~0 / 2 else ~y~0 / 2); {1895#true} is VALID [2022-04-07 15:14:06,804 INFO L290 TraceCheckUtils]: 32: Hoare triple {1895#true} assume !false; {1895#true} is VALID [2022-04-07 15:14:06,804 INFO L272 TraceCheckUtils]: 33: Hoare triple {1895#true} call __VERIFIER_assert((if ~z~0 + ~x~0 * ~y~0 == ~a~0 * ~b~0 then 1 else 0)); {1895#true} is VALID [2022-04-07 15:14:06,804 INFO L290 TraceCheckUtils]: 34: Hoare triple {1895#true} ~cond := #in~cond; {2002#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-07 15:14:06,804 INFO L290 TraceCheckUtils]: 35: Hoare triple {2002#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {2006#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-07 15:14:06,805 INFO L290 TraceCheckUtils]: 36: Hoare triple {2006#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {2006#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-07 15:14:08,807 WARN L284 TraceCheckUtils]: 37: Hoare quadruple {2006#(not (= |__VERIFIER_assert_#in~cond| 0))} {1895#true} #67#return; {2013#(or (and (not (= main_~y~0 0)) (= (mod (+ (* (- 1) main_~z~0) (* main_~b~0 main_~a~0)) main_~y~0) 0)) (= (+ (* (- 1) main_~z~0) (* main_~b~0 main_~a~0)) 0))} is UNKNOWN [2022-04-07 15:14:08,808 INFO L290 TraceCheckUtils]: 38: Hoare triple {2013#(or (and (not (= main_~y~0 0)) (= (mod (+ (* (- 1) main_~z~0) (* main_~b~0 main_~a~0)) main_~y~0) 0)) (= (+ (* (- 1) main_~z~0) (* main_~b~0 main_~a~0)) 0))} assume !(0 != ~y~0); {2017#(= main_~z~0 (* main_~b~0 main_~a~0))} is VALID [2022-04-07 15:14:08,808 INFO L272 TraceCheckUtils]: 39: Hoare triple {2017#(= main_~z~0 (* main_~b~0 main_~a~0))} call __VERIFIER_assert((if ~z~0 == ~a~0 * ~b~0 then 1 else 0)); {2021#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-07 15:14:08,809 INFO L290 TraceCheckUtils]: 40: Hoare triple {2021#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {2025#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-07 15:14:08,809 INFO L290 TraceCheckUtils]: 41: Hoare triple {2025#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1896#false} is VALID [2022-04-07 15:14:08,809 INFO L290 TraceCheckUtils]: 42: Hoare triple {1896#false} assume !false; {1896#false} is VALID [2022-04-07 15:14:08,810 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-04-07 15:14:08,810 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-07 15:14:20,261 INFO L290 TraceCheckUtils]: 42: Hoare triple {1896#false} assume !false; {1896#false} is VALID [2022-04-07 15:14:20,262 INFO L290 TraceCheckUtils]: 41: Hoare triple {2025#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1896#false} is VALID [2022-04-07 15:14:20,263 INFO L290 TraceCheckUtils]: 40: Hoare triple {2021#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {2025#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-07 15:14:20,263 INFO L272 TraceCheckUtils]: 39: Hoare triple {2017#(= main_~z~0 (* main_~b~0 main_~a~0))} call __VERIFIER_assert((if ~z~0 == ~a~0 * ~b~0 then 1 else 0)); {2021#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-07 15:14:20,264 INFO L290 TraceCheckUtils]: 38: Hoare triple {2044#(or (not (= main_~y~0 0)) (= main_~z~0 (* main_~b~0 main_~a~0)))} assume !(0 != ~y~0); {2017#(= main_~z~0 (* main_~b~0 main_~a~0))} is VALID [2022-04-07 15:14:20,265 INFO L284 TraceCheckUtils]: 37: Hoare quadruple {2006#(not (= |__VERIFIER_assert_#in~cond| 0))} {1895#true} #67#return; {2044#(or (not (= main_~y~0 0)) (= main_~z~0 (* main_~b~0 main_~a~0)))} is VALID [2022-04-07 15:14:20,265 INFO L290 TraceCheckUtils]: 36: Hoare triple {2006#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {2006#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-07 15:14:20,265 INFO L290 TraceCheckUtils]: 35: Hoare triple {2057#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} assume !(0 == ~cond); {2006#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-07 15:14:20,266 INFO L290 TraceCheckUtils]: 34: Hoare triple {1895#true} ~cond := #in~cond; {2057#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-07 15:14:20,266 INFO L272 TraceCheckUtils]: 33: Hoare triple {1895#true} call __VERIFIER_assert((if ~z~0 + ~x~0 * ~y~0 == ~a~0 * ~b~0 then 1 else 0)); {1895#true} is VALID [2022-04-07 15:14:20,266 INFO L290 TraceCheckUtils]: 32: Hoare triple {1895#true} assume !false; {1895#true} is VALID [2022-04-07 15:14:20,266 INFO L290 TraceCheckUtils]: 31: Hoare triple {1895#true} ~x~0 := 2 * ~x~0;~y~0 := (if ~y~0 < 0 && 0 != ~y~0 % 2 then 1 + ~y~0 / 2 else ~y~0 / 2); {1895#true} is VALID [2022-04-07 15:14:20,266 INFO L290 TraceCheckUtils]: 30: Hoare triple {1895#true} assume 1 == (if ~y~0 < 0 && 0 != ~y~0 % 2 then ~y~0 % 2 - 2 else ~y~0 % 2);~z~0 := ~z~0 + ~x~0;~y~0 := ~y~0 - 1; {1895#true} is VALID [2022-04-07 15:14:20,266 INFO L290 TraceCheckUtils]: 29: Hoare triple {1895#true} assume !!(0 != ~y~0); {1895#true} is VALID [2022-04-07 15:14:20,266 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {1895#true} {1895#true} #67#return; {1895#true} is VALID [2022-04-07 15:14:20,267 INFO L290 TraceCheckUtils]: 27: Hoare triple {1895#true} assume true; {1895#true} is VALID [2022-04-07 15:14:20,267 INFO L290 TraceCheckUtils]: 26: Hoare triple {1895#true} assume !(0 == ~cond); {1895#true} is VALID [2022-04-07 15:14:20,267 INFO L290 TraceCheckUtils]: 25: Hoare triple {1895#true} ~cond := #in~cond; {1895#true} is VALID [2022-04-07 15:14:20,267 INFO L272 TraceCheckUtils]: 24: Hoare triple {1895#true} call __VERIFIER_assert((if ~z~0 + ~x~0 * ~y~0 == ~a~0 * ~b~0 then 1 else 0)); {1895#true} is VALID [2022-04-07 15:14:20,267 INFO L290 TraceCheckUtils]: 23: Hoare triple {1895#true} assume !false; {1895#true} is VALID [2022-04-07 15:14:20,267 INFO L290 TraceCheckUtils]: 22: Hoare triple {1895#true} ~x~0 := ~a~0;~y~0 := ~b~0;~z~0 := 0; {1895#true} is VALID [2022-04-07 15:14:20,267 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {1895#true} {1895#true} #65#return; {1895#true} is VALID [2022-04-07 15:14:20,267 INFO L290 TraceCheckUtils]: 20: Hoare triple {1895#true} assume true; {1895#true} is VALID [2022-04-07 15:14:20,267 INFO L290 TraceCheckUtils]: 19: Hoare triple {1895#true} assume !(0 == ~cond); {1895#true} is VALID [2022-04-07 15:14:20,267 INFO L290 TraceCheckUtils]: 18: Hoare triple {1895#true} ~cond := #in~cond; {1895#true} is VALID [2022-04-07 15:14:20,267 INFO L272 TraceCheckUtils]: 17: Hoare triple {1895#true} call assume_abort_if_not((if ~b~0 >= 1 then 1 else 0)); {1895#true} is VALID [2022-04-07 15:14:20,268 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {1895#true} {1895#true} #63#return; {1895#true} is VALID [2022-04-07 15:14:20,268 INFO L290 TraceCheckUtils]: 15: Hoare triple {1895#true} assume true; {1895#true} is VALID [2022-04-07 15:14:20,268 INFO L290 TraceCheckUtils]: 14: Hoare triple {1895#true} assume !(0 == ~cond); {1895#true} is VALID [2022-04-07 15:14:20,268 INFO L290 TraceCheckUtils]: 13: Hoare triple {1895#true} ~cond := #in~cond; {1895#true} is VALID [2022-04-07 15:14:20,268 INFO L272 TraceCheckUtils]: 12: Hoare triple {1895#true} call assume_abort_if_not((if ~b~0 >= 0 && ~b~0 <= 100 then 1 else 0)); {1895#true} is VALID [2022-04-07 15:14:20,268 INFO L290 TraceCheckUtils]: 11: Hoare triple {1895#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~b~0 := #t~nondet5;havoc #t~nondet5; {1895#true} is VALID [2022-04-07 15:14:20,268 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1895#true} {1895#true} #61#return; {1895#true} is VALID [2022-04-07 15:14:20,268 INFO L290 TraceCheckUtils]: 9: Hoare triple {1895#true} assume true; {1895#true} is VALID [2022-04-07 15:14:20,268 INFO L290 TraceCheckUtils]: 8: Hoare triple {1895#true} assume !(0 == ~cond); {1895#true} is VALID [2022-04-07 15:14:20,268 INFO L290 TraceCheckUtils]: 7: Hoare triple {1895#true} ~cond := #in~cond; {1895#true} is VALID [2022-04-07 15:14:20,268 INFO L272 TraceCheckUtils]: 6: Hoare triple {1895#true} call assume_abort_if_not((if ~a~0 >= 0 && ~a~0 <= 100 then 1 else 0)); {1895#true} is VALID [2022-04-07 15:14:20,268 INFO L290 TraceCheckUtils]: 5: Hoare triple {1895#true} havoc ~a~0;havoc ~b~0;havoc ~x~0;havoc ~y~0;havoc ~z~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~a~0 := #t~nondet4;havoc #t~nondet4; {1895#true} is VALID [2022-04-07 15:14:20,269 INFO L272 TraceCheckUtils]: 4: Hoare triple {1895#true} call #t~ret6 := main(); {1895#true} is VALID [2022-04-07 15:14:20,269 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1895#true} {1895#true} #71#return; {1895#true} is VALID [2022-04-07 15:14:20,269 INFO L290 TraceCheckUtils]: 2: Hoare triple {1895#true} assume true; {1895#true} is VALID [2022-04-07 15:14:20,269 INFO L290 TraceCheckUtils]: 1: Hoare triple {1895#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(13, 2);call #Ultimate.allocInit(12, 3); {1895#true} is VALID [2022-04-07 15:14:20,269 INFO L272 TraceCheckUtils]: 0: Hoare triple {1895#true} call ULTIMATE.init(); {1895#true} is VALID [2022-04-07 15:14:20,269 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-04-07 15:14:20,269 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 15:14:20,269 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [530553807] [2022-04-07 15:14:20,269 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-07 15:14:20,270 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [418407065] [2022-04-07 15:14:20,270 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [418407065] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-07 15:14:20,270 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-07 15:14:20,270 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 10 [2022-04-07 15:14:20,270 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1002787607] [2022-04-07 15:14:20,270 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-07 15:14:20,270 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 2.7777777777777777) internal successors, (25), 7 states have internal predecessors, (25), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 3 states have call predecessors, (7), 1 states have call successors, (7) Word has length 43 [2022-04-07 15:14:20,271 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 15:14:20,271 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 10 states, 9 states have (on average 2.7777777777777777) internal successors, (25), 7 states have internal predecessors, (25), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 3 states have call predecessors, (7), 1 states have call successors, (7) [2022-04-07 15:14:22,303 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 39 edges. 38 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-07 15:14:22,303 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-04-07 15:14:22,303 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 15:14:22,303 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-04-07 15:14:22,303 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2022-04-07 15:14:22,304 INFO L87 Difference]: Start difference. First operand 73 states and 88 transitions. Second operand has 10 states, 9 states have (on average 2.7777777777777777) internal successors, (25), 7 states have internal predecessors, (25), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 3 states have call predecessors, (7), 1 states have call successors, (7) [2022-04-07 15:14:24,364 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-07 15:14:24,686 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 15:14:24,687 INFO L93 Difference]: Finished difference Result 80 states and 94 transitions. [2022-04-07 15:14:24,687 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-07 15:14:24,687 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 2.7777777777777777) internal successors, (25), 7 states have internal predecessors, (25), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 3 states have call predecessors, (7), 1 states have call successors, (7) Word has length 43 [2022-04-07 15:14:24,687 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 15:14:24,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 9 states have (on average 2.7777777777777777) internal successors, (25), 7 states have internal predecessors, (25), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 3 states have call predecessors, (7), 1 states have call successors, (7) [2022-04-07 15:14:24,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 40 transitions. [2022-04-07 15:14:24,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 9 states have (on average 2.7777777777777777) internal successors, (25), 7 states have internal predecessors, (25), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 3 states have call predecessors, (7), 1 states have call successors, (7) [2022-04-07 15:14:24,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 40 transitions. [2022-04-07 15:14:24,690 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 9 states and 40 transitions. [2022-04-07 15:14:28,722 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 40 edges. 38 inductive. 0 not inductive. 2 times theorem prover too weak to decide inductivity. [2022-04-07 15:14:28,724 INFO L225 Difference]: With dead ends: 80 [2022-04-07 15:14:28,724 INFO L226 Difference]: Without dead ends: 73 [2022-04-07 15:14:28,724 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 76 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2022-04-07 15:14:28,725 INFO L913 BasicCegarLoop]: 25 mSDtfsCounter, 17 mSDsluCounter, 95 mSDsCounter, 0 mSdLazyCounter, 75 mSolverCounterSat, 3 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 120 SdHoareTripleChecker+Invalid, 79 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 75 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2022-04-07 15:14:28,726 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [17 Valid, 120 Invalid, 79 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 75 Invalid, 1 Unknown, 0 Unchecked, 2.1s Time] [2022-04-07 15:14:28,726 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2022-04-07 15:14:28,755 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 72. [2022-04-07 15:14:28,755 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 15:14:28,756 INFO L82 GeneralOperation]: Start isEquivalent. First operand 73 states. Second operand has 72 states, 51 states have (on average 1.1372549019607843) internal successors, (58), 53 states have internal predecessors, (58), 13 states have call successors, (13), 8 states have call predecessors, (13), 7 states have return successors, (12), 10 states have call predecessors, (12), 12 states have call successors, (12) [2022-04-07 15:14:28,756 INFO L74 IsIncluded]: Start isIncluded. First operand 73 states. Second operand has 72 states, 51 states have (on average 1.1372549019607843) internal successors, (58), 53 states have internal predecessors, (58), 13 states have call successors, (13), 8 states have call predecessors, (13), 7 states have return successors, (12), 10 states have call predecessors, (12), 12 states have call successors, (12) [2022-04-07 15:14:28,756 INFO L87 Difference]: Start difference. First operand 73 states. Second operand has 72 states, 51 states have (on average 1.1372549019607843) internal successors, (58), 53 states have internal predecessors, (58), 13 states have call successors, (13), 8 states have call predecessors, (13), 7 states have return successors, (12), 10 states have call predecessors, (12), 12 states have call successors, (12) [2022-04-07 15:14:28,759 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 15:14:28,759 INFO L93 Difference]: Finished difference Result 73 states and 84 transitions. [2022-04-07 15:14:28,759 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 84 transitions. [2022-04-07 15:14:28,759 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 15:14:28,759 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 15:14:28,759 INFO L74 IsIncluded]: Start isIncluded. First operand has 72 states, 51 states have (on average 1.1372549019607843) internal successors, (58), 53 states have internal predecessors, (58), 13 states have call successors, (13), 8 states have call predecessors, (13), 7 states have return successors, (12), 10 states have call predecessors, (12), 12 states have call successors, (12) Second operand 73 states. [2022-04-07 15:14:28,760 INFO L87 Difference]: Start difference. First operand has 72 states, 51 states have (on average 1.1372549019607843) internal successors, (58), 53 states have internal predecessors, (58), 13 states have call successors, (13), 8 states have call predecessors, (13), 7 states have return successors, (12), 10 states have call predecessors, (12), 12 states have call successors, (12) Second operand 73 states. [2022-04-07 15:14:28,762 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 15:14:28,762 INFO L93 Difference]: Finished difference Result 73 states and 84 transitions. [2022-04-07 15:14:28,762 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 84 transitions. [2022-04-07 15:14:28,763 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 15:14:28,763 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 15:14:28,763 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 15:14:28,763 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 15:14:28,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 51 states have (on average 1.1372549019607843) internal successors, (58), 53 states have internal predecessors, (58), 13 states have call successors, (13), 8 states have call predecessors, (13), 7 states have return successors, (12), 10 states have call predecessors, (12), 12 states have call successors, (12) [2022-04-07 15:14:28,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 83 transitions. [2022-04-07 15:14:28,765 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 83 transitions. Word has length 43 [2022-04-07 15:14:28,766 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 15:14:28,766 INFO L478 AbstractCegarLoop]: Abstraction has 72 states and 83 transitions. [2022-04-07 15:14:28,766 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 2.7777777777777777) internal successors, (25), 7 states have internal predecessors, (25), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 3 states have call predecessors, (7), 1 states have call successors, (7) [2022-04-07 15:14:28,766 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 83 transitions. [2022-04-07 15:14:28,766 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2022-04-07 15:14:28,767 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 15:14:28,767 INFO L499 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-07 15:14:28,785 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-07 15:14:28,975 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 15:14:28,976 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 15:14:28,976 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 15:14:28,976 INFO L85 PathProgramCache]: Analyzing trace with hash -1459553868, now seen corresponding path program 1 times [2022-04-07 15:14:28,976 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 15:14:28,976 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1806147268] [2022-04-07 15:14:28,976 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 15:14:28,976 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 15:14:28,991 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-07 15:14:28,991 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1482456051] [2022-04-07 15:14:28,991 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 15:14:28,991 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 15:14:28,991 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-07 15:14:28,992 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-07 15:14:28,998 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-07 15:14:29,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 15:14:29,052 INFO L263 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 44 conjunts are in the unsatisfiable core [2022-04-07 15:14:29,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 15:14:29,101 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-07 15:14:37,158 INFO L272 TraceCheckUtils]: 0: Hoare triple {2524#true} call ULTIMATE.init(); {2524#true} is VALID [2022-04-07 15:14:37,158 INFO L290 TraceCheckUtils]: 1: Hoare triple {2524#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(13, 2);call #Ultimate.allocInit(12, 3); {2524#true} is VALID [2022-04-07 15:14:37,158 INFO L290 TraceCheckUtils]: 2: Hoare triple {2524#true} assume true; {2524#true} is VALID [2022-04-07 15:14:37,158 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2524#true} {2524#true} #71#return; {2524#true} is VALID [2022-04-07 15:14:37,158 INFO L272 TraceCheckUtils]: 4: Hoare triple {2524#true} call #t~ret6 := main(); {2524#true} is VALID [2022-04-07 15:14:37,159 INFO L290 TraceCheckUtils]: 5: Hoare triple {2524#true} havoc ~a~0;havoc ~b~0;havoc ~x~0;havoc ~y~0;havoc ~z~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~a~0 := #t~nondet4;havoc #t~nondet4; {2524#true} is VALID [2022-04-07 15:14:37,159 INFO L272 TraceCheckUtils]: 6: Hoare triple {2524#true} call assume_abort_if_not((if ~a~0 >= 0 && ~a~0 <= 100 then 1 else 0)); {2524#true} is VALID [2022-04-07 15:14:37,159 INFO L290 TraceCheckUtils]: 7: Hoare triple {2524#true} ~cond := #in~cond; {2524#true} is VALID [2022-04-07 15:14:37,159 INFO L290 TraceCheckUtils]: 8: Hoare triple {2524#true} assume !(0 == ~cond); {2524#true} is VALID [2022-04-07 15:14:37,159 INFO L290 TraceCheckUtils]: 9: Hoare triple {2524#true} assume true; {2524#true} is VALID [2022-04-07 15:14:37,159 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {2524#true} {2524#true} #61#return; {2524#true} is VALID [2022-04-07 15:14:37,159 INFO L290 TraceCheckUtils]: 11: Hoare triple {2524#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~b~0 := #t~nondet5;havoc #t~nondet5; {2524#true} is VALID [2022-04-07 15:14:37,159 INFO L272 TraceCheckUtils]: 12: Hoare triple {2524#true} call assume_abort_if_not((if ~b~0 >= 0 && ~b~0 <= 100 then 1 else 0)); {2524#true} is VALID [2022-04-07 15:14:37,159 INFO L290 TraceCheckUtils]: 13: Hoare triple {2524#true} ~cond := #in~cond; {2524#true} is VALID [2022-04-07 15:14:37,159 INFO L290 TraceCheckUtils]: 14: Hoare triple {2524#true} assume !(0 == ~cond); {2524#true} is VALID [2022-04-07 15:14:37,159 INFO L290 TraceCheckUtils]: 15: Hoare triple {2524#true} assume true; {2524#true} is VALID [2022-04-07 15:14:37,159 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {2524#true} {2524#true} #63#return; {2524#true} is VALID [2022-04-07 15:14:37,160 INFO L272 TraceCheckUtils]: 17: Hoare triple {2524#true} call assume_abort_if_not((if ~b~0 >= 1 then 1 else 0)); {2524#true} is VALID [2022-04-07 15:14:37,160 INFO L290 TraceCheckUtils]: 18: Hoare triple {2524#true} ~cond := #in~cond; {2524#true} is VALID [2022-04-07 15:14:37,160 INFO L290 TraceCheckUtils]: 19: Hoare triple {2524#true} assume !(0 == ~cond); {2524#true} is VALID [2022-04-07 15:14:37,160 INFO L290 TraceCheckUtils]: 20: Hoare triple {2524#true} assume true; {2524#true} is VALID [2022-04-07 15:14:37,160 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {2524#true} {2524#true} #65#return; {2524#true} is VALID [2022-04-07 15:14:37,160 INFO L290 TraceCheckUtils]: 22: Hoare triple {2524#true} ~x~0 := ~a~0;~y~0 := ~b~0;~z~0 := 0; {2595#(and (= main_~b~0 main_~y~0) (= main_~a~0 main_~x~0))} is VALID [2022-04-07 15:14:37,161 INFO L290 TraceCheckUtils]: 23: Hoare triple {2595#(and (= main_~b~0 main_~y~0) (= main_~a~0 main_~x~0))} assume !false; {2595#(and (= main_~b~0 main_~y~0) (= main_~a~0 main_~x~0))} is VALID [2022-04-07 15:14:37,161 INFO L272 TraceCheckUtils]: 24: Hoare triple {2595#(and (= main_~b~0 main_~y~0) (= main_~a~0 main_~x~0))} call __VERIFIER_assert((if ~z~0 + ~x~0 * ~y~0 == ~a~0 * ~b~0 then 1 else 0)); {2524#true} is VALID [2022-04-07 15:14:37,161 INFO L290 TraceCheckUtils]: 25: Hoare triple {2524#true} ~cond := #in~cond; {2524#true} is VALID [2022-04-07 15:14:37,161 INFO L290 TraceCheckUtils]: 26: Hoare triple {2524#true} assume !(0 == ~cond); {2524#true} is VALID [2022-04-07 15:14:37,161 INFO L290 TraceCheckUtils]: 27: Hoare triple {2524#true} assume true; {2524#true} is VALID [2022-04-07 15:14:37,162 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {2524#true} {2595#(and (= main_~b~0 main_~y~0) (= main_~a~0 main_~x~0))} #67#return; {2595#(and (= main_~b~0 main_~y~0) (= main_~a~0 main_~x~0))} is VALID [2022-04-07 15:14:37,162 INFO L290 TraceCheckUtils]: 29: Hoare triple {2595#(and (= main_~b~0 main_~y~0) (= main_~a~0 main_~x~0))} assume !!(0 != ~y~0); {2617#(and (not (= main_~y~0 0)) (= main_~b~0 main_~y~0) (= main_~a~0 main_~x~0))} is VALID [2022-04-07 15:14:37,163 INFO L290 TraceCheckUtils]: 30: Hoare triple {2617#(and (not (= main_~y~0 0)) (= main_~b~0 main_~y~0) (= main_~a~0 main_~x~0))} assume 1 == (if ~y~0 < 0 && 0 != ~y~0 % 2 then ~y~0 % 2 - 2 else ~y~0 % 2);~z~0 := ~z~0 + ~x~0;~y~0 := ~y~0 - 1; {2621#(and (= main_~b~0 (+ main_~y~0 1)) (<= 1 (mod main_~b~0 2)) (<= 0 main_~b~0) (= main_~a~0 main_~x~0))} is VALID [2022-04-07 15:14:37,164 INFO L290 TraceCheckUtils]: 31: Hoare triple {2621#(and (= main_~b~0 (+ main_~y~0 1)) (<= 1 (mod main_~b~0 2)) (<= 0 main_~b~0) (= main_~a~0 main_~x~0))} ~x~0 := 2 * ~x~0;~y~0 := (if ~y~0 < 0 && 0 != ~y~0 % 2 then 1 + ~y~0 / 2 else ~y~0 / 2); {2625#(and (<= 1 (mod main_~b~0 2)) (= (* main_~a~0 2) main_~x~0) (<= 0 main_~b~0) (= (div (+ (- 1) main_~b~0) 2) main_~y~0))} is VALID [2022-04-07 15:14:37,165 INFO L290 TraceCheckUtils]: 32: Hoare triple {2625#(and (<= 1 (mod main_~b~0 2)) (= (* main_~a~0 2) main_~x~0) (<= 0 main_~b~0) (= (div (+ (- 1) main_~b~0) 2) main_~y~0))} assume !false; {2625#(and (<= 1 (mod main_~b~0 2)) (= (* main_~a~0 2) main_~x~0) (<= 0 main_~b~0) (= (div (+ (- 1) main_~b~0) 2) main_~y~0))} is VALID [2022-04-07 15:14:37,165 INFO L272 TraceCheckUtils]: 33: Hoare triple {2625#(and (<= 1 (mod main_~b~0 2)) (= (* main_~a~0 2) main_~x~0) (<= 0 main_~b~0) (= (div (+ (- 1) main_~b~0) 2) main_~y~0))} call __VERIFIER_assert((if ~z~0 + ~x~0 * ~y~0 == ~a~0 * ~b~0 then 1 else 0)); {2524#true} is VALID [2022-04-07 15:14:37,165 INFO L290 TraceCheckUtils]: 34: Hoare triple {2524#true} ~cond := #in~cond; {2635#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-07 15:14:37,166 INFO L290 TraceCheckUtils]: 35: Hoare triple {2635#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {2639#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-07 15:14:37,166 INFO L290 TraceCheckUtils]: 36: Hoare triple {2639#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {2639#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-07 15:14:37,167 INFO L284 TraceCheckUtils]: 37: Hoare quadruple {2639#(not (= |__VERIFIER_assert_#in~cond| 0))} {2625#(and (<= 1 (mod main_~b~0 2)) (= (* main_~a~0 2) main_~x~0) (<= 0 main_~b~0) (= (div (+ (- 1) main_~b~0) 2) main_~y~0))} #67#return; {2646#(and (<= 1 (mod main_~b~0 2)) (= (+ main_~z~0 (* main_~y~0 main_~x~0)) (* main_~b~0 main_~a~0)) (= (* main_~a~0 2) main_~x~0) (<= 0 main_~b~0) (= (div (+ (- 1) main_~b~0) 2) main_~y~0))} is VALID [2022-04-07 15:14:37,168 INFO L290 TraceCheckUtils]: 38: Hoare triple {2646#(and (<= 1 (mod main_~b~0 2)) (= (+ main_~z~0 (* main_~y~0 main_~x~0)) (* main_~b~0 main_~a~0)) (= (* main_~a~0 2) main_~x~0) (<= 0 main_~b~0) (= (div (+ (- 1) main_~b~0) 2) main_~y~0))} assume !!(0 != ~y~0); {2650#(and (not (= main_~y~0 0)) (<= 1 (mod main_~b~0 2)) (= (+ main_~z~0 (* main_~y~0 main_~x~0)) (* main_~b~0 main_~a~0)) (= (* main_~a~0 2) main_~x~0) (<= 0 main_~b~0) (= (div (+ (- 1) main_~b~0) 2) main_~y~0))} is VALID [2022-04-07 15:14:37,171 INFO L290 TraceCheckUtils]: 39: Hoare triple {2650#(and (not (= main_~y~0 0)) (<= 1 (mod main_~b~0 2)) (= (+ main_~z~0 (* main_~y~0 main_~x~0)) (* main_~b~0 main_~a~0)) (= (* main_~a~0 2) main_~x~0) (<= 0 main_~b~0) (= (div (+ (- 1) main_~b~0) 2) main_~y~0))} assume 1 == (if ~y~0 < 0 && 0 != ~y~0 % 2 then ~y~0 % 2 - 2 else ~y~0 % 2);~z~0 := ~z~0 + ~x~0;~y~0 := ~y~0 - 1; {2654#(and (= (+ main_~z~0 (* (div (+ (- 1) main_~b~0) 2) main_~x~0)) (+ main_~x~0 (* main_~b~0 main_~a~0))) (<= 1 (mod main_~b~0 2)) (= (* main_~a~0 2) main_~x~0) (= (div (+ (- 1) main_~b~0) 2) (+ main_~y~0 1)) (<= 1 (mod (div (+ (- 1) main_~b~0) 2) 2)) (<= 0 main_~b~0))} is VALID [2022-04-07 15:14:37,175 INFO L290 TraceCheckUtils]: 40: Hoare triple {2654#(and (= (+ main_~z~0 (* (div (+ (- 1) main_~b~0) 2) main_~x~0)) (+ main_~x~0 (* main_~b~0 main_~a~0))) (<= 1 (mod main_~b~0 2)) (= (* main_~a~0 2) main_~x~0) (= (div (+ (- 1) main_~b~0) 2) (+ main_~y~0 1)) (<= 1 (mod (div (+ (- 1) main_~b~0) 2) 2)) (<= 0 main_~b~0))} ~x~0 := 2 * ~x~0;~y~0 := (if ~y~0 < 0 && 0 != ~y~0 % 2 then 1 + ~y~0 / 2 else ~y~0 / 2); {2658#(and (<= 1 (mod main_~b~0 2)) (= (* main_~a~0 4) main_~x~0) (= (div (+ (- 1) (div (+ (- 1) main_~b~0) 2)) 2) main_~y~0) (= (+ (* main_~a~0 2) (* main_~b~0 main_~a~0)) (+ main_~z~0 (* (div (+ (- 1) main_~b~0) 2) (* main_~a~0 2)))) (<= 1 (mod (div (+ (- 1) main_~b~0) 2) 2)) (<= 0 main_~b~0))} is VALID [2022-04-07 15:14:37,176 INFO L290 TraceCheckUtils]: 41: Hoare triple {2658#(and (<= 1 (mod main_~b~0 2)) (= (* main_~a~0 4) main_~x~0) (= (div (+ (- 1) (div (+ (- 1) main_~b~0) 2)) 2) main_~y~0) (= (+ (* main_~a~0 2) (* main_~b~0 main_~a~0)) (+ main_~z~0 (* (div (+ (- 1) main_~b~0) 2) (* main_~a~0 2)))) (<= 1 (mod (div (+ (- 1) main_~b~0) 2) 2)) (<= 0 main_~b~0))} assume !false; {2658#(and (<= 1 (mod main_~b~0 2)) (= (* main_~a~0 4) main_~x~0) (= (div (+ (- 1) (div (+ (- 1) main_~b~0) 2)) 2) main_~y~0) (= (+ (* main_~a~0 2) (* main_~b~0 main_~a~0)) (+ main_~z~0 (* (div (+ (- 1) main_~b~0) 2) (* main_~a~0 2)))) (<= 1 (mod (div (+ (- 1) main_~b~0) 2) 2)) (<= 0 main_~b~0))} is VALID [2022-04-07 15:14:37,176 INFO L272 TraceCheckUtils]: 42: Hoare triple {2658#(and (<= 1 (mod main_~b~0 2)) (= (* main_~a~0 4) main_~x~0) (= (div (+ (- 1) (div (+ (- 1) main_~b~0) 2)) 2) main_~y~0) (= (+ (* main_~a~0 2) (* main_~b~0 main_~a~0)) (+ main_~z~0 (* (div (+ (- 1) main_~b~0) 2) (* main_~a~0 2)))) (<= 1 (mod (div (+ (- 1) main_~b~0) 2) 2)) (<= 0 main_~b~0))} call __VERIFIER_assert((if ~z~0 + ~x~0 * ~y~0 == ~a~0 * ~b~0 then 1 else 0)); {2524#true} is VALID [2022-04-07 15:14:37,177 INFO L290 TraceCheckUtils]: 43: Hoare triple {2524#true} ~cond := #in~cond; {2635#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-07 15:14:37,177 INFO L290 TraceCheckUtils]: 44: Hoare triple {2635#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {2639#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-07 15:14:37,177 INFO L290 TraceCheckUtils]: 45: Hoare triple {2639#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {2639#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-07 15:14:37,178 INFO L284 TraceCheckUtils]: 46: Hoare quadruple {2639#(not (= |__VERIFIER_assert_#in~cond| 0))} {2658#(and (<= 1 (mod main_~b~0 2)) (= (* main_~a~0 4) main_~x~0) (= (div (+ (- 1) (div (+ (- 1) main_~b~0) 2)) 2) main_~y~0) (= (+ (* main_~a~0 2) (* main_~b~0 main_~a~0)) (+ main_~z~0 (* (div (+ (- 1) main_~b~0) 2) (* main_~a~0 2)))) (<= 1 (mod (div (+ (- 1) main_~b~0) 2) 2)) (<= 0 main_~b~0))} #67#return; {2658#(and (<= 1 (mod main_~b~0 2)) (= (* main_~a~0 4) main_~x~0) (= (div (+ (- 1) (div (+ (- 1) main_~b~0) 2)) 2) main_~y~0) (= (+ (* main_~a~0 2) (* main_~b~0 main_~a~0)) (+ main_~z~0 (* (div (+ (- 1) main_~b~0) 2) (* main_~a~0 2)))) (<= 1 (mod (div (+ (- 1) main_~b~0) 2) 2)) (<= 0 main_~b~0))} is VALID [2022-04-07 15:14:37,179 INFO L290 TraceCheckUtils]: 47: Hoare triple {2658#(and (<= 1 (mod main_~b~0 2)) (= (* main_~a~0 4) main_~x~0) (= (div (+ (- 1) (div (+ (- 1) main_~b~0) 2)) 2) main_~y~0) (= (+ (* main_~a~0 2) (* main_~b~0 main_~a~0)) (+ main_~z~0 (* (div (+ (- 1) main_~b~0) 2) (* main_~a~0 2)))) (<= 1 (mod (div (+ (- 1) main_~b~0) 2) 2)) (<= 0 main_~b~0))} assume !!(0 != ~y~0); {2658#(and (<= 1 (mod main_~b~0 2)) (= (* main_~a~0 4) main_~x~0) (= (div (+ (- 1) (div (+ (- 1) main_~b~0) 2)) 2) main_~y~0) (= (+ (* main_~a~0 2) (* main_~b~0 main_~a~0)) (+ main_~z~0 (* (div (+ (- 1) main_~b~0) 2) (* main_~a~0 2)))) (<= 1 (mod (div (+ (- 1) main_~b~0) 2) 2)) (<= 0 main_~b~0))} is VALID [2022-04-07 15:14:37,180 INFO L290 TraceCheckUtils]: 48: Hoare triple {2658#(and (<= 1 (mod main_~b~0 2)) (= (* main_~a~0 4) main_~x~0) (= (div (+ (- 1) (div (+ (- 1) main_~b~0) 2)) 2) main_~y~0) (= (+ (* main_~a~0 2) (* main_~b~0 main_~a~0)) (+ main_~z~0 (* (div (+ (- 1) main_~b~0) 2) (* main_~a~0 2)))) (<= 1 (mod (div (+ (- 1) main_~b~0) 2) 2)) (<= 0 main_~b~0))} assume !(1 == (if ~y~0 < 0 && 0 != ~y~0 % 2 then ~y~0 % 2 - 2 else ~y~0 % 2)); {2683#(and (<= 1 (mod main_~b~0 2)) (= (* main_~a~0 4) main_~x~0) (not (= (mod main_~y~0 2) 1)) (= (div (+ (- 1) (div (+ (- 1) main_~b~0) 2)) 2) main_~y~0) (<= 1 (mod (div (+ (- 1) main_~b~0) 2) 2)) (<= 0 main_~b~0) (= (+ (* main_~a~0 2) (* main_~b~0 main_~a~0)) (+ (* 2 (* (div (+ (- 1) main_~b~0) 2) main_~a~0)) main_~z~0)))} is VALID [2022-04-07 15:14:37,182 INFO L290 TraceCheckUtils]: 49: Hoare triple {2683#(and (<= 1 (mod main_~b~0 2)) (= (* main_~a~0 4) main_~x~0) (not (= (mod main_~y~0 2) 1)) (= (div (+ (- 1) (div (+ (- 1) main_~b~0) 2)) 2) main_~y~0) (<= 1 (mod (div (+ (- 1) main_~b~0) 2) 2)) (<= 0 main_~b~0) (= (+ (* main_~a~0 2) (* main_~b~0 main_~a~0)) (+ (* 2 (* (div (+ (- 1) main_~b~0) 2) main_~a~0)) main_~z~0)))} ~x~0 := 2 * ~x~0;~y~0 := (if ~y~0 < 0 && 0 != ~y~0 % 2 then 1 + ~y~0 / 2 else ~y~0 / 2); {2687#(and (<= 1 (mod main_~b~0 2)) (= (div (div (+ (- 1) (div (+ (- 1) main_~b~0) 2)) 2) 2) main_~y~0) (= main_~x~0 (* main_~a~0 8)) (not (= (mod (div (+ (- 1) (div (+ (- 1) main_~b~0) 2)) 2) 2) 1)) (<= 1 (mod (div (+ (- 1) main_~b~0) 2) 2)) (<= 0 main_~b~0) (= (+ (* main_~a~0 2) (* main_~b~0 main_~a~0)) (+ (* 2 (* (div (+ (- 1) main_~b~0) 2) main_~a~0)) main_~z~0)))} is VALID [2022-04-07 15:14:37,183 INFO L290 TraceCheckUtils]: 50: Hoare triple {2687#(and (<= 1 (mod main_~b~0 2)) (= (div (div (+ (- 1) (div (+ (- 1) main_~b~0) 2)) 2) 2) main_~y~0) (= main_~x~0 (* main_~a~0 8)) (not (= (mod (div (+ (- 1) (div (+ (- 1) main_~b~0) 2)) 2) 2) 1)) (<= 1 (mod (div (+ (- 1) main_~b~0) 2) 2)) (<= 0 main_~b~0) (= (+ (* main_~a~0 2) (* main_~b~0 main_~a~0)) (+ (* 2 (* (div (+ (- 1) main_~b~0) 2) main_~a~0)) main_~z~0)))} assume !false; {2687#(and (<= 1 (mod main_~b~0 2)) (= (div (div (+ (- 1) (div (+ (- 1) main_~b~0) 2)) 2) 2) main_~y~0) (= main_~x~0 (* main_~a~0 8)) (not (= (mod (div (+ (- 1) (div (+ (- 1) main_~b~0) 2)) 2) 2) 1)) (<= 1 (mod (div (+ (- 1) main_~b~0) 2) 2)) (<= 0 main_~b~0) (= (+ (* main_~a~0 2) (* main_~b~0 main_~a~0)) (+ (* 2 (* (div (+ (- 1) main_~b~0) 2) main_~a~0)) main_~z~0)))} is VALID [2022-04-07 15:14:37,390 INFO L272 TraceCheckUtils]: 51: Hoare triple {2687#(and (<= 1 (mod main_~b~0 2)) (= (div (div (+ (- 1) (div (+ (- 1) main_~b~0) 2)) 2) 2) main_~y~0) (= main_~x~0 (* main_~a~0 8)) (not (= (mod (div (+ (- 1) (div (+ (- 1) main_~b~0) 2)) 2) 2) 1)) (<= 1 (mod (div (+ (- 1) main_~b~0) 2) 2)) (<= 0 main_~b~0) (= (+ (* main_~a~0 2) (* main_~b~0 main_~a~0)) (+ (* 2 (* (div (+ (- 1) main_~b~0) 2) main_~a~0)) main_~z~0)))} call __VERIFIER_assert((if ~z~0 + ~x~0 * ~y~0 == ~a~0 * ~b~0 then 1 else 0)); {2694#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-07 15:14:37,391 INFO L290 TraceCheckUtils]: 52: Hoare triple {2694#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {2698#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-07 15:14:37,391 INFO L290 TraceCheckUtils]: 53: Hoare triple {2698#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {2525#false} is VALID [2022-04-07 15:14:37,391 INFO L290 TraceCheckUtils]: 54: Hoare triple {2525#false} assume !false; {2525#false} is VALID [2022-04-07 15:14:37,391 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 10 proven. 23 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2022-04-07 15:14:37,391 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-07 15:16:45,622 INFO L290 TraceCheckUtils]: 54: Hoare triple {2525#false} assume !false; {2525#false} is VALID [2022-04-07 15:16:45,622 INFO L290 TraceCheckUtils]: 53: Hoare triple {2698#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {2525#false} is VALID [2022-04-07 15:16:45,623 INFO L290 TraceCheckUtils]: 52: Hoare triple {2694#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {2698#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-07 15:16:45,623 INFO L272 TraceCheckUtils]: 51: Hoare triple {2714#(= (+ main_~z~0 (* main_~y~0 main_~x~0)) (* main_~b~0 main_~a~0))} call __VERIFIER_assert((if ~z~0 + ~x~0 * ~y~0 == ~a~0 * ~b~0 then 1 else 0)); {2694#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-07 15:16:45,624 INFO L290 TraceCheckUtils]: 50: Hoare triple {2714#(= (+ main_~z~0 (* main_~y~0 main_~x~0)) (* main_~b~0 main_~a~0))} assume !false; {2714#(= (+ main_~z~0 (* main_~y~0 main_~x~0)) (* main_~b~0 main_~a~0))} is VALID [2022-04-07 15:16:45,634 INFO L290 TraceCheckUtils]: 49: Hoare triple {2721#(and (or (not (< main_~y~0 0)) (= (mod main_~y~0 2) 0) (= (+ main_~z~0 (* (* main_~x~0 2) (+ (div main_~y~0 2) 1))) (* main_~b~0 main_~a~0))) (or (= (+ main_~z~0 (* (* main_~x~0 2) (div main_~y~0 2))) (* main_~b~0 main_~a~0)) (and (not (= (mod main_~y~0 2) 0)) (< main_~y~0 0))))} ~x~0 := 2 * ~x~0;~y~0 := (if ~y~0 < 0 && 0 != ~y~0 % 2 then 1 + ~y~0 / 2 else ~y~0 / 2); {2714#(= (+ main_~z~0 (* main_~y~0 main_~x~0)) (* main_~b~0 main_~a~0))} is VALID [2022-04-07 15:16:45,635 INFO L290 TraceCheckUtils]: 48: Hoare triple {2725#(or (and (<= 0 main_~y~0) (= (mod main_~y~0 2) 1)) (and (or (= (mod main_~y~0 2) 0) (= (+ main_~z~0 (* (* main_~x~0 2) (+ (div main_~y~0 2) 1))) (* main_~b~0 main_~a~0))) (or (= (+ main_~z~0 (* (* main_~x~0 2) (div main_~y~0 2))) (* main_~b~0 main_~a~0)) (not (= (mod main_~y~0 2) 0)))))} assume !(1 == (if ~y~0 < 0 && 0 != ~y~0 % 2 then ~y~0 % 2 - 2 else ~y~0 % 2)); {2721#(and (or (not (< main_~y~0 0)) (= (mod main_~y~0 2) 0) (= (+ main_~z~0 (* (* main_~x~0 2) (+ (div main_~y~0 2) 1))) (* main_~b~0 main_~a~0))) (or (= (+ main_~z~0 (* (* main_~x~0 2) (div main_~y~0 2))) (* main_~b~0 main_~a~0)) (and (not (= (mod main_~y~0 2) 0)) (< main_~y~0 0))))} is VALID [2022-04-07 15:16:45,636 INFO L290 TraceCheckUtils]: 47: Hoare triple {2725#(or (and (<= 0 main_~y~0) (= (mod main_~y~0 2) 1)) (and (or (= (mod main_~y~0 2) 0) (= (+ main_~z~0 (* (* main_~x~0 2) (+ (div main_~y~0 2) 1))) (* main_~b~0 main_~a~0))) (or (= (+ main_~z~0 (* (* main_~x~0 2) (div main_~y~0 2))) (* main_~b~0 main_~a~0)) (not (= (mod main_~y~0 2) 0)))))} assume !!(0 != ~y~0); {2725#(or (and (<= 0 main_~y~0) (= (mod main_~y~0 2) 1)) (and (or (= (mod main_~y~0 2) 0) (= (+ main_~z~0 (* (* main_~x~0 2) (+ (div main_~y~0 2) 1))) (* main_~b~0 main_~a~0))) (or (= (+ main_~z~0 (* (* main_~x~0 2) (div main_~y~0 2))) (* main_~b~0 main_~a~0)) (not (= (mod main_~y~0 2) 0)))))} is VALID [2022-04-07 15:16:45,638 INFO L284 TraceCheckUtils]: 46: Hoare quadruple {2639#(not (= |__VERIFIER_assert_#in~cond| 0))} {2732#(or (<= 0 main_~y~0) (not (= (+ main_~z~0 (* main_~y~0 main_~x~0)) (* main_~b~0 main_~a~0))) (= (mod main_~y~0 2) 0) (= (+ main_~z~0 (* (* main_~x~0 2) (+ (div main_~y~0 2) 1))) (* main_~b~0 main_~a~0)))} #67#return; {2725#(or (and (<= 0 main_~y~0) (= (mod main_~y~0 2) 1)) (and (or (= (mod main_~y~0 2) 0) (= (+ main_~z~0 (* (* main_~x~0 2) (+ (div main_~y~0 2) 1))) (* main_~b~0 main_~a~0))) (or (= (+ main_~z~0 (* (* main_~x~0 2) (div main_~y~0 2))) (* main_~b~0 main_~a~0)) (not (= (mod main_~y~0 2) 0)))))} is VALID [2022-04-07 15:16:45,639 INFO L290 TraceCheckUtils]: 45: Hoare triple {2639#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {2639#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-07 15:16:45,639 INFO L290 TraceCheckUtils]: 44: Hoare triple {2742#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} assume !(0 == ~cond); {2639#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-07 15:16:45,639 INFO L290 TraceCheckUtils]: 43: Hoare triple {2524#true} ~cond := #in~cond; {2742#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-07 15:16:45,640 INFO L272 TraceCheckUtils]: 42: Hoare triple {2732#(or (<= 0 main_~y~0) (not (= (+ main_~z~0 (* main_~y~0 main_~x~0)) (* main_~b~0 main_~a~0))) (= (mod main_~y~0 2) 0) (= (+ main_~z~0 (* (* main_~x~0 2) (+ (div main_~y~0 2) 1))) (* main_~b~0 main_~a~0)))} call __VERIFIER_assert((if ~z~0 + ~x~0 * ~y~0 == ~a~0 * ~b~0 then 1 else 0)); {2524#true} is VALID [2022-04-07 15:16:45,640 INFO L290 TraceCheckUtils]: 41: Hoare triple {2732#(or (<= 0 main_~y~0) (not (= (+ main_~z~0 (* main_~y~0 main_~x~0)) (* main_~b~0 main_~a~0))) (= (mod main_~y~0 2) 0) (= (+ main_~z~0 (* (* main_~x~0 2) (+ (div main_~y~0 2) 1))) (* main_~b~0 main_~a~0)))} assume !false; {2732#(or (<= 0 main_~y~0) (not (= (+ main_~z~0 (* main_~y~0 main_~x~0)) (* main_~b~0 main_~a~0))) (= (mod main_~y~0 2) 0) (= (+ main_~z~0 (* (* main_~x~0 2) (+ (div main_~y~0 2) 1))) (* main_~b~0 main_~a~0)))} is VALID [2022-04-07 15:16:45,668 INFO L290 TraceCheckUtils]: 40: Hoare triple {2752#(forall ((aux_div_v_main_~y~0_32_22 Int)) (or (and (or (not (= (+ main_~z~0 (* (* main_~x~0 2) (div main_~y~0 2))) (* main_~b~0 main_~a~0))) (not (= (mod main_~y~0 2) 0)) (<= 0 (div main_~y~0 2)) (< (div main_~y~0 2) (* aux_div_v_main_~y~0_32_22 2)) (<= (+ (* aux_div_v_main_~y~0_32_22 2) 2) (div main_~y~0 2)) (<= (div (- (div main_~y~0 2)) (- 2)) (+ (div (+ (- 2) (div main_~y~0 2)) 2) 1))) (or (<= (+ (* aux_div_v_main_~y~0_32_22 2) 1) (div main_~y~0 2)) (not (= (+ main_~z~0 (* (* main_~x~0 2) (+ (div main_~y~0 2) 1))) (* main_~b~0 main_~a~0))) (<= 0 (+ (div main_~y~0 2) 1)) (< (+ (div main_~y~0 2) 1) (* aux_div_v_main_~y~0_32_22 2)) (= (mod main_~y~0 2) 0) (<= (div (+ (- 1) (* (- 1) (div main_~y~0 2))) (- 2)) (+ (div (+ (- 1) (div main_~y~0 2)) 2) 1)))) (= (* main_~b~0 main_~a~0) (+ main_~z~0 (* main_~x~0 4) (* (* aux_div_v_main_~y~0_32_22 main_~x~0) 4)))))} ~x~0 := 2 * ~x~0;~y~0 := (if ~y~0 < 0 && 0 != ~y~0 % 2 then 1 + ~y~0 / 2 else ~y~0 / 2); {2732#(or (<= 0 main_~y~0) (not (= (+ main_~z~0 (* main_~y~0 main_~x~0)) (* main_~b~0 main_~a~0))) (= (mod main_~y~0 2) 0) (= (+ main_~z~0 (* (* main_~x~0 2) (+ (div main_~y~0 2) 1))) (* main_~b~0 main_~a~0)))} is VALID [2022-04-07 15:16:45,670 INFO L290 TraceCheckUtils]: 39: Hoare triple {2524#true} assume 1 == (if ~y~0 < 0 && 0 != ~y~0 % 2 then ~y~0 % 2 - 2 else ~y~0 % 2);~z~0 := ~z~0 + ~x~0;~y~0 := ~y~0 - 1; {2752#(forall ((aux_div_v_main_~y~0_32_22 Int)) (or (and (or (not (= (+ main_~z~0 (* (* main_~x~0 2) (div main_~y~0 2))) (* main_~b~0 main_~a~0))) (not (= (mod main_~y~0 2) 0)) (<= 0 (div main_~y~0 2)) (< (div main_~y~0 2) (* aux_div_v_main_~y~0_32_22 2)) (<= (+ (* aux_div_v_main_~y~0_32_22 2) 2) (div main_~y~0 2)) (<= (div (- (div main_~y~0 2)) (- 2)) (+ (div (+ (- 2) (div main_~y~0 2)) 2) 1))) (or (<= (+ (* aux_div_v_main_~y~0_32_22 2) 1) (div main_~y~0 2)) (not (= (+ main_~z~0 (* (* main_~x~0 2) (+ (div main_~y~0 2) 1))) (* main_~b~0 main_~a~0))) (<= 0 (+ (div main_~y~0 2) 1)) (< (+ (div main_~y~0 2) 1) (* aux_div_v_main_~y~0_32_22 2)) (= (mod main_~y~0 2) 0) (<= (div (+ (- 1) (* (- 1) (div main_~y~0 2))) (- 2)) (+ (div (+ (- 1) (div main_~y~0 2)) 2) 1)))) (= (* main_~b~0 main_~a~0) (+ main_~z~0 (* main_~x~0 4) (* (* aux_div_v_main_~y~0_32_22 main_~x~0) 4)))))} is VALID [2022-04-07 15:16:45,670 INFO L290 TraceCheckUtils]: 38: Hoare triple {2524#true} assume !!(0 != ~y~0); {2524#true} is VALID [2022-04-07 15:16:45,670 INFO L284 TraceCheckUtils]: 37: Hoare quadruple {2524#true} {2524#true} #67#return; {2524#true} is VALID [2022-04-07 15:16:45,670 INFO L290 TraceCheckUtils]: 36: Hoare triple {2524#true} assume true; {2524#true} is VALID [2022-04-07 15:16:45,670 INFO L290 TraceCheckUtils]: 35: Hoare triple {2524#true} assume !(0 == ~cond); {2524#true} is VALID [2022-04-07 15:16:45,670 INFO L290 TraceCheckUtils]: 34: Hoare triple {2524#true} ~cond := #in~cond; {2524#true} is VALID [2022-04-07 15:16:45,670 INFO L272 TraceCheckUtils]: 33: Hoare triple {2524#true} call __VERIFIER_assert((if ~z~0 + ~x~0 * ~y~0 == ~a~0 * ~b~0 then 1 else 0)); {2524#true} is VALID [2022-04-07 15:16:45,670 INFO L290 TraceCheckUtils]: 32: Hoare triple {2524#true} assume !false; {2524#true} is VALID [2022-04-07 15:16:45,670 INFO L290 TraceCheckUtils]: 31: Hoare triple {2524#true} ~x~0 := 2 * ~x~0;~y~0 := (if ~y~0 < 0 && 0 != ~y~0 % 2 then 1 + ~y~0 / 2 else ~y~0 / 2); {2524#true} is VALID [2022-04-07 15:16:45,670 INFO L290 TraceCheckUtils]: 30: Hoare triple {2524#true} assume 1 == (if ~y~0 < 0 && 0 != ~y~0 % 2 then ~y~0 % 2 - 2 else ~y~0 % 2);~z~0 := ~z~0 + ~x~0;~y~0 := ~y~0 - 1; {2524#true} is VALID [2022-04-07 15:16:45,671 INFO L290 TraceCheckUtils]: 29: Hoare triple {2524#true} assume !!(0 != ~y~0); {2524#true} is VALID [2022-04-07 15:16:45,671 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {2524#true} {2524#true} #67#return; {2524#true} is VALID [2022-04-07 15:16:45,671 INFO L290 TraceCheckUtils]: 27: Hoare triple {2524#true} assume true; {2524#true} is VALID [2022-04-07 15:16:45,671 INFO L290 TraceCheckUtils]: 26: Hoare triple {2524#true} assume !(0 == ~cond); {2524#true} is VALID [2022-04-07 15:16:45,671 INFO L290 TraceCheckUtils]: 25: Hoare triple {2524#true} ~cond := #in~cond; {2524#true} is VALID [2022-04-07 15:16:45,671 INFO L272 TraceCheckUtils]: 24: Hoare triple {2524#true} call __VERIFIER_assert((if ~z~0 + ~x~0 * ~y~0 == ~a~0 * ~b~0 then 1 else 0)); {2524#true} is VALID [2022-04-07 15:16:45,671 INFO L290 TraceCheckUtils]: 23: Hoare triple {2524#true} assume !false; {2524#true} is VALID [2022-04-07 15:16:45,671 INFO L290 TraceCheckUtils]: 22: Hoare triple {2524#true} ~x~0 := ~a~0;~y~0 := ~b~0;~z~0 := 0; {2524#true} is VALID [2022-04-07 15:16:45,671 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {2524#true} {2524#true} #65#return; {2524#true} is VALID [2022-04-07 15:16:45,671 INFO L290 TraceCheckUtils]: 20: Hoare triple {2524#true} assume true; {2524#true} is VALID [2022-04-07 15:16:45,671 INFO L290 TraceCheckUtils]: 19: Hoare triple {2524#true} assume !(0 == ~cond); {2524#true} is VALID [2022-04-07 15:16:45,671 INFO L290 TraceCheckUtils]: 18: Hoare triple {2524#true} ~cond := #in~cond; {2524#true} is VALID [2022-04-07 15:16:45,672 INFO L272 TraceCheckUtils]: 17: Hoare triple {2524#true} call assume_abort_if_not((if ~b~0 >= 1 then 1 else 0)); {2524#true} is VALID [2022-04-07 15:16:45,672 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {2524#true} {2524#true} #63#return; {2524#true} is VALID [2022-04-07 15:16:45,672 INFO L290 TraceCheckUtils]: 15: Hoare triple {2524#true} assume true; {2524#true} is VALID [2022-04-07 15:16:45,672 INFO L290 TraceCheckUtils]: 14: Hoare triple {2524#true} assume !(0 == ~cond); {2524#true} is VALID [2022-04-07 15:16:45,672 INFO L290 TraceCheckUtils]: 13: Hoare triple {2524#true} ~cond := #in~cond; {2524#true} is VALID [2022-04-07 15:16:45,672 INFO L272 TraceCheckUtils]: 12: Hoare triple {2524#true} call assume_abort_if_not((if ~b~0 >= 0 && ~b~0 <= 100 then 1 else 0)); {2524#true} is VALID [2022-04-07 15:16:45,672 INFO L290 TraceCheckUtils]: 11: Hoare triple {2524#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~b~0 := #t~nondet5;havoc #t~nondet5; {2524#true} is VALID [2022-04-07 15:16:45,672 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {2524#true} {2524#true} #61#return; {2524#true} is VALID [2022-04-07 15:16:45,672 INFO L290 TraceCheckUtils]: 9: Hoare triple {2524#true} assume true; {2524#true} is VALID [2022-04-07 15:16:45,672 INFO L290 TraceCheckUtils]: 8: Hoare triple {2524#true} assume !(0 == ~cond); {2524#true} is VALID [2022-04-07 15:16:45,672 INFO L290 TraceCheckUtils]: 7: Hoare triple {2524#true} ~cond := #in~cond; {2524#true} is VALID [2022-04-07 15:16:45,672 INFO L272 TraceCheckUtils]: 6: Hoare triple {2524#true} call assume_abort_if_not((if ~a~0 >= 0 && ~a~0 <= 100 then 1 else 0)); {2524#true} is VALID [2022-04-07 15:16:45,673 INFO L290 TraceCheckUtils]: 5: Hoare triple {2524#true} havoc ~a~0;havoc ~b~0;havoc ~x~0;havoc ~y~0;havoc ~z~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~a~0 := #t~nondet4;havoc #t~nondet4; {2524#true} is VALID [2022-04-07 15:16:45,673 INFO L272 TraceCheckUtils]: 4: Hoare triple {2524#true} call #t~ret6 := main(); {2524#true} is VALID [2022-04-07 15:16:45,673 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2524#true} {2524#true} #71#return; {2524#true} is VALID [2022-04-07 15:16:45,673 INFO L290 TraceCheckUtils]: 2: Hoare triple {2524#true} assume true; {2524#true} is VALID [2022-04-07 15:16:45,673 INFO L290 TraceCheckUtils]: 1: Hoare triple {2524#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(13, 2);call #Ultimate.allocInit(12, 3); {2524#true} is VALID [2022-04-07 15:16:45,673 INFO L272 TraceCheckUtils]: 0: Hoare triple {2524#true} call ULTIMATE.init(); {2524#true} is VALID [2022-04-07 15:16:45,673 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 25 proven. 4 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2022-04-07 15:16:45,674 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 15:16:45,674 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1806147268] [2022-04-07 15:16:45,674 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-07 15:16:45,674 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1482456051] [2022-04-07 15:16:45,674 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1482456051] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-07 15:16:45,674 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-07 15:16:45,674 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 11] total 22 [2022-04-07 15:16:45,674 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [74074008] [2022-04-07 15:16:45,674 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-07 15:16:45,675 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 2.0) internal successors, (44), 20 states have internal predecessors, (44), 7 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (9), 5 states have call predecessors, (9), 5 states have call successors, (9) Word has length 55 [2022-04-07 15:16:45,675 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 15:16:45,676 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 22 states, 22 states have (on average 2.0) internal successors, (44), 20 states have internal predecessors, (44), 7 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (9), 5 states have call predecessors, (9), 5 states have call successors, (9) [2022-04-07 15:16:47,821 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 65 edges. 64 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-07 15:16:47,821 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-04-07 15:16:47,822 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 15:16:47,822 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-04-07 15:16:47,822 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=379, Unknown=1, NotChecked=0, Total=462 [2022-04-07 15:16:47,822 INFO L87 Difference]: Start difference. First operand 72 states and 83 transitions. Second operand has 22 states, 22 states have (on average 2.0) internal successors, (44), 20 states have internal predecessors, (44), 7 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (9), 5 states have call predecessors, (9), 5 states have call successors, (9) [2022-04-07 15:17:02,487 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-07 15:17:04,478 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.88s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-07 15:17:22,645 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 15:17:22,646 INFO L93 Difference]: Finished difference Result 103 states and 120 transitions. [2022-04-07 15:17:22,646 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-04-07 15:17:22,646 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 2.0) internal successors, (44), 20 states have internal predecessors, (44), 7 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (9), 5 states have call predecessors, (9), 5 states have call successors, (9) Word has length 55 [2022-04-07 15:17:22,646 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 15:17:22,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 22 states have (on average 2.0) internal successors, (44), 20 states have internal predecessors, (44), 7 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (9), 5 states have call predecessors, (9), 5 states have call successors, (9) [2022-04-07 15:17:22,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 75 transitions. [2022-04-07 15:17:22,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 22 states have (on average 2.0) internal successors, (44), 20 states have internal predecessors, (44), 7 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (9), 5 states have call predecessors, (9), 5 states have call successors, (9) [2022-04-07 15:17:22,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 75 transitions. [2022-04-07 15:17:22,650 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 21 states and 75 transitions. [2022-04-07 15:17:26,694 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 75 edges. 74 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-07 15:17:26,696 INFO L225 Difference]: With dead ends: 103 [2022-04-07 15:17:26,697 INFO L226 Difference]: Without dead ends: 101 [2022-04-07 15:17:26,697 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 89 SyntacticMatches, 3 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 202 ImplicationChecksByTransitivity, 13.0s TimeCoverageRelationStatistics Valid=179, Invalid=876, Unknown=1, NotChecked=0, Total=1056 [2022-04-07 15:17:26,698 INFO L913 BasicCegarLoop]: 27 mSDtfsCounter, 37 mSDsluCounter, 253 mSDsCounter, 0 mSdLazyCounter, 466 mSolverCounterSat, 27 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 14.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 280 SdHoareTripleChecker+Invalid, 527 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 466 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 33 IncrementalHoareTripleChecker+Unchecked, 14.4s IncrementalHoareTripleChecker+Time [2022-04-07 15:17:26,698 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [39 Valid, 280 Invalid, 527 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 466 Invalid, 1 Unknown, 33 Unchecked, 14.4s Time] [2022-04-07 15:17:26,698 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2022-04-07 15:17:26,738 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 84. [2022-04-07 15:17:26,738 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 15:17:26,738 INFO L82 GeneralOperation]: Start isEquivalent. First operand 101 states. Second operand has 84 states, 60 states have (on average 1.1333333333333333) internal successors, (68), 63 states have internal predecessors, (68), 15 states have call successors, (15), 9 states have call predecessors, (15), 8 states have return successors, (14), 11 states have call predecessors, (14), 14 states have call successors, (14) [2022-04-07 15:17:26,739 INFO L74 IsIncluded]: Start isIncluded. First operand 101 states. Second operand has 84 states, 60 states have (on average 1.1333333333333333) internal successors, (68), 63 states have internal predecessors, (68), 15 states have call successors, (15), 9 states have call predecessors, (15), 8 states have return successors, (14), 11 states have call predecessors, (14), 14 states have call successors, (14) [2022-04-07 15:17:26,739 INFO L87 Difference]: Start difference. First operand 101 states. Second operand has 84 states, 60 states have (on average 1.1333333333333333) internal successors, (68), 63 states have internal predecessors, (68), 15 states have call successors, (15), 9 states have call predecessors, (15), 8 states have return successors, (14), 11 states have call predecessors, (14), 14 states have call successors, (14) [2022-04-07 15:17:26,742 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 15:17:26,742 INFO L93 Difference]: Finished difference Result 101 states and 118 transitions. [2022-04-07 15:17:26,742 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 118 transitions. [2022-04-07 15:17:26,743 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 15:17:26,743 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 15:17:26,743 INFO L74 IsIncluded]: Start isIncluded. First operand has 84 states, 60 states have (on average 1.1333333333333333) internal successors, (68), 63 states have internal predecessors, (68), 15 states have call successors, (15), 9 states have call predecessors, (15), 8 states have return successors, (14), 11 states have call predecessors, (14), 14 states have call successors, (14) Second operand 101 states. [2022-04-07 15:17:26,743 INFO L87 Difference]: Start difference. First operand has 84 states, 60 states have (on average 1.1333333333333333) internal successors, (68), 63 states have internal predecessors, (68), 15 states have call successors, (15), 9 states have call predecessors, (15), 8 states have return successors, (14), 11 states have call predecessors, (14), 14 states have call successors, (14) Second operand 101 states. [2022-04-07 15:17:26,747 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 15:17:26,747 INFO L93 Difference]: Finished difference Result 101 states and 118 transitions. [2022-04-07 15:17:26,747 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 118 transitions. [2022-04-07 15:17:26,747 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 15:17:26,747 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 15:17:26,747 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 15:17:26,747 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 15:17:26,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 60 states have (on average 1.1333333333333333) internal successors, (68), 63 states have internal predecessors, (68), 15 states have call successors, (15), 9 states have call predecessors, (15), 8 states have return successors, (14), 11 states have call predecessors, (14), 14 states have call successors, (14) [2022-04-07 15:17:26,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 97 transitions. [2022-04-07 15:17:26,751 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 97 transitions. Word has length 55 [2022-04-07 15:17:26,751 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 15:17:26,751 INFO L478 AbstractCegarLoop]: Abstraction has 84 states and 97 transitions. [2022-04-07 15:17:26,751 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 2.0) internal successors, (44), 20 states have internal predecessors, (44), 7 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (9), 5 states have call predecessors, (9), 5 states have call successors, (9) [2022-04-07 15:17:26,751 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 97 transitions. [2022-04-07 15:17:26,752 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2022-04-07 15:17:26,752 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 15:17:26,752 INFO L499 BasicCegarLoop]: trace histogram [5, 5, 5, 4, 4, 4, 4, 4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-07 15:17:26,781 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2022-04-07 15:17:26,967 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 15:17:26,968 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 15:17:26,968 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 15:17:26,968 INFO L85 PathProgramCache]: Analyzing trace with hash -699618950, now seen corresponding path program 2 times [2022-04-07 15:17:26,968 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 15:17:26,968 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1041813718] [2022-04-07 15:17:26,968 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 15:17:26,968 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 15:17:26,984 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-07 15:17:26,984 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1787178660] [2022-04-07 15:17:26,984 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-07 15:17:26,984 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 15:17:26,985 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-07 15:17:26,985 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-07 15:17:26,986 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-07 15:17:27,037 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-07 15:17:27,038 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-07 15:17:27,039 INFO L263 TraceCheckSpWp]: Trace formula consists of 159 conjuncts, 47 conjunts are in the unsatisfiable core [2022-04-07 15:17:27,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 15:17:27,060 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-07 15:20:47,465 WARN L232 SmtUtils]: Spent 5.60s on a formula simplification. DAG size of input: 3 DAG size of output: 1 (called from [L1067] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2022-04-07 15:22:38,584 INFO L272 TraceCheckUtils]: 0: Hoare triple {3364#true} call ULTIMATE.init(); {3364#true} is VALID [2022-04-07 15:22:38,584 INFO L290 TraceCheckUtils]: 1: Hoare triple {3364#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(13, 2);call #Ultimate.allocInit(12, 3); {3364#true} is VALID [2022-04-07 15:22:38,584 INFO L290 TraceCheckUtils]: 2: Hoare triple {3364#true} assume true; {3364#true} is VALID [2022-04-07 15:22:38,584 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3364#true} {3364#true} #71#return; {3364#true} is VALID [2022-04-07 15:22:38,584 INFO L272 TraceCheckUtils]: 4: Hoare triple {3364#true} call #t~ret6 := main(); {3364#true} is VALID [2022-04-07 15:22:38,584 INFO L290 TraceCheckUtils]: 5: Hoare triple {3364#true} havoc ~a~0;havoc ~b~0;havoc ~x~0;havoc ~y~0;havoc ~z~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~a~0 := #t~nondet4;havoc #t~nondet4; {3364#true} is VALID [2022-04-07 15:22:38,585 INFO L272 TraceCheckUtils]: 6: Hoare triple {3364#true} call assume_abort_if_not((if ~a~0 >= 0 && ~a~0 <= 100 then 1 else 0)); {3364#true} is VALID [2022-04-07 15:22:38,585 INFO L290 TraceCheckUtils]: 7: Hoare triple {3364#true} ~cond := #in~cond; {3364#true} is VALID [2022-04-07 15:22:38,585 INFO L290 TraceCheckUtils]: 8: Hoare triple {3364#true} assume !(0 == ~cond); {3364#true} is VALID [2022-04-07 15:22:38,585 INFO L290 TraceCheckUtils]: 9: Hoare triple {3364#true} assume true; {3364#true} is VALID [2022-04-07 15:22:38,585 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {3364#true} {3364#true} #61#return; {3364#true} is VALID [2022-04-07 15:22:38,585 INFO L290 TraceCheckUtils]: 11: Hoare triple {3364#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~b~0 := #t~nondet5;havoc #t~nondet5; {3364#true} is VALID [2022-04-07 15:22:38,585 INFO L272 TraceCheckUtils]: 12: Hoare triple {3364#true} call assume_abort_if_not((if ~b~0 >= 0 && ~b~0 <= 100 then 1 else 0)); {3364#true} is VALID [2022-04-07 15:22:38,585 INFO L290 TraceCheckUtils]: 13: Hoare triple {3364#true} ~cond := #in~cond; {3364#true} is VALID [2022-04-07 15:22:38,585 INFO L290 TraceCheckUtils]: 14: Hoare triple {3364#true} assume !(0 == ~cond); {3364#true} is VALID [2022-04-07 15:22:38,585 INFO L290 TraceCheckUtils]: 15: Hoare triple {3364#true} assume true; {3364#true} is VALID [2022-04-07 15:22:38,585 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {3364#true} {3364#true} #63#return; {3364#true} is VALID [2022-04-07 15:22:38,585 INFO L272 TraceCheckUtils]: 17: Hoare triple {3364#true} call assume_abort_if_not((if ~b~0 >= 1 then 1 else 0)); {3364#true} is VALID [2022-04-07 15:22:38,585 INFO L290 TraceCheckUtils]: 18: Hoare triple {3364#true} ~cond := #in~cond; {3364#true} is VALID [2022-04-07 15:22:38,585 INFO L290 TraceCheckUtils]: 19: Hoare triple {3364#true} assume !(0 == ~cond); {3364#true} is VALID [2022-04-07 15:22:38,585 INFO L290 TraceCheckUtils]: 20: Hoare triple {3364#true} assume true; {3364#true} is VALID [2022-04-07 15:22:38,585 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {3364#true} {3364#true} #65#return; {3364#true} is VALID [2022-04-07 15:22:38,586 INFO L290 TraceCheckUtils]: 22: Hoare triple {3364#true} ~x~0 := ~a~0;~y~0 := ~b~0;~z~0 := 0; {3435#(and (= main_~z~0 0) (= main_~b~0 main_~y~0) (= main_~a~0 main_~x~0))} is VALID [2022-04-07 15:22:38,586 INFO L290 TraceCheckUtils]: 23: Hoare triple {3435#(and (= main_~z~0 0) (= main_~b~0 main_~y~0) (= main_~a~0 main_~x~0))} assume !false; {3435#(and (= main_~z~0 0) (= main_~b~0 main_~y~0) (= main_~a~0 main_~x~0))} is VALID [2022-04-07 15:22:38,586 INFO L272 TraceCheckUtils]: 24: Hoare triple {3435#(and (= main_~z~0 0) (= main_~b~0 main_~y~0) (= main_~a~0 main_~x~0))} call __VERIFIER_assert((if ~z~0 + ~x~0 * ~y~0 == ~a~0 * ~b~0 then 1 else 0)); {3364#true} is VALID [2022-04-07 15:22:38,586 INFO L290 TraceCheckUtils]: 25: Hoare triple {3364#true} ~cond := #in~cond; {3364#true} is VALID [2022-04-07 15:22:38,586 INFO L290 TraceCheckUtils]: 26: Hoare triple {3364#true} assume !(0 == ~cond); {3364#true} is VALID [2022-04-07 15:22:38,586 INFO L290 TraceCheckUtils]: 27: Hoare triple {3364#true} assume true; {3364#true} is VALID [2022-04-07 15:22:38,587 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {3364#true} {3435#(and (= main_~z~0 0) (= main_~b~0 main_~y~0) (= main_~a~0 main_~x~0))} #67#return; {3435#(and (= main_~z~0 0) (= main_~b~0 main_~y~0) (= main_~a~0 main_~x~0))} is VALID [2022-04-07 15:22:38,587 INFO L290 TraceCheckUtils]: 29: Hoare triple {3435#(and (= main_~z~0 0) (= main_~b~0 main_~y~0) (= main_~a~0 main_~x~0))} assume !!(0 != ~y~0); {3457#(and (= main_~z~0 0) (not (= main_~y~0 0)) (= main_~b~0 main_~y~0) (= main_~a~0 main_~x~0))} is VALID [2022-04-07 15:22:38,588 INFO L290 TraceCheckUtils]: 30: Hoare triple {3457#(and (= main_~z~0 0) (not (= main_~y~0 0)) (= main_~b~0 main_~y~0) (= main_~a~0 main_~x~0))} assume 1 == (if ~y~0 < 0 && 0 != ~y~0 % 2 then ~y~0 % 2 - 2 else ~y~0 % 2);~z~0 := ~z~0 + ~x~0;~y~0 := ~y~0 - 1; {3461#(and (<= 1 (mod (+ main_~y~0 1) 2)) (= main_~b~0 (+ main_~y~0 1)) (= main_~z~0 main_~x~0) (= main_~a~0 main_~x~0) (<= 0 (+ main_~y~0 1)))} is VALID [2022-04-07 15:22:38,590 INFO L290 TraceCheckUtils]: 31: Hoare triple {3461#(and (<= 1 (mod (+ main_~y~0 1) 2)) (= main_~b~0 (+ main_~y~0 1)) (= main_~z~0 main_~x~0) (= main_~a~0 main_~x~0) (<= 0 (+ main_~y~0 1)))} ~x~0 := 2 * ~x~0;~y~0 := (if ~y~0 < 0 && 0 != ~y~0 % 2 then 1 + ~y~0 / 2 else ~y~0 / 2); {3465#(and (= main_~a~0 main_~z~0) (<= 1 (mod main_~b~0 2)) (= main_~x~0 (* main_~z~0 2)) (<= 0 main_~b~0) (= (div (+ (- 1) main_~b~0) 2) main_~y~0))} is VALID [2022-04-07 15:22:38,590 INFO L290 TraceCheckUtils]: 32: Hoare triple {3465#(and (= main_~a~0 main_~z~0) (<= 1 (mod main_~b~0 2)) (= main_~x~0 (* main_~z~0 2)) (<= 0 main_~b~0) (= (div (+ (- 1) main_~b~0) 2) main_~y~0))} assume !false; {3465#(and (= main_~a~0 main_~z~0) (<= 1 (mod main_~b~0 2)) (= main_~x~0 (* main_~z~0 2)) (<= 0 main_~b~0) (= (div (+ (- 1) main_~b~0) 2) main_~y~0))} is VALID [2022-04-07 15:22:38,590 INFO L272 TraceCheckUtils]: 33: Hoare triple {3465#(and (= main_~a~0 main_~z~0) (<= 1 (mod main_~b~0 2)) (= main_~x~0 (* main_~z~0 2)) (<= 0 main_~b~0) (= (div (+ (- 1) main_~b~0) 2) main_~y~0))} call __VERIFIER_assert((if ~z~0 + ~x~0 * ~y~0 == ~a~0 * ~b~0 then 1 else 0)); {3364#true} is VALID [2022-04-07 15:22:38,591 INFO L290 TraceCheckUtils]: 34: Hoare triple {3364#true} ~cond := #in~cond; {3475#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-07 15:22:38,591 INFO L290 TraceCheckUtils]: 35: Hoare triple {3475#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {3479#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-07 15:22:38,591 INFO L290 TraceCheckUtils]: 36: Hoare triple {3479#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {3479#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-07 15:22:38,592 INFO L284 TraceCheckUtils]: 37: Hoare quadruple {3479#(not (= |__VERIFIER_assert_#in~cond| 0))} {3465#(and (= main_~a~0 main_~z~0) (<= 1 (mod main_~b~0 2)) (= main_~x~0 (* main_~z~0 2)) (<= 0 main_~b~0) (= (div (+ (- 1) main_~b~0) 2) main_~y~0))} #67#return; {3486#(and (<= 1 (mod main_~b~0 2)) (= (+ main_~z~0 (* main_~y~0 main_~x~0)) (* main_~b~0 main_~a~0)) (= main_~x~0 (* main_~z~0 2)) (<= 0 main_~b~0) (= (div (+ (- 1) main_~b~0) 2) main_~y~0))} is VALID [2022-04-07 15:22:38,592 INFO L290 TraceCheckUtils]: 38: Hoare triple {3486#(and (<= 1 (mod main_~b~0 2)) (= (+ main_~z~0 (* main_~y~0 main_~x~0)) (* main_~b~0 main_~a~0)) (= main_~x~0 (* main_~z~0 2)) (<= 0 main_~b~0) (= (div (+ (- 1) main_~b~0) 2) main_~y~0))} assume !!(0 != ~y~0); {3490#(and (not (= main_~y~0 0)) (<= 1 (mod main_~b~0 2)) (= (+ main_~z~0 (* main_~y~0 main_~x~0)) (* main_~b~0 main_~a~0)) (= main_~x~0 (* main_~z~0 2)) (<= 0 main_~b~0) (= (div (+ (- 1) main_~b~0) 2) main_~y~0))} is VALID [2022-04-07 15:22:38,594 INFO L290 TraceCheckUtils]: 39: Hoare triple {3490#(and (not (= main_~y~0 0)) (<= 1 (mod main_~b~0 2)) (= (+ main_~z~0 (* main_~y~0 main_~x~0)) (* main_~b~0 main_~a~0)) (= main_~x~0 (* main_~z~0 2)) (<= 0 main_~b~0) (= (div (+ (- 1) main_~b~0) 2) main_~y~0))} assume !(1 == (if ~y~0 < 0 && 0 != ~y~0 % 2 then ~y~0 % 2 - 2 else ~y~0 % 2)); {3494#(and (not (= main_~y~0 0)) (<= 1 (mod main_~b~0 2)) (= (+ main_~z~0 (* main_~y~0 main_~x~0)) (* main_~b~0 main_~a~0)) (not (= (mod main_~y~0 2) 1)) (= main_~x~0 (* main_~z~0 2)) (<= 0 main_~b~0) (= (div (+ (- 1) main_~b~0) 2) main_~y~0))} is VALID [2022-04-07 15:22:38,597 INFO L290 TraceCheckUtils]: 40: Hoare triple {3494#(and (not (= main_~y~0 0)) (<= 1 (mod main_~b~0 2)) (= (+ main_~z~0 (* main_~y~0 main_~x~0)) (* main_~b~0 main_~a~0)) (not (= (mod main_~y~0 2) 1)) (= main_~x~0 (* main_~z~0 2)) (<= 0 main_~b~0) (= (div (+ (- 1) main_~b~0) 2) main_~y~0))} ~x~0 := 2 * ~x~0;~y~0 := (if ~y~0 < 0 && 0 != ~y~0 % 2 then 1 + ~y~0 / 2 else ~y~0 / 2); {3498#(and (<= 1 (mod main_~b~0 2)) (not (= (div (+ (- 1) main_~b~0) 2) 0)) (= (div (div (+ (- 1) main_~b~0) 2) 2) main_~y~0) (= (+ (* (div (+ (- 1) main_~b~0) 2) (* main_~z~0 2)) main_~z~0) (* main_~b~0 main_~a~0)) (<= 0 main_~b~0) (not (= (mod (div (+ (- 1) main_~b~0) 2) 2) 1)) (= (* main_~z~0 4) main_~x~0))} is VALID [2022-04-07 15:22:38,597 INFO L290 TraceCheckUtils]: 41: Hoare triple {3498#(and (<= 1 (mod main_~b~0 2)) (not (= (div (+ (- 1) main_~b~0) 2) 0)) (= (div (div (+ (- 1) main_~b~0) 2) 2) main_~y~0) (= (+ (* (div (+ (- 1) main_~b~0) 2) (* main_~z~0 2)) main_~z~0) (* main_~b~0 main_~a~0)) (<= 0 main_~b~0) (not (= (mod (div (+ (- 1) main_~b~0) 2) 2) 1)) (= (* main_~z~0 4) main_~x~0))} assume !false; {3498#(and (<= 1 (mod main_~b~0 2)) (not (= (div (+ (- 1) main_~b~0) 2) 0)) (= (div (div (+ (- 1) main_~b~0) 2) 2) main_~y~0) (= (+ (* (div (+ (- 1) main_~b~0) 2) (* main_~z~0 2)) main_~z~0) (* main_~b~0 main_~a~0)) (<= 0 main_~b~0) (not (= (mod (div (+ (- 1) main_~b~0) 2) 2) 1)) (= (* main_~z~0 4) main_~x~0))} is VALID [2022-04-07 15:22:38,597 INFO L272 TraceCheckUtils]: 42: Hoare triple {3498#(and (<= 1 (mod main_~b~0 2)) (not (= (div (+ (- 1) main_~b~0) 2) 0)) (= (div (div (+ (- 1) main_~b~0) 2) 2) main_~y~0) (= (+ (* (div (+ (- 1) main_~b~0) 2) (* main_~z~0 2)) main_~z~0) (* main_~b~0 main_~a~0)) (<= 0 main_~b~0) (not (= (mod (div (+ (- 1) main_~b~0) 2) 2) 1)) (= (* main_~z~0 4) main_~x~0))} call __VERIFIER_assert((if ~z~0 + ~x~0 * ~y~0 == ~a~0 * ~b~0 then 1 else 0)); {3364#true} is VALID [2022-04-07 15:22:38,598 INFO L290 TraceCheckUtils]: 43: Hoare triple {3364#true} ~cond := #in~cond; {3475#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-07 15:22:38,598 INFO L290 TraceCheckUtils]: 44: Hoare triple {3475#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {3479#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-07 15:22:38,598 INFO L290 TraceCheckUtils]: 45: Hoare triple {3479#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {3479#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-07 15:22:38,599 INFO L284 TraceCheckUtils]: 46: Hoare quadruple {3479#(not (= |__VERIFIER_assert_#in~cond| 0))} {3498#(and (<= 1 (mod main_~b~0 2)) (not (= (div (+ (- 1) main_~b~0) 2) 0)) (= (div (div (+ (- 1) main_~b~0) 2) 2) main_~y~0) (= (+ (* (div (+ (- 1) main_~b~0) 2) (* main_~z~0 2)) main_~z~0) (* main_~b~0 main_~a~0)) (<= 0 main_~b~0) (not (= (mod (div (+ (- 1) main_~b~0) 2) 2) 1)) (= (* main_~z~0 4) main_~x~0))} #67#return; {3498#(and (<= 1 (mod main_~b~0 2)) (not (= (div (+ (- 1) main_~b~0) 2) 0)) (= (div (div (+ (- 1) main_~b~0) 2) 2) main_~y~0) (= (+ (* (div (+ (- 1) main_~b~0) 2) (* main_~z~0 2)) main_~z~0) (* main_~b~0 main_~a~0)) (<= 0 main_~b~0) (not (= (mod (div (+ (- 1) main_~b~0) 2) 2) 1)) (= (* main_~z~0 4) main_~x~0))} is VALID [2022-04-07 15:22:38,599 INFO L290 TraceCheckUtils]: 47: Hoare triple {3498#(and (<= 1 (mod main_~b~0 2)) (not (= (div (+ (- 1) main_~b~0) 2) 0)) (= (div (div (+ (- 1) main_~b~0) 2) 2) main_~y~0) (= (+ (* (div (+ (- 1) main_~b~0) 2) (* main_~z~0 2)) main_~z~0) (* main_~b~0 main_~a~0)) (<= 0 main_~b~0) (not (= (mod (div (+ (- 1) main_~b~0) 2) 2) 1)) (= (* main_~z~0 4) main_~x~0))} assume !!(0 != ~y~0); {3498#(and (<= 1 (mod main_~b~0 2)) (not (= (div (+ (- 1) main_~b~0) 2) 0)) (= (div (div (+ (- 1) main_~b~0) 2) 2) main_~y~0) (= (+ (* (div (+ (- 1) main_~b~0) 2) (* main_~z~0 2)) main_~z~0) (* main_~b~0 main_~a~0)) (<= 0 main_~b~0) (not (= (mod (div (+ (- 1) main_~b~0) 2) 2) 1)) (= (* main_~z~0 4) main_~x~0))} is VALID [2022-04-07 15:22:38,601 INFO L290 TraceCheckUtils]: 48: Hoare triple {3498#(and (<= 1 (mod main_~b~0 2)) (not (= (div (+ (- 1) main_~b~0) 2) 0)) (= (div (div (+ (- 1) main_~b~0) 2) 2) main_~y~0) (= (+ (* (div (+ (- 1) main_~b~0) 2) (* main_~z~0 2)) main_~z~0) (* main_~b~0 main_~a~0)) (<= 0 main_~b~0) (not (= (mod (div (+ (- 1) main_~b~0) 2) 2) 1)) (= (* main_~z~0 4) main_~x~0))} assume !(1 == (if ~y~0 < 0 && 0 != ~y~0 % 2 then ~y~0 % 2 - 2 else ~y~0 % 2)); {3523#(and (<= 1 (mod main_~b~0 2)) (not (= (mod main_~y~0 2) 1)) (not (= (div (+ (- 1) main_~b~0) 2) 0)) (= (+ main_~z~0 (* (* (div (+ (- 1) main_~b~0) 2) main_~z~0) 2)) (* main_~b~0 main_~a~0)) (= (div (div (+ (- 1) main_~b~0) 2) 2) main_~y~0) (<= 0 main_~b~0) (not (= (mod (div (+ (- 1) main_~b~0) 2) 2) 1)) (= (* main_~z~0 4) main_~x~0))} is VALID [2022-04-07 15:22:38,602 INFO L290 TraceCheckUtils]: 49: Hoare triple {3523#(and (<= 1 (mod main_~b~0 2)) (not (= (mod main_~y~0 2) 1)) (not (= (div (+ (- 1) main_~b~0) 2) 0)) (= (+ main_~z~0 (* (* (div (+ (- 1) main_~b~0) 2) main_~z~0) 2)) (* main_~b~0 main_~a~0)) (= (div (div (+ (- 1) main_~b~0) 2) 2) main_~y~0) (<= 0 main_~b~0) (not (= (mod (div (+ (- 1) main_~b~0) 2) 2) 1)) (= (* main_~z~0 4) main_~x~0))} ~x~0 := 2 * ~x~0;~y~0 := (if ~y~0 < 0 && 0 != ~y~0 % 2 then 1 + ~y~0 / 2 else ~y~0 / 2); {3527#(and (<= 1 (mod main_~b~0 2)) (= (div (div (div (+ (- 1) main_~b~0) 2) 2) 2) main_~y~0) (not (= (div (+ (- 1) main_~b~0) 2) 0)) (not (= (mod (div (div (+ (- 1) main_~b~0) 2) 2) 2) 1)) (= (+ main_~z~0 (* (* (div (+ (- 1) main_~b~0) 2) main_~z~0) 2)) (* main_~b~0 main_~a~0)) (<= 0 main_~b~0) (not (= (mod (div (+ (- 1) main_~b~0) 2) 2) 1)) (= main_~x~0 (* main_~z~0 8)))} is VALID [2022-04-07 15:22:38,603 INFO L290 TraceCheckUtils]: 50: Hoare triple {3527#(and (<= 1 (mod main_~b~0 2)) (= (div (div (div (+ (- 1) main_~b~0) 2) 2) 2) main_~y~0) (not (= (div (+ (- 1) main_~b~0) 2) 0)) (not (= (mod (div (div (+ (- 1) main_~b~0) 2) 2) 2) 1)) (= (+ main_~z~0 (* (* (div (+ (- 1) main_~b~0) 2) main_~z~0) 2)) (* main_~b~0 main_~a~0)) (<= 0 main_~b~0) (not (= (mod (div (+ (- 1) main_~b~0) 2) 2) 1)) (= main_~x~0 (* main_~z~0 8)))} assume !false; {3527#(and (<= 1 (mod main_~b~0 2)) (= (div (div (div (+ (- 1) main_~b~0) 2) 2) 2) main_~y~0) (not (= (div (+ (- 1) main_~b~0) 2) 0)) (not (= (mod (div (div (+ (- 1) main_~b~0) 2) 2) 2) 1)) (= (+ main_~z~0 (* (* (div (+ (- 1) main_~b~0) 2) main_~z~0) 2)) (* main_~b~0 main_~a~0)) (<= 0 main_~b~0) (not (= (mod (div (+ (- 1) main_~b~0) 2) 2) 1)) (= main_~x~0 (* main_~z~0 8)))} is VALID [2022-04-07 15:22:38,603 INFO L272 TraceCheckUtils]: 51: Hoare triple {3527#(and (<= 1 (mod main_~b~0 2)) (= (div (div (div (+ (- 1) main_~b~0) 2) 2) 2) main_~y~0) (not (= (div (+ (- 1) main_~b~0) 2) 0)) (not (= (mod (div (div (+ (- 1) main_~b~0) 2) 2) 2) 1)) (= (+ main_~z~0 (* (* (div (+ (- 1) main_~b~0) 2) main_~z~0) 2)) (* main_~b~0 main_~a~0)) (<= 0 main_~b~0) (not (= (mod (div (+ (- 1) main_~b~0) 2) 2) 1)) (= main_~x~0 (* main_~z~0 8)))} call __VERIFIER_assert((if ~z~0 + ~x~0 * ~y~0 == ~a~0 * ~b~0 then 1 else 0)); {3364#true} is VALID [2022-04-07 15:22:38,603 INFO L290 TraceCheckUtils]: 52: Hoare triple {3364#true} ~cond := #in~cond; {3364#true} is VALID [2022-04-07 15:22:38,603 INFO L290 TraceCheckUtils]: 53: Hoare triple {3364#true} assume !(0 == ~cond); {3364#true} is VALID [2022-04-07 15:22:38,603 INFO L290 TraceCheckUtils]: 54: Hoare triple {3364#true} assume true; {3364#true} is VALID [2022-04-07 15:22:38,604 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {3364#true} {3527#(and (<= 1 (mod main_~b~0 2)) (= (div (div (div (+ (- 1) main_~b~0) 2) 2) 2) main_~y~0) (not (= (div (+ (- 1) main_~b~0) 2) 0)) (not (= (mod (div (div (+ (- 1) main_~b~0) 2) 2) 2) 1)) (= (+ main_~z~0 (* (* (div (+ (- 1) main_~b~0) 2) main_~z~0) 2)) (* main_~b~0 main_~a~0)) (<= 0 main_~b~0) (not (= (mod (div (+ (- 1) main_~b~0) 2) 2) 1)) (= main_~x~0 (* main_~z~0 8)))} #67#return; {3527#(and (<= 1 (mod main_~b~0 2)) (= (div (div (div (+ (- 1) main_~b~0) 2) 2) 2) main_~y~0) (not (= (div (+ (- 1) main_~b~0) 2) 0)) (not (= (mod (div (div (+ (- 1) main_~b~0) 2) 2) 2) 1)) (= (+ main_~z~0 (* (* (div (+ (- 1) main_~b~0) 2) main_~z~0) 2)) (* main_~b~0 main_~a~0)) (<= 0 main_~b~0) (not (= (mod (div (+ (- 1) main_~b~0) 2) 2) 1)) (= main_~x~0 (* main_~z~0 8)))} is VALID [2022-04-07 15:22:38,605 INFO L290 TraceCheckUtils]: 56: Hoare triple {3527#(and (<= 1 (mod main_~b~0 2)) (= (div (div (div (+ (- 1) main_~b~0) 2) 2) 2) main_~y~0) (not (= (div (+ (- 1) main_~b~0) 2) 0)) (not (= (mod (div (div (+ (- 1) main_~b~0) 2) 2) 2) 1)) (= (+ main_~z~0 (* (* (div (+ (- 1) main_~b~0) 2) main_~z~0) 2)) (* main_~b~0 main_~a~0)) (<= 0 main_~b~0) (not (= (mod (div (+ (- 1) main_~b~0) 2) 2) 1)) (= main_~x~0 (* main_~z~0 8)))} assume !!(0 != ~y~0); {3527#(and (<= 1 (mod main_~b~0 2)) (= (div (div (div (+ (- 1) main_~b~0) 2) 2) 2) main_~y~0) (not (= (div (+ (- 1) main_~b~0) 2) 0)) (not (= (mod (div (div (+ (- 1) main_~b~0) 2) 2) 2) 1)) (= (+ main_~z~0 (* (* (div (+ (- 1) main_~b~0) 2) main_~z~0) 2)) (* main_~b~0 main_~a~0)) (<= 0 main_~b~0) (not (= (mod (div (+ (- 1) main_~b~0) 2) 2) 1)) (= main_~x~0 (* main_~z~0 8)))} is VALID [2022-04-07 15:22:38,607 INFO L290 TraceCheckUtils]: 57: Hoare triple {3527#(and (<= 1 (mod main_~b~0 2)) (= (div (div (div (+ (- 1) main_~b~0) 2) 2) 2) main_~y~0) (not (= (div (+ (- 1) main_~b~0) 2) 0)) (not (= (mod (div (div (+ (- 1) main_~b~0) 2) 2) 2) 1)) (= (+ main_~z~0 (* (* (div (+ (- 1) main_~b~0) 2) main_~z~0) 2)) (* main_~b~0 main_~a~0)) (<= 0 main_~b~0) (not (= (mod (div (+ (- 1) main_~b~0) 2) 2) 1)) (= main_~x~0 (* main_~z~0 8)))} assume !(1 == (if ~y~0 < 0 && 0 != ~y~0 % 2 then ~y~0 % 2 - 2 else ~y~0 % 2)); {3552#(and (<= 1 (mod main_~b~0 2)) (not (= (mod main_~y~0 2) 1)) (= (div (div (div (+ (- 1) main_~b~0) 2) 2) 2) main_~y~0) (not (= (div (+ (- 1) main_~b~0) 2) 0)) (not (= (mod (div (div (+ (- 1) main_~b~0) 2) 2) 2) 1)) (= (+ main_~z~0 (* (* (div (+ (- 1) main_~b~0) 2) main_~z~0) 2)) (* main_~b~0 main_~a~0)) (<= 0 main_~b~0) (not (= (mod (div (+ (- 1) main_~b~0) 2) 2) 1)) (= main_~x~0 (* main_~z~0 8)))} is VALID [2022-04-07 15:22:38,609 INFO L290 TraceCheckUtils]: 58: Hoare triple {3552#(and (<= 1 (mod main_~b~0 2)) (not (= (mod main_~y~0 2) 1)) (= (div (div (div (+ (- 1) main_~b~0) 2) 2) 2) main_~y~0) (not (= (div (+ (- 1) main_~b~0) 2) 0)) (not (= (mod (div (div (+ (- 1) main_~b~0) 2) 2) 2) 1)) (= (+ main_~z~0 (* (* (div (+ (- 1) main_~b~0) 2) main_~z~0) 2)) (* main_~b~0 main_~a~0)) (<= 0 main_~b~0) (not (= (mod (div (+ (- 1) main_~b~0) 2) 2) 1)) (= main_~x~0 (* main_~z~0 8)))} ~x~0 := 2 * ~x~0;~y~0 := (if ~y~0 < 0 && 0 != ~y~0 % 2 then 1 + ~y~0 / 2 else ~y~0 / 2); {3556#(and (= (* main_~z~0 16) main_~x~0) (= (div (div (div (div (+ (- 1) main_~b~0) 2) 2) 2) 2) main_~y~0) (<= 1 (mod main_~b~0 2)) (not (= (div (+ (- 1) main_~b~0) 2) 0)) (not (= (mod (div (div (+ (- 1) main_~b~0) 2) 2) 2) 1)) (= (+ main_~z~0 (* (* (div (+ (- 1) main_~b~0) 2) main_~z~0) 2)) (* main_~b~0 main_~a~0)) (not (= (mod (div (div (div (+ (- 1) main_~b~0) 2) 2) 2) 2) 1)) (<= 0 main_~b~0) (not (= (mod (div (+ (- 1) main_~b~0) 2) 2) 1)))} is VALID [2022-04-07 15:22:38,610 INFO L290 TraceCheckUtils]: 59: Hoare triple {3556#(and (= (* main_~z~0 16) main_~x~0) (= (div (div (div (div (+ (- 1) main_~b~0) 2) 2) 2) 2) main_~y~0) (<= 1 (mod main_~b~0 2)) (not (= (div (+ (- 1) main_~b~0) 2) 0)) (not (= (mod (div (div (+ (- 1) main_~b~0) 2) 2) 2) 1)) (= (+ main_~z~0 (* (* (div (+ (- 1) main_~b~0) 2) main_~z~0) 2)) (* main_~b~0 main_~a~0)) (not (= (mod (div (div (div (+ (- 1) main_~b~0) 2) 2) 2) 2) 1)) (<= 0 main_~b~0) (not (= (mod (div (+ (- 1) main_~b~0) 2) 2) 1)))} assume !false; {3556#(and (= (* main_~z~0 16) main_~x~0) (= (div (div (div (div (+ (- 1) main_~b~0) 2) 2) 2) 2) main_~y~0) (<= 1 (mod main_~b~0 2)) (not (= (div (+ (- 1) main_~b~0) 2) 0)) (not (= (mod (div (div (+ (- 1) main_~b~0) 2) 2) 2) 1)) (= (+ main_~z~0 (* (* (div (+ (- 1) main_~b~0) 2) main_~z~0) 2)) (* main_~b~0 main_~a~0)) (not (= (mod (div (div (div (+ (- 1) main_~b~0) 2) 2) 2) 2) 1)) (<= 0 main_~b~0) (not (= (mod (div (+ (- 1) main_~b~0) 2) 2) 1)))} is VALID [2022-04-07 15:22:38,626 INFO L272 TraceCheckUtils]: 60: Hoare triple {3556#(and (= (* main_~z~0 16) main_~x~0) (= (div (div (div (div (+ (- 1) main_~b~0) 2) 2) 2) 2) main_~y~0) (<= 1 (mod main_~b~0 2)) (not (= (div (+ (- 1) main_~b~0) 2) 0)) (not (= (mod (div (div (+ (- 1) main_~b~0) 2) 2) 2) 1)) (= (+ main_~z~0 (* (* (div (+ (- 1) main_~b~0) 2) main_~z~0) 2)) (* main_~b~0 main_~a~0)) (not (= (mod (div (div (div (+ (- 1) main_~b~0) 2) 2) 2) 2) 1)) (<= 0 main_~b~0) (not (= (mod (div (+ (- 1) main_~b~0) 2) 2) 1)))} call __VERIFIER_assert((if ~z~0 + ~x~0 * ~y~0 == ~a~0 * ~b~0 then 1 else 0)); {3563#(exists ((v_main_~a~0_BEFORE_CALL_25 Int) (aux_mod_aux_div_aux_mod_aux_mod_aux_mod_v_main_~b~0_BEFORE_CALL_26_34_99_115_139_80 Int) (aux_mod_aux_div_aux_div_aux_mod_aux_mod_aux_mod_v_main_~b~0_BEFORE_CALL_26_34_99_115_139_80_91 Int) (v_main_~z~0_BEFORE_CALL_22 Int) (aux_mod_aux_div_aux_mod_aux_mod_aux_mod_aux_mod_v_main_~b~0_BEFORE_CALL_26_34_99_115_139_502_92 Int) (aux_div_aux_div_aux_mod_aux_mod_v_main_~b~0_BEFORE_CALL_26_34_99_115_68 Int) (aux_mod_aux_mod_aux_mod_aux_mod_aux_mod_aux_mod_v_main_~b~0_BEFORE_CALL_26_34_99_115_139_502_187 Int) (aux_mod_aux_div_aux_div_aux_mod_aux_mod_aux_mod_aux_mod_v_main_~b~0_BEFORE_CALL_26_34_99_115_139_502_92_103 Int) (aux_mod_aux_div_aux_mod_aux_mod_v_main_~b~0_BEFORE_CALL_26_34_99_115_68 Int) (aux_div_aux_mod_aux_mod_aux_mod_aux_mod_aux_mod_v_main_~b~0_BEFORE_CALL_26_34_99_115_139_502_187 Int) (aux_div_aux_mod_v_main_~b~0_BEFORE_CALL_26_34_99 Int) (aux_mod_aux_div_aux_div_aux_div_aux_mod_aux_mod_aux_mod_v_main_~b~0_BEFORE_CALL_26_34_99_115_139_80_91_102 Int) (aux_div_aux_div_aux_div_aux_mod_aux_mod_aux_mod_aux_mod_v_main_~b~0_BEFORE_CALL_26_34_99_115_139_502_92_103 Int) (aux_div_aux_div_aux_div_aux_div_aux_mod_aux_mod_aux_mod_v_main_~b~0_BEFORE_CALL_26_34_99_115_139_80_91_102 Int) (aux_div_v_main_~b~0_BEFORE_CALL_26_34 Int)) (and (< aux_mod_aux_div_aux_div_aux_div_aux_mod_aux_mod_aux_mod_v_main_~b~0_BEFORE_CALL_26_34_99_115_139_80_91_102 2) (< (+ aux_mod_aux_mod_aux_mod_aux_mod_aux_mod_aux_mod_v_main_~b~0_BEFORE_CALL_26_34_99_115_139_502_187 (* 2 aux_div_aux_mod_aux_mod_aux_mod_aux_mod_aux_mod_v_main_~b~0_BEFORE_CALL_26_34_99_115_139_502_187)) (+ (* aux_div_v_main_~b~0_BEFORE_CALL_26_34 2) 1)) (not (= aux_mod_aux_div_aux_div_aux_div_aux_mod_aux_mod_aux_mod_v_main_~b~0_BEFORE_CALL_26_34_99_115_139_80_91_102 1)) (< aux_mod_aux_div_aux_mod_aux_mod_aux_mod_aux_mod_v_main_~b~0_BEFORE_CALL_26_34_99_115_139_502_92 2) (<= (* aux_div_v_main_~b~0_BEFORE_CALL_26_34 2) (+ aux_mod_aux_mod_aux_mod_aux_mod_aux_mod_aux_mod_v_main_~b~0_BEFORE_CALL_26_34_99_115_139_502_187 (* 2 aux_div_aux_mod_aux_mod_aux_mod_aux_mod_aux_mod_v_main_~b~0_BEFORE_CALL_26_34_99_115_139_502_187))) (<= 0 aux_mod_aux_div_aux_mod_aux_mod_aux_mod_v_main_~b~0_BEFORE_CALL_26_34_99_115_139_80) (< (+ aux_mod_aux_mod_aux_mod_aux_mod_aux_mod_aux_mod_v_main_~b~0_BEFORE_CALL_26_34_99_115_139_502_187 (* 2 aux_div_aux_mod_aux_mod_aux_mod_aux_mod_aux_mod_v_main_~b~0_BEFORE_CALL_26_34_99_115_139_502_187)) (+ 2 (* aux_div_aux_mod_v_main_~b~0_BEFORE_CALL_26_34_99 2))) (not (= aux_div_aux_mod_v_main_~b~0_BEFORE_CALL_26_34_99 0)) (<= (+ (* aux_div_aux_div_aux_div_aux_mod_aux_mod_aux_mod_aux_mod_v_main_~b~0_BEFORE_CALL_26_34_99_115_139_502_92_103 8) (* aux_mod_aux_div_aux_div_aux_mod_aux_mod_aux_mod_aux_mod_v_main_~b~0_BEFORE_CALL_26_34_99_115_139_502_92_103 4) (* 2 aux_mod_aux_div_aux_mod_aux_mod_aux_mod_aux_mod_v_main_~b~0_BEFORE_CALL_26_34_99_115_139_502_92)) (+ aux_mod_aux_mod_aux_mod_aux_mod_aux_mod_aux_mod_v_main_~b~0_BEFORE_CALL_26_34_99_115_139_502_187 (* 2 aux_div_aux_mod_aux_mod_aux_mod_aux_mod_aux_mod_v_main_~b~0_BEFORE_CALL_26_34_99_115_139_502_187))) (<= 0 (+ aux_mod_aux_mod_aux_mod_aux_mod_aux_mod_aux_mod_v_main_~b~0_BEFORE_CALL_26_34_99_115_139_502_187 (* 2 aux_div_aux_mod_aux_mod_aux_mod_aux_mod_aux_mod_v_main_~b~0_BEFORE_CALL_26_34_99_115_139_502_187) 1)) (< (+ aux_mod_aux_mod_aux_mod_aux_mod_aux_mod_aux_mod_v_main_~b~0_BEFORE_CALL_26_34_99_115_139_502_187 (* 2 aux_div_aux_mod_aux_mod_aux_mod_aux_mod_aux_mod_v_main_~b~0_BEFORE_CALL_26_34_99_115_139_502_187)) (+ (* aux_mod_aux_div_aux_mod_aux_mod_aux_mod_v_main_~b~0_BEFORE_CALL_26_34_99_115_139_80 2) (* 16 aux_div_aux_div_aux_div_aux_div_aux_mod_aux_mod_aux_mod_v_main_~b~0_BEFORE_CALL_26_34_99_115_139_80_91_102) (* 8 aux_mod_aux_div_aux_div_aux_div_aux_mod_aux_mod_aux_mod_v_main_~b~0_BEFORE_CALL_26_34_99_115_139_80_91_102) 2 (* aux_mod_aux_div_aux_div_aux_mod_aux_mod_aux_mod_v_main_~b~0_BEFORE_CALL_26_34_99_115_139_80_91 4))) (= (+ v_main_~z~0_BEFORE_CALL_22 (* 2 (* v_main_~z~0_BEFORE_CALL_22 aux_div_aux_mod_aux_mod_aux_mod_aux_mod_aux_mod_v_main_~b~0_BEFORE_CALL_26_34_99_115_139_502_187))) (+ v_main_~a~0_BEFORE_CALL_25 (* (* v_main_~a~0_BEFORE_CALL_25 (+ (* aux_mod_aux_div_aux_div_aux_mod_aux_mod_aux_mod_aux_mod_v_main_~b~0_BEFORE_CALL_26_34_99_115_139_502_92_103 2) aux_mod_aux_div_aux_mod_aux_mod_aux_mod_aux_mod_v_main_~b~0_BEFORE_CALL_26_34_99_115_139_502_92 (* aux_div_aux_div_aux_div_aux_mod_aux_mod_aux_mod_aux_mod_v_main_~b~0_BEFORE_CALL_26_34_99_115_139_502_92_103 4))) 2) (* v_main_~a~0_BEFORE_CALL_25 (+ (* (- 2) aux_mod_aux_div_aux_mod_aux_mod_aux_mod_aux_mod_v_main_~b~0_BEFORE_CALL_26_34_99_115_139_502_92) (* aux_mod_aux_div_aux_div_aux_mod_aux_mod_aux_mod_aux_mod_v_main_~b~0_BEFORE_CALL_26_34_99_115_139_502_92_103 (- 4)) aux_mod_aux_mod_aux_mod_aux_mod_aux_mod_aux_mod_v_main_~b~0_BEFORE_CALL_26_34_99_115_139_502_187 (* 2 aux_div_aux_mod_aux_mod_aux_mod_aux_mod_aux_mod_v_main_~b~0_BEFORE_CALL_26_34_99_115_139_502_187) (* aux_div_aux_div_aux_div_aux_mod_aux_mod_aux_mod_aux_mod_v_main_~b~0_BEFORE_CALL_26_34_99_115_139_502_92_103 (- 8)))))) (<= 0 aux_mod_aux_mod_aux_mod_aux_mod_aux_mod_aux_mod_v_main_~b~0_BEFORE_CALL_26_34_99_115_139_502_187) (<= 0 aux_mod_aux_div_aux_div_aux_mod_aux_mod_aux_mod_v_main_~b~0_BEFORE_CALL_26_34_99_115_139_80_91) (<= 0 aux_mod_aux_div_aux_div_aux_div_aux_mod_aux_mod_aux_mod_v_main_~b~0_BEFORE_CALL_26_34_99_115_139_80_91_102) (< aux_mod_aux_div_aux_mod_aux_mod_v_main_~b~0_BEFORE_CALL_26_34_99_115_68 2) (<= 0 aux_mod_aux_div_aux_mod_aux_mod_v_main_~b~0_BEFORE_CALL_26_34_99_115_68) (not (= aux_mod_aux_div_aux_div_aux_mod_aux_mod_aux_mod_aux_mod_v_main_~b~0_BEFORE_CALL_26_34_99_115_139_502_92_103 1)) (or (and (<= 0 |__VERIFIER_assert_#in~cond|) (not (= (+ (* 2 (* v_main_~a~0_BEFORE_CALL_25 aux_div_v_main_~b~0_BEFORE_CALL_26_34)) (* v_main_~a~0_BEFORE_CALL_25 (+ (* (- 2) aux_div_v_main_~b~0_BEFORE_CALL_26_34) aux_mod_aux_mod_aux_mod_aux_mod_aux_mod_aux_mod_v_main_~b~0_BEFORE_CALL_26_34_99_115_139_502_187 (* 2 aux_div_aux_mod_aux_mod_aux_mod_aux_mod_aux_mod_v_main_~b~0_BEFORE_CALL_26_34_99_115_139_502_187) 1))) (+ v_main_~z~0_BEFORE_CALL_22 (* 16 (* v_main_~z~0_BEFORE_CALL_22 (div (div (div (div (+ aux_mod_aux_mod_aux_mod_aux_mod_aux_mod_aux_mod_v_main_~b~0_BEFORE_CALL_26_34_99_115_139_502_187 (* 2 aux_div_aux_mod_aux_mod_aux_mod_aux_mod_aux_mod_v_main_~b~0_BEFORE_CALL_26_34_99_115_139_502_187)) 2) 2) 2) 2))))))) (<= 1 |__VERIFIER_assert_#in~cond|)) (not (= 1 aux_mod_aux_div_aux_mod_aux_mod_v_main_~b~0_BEFORE_CALL_26_34_99_115_68)) (<= 0 aux_mod_aux_div_aux_div_aux_mod_aux_mod_aux_mod_aux_mod_v_main_~b~0_BEFORE_CALL_26_34_99_115_139_502_92_103) (< aux_mod_aux_div_aux_div_aux_mod_aux_mod_aux_mod_aux_mod_v_main_~b~0_BEFORE_CALL_26_34_99_115_139_502_92_103 2) (<= (* aux_div_aux_mod_v_main_~b~0_BEFORE_CALL_26_34_99 2) (+ aux_mod_aux_mod_aux_mod_aux_mod_aux_mod_aux_mod_v_main_~b~0_BEFORE_CALL_26_34_99_115_139_502_187 (* 2 aux_div_aux_mod_aux_mod_aux_mod_aux_mod_aux_mod_v_main_~b~0_BEFORE_CALL_26_34_99_115_139_502_187))) (<= (+ (* 2 aux_mod_aux_div_aux_mod_aux_mod_v_main_~b~0_BEFORE_CALL_26_34_99_115_68) (* aux_div_aux_div_aux_mod_aux_mod_v_main_~b~0_BEFORE_CALL_26_34_99_115_68 4)) (+ aux_mod_aux_mod_aux_mod_aux_mod_aux_mod_aux_mod_v_main_~b~0_BEFORE_CALL_26_34_99_115_139_502_187 (* 2 aux_div_aux_mod_aux_mod_aux_mod_aux_mod_aux_mod_v_main_~b~0_BEFORE_CALL_26_34_99_115_139_502_187))) (<= (+ (* aux_mod_aux_div_aux_mod_aux_mod_aux_mod_v_main_~b~0_BEFORE_CALL_26_34_99_115_139_80 2) (* 16 aux_div_aux_div_aux_div_aux_div_aux_mod_aux_mod_aux_mod_v_main_~b~0_BEFORE_CALL_26_34_99_115_139_80_91_102) (* 8 aux_mod_aux_div_aux_div_aux_div_aux_mod_aux_mod_aux_mod_v_main_~b~0_BEFORE_CALL_26_34_99_115_139_80_91_102) (* aux_mod_aux_div_aux_div_aux_mod_aux_mod_aux_mod_v_main_~b~0_BEFORE_CALL_26_34_99_115_139_80_91 4)) (+ aux_mod_aux_mod_aux_mod_aux_mod_aux_mod_aux_mod_v_main_~b~0_BEFORE_CALL_26_34_99_115_139_502_187 (* 2 aux_div_aux_mod_aux_mod_aux_mod_aux_mod_aux_mod_v_main_~b~0_BEFORE_CALL_26_34_99_115_139_502_187))) (< aux_mod_aux_div_aux_mod_aux_mod_aux_mod_v_main_~b~0_BEFORE_CALL_26_34_99_115_139_80 2) (< (+ aux_mod_aux_mod_aux_mod_aux_mod_aux_mod_aux_mod_v_main_~b~0_BEFORE_CALL_26_34_99_115_139_502_187 (* 2 aux_div_aux_mod_aux_mod_aux_mod_aux_mod_aux_mod_v_main_~b~0_BEFORE_CALL_26_34_99_115_139_502_187)) (+ (* 2 aux_mod_aux_div_aux_mod_aux_mod_v_main_~b~0_BEFORE_CALL_26_34_99_115_68) 2 (* aux_div_aux_div_aux_mod_aux_mod_v_main_~b~0_BEFORE_CALL_26_34_99_115_68 4))) (< aux_mod_aux_div_aux_div_aux_mod_aux_mod_aux_mod_v_main_~b~0_BEFORE_CALL_26_34_99_115_139_80_91 2) (< aux_mod_aux_mod_aux_mod_aux_mod_aux_mod_aux_mod_v_main_~b~0_BEFORE_CALL_26_34_99_115_139_502_187 2) (<= 0 aux_mod_aux_div_aux_mod_aux_mod_aux_mod_aux_mod_v_main_~b~0_BEFORE_CALL_26_34_99_115_139_502_92) (< (+ aux_mod_aux_mod_aux_mod_aux_mod_aux_mod_aux_mod_v_main_~b~0_BEFORE_CALL_26_34_99_115_139_502_187 (* 2 aux_div_aux_mod_aux_mod_aux_mod_aux_mod_aux_mod_v_main_~b~0_BEFORE_CALL_26_34_99_115_139_502_187)) (+ (* aux_div_aux_div_aux_div_aux_mod_aux_mod_aux_mod_aux_mod_v_main_~b~0_BEFORE_CALL_26_34_99_115_139_502_92_103 8) 2 (* aux_mod_aux_div_aux_div_aux_mod_aux_mod_aux_mod_aux_mod_v_main_~b~0_BEFORE_CALL_26_34_99_115_139_502_92_103 4) (* 2 aux_mod_aux_div_aux_mod_aux_mod_aux_mod_aux_mod_v_main_~b~0_BEFORE_CALL_26_34_99_115_139_502_92)))))} is VALID [2022-04-07 15:22:40,633 WARN L290 TraceCheckUtils]: 61: Hoare triple {3563#(exists ((v_main_~a~0_BEFORE_CALL_25 Int) (aux_mod_aux_div_aux_mod_aux_mod_aux_mod_v_main_~b~0_BEFORE_CALL_26_34_99_115_139_80 Int) (aux_mod_aux_div_aux_div_aux_mod_aux_mod_aux_mod_v_main_~b~0_BEFORE_CALL_26_34_99_115_139_80_91 Int) (v_main_~z~0_BEFORE_CALL_22 Int) (aux_mod_aux_div_aux_mod_aux_mod_aux_mod_aux_mod_v_main_~b~0_BEFORE_CALL_26_34_99_115_139_502_92 Int) (aux_div_aux_div_aux_mod_aux_mod_v_main_~b~0_BEFORE_CALL_26_34_99_115_68 Int) (aux_mod_aux_mod_aux_mod_aux_mod_aux_mod_aux_mod_v_main_~b~0_BEFORE_CALL_26_34_99_115_139_502_187 Int) (aux_mod_aux_div_aux_div_aux_mod_aux_mod_aux_mod_aux_mod_v_main_~b~0_BEFORE_CALL_26_34_99_115_139_502_92_103 Int) (aux_mod_aux_div_aux_mod_aux_mod_v_main_~b~0_BEFORE_CALL_26_34_99_115_68 Int) (aux_div_aux_mod_aux_mod_aux_mod_aux_mod_aux_mod_v_main_~b~0_BEFORE_CALL_26_34_99_115_139_502_187 Int) (aux_div_aux_mod_v_main_~b~0_BEFORE_CALL_26_34_99 Int) (aux_mod_aux_div_aux_div_aux_div_aux_mod_aux_mod_aux_mod_v_main_~b~0_BEFORE_CALL_26_34_99_115_139_80_91_102 Int) (aux_div_aux_div_aux_div_aux_mod_aux_mod_aux_mod_aux_mod_v_main_~b~0_BEFORE_CALL_26_34_99_115_139_502_92_103 Int) (aux_div_aux_div_aux_div_aux_div_aux_mod_aux_mod_aux_mod_v_main_~b~0_BEFORE_CALL_26_34_99_115_139_80_91_102 Int) (aux_div_v_main_~b~0_BEFORE_CALL_26_34 Int)) (and (< aux_mod_aux_div_aux_div_aux_div_aux_mod_aux_mod_aux_mod_v_main_~b~0_BEFORE_CALL_26_34_99_115_139_80_91_102 2) (< (+ aux_mod_aux_mod_aux_mod_aux_mod_aux_mod_aux_mod_v_main_~b~0_BEFORE_CALL_26_34_99_115_139_502_187 (* 2 aux_div_aux_mod_aux_mod_aux_mod_aux_mod_aux_mod_v_main_~b~0_BEFORE_CALL_26_34_99_115_139_502_187)) (+ (* aux_div_v_main_~b~0_BEFORE_CALL_26_34 2) 1)) (not (= aux_mod_aux_div_aux_div_aux_div_aux_mod_aux_mod_aux_mod_v_main_~b~0_BEFORE_CALL_26_34_99_115_139_80_91_102 1)) (< aux_mod_aux_div_aux_mod_aux_mod_aux_mod_aux_mod_v_main_~b~0_BEFORE_CALL_26_34_99_115_139_502_92 2) (<= (* aux_div_v_main_~b~0_BEFORE_CALL_26_34 2) (+ aux_mod_aux_mod_aux_mod_aux_mod_aux_mod_aux_mod_v_main_~b~0_BEFORE_CALL_26_34_99_115_139_502_187 (* 2 aux_div_aux_mod_aux_mod_aux_mod_aux_mod_aux_mod_v_main_~b~0_BEFORE_CALL_26_34_99_115_139_502_187))) (<= 0 aux_mod_aux_div_aux_mod_aux_mod_aux_mod_v_main_~b~0_BEFORE_CALL_26_34_99_115_139_80) (< (+ aux_mod_aux_mod_aux_mod_aux_mod_aux_mod_aux_mod_v_main_~b~0_BEFORE_CALL_26_34_99_115_139_502_187 (* 2 aux_div_aux_mod_aux_mod_aux_mod_aux_mod_aux_mod_v_main_~b~0_BEFORE_CALL_26_34_99_115_139_502_187)) (+ 2 (* aux_div_aux_mod_v_main_~b~0_BEFORE_CALL_26_34_99 2))) (not (= aux_div_aux_mod_v_main_~b~0_BEFORE_CALL_26_34_99 0)) (<= (+ (* aux_div_aux_div_aux_div_aux_mod_aux_mod_aux_mod_aux_mod_v_main_~b~0_BEFORE_CALL_26_34_99_115_139_502_92_103 8) (* aux_mod_aux_div_aux_div_aux_mod_aux_mod_aux_mod_aux_mod_v_main_~b~0_BEFORE_CALL_26_34_99_115_139_502_92_103 4) (* 2 aux_mod_aux_div_aux_mod_aux_mod_aux_mod_aux_mod_v_main_~b~0_BEFORE_CALL_26_34_99_115_139_502_92)) (+ aux_mod_aux_mod_aux_mod_aux_mod_aux_mod_aux_mod_v_main_~b~0_BEFORE_CALL_26_34_99_115_139_502_187 (* 2 aux_div_aux_mod_aux_mod_aux_mod_aux_mod_aux_mod_v_main_~b~0_BEFORE_CALL_26_34_99_115_139_502_187))) (<= 0 (+ aux_mod_aux_mod_aux_mod_aux_mod_aux_mod_aux_mod_v_main_~b~0_BEFORE_CALL_26_34_99_115_139_502_187 (* 2 aux_div_aux_mod_aux_mod_aux_mod_aux_mod_aux_mod_v_main_~b~0_BEFORE_CALL_26_34_99_115_139_502_187) 1)) (< (+ aux_mod_aux_mod_aux_mod_aux_mod_aux_mod_aux_mod_v_main_~b~0_BEFORE_CALL_26_34_99_115_139_502_187 (* 2 aux_div_aux_mod_aux_mod_aux_mod_aux_mod_aux_mod_v_main_~b~0_BEFORE_CALL_26_34_99_115_139_502_187)) (+ (* aux_mod_aux_div_aux_mod_aux_mod_aux_mod_v_main_~b~0_BEFORE_CALL_26_34_99_115_139_80 2) (* 16 aux_div_aux_div_aux_div_aux_div_aux_mod_aux_mod_aux_mod_v_main_~b~0_BEFORE_CALL_26_34_99_115_139_80_91_102) (* 8 aux_mod_aux_div_aux_div_aux_div_aux_mod_aux_mod_aux_mod_v_main_~b~0_BEFORE_CALL_26_34_99_115_139_80_91_102) 2 (* aux_mod_aux_div_aux_div_aux_mod_aux_mod_aux_mod_v_main_~b~0_BEFORE_CALL_26_34_99_115_139_80_91 4))) (= (+ v_main_~z~0_BEFORE_CALL_22 (* 2 (* v_main_~z~0_BEFORE_CALL_22 aux_div_aux_mod_aux_mod_aux_mod_aux_mod_aux_mod_v_main_~b~0_BEFORE_CALL_26_34_99_115_139_502_187))) (+ v_main_~a~0_BEFORE_CALL_25 (* (* v_main_~a~0_BEFORE_CALL_25 (+ (* aux_mod_aux_div_aux_div_aux_mod_aux_mod_aux_mod_aux_mod_v_main_~b~0_BEFORE_CALL_26_34_99_115_139_502_92_103 2) aux_mod_aux_div_aux_mod_aux_mod_aux_mod_aux_mod_v_main_~b~0_BEFORE_CALL_26_34_99_115_139_502_92 (* aux_div_aux_div_aux_div_aux_mod_aux_mod_aux_mod_aux_mod_v_main_~b~0_BEFORE_CALL_26_34_99_115_139_502_92_103 4))) 2) (* v_main_~a~0_BEFORE_CALL_25 (+ (* (- 2) aux_mod_aux_div_aux_mod_aux_mod_aux_mod_aux_mod_v_main_~b~0_BEFORE_CALL_26_34_99_115_139_502_92) (* aux_mod_aux_div_aux_div_aux_mod_aux_mod_aux_mod_aux_mod_v_main_~b~0_BEFORE_CALL_26_34_99_115_139_502_92_103 (- 4)) aux_mod_aux_mod_aux_mod_aux_mod_aux_mod_aux_mod_v_main_~b~0_BEFORE_CALL_26_34_99_115_139_502_187 (* 2 aux_div_aux_mod_aux_mod_aux_mod_aux_mod_aux_mod_v_main_~b~0_BEFORE_CALL_26_34_99_115_139_502_187) (* aux_div_aux_div_aux_div_aux_mod_aux_mod_aux_mod_aux_mod_v_main_~b~0_BEFORE_CALL_26_34_99_115_139_502_92_103 (- 8)))))) (<= 0 aux_mod_aux_mod_aux_mod_aux_mod_aux_mod_aux_mod_v_main_~b~0_BEFORE_CALL_26_34_99_115_139_502_187) (<= 0 aux_mod_aux_div_aux_div_aux_mod_aux_mod_aux_mod_v_main_~b~0_BEFORE_CALL_26_34_99_115_139_80_91) (<= 0 aux_mod_aux_div_aux_div_aux_div_aux_mod_aux_mod_aux_mod_v_main_~b~0_BEFORE_CALL_26_34_99_115_139_80_91_102) (< aux_mod_aux_div_aux_mod_aux_mod_v_main_~b~0_BEFORE_CALL_26_34_99_115_68 2) (<= 0 aux_mod_aux_div_aux_mod_aux_mod_v_main_~b~0_BEFORE_CALL_26_34_99_115_68) (not (= aux_mod_aux_div_aux_div_aux_mod_aux_mod_aux_mod_aux_mod_v_main_~b~0_BEFORE_CALL_26_34_99_115_139_502_92_103 1)) (or (and (<= 0 |__VERIFIER_assert_#in~cond|) (not (= (+ (* 2 (* v_main_~a~0_BEFORE_CALL_25 aux_div_v_main_~b~0_BEFORE_CALL_26_34)) (* v_main_~a~0_BEFORE_CALL_25 (+ (* (- 2) aux_div_v_main_~b~0_BEFORE_CALL_26_34) aux_mod_aux_mod_aux_mod_aux_mod_aux_mod_aux_mod_v_main_~b~0_BEFORE_CALL_26_34_99_115_139_502_187 (* 2 aux_div_aux_mod_aux_mod_aux_mod_aux_mod_aux_mod_v_main_~b~0_BEFORE_CALL_26_34_99_115_139_502_187) 1))) (+ v_main_~z~0_BEFORE_CALL_22 (* 16 (* v_main_~z~0_BEFORE_CALL_22 (div (div (div (div (+ aux_mod_aux_mod_aux_mod_aux_mod_aux_mod_aux_mod_v_main_~b~0_BEFORE_CALL_26_34_99_115_139_502_187 (* 2 aux_div_aux_mod_aux_mod_aux_mod_aux_mod_aux_mod_v_main_~b~0_BEFORE_CALL_26_34_99_115_139_502_187)) 2) 2) 2) 2))))))) (<= 1 |__VERIFIER_assert_#in~cond|)) (not (= 1 aux_mod_aux_div_aux_mod_aux_mod_v_main_~b~0_BEFORE_CALL_26_34_99_115_68)) (<= 0 aux_mod_aux_div_aux_div_aux_mod_aux_mod_aux_mod_aux_mod_v_main_~b~0_BEFORE_CALL_26_34_99_115_139_502_92_103) (< aux_mod_aux_div_aux_div_aux_mod_aux_mod_aux_mod_aux_mod_v_main_~b~0_BEFORE_CALL_26_34_99_115_139_502_92_103 2) (<= (* aux_div_aux_mod_v_main_~b~0_BEFORE_CALL_26_34_99 2) (+ aux_mod_aux_mod_aux_mod_aux_mod_aux_mod_aux_mod_v_main_~b~0_BEFORE_CALL_26_34_99_115_139_502_187 (* 2 aux_div_aux_mod_aux_mod_aux_mod_aux_mod_aux_mod_v_main_~b~0_BEFORE_CALL_26_34_99_115_139_502_187))) (<= (+ (* 2 aux_mod_aux_div_aux_mod_aux_mod_v_main_~b~0_BEFORE_CALL_26_34_99_115_68) (* aux_div_aux_div_aux_mod_aux_mod_v_main_~b~0_BEFORE_CALL_26_34_99_115_68 4)) (+ aux_mod_aux_mod_aux_mod_aux_mod_aux_mod_aux_mod_v_main_~b~0_BEFORE_CALL_26_34_99_115_139_502_187 (* 2 aux_div_aux_mod_aux_mod_aux_mod_aux_mod_aux_mod_v_main_~b~0_BEFORE_CALL_26_34_99_115_139_502_187))) (<= (+ (* aux_mod_aux_div_aux_mod_aux_mod_aux_mod_v_main_~b~0_BEFORE_CALL_26_34_99_115_139_80 2) (* 16 aux_div_aux_div_aux_div_aux_div_aux_mod_aux_mod_aux_mod_v_main_~b~0_BEFORE_CALL_26_34_99_115_139_80_91_102) (* 8 aux_mod_aux_div_aux_div_aux_div_aux_mod_aux_mod_aux_mod_v_main_~b~0_BEFORE_CALL_26_34_99_115_139_80_91_102) (* aux_mod_aux_div_aux_div_aux_mod_aux_mod_aux_mod_v_main_~b~0_BEFORE_CALL_26_34_99_115_139_80_91 4)) (+ aux_mod_aux_mod_aux_mod_aux_mod_aux_mod_aux_mod_v_main_~b~0_BEFORE_CALL_26_34_99_115_139_502_187 (* 2 aux_div_aux_mod_aux_mod_aux_mod_aux_mod_aux_mod_v_main_~b~0_BEFORE_CALL_26_34_99_115_139_502_187))) (< aux_mod_aux_div_aux_mod_aux_mod_aux_mod_v_main_~b~0_BEFORE_CALL_26_34_99_115_139_80 2) (< (+ aux_mod_aux_mod_aux_mod_aux_mod_aux_mod_aux_mod_v_main_~b~0_BEFORE_CALL_26_34_99_115_139_502_187 (* 2 aux_div_aux_mod_aux_mod_aux_mod_aux_mod_aux_mod_v_main_~b~0_BEFORE_CALL_26_34_99_115_139_502_187)) (+ (* 2 aux_mod_aux_div_aux_mod_aux_mod_v_main_~b~0_BEFORE_CALL_26_34_99_115_68) 2 (* aux_div_aux_div_aux_mod_aux_mod_v_main_~b~0_BEFORE_CALL_26_34_99_115_68 4))) (< aux_mod_aux_div_aux_div_aux_mod_aux_mod_aux_mod_v_main_~b~0_BEFORE_CALL_26_34_99_115_139_80_91 2) (< aux_mod_aux_mod_aux_mod_aux_mod_aux_mod_aux_mod_v_main_~b~0_BEFORE_CALL_26_34_99_115_139_502_187 2) (<= 0 aux_mod_aux_div_aux_mod_aux_mod_aux_mod_aux_mod_v_main_~b~0_BEFORE_CALL_26_34_99_115_139_502_92) (< (+ aux_mod_aux_mod_aux_mod_aux_mod_aux_mod_aux_mod_v_main_~b~0_BEFORE_CALL_26_34_99_115_139_502_187 (* 2 aux_div_aux_mod_aux_mod_aux_mod_aux_mod_aux_mod_v_main_~b~0_BEFORE_CALL_26_34_99_115_139_502_187)) (+ (* aux_div_aux_div_aux_div_aux_mod_aux_mod_aux_mod_aux_mod_v_main_~b~0_BEFORE_CALL_26_34_99_115_139_502_92_103 8) 2 (* aux_mod_aux_div_aux_div_aux_mod_aux_mod_aux_mod_aux_mod_v_main_~b~0_BEFORE_CALL_26_34_99_115_139_502_92_103 4) (* 2 aux_mod_aux_div_aux_mod_aux_mod_aux_mod_aux_mod_v_main_~b~0_BEFORE_CALL_26_34_99_115_139_502_92)))))} ~cond := #in~cond; {3567#(<= 1 __VERIFIER_assert_~cond)} is UNKNOWN [2022-04-07 15:22:40,633 INFO L290 TraceCheckUtils]: 62: Hoare triple {3567#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {3365#false} is VALID [2022-04-07 15:22:40,633 INFO L290 TraceCheckUtils]: 63: Hoare triple {3365#false} assume !false; {3365#false} is VALID [2022-04-07 15:22:40,634 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 12 proven. 46 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-04-07 15:22:40,634 INFO L328 TraceCheckSpWp]: Computing backward predicates...