/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_valuebound5.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-fb4f59a-m [2022-04-27 14:27:46,750 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-27 14:27:46,751 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-27 14:27:46,785 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-27 14:27:46,785 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-27 14:27:46,786 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-27 14:27:46,786 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-27 14:27:46,787 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-27 14:27:46,788 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-27 14:27:46,789 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-27 14:27:46,789 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-27 14:27:46,790 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-27 14:27:46,790 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-27 14:27:46,791 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-27 14:27:46,791 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-27 14:27:46,792 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-27 14:27:46,792 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-27 14:27:46,793 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-27 14:27:46,793 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-27 14:27:46,794 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-27 14:27:46,795 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-27 14:27:46,796 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-27 14:27:46,796 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-27 14:27:46,797 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-27 14:27:46,798 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-27 14:27:46,799 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-27 14:27:46,799 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-27 14:27:46,800 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-27 14:27:46,800 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-27 14:27:46,800 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-27 14:27:46,801 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-27 14:27:46,801 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-27 14:27:46,801 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-27 14:27:46,802 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-27 14:27:46,802 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-27 14:27:46,803 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-27 14:27:46,803 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-27 14:27:46,803 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-27 14:27:46,803 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-27 14:27:46,803 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-27 14:27:46,804 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-27 14:27:46,804 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-27 14:27:46,805 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2022-04-27 14:27:46,818 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-27 14:27:46,818 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-27 14:27:46,818 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-04-27 14:27:46,818 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-04-27 14:27:46,819 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-04-27 14:27:46,819 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-04-27 14:27:46,819 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-04-27 14:27:46,819 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-04-27 14:27:46,819 INFO L138 SettingsManager]: * Use SBE=true [2022-04-27 14:27:46,820 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-27 14:27:46,820 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-27 14:27:46,820 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-27 14:27:46,820 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-27 14:27:46,820 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-27 14:27:46,820 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-27 14:27:46,820 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-27 14:27:46,820 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-27 14:27:46,820 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-27 14:27:46,820 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-27 14:27:46,820 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-27 14:27:46,821 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-27 14:27:46,821 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-27 14:27:46,821 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-27 14:27:46,821 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-27 14:27:46,821 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-27 14:27:46,821 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-27 14:27:46,821 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-04-27 14:27:46,821 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-04-27 14:27:46,821 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-04-27 14:27:46,821 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-04-27 14:27:46,821 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-04-27 14:27:46,822 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-04-27 14:27:46,822 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-27 14:27:46,822 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.core: Log level for class -> de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN; [2022-04-27 14:27:47,013 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-27 14:27:47,037 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-27 14:27:47,038 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-27 14:27:47,039 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-27 14:27:47,041 INFO L275 PluginConnector]: CDTParser initialized [2022-04-27 14:27:47,042 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/nla-digbench-scaling/prodbin-ll_valuebound5.c [2022-04-27 14:27:47,098 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/eca808d92/186536ed35e44cda9fcede7938852abf/FLAG6c8d8ebd8 [2022-04-27 14:27:47,457 INFO L306 CDTParser]: Found 1 translation units. [2022-04-27 14:27:47,457 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/prodbin-ll_valuebound5.c [2022-04-27 14:27:47,461 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/eca808d92/186536ed35e44cda9fcede7938852abf/FLAG6c8d8ebd8 [2022-04-27 14:27:47,469 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/eca808d92/186536ed35e44cda9fcede7938852abf [2022-04-27 14:27:47,470 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-27 14:27:47,471 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-27 14:27:47,473 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-27 14:27:47,474 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-27 14:27:47,475 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-27 14:27:47,476 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.04 02:27:47" (1/1) ... [2022-04-27 14:27:47,480 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@23281ff7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 02:27:47, skipping insertion in model container [2022-04-27 14:27:47,480 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.04 02:27:47" (1/1) ... [2022-04-27 14:27:47,485 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-27 14:27:47,495 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-27 14:27:47,650 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_valuebound5.c[537,550] [2022-04-27 14:27:47,672 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-27 14:27:47,678 INFO L203 MainTranslator]: Completed pre-run [2022-04-27 14:27:47,693 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_valuebound5.c[537,550] [2022-04-27 14:27:47,707 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-27 14:27:47,715 INFO L208 MainTranslator]: Completed translation [2022-04-27 14:27:47,715 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 02:27:47 WrapperNode [2022-04-27 14:27:47,715 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-27 14:27:47,716 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-27 14:27:47,716 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-27 14:27:47,716 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-27 14:27:47,723 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 02:27:47" (1/1) ... [2022-04-27 14:27:47,724 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 02:27:47" (1/1) ... [2022-04-27 14:27:47,728 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 02:27:47" (1/1) ... [2022-04-27 14:27:47,728 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 02:27:47" (1/1) ... [2022-04-27 14:27:47,738 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 02:27:47" (1/1) ... [2022-04-27 14:27:47,742 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 02:27:47" (1/1) ... [2022-04-27 14:27:47,744 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 02:27:47" (1/1) ... [2022-04-27 14:27:47,747 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-27 14:27:47,748 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-27 14:27:47,748 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-27 14:27:47,748 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-27 14:27:47,748 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 02:27:47" (1/1) ... [2022-04-27 14:27:47,753 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-27 14:27:47,760 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 14:27:47,785 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-04-27 14:27:47,804 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-04-27 14:27:47,820 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-27 14:27:47,820 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-27 14:27:47,820 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-27 14:27:47,820 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-27 14:27:47,820 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-27 14:27:47,821 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-27 14:27:47,821 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-27 14:27:47,821 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-27 14:27:47,821 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-27 14:27:47,821 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-27 14:27:47,821 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-04-27 14:27:47,821 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-27 14:27:47,821 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-27 14:27:47,821 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-27 14:27:47,821 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-27 14:27:47,821 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-27 14:27:47,821 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-27 14:27:47,821 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-27 14:27:47,821 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-27 14:27:47,822 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-27 14:27:47,860 INFO L234 CfgBuilder]: Building ICFG [2022-04-27 14:27:47,861 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-27 14:27:47,994 INFO L275 CfgBuilder]: Performing block encoding [2022-04-27 14:27:48,000 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-27 14:27:48,000 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-27 14:27:48,001 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.04 02:27:48 BoogieIcfgContainer [2022-04-27 14:27:48,001 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-27 14:27:48,002 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-27 14:27:48,003 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-27 14:27:48,005 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-27 14:27:48,006 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.04 02:27:47" (1/3) ... [2022-04-27 14:27:48,006 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7ef5cf27 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.04 02:27:48, skipping insertion in model container [2022-04-27 14:27:48,006 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 02:27:47" (2/3) ... [2022-04-27 14:27:48,006 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7ef5cf27 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.04 02:27:48, skipping insertion in model container [2022-04-27 14:27:48,007 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.04 02:27:48" (3/3) ... [2022-04-27 14:27:48,008 INFO L111 eAbstractionObserver]: Analyzing ICFG prodbin-ll_valuebound5.c [2022-04-27 14:27:48,019 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-04-27 14:27:48,020 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-27 14:27:48,057 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-27 14:27:48,069 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@eb13609, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@299bba17 [2022-04-27 14:27:48,069 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-27 14:27:48,076 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-27 14:27:48,081 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-04-27 14:27:48,082 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 14:27:48,082 INFO L195 NwaCegarLoop]: 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-27 14:27:48,083 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 14:27:48,087 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 14:27:48,087 INFO L85 PathProgramCache]: Analyzing trace with hash -589322634, now seen corresponding path program 1 times [2022-04-27 14:27:48,094 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 14:27:48,095 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1670837542] [2022-04-27 14:27:48,095 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 14:27:48,096 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 14:27:48,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 14:27:48,246 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 14:27:48,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 14:27:48,272 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-27 14:27:48,272 INFO L290 TraceCheckUtils]: 1: Hoare triple {35#true} assume true; {35#true} is VALID [2022-04-27 14:27:48,273 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {35#true} {35#true} #71#return; {35#true} is VALID [2022-04-27 14:27:48,273 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-27 14:27:48,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 14:27:48,292 INFO L290 TraceCheckUtils]: 0: Hoare triple {35#true} ~cond := #in~cond; {35#true} is VALID [2022-04-27 14:27:48,293 INFO L290 TraceCheckUtils]: 1: Hoare triple {35#true} assume 0 == ~cond;assume false; {36#false} is VALID [2022-04-27 14:27:48,294 INFO L290 TraceCheckUtils]: 2: Hoare triple {36#false} assume true; {36#false} is VALID [2022-04-27 14:27:48,294 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {36#false} {35#true} #61#return; {36#false} is VALID [2022-04-27 14:27:48,294 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-04-27 14:27:48,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 14:27:48,303 INFO L290 TraceCheckUtils]: 0: Hoare triple {35#true} ~cond := #in~cond; {35#true} is VALID [2022-04-27 14:27:48,304 INFO L290 TraceCheckUtils]: 1: Hoare triple {35#true} assume 0 == ~cond;assume false; {36#false} is VALID [2022-04-27 14:27:48,304 INFO L290 TraceCheckUtils]: 2: Hoare triple {36#false} assume true; {36#false} is VALID [2022-04-27 14:27:48,304 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {36#false} {36#false} #63#return; {36#false} is VALID [2022-04-27 14:27:48,305 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-04-27 14:27:48,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 14:27:48,309 INFO L290 TraceCheckUtils]: 0: Hoare triple {35#true} ~cond := #in~cond; {35#true} is VALID [2022-04-27 14:27:48,310 INFO L290 TraceCheckUtils]: 1: Hoare triple {35#true} assume 0 == ~cond;assume false; {36#false} is VALID [2022-04-27 14:27:48,310 INFO L290 TraceCheckUtils]: 2: Hoare triple {36#false} assume true; {36#false} is VALID [2022-04-27 14:27:48,310 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {36#false} {36#false} #65#return; {36#false} is VALID [2022-04-27 14:27:48,311 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-27 14:27:48,311 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-27 14:27:48,311 INFO L290 TraceCheckUtils]: 2: Hoare triple {35#true} assume true; {35#true} is VALID [2022-04-27 14:27:48,311 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {35#true} {35#true} #71#return; {35#true} is VALID [2022-04-27 14:27:48,311 INFO L272 TraceCheckUtils]: 4: Hoare triple {35#true} call #t~ret6 := main(); {35#true} is VALID [2022-04-27 14:27:48,312 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-27 14:27:48,312 INFO L272 TraceCheckUtils]: 6: Hoare triple {35#true} call assume_abort_if_not((if ~a~0 >= 0 && ~a~0 <= 5 then 1 else 0)); {35#true} is VALID [2022-04-27 14:27:48,312 INFO L290 TraceCheckUtils]: 7: Hoare triple {35#true} ~cond := #in~cond; {35#true} is VALID [2022-04-27 14:27:48,312 INFO L290 TraceCheckUtils]: 8: Hoare triple {35#true} assume 0 == ~cond;assume false; {36#false} is VALID [2022-04-27 14:27:48,313 INFO L290 TraceCheckUtils]: 9: Hoare triple {36#false} assume true; {36#false} is VALID [2022-04-27 14:27:48,313 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {36#false} {35#true} #61#return; {36#false} is VALID [2022-04-27 14:27:48,313 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-27 14:27:48,313 INFO L272 TraceCheckUtils]: 12: Hoare triple {36#false} call assume_abort_if_not((if ~b~0 >= 0 && ~b~0 <= 5 then 1 else 0)); {35#true} is VALID [2022-04-27 14:27:48,313 INFO L290 TraceCheckUtils]: 13: Hoare triple {35#true} ~cond := #in~cond; {35#true} is VALID [2022-04-27 14:27:48,315 INFO L290 TraceCheckUtils]: 14: Hoare triple {35#true} assume 0 == ~cond;assume false; {36#false} is VALID [2022-04-27 14:27:48,315 INFO L290 TraceCheckUtils]: 15: Hoare triple {36#false} assume true; {36#false} is VALID [2022-04-27 14:27:48,315 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {36#false} {36#false} #63#return; {36#false} is VALID [2022-04-27 14:27:48,315 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-27 14:27:48,316 INFO L290 TraceCheckUtils]: 18: Hoare triple {35#true} ~cond := #in~cond; {35#true} is VALID [2022-04-27 14:27:48,316 INFO L290 TraceCheckUtils]: 19: Hoare triple {35#true} assume 0 == ~cond;assume false; {36#false} is VALID [2022-04-27 14:27:48,316 INFO L290 TraceCheckUtils]: 20: Hoare triple {36#false} assume true; {36#false} is VALID [2022-04-27 14:27:48,316 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {36#false} {36#false} #65#return; {36#false} is VALID [2022-04-27 14:27:48,316 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-27 14:27:48,317 INFO L290 TraceCheckUtils]: 23: Hoare triple {36#false} assume false; {36#false} is VALID [2022-04-27 14:27:48,317 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-27 14:27:48,317 INFO L290 TraceCheckUtils]: 25: Hoare triple {36#false} ~cond := #in~cond; {36#false} is VALID [2022-04-27 14:27:48,317 INFO L290 TraceCheckUtils]: 26: Hoare triple {36#false} assume 0 == ~cond; {36#false} is VALID [2022-04-27 14:27:48,317 INFO L290 TraceCheckUtils]: 27: Hoare triple {36#false} assume !false; {36#false} is VALID [2022-04-27 14:27:48,318 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-27 14:27:48,318 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 14:27:48,318 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1670837542] [2022-04-27 14:27:48,319 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1670837542] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 14:27:48,319 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 14:27:48,319 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-27 14:27:48,320 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1989642369] [2022-04-27 14:27:48,320 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 14:27:48,324 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-27 14:27:48,325 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 14:27:48,326 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-27 14:27:48,355 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-27 14:27:48,356 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-27 14:27:48,356 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 14:27:48,373 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-27 14:27:48,373 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-27 14:27:48,376 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-27 14:27:48,485 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:27:48,485 INFO L93 Difference]: Finished difference Result 57 states and 77 transitions. [2022-04-27 14:27:48,485 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-27 14:27:48,486 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-27 14:27:48,486 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 14:27:48,487 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-27 14:27:48,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 77 transitions. [2022-04-27 14:27:48,493 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-27 14:27:48,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 77 transitions. [2022-04-27 14:27:48,497 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 77 transitions. [2022-04-27 14:27:48,579 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-27 14:27:48,585 INFO L225 Difference]: With dead ends: 57 [2022-04-27 14:27:48,585 INFO L226 Difference]: Without dead ends: 27 [2022-04-27 14:27:48,593 INFO L412 NwaCegarLoop]: 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-27 14:27:48,595 INFO L413 NwaCegarLoop]: 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-27 14:27:48,595 INFO L414 NwaCegarLoop]: 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-27 14:27:48,605 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2022-04-27 14:27:48,613 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2022-04-27 14:27:48,613 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 14:27:48,614 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-27 14:27:48,614 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-27 14:27:48,614 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-27 14:27:48,629 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:27:48,629 INFO L93 Difference]: Finished difference Result 27 states and 31 transitions. [2022-04-27 14:27:48,629 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 31 transitions. [2022-04-27 14:27:48,630 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:27:48,630 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 14:27:48,630 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-27 14:27:48,630 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-27 14:27:48,633 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:27:48,633 INFO L93 Difference]: Finished difference Result 27 states and 31 transitions. [2022-04-27 14:27:48,633 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 31 transitions. [2022-04-27 14:27:48,633 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:27:48,633 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 14:27:48,633 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 14:27:48,633 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 14:27:48,634 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-27 14:27:48,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 31 transitions. [2022-04-27 14:27:48,636 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 31 transitions. Word has length 28 [2022-04-27 14:27:48,636 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 14:27:48,637 INFO L495 AbstractCegarLoop]: Abstraction has 27 states and 31 transitions. [2022-04-27 14:27:48,637 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (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-27 14:27:48,637 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 31 transitions. [2022-04-27 14:27:48,638 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-04-27 14:27:48,638 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 14:27:48,638 INFO L195 NwaCegarLoop]: 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-27 14:27:48,638 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-27 14:27:48,638 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 14:27:48,639 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 14:27:48,639 INFO L85 PathProgramCache]: Analyzing trace with hash -1736242504, now seen corresponding path program 1 times [2022-04-27 14:27:48,639 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 14:27:48,641 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [975499297] [2022-04-27 14:27:48,641 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 14:27:48,642 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 14:27:48,677 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 14:27:48,677 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1757343588] [2022-04-27 14:27:48,678 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 14:27:48,678 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 14:27:48,678 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 14:27:48,681 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-27 14:27:48,682 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-04-27 14:27:48,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 14:27:48,729 INFO L263 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 9 conjunts are in the unsatisfiable core [2022-04-27 14:27:48,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 14:27:48,740 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 14:27:48,895 INFO L272 TraceCheckUtils]: 0: Hoare triple {224#true} call ULTIMATE.init(); {224#true} is VALID [2022-04-27 14:27:48,896 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-27 14:27:48,896 INFO L290 TraceCheckUtils]: 2: Hoare triple {224#true} assume true; {224#true} is VALID [2022-04-27 14:27:48,896 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {224#true} {224#true} #71#return; {224#true} is VALID [2022-04-27 14:27:48,896 INFO L272 TraceCheckUtils]: 4: Hoare triple {224#true} call #t~ret6 := main(); {224#true} is VALID [2022-04-27 14:27:48,898 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-27 14:27:48,899 INFO L272 TraceCheckUtils]: 6: Hoare triple {224#true} call assume_abort_if_not((if ~a~0 >= 0 && ~a~0 <= 5 then 1 else 0)); {224#true} is VALID [2022-04-27 14:27:48,900 INFO L290 TraceCheckUtils]: 7: Hoare triple {224#true} ~cond := #in~cond; {224#true} is VALID [2022-04-27 14:27:48,900 INFO L290 TraceCheckUtils]: 8: Hoare triple {224#true} assume !(0 == ~cond); {224#true} is VALID [2022-04-27 14:27:48,900 INFO L290 TraceCheckUtils]: 9: Hoare triple {224#true} assume true; {224#true} is VALID [2022-04-27 14:27:48,901 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {224#true} {224#true} #61#return; {224#true} is VALID [2022-04-27 14:27:48,901 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-27 14:27:48,902 INFO L272 TraceCheckUtils]: 12: Hoare triple {224#true} call assume_abort_if_not((if ~b~0 >= 0 && ~b~0 <= 5 then 1 else 0)); {224#true} is VALID [2022-04-27 14:27:48,902 INFO L290 TraceCheckUtils]: 13: Hoare triple {224#true} ~cond := #in~cond; {224#true} is VALID [2022-04-27 14:27:48,902 INFO L290 TraceCheckUtils]: 14: Hoare triple {224#true} assume !(0 == ~cond); {224#true} is VALID [2022-04-27 14:27:48,903 INFO L290 TraceCheckUtils]: 15: Hoare triple {224#true} assume true; {224#true} is VALID [2022-04-27 14:27:48,903 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {224#true} {224#true} #63#return; {224#true} is VALID [2022-04-27 14:27:48,904 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-27 14:27:48,904 INFO L290 TraceCheckUtils]: 18: Hoare triple {224#true} ~cond := #in~cond; {224#true} is VALID [2022-04-27 14:27:48,904 INFO L290 TraceCheckUtils]: 19: Hoare triple {224#true} assume !(0 == ~cond); {224#true} is VALID [2022-04-27 14:27:48,904 INFO L290 TraceCheckUtils]: 20: Hoare triple {224#true} assume true; {224#true} is VALID [2022-04-27 14:27:48,904 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {224#true} {224#true} #65#return; {224#true} is VALID [2022-04-27 14:27:48,905 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-27 14:27:48,905 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-27 14:27:48,906 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-27 14:27:48,907 INFO L290 TraceCheckUtils]: 25: Hoare triple {302#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {306#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 14:27:48,908 INFO L290 TraceCheckUtils]: 26: Hoare triple {306#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {225#false} is VALID [2022-04-27 14:27:48,908 INFO L290 TraceCheckUtils]: 27: Hoare triple {225#false} assume !false; {225#false} is VALID [2022-04-27 14:27:48,908 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-27 14:27:48,908 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-27 14:27:48,908 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 14:27:48,909 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [975499297] [2022-04-27 14:27:48,909 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 14:27:48,909 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1757343588] [2022-04-27 14:27:48,911 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1757343588] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 14:27:48,912 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 14:27:48,912 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-27 14:27:48,912 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [873743256] [2022-04-27 14:27:48,912 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 14:27:48,914 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-27 14:27:48,914 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 14:27:48,914 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-27 14:27:48,932 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-27 14:27:48,932 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-27 14:27:48,932 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 14:27:48,933 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-27 14:27:48,934 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-27 14:27:48,934 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-27 14:27:49,053 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:27:49,053 INFO L93 Difference]: Finished difference Result 39 states and 45 transitions. [2022-04-27 14:27:49,053 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-27 14:27:49,053 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-27 14:27:49,054 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 14:27:49,054 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-27 14:27:49,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 45 transitions. [2022-04-27 14:27:49,056 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-27 14:27:49,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 45 transitions. [2022-04-27 14:27:49,057 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 45 transitions. [2022-04-27 14:27:49,088 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-27 14:27:49,090 INFO L225 Difference]: With dead ends: 39 [2022-04-27 14:27:49,090 INFO L226 Difference]: Without dead ends: 37 [2022-04-27 14:27:49,090 INFO L412 NwaCegarLoop]: 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-27 14:27:49,091 INFO L413 NwaCegarLoop]: 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-27 14:27:49,091 INFO L414 NwaCegarLoop]: 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-27 14:27:49,092 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2022-04-27 14:27:49,109 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 33. [2022-04-27 14:27:49,110 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 14:27:49,110 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-27 14:27:49,111 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-27 14:27:49,112 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-27 14:27:49,116 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:27:49,116 INFO L93 Difference]: Finished difference Result 37 states and 43 transitions. [2022-04-27 14:27:49,118 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 43 transitions. [2022-04-27 14:27:49,119 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:27:49,122 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 14:27:49,124 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-27 14:27:49,124 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-27 14:27:49,130 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:27:49,130 INFO L93 Difference]: Finished difference Result 37 states and 43 transitions. [2022-04-27 14:27:49,130 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 43 transitions. [2022-04-27 14:27:49,130 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:27:49,131 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 14:27:49,131 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 14:27:49,131 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 14:27:49,131 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-27 14:27:49,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 37 transitions. [2022-04-27 14:27:49,132 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 37 transitions. Word has length 28 [2022-04-27 14:27:49,132 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 14:27:49,133 INFO L495 AbstractCegarLoop]: Abstraction has 33 states and 37 transitions. [2022-04-27 14:27:49,133 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (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-27 14:27:49,133 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 37 transitions. [2022-04-27 14:27:49,133 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-04-27 14:27:49,133 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 14:27:49,134 INFO L195 NwaCegarLoop]: 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-27 14:27:49,155 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-04-27 14:27:49,347 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 14:27:49,348 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 14:27:49,348 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 14:27:49,348 INFO L85 PathProgramCache]: Analyzing trace with hash 1911690432, now seen corresponding path program 1 times [2022-04-27 14:27:49,348 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 14:27:49,348 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1028976250] [2022-04-27 14:27:49,349 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 14:27:49,349 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 14:27:49,364 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 14:27:49,364 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1360816753] [2022-04-27 14:27:49,364 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 14:27:49,364 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 14:27:49,364 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 14:27:49,365 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-27 14:27:49,366 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-04-27 14:27:49,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 14:27:49,401 INFO L263 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-27 14:27:49,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 14:27:49,414 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 14:27:49,559 INFO L272 TraceCheckUtils]: 0: Hoare triple {491#true} call ULTIMATE.init(); {491#true} is VALID [2022-04-27 14:27:49,560 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-27 14:27:49,560 INFO L290 TraceCheckUtils]: 2: Hoare triple {491#true} assume true; {491#true} is VALID [2022-04-27 14:27:49,560 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {491#true} {491#true} #71#return; {491#true} is VALID [2022-04-27 14:27:49,560 INFO L272 TraceCheckUtils]: 4: Hoare triple {491#true} call #t~ret6 := main(); {491#true} is VALID [2022-04-27 14:27:49,560 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-27 14:27:49,560 INFO L272 TraceCheckUtils]: 6: Hoare triple {491#true} call assume_abort_if_not((if ~a~0 >= 0 && ~a~0 <= 5 then 1 else 0)); {491#true} is VALID [2022-04-27 14:27:49,561 INFO L290 TraceCheckUtils]: 7: Hoare triple {491#true} ~cond := #in~cond; {491#true} is VALID [2022-04-27 14:27:49,561 INFO L290 TraceCheckUtils]: 8: Hoare triple {491#true} assume !(0 == ~cond); {491#true} is VALID [2022-04-27 14:27:49,561 INFO L290 TraceCheckUtils]: 9: Hoare triple {491#true} assume true; {491#true} is VALID [2022-04-27 14:27:49,561 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {491#true} {491#true} #61#return; {491#true} is VALID [2022-04-27 14:27:49,561 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-27 14:27:49,561 INFO L272 TraceCheckUtils]: 12: Hoare triple {491#true} call assume_abort_if_not((if ~b~0 >= 0 && ~b~0 <= 5 then 1 else 0)); {491#true} is VALID [2022-04-27 14:27:49,567 INFO L290 TraceCheckUtils]: 13: Hoare triple {491#true} ~cond := #in~cond; {491#true} is VALID [2022-04-27 14:27:49,567 INFO L290 TraceCheckUtils]: 14: Hoare triple {491#true} assume !(0 == ~cond); {491#true} is VALID [2022-04-27 14:27:49,567 INFO L290 TraceCheckUtils]: 15: Hoare triple {491#true} assume true; {491#true} is VALID [2022-04-27 14:27:49,567 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {491#true} {491#true} #63#return; {491#true} is VALID [2022-04-27 14:27:49,567 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-27 14:27:49,568 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-27 14:27:49,568 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-27 14:27:49,569 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-27 14:27:49,569 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-27 14:27:49,570 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-27 14:27:49,570 INFO L290 TraceCheckUtils]: 23: Hoare triple {565#(<= 1 main_~y~0)} assume !false; {565#(<= 1 main_~y~0)} is VALID [2022-04-27 14:27:49,570 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-27 14:27:49,570 INFO L290 TraceCheckUtils]: 25: Hoare triple {491#true} ~cond := #in~cond; {491#true} is VALID [2022-04-27 14:27:49,570 INFO L290 TraceCheckUtils]: 26: Hoare triple {491#true} assume !(0 == ~cond); {491#true} is VALID [2022-04-27 14:27:49,571 INFO L290 TraceCheckUtils]: 27: Hoare triple {491#true} assume true; {491#true} is VALID [2022-04-27 14:27:49,571 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {491#true} {565#(<= 1 main_~y~0)} #67#return; {565#(<= 1 main_~y~0)} is VALID [2022-04-27 14:27:49,572 INFO L290 TraceCheckUtils]: 29: Hoare triple {565#(<= 1 main_~y~0)} assume !(0 != ~y~0); {492#false} is VALID [2022-04-27 14:27:49,572 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-27 14:27:49,572 INFO L290 TraceCheckUtils]: 31: Hoare triple {492#false} ~cond := #in~cond; {492#false} is VALID [2022-04-27 14:27:49,572 INFO L290 TraceCheckUtils]: 32: Hoare triple {492#false} assume 0 == ~cond; {492#false} is VALID [2022-04-27 14:27:49,572 INFO L290 TraceCheckUtils]: 33: Hoare triple {492#false} assume !false; {492#false} is VALID [2022-04-27 14:27:49,573 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-27 14:27:49,573 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-27 14:27:49,573 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 14:27:49,573 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1028976250] [2022-04-27 14:27:49,573 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 14:27:49,573 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1360816753] [2022-04-27 14:27:49,573 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1360816753] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 14:27:49,573 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 14:27:49,573 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-27 14:27:49,574 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [166303849] [2022-04-27 14:27:49,574 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 14:27:49,574 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-27 14:27:49,574 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 14:27:49,575 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-27 14:27:49,595 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 31 edges. 31 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 14:27:49,595 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-27 14:27:49,595 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 14:27:49,596 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-27 14:27:49,596 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-04-27 14:27:49,596 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-27 14:27:49,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:27:49,755 INFO L93 Difference]: Finished difference Result 43 states and 48 transitions. [2022-04-27 14:27:49,756 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-27 14:27:49,756 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-27 14:27:49,757 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 14:27:49,757 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-27 14:27:49,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 45 transitions. [2022-04-27 14:27:49,760 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-27 14:27:49,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 45 transitions. [2022-04-27 14:27:49,765 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 45 transitions. [2022-04-27 14:27:49,793 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-27 14:27:49,794 INFO L225 Difference]: With dead ends: 43 [2022-04-27 14:27:49,794 INFO L226 Difference]: Without dead ends: 36 [2022-04-27 14:27:49,794 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-04-27 14:27:49,796 INFO L413 NwaCegarLoop]: 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-27 14:27:49,796 INFO L414 NwaCegarLoop]: 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-27 14:27:49,797 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2022-04-27 14:27:49,804 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 34. [2022-04-27 14:27:49,804 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 14:27:49,805 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-27 14:27:49,805 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-27 14:27:49,805 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-27 14:27:49,807 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:27:49,807 INFO L93 Difference]: Finished difference Result 36 states and 41 transitions. [2022-04-27 14:27:49,807 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 41 transitions. [2022-04-27 14:27:49,807 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:27:49,807 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 14:27:49,807 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-27 14:27:49,808 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-27 14:27:49,809 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:27:49,809 INFO L93 Difference]: Finished difference Result 36 states and 41 transitions. [2022-04-27 14:27:49,809 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 41 transitions. [2022-04-27 14:27:49,809 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:27:49,810 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 14:27:49,810 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 14:27:49,810 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 14:27:49,810 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-27 14:27:49,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 38 transitions. [2022-04-27 14:27:49,811 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 38 transitions. Word has length 34 [2022-04-27 14:27:49,812 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 14:27:49,812 INFO L495 AbstractCegarLoop]: Abstraction has 34 states and 38 transitions. [2022-04-27 14:27:49,812 INFO L496 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-27 14:27:49,812 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 38 transitions. [2022-04-27 14:27:49,812 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-04-27 14:27:49,813 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 14:27:49,813 INFO L195 NwaCegarLoop]: 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-27 14:27:49,834 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-04-27 14:27:50,034 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2022-04-27 14:27:50,034 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 14:27:50,035 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 14:27:50,035 INFO L85 PathProgramCache]: Analyzing trace with hash 2022075506, now seen corresponding path program 1 times [2022-04-27 14:27:50,035 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 14:27:50,035 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1461856817] [2022-04-27 14:27:50,035 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 14:27:50,035 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 14:27:50,052 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 14:27:50,052 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [83888594] [2022-04-27 14:27:50,052 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 14:27:50,052 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 14:27:50,052 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 14:27:50,058 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-27 14:27:50,058 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-04-27 14:27:50,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 14:27:50,112 INFO L263 TraceCheckSpWp]: Trace formula consists of 111 conjuncts, 28 conjunts are in the unsatisfiable core [2022-04-27 14:27:50,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 14:27:50,130 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 14:27:57,309 INFO L272 TraceCheckUtils]: 0: Hoare triple {783#true} call ULTIMATE.init(); {783#true} is VALID [2022-04-27 14:27:57,310 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-27 14:27:57,310 INFO L290 TraceCheckUtils]: 2: Hoare triple {783#true} assume true; {783#true} is VALID [2022-04-27 14:27:57,310 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {783#true} {783#true} #71#return; {783#true} is VALID [2022-04-27 14:27:57,310 INFO L272 TraceCheckUtils]: 4: Hoare triple {783#true} call #t~ret6 := main(); {783#true} is VALID [2022-04-27 14:27:57,310 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-27 14:27:57,310 INFO L272 TraceCheckUtils]: 6: Hoare triple {783#true} call assume_abort_if_not((if ~a~0 >= 0 && ~a~0 <= 5 then 1 else 0)); {783#true} is VALID [2022-04-27 14:27:57,311 INFO L290 TraceCheckUtils]: 7: Hoare triple {783#true} ~cond := #in~cond; {783#true} is VALID [2022-04-27 14:27:57,311 INFO L290 TraceCheckUtils]: 8: Hoare triple {783#true} assume !(0 == ~cond); {783#true} is VALID [2022-04-27 14:27:57,312 INFO L290 TraceCheckUtils]: 9: Hoare triple {783#true} assume true; {783#true} is VALID [2022-04-27 14:27:57,312 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {783#true} {783#true} #61#return; {783#true} is VALID [2022-04-27 14:27:57,312 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-27 14:27:57,313 INFO L272 TraceCheckUtils]: 12: Hoare triple {783#true} call assume_abort_if_not((if ~b~0 >= 0 && ~b~0 <= 5 then 1 else 0)); {783#true} is VALID [2022-04-27 14:27:57,314 INFO L290 TraceCheckUtils]: 13: Hoare triple {783#true} ~cond := #in~cond; {783#true} is VALID [2022-04-27 14:27:57,314 INFO L290 TraceCheckUtils]: 14: Hoare triple {783#true} assume !(0 == ~cond); {783#true} is VALID [2022-04-27 14:27:57,314 INFO L290 TraceCheckUtils]: 15: Hoare triple {783#true} assume true; {783#true} is VALID [2022-04-27 14:27:57,314 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {783#true} {783#true} #63#return; {783#true} is VALID [2022-04-27 14:27:57,315 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-27 14:27:57,315 INFO L290 TraceCheckUtils]: 18: Hoare triple {783#true} ~cond := #in~cond; {783#true} is VALID [2022-04-27 14:27:57,315 INFO L290 TraceCheckUtils]: 19: Hoare triple {783#true} assume !(0 == ~cond); {783#true} is VALID [2022-04-27 14:27:57,315 INFO L290 TraceCheckUtils]: 20: Hoare triple {783#true} assume true; {783#true} is VALID [2022-04-27 14:27:57,315 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {783#true} {783#true} #65#return; {783#true} is VALID [2022-04-27 14:27:57,327 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-27 14:27:57,328 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-27 14:27:57,328 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-27 14:27:57,328 INFO L290 TraceCheckUtils]: 25: Hoare triple {783#true} ~cond := #in~cond; {864#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-27 14:27:57,328 INFO L290 TraceCheckUtils]: 26: Hoare triple {864#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {868#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 14:27:57,329 INFO L290 TraceCheckUtils]: 27: Hoare triple {868#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {868#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 14:27:57,329 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {868#(not (= |__VERIFIER_assert_#in~cond| 0))} {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-27 14:27:57,330 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); {878#(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-27 14:27:57,331 INFO L290 TraceCheckUtils]: 30: Hoare triple {878#(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; {882#(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-27 14:27:57,336 INFO L290 TraceCheckUtils]: 31: Hoare triple {882#(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); {886#(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-27 14:27:57,337 INFO L290 TraceCheckUtils]: 32: Hoare triple {886#(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; {886#(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-27 14:27:58,749 INFO L272 TraceCheckUtils]: 33: Hoare triple {886#(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)); {893#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 14:27:58,750 INFO L290 TraceCheckUtils]: 34: Hoare triple {893#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {897#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 14:27:58,750 INFO L290 TraceCheckUtils]: 35: Hoare triple {897#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {784#false} is VALID [2022-04-27 14:27:58,750 INFO L290 TraceCheckUtils]: 36: Hoare triple {784#false} assume !false; {784#false} is VALID [2022-04-27 14:27:58,750 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-04-27 14:27:58,751 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 14:29:08,119 INFO L290 TraceCheckUtils]: 36: Hoare triple {784#false} assume !false; {784#false} is VALID [2022-04-27 14:29:08,120 INFO L290 TraceCheckUtils]: 35: Hoare triple {897#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {784#false} is VALID [2022-04-27 14:29:08,120 INFO L290 TraceCheckUtils]: 34: Hoare triple {893#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {897#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 14:29:08,121 INFO L272 TraceCheckUtils]: 33: Hoare triple {913#(= (+ 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)); {893#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 14:29:08,122 INFO L290 TraceCheckUtils]: 32: Hoare triple {913#(= (+ main_~z~0 (* main_~y~0 main_~x~0)) (* main_~b~0 main_~a~0))} assume !false; {913#(= (+ main_~z~0 (* main_~y~0 main_~x~0)) (* main_~b~0 main_~a~0))} is VALID [2022-04-27 14:29:08,126 INFO L290 TraceCheckUtils]: 31: Hoare triple {920#(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); {913#(= (+ main_~z~0 (* main_~y~0 main_~x~0)) (* main_~b~0 main_~a~0))} is VALID [2022-04-27 14:29:08,128 INFO L290 TraceCheckUtils]: 30: Hoare triple {924#(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; {920#(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-27 14:29:08,129 INFO L290 TraceCheckUtils]: 29: Hoare triple {924#(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); {924#(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-27 14:29:09,319 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {868#(not (= |__VERIFIER_assert_#in~cond| 0))} {783#true} #67#return; {924#(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-27 14:29:09,320 INFO L290 TraceCheckUtils]: 27: Hoare triple {868#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {868#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 14:29:09,320 INFO L290 TraceCheckUtils]: 26: Hoare triple {940#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} assume !(0 == ~cond); {868#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 14:29:09,320 INFO L290 TraceCheckUtils]: 25: Hoare triple {783#true} ~cond := #in~cond; {940#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-27 14:29:09,321 INFO L272 TraceCheckUtils]: 24: Hoare triple {783#true} call __VERIFIER_assert((if ~z~0 + ~x~0 * ~y~0 == ~a~0 * ~b~0 then 1 else 0)); {783#true} is VALID [2022-04-27 14:29:09,321 INFO L290 TraceCheckUtils]: 23: Hoare triple {783#true} assume !false; {783#true} is VALID [2022-04-27 14:29:09,321 INFO L290 TraceCheckUtils]: 22: Hoare triple {783#true} ~x~0 := ~a~0;~y~0 := ~b~0;~z~0 := 0; {783#true} is VALID [2022-04-27 14:29:09,321 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {783#true} {783#true} #65#return; {783#true} is VALID [2022-04-27 14:29:09,321 INFO L290 TraceCheckUtils]: 20: Hoare triple {783#true} assume true; {783#true} is VALID [2022-04-27 14:29:09,321 INFO L290 TraceCheckUtils]: 19: Hoare triple {783#true} assume !(0 == ~cond); {783#true} is VALID [2022-04-27 14:29:09,321 INFO L290 TraceCheckUtils]: 18: Hoare triple {783#true} ~cond := #in~cond; {783#true} is VALID [2022-04-27 14:29:09,321 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-27 14:29:09,321 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {783#true} {783#true} #63#return; {783#true} is VALID [2022-04-27 14:29:09,321 INFO L290 TraceCheckUtils]: 15: Hoare triple {783#true} assume true; {783#true} is VALID [2022-04-27 14:29:09,322 INFO L290 TraceCheckUtils]: 14: Hoare triple {783#true} assume !(0 == ~cond); {783#true} is VALID [2022-04-27 14:29:09,322 INFO L290 TraceCheckUtils]: 13: Hoare triple {783#true} ~cond := #in~cond; {783#true} is VALID [2022-04-27 14:29:09,322 INFO L272 TraceCheckUtils]: 12: Hoare triple {783#true} call assume_abort_if_not((if ~b~0 >= 0 && ~b~0 <= 5 then 1 else 0)); {783#true} is VALID [2022-04-27 14:29:09,322 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-27 14:29:09,322 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {783#true} {783#true} #61#return; {783#true} is VALID [2022-04-27 14:29:09,322 INFO L290 TraceCheckUtils]: 9: Hoare triple {783#true} assume true; {783#true} is VALID [2022-04-27 14:29:09,322 INFO L290 TraceCheckUtils]: 8: Hoare triple {783#true} assume !(0 == ~cond); {783#true} is VALID [2022-04-27 14:29:09,322 INFO L290 TraceCheckUtils]: 7: Hoare triple {783#true} ~cond := #in~cond; {783#true} is VALID [2022-04-27 14:29:09,322 INFO L272 TraceCheckUtils]: 6: Hoare triple {783#true} call assume_abort_if_not((if ~a~0 >= 0 && ~a~0 <= 5 then 1 else 0)); {783#true} is VALID [2022-04-27 14:29:09,322 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-27 14:29:09,322 INFO L272 TraceCheckUtils]: 4: Hoare triple {783#true} call #t~ret6 := main(); {783#true} is VALID [2022-04-27 14:29:09,323 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {783#true} {783#true} #71#return; {783#true} is VALID [2022-04-27 14:29:09,323 INFO L290 TraceCheckUtils]: 2: Hoare triple {783#true} assume true; {783#true} is VALID [2022-04-27 14:29:09,323 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-27 14:29:09,323 INFO L272 TraceCheckUtils]: 0: Hoare triple {783#true} call ULTIMATE.init(); {783#true} is VALID [2022-04-27 14:29:09,323 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-04-27 14:29:09,323 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 14:29:09,323 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1461856817] [2022-04-27 14:29:09,323 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 14:29:09,323 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [83888594] [2022-04-27 14:29:09,324 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [83888594] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 14:29:09,324 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-27 14:29:09,324 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9] total 14 [2022-04-27 14:29:09,324 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1616742065] [2022-04-27 14:29:09,324 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-27 14:29:09,324 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 1.9285714285714286) internal successors, (27), 13 states have internal predecessors, (27), 4 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (6), 3 states have call predecessors, (6), 2 states have call successors, (6) Word has length 37 [2022-04-27 14:29:09,325 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 14:29:09,325 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 14 states, 14 states have (on average 1.9285714285714286) internal successors, (27), 13 states have internal predecessors, (27), 4 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (6), 3 states have call predecessors, (6), 2 states have call successors, (6) [2022-04-27 14:29:13,363 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 42 edges. 40 inductive. 0 not inductive. 2 times theorem prover too weak to decide inductivity. [2022-04-27 14:29:13,363 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-04-27 14:29:13,363 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 14:29:13,363 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-04-27 14:29:13,364 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=142, Unknown=0, NotChecked=0, Total=182 [2022-04-27 14:29:13,364 INFO L87 Difference]: Start difference. First operand 34 states and 38 transitions. Second operand has 14 states, 14 states have (on average 1.9285714285714286) internal successors, (27), 13 states have internal predecessors, (27), 4 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (6), 3 states have call predecessors, (6), 2 states have call successors, (6) [2022-04-27 14:29:18,531 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-27 14:29:27,702 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.82s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-27 14:29:31,725 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-27 14:29:34,685 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:29:34,685 INFO L93 Difference]: Finished difference Result 52 states and 60 transitions. [2022-04-27 14:29:34,685 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-04-27 14:29:34,685 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 1.9285714285714286) internal successors, (27), 13 states have internal predecessors, (27), 4 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (6), 3 states have call predecessors, (6), 2 states have call successors, (6) Word has length 37 [2022-04-27 14:29:34,686 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 14:29:34,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 1.9285714285714286) internal successors, (27), 13 states have internal predecessors, (27), 4 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (6), 3 states have call predecessors, (6), 2 states have call successors, (6) [2022-04-27 14:29:34,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 57 transitions. [2022-04-27 14:29:34,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 1.9285714285714286) internal successors, (27), 13 states have internal predecessors, (27), 4 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (6), 3 states have call predecessors, (6), 2 states have call successors, (6) [2022-04-27 14:29:34,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 57 transitions. [2022-04-27 14:29:34,688 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 13 states and 57 transitions. [2022-04-27 14:29:36,583 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 57 edges. 57 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 14:29:36,585 INFO L225 Difference]: With dead ends: 52 [2022-04-27 14:29:36,585 INFO L226 Difference]: Without dead ends: 50 [2022-04-27 14:29:36,585 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 58 SyntacticMatches, 3 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 9.5s TimeCoverageRelationStatistics Valid=66, Invalid=240, Unknown=0, NotChecked=0, Total=306 [2022-04-27 14:29:36,585 INFO L413 NwaCegarLoop]: 24 mSDtfsCounter, 28 mSDsluCounter, 127 mSDsCounter, 0 mSdLazyCounter, 167 mSolverCounterSat, 14 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 151 SdHoareTripleChecker+Invalid, 183 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 167 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.2s IncrementalHoareTripleChecker+Time [2022-04-27 14:29:36,586 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 151 Invalid, 183 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 167 Invalid, 2 Unknown, 0 Unchecked, 8.2s Time] [2022-04-27 14:29:36,586 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2022-04-27 14:29:36,596 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 41. [2022-04-27 14:29:36,596 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 14:29:36,597 INFO L82 GeneralOperation]: Start isEquivalent. First operand 50 states. Second operand has 41 states, 26 states have (on average 1.1153846153846154) internal successors, (29), 28 states have internal predecessors, (29), 9 states have call successors, (9), 6 states have call predecessors, (9), 5 states have return successors, (7), 6 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-27 14:29:36,597 INFO L74 IsIncluded]: Start isIncluded. First operand 50 states. Second operand has 41 states, 26 states have (on average 1.1153846153846154) internal successors, (29), 28 states have internal predecessors, (29), 9 states have call successors, (9), 6 states have call predecessors, (9), 5 states have return successors, (7), 6 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-27 14:29:36,597 INFO L87 Difference]: Start difference. First operand 50 states. Second operand has 41 states, 26 states have (on average 1.1153846153846154) internal successors, (29), 28 states have internal predecessors, (29), 9 states have call successors, (9), 6 states have call predecessors, (9), 5 states have return successors, (7), 6 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-27 14:29:36,598 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:29:36,598 INFO L93 Difference]: Finished difference Result 50 states and 58 transitions. [2022-04-27 14:29:36,599 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 58 transitions. [2022-04-27 14:29:36,599 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:29:36,599 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 14:29:36,599 INFO L74 IsIncluded]: Start isIncluded. First operand has 41 states, 26 states have (on average 1.1153846153846154) internal successors, (29), 28 states have internal predecessors, (29), 9 states have call successors, (9), 6 states have call predecessors, (9), 5 states have return successors, (7), 6 states have call predecessors, (7), 7 states have call successors, (7) Second operand 50 states. [2022-04-27 14:29:36,599 INFO L87 Difference]: Start difference. First operand has 41 states, 26 states have (on average 1.1153846153846154) internal successors, (29), 28 states have internal predecessors, (29), 9 states have call successors, (9), 6 states have call predecessors, (9), 5 states have return successors, (7), 6 states have call predecessors, (7), 7 states have call successors, (7) Second operand 50 states. [2022-04-27 14:29:36,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:29:36,601 INFO L93 Difference]: Finished difference Result 50 states and 58 transitions. [2022-04-27 14:29:36,601 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 58 transitions. [2022-04-27 14:29:36,601 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:29:36,601 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 14:29:36,601 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 14:29:36,601 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 14:29:36,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 26 states have (on average 1.1153846153846154) internal successors, (29), 28 states have internal predecessors, (29), 9 states have call successors, (9), 6 states have call predecessors, (9), 5 states have return successors, (7), 6 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-27 14:29:36,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 45 transitions. [2022-04-27 14:29:36,603 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 45 transitions. Word has length 37 [2022-04-27 14:29:36,603 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 14:29:36,603 INFO L495 AbstractCegarLoop]: Abstraction has 41 states and 45 transitions. [2022-04-27 14:29:36,603 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 1.9285714285714286) internal successors, (27), 13 states have internal predecessors, (27), 4 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (6), 3 states have call predecessors, (6), 2 states have call successors, (6) [2022-04-27 14:29:36,603 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 45 transitions. [2022-04-27 14:29:36,604 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-04-27 14:29:36,619 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 14:29:36,619 INFO L195 NwaCegarLoop]: 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-27 14:29:36,646 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2022-04-27 14:29:36,820 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 14:29:36,820 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 14:29:36,821 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 14:29:36,821 INFO L85 PathProgramCache]: Analyzing trace with hash -497884428, now seen corresponding path program 1 times [2022-04-27 14:29:36,821 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 14:29:36,821 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [149704604] [2022-04-27 14:29:36,821 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 14:29:36,821 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 14:29:36,852 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 14:29:36,853 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [483307707] [2022-04-27 14:29:36,853 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 14:29:36,853 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 14:29:36,853 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 14:29:36,855 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-27 14:29:36,863 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-04-27 14:29:36,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 14:29:36,899 INFO L263 TraceCheckSpWp]: Trace formula consists of 106 conjuncts, 28 conjunts are in the unsatisfiable core [2022-04-27 14:29:36,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 14:29:36,909 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 14:29:39,468 INFO L272 TraceCheckUtils]: 0: Hoare triple {1258#true} call ULTIMATE.init(); {1258#true} is VALID [2022-04-27 14:29:39,469 INFO L290 TraceCheckUtils]: 1: Hoare triple {1258#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); {1258#true} is VALID [2022-04-27 14:29:39,469 INFO L290 TraceCheckUtils]: 2: Hoare triple {1258#true} assume true; {1258#true} is VALID [2022-04-27 14:29:39,469 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1258#true} {1258#true} #71#return; {1258#true} is VALID [2022-04-27 14:29:39,469 INFO L272 TraceCheckUtils]: 4: Hoare triple {1258#true} call #t~ret6 := main(); {1258#true} is VALID [2022-04-27 14:29:39,469 INFO L290 TraceCheckUtils]: 5: Hoare triple {1258#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; {1258#true} is VALID [2022-04-27 14:29:39,469 INFO L272 TraceCheckUtils]: 6: Hoare triple {1258#true} call assume_abort_if_not((if ~a~0 >= 0 && ~a~0 <= 5 then 1 else 0)); {1258#true} is VALID [2022-04-27 14:29:39,469 INFO L290 TraceCheckUtils]: 7: Hoare triple {1258#true} ~cond := #in~cond; {1258#true} is VALID [2022-04-27 14:29:39,469 INFO L290 TraceCheckUtils]: 8: Hoare triple {1258#true} assume !(0 == ~cond); {1258#true} is VALID [2022-04-27 14:29:39,469 INFO L290 TraceCheckUtils]: 9: Hoare triple {1258#true} assume true; {1258#true} is VALID [2022-04-27 14:29:39,469 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1258#true} {1258#true} #61#return; {1258#true} is VALID [2022-04-27 14:29:39,469 INFO L290 TraceCheckUtils]: 11: Hoare triple {1258#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~b~0 := #t~nondet5;havoc #t~nondet5; {1258#true} is VALID [2022-04-27 14:29:39,470 INFO L272 TraceCheckUtils]: 12: Hoare triple {1258#true} call assume_abort_if_not((if ~b~0 >= 0 && ~b~0 <= 5 then 1 else 0)); {1258#true} is VALID [2022-04-27 14:29:39,470 INFO L290 TraceCheckUtils]: 13: Hoare triple {1258#true} ~cond := #in~cond; {1258#true} is VALID [2022-04-27 14:29:39,470 INFO L290 TraceCheckUtils]: 14: Hoare triple {1258#true} assume !(0 == ~cond); {1258#true} is VALID [2022-04-27 14:29:39,470 INFO L290 TraceCheckUtils]: 15: Hoare triple {1258#true} assume true; {1258#true} is VALID [2022-04-27 14:29:39,470 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {1258#true} {1258#true} #63#return; {1258#true} is VALID [2022-04-27 14:29:39,470 INFO L272 TraceCheckUtils]: 17: Hoare triple {1258#true} call assume_abort_if_not((if ~b~0 >= 1 then 1 else 0)); {1258#true} is VALID [2022-04-27 14:29:39,470 INFO L290 TraceCheckUtils]: 18: Hoare triple {1258#true} ~cond := #in~cond; {1317#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-04-27 14:29:39,471 INFO L290 TraceCheckUtils]: 19: Hoare triple {1317#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} assume !(0 == ~cond); {1321#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-27 14:29:39,471 INFO L290 TraceCheckUtils]: 20: Hoare triple {1321#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {1321#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-27 14:29:39,471 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {1321#(not (= |assume_abort_if_not_#in~cond| 0))} {1258#true} #65#return; {1328#(<= 1 main_~b~0)} is VALID [2022-04-27 14:29:39,472 INFO L290 TraceCheckUtils]: 22: Hoare triple {1328#(<= 1 main_~b~0)} ~x~0 := ~a~0;~y~0 := ~b~0;~z~0 := 0; {1332#(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-27 14:29:39,472 INFO L290 TraceCheckUtils]: 23: Hoare triple {1332#(and (= main_~z~0 0) (= main_~b~0 main_~y~0) (<= 1 main_~b~0) (= main_~a~0 main_~x~0))} assume !false; {1332#(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-27 14:29:39,472 INFO L272 TraceCheckUtils]: 24: Hoare triple {1332#(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)); {1258#true} is VALID [2022-04-27 14:29:39,473 INFO L290 TraceCheckUtils]: 25: Hoare triple {1258#true} ~cond := #in~cond; {1342#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-27 14:29:39,473 INFO L290 TraceCheckUtils]: 26: Hoare triple {1342#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {1346#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 14:29:39,473 INFO L290 TraceCheckUtils]: 27: Hoare triple {1346#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {1346#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 14:29:39,474 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {1346#(not (= |__VERIFIER_assert_#in~cond| 0))} {1332#(and (= main_~z~0 0) (= main_~b~0 main_~y~0) (<= 1 main_~b~0) (= main_~a~0 main_~x~0))} #67#return; {1332#(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-27 14:29:39,474 INFO L290 TraceCheckUtils]: 29: Hoare triple {1332#(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); {1332#(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-27 14:29:39,475 INFO L290 TraceCheckUtils]: 30: Hoare triple {1332#(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)); {1359#(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-27 14:29:39,476 INFO L290 TraceCheckUtils]: 31: Hoare triple {1359#(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); {1363#(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-27 14:29:39,476 INFO L290 TraceCheckUtils]: 32: Hoare triple {1363#(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; {1363#(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-27 14:29:39,478 INFO L272 TraceCheckUtils]: 33: Hoare triple {1363#(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)); {1370#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 14:29:39,479 INFO L290 TraceCheckUtils]: 34: Hoare triple {1370#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1374#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 14:29:39,479 INFO L290 TraceCheckUtils]: 35: Hoare triple {1374#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1259#false} is VALID [2022-04-27 14:29:39,479 INFO L290 TraceCheckUtils]: 36: Hoare triple {1259#false} assume !false; {1259#false} is VALID [2022-04-27 14:29:39,480 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-27 14:29:39,480 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 14:30:16,966 INFO L290 TraceCheckUtils]: 36: Hoare triple {1259#false} assume !false; {1259#false} is VALID [2022-04-27 14:30:16,966 INFO L290 TraceCheckUtils]: 35: Hoare triple {1374#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1259#false} is VALID [2022-04-27 14:30:16,967 INFO L290 TraceCheckUtils]: 34: Hoare triple {1370#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1374#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 14:30:16,968 INFO L272 TraceCheckUtils]: 33: Hoare triple {1390#(= (+ 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)); {1370#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 14:30:16,968 INFO L290 TraceCheckUtils]: 32: Hoare triple {1390#(= (+ main_~z~0 (* main_~y~0 main_~x~0)) (* main_~b~0 main_~a~0))} assume !false; {1390#(= (+ main_~z~0 (* main_~y~0 main_~x~0)) (* main_~b~0 main_~a~0))} is VALID [2022-04-27 14:30:16,972 INFO L290 TraceCheckUtils]: 31: Hoare triple {1397#(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); {1390#(= (+ main_~z~0 (* main_~y~0 main_~x~0)) (* main_~b~0 main_~a~0))} is VALID [2022-04-27 14:30:16,973 INFO L290 TraceCheckUtils]: 30: Hoare triple {1401#(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)); {1397#(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-27 14:30:16,973 INFO L290 TraceCheckUtils]: 29: Hoare triple {1401#(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); {1401#(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-27 14:30:16,976 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {1346#(not (= |__VERIFIER_assert_#in~cond| 0))} {1408#(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; {1401#(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-27 14:30:16,976 INFO L290 TraceCheckUtils]: 27: Hoare triple {1346#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {1346#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 14:30:16,976 INFO L290 TraceCheckUtils]: 26: Hoare triple {1418#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} assume !(0 == ~cond); {1346#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 14:30:16,977 INFO L290 TraceCheckUtils]: 25: Hoare triple {1258#true} ~cond := #in~cond; {1418#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-27 14:30:16,977 INFO L272 TraceCheckUtils]: 24: Hoare triple {1408#(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)); {1258#true} is VALID [2022-04-27 14:30:16,977 INFO L290 TraceCheckUtils]: 23: Hoare triple {1408#(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; {1408#(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-27 14:30:16,978 INFO L290 TraceCheckUtils]: 22: Hoare triple {1428#(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; {1408#(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-27 14:30:16,978 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {1321#(not (= |assume_abort_if_not_#in~cond| 0))} {1258#true} #65#return; {1428#(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-27 14:30:16,979 INFO L290 TraceCheckUtils]: 20: Hoare triple {1321#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {1321#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-27 14:30:16,979 INFO L290 TraceCheckUtils]: 19: Hoare triple {1441#(or (not (= |assume_abort_if_not_#in~cond| 0)) (= assume_abort_if_not_~cond 0))} assume !(0 == ~cond); {1321#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-27 14:30:16,979 INFO L290 TraceCheckUtils]: 18: Hoare triple {1258#true} ~cond := #in~cond; {1441#(or (not (= |assume_abort_if_not_#in~cond| 0)) (= assume_abort_if_not_~cond 0))} is VALID [2022-04-27 14:30:16,980 INFO L272 TraceCheckUtils]: 17: Hoare triple {1258#true} call assume_abort_if_not((if ~b~0 >= 1 then 1 else 0)); {1258#true} is VALID [2022-04-27 14:30:16,980 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {1258#true} {1258#true} #63#return; {1258#true} is VALID [2022-04-27 14:30:16,980 INFO L290 TraceCheckUtils]: 15: Hoare triple {1258#true} assume true; {1258#true} is VALID [2022-04-27 14:30:16,980 INFO L290 TraceCheckUtils]: 14: Hoare triple {1258#true} assume !(0 == ~cond); {1258#true} is VALID [2022-04-27 14:30:16,980 INFO L290 TraceCheckUtils]: 13: Hoare triple {1258#true} ~cond := #in~cond; {1258#true} is VALID [2022-04-27 14:30:16,980 INFO L272 TraceCheckUtils]: 12: Hoare triple {1258#true} call assume_abort_if_not((if ~b~0 >= 0 && ~b~0 <= 5 then 1 else 0)); {1258#true} is VALID [2022-04-27 14:30:16,980 INFO L290 TraceCheckUtils]: 11: Hoare triple {1258#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~b~0 := #t~nondet5;havoc #t~nondet5; {1258#true} is VALID [2022-04-27 14:30:16,980 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1258#true} {1258#true} #61#return; {1258#true} is VALID [2022-04-27 14:30:16,980 INFO L290 TraceCheckUtils]: 9: Hoare triple {1258#true} assume true; {1258#true} is VALID [2022-04-27 14:30:16,980 INFO L290 TraceCheckUtils]: 8: Hoare triple {1258#true} assume !(0 == ~cond); {1258#true} is VALID [2022-04-27 14:30:16,980 INFO L290 TraceCheckUtils]: 7: Hoare triple {1258#true} ~cond := #in~cond; {1258#true} is VALID [2022-04-27 14:30:16,980 INFO L272 TraceCheckUtils]: 6: Hoare triple {1258#true} call assume_abort_if_not((if ~a~0 >= 0 && ~a~0 <= 5 then 1 else 0)); {1258#true} is VALID [2022-04-27 14:30:16,981 INFO L290 TraceCheckUtils]: 5: Hoare triple {1258#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; {1258#true} is VALID [2022-04-27 14:30:16,981 INFO L272 TraceCheckUtils]: 4: Hoare triple {1258#true} call #t~ret6 := main(); {1258#true} is VALID [2022-04-27 14:30:16,981 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1258#true} {1258#true} #71#return; {1258#true} is VALID [2022-04-27 14:30:16,981 INFO L290 TraceCheckUtils]: 2: Hoare triple {1258#true} assume true; {1258#true} is VALID [2022-04-27 14:30:16,981 INFO L290 TraceCheckUtils]: 1: Hoare triple {1258#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); {1258#true} is VALID [2022-04-27 14:30:16,981 INFO L272 TraceCheckUtils]: 0: Hoare triple {1258#true} call ULTIMATE.init(); {1258#true} is VALID [2022-04-27 14:30:16,981 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-27 14:30:16,981 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 14:30:16,981 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [149704604] [2022-04-27 14:30:16,981 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 14:30:16,981 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [483307707] [2022-04-27 14:30:16,982 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [483307707] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 14:30:16,982 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-27 14:30:16,982 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 13] total 19 [2022-04-27 14:30:16,982 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1776432635] [2022-04-27 14:30:16,982 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-27 14:30:16,982 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-27 14:30:16,983 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 14:30:16,983 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-27 14:30:17,019 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 48 edges. 48 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 14:30:17,020 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-04-27 14:30:17,020 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 14:30:17,020 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-04-27 14:30:17,020 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=280, Unknown=0, NotChecked=0, Total=342 [2022-04-27 14:30:17,020 INFO L87 Difference]: Start difference. First operand 41 states and 45 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-27 14:30:19,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:30:19,067 INFO L93 Difference]: Finished difference Result 66 states and 77 transitions. [2022-04-27 14:30:19,068 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-04-27 14:30:19,068 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-27 14:30:19,068 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 14:30:19,068 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-27 14:30:19,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 67 transitions. [2022-04-27 14:30:19,070 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-27 14:30:19,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 67 transitions. [2022-04-27 14:30:19,071 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 17 states and 67 transitions. [2022-04-27 14:30:19,133 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 67 edges. 67 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 14:30:19,134 INFO L225 Difference]: With dead ends: 66 [2022-04-27 14:30:19,134 INFO L226 Difference]: Without dead ends: 59 [2022-04-27 14:30:19,135 INFO L412 NwaCegarLoop]: 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-27 14:30:19,135 INFO L413 NwaCegarLoop]: 19 mSDtfsCounter, 46 mSDsluCounter, 120 mSDsCounter, 0 mSdLazyCounter, 293 mSolverCounterSat, 47 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 139 SdHoareTripleChecker+Invalid, 340 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Valid, 293 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-04-27 14:30:19,136 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 139 Invalid, 340 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [47 Valid, 293 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-04-27 14:30:19,136 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2022-04-27 14:30:19,165 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2022-04-27 14:30:19,165 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 14:30:19,165 INFO L82 GeneralOperation]: Start isEquivalent. First operand 59 states. Second operand has 59 states, 40 states have (on average 1.175) internal successors, (47), 43 states have internal predecessors, (47), 12 states have call successors, (12), 7 states have call predecessors, (12), 6 states have return successors, (10), 8 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-27 14:30:19,166 INFO L74 IsIncluded]: Start isIncluded. First operand 59 states. Second operand has 59 states, 40 states have (on average 1.175) internal successors, (47), 43 states have internal predecessors, (47), 12 states have call successors, (12), 7 states have call predecessors, (12), 6 states have return successors, (10), 8 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-27 14:30:19,168 INFO L87 Difference]: Start difference. First operand 59 states. Second operand has 59 states, 40 states have (on average 1.175) internal successors, (47), 43 states have internal predecessors, (47), 12 states have call successors, (12), 7 states have call predecessors, (12), 6 states have return successors, (10), 8 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-27 14:30:19,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:30:19,170 INFO L93 Difference]: Finished difference Result 59 states and 69 transitions. [2022-04-27 14:30:19,170 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 69 transitions. [2022-04-27 14:30:19,170 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:30:19,170 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 14:30:19,170 INFO L74 IsIncluded]: Start isIncluded. First operand has 59 states, 40 states have (on average 1.175) internal successors, (47), 43 states have internal predecessors, (47), 12 states have call successors, (12), 7 states have call predecessors, (12), 6 states have return successors, (10), 8 states have call predecessors, (10), 10 states have call successors, (10) Second operand 59 states. [2022-04-27 14:30:19,171 INFO L87 Difference]: Start difference. First operand has 59 states, 40 states have (on average 1.175) internal successors, (47), 43 states have internal predecessors, (47), 12 states have call successors, (12), 7 states have call predecessors, (12), 6 states have return successors, (10), 8 states have call predecessors, (10), 10 states have call successors, (10) Second operand 59 states. [2022-04-27 14:30:19,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:30:19,172 INFO L93 Difference]: Finished difference Result 59 states and 69 transitions. [2022-04-27 14:30:19,172 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 69 transitions. [2022-04-27 14:30:19,173 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:30:19,173 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 14:30:19,173 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 14:30:19,173 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 14:30:19,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 40 states have (on average 1.175) internal successors, (47), 43 states have internal predecessors, (47), 12 states have call successors, (12), 7 states have call predecessors, (12), 6 states have return successors, (10), 8 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-27 14:30:19,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 69 transitions. [2022-04-27 14:30:19,176 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 69 transitions. Word has length 37 [2022-04-27 14:30:19,176 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 14:30:19,176 INFO L495 AbstractCegarLoop]: Abstraction has 59 states and 69 transitions. [2022-04-27 14:30:19,176 INFO L496 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-27 14:30:19,176 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 69 transitions. [2022-04-27 14:30:19,177 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2022-04-27 14:30:19,177 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 14:30:19,177 INFO L195 NwaCegarLoop]: 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-27 14:30:19,195 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2022-04-27 14:30:19,395 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 14:30:19,396 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 14:30:19,396 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 14:30:19,396 INFO L85 PathProgramCache]: Analyzing trace with hash -1351630086, now seen corresponding path program 1 times [2022-04-27 14:30:19,396 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 14:30:19,396 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1498822899] [2022-04-27 14:30:19,396 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 14:30:19,396 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 14:30:19,409 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 14:30:19,409 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1480652285] [2022-04-27 14:30:19,409 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 14:30:19,409 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 14:30:19,409 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 14:30:19,410 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-27 14:30:19,411 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-04-27 14:30:19,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 14:30:19,448 INFO L263 TraceCheckSpWp]: Trace formula consists of 122 conjuncts, 10 conjunts are in the unsatisfiable core [2022-04-27 14:30:19,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 14:30:19,482 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 14:30:29,633 INFO L272 TraceCheckUtils]: 0: Hoare triple {1807#true} call ULTIMATE.init(); {1807#true} is VALID [2022-04-27 14:30:29,633 INFO L290 TraceCheckUtils]: 1: Hoare triple {1807#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); {1807#true} is VALID [2022-04-27 14:30:29,633 INFO L290 TraceCheckUtils]: 2: Hoare triple {1807#true} assume true; {1807#true} is VALID [2022-04-27 14:30:29,633 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1807#true} {1807#true} #71#return; {1807#true} is VALID [2022-04-27 14:30:29,633 INFO L272 TraceCheckUtils]: 4: Hoare triple {1807#true} call #t~ret6 := main(); {1807#true} is VALID [2022-04-27 14:30:29,633 INFO L290 TraceCheckUtils]: 5: Hoare triple {1807#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; {1807#true} is VALID [2022-04-27 14:30:29,633 INFO L272 TraceCheckUtils]: 6: Hoare triple {1807#true} call assume_abort_if_not((if ~a~0 >= 0 && ~a~0 <= 5 then 1 else 0)); {1807#true} is VALID [2022-04-27 14:30:29,633 INFO L290 TraceCheckUtils]: 7: Hoare triple {1807#true} ~cond := #in~cond; {1807#true} is VALID [2022-04-27 14:30:29,634 INFO L290 TraceCheckUtils]: 8: Hoare triple {1807#true} assume !(0 == ~cond); {1807#true} is VALID [2022-04-27 14:30:29,634 INFO L290 TraceCheckUtils]: 9: Hoare triple {1807#true} assume true; {1807#true} is VALID [2022-04-27 14:30:29,634 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1807#true} {1807#true} #61#return; {1807#true} is VALID [2022-04-27 14:30:29,634 INFO L290 TraceCheckUtils]: 11: Hoare triple {1807#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~b~0 := #t~nondet5;havoc #t~nondet5; {1807#true} is VALID [2022-04-27 14:30:29,634 INFO L272 TraceCheckUtils]: 12: Hoare triple {1807#true} call assume_abort_if_not((if ~b~0 >= 0 && ~b~0 <= 5 then 1 else 0)); {1807#true} is VALID [2022-04-27 14:30:29,634 INFO L290 TraceCheckUtils]: 13: Hoare triple {1807#true} ~cond := #in~cond; {1807#true} is VALID [2022-04-27 14:30:29,634 INFO L290 TraceCheckUtils]: 14: Hoare triple {1807#true} assume !(0 == ~cond); {1807#true} is VALID [2022-04-27 14:30:29,634 INFO L290 TraceCheckUtils]: 15: Hoare triple {1807#true} assume true; {1807#true} is VALID [2022-04-27 14:30:29,634 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {1807#true} {1807#true} #63#return; {1807#true} is VALID [2022-04-27 14:30:29,634 INFO L272 TraceCheckUtils]: 17: Hoare triple {1807#true} call assume_abort_if_not((if ~b~0 >= 1 then 1 else 0)); {1807#true} is VALID [2022-04-27 14:30:29,634 INFO L290 TraceCheckUtils]: 18: Hoare triple {1807#true} ~cond := #in~cond; {1807#true} is VALID [2022-04-27 14:30:29,634 INFO L290 TraceCheckUtils]: 19: Hoare triple {1807#true} assume !(0 == ~cond); {1807#true} is VALID [2022-04-27 14:30:29,635 INFO L290 TraceCheckUtils]: 20: Hoare triple {1807#true} assume true; {1807#true} is VALID [2022-04-27 14:30:29,635 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {1807#true} {1807#true} #65#return; {1807#true} is VALID [2022-04-27 14:30:29,635 INFO L290 TraceCheckUtils]: 22: Hoare triple {1807#true} ~x~0 := ~a~0;~y~0 := ~b~0;~z~0 := 0; {1807#true} is VALID [2022-04-27 14:30:29,635 INFO L290 TraceCheckUtils]: 23: Hoare triple {1807#true} assume !false; {1807#true} is VALID [2022-04-27 14:30:29,635 INFO L272 TraceCheckUtils]: 24: Hoare triple {1807#true} call __VERIFIER_assert((if ~z~0 + ~x~0 * ~y~0 == ~a~0 * ~b~0 then 1 else 0)); {1807#true} is VALID [2022-04-27 14:30:29,635 INFO L290 TraceCheckUtils]: 25: Hoare triple {1807#true} ~cond := #in~cond; {1807#true} is VALID [2022-04-27 14:30:29,635 INFO L290 TraceCheckUtils]: 26: Hoare triple {1807#true} assume !(0 == ~cond); {1807#true} is VALID [2022-04-27 14:30:29,635 INFO L290 TraceCheckUtils]: 27: Hoare triple {1807#true} assume true; {1807#true} is VALID [2022-04-27 14:30:29,635 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {1807#true} {1807#true} #67#return; {1807#true} is VALID [2022-04-27 14:30:29,635 INFO L290 TraceCheckUtils]: 29: Hoare triple {1807#true} assume !!(0 != ~y~0); {1807#true} is VALID [2022-04-27 14:30:29,635 INFO L290 TraceCheckUtils]: 30: Hoare triple {1807#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; {1807#true} is VALID [2022-04-27 14:30:29,635 INFO L290 TraceCheckUtils]: 31: Hoare triple {1807#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); {1807#true} is VALID [2022-04-27 14:30:29,636 INFO L290 TraceCheckUtils]: 32: Hoare triple {1807#true} assume !false; {1807#true} is VALID [2022-04-27 14:30:29,636 INFO L272 TraceCheckUtils]: 33: Hoare triple {1807#true} call __VERIFIER_assert((if ~z~0 + ~x~0 * ~y~0 == ~a~0 * ~b~0 then 1 else 0)); {1807#true} is VALID [2022-04-27 14:30:29,638 INFO L290 TraceCheckUtils]: 34: Hoare triple {1807#true} ~cond := #in~cond; {1914#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-27 14:30:29,638 INFO L290 TraceCheckUtils]: 35: Hoare triple {1914#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {1918#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 14:30:29,639 INFO L290 TraceCheckUtils]: 36: Hoare triple {1918#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {1918#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 14:30:31,641 WARN L284 TraceCheckUtils]: 37: Hoare quadruple {1918#(not (= |__VERIFIER_assert_#in~cond| 0))} {1807#true} #67#return; {1925#(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-27 14:30:31,641 INFO L290 TraceCheckUtils]: 38: Hoare triple {1925#(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); {1929#(= main_~z~0 (* main_~b~0 main_~a~0))} is VALID [2022-04-27 14:30:31,642 INFO L272 TraceCheckUtils]: 39: Hoare triple {1929#(= main_~z~0 (* main_~b~0 main_~a~0))} call __VERIFIER_assert((if ~z~0 == ~a~0 * ~b~0 then 1 else 0)); {1933#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 14:30:31,642 INFO L290 TraceCheckUtils]: 40: Hoare triple {1933#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1937#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 14:30:31,643 INFO L290 TraceCheckUtils]: 41: Hoare triple {1937#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1808#false} is VALID [2022-04-27 14:30:31,643 INFO L290 TraceCheckUtils]: 42: Hoare triple {1808#false} assume !false; {1808#false} is VALID [2022-04-27 14:30:31,643 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-27 14:30:31,643 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 14:30:38,559 INFO L290 TraceCheckUtils]: 42: Hoare triple {1808#false} assume !false; {1808#false} is VALID [2022-04-27 14:30:38,560 INFO L290 TraceCheckUtils]: 41: Hoare triple {1937#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1808#false} is VALID [2022-04-27 14:30:38,560 INFO L290 TraceCheckUtils]: 40: Hoare triple {1933#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1937#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 14:30:38,561 INFO L272 TraceCheckUtils]: 39: Hoare triple {1929#(= main_~z~0 (* main_~b~0 main_~a~0))} call __VERIFIER_assert((if ~z~0 == ~a~0 * ~b~0 then 1 else 0)); {1933#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 14:30:38,561 INFO L290 TraceCheckUtils]: 38: Hoare triple {1956#(or (not (= main_~y~0 0)) (= main_~z~0 (* main_~b~0 main_~a~0)))} assume !(0 != ~y~0); {1929#(= main_~z~0 (* main_~b~0 main_~a~0))} is VALID [2022-04-27 14:30:38,562 INFO L284 TraceCheckUtils]: 37: Hoare quadruple {1918#(not (= |__VERIFIER_assert_#in~cond| 0))} {1807#true} #67#return; {1956#(or (not (= main_~y~0 0)) (= main_~z~0 (* main_~b~0 main_~a~0)))} is VALID [2022-04-27 14:30:38,562 INFO L290 TraceCheckUtils]: 36: Hoare triple {1918#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {1918#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 14:30:38,563 INFO L290 TraceCheckUtils]: 35: Hoare triple {1969#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} assume !(0 == ~cond); {1918#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 14:30:38,563 INFO L290 TraceCheckUtils]: 34: Hoare triple {1807#true} ~cond := #in~cond; {1969#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-27 14:30:38,563 INFO L272 TraceCheckUtils]: 33: Hoare triple {1807#true} call __VERIFIER_assert((if ~z~0 + ~x~0 * ~y~0 == ~a~0 * ~b~0 then 1 else 0)); {1807#true} is VALID [2022-04-27 14:30:38,563 INFO L290 TraceCheckUtils]: 32: Hoare triple {1807#true} assume !false; {1807#true} is VALID [2022-04-27 14:30:38,563 INFO L290 TraceCheckUtils]: 31: Hoare triple {1807#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); {1807#true} is VALID [2022-04-27 14:30:38,563 INFO L290 TraceCheckUtils]: 30: Hoare triple {1807#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; {1807#true} is VALID [2022-04-27 14:30:38,563 INFO L290 TraceCheckUtils]: 29: Hoare triple {1807#true} assume !!(0 != ~y~0); {1807#true} is VALID [2022-04-27 14:30:38,563 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {1807#true} {1807#true} #67#return; {1807#true} is VALID [2022-04-27 14:30:38,564 INFO L290 TraceCheckUtils]: 27: Hoare triple {1807#true} assume true; {1807#true} is VALID [2022-04-27 14:30:38,564 INFO L290 TraceCheckUtils]: 26: Hoare triple {1807#true} assume !(0 == ~cond); {1807#true} is VALID [2022-04-27 14:30:38,564 INFO L290 TraceCheckUtils]: 25: Hoare triple {1807#true} ~cond := #in~cond; {1807#true} is VALID [2022-04-27 14:30:38,564 INFO L272 TraceCheckUtils]: 24: Hoare triple {1807#true} call __VERIFIER_assert((if ~z~0 + ~x~0 * ~y~0 == ~a~0 * ~b~0 then 1 else 0)); {1807#true} is VALID [2022-04-27 14:30:38,564 INFO L290 TraceCheckUtils]: 23: Hoare triple {1807#true} assume !false; {1807#true} is VALID [2022-04-27 14:30:38,564 INFO L290 TraceCheckUtils]: 22: Hoare triple {1807#true} ~x~0 := ~a~0;~y~0 := ~b~0;~z~0 := 0; {1807#true} is VALID [2022-04-27 14:30:38,564 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {1807#true} {1807#true} #65#return; {1807#true} is VALID [2022-04-27 14:30:38,564 INFO L290 TraceCheckUtils]: 20: Hoare triple {1807#true} assume true; {1807#true} is VALID [2022-04-27 14:30:38,564 INFO L290 TraceCheckUtils]: 19: Hoare triple {1807#true} assume !(0 == ~cond); {1807#true} is VALID [2022-04-27 14:30:38,564 INFO L290 TraceCheckUtils]: 18: Hoare triple {1807#true} ~cond := #in~cond; {1807#true} is VALID [2022-04-27 14:30:38,564 INFO L272 TraceCheckUtils]: 17: Hoare triple {1807#true} call assume_abort_if_not((if ~b~0 >= 1 then 1 else 0)); {1807#true} is VALID [2022-04-27 14:30:38,564 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {1807#true} {1807#true} #63#return; {1807#true} is VALID [2022-04-27 14:30:38,564 INFO L290 TraceCheckUtils]: 15: Hoare triple {1807#true} assume true; {1807#true} is VALID [2022-04-27 14:30:38,564 INFO L290 TraceCheckUtils]: 14: Hoare triple {1807#true} assume !(0 == ~cond); {1807#true} is VALID [2022-04-27 14:30:38,565 INFO L290 TraceCheckUtils]: 13: Hoare triple {1807#true} ~cond := #in~cond; {1807#true} is VALID [2022-04-27 14:30:38,565 INFO L272 TraceCheckUtils]: 12: Hoare triple {1807#true} call assume_abort_if_not((if ~b~0 >= 0 && ~b~0 <= 5 then 1 else 0)); {1807#true} is VALID [2022-04-27 14:30:38,565 INFO L290 TraceCheckUtils]: 11: Hoare triple {1807#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~b~0 := #t~nondet5;havoc #t~nondet5; {1807#true} is VALID [2022-04-27 14:30:38,565 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1807#true} {1807#true} #61#return; {1807#true} is VALID [2022-04-27 14:30:38,565 INFO L290 TraceCheckUtils]: 9: Hoare triple {1807#true} assume true; {1807#true} is VALID [2022-04-27 14:30:38,565 INFO L290 TraceCheckUtils]: 8: Hoare triple {1807#true} assume !(0 == ~cond); {1807#true} is VALID [2022-04-27 14:30:38,565 INFO L290 TraceCheckUtils]: 7: Hoare triple {1807#true} ~cond := #in~cond; {1807#true} is VALID [2022-04-27 14:30:38,565 INFO L272 TraceCheckUtils]: 6: Hoare triple {1807#true} call assume_abort_if_not((if ~a~0 >= 0 && ~a~0 <= 5 then 1 else 0)); {1807#true} is VALID [2022-04-27 14:30:38,565 INFO L290 TraceCheckUtils]: 5: Hoare triple {1807#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; {1807#true} is VALID [2022-04-27 14:30:38,565 INFO L272 TraceCheckUtils]: 4: Hoare triple {1807#true} call #t~ret6 := main(); {1807#true} is VALID [2022-04-27 14:30:38,565 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1807#true} {1807#true} #71#return; {1807#true} is VALID [2022-04-27 14:30:38,565 INFO L290 TraceCheckUtils]: 2: Hoare triple {1807#true} assume true; {1807#true} is VALID [2022-04-27 14:30:38,565 INFO L290 TraceCheckUtils]: 1: Hoare triple {1807#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); {1807#true} is VALID [2022-04-27 14:30:38,565 INFO L272 TraceCheckUtils]: 0: Hoare triple {1807#true} call ULTIMATE.init(); {1807#true} is VALID [2022-04-27 14:30:38,566 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-27 14:30:38,566 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 14:30:38,566 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1498822899] [2022-04-27 14:30:38,566 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 14:30:38,566 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1480652285] [2022-04-27 14:30:38,566 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1480652285] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 14:30:38,566 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-27 14:30:38,566 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 10 [2022-04-27 14:30:38,566 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [524574564] [2022-04-27 14:30:38,566 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-27 14:30:38,567 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-27 14:30:38,567 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 14:30:38,567 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-27 14:30:40,591 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-27 14:30:40,591 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-04-27 14:30:40,591 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 14:30:40,591 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-04-27 14:30:40,591 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2022-04-27 14:30:40,592 INFO L87 Difference]: Start difference. First operand 59 states and 69 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-27 14:30:42,636 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-27 14:30:43,065 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:30:43,065 INFO L93 Difference]: Finished difference Result 65 states and 74 transitions. [2022-04-27 14:30:43,065 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-27 14:30:43,065 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-27 14:30:43,065 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 14:30:43,065 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-27 14:30:43,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 37 transitions. [2022-04-27 14:30:43,066 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-27 14:30:43,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 37 transitions. [2022-04-27 14:30:43,067 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 37 transitions. [2022-04-27 14:30:45,096 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 37 edges. 36 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-27 14:30:45,098 INFO L225 Difference]: With dead ends: 65 [2022-04-27 14:30:45,098 INFO L226 Difference]: Without dead ends: 58 [2022-04-27 14:30:45,098 INFO L412 NwaCegarLoop]: 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-27 14:30:45,098 INFO L413 NwaCegarLoop]: 25 mSDtfsCounter, 16 mSDsluCounter, 76 mSDsCounter, 0 mSdLazyCounter, 64 mSolverCounterSat, 2 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 101 SdHoareTripleChecker+Invalid, 67 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 64 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2022-04-27 14:30:45,099 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 101 Invalid, 67 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 64 Invalid, 1 Unknown, 0 Unchecked, 2.2s Time] [2022-04-27 14:30:45,099 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2022-04-27 14:30:45,113 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 58. [2022-04-27 14:30:45,113 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 14:30:45,114 INFO L82 GeneralOperation]: Start isEquivalent. First operand 58 states. Second operand has 58 states, 40 states have (on average 1.125) internal successors, (45), 42 states have internal predecessors, (45), 11 states have call successors, (11), 7 states have call predecessors, (11), 6 states have return successors, (10), 8 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-27 14:30:45,114 INFO L74 IsIncluded]: Start isIncluded. First operand 58 states. Second operand has 58 states, 40 states have (on average 1.125) internal successors, (45), 42 states have internal predecessors, (45), 11 states have call successors, (11), 7 states have call predecessors, (11), 6 states have return successors, (10), 8 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-27 14:30:45,114 INFO L87 Difference]: Start difference. First operand 58 states. Second operand has 58 states, 40 states have (on average 1.125) internal successors, (45), 42 states have internal predecessors, (45), 11 states have call successors, (11), 7 states have call predecessors, (11), 6 states have return successors, (10), 8 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-27 14:30:45,115 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:30:45,115 INFO L93 Difference]: Finished difference Result 58 states and 66 transitions. [2022-04-27 14:30:45,115 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 66 transitions. [2022-04-27 14:30:45,116 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:30:45,116 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 14:30:45,116 INFO L74 IsIncluded]: Start isIncluded. First operand has 58 states, 40 states have (on average 1.125) internal successors, (45), 42 states have internal predecessors, (45), 11 states have call successors, (11), 7 states have call predecessors, (11), 6 states have return successors, (10), 8 states have call predecessors, (10), 10 states have call successors, (10) Second operand 58 states. [2022-04-27 14:30:45,116 INFO L87 Difference]: Start difference. First operand has 58 states, 40 states have (on average 1.125) internal successors, (45), 42 states have internal predecessors, (45), 11 states have call successors, (11), 7 states have call predecessors, (11), 6 states have return successors, (10), 8 states have call predecessors, (10), 10 states have call successors, (10) Second operand 58 states. [2022-04-27 14:30:45,117 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:30:45,117 INFO L93 Difference]: Finished difference Result 58 states and 66 transitions. [2022-04-27 14:30:45,117 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 66 transitions. [2022-04-27 14:30:45,118 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:30:45,118 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 14:30:45,118 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 14:30:45,118 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 14:30:45,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 40 states have (on average 1.125) internal successors, (45), 42 states have internal predecessors, (45), 11 states have call successors, (11), 7 states have call predecessors, (11), 6 states have return successors, (10), 8 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-27 14:30:45,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 66 transitions. [2022-04-27 14:30:45,119 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 66 transitions. Word has length 43 [2022-04-27 14:30:45,119 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 14:30:45,119 INFO L495 AbstractCegarLoop]: Abstraction has 58 states and 66 transitions. [2022-04-27 14:30:45,119 INFO L496 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-27 14:30:45,120 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 66 transitions. [2022-04-27 14:30:45,120 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2022-04-27 14:30:45,120 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 14:30:45,120 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 14:30:45,136 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-04-27 14:30:45,324 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 14:30:45,325 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 14:30:45,325 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 14:30:45,325 INFO L85 PathProgramCache]: Analyzing trace with hash -1494691206, now seen corresponding path program 1 times [2022-04-27 14:30:45,325 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 14:30:45,325 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2038677647] [2022-04-27 14:30:45,325 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 14:30:45,326 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 14:30:45,335 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 14:30:45,335 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1106893332] [2022-04-27 14:30:45,335 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 14:30:45,336 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 14:30:45,336 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 14:30:45,336 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-27 14:30:45,337 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-04-27 14:30:45,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 14:30:45,376 INFO L263 TraceCheckSpWp]: Trace formula consists of 127 conjuncts, 24 conjunts are in the unsatisfiable core [2022-04-27 14:30:45,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 14:30:45,390 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 14:31:14,152 WARN L828 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2022-04-27 14:31:35,602 INFO L272 TraceCheckUtils]: 0: Hoare triple {2367#true} call ULTIMATE.init(); {2367#true} is VALID [2022-04-27 14:31:35,602 INFO L290 TraceCheckUtils]: 1: Hoare triple {2367#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); {2367#true} is VALID [2022-04-27 14:31:35,602 INFO L290 TraceCheckUtils]: 2: Hoare triple {2367#true} assume true; {2367#true} is VALID [2022-04-27 14:31:35,603 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2367#true} {2367#true} #71#return; {2367#true} is VALID [2022-04-27 14:31:35,603 INFO L272 TraceCheckUtils]: 4: Hoare triple {2367#true} call #t~ret6 := main(); {2367#true} is VALID [2022-04-27 14:31:35,603 INFO L290 TraceCheckUtils]: 5: Hoare triple {2367#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; {2367#true} is VALID [2022-04-27 14:31:35,603 INFO L272 TraceCheckUtils]: 6: Hoare triple {2367#true} call assume_abort_if_not((if ~a~0 >= 0 && ~a~0 <= 5 then 1 else 0)); {2367#true} is VALID [2022-04-27 14:31:35,603 INFO L290 TraceCheckUtils]: 7: Hoare triple {2367#true} ~cond := #in~cond; {2367#true} is VALID [2022-04-27 14:31:35,603 INFO L290 TraceCheckUtils]: 8: Hoare triple {2367#true} assume !(0 == ~cond); {2367#true} is VALID [2022-04-27 14:31:35,603 INFO L290 TraceCheckUtils]: 9: Hoare triple {2367#true} assume true; {2367#true} is VALID [2022-04-27 14:31:35,603 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {2367#true} {2367#true} #61#return; {2367#true} is VALID [2022-04-27 14:31:35,603 INFO L290 TraceCheckUtils]: 11: Hoare triple {2367#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~b~0 := #t~nondet5;havoc #t~nondet5; {2367#true} is VALID [2022-04-27 14:31:35,603 INFO L272 TraceCheckUtils]: 12: Hoare triple {2367#true} call assume_abort_if_not((if ~b~0 >= 0 && ~b~0 <= 5 then 1 else 0)); {2367#true} is VALID [2022-04-27 14:31:35,603 INFO L290 TraceCheckUtils]: 13: Hoare triple {2367#true} ~cond := #in~cond; {2367#true} is VALID [2022-04-27 14:31:35,603 INFO L290 TraceCheckUtils]: 14: Hoare triple {2367#true} assume !(0 == ~cond); {2367#true} is VALID [2022-04-27 14:31:35,603 INFO L290 TraceCheckUtils]: 15: Hoare triple {2367#true} assume true; {2367#true} is VALID [2022-04-27 14:31:35,604 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {2367#true} {2367#true} #63#return; {2367#true} is VALID [2022-04-27 14:31:35,604 INFO L272 TraceCheckUtils]: 17: Hoare triple {2367#true} call assume_abort_if_not((if ~b~0 >= 1 then 1 else 0)); {2367#true} is VALID [2022-04-27 14:31:35,604 INFO L290 TraceCheckUtils]: 18: Hoare triple {2367#true} ~cond := #in~cond; {2367#true} is VALID [2022-04-27 14:31:35,604 INFO L290 TraceCheckUtils]: 19: Hoare triple {2367#true} assume !(0 == ~cond); {2367#true} is VALID [2022-04-27 14:31:35,604 INFO L290 TraceCheckUtils]: 20: Hoare triple {2367#true} assume true; {2367#true} is VALID [2022-04-27 14:31:35,604 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {2367#true} {2367#true} #65#return; {2367#true} is VALID [2022-04-27 14:31:35,604 INFO L290 TraceCheckUtils]: 22: Hoare triple {2367#true} ~x~0 := ~a~0;~y~0 := ~b~0;~z~0 := 0; {2438#(= main_~a~0 main_~x~0)} is VALID [2022-04-27 14:31:35,604 INFO L290 TraceCheckUtils]: 23: Hoare triple {2438#(= main_~a~0 main_~x~0)} assume !false; {2438#(= main_~a~0 main_~x~0)} is VALID [2022-04-27 14:31:35,605 INFO L272 TraceCheckUtils]: 24: Hoare triple {2438#(= main_~a~0 main_~x~0)} call __VERIFIER_assert((if ~z~0 + ~x~0 * ~y~0 == ~a~0 * ~b~0 then 1 else 0)); {2367#true} is VALID [2022-04-27 14:31:35,605 INFO L290 TraceCheckUtils]: 25: Hoare triple {2367#true} ~cond := #in~cond; {2367#true} is VALID [2022-04-27 14:31:35,605 INFO L290 TraceCheckUtils]: 26: Hoare triple {2367#true} assume !(0 == ~cond); {2367#true} is VALID [2022-04-27 14:31:35,605 INFO L290 TraceCheckUtils]: 27: Hoare triple {2367#true} assume true; {2367#true} is VALID [2022-04-27 14:31:35,605 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {2367#true} {2438#(= main_~a~0 main_~x~0)} #67#return; {2438#(= main_~a~0 main_~x~0)} is VALID [2022-04-27 14:31:35,606 INFO L290 TraceCheckUtils]: 29: Hoare triple {2438#(= main_~a~0 main_~x~0)} assume !!(0 != ~y~0); {2460#(and (not (= main_~y~0 0)) (= main_~a~0 main_~x~0))} is VALID [2022-04-27 14:31:35,606 INFO L290 TraceCheckUtils]: 30: Hoare triple {2460#(and (not (= main_~y~0 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; {2464#(and (< 0 (+ main_~y~0 1)) (= main_~a~0 main_~x~0))} is VALID [2022-04-27 14:31:35,607 INFO L290 TraceCheckUtils]: 31: Hoare triple {2464#(and (< 0 (+ main_~y~0 1)) (= 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); {2468#(and (= (* main_~a~0 2) main_~x~0) (< 0 (+ main_~y~0 1)))} is VALID [2022-04-27 14:31:35,607 INFO L290 TraceCheckUtils]: 32: Hoare triple {2468#(and (= (* main_~a~0 2) main_~x~0) (< 0 (+ main_~y~0 1)))} assume !false; {2468#(and (= (* main_~a~0 2) main_~x~0) (< 0 (+ main_~y~0 1)))} is VALID [2022-04-27 14:31:35,607 INFO L272 TraceCheckUtils]: 33: Hoare triple {2468#(and (= (* main_~a~0 2) main_~x~0) (< 0 (+ main_~y~0 1)))} call __VERIFIER_assert((if ~z~0 + ~x~0 * ~y~0 == ~a~0 * ~b~0 then 1 else 0)); {2367#true} is VALID [2022-04-27 14:31:35,608 INFO L290 TraceCheckUtils]: 34: Hoare triple {2367#true} ~cond := #in~cond; {2478#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-27 14:31:35,608 INFO L290 TraceCheckUtils]: 35: Hoare triple {2478#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {2482#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 14:31:35,608 INFO L290 TraceCheckUtils]: 36: Hoare triple {2482#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {2482#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 14:31:35,609 INFO L284 TraceCheckUtils]: 37: Hoare quadruple {2482#(not (= |__VERIFIER_assert_#in~cond| 0))} {2468#(and (= (* main_~a~0 2) main_~x~0) (< 0 (+ main_~y~0 1)))} #67#return; {2489#(and (= (+ main_~z~0 (* main_~y~0 main_~x~0)) (* main_~b~0 main_~a~0)) (= (* main_~a~0 2) main_~x~0) (< 0 (+ main_~y~0 1)))} is VALID [2022-04-27 14:31:35,610 INFO L290 TraceCheckUtils]: 38: Hoare triple {2489#(and (= (+ main_~z~0 (* main_~y~0 main_~x~0)) (* main_~b~0 main_~a~0)) (= (* main_~a~0 2) main_~x~0) (< 0 (+ main_~y~0 1)))} assume !!(0 != ~y~0); {2489#(and (= (+ main_~z~0 (* main_~y~0 main_~x~0)) (* main_~b~0 main_~a~0)) (= (* main_~a~0 2) main_~x~0) (< 0 (+ main_~y~0 1)))} is VALID [2022-04-27 14:31:35,610 INFO L290 TraceCheckUtils]: 39: Hoare triple {2489#(and (= (+ main_~z~0 (* main_~y~0 main_~x~0)) (* main_~b~0 main_~a~0)) (= (* main_~a~0 2) main_~x~0) (< 0 (+ main_~y~0 1)))} assume !(1 == (if ~y~0 < 0 && 0 != ~y~0 % 2 then ~y~0 % 2 - 2 else ~y~0 % 2)); {2496#(and (= (+ main_~z~0 (* main_~y~0 main_~x~0)) (* main_~b~0 main_~a~0)) (not (= (mod main_~y~0 2) 1)) (= (* main_~a~0 2) main_~x~0) (< 0 (+ main_~y~0 1)))} is VALID [2022-04-27 14:31:35,754 INFO L290 TraceCheckUtils]: 40: Hoare triple {2496#(and (= (+ main_~z~0 (* main_~y~0 main_~x~0)) (* main_~b~0 main_~a~0)) (not (= (mod main_~y~0 2) 1)) (= (* main_~a~0 2) 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); {2500#(and (= (* main_~a~0 4) main_~x~0) (exists ((aux_mod_v_main_~y~0_27_22 Int) (aux_div_v_main_~y~0_27_22 Int)) (and (< 0 (+ (* aux_div_v_main_~y~0_27_22 2) aux_mod_v_main_~y~0_27_22 1)) (= (* main_~b~0 main_~a~0) (+ (* (* main_~a~0 2) (+ (* aux_div_v_main_~y~0_27_22 2) aux_mod_v_main_~y~0_27_22)) main_~z~0)) (= main_~y~0 (div (+ (* aux_div_v_main_~y~0_27_22 2) aux_mod_v_main_~y~0_27_22) 2)) (not (= aux_mod_v_main_~y~0_27_22 1)) (< aux_mod_v_main_~y~0_27_22 2) (<= 0 aux_mod_v_main_~y~0_27_22))))} is VALID [2022-04-27 14:31:36,383 INFO L290 TraceCheckUtils]: 41: Hoare triple {2500#(and (= (* main_~a~0 4) main_~x~0) (exists ((aux_mod_v_main_~y~0_27_22 Int) (aux_div_v_main_~y~0_27_22 Int)) (and (< 0 (+ (* aux_div_v_main_~y~0_27_22 2) aux_mod_v_main_~y~0_27_22 1)) (= (* main_~b~0 main_~a~0) (+ (* (* main_~a~0 2) (+ (* aux_div_v_main_~y~0_27_22 2) aux_mod_v_main_~y~0_27_22)) main_~z~0)) (= main_~y~0 (div (+ (* aux_div_v_main_~y~0_27_22 2) aux_mod_v_main_~y~0_27_22) 2)) (not (= aux_mod_v_main_~y~0_27_22 1)) (< aux_mod_v_main_~y~0_27_22 2) (<= 0 aux_mod_v_main_~y~0_27_22))))} assume !false; {2504#(and (= (mod (+ main_~z~0 (* main_~a~0 main_~y~0 (- 4)) (* main_~b~0 main_~a~0)) 2) 0) (= (* main_~a~0 4) main_~x~0) (= (div (+ (* (- 1) main_~z~0) (* main_~b~0 main_~a~0)) 2) (* 2 (* main_~a~0 main_~y~0))) (< 0 (+ main_~y~0 1)))} is VALID [2022-04-27 14:31:38,386 WARN L272 TraceCheckUtils]: 42: Hoare triple {2504#(and (= (mod (+ main_~z~0 (* main_~a~0 main_~y~0 (- 4)) (* main_~b~0 main_~a~0)) 2) 0) (= (* main_~a~0 4) main_~x~0) (= (div (+ (* (- 1) main_~z~0) (* main_~b~0 main_~a~0)) 2) (* 2 (* main_~a~0 main_~y~0))) (< 0 (+ main_~y~0 1)))} call __VERIFIER_assert((if ~z~0 + ~x~0 * ~y~0 == ~a~0 * ~b~0 then 1 else 0)); {2508#(<= 1 |__VERIFIER_assert_#in~cond|)} is UNKNOWN [2022-04-27 14:31:38,386 INFO L290 TraceCheckUtils]: 43: Hoare triple {2508#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {2512#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 14:31:38,386 INFO L290 TraceCheckUtils]: 44: Hoare triple {2512#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {2368#false} is VALID [2022-04-27 14:31:38,387 INFO L290 TraceCheckUtils]: 45: Hoare triple {2368#false} assume !false; {2368#false} is VALID [2022-04-27 14:31:38,387 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 6 proven. 10 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2022-04-27 14:31:38,387 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 14:32:07,128 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 14:32:07,128 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2038677647] [2022-04-27 14:32:07,128 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 14:32:07,128 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1106893332] [2022-04-27 14:32:07,128 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1106893332] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 14:32:07,128 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-27 14:32:07,128 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2022-04-27 14:32:07,128 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1351370801] [2022-04-27 14:32:07,128 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2022-04-27 14:32:07,129 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 2.0) internal successors, (26), 13 states have internal predecessors, (26), 4 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) Word has length 46 [2022-04-27 14:32:07,129 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 14:32:07,129 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 14 states, 13 states have (on average 2.0) internal successors, (26), 13 states have internal predecessors, (26), 4 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2022-04-27 14:32:09,524 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-27 14:32:09,525 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-04-27 14:32:09,525 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 14:32:09,525 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-04-27 14:32:09,525 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=249, Unknown=4, NotChecked=0, Total=306 [2022-04-27 14:32:09,525 INFO L87 Difference]: Start difference. First operand 58 states and 66 transitions. Second operand has 14 states, 13 states have (on average 2.0) internal successors, (26), 13 states have internal predecessors, (26), 4 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2022-04-27 14:32:16,659 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-27 14:32:20,756 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-27 14:32:22,761 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-27 14:32:26,024 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.46s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-27 14:32:29,522 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.50s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-27 14:32:31,524 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-27 14:32:32,090 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:32:32,090 INFO L93 Difference]: Finished difference Result 83 states and 94 transitions. [2022-04-27 14:32:32,090 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-04-27 14:32:32,090 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 2.0) internal successors, (26), 13 states have internal predecessors, (26), 4 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) Word has length 46 [2022-04-27 14:32:32,090 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 14:32:32,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 13 states have (on average 2.0) internal successors, (26), 13 states have internal predecessors, (26), 4 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2022-04-27 14:32:32,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 56 transitions. [2022-04-27 14:32:32,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 13 states have (on average 2.0) internal successors, (26), 13 states have internal predecessors, (26), 4 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2022-04-27 14:32:32,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 56 transitions. [2022-04-27 14:32:32,094 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 13 states and 56 transitions. [2022-04-27 14:32:34,246 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 56 edges. 55 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-27 14:32:34,247 INFO L225 Difference]: With dead ends: 83 [2022-04-27 14:32:34,247 INFO L226 Difference]: Without dead ends: 81 [2022-04-27 14:32:34,247 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 37 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 76 ImplicationChecksByTransitivity, 10.5s TimeCoverageRelationStatistics Valid=64, Invalid=312, Unknown=4, NotChecked=0, Total=380 [2022-04-27 14:32:34,248 INFO L413 NwaCegarLoop]: 28 mSDtfsCounter, 18 mSDsluCounter, 185 mSDsCounter, 0 mSdLazyCounter, 202 mSolverCounterSat, 6 mSolverCounterUnsat, 4 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 12.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 213 SdHoareTripleChecker+Invalid, 239 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 202 IncrementalHoareTripleChecker+Invalid, 4 IncrementalHoareTripleChecker+Unknown, 27 IncrementalHoareTripleChecker+Unchecked, 12.7s IncrementalHoareTripleChecker+Time [2022-04-27 14:32:34,248 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 213 Invalid, 239 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 202 Invalid, 4 Unknown, 27 Unchecked, 12.7s Time] [2022-04-27 14:32:34,248 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2022-04-27 14:32:34,281 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 70. [2022-04-27 14:32:34,281 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 14:32:34,281 INFO L82 GeneralOperation]: Start isEquivalent. First operand 81 states. Second operand has 70 states, 49 states have (on average 1.1224489795918366) internal successors, (55), 52 states have internal predecessors, (55), 13 states have call successors, (13), 8 states have call predecessors, (13), 7 states have return successors, (12), 9 states have call predecessors, (12), 12 states have call successors, (12) [2022-04-27 14:32:34,282 INFO L74 IsIncluded]: Start isIncluded. First operand 81 states. Second operand has 70 states, 49 states have (on average 1.1224489795918366) internal successors, (55), 52 states have internal predecessors, (55), 13 states have call successors, (13), 8 states have call predecessors, (13), 7 states have return successors, (12), 9 states have call predecessors, (12), 12 states have call successors, (12) [2022-04-27 14:32:34,282 INFO L87 Difference]: Start difference. First operand 81 states. Second operand has 70 states, 49 states have (on average 1.1224489795918366) internal successors, (55), 52 states have internal predecessors, (55), 13 states have call successors, (13), 8 states have call predecessors, (13), 7 states have return successors, (12), 9 states have call predecessors, (12), 12 states have call successors, (12) [2022-04-27 14:32:34,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:32:34,284 INFO L93 Difference]: Finished difference Result 81 states and 92 transitions. [2022-04-27 14:32:34,284 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 92 transitions. [2022-04-27 14:32:34,284 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:32:34,284 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 14:32:34,284 INFO L74 IsIncluded]: Start isIncluded. First operand has 70 states, 49 states have (on average 1.1224489795918366) internal successors, (55), 52 states have internal predecessors, (55), 13 states have call successors, (13), 8 states have call predecessors, (13), 7 states have return successors, (12), 9 states have call predecessors, (12), 12 states have call successors, (12) Second operand 81 states. [2022-04-27 14:32:34,284 INFO L87 Difference]: Start difference. First operand has 70 states, 49 states have (on average 1.1224489795918366) internal successors, (55), 52 states have internal predecessors, (55), 13 states have call successors, (13), 8 states have call predecessors, (13), 7 states have return successors, (12), 9 states have call predecessors, (12), 12 states have call successors, (12) Second operand 81 states. [2022-04-27 14:32:34,286 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:32:34,286 INFO L93 Difference]: Finished difference Result 81 states and 92 transitions. [2022-04-27 14:32:34,286 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 92 transitions. [2022-04-27 14:32:34,286 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:32:34,286 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 14:32:34,286 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 14:32:34,287 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 14:32:34,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 49 states have (on average 1.1224489795918366) internal successors, (55), 52 states have internal predecessors, (55), 13 states have call successors, (13), 8 states have call predecessors, (13), 7 states have return successors, (12), 9 states have call predecessors, (12), 12 states have call successors, (12) [2022-04-27 14:32:34,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 80 transitions. [2022-04-27 14:32:34,288 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 80 transitions. Word has length 46 [2022-04-27 14:32:34,288 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 14:32:34,288 INFO L495 AbstractCegarLoop]: Abstraction has 70 states and 80 transitions. [2022-04-27 14:32:34,288 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 2.0) internal successors, (26), 13 states have internal predecessors, (26), 4 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2022-04-27 14:32:34,289 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 80 transitions. [2022-04-27 14:32:34,289 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2022-04-27 14:32:34,289 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 14:32:34,289 INFO L195 NwaCegarLoop]: 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-27 14:32:34,305 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-04-27 14:32:34,500 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 14:32:34,500 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 14:32:34,500 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 14:32:34,500 INFO L85 PathProgramCache]: Analyzing trace with hash -1459553868, now seen corresponding path program 2 times [2022-04-27 14:32:34,500 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 14:32:34,500 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [62350502] [2022-04-27 14:32:34,501 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 14:32:34,501 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 14:32:34,511 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 14:32:34,512 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1161966321] [2022-04-27 14:32:34,512 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-27 14:32:34,512 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 14:32:34,512 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 14:32:34,513 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-27 14:32:34,513 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-04-27 14:32:34,554 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-27 14:32:34,555 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-27 14:32:34,555 INFO L263 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 18 conjunts are in the unsatisfiable core [2022-04-27 14:32:34,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 14:32:34,566 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 14:32:35,709 INFO L272 TraceCheckUtils]: 0: Hoare triple {2929#true} call ULTIMATE.init(); {2929#true} is VALID [2022-04-27 14:32:35,709 INFO L290 TraceCheckUtils]: 1: Hoare triple {2929#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); {2929#true} is VALID [2022-04-27 14:32:35,709 INFO L290 TraceCheckUtils]: 2: Hoare triple {2929#true} assume true; {2929#true} is VALID [2022-04-27 14:32:35,709 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2929#true} {2929#true} #71#return; {2929#true} is VALID [2022-04-27 14:32:35,709 INFO L272 TraceCheckUtils]: 4: Hoare triple {2929#true} call #t~ret6 := main(); {2929#true} is VALID [2022-04-27 14:32:35,709 INFO L290 TraceCheckUtils]: 5: Hoare triple {2929#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; {2929#true} is VALID [2022-04-27 14:32:35,710 INFO L272 TraceCheckUtils]: 6: Hoare triple {2929#true} call assume_abort_if_not((if ~a~0 >= 0 && ~a~0 <= 5 then 1 else 0)); {2929#true} is VALID [2022-04-27 14:32:35,710 INFO L290 TraceCheckUtils]: 7: Hoare triple {2929#true} ~cond := #in~cond; {2929#true} is VALID [2022-04-27 14:32:35,710 INFO L290 TraceCheckUtils]: 8: Hoare triple {2929#true} assume !(0 == ~cond); {2929#true} is VALID [2022-04-27 14:32:35,710 INFO L290 TraceCheckUtils]: 9: Hoare triple {2929#true} assume true; {2929#true} is VALID [2022-04-27 14:32:35,710 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {2929#true} {2929#true} #61#return; {2929#true} is VALID [2022-04-27 14:32:35,710 INFO L290 TraceCheckUtils]: 11: Hoare triple {2929#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~b~0 := #t~nondet5;havoc #t~nondet5; {2929#true} is VALID [2022-04-27 14:32:35,713 INFO L272 TraceCheckUtils]: 12: Hoare triple {2929#true} call assume_abort_if_not((if ~b~0 >= 0 && ~b~0 <= 5 then 1 else 0)); {2929#true} is VALID [2022-04-27 14:32:35,713 INFO L290 TraceCheckUtils]: 13: Hoare triple {2929#true} ~cond := #in~cond; {2973#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-04-27 14:32:35,713 INFO L290 TraceCheckUtils]: 14: Hoare triple {2973#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} assume !(0 == ~cond); {2977#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-27 14:32:35,714 INFO L290 TraceCheckUtils]: 15: Hoare triple {2977#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {2977#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-27 14:32:35,714 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {2977#(not (= |assume_abort_if_not_#in~cond| 0))} {2929#true} #63#return; {2984#(and (<= main_~b~0 5) (<= 0 main_~b~0))} is VALID [2022-04-27 14:32:35,714 INFO L272 TraceCheckUtils]: 17: Hoare triple {2984#(and (<= main_~b~0 5) (<= 0 main_~b~0))} call assume_abort_if_not((if ~b~0 >= 1 then 1 else 0)); {2929#true} is VALID [2022-04-27 14:32:35,714 INFO L290 TraceCheckUtils]: 18: Hoare triple {2929#true} ~cond := #in~cond; {2929#true} is VALID [2022-04-27 14:32:35,714 INFO L290 TraceCheckUtils]: 19: Hoare triple {2929#true} assume !(0 == ~cond); {2929#true} is VALID [2022-04-27 14:32:35,714 INFO L290 TraceCheckUtils]: 20: Hoare triple {2929#true} assume true; {2929#true} is VALID [2022-04-27 14:32:35,723 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {2929#true} {2984#(and (<= main_~b~0 5) (<= 0 main_~b~0))} #65#return; {2984#(and (<= main_~b~0 5) (<= 0 main_~b~0))} is VALID [2022-04-27 14:32:35,723 INFO L290 TraceCheckUtils]: 22: Hoare triple {2984#(and (<= main_~b~0 5) (<= 0 main_~b~0))} ~x~0 := ~a~0;~y~0 := ~b~0;~z~0 := 0; {3003#(<= main_~y~0 5)} is VALID [2022-04-27 14:32:35,723 INFO L290 TraceCheckUtils]: 23: Hoare triple {3003#(<= main_~y~0 5)} assume !false; {3003#(<= main_~y~0 5)} is VALID [2022-04-27 14:32:35,724 INFO L272 TraceCheckUtils]: 24: Hoare triple {3003#(<= main_~y~0 5)} call __VERIFIER_assert((if ~z~0 + ~x~0 * ~y~0 == ~a~0 * ~b~0 then 1 else 0)); {2929#true} is VALID [2022-04-27 14:32:35,724 INFO L290 TraceCheckUtils]: 25: Hoare triple {2929#true} ~cond := #in~cond; {2929#true} is VALID [2022-04-27 14:32:35,724 INFO L290 TraceCheckUtils]: 26: Hoare triple {2929#true} assume !(0 == ~cond); {2929#true} is VALID [2022-04-27 14:32:35,724 INFO L290 TraceCheckUtils]: 27: Hoare triple {2929#true} assume true; {2929#true} is VALID [2022-04-27 14:32:35,724 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {2929#true} {3003#(<= main_~y~0 5)} #67#return; {3003#(<= main_~y~0 5)} is VALID [2022-04-27 14:32:35,724 INFO L290 TraceCheckUtils]: 29: Hoare triple {3003#(<= main_~y~0 5)} assume !!(0 != ~y~0); {3025#(and (not (= main_~y~0 0)) (<= main_~y~0 5))} is VALID [2022-04-27 14:32:35,725 INFO L290 TraceCheckUtils]: 30: Hoare triple {3025#(and (not (= main_~y~0 0)) (<= main_~y~0 5))} 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; {3029#(and (<= 1 (mod (+ main_~y~0 1) 2)) (<= main_~y~0 4) (<= 0 (+ main_~y~0 1)))} is VALID [2022-04-27 14:32:35,728 INFO L290 TraceCheckUtils]: 31: Hoare triple {3029#(and (<= 1 (mod (+ main_~y~0 1) 2)) (<= main_~y~0 4) (<= 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); {3033#(exists ((aux_mod_v_main_~y~0_32_28 Int) (aux_div_v_main_~y~0_32_28 Int)) (and (<= 0 (+ (* aux_div_v_main_~y~0_32_28 2) aux_mod_v_main_~y~0_32_28)) (<= main_~y~0 (div (+ (- 1) (* aux_div_v_main_~y~0_32_28 2) aux_mod_v_main_~y~0_32_28) 2)) (<= 1 aux_mod_v_main_~y~0_32_28) (< aux_mod_v_main_~y~0_32_28 2) (<= (+ (* aux_div_v_main_~y~0_32_28 2) aux_mod_v_main_~y~0_32_28) 5)))} is VALID [2022-04-27 14:32:35,729 INFO L290 TraceCheckUtils]: 32: Hoare triple {3033#(exists ((aux_mod_v_main_~y~0_32_28 Int) (aux_div_v_main_~y~0_32_28 Int)) (and (<= 0 (+ (* aux_div_v_main_~y~0_32_28 2) aux_mod_v_main_~y~0_32_28)) (<= main_~y~0 (div (+ (- 1) (* aux_div_v_main_~y~0_32_28 2) aux_mod_v_main_~y~0_32_28) 2)) (<= 1 aux_mod_v_main_~y~0_32_28) (< aux_mod_v_main_~y~0_32_28 2) (<= (+ (* aux_div_v_main_~y~0_32_28 2) aux_mod_v_main_~y~0_32_28) 5)))} assume !false; {3037#(<= main_~y~0 2)} is VALID [2022-04-27 14:32:35,729 INFO L272 TraceCheckUtils]: 33: Hoare triple {3037#(<= main_~y~0 2)} call __VERIFIER_assert((if ~z~0 + ~x~0 * ~y~0 == ~a~0 * ~b~0 then 1 else 0)); {2929#true} is VALID [2022-04-27 14:32:35,729 INFO L290 TraceCheckUtils]: 34: Hoare triple {2929#true} ~cond := #in~cond; {2929#true} is VALID [2022-04-27 14:32:35,729 INFO L290 TraceCheckUtils]: 35: Hoare triple {2929#true} assume !(0 == ~cond); {2929#true} is VALID [2022-04-27 14:32:35,729 INFO L290 TraceCheckUtils]: 36: Hoare triple {2929#true} assume true; {2929#true} is VALID [2022-04-27 14:32:35,730 INFO L284 TraceCheckUtils]: 37: Hoare quadruple {2929#true} {3037#(<= main_~y~0 2)} #67#return; {3037#(<= main_~y~0 2)} is VALID [2022-04-27 14:32:35,730 INFO L290 TraceCheckUtils]: 38: Hoare triple {3037#(<= main_~y~0 2)} assume !!(0 != ~y~0); {3056#(and (not (= main_~y~0 0)) (<= main_~y~0 2))} is VALID [2022-04-27 14:32:35,731 INFO L290 TraceCheckUtils]: 39: Hoare triple {3056#(and (not (= main_~y~0 0)) (<= main_~y~0 2))} 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; {3060#(and (<= 1 (mod (+ main_~y~0 1) 2)) (<= 0 (+ main_~y~0 1)) (<= main_~y~0 1))} is VALID [2022-04-27 14:32:35,732 INFO L290 TraceCheckUtils]: 40: Hoare triple {3060#(and (<= 1 (mod (+ main_~y~0 1) 2)) (<= 0 (+ main_~y~0 1)) (<= 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); {3060#(and (<= 1 (mod (+ main_~y~0 1) 2)) (<= 0 (+ main_~y~0 1)) (<= main_~y~0 1))} is VALID [2022-04-27 14:32:35,732 INFO L290 TraceCheckUtils]: 41: Hoare triple {3060#(and (<= 1 (mod (+ main_~y~0 1) 2)) (<= 0 (+ main_~y~0 1)) (<= main_~y~0 1))} assume !false; {3060#(and (<= 1 (mod (+ main_~y~0 1) 2)) (<= 0 (+ main_~y~0 1)) (<= main_~y~0 1))} is VALID [2022-04-27 14:32:35,732 INFO L272 TraceCheckUtils]: 42: Hoare triple {3060#(and (<= 1 (mod (+ main_~y~0 1) 2)) (<= 0 (+ main_~y~0 1)) (<= main_~y~0 1))} call __VERIFIER_assert((if ~z~0 + ~x~0 * ~y~0 == ~a~0 * ~b~0 then 1 else 0)); {2929#true} is VALID [2022-04-27 14:32:35,732 INFO L290 TraceCheckUtils]: 43: Hoare triple {2929#true} ~cond := #in~cond; {2929#true} is VALID [2022-04-27 14:32:35,733 INFO L290 TraceCheckUtils]: 44: Hoare triple {2929#true} assume !(0 == ~cond); {2929#true} is VALID [2022-04-27 14:32:35,733 INFO L290 TraceCheckUtils]: 45: Hoare triple {2929#true} assume true; {2929#true} is VALID [2022-04-27 14:32:35,733 INFO L284 TraceCheckUtils]: 46: Hoare quadruple {2929#true} {3060#(and (<= 1 (mod (+ main_~y~0 1) 2)) (<= 0 (+ main_~y~0 1)) (<= main_~y~0 1))} #67#return; {3060#(and (<= 1 (mod (+ main_~y~0 1) 2)) (<= 0 (+ main_~y~0 1)) (<= main_~y~0 1))} is VALID [2022-04-27 14:32:35,734 INFO L290 TraceCheckUtils]: 47: Hoare triple {3060#(and (<= 1 (mod (+ main_~y~0 1) 2)) (<= 0 (+ main_~y~0 1)) (<= main_~y~0 1))} assume !!(0 != ~y~0); {2930#false} is VALID [2022-04-27 14:32:35,734 INFO L290 TraceCheckUtils]: 48: Hoare triple {2930#false} assume !(1 == (if ~y~0 < 0 && 0 != ~y~0 % 2 then ~y~0 % 2 - 2 else ~y~0 % 2)); {2930#false} is VALID [2022-04-27 14:32:35,734 INFO L290 TraceCheckUtils]: 49: Hoare triple {2930#false} ~x~0 := 2 * ~x~0;~y~0 := (if ~y~0 < 0 && 0 != ~y~0 % 2 then 1 + ~y~0 / 2 else ~y~0 / 2); {2930#false} is VALID [2022-04-27 14:32:35,734 INFO L290 TraceCheckUtils]: 50: Hoare triple {2930#false} assume !false; {2930#false} is VALID [2022-04-27 14:32:35,734 INFO L272 TraceCheckUtils]: 51: Hoare triple {2930#false} call __VERIFIER_assert((if ~z~0 + ~x~0 * ~y~0 == ~a~0 * ~b~0 then 1 else 0)); {2930#false} is VALID [2022-04-27 14:32:35,734 INFO L290 TraceCheckUtils]: 52: Hoare triple {2930#false} ~cond := #in~cond; {2930#false} is VALID [2022-04-27 14:32:35,734 INFO L290 TraceCheckUtils]: 53: Hoare triple {2930#false} assume 0 == ~cond; {2930#false} is VALID [2022-04-27 14:32:35,734 INFO L290 TraceCheckUtils]: 54: Hoare triple {2930#false} assume !false; {2930#false} is VALID [2022-04-27 14:32:35,734 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 30 proven. 3 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2022-04-27 14:32:35,734 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 14:32:36,952 INFO L290 TraceCheckUtils]: 54: Hoare triple {2930#false} assume !false; {2930#false} is VALID [2022-04-27 14:32:36,953 INFO L290 TraceCheckUtils]: 53: Hoare triple {2930#false} assume 0 == ~cond; {2930#false} is VALID [2022-04-27 14:32:36,953 INFO L290 TraceCheckUtils]: 52: Hoare triple {2930#false} ~cond := #in~cond; {2930#false} is VALID [2022-04-27 14:32:36,953 INFO L272 TraceCheckUtils]: 51: Hoare triple {2930#false} call __VERIFIER_assert((if ~z~0 + ~x~0 * ~y~0 == ~a~0 * ~b~0 then 1 else 0)); {2930#false} is VALID [2022-04-27 14:32:36,953 INFO L290 TraceCheckUtils]: 50: Hoare triple {2930#false} assume !false; {2930#false} is VALID [2022-04-27 14:32:36,953 INFO L290 TraceCheckUtils]: 49: Hoare triple {2930#false} ~x~0 := 2 * ~x~0;~y~0 := (if ~y~0 < 0 && 0 != ~y~0 % 2 then 1 + ~y~0 / 2 else ~y~0 / 2); {2930#false} is VALID [2022-04-27 14:32:36,953 INFO L290 TraceCheckUtils]: 48: Hoare triple {2930#false} assume !(1 == (if ~y~0 < 0 && 0 != ~y~0 % 2 then ~y~0 % 2 - 2 else ~y~0 % 2)); {2930#false} is VALID [2022-04-27 14:32:36,954 INFO L290 TraceCheckUtils]: 47: Hoare triple {3060#(and (<= 1 (mod (+ main_~y~0 1) 2)) (<= 0 (+ main_~y~0 1)) (<= main_~y~0 1))} assume !!(0 != ~y~0); {2930#false} is VALID [2022-04-27 14:32:36,954 INFO L284 TraceCheckUtils]: 46: Hoare quadruple {2929#true} {3060#(and (<= 1 (mod (+ main_~y~0 1) 2)) (<= 0 (+ main_~y~0 1)) (<= main_~y~0 1))} #67#return; {3060#(and (<= 1 (mod (+ main_~y~0 1) 2)) (<= 0 (+ main_~y~0 1)) (<= main_~y~0 1))} is VALID [2022-04-27 14:32:36,954 INFO L290 TraceCheckUtils]: 45: Hoare triple {2929#true} assume true; {2929#true} is VALID [2022-04-27 14:32:36,954 INFO L290 TraceCheckUtils]: 44: Hoare triple {2929#true} assume !(0 == ~cond); {2929#true} is VALID [2022-04-27 14:32:36,954 INFO L290 TraceCheckUtils]: 43: Hoare triple {2929#true} ~cond := #in~cond; {2929#true} is VALID [2022-04-27 14:32:36,955 INFO L272 TraceCheckUtils]: 42: Hoare triple {3060#(and (<= 1 (mod (+ main_~y~0 1) 2)) (<= 0 (+ main_~y~0 1)) (<= main_~y~0 1))} call __VERIFIER_assert((if ~z~0 + ~x~0 * ~y~0 == ~a~0 * ~b~0 then 1 else 0)); {2929#true} is VALID [2022-04-27 14:32:36,955 INFO L290 TraceCheckUtils]: 41: Hoare triple {3060#(and (<= 1 (mod (+ main_~y~0 1) 2)) (<= 0 (+ main_~y~0 1)) (<= main_~y~0 1))} assume !false; {3060#(and (<= 1 (mod (+ main_~y~0 1) 2)) (<= 0 (+ main_~y~0 1)) (<= main_~y~0 1))} is VALID [2022-04-27 14:32:36,956 INFO L290 TraceCheckUtils]: 40: Hoare triple {3148#(and (or (and (<= (div main_~y~0 2) 1) (<= 1 (mod (+ (div main_~y~0 2) 1) 2))) (and (not (= (mod main_~y~0 2) 0)) (< main_~y~0 0))) (or (not (< main_~y~0 0)) (and (<= 0 (+ (div main_~y~0 2) 2)) (<= 1 (mod (div main_~y~0 2) 2)))))} ~x~0 := 2 * ~x~0;~y~0 := (if ~y~0 < 0 && 0 != ~y~0 % 2 then 1 + ~y~0 / 2 else ~y~0 / 2); {3060#(and (<= 1 (mod (+ main_~y~0 1) 2)) (<= 0 (+ main_~y~0 1)) (<= main_~y~0 1))} is VALID [2022-04-27 14:32:36,958 INFO L290 TraceCheckUtils]: 39: Hoare triple {3152#(or (and (<= 1 (mod (+ (div (+ (- 1) main_~y~0) 2) 1) 2)) (<= (div (+ (- 1) main_~y~0) 2) 1)) (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; {3148#(and (or (and (<= (div main_~y~0 2) 1) (<= 1 (mod (+ (div main_~y~0 2) 1) 2))) (and (not (= (mod main_~y~0 2) 0)) (< main_~y~0 0))) (or (not (< main_~y~0 0)) (and (<= 0 (+ (div main_~y~0 2) 2)) (<= 1 (mod (div main_~y~0 2) 2)))))} is VALID [2022-04-27 14:32:36,958 INFO L290 TraceCheckUtils]: 38: Hoare triple {3152#(or (and (<= 1 (mod (+ (div (+ (- 1) main_~y~0) 2) 1) 2)) (<= (div (+ (- 1) main_~y~0) 2) 1)) (not (<= 1 (mod main_~y~0 2))) (< main_~y~0 0))} assume !!(0 != ~y~0); {3152#(or (and (<= 1 (mod (+ (div (+ (- 1) main_~y~0) 2) 1) 2)) (<= (div (+ (- 1) main_~y~0) 2) 1)) (not (<= 1 (mod main_~y~0 2))) (< main_~y~0 0))} is VALID [2022-04-27 14:32:36,959 INFO L284 TraceCheckUtils]: 37: Hoare quadruple {2929#true} {3152#(or (and (<= 1 (mod (+ (div (+ (- 1) main_~y~0) 2) 1) 2)) (<= (div (+ (- 1) main_~y~0) 2) 1)) (not (<= 1 (mod main_~y~0 2))) (< main_~y~0 0))} #67#return; {3152#(or (and (<= 1 (mod (+ (div (+ (- 1) main_~y~0) 2) 1) 2)) (<= (div (+ (- 1) main_~y~0) 2) 1)) (not (<= 1 (mod main_~y~0 2))) (< main_~y~0 0))} is VALID [2022-04-27 14:32:36,959 INFO L290 TraceCheckUtils]: 36: Hoare triple {2929#true} assume true; {2929#true} is VALID [2022-04-27 14:32:36,959 INFO L290 TraceCheckUtils]: 35: Hoare triple {2929#true} assume !(0 == ~cond); {2929#true} is VALID [2022-04-27 14:32:36,959 INFO L290 TraceCheckUtils]: 34: Hoare triple {2929#true} ~cond := #in~cond; {2929#true} is VALID [2022-04-27 14:32:36,959 INFO L272 TraceCheckUtils]: 33: Hoare triple {3152#(or (and (<= 1 (mod (+ (div (+ (- 1) main_~y~0) 2) 1) 2)) (<= (div (+ (- 1) main_~y~0) 2) 1)) (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)); {2929#true} is VALID [2022-04-27 14:32:36,959 INFO L290 TraceCheckUtils]: 32: Hoare triple {3152#(or (and (<= 1 (mod (+ (div (+ (- 1) main_~y~0) 2) 1) 2)) (<= (div (+ (- 1) main_~y~0) 2) 1)) (not (<= 1 (mod main_~y~0 2))) (< main_~y~0 0))} assume !false; {3152#(or (and (<= 1 (mod (+ (div (+ (- 1) main_~y~0) 2) 1) 2)) (<= (div (+ (- 1) main_~y~0) 2) 1)) (not (<= 1 (mod main_~y~0 2))) (< main_~y~0 0))} is VALID [2022-04-27 14:32:36,961 INFO L290 TraceCheckUtils]: 31: Hoare triple {3003#(<= main_~y~0 5)} ~x~0 := 2 * ~x~0;~y~0 := (if ~y~0 < 0 && 0 != ~y~0 % 2 then 1 + ~y~0 / 2 else ~y~0 / 2); {3152#(or (and (<= 1 (mod (+ (div (+ (- 1) main_~y~0) 2) 1) 2)) (<= (div (+ (- 1) main_~y~0) 2) 1)) (not (<= 1 (mod main_~y~0 2))) (< main_~y~0 0))} is VALID [2022-04-27 14:32:36,962 INFO L290 TraceCheckUtils]: 30: Hoare triple {3180#(or (<= main_~y~0 6) (< (mod main_~y~0 2) 1))} 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; {3003#(<= main_~y~0 5)} is VALID [2022-04-27 14:32:36,962 INFO L290 TraceCheckUtils]: 29: Hoare triple {3180#(or (<= main_~y~0 6) (< (mod main_~y~0 2) 1))} assume !!(0 != ~y~0); {3180#(or (<= main_~y~0 6) (< (mod main_~y~0 2) 1))} is VALID [2022-04-27 14:32:36,962 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {2929#true} {3180#(or (<= main_~y~0 6) (< (mod main_~y~0 2) 1))} #67#return; {3180#(or (<= main_~y~0 6) (< (mod main_~y~0 2) 1))} is VALID [2022-04-27 14:32:36,963 INFO L290 TraceCheckUtils]: 27: Hoare triple {2929#true} assume true; {2929#true} is VALID [2022-04-27 14:32:36,963 INFO L290 TraceCheckUtils]: 26: Hoare triple {2929#true} assume !(0 == ~cond); {2929#true} is VALID [2022-04-27 14:32:36,963 INFO L290 TraceCheckUtils]: 25: Hoare triple {2929#true} ~cond := #in~cond; {2929#true} is VALID [2022-04-27 14:32:36,963 INFO L272 TraceCheckUtils]: 24: Hoare triple {3180#(or (<= main_~y~0 6) (< (mod main_~y~0 2) 1))} call __VERIFIER_assert((if ~z~0 + ~x~0 * ~y~0 == ~a~0 * ~b~0 then 1 else 0)); {2929#true} is VALID [2022-04-27 14:32:36,963 INFO L290 TraceCheckUtils]: 23: Hoare triple {3180#(or (<= main_~y~0 6) (< (mod main_~y~0 2) 1))} assume !false; {3180#(or (<= main_~y~0 6) (< (mod main_~y~0 2) 1))} is VALID [2022-04-27 14:32:36,964 INFO L290 TraceCheckUtils]: 22: Hoare triple {3205#(<= (div (* (- 1) main_~b~0) (- 2)) 3)} ~x~0 := ~a~0;~y~0 := ~b~0;~z~0 := 0; {3180#(or (<= main_~y~0 6) (< (mod main_~y~0 2) 1))} is VALID [2022-04-27 14:32:36,964 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {2929#true} {3205#(<= (div (* (- 1) main_~b~0) (- 2)) 3)} #65#return; {3205#(<= (div (* (- 1) main_~b~0) (- 2)) 3)} is VALID [2022-04-27 14:32:36,964 INFO L290 TraceCheckUtils]: 20: Hoare triple {2929#true} assume true; {2929#true} is VALID [2022-04-27 14:32:36,964 INFO L290 TraceCheckUtils]: 19: Hoare triple {2929#true} assume !(0 == ~cond); {2929#true} is VALID [2022-04-27 14:32:36,964 INFO L290 TraceCheckUtils]: 18: Hoare triple {2929#true} ~cond := #in~cond; {2929#true} is VALID [2022-04-27 14:32:36,964 INFO L272 TraceCheckUtils]: 17: Hoare triple {3205#(<= (div (* (- 1) main_~b~0) (- 2)) 3)} call assume_abort_if_not((if ~b~0 >= 1 then 1 else 0)); {2929#true} is VALID [2022-04-27 14:32:36,965 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {2977#(not (= |assume_abort_if_not_#in~cond| 0))} {2929#true} #63#return; {3205#(<= (div (* (- 1) main_~b~0) (- 2)) 3)} is VALID [2022-04-27 14:32:36,965 INFO L290 TraceCheckUtils]: 15: Hoare triple {2977#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {2977#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-27 14:32:36,965 INFO L290 TraceCheckUtils]: 14: Hoare triple {3233#(or (not (= |assume_abort_if_not_#in~cond| 0)) (= assume_abort_if_not_~cond 0))} assume !(0 == ~cond); {2977#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-27 14:32:36,966 INFO L290 TraceCheckUtils]: 13: Hoare triple {2929#true} ~cond := #in~cond; {3233#(or (not (= |assume_abort_if_not_#in~cond| 0)) (= assume_abort_if_not_~cond 0))} is VALID [2022-04-27 14:32:36,966 INFO L272 TraceCheckUtils]: 12: Hoare triple {2929#true} call assume_abort_if_not((if ~b~0 >= 0 && ~b~0 <= 5 then 1 else 0)); {2929#true} is VALID [2022-04-27 14:32:36,966 INFO L290 TraceCheckUtils]: 11: Hoare triple {2929#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~b~0 := #t~nondet5;havoc #t~nondet5; {2929#true} is VALID [2022-04-27 14:32:36,966 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {2929#true} {2929#true} #61#return; {2929#true} is VALID [2022-04-27 14:32:36,966 INFO L290 TraceCheckUtils]: 9: Hoare triple {2929#true} assume true; {2929#true} is VALID [2022-04-27 14:32:36,966 INFO L290 TraceCheckUtils]: 8: Hoare triple {2929#true} assume !(0 == ~cond); {2929#true} is VALID [2022-04-27 14:32:36,966 INFO L290 TraceCheckUtils]: 7: Hoare triple {2929#true} ~cond := #in~cond; {2929#true} is VALID [2022-04-27 14:32:36,966 INFO L272 TraceCheckUtils]: 6: Hoare triple {2929#true} call assume_abort_if_not((if ~a~0 >= 0 && ~a~0 <= 5 then 1 else 0)); {2929#true} is VALID [2022-04-27 14:32:36,966 INFO L290 TraceCheckUtils]: 5: Hoare triple {2929#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; {2929#true} is VALID [2022-04-27 14:32:36,966 INFO L272 TraceCheckUtils]: 4: Hoare triple {2929#true} call #t~ret6 := main(); {2929#true} is VALID [2022-04-27 14:32:36,966 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2929#true} {2929#true} #71#return; {2929#true} is VALID [2022-04-27 14:32:36,966 INFO L290 TraceCheckUtils]: 2: Hoare triple {2929#true} assume true; {2929#true} is VALID [2022-04-27 14:32:36,966 INFO L290 TraceCheckUtils]: 1: Hoare triple {2929#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); {2929#true} is VALID [2022-04-27 14:32:36,967 INFO L272 TraceCheckUtils]: 0: Hoare triple {2929#true} call ULTIMATE.init(); {2929#true} is VALID [2022-04-27 14:32:36,967 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 30 proven. 3 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2022-04-27 14:32:36,967 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 14:32:36,967 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [62350502] [2022-04-27 14:32:36,967 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 14:32:36,967 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1161966321] [2022-04-27 14:32:36,967 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1161966321] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 14:32:36,967 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-27 14:32:36,967 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 10] total 17 [2022-04-27 14:32:36,967 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [972196438] [2022-04-27 14:32:36,967 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-27 14:32:36,968 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 2.411764705882353) internal successors, (41), 15 states have internal predecessors, (41), 9 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (11), 8 states have call predecessors, (11), 8 states have call successors, (11) Word has length 55 [2022-04-27 14:32:36,968 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 14:32:36,968 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 17 states, 17 states have (on average 2.411764705882353) internal successors, (41), 15 states have internal predecessors, (41), 9 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (11), 8 states have call predecessors, (11), 8 states have call successors, (11) [2022-04-27 14:32:37,018 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 64 edges. 64 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 14:32:37,018 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-04-27 14:32:37,018 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 14:32:37,019 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-04-27 14:32:37,019 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=205, Unknown=0, NotChecked=0, Total=272 [2022-04-27 14:32:37,019 INFO L87 Difference]: Start difference. First operand 70 states and 80 transitions. Second operand has 17 states, 17 states have (on average 2.411764705882353) internal successors, (41), 15 states have internal predecessors, (41), 9 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (11), 8 states have call predecessors, (11), 8 states have call successors, (11) [2022-04-27 14:32:37,602 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:32:37,602 INFO L93 Difference]: Finished difference Result 92 states and 104 transitions. [2022-04-27 14:32:37,602 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-04-27 14:32:37,603 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 2.411764705882353) internal successors, (41), 15 states have internal predecessors, (41), 9 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (11), 8 states have call predecessors, (11), 8 states have call successors, (11) Word has length 55 [2022-04-27 14:32:37,603 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 14:32:37,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 17 states have (on average 2.411764705882353) internal successors, (41), 15 states have internal predecessors, (41), 9 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (11), 8 states have call predecessors, (11), 8 states have call successors, (11) [2022-04-27 14:32:37,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 54 transitions. [2022-04-27 14:32:37,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 17 states have (on average 2.411764705882353) internal successors, (41), 15 states have internal predecessors, (41), 9 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (11), 8 states have call predecessors, (11), 8 states have call successors, (11) [2022-04-27 14:32:37,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 54 transitions. [2022-04-27 14:32:37,605 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 12 states and 54 transitions. [2022-04-27 14:32:37,643 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 54 edges. 54 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 14:32:37,644 INFO L225 Difference]: With dead ends: 92 [2022-04-27 14:32:37,644 INFO L226 Difference]: Without dead ends: 67 [2022-04-27 14:32:37,645 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 92 SyntacticMatches, 4 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 1 DeprecatedPredicates, 124 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=145, Invalid=455, Unknown=0, NotChecked=0, Total=600 [2022-04-27 14:32:37,645 INFO L413 NwaCegarLoop]: 26 mSDtfsCounter, 20 mSDsluCounter, 102 mSDsCounter, 0 mSdLazyCounter, 127 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 128 SdHoareTripleChecker+Invalid, 150 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 127 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 2 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-27 14:32:37,645 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 128 Invalid, 150 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 127 Invalid, 0 Unknown, 2 Unchecked, 0.2s Time] [2022-04-27 14:32:37,646 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2022-04-27 14:32:37,704 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67. [2022-04-27 14:32:37,704 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 14:32:37,705 INFO L82 GeneralOperation]: Start isEquivalent. First operand 67 states. Second operand has 67 states, 47 states have (on average 1.0425531914893618) internal successors, (49), 49 states have internal predecessors, (49), 12 states have call successors, (12), 8 states have call predecessors, (12), 7 states have return successors, (11), 9 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-27 14:32:37,705 INFO L74 IsIncluded]: Start isIncluded. First operand 67 states. Second operand has 67 states, 47 states have (on average 1.0425531914893618) internal successors, (49), 49 states have internal predecessors, (49), 12 states have call successors, (12), 8 states have call predecessors, (12), 7 states have return successors, (11), 9 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-27 14:32:37,705 INFO L87 Difference]: Start difference. First operand 67 states. Second operand has 67 states, 47 states have (on average 1.0425531914893618) internal successors, (49), 49 states have internal predecessors, (49), 12 states have call successors, (12), 8 states have call predecessors, (12), 7 states have return successors, (11), 9 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-27 14:32:37,706 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:32:37,706 INFO L93 Difference]: Finished difference Result 67 states and 72 transitions. [2022-04-27 14:32:37,706 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 72 transitions. [2022-04-27 14:32:37,707 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:32:37,707 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 14:32:37,707 INFO L74 IsIncluded]: Start isIncluded. First operand has 67 states, 47 states have (on average 1.0425531914893618) internal successors, (49), 49 states have internal predecessors, (49), 12 states have call successors, (12), 8 states have call predecessors, (12), 7 states have return successors, (11), 9 states have call predecessors, (11), 11 states have call successors, (11) Second operand 67 states. [2022-04-27 14:32:37,707 INFO L87 Difference]: Start difference. First operand has 67 states, 47 states have (on average 1.0425531914893618) internal successors, (49), 49 states have internal predecessors, (49), 12 states have call successors, (12), 8 states have call predecessors, (12), 7 states have return successors, (11), 9 states have call predecessors, (11), 11 states have call successors, (11) Second operand 67 states. [2022-04-27 14:32:37,708 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:32:37,708 INFO L93 Difference]: Finished difference Result 67 states and 72 transitions. [2022-04-27 14:32:37,708 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 72 transitions. [2022-04-27 14:32:37,708 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:32:37,709 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 14:32:37,709 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 14:32:37,709 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 14:32:37,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 47 states have (on average 1.0425531914893618) internal successors, (49), 49 states have internal predecessors, (49), 12 states have call successors, (12), 8 states have call predecessors, (12), 7 states have return successors, (11), 9 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-27 14:32:37,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 72 transitions. [2022-04-27 14:32:37,710 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 72 transitions. Word has length 55 [2022-04-27 14:32:37,710 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 14:32:37,710 INFO L495 AbstractCegarLoop]: Abstraction has 67 states and 72 transitions. [2022-04-27 14:32:37,710 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 2.411764705882353) internal successors, (41), 15 states have internal predecessors, (41), 9 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (11), 8 states have call predecessors, (11), 8 states have call successors, (11) [2022-04-27 14:32:37,710 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 72 transitions. [2022-04-27 14:32:37,711 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2022-04-27 14:32:37,711 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 14:32:37,711 INFO L195 NwaCegarLoop]: 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-27 14:32:37,731 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-04-27 14:32:37,929 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 14:32:37,929 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 14:32:37,930 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 14:32:37,930 INFO L85 PathProgramCache]: Analyzing trace with hash 1814345074, now seen corresponding path program 3 times [2022-04-27 14:32:37,930 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 14:32:37,930 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1894184538] [2022-04-27 14:32:37,930 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 14:32:37,930 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 14:32:37,941 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 14:32:37,941 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [980289451] [2022-04-27 14:32:37,941 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-04-27 14:32:37,941 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 14:32:37,942 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 14:32:37,947 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-27 14:32:37,948 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-04-27 14:32:37,986 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2022-04-27 14:32:37,986 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-27 14:32:37,987 INFO L263 TraceCheckSpWp]: Trace formula consists of 143 conjuncts, 24 conjunts are in the unsatisfiable core [2022-04-27 14:32:38,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 14:32:38,017 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 14:33:04,956 WARN L828 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2022-04-27 14:33:13,683 INFO L272 TraceCheckUtils]: 0: Hoare triple {3650#true} call ULTIMATE.init(); {3650#true} is VALID [2022-04-27 14:33:13,683 INFO L290 TraceCheckUtils]: 1: Hoare triple {3650#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); {3650#true} is VALID [2022-04-27 14:33:13,683 INFO L290 TraceCheckUtils]: 2: Hoare triple {3650#true} assume true; {3650#true} is VALID [2022-04-27 14:33:13,683 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3650#true} {3650#true} #71#return; {3650#true} is VALID [2022-04-27 14:33:13,683 INFO L272 TraceCheckUtils]: 4: Hoare triple {3650#true} call #t~ret6 := main(); {3650#true} is VALID [2022-04-27 14:33:13,683 INFO L290 TraceCheckUtils]: 5: Hoare triple {3650#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; {3650#true} is VALID [2022-04-27 14:33:13,683 INFO L272 TraceCheckUtils]: 6: Hoare triple {3650#true} call assume_abort_if_not((if ~a~0 >= 0 && ~a~0 <= 5 then 1 else 0)); {3650#true} is VALID [2022-04-27 14:33:13,683 INFO L290 TraceCheckUtils]: 7: Hoare triple {3650#true} ~cond := #in~cond; {3650#true} is VALID [2022-04-27 14:33:13,683 INFO L290 TraceCheckUtils]: 8: Hoare triple {3650#true} assume !(0 == ~cond); {3650#true} is VALID [2022-04-27 14:33:13,683 INFO L290 TraceCheckUtils]: 9: Hoare triple {3650#true} assume true; {3650#true} is VALID [2022-04-27 14:33:13,684 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {3650#true} {3650#true} #61#return; {3650#true} is VALID [2022-04-27 14:33:13,684 INFO L290 TraceCheckUtils]: 11: Hoare triple {3650#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~b~0 := #t~nondet5;havoc #t~nondet5; {3650#true} is VALID [2022-04-27 14:33:13,684 INFO L272 TraceCheckUtils]: 12: Hoare triple {3650#true} call assume_abort_if_not((if ~b~0 >= 0 && ~b~0 <= 5 then 1 else 0)); {3650#true} is VALID [2022-04-27 14:33:13,684 INFO L290 TraceCheckUtils]: 13: Hoare triple {3650#true} ~cond := #in~cond; {3694#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-04-27 14:33:13,684 INFO L290 TraceCheckUtils]: 14: Hoare triple {3694#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} assume !(0 == ~cond); {3698#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-27 14:33:13,685 INFO L290 TraceCheckUtils]: 15: Hoare triple {3698#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {3698#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-27 14:33:13,685 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {3698#(not (= |assume_abort_if_not_#in~cond| 0))} {3650#true} #63#return; {3705#(and (<= main_~b~0 5) (<= 0 main_~b~0))} is VALID [2022-04-27 14:33:13,685 INFO L272 TraceCheckUtils]: 17: Hoare triple {3705#(and (<= main_~b~0 5) (<= 0 main_~b~0))} call assume_abort_if_not((if ~b~0 >= 1 then 1 else 0)); {3650#true} is VALID [2022-04-27 14:33:13,685 INFO L290 TraceCheckUtils]: 18: Hoare triple {3650#true} ~cond := #in~cond; {3650#true} is VALID [2022-04-27 14:33:13,685 INFO L290 TraceCheckUtils]: 19: Hoare triple {3650#true} assume !(0 == ~cond); {3650#true} is VALID [2022-04-27 14:33:13,685 INFO L290 TraceCheckUtils]: 20: Hoare triple {3650#true} assume true; {3650#true} is VALID [2022-04-27 14:33:13,686 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {3650#true} {3705#(and (<= main_~b~0 5) (<= 0 main_~b~0))} #65#return; {3705#(and (<= main_~b~0 5) (<= 0 main_~b~0))} is VALID [2022-04-27 14:33:13,686 INFO L290 TraceCheckUtils]: 22: Hoare triple {3705#(and (<= main_~b~0 5) (<= 0 main_~b~0))} ~x~0 := ~a~0;~y~0 := ~b~0;~z~0 := 0; {3724#(and (<= main_~b~0 5) (= main_~b~0 main_~y~0) (<= 0 main_~b~0))} is VALID [2022-04-27 14:33:13,687 INFO L290 TraceCheckUtils]: 23: Hoare triple {3724#(and (<= main_~b~0 5) (= main_~b~0 main_~y~0) (<= 0 main_~b~0))} assume !false; {3724#(and (<= main_~b~0 5) (= main_~b~0 main_~y~0) (<= 0 main_~b~0))} is VALID [2022-04-27 14:33:13,687 INFO L272 TraceCheckUtils]: 24: Hoare triple {3724#(and (<= main_~b~0 5) (= main_~b~0 main_~y~0) (<= 0 main_~b~0))} call __VERIFIER_assert((if ~z~0 + ~x~0 * ~y~0 == ~a~0 * ~b~0 then 1 else 0)); {3650#true} is VALID [2022-04-27 14:33:13,687 INFO L290 TraceCheckUtils]: 25: Hoare triple {3650#true} ~cond := #in~cond; {3650#true} is VALID [2022-04-27 14:33:13,687 INFO L290 TraceCheckUtils]: 26: Hoare triple {3650#true} assume !(0 == ~cond); {3650#true} is VALID [2022-04-27 14:33:13,687 INFO L290 TraceCheckUtils]: 27: Hoare triple {3650#true} assume true; {3650#true} is VALID [2022-04-27 14:33:13,688 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {3650#true} {3724#(and (<= main_~b~0 5) (= main_~b~0 main_~y~0) (<= 0 main_~b~0))} #67#return; {3724#(and (<= main_~b~0 5) (= main_~b~0 main_~y~0) (<= 0 main_~b~0))} is VALID [2022-04-27 14:33:13,688 INFO L290 TraceCheckUtils]: 29: Hoare triple {3724#(and (<= main_~b~0 5) (= main_~b~0 main_~y~0) (<= 0 main_~b~0))} assume !!(0 != ~y~0); {3746#(and (not (= main_~y~0 0)) (<= main_~b~0 5) (= main_~b~0 main_~y~0) (<= 0 main_~b~0))} is VALID [2022-04-27 14:33:13,688 INFO L290 TraceCheckUtils]: 30: Hoare triple {3746#(and (not (= main_~y~0 0)) (<= main_~b~0 5) (= main_~b~0 main_~y~0) (<= 0 main_~b~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; {3750#(and (<= main_~b~0 5) (<= main_~b~0 (+ main_~y~0 1)) (not (= main_~b~0 0)) (<= 0 main_~b~0))} is VALID [2022-04-27 14:33:13,689 INFO L290 TraceCheckUtils]: 31: Hoare triple {3750#(and (<= main_~b~0 5) (<= main_~b~0 (+ main_~y~0 1)) (not (= main_~b~0 0)) (<= 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); {3754#(and (<= main_~b~0 5) (not (= main_~b~0 0)) (<= 0 main_~b~0) (< (div (+ 2 (* (- 1) main_~b~0)) (- 2)) (+ main_~y~0 1)))} is VALID [2022-04-27 14:33:13,690 INFO L290 TraceCheckUtils]: 32: Hoare triple {3754#(and (<= main_~b~0 5) (not (= main_~b~0 0)) (<= 0 main_~b~0) (< (div (+ 2 (* (- 1) main_~b~0)) (- 2)) (+ main_~y~0 1)))} assume !false; {3754#(and (<= main_~b~0 5) (not (= main_~b~0 0)) (<= 0 main_~b~0) (< (div (+ 2 (* (- 1) main_~b~0)) (- 2)) (+ main_~y~0 1)))} is VALID [2022-04-27 14:33:13,690 INFO L272 TraceCheckUtils]: 33: Hoare triple {3754#(and (<= main_~b~0 5) (not (= main_~b~0 0)) (<= 0 main_~b~0) (< (div (+ 2 (* (- 1) main_~b~0)) (- 2)) (+ main_~y~0 1)))} call __VERIFIER_assert((if ~z~0 + ~x~0 * ~y~0 == ~a~0 * ~b~0 then 1 else 0)); {3650#true} is VALID [2022-04-27 14:33:13,690 INFO L290 TraceCheckUtils]: 34: Hoare triple {3650#true} ~cond := #in~cond; {3650#true} is VALID [2022-04-27 14:33:13,690 INFO L290 TraceCheckUtils]: 35: Hoare triple {3650#true} assume !(0 == ~cond); {3650#true} is VALID [2022-04-27 14:33:13,690 INFO L290 TraceCheckUtils]: 36: Hoare triple {3650#true} assume true; {3650#true} is VALID [2022-04-27 14:33:13,691 INFO L284 TraceCheckUtils]: 37: Hoare quadruple {3650#true} {3754#(and (<= main_~b~0 5) (not (= main_~b~0 0)) (<= 0 main_~b~0) (< (div (+ 2 (* (- 1) main_~b~0)) (- 2)) (+ main_~y~0 1)))} #67#return; {3754#(and (<= main_~b~0 5) (not (= main_~b~0 0)) (<= 0 main_~b~0) (< (div (+ 2 (* (- 1) main_~b~0)) (- 2)) (+ main_~y~0 1)))} is VALID [2022-04-27 14:33:13,691 INFO L290 TraceCheckUtils]: 38: Hoare triple {3754#(and (<= main_~b~0 5) (not (= main_~b~0 0)) (<= 0 main_~b~0) (< (div (+ 2 (* (- 1) main_~b~0)) (- 2)) (+ main_~y~0 1)))} assume !!(0 != ~y~0); {3754#(and (<= main_~b~0 5) (not (= main_~b~0 0)) (<= 0 main_~b~0) (< (div (+ 2 (* (- 1) main_~b~0)) (- 2)) (+ main_~y~0 1)))} is VALID [2022-04-27 14:33:13,691 INFO L290 TraceCheckUtils]: 39: Hoare triple {3754#(and (<= main_~b~0 5) (not (= main_~b~0 0)) (<= 0 main_~b~0) (< (div (+ 2 (* (- 1) main_~b~0)) (- 2)) (+ main_~y~0 1)))} assume !(1 == (if ~y~0 < 0 && 0 != ~y~0 % 2 then ~y~0 % 2 - 2 else ~y~0 % 2)); {3754#(and (<= main_~b~0 5) (not (= main_~b~0 0)) (<= 0 main_~b~0) (< (div (+ 2 (* (- 1) main_~b~0)) (- 2)) (+ main_~y~0 1)))} is VALID [2022-04-27 14:33:13,693 INFO L290 TraceCheckUtils]: 40: Hoare triple {3754#(and (<= main_~b~0 5) (not (= main_~b~0 0)) (<= 0 main_~b~0) (< (div (+ 2 (* (- 1) main_~b~0)) (- 2)) (+ 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); {3782#(and (< (div (+ (* (- 1) (div (+ 2 (* (- 1) main_~b~0)) (- 2))) 1) (- 2)) (+ main_~y~0 1)) (<= main_~b~0 5) (not (= main_~b~0 0)) (<= 0 main_~b~0))} is VALID [2022-04-27 14:33:13,693 INFO L290 TraceCheckUtils]: 41: Hoare triple {3782#(and (< (div (+ (* (- 1) (div (+ 2 (* (- 1) main_~b~0)) (- 2))) 1) (- 2)) (+ main_~y~0 1)) (<= main_~b~0 5) (not (= main_~b~0 0)) (<= 0 main_~b~0))} assume !false; {3782#(and (< (div (+ (* (- 1) (div (+ 2 (* (- 1) main_~b~0)) (- 2))) 1) (- 2)) (+ main_~y~0 1)) (<= main_~b~0 5) (not (= main_~b~0 0)) (<= 0 main_~b~0))} is VALID [2022-04-27 14:33:13,693 INFO L272 TraceCheckUtils]: 42: Hoare triple {3782#(and (< (div (+ (* (- 1) (div (+ 2 (* (- 1) main_~b~0)) (- 2))) 1) (- 2)) (+ main_~y~0 1)) (<= main_~b~0 5) (not (= main_~b~0 0)) (<= 0 main_~b~0))} call __VERIFIER_assert((if ~z~0 + ~x~0 * ~y~0 == ~a~0 * ~b~0 then 1 else 0)); {3650#true} is VALID [2022-04-27 14:33:13,693 INFO L290 TraceCheckUtils]: 43: Hoare triple {3650#true} ~cond := #in~cond; {3792#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-27 14:33:13,694 INFO L290 TraceCheckUtils]: 44: Hoare triple {3792#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {3796#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 14:33:13,694 INFO L290 TraceCheckUtils]: 45: Hoare triple {3796#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {3796#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 14:33:13,694 INFO L284 TraceCheckUtils]: 46: Hoare quadruple {3796#(not (= |__VERIFIER_assert_#in~cond| 0))} {3782#(and (< (div (+ (* (- 1) (div (+ 2 (* (- 1) main_~b~0)) (- 2))) 1) (- 2)) (+ main_~y~0 1)) (<= main_~b~0 5) (not (= main_~b~0 0)) (<= 0 main_~b~0))} #67#return; {3803#(and (= (+ main_~z~0 (* main_~y~0 main_~x~0)) (* main_~b~0 main_~a~0)) (< (div (+ (* (- 1) (div (+ 2 (* (- 1) main_~b~0)) (- 2))) 1) (- 2)) (+ main_~y~0 1)) (<= main_~b~0 5) (not (= main_~b~0 0)) (<= 0 main_~b~0))} is VALID [2022-04-27 14:33:13,695 INFO L290 TraceCheckUtils]: 47: Hoare triple {3803#(and (= (+ main_~z~0 (* main_~y~0 main_~x~0)) (* main_~b~0 main_~a~0)) (< (div (+ (* (- 1) (div (+ 2 (* (- 1) main_~b~0)) (- 2))) 1) (- 2)) (+ main_~y~0 1)) (<= main_~b~0 5) (not (= main_~b~0 0)) (<= 0 main_~b~0))} assume !!(0 != ~y~0); {3803#(and (= (+ main_~z~0 (* main_~y~0 main_~x~0)) (* main_~b~0 main_~a~0)) (< (div (+ (* (- 1) (div (+ 2 (* (- 1) main_~b~0)) (- 2))) 1) (- 2)) (+ main_~y~0 1)) (<= main_~b~0 5) (not (= main_~b~0 0)) (<= 0 main_~b~0))} is VALID [2022-04-27 14:33:13,696 INFO L290 TraceCheckUtils]: 48: Hoare triple {3803#(and (= (+ main_~z~0 (* main_~y~0 main_~x~0)) (* main_~b~0 main_~a~0)) (< (div (+ (* (- 1) (div (+ 2 (* (- 1) main_~b~0)) (- 2))) 1) (- 2)) (+ main_~y~0 1)) (<= main_~b~0 5) (not (= main_~b~0 0)) (<= 0 main_~b~0))} assume !(1 == (if ~y~0 < 0 && 0 != ~y~0 % 2 then ~y~0 % 2 - 2 else ~y~0 % 2)); {3810#(and (= (+ main_~z~0 (* main_~y~0 main_~x~0)) (* main_~b~0 main_~a~0)) (not (= (mod main_~y~0 2) 1)) (< (div (+ (* (- 1) (div (+ 2 (* (- 1) main_~b~0)) (- 2))) 1) (- 2)) (+ main_~y~0 1)) (<= main_~b~0 5) (not (= main_~b~0 0)) (<= 0 main_~b~0))} is VALID [2022-04-27 14:33:15,698 WARN L290 TraceCheckUtils]: 49: Hoare triple {3810#(and (= (+ main_~z~0 (* main_~y~0 main_~x~0)) (* main_~b~0 main_~a~0)) (not (= (mod main_~y~0 2) 1)) (< (div (+ (* (- 1) (div (+ 2 (* (- 1) main_~b~0)) (- 2))) 1) (- 2)) (+ main_~y~0 1)) (<= main_~b~0 5) (not (= main_~b~0 0)) (<= 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); {3814#(and (exists ((aux_mod_v_main_~y~0_44_22 Int) (aux_div_v_main_~y~0_44_22 Int)) (and (not (= aux_mod_v_main_~y~0_44_22 1)) (= (div (+ (* aux_div_v_main_~y~0_44_22 2) aux_mod_v_main_~y~0_44_22) 2) main_~y~0) (= (+ main_~z~0 (* (+ (* aux_div_v_main_~y~0_44_22 2) aux_mod_v_main_~y~0_44_22) (div (- main_~x~0) (- 2)))) (* main_~b~0 main_~a~0)) (< aux_mod_v_main_~y~0_44_22 2) (<= 0 aux_mod_v_main_~y~0_44_22) (< (div (+ (* (- 1) (div (+ 2 (* (- 1) main_~b~0)) (- 2))) 1) (- 2)) (+ (* aux_div_v_main_~y~0_44_22 2) aux_mod_v_main_~y~0_44_22 1)))) (<= main_~b~0 5) (not (= main_~b~0 0)) (<= 0 main_~b~0) (= (mod main_~x~0 2) 0))} is UNKNOWN [2022-04-27 14:33:15,922 INFO L290 TraceCheckUtils]: 50: Hoare triple {3814#(and (exists ((aux_mod_v_main_~y~0_44_22 Int) (aux_div_v_main_~y~0_44_22 Int)) (and (not (= aux_mod_v_main_~y~0_44_22 1)) (= (div (+ (* aux_div_v_main_~y~0_44_22 2) aux_mod_v_main_~y~0_44_22) 2) main_~y~0) (= (+ main_~z~0 (* (+ (* aux_div_v_main_~y~0_44_22 2) aux_mod_v_main_~y~0_44_22) (div (- main_~x~0) (- 2)))) (* main_~b~0 main_~a~0)) (< aux_mod_v_main_~y~0_44_22 2) (<= 0 aux_mod_v_main_~y~0_44_22) (< (div (+ (* (- 1) (div (+ 2 (* (- 1) main_~b~0)) (- 2))) 1) (- 2)) (+ (* aux_div_v_main_~y~0_44_22 2) aux_mod_v_main_~y~0_44_22 1)))) (<= main_~b~0 5) (not (= main_~b~0 0)) (<= 0 main_~b~0) (= (mod main_~x~0 2) 0))} assume !false; {3818#(and (= (+ main_~z~0 (* 2 (* (div (* (- 1) main_~x~0) (- 2)) main_~y~0))) (* main_~b~0 main_~a~0)) (<= main_~b~0 5) (not (= main_~b~0 0)) (<= 0 main_~b~0) (= (mod main_~x~0 2) 0) (< (div (* (- 1) (div (+ (* (- 1) (div (+ 2 (* (- 1) main_~b~0)) (- 2))) 1) (- 2))) (- 2)) (+ main_~y~0 1)))} is VALID [2022-04-27 14:33:16,207 INFO L272 TraceCheckUtils]: 51: Hoare triple {3818#(and (= (+ main_~z~0 (* 2 (* (div (* (- 1) main_~x~0) (- 2)) main_~y~0))) (* main_~b~0 main_~a~0)) (<= main_~b~0 5) (not (= main_~b~0 0)) (<= 0 main_~b~0) (= (mod main_~x~0 2) 0) (< (div (* (- 1) (div (+ (* (- 1) (div (+ 2 (* (- 1) main_~b~0)) (- 2))) 1) (- 2))) (- 2)) (+ main_~y~0 1)))} call __VERIFIER_assert((if ~z~0 + ~x~0 * ~y~0 == ~a~0 * ~b~0 then 1 else 0)); {3822#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 14:33:16,207 INFO L290 TraceCheckUtils]: 52: Hoare triple {3822#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {3826#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 14:33:16,207 INFO L290 TraceCheckUtils]: 53: Hoare triple {3826#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {3651#false} is VALID [2022-04-27 14:33:16,208 INFO L290 TraceCheckUtils]: 54: Hoare triple {3651#false} assume !false; {3651#false} is VALID [2022-04-27 14:33:16,208 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 16 proven. 23 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-04-27 14:33:16,208 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 14:33:50,311 INFO L290 TraceCheckUtils]: 54: Hoare triple {3651#false} assume !false; {3651#false} is VALID [2022-04-27 14:33:50,312 INFO L290 TraceCheckUtils]: 53: Hoare triple {3826#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {3651#false} is VALID [2022-04-27 14:33:50,312 INFO L290 TraceCheckUtils]: 52: Hoare triple {3822#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {3826#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 14:33:50,313 INFO L272 TraceCheckUtils]: 51: Hoare triple {3842#(= (+ 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)); {3822#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 14:33:50,313 INFO L290 TraceCheckUtils]: 50: Hoare triple {3842#(= (+ main_~z~0 (* main_~y~0 main_~x~0)) (* main_~b~0 main_~a~0))} assume !false; {3842#(= (+ main_~z~0 (* main_~y~0 main_~x~0)) (* main_~b~0 main_~a~0))} is VALID [2022-04-27 14:33:50,317 INFO L290 TraceCheckUtils]: 49: Hoare triple {3849#(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); {3842#(= (+ main_~z~0 (* main_~y~0 main_~x~0)) (* main_~b~0 main_~a~0))} is VALID [2022-04-27 14:33:50,318 INFO L290 TraceCheckUtils]: 48: Hoare triple {3853#(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)); {3849#(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-27 14:33:50,318 INFO L290 TraceCheckUtils]: 47: Hoare triple {3853#(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); {3853#(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-27 14:33:50,321 INFO L284 TraceCheckUtils]: 46: Hoare quadruple {3796#(not (= |__VERIFIER_assert_#in~cond| 0))} {3860#(or (<= 0 main_~y~0) (= (mod main_~y~0 2) 0))} #67#return; {3853#(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-27 14:33:50,321 INFO L290 TraceCheckUtils]: 45: Hoare triple {3796#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {3796#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 14:33:50,322 INFO L290 TraceCheckUtils]: 44: Hoare triple {3870#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} assume !(0 == ~cond); {3796#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 14:33:50,323 INFO L290 TraceCheckUtils]: 43: Hoare triple {3650#true} ~cond := #in~cond; {3870#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-27 14:33:50,323 INFO L272 TraceCheckUtils]: 42: Hoare triple {3860#(or (<= 0 main_~y~0) (= (mod main_~y~0 2) 0))} call __VERIFIER_assert((if ~z~0 + ~x~0 * ~y~0 == ~a~0 * ~b~0 then 1 else 0)); {3650#true} is VALID [2022-04-27 14:33:50,323 INFO L290 TraceCheckUtils]: 41: Hoare triple {3860#(or (<= 0 main_~y~0) (= (mod main_~y~0 2) 0))} assume !false; {3860#(or (<= 0 main_~y~0) (= (mod main_~y~0 2) 0))} is VALID [2022-04-27 14:33:50,324 INFO L290 TraceCheckUtils]: 40: Hoare triple {3880#(and (<= 0 (+ (div main_~y~0 2) 1)) (or (not (= (mod main_~y~0 2) 0)) (<= 0 (+ (div (+ (- 2) (div main_~y~0 2)) 2) 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); {3860#(or (<= 0 main_~y~0) (= (mod main_~y~0 2) 0))} is VALID [2022-04-27 14:33:50,324 INFO L290 TraceCheckUtils]: 39: Hoare triple {3880#(and (<= 0 (+ (div main_~y~0 2) 1)) (or (not (= (mod main_~y~0 2) 0)) (<= 0 (+ (div (+ (- 2) (div main_~y~0 2)) 2) 1))))} assume !(1 == (if ~y~0 < 0 && 0 != ~y~0 % 2 then ~y~0 % 2 - 2 else ~y~0 % 2)); {3880#(and (<= 0 (+ (div main_~y~0 2) 1)) (or (not (= (mod main_~y~0 2) 0)) (<= 0 (+ (div (+ (- 2) (div main_~y~0 2)) 2) 1))))} is VALID [2022-04-27 14:33:50,325 INFO L290 TraceCheckUtils]: 38: Hoare triple {3880#(and (<= 0 (+ (div main_~y~0 2) 1)) (or (not (= (mod main_~y~0 2) 0)) (<= 0 (+ (div (+ (- 2) (div main_~y~0 2)) 2) 1))))} assume !!(0 != ~y~0); {3880#(and (<= 0 (+ (div main_~y~0 2) 1)) (or (not (= (mod main_~y~0 2) 0)) (<= 0 (+ (div (+ (- 2) (div main_~y~0 2)) 2) 1))))} is VALID [2022-04-27 14:33:50,325 INFO L284 TraceCheckUtils]: 37: Hoare quadruple {3650#true} {3880#(and (<= 0 (+ (div main_~y~0 2) 1)) (or (not (= (mod main_~y~0 2) 0)) (<= 0 (+ (div (+ (- 2) (div main_~y~0 2)) 2) 1))))} #67#return; {3880#(and (<= 0 (+ (div main_~y~0 2) 1)) (or (not (= (mod main_~y~0 2) 0)) (<= 0 (+ (div (+ (- 2) (div main_~y~0 2)) 2) 1))))} is VALID [2022-04-27 14:33:50,325 INFO L290 TraceCheckUtils]: 36: Hoare triple {3650#true} assume true; {3650#true} is VALID [2022-04-27 14:33:50,325 INFO L290 TraceCheckUtils]: 35: Hoare triple {3650#true} assume !(0 == ~cond); {3650#true} is VALID [2022-04-27 14:33:50,327 INFO L290 TraceCheckUtils]: 34: Hoare triple {3650#true} ~cond := #in~cond; {3650#true} is VALID [2022-04-27 14:33:50,327 INFO L272 TraceCheckUtils]: 33: Hoare triple {3880#(and (<= 0 (+ (div main_~y~0 2) 1)) (or (not (= (mod main_~y~0 2) 0)) (<= 0 (+ (div (+ (- 2) (div main_~y~0 2)) 2) 1))))} call __VERIFIER_assert((if ~z~0 + ~x~0 * ~y~0 == ~a~0 * ~b~0 then 1 else 0)); {3650#true} is VALID [2022-04-27 14:33:50,330 INFO L290 TraceCheckUtils]: 32: Hoare triple {3880#(and (<= 0 (+ (div main_~y~0 2) 1)) (or (not (= (mod main_~y~0 2) 0)) (<= 0 (+ (div (+ (- 2) (div main_~y~0 2)) 2) 1))))} assume !false; {3880#(and (<= 0 (+ (div main_~y~0 2) 1)) (or (not (= (mod main_~y~0 2) 0)) (<= 0 (+ (div (+ (- 2) (div main_~y~0 2)) 2) 1))))} is VALID [2022-04-27 14:33:50,331 INFO L290 TraceCheckUtils]: 31: Hoare triple {3908#(and (or (not (= (mod main_~y~0 2) 0)) (<= 0 (+ 2 (div (+ (- 2) (div (+ 4 (* (- 1) (div main_~y~0 2))) (- 2))) 2)))) (<= 0 (+ (div (+ (- 1) (div (+ (div main_~y~0 2) (- 4)) 2)) 2) 2)))} ~x~0 := 2 * ~x~0;~y~0 := (if ~y~0 < 0 && 0 != ~y~0 % 2 then 1 + ~y~0 / 2 else ~y~0 / 2); {3880#(and (<= 0 (+ (div main_~y~0 2) 1)) (or (not (= (mod main_~y~0 2) 0)) (<= 0 (+ (div (+ (- 2) (div main_~y~0 2)) 2) 1))))} is VALID [2022-04-27 14:33:50,333 INFO L290 TraceCheckUtils]: 30: Hoare triple {3912#(<= 0 (+ 3 (div (+ (- 1) (div (+ (- 4) (* (- 1) (div (+ main_~y~0 (- 10)) (- 2)))) 2)) 2)))} 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; {3908#(and (or (not (= (mod main_~y~0 2) 0)) (<= 0 (+ 2 (div (+ (- 2) (div (+ 4 (* (- 1) (div main_~y~0 2))) (- 2))) 2)))) (<= 0 (+ (div (+ (- 1) (div (+ (div main_~y~0 2) (- 4)) 2)) 2) 2)))} is VALID [2022-04-27 14:33:50,333 INFO L290 TraceCheckUtils]: 29: Hoare triple {3912#(<= 0 (+ 3 (div (+ (- 1) (div (+ (- 4) (* (- 1) (div (+ main_~y~0 (- 10)) (- 2)))) 2)) 2)))} assume !!(0 != ~y~0); {3912#(<= 0 (+ 3 (div (+ (- 1) (div (+ (- 4) (* (- 1) (div (+ main_~y~0 (- 10)) (- 2)))) 2)) 2)))} is VALID [2022-04-27 14:33:50,334 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {3650#true} {3912#(<= 0 (+ 3 (div (+ (- 1) (div (+ (- 4) (* (- 1) (div (+ main_~y~0 (- 10)) (- 2)))) 2)) 2)))} #67#return; {3912#(<= 0 (+ 3 (div (+ (- 1) (div (+ (- 4) (* (- 1) (div (+ main_~y~0 (- 10)) (- 2)))) 2)) 2)))} is VALID [2022-04-27 14:33:50,334 INFO L290 TraceCheckUtils]: 27: Hoare triple {3650#true} assume true; {3650#true} is VALID [2022-04-27 14:33:50,334 INFO L290 TraceCheckUtils]: 26: Hoare triple {3650#true} assume !(0 == ~cond); {3650#true} is VALID [2022-04-27 14:33:50,334 INFO L290 TraceCheckUtils]: 25: Hoare triple {3650#true} ~cond := #in~cond; {3650#true} is VALID [2022-04-27 14:33:50,334 INFO L272 TraceCheckUtils]: 24: Hoare triple {3912#(<= 0 (+ 3 (div (+ (- 1) (div (+ (- 4) (* (- 1) (div (+ main_~y~0 (- 10)) (- 2)))) 2)) 2)))} call __VERIFIER_assert((if ~z~0 + ~x~0 * ~y~0 == ~a~0 * ~b~0 then 1 else 0)); {3650#true} is VALID [2022-04-27 14:33:50,334 INFO L290 TraceCheckUtils]: 23: Hoare triple {3912#(<= 0 (+ 3 (div (+ (- 1) (div (+ (- 4) (* (- 1) (div (+ main_~y~0 (- 10)) (- 2)))) 2)) 2)))} assume !false; {3912#(<= 0 (+ 3 (div (+ (- 1) (div (+ (- 4) (* (- 1) (div (+ main_~y~0 (- 10)) (- 2)))) 2)) 2)))} is VALID [2022-04-27 14:33:50,335 INFO L290 TraceCheckUtils]: 22: Hoare triple {3937#(<= 0 (+ 3 (div (+ (- 1) (div (+ (* (- 1) (div (+ main_~b~0 (- 10)) (- 2))) (- 4)) 2)) 2)))} ~x~0 := ~a~0;~y~0 := ~b~0;~z~0 := 0; {3912#(<= 0 (+ 3 (div (+ (- 1) (div (+ (- 4) (* (- 1) (div (+ main_~y~0 (- 10)) (- 2)))) 2)) 2)))} is VALID [2022-04-27 14:33:50,335 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {3650#true} {3937#(<= 0 (+ 3 (div (+ (- 1) (div (+ (* (- 1) (div (+ main_~b~0 (- 10)) (- 2))) (- 4)) 2)) 2)))} #65#return; {3937#(<= 0 (+ 3 (div (+ (- 1) (div (+ (* (- 1) (div (+ main_~b~0 (- 10)) (- 2))) (- 4)) 2)) 2)))} is VALID [2022-04-27 14:33:50,335 INFO L290 TraceCheckUtils]: 20: Hoare triple {3650#true} assume true; {3650#true} is VALID [2022-04-27 14:33:50,335 INFO L290 TraceCheckUtils]: 19: Hoare triple {3650#true} assume !(0 == ~cond); {3650#true} is VALID [2022-04-27 14:33:50,335 INFO L290 TraceCheckUtils]: 18: Hoare triple {3650#true} ~cond := #in~cond; {3650#true} is VALID [2022-04-27 14:33:50,335 INFO L272 TraceCheckUtils]: 17: Hoare triple {3937#(<= 0 (+ 3 (div (+ (- 1) (div (+ (* (- 1) (div (+ main_~b~0 (- 10)) (- 2))) (- 4)) 2)) 2)))} call assume_abort_if_not((if ~b~0 >= 1 then 1 else 0)); {3650#true} is VALID [2022-04-27 14:33:50,336 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {3698#(not (= |assume_abort_if_not_#in~cond| 0))} {3650#true} #63#return; {3937#(<= 0 (+ 3 (div (+ (- 1) (div (+ (* (- 1) (div (+ main_~b~0 (- 10)) (- 2))) (- 4)) 2)) 2)))} is VALID [2022-04-27 14:33:50,336 INFO L290 TraceCheckUtils]: 15: Hoare triple {3698#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {3698#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-27 14:33:50,336 INFO L290 TraceCheckUtils]: 14: Hoare triple {3965#(or (not (= |assume_abort_if_not_#in~cond| 0)) (= assume_abort_if_not_~cond 0))} assume !(0 == ~cond); {3698#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-27 14:33:50,337 INFO L290 TraceCheckUtils]: 13: Hoare triple {3650#true} ~cond := #in~cond; {3965#(or (not (= |assume_abort_if_not_#in~cond| 0)) (= assume_abort_if_not_~cond 0))} is VALID [2022-04-27 14:33:50,337 INFO L272 TraceCheckUtils]: 12: Hoare triple {3650#true} call assume_abort_if_not((if ~b~0 >= 0 && ~b~0 <= 5 then 1 else 0)); {3650#true} is VALID [2022-04-27 14:33:50,337 INFO L290 TraceCheckUtils]: 11: Hoare triple {3650#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~b~0 := #t~nondet5;havoc #t~nondet5; {3650#true} is VALID [2022-04-27 14:33:50,337 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {3650#true} {3650#true} #61#return; {3650#true} is VALID [2022-04-27 14:33:50,337 INFO L290 TraceCheckUtils]: 9: Hoare triple {3650#true} assume true; {3650#true} is VALID [2022-04-27 14:33:50,337 INFO L290 TraceCheckUtils]: 8: Hoare triple {3650#true} assume !(0 == ~cond); {3650#true} is VALID [2022-04-27 14:33:50,337 INFO L290 TraceCheckUtils]: 7: Hoare triple {3650#true} ~cond := #in~cond; {3650#true} is VALID [2022-04-27 14:33:50,337 INFO L272 TraceCheckUtils]: 6: Hoare triple {3650#true} call assume_abort_if_not((if ~a~0 >= 0 && ~a~0 <= 5 then 1 else 0)); {3650#true} is VALID [2022-04-27 14:33:50,337 INFO L290 TraceCheckUtils]: 5: Hoare triple {3650#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; {3650#true} is VALID [2022-04-27 14:33:50,337 INFO L272 TraceCheckUtils]: 4: Hoare triple {3650#true} call #t~ret6 := main(); {3650#true} is VALID [2022-04-27 14:33:50,337 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3650#true} {3650#true} #71#return; {3650#true} is VALID [2022-04-27 14:33:50,338 INFO L290 TraceCheckUtils]: 2: Hoare triple {3650#true} assume true; {3650#true} is VALID [2022-04-27 14:33:50,338 INFO L290 TraceCheckUtils]: 1: Hoare triple {3650#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); {3650#true} is VALID [2022-04-27 14:33:50,338 INFO L272 TraceCheckUtils]: 0: Hoare triple {3650#true} call ULTIMATE.init(); {3650#true} is VALID [2022-04-27 14:33:50,338 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 19 proven. 20 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-04-27 14:33:50,338 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 14:33:50,338 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1894184538] [2022-04-27 14:33:50,338 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 14:33:50,338 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [980289451] [2022-04-27 14:33:50,338 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [980289451] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 14:33:50,338 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-27 14:33:50,338 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 16] total 28 [2022-04-27 14:33:50,338 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [224140725] [2022-04-27 14:33:50,339 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-27 14:33:50,339 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 27 states have (on average 1.8888888888888888) internal successors, (51), 25 states have internal predecessors, (51), 11 states have call successors, (14), 2 states have call predecessors, (14), 3 states have return successors, (12), 9 states have call predecessors, (12), 9 states have call successors, (12) Word has length 55 [2022-04-27 14:33:50,339 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 14:33:50,340 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 28 states, 27 states have (on average 1.8888888888888888) internal successors, (51), 25 states have internal predecessors, (51), 11 states have call successors, (14), 2 states have call predecessors, (14), 3 states have return successors, (12), 9 states have call predecessors, (12), 9 states have call successors, (12) [2022-04-27 14:33:53,477 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 77 edges. 76 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-27 14:33:53,477 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2022-04-27 14:33:53,477 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 14:33:53,478 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2022-04-27 14:33:53,478 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=141, Invalid=612, Unknown=3, NotChecked=0, Total=756 [2022-04-27 14:33:53,478 INFO L87 Difference]: Start difference. First operand 67 states and 72 transitions. Second operand has 28 states, 27 states have (on average 1.8888888888888888) internal successors, (51), 25 states have internal predecessors, (51), 11 states have call successors, (14), 2 states have call predecessors, (14), 3 states have return successors, (12), 9 states have call predecessors, (12), 9 states have call successors, (12) [2022-04-27 14:34:04,368 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.27s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-27 14:34:05,953 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.15s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-27 14:34:12,615 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.45s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-27 14:34:21,377 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.03s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-27 14:34:23,384 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-27 14:34:26,899 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:34:26,900 INFO L93 Difference]: Finished difference Result 67 states and 72 transitions. [2022-04-27 14:34:26,900 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-04-27 14:34:26,900 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 27 states have (on average 1.8888888888888888) internal successors, (51), 25 states have internal predecessors, (51), 11 states have call successors, (14), 2 states have call predecessors, (14), 3 states have return successors, (12), 9 states have call predecessors, (12), 9 states have call successors, (12) Word has length 55 [2022-04-27 14:34:26,900 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 14:34:26,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 27 states have (on average 1.8888888888888888) internal successors, (51), 25 states have internal predecessors, (51), 11 states have call successors, (14), 2 states have call predecessors, (14), 3 states have return successors, (12), 9 states have call predecessors, (12), 9 states have call successors, (12) [2022-04-27 14:34:26,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 42 transitions. [2022-04-27 14:34:26,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 27 states have (on average 1.8888888888888888) internal successors, (51), 25 states have internal predecessors, (51), 11 states have call successors, (14), 2 states have call predecessors, (14), 3 states have return successors, (12), 9 states have call predecessors, (12), 9 states have call successors, (12) [2022-04-27 14:34:26,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 42 transitions. [2022-04-27 14:34:26,902 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 17 states and 42 transitions. [2022-04-27 14:34:31,532 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 42 edges. 41 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-27 14:34:31,533 INFO L225 Difference]: With dead ends: 67 [2022-04-27 14:34:31,533 INFO L226 Difference]: Without dead ends: 0 [2022-04-27 14:34:31,534 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 82 SyntacticMatches, 4 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 1 DeprecatedPredicates, 355 ImplicationChecksByTransitivity, 20.2s TimeCoverageRelationStatistics Valid=268, Invalid=1061, Unknown=3, NotChecked=0, Total=1332 [2022-04-27 14:34:31,534 INFO L413 NwaCegarLoop]: 17 mSDtfsCounter, 46 mSDsluCounter, 138 mSDsCounter, 0 mSdLazyCounter, 218 mSolverCounterSat, 35 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 13.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 155 SdHoareTripleChecker+Invalid, 265 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 218 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 11 IncrementalHoareTripleChecker+Unchecked, 13.0s IncrementalHoareTripleChecker+Time [2022-04-27 14:34:31,534 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 155 Invalid, 265 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 218 Invalid, 1 Unknown, 11 Unchecked, 13.0s Time] [2022-04-27 14:34:31,534 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-04-27 14:34:31,535 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-04-27 14:34:31,535 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 14:34:31,535 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-27 14:34:31,535 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-27 14:34:31,535 INFO L87 Difference]: Start difference. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-27 14:34:31,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:34:31,535 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-27 14:34:31,536 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-27 14:34:31,536 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:34:31,536 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 14:34:31,536 INFO L74 IsIncluded]: Start isIncluded. First operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 0 states. [2022-04-27 14:34:31,536 INFO L87 Difference]: Start difference. First operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 0 states. [2022-04-27 14:34:31,536 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:34:31,536 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-27 14:34:31,536 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-27 14:34:31,536 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:34:31,536 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 14:34:31,536 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 14:34:31,536 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 14:34:31,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-27 14:34:31,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-04-27 14:34:31,537 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 55 [2022-04-27 14:34:31,537 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 14:34:31,537 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-04-27 14:34:31,537 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 27 states have (on average 1.8888888888888888) internal successors, (51), 25 states have internal predecessors, (51), 11 states have call successors, (14), 2 states have call predecessors, (14), 3 states have return successors, (12), 9 states have call predecessors, (12), 9 states have call successors, (12) [2022-04-27 14:34:31,537 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-27 14:34:31,537 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:34:31,539 INFO L805 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-04-27 14:34:31,559 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-04-27 14:34:31,740 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable8 [2022-04-27 14:34:31,741 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-04-27 14:34:42,669 WARN L232 SmtUtils]: Spent 10.78s on a formula simplification. DAG size of input: 102 DAG size of output: 48 (called from [L 149] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.combineInter) [2022-04-27 14:34:51,474 WARN L232 SmtUtils]: Spent 8.73s on a formula simplification. DAG size of input: 102 DAG size of output: 48 (called from [L 149] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.combineInter) [2022-04-27 14:34:51,486 INFO L899 garLoopResultBuilder]: For program point reach_errorEXIT(line 6) no Hoare annotation was computed. [2022-04-27 14:34:51,486 INFO L899 garLoopResultBuilder]: For program point reach_errorENTRY(line 6) no Hoare annotation was computed. [2022-04-27 14:34:51,487 INFO L899 garLoopResultBuilder]: For program point reach_errorFINAL(line 6) no Hoare annotation was computed. [2022-04-27 14:34:51,487 INFO L902 garLoopResultBuilder]: At program point assume_abort_if_notENTRY(lines 9 11) the Hoare annotation is: true [2022-04-27 14:34:51,487 INFO L899 garLoopResultBuilder]: For program point L10(line 10) no Hoare annotation was computed. [2022-04-27 14:34:51,487 INFO L899 garLoopResultBuilder]: For program point L10-2(lines 9 11) no Hoare annotation was computed. [2022-04-27 14:34:51,487 INFO L899 garLoopResultBuilder]: For program point assume_abort_if_notEXIT(lines 9 11) no Hoare annotation was computed. [2022-04-27 14:34:51,487 INFO L902 garLoopResultBuilder]: At program point L27(line 27) the Hoare annotation is: true [2022-04-27 14:34:51,487 INFO L895 garLoopResultBuilder]: At program point L27-1(line 27) the Hoare annotation is: (and (<= main_~b~0 5) (<= 0 main_~b~0)) [2022-04-27 14:34:51,487 INFO L902 garLoopResultBuilder]: At program point L25(line 25) the Hoare annotation is: true [2022-04-27 14:34:51,487 INFO L899 garLoopResultBuilder]: For program point mainEXIT(lines 20 49) no Hoare annotation was computed. [2022-04-27 14:34:51,487 INFO L899 garLoopResultBuilder]: For program point L25-1(line 25) no Hoare annotation was computed. [2022-04-27 14:34:51,487 INFO L899 garLoopResultBuilder]: For program point L46(line 46) no Hoare annotation was computed. [2022-04-27 14:34:51,487 INFO L899 garLoopResultBuilder]: For program point mainFINAL(lines 20 49) no Hoare annotation was computed. [2022-04-27 14:34:51,487 INFO L895 garLoopResultBuilder]: At program point L34-2(lines 34 45) the Hoare annotation is: (let ((.cse4 (* main_~b~0 main_~a~0))) (let ((.cse1 (= (+ main_~z~0 (* main_~y~0 main_~x~0)) .cse4)) (.cse2 (<= main_~b~0 5)) (.cse3 (<= 1 main_~b~0)) (.cse0 (+ main_~y~0 1))) (or (and (<= 1 (mod .cse0 2)) .cse1 .cse2 .cse3 (<= 0 .cse0) (<= main_~y~0 1)) (and .cse1 (= main_~b~0 main_~y~0) (<= 1 main_~y~0) (= main_~a~0 main_~x~0) (<= main_~y~0 5)) (and (<= main_~y~0 2) (= (+ main_~z~0 (* 2 (* (div (* (- 1) main_~x~0) (- 2)) main_~y~0))) .cse4) .cse2 .cse3 (= (mod main_~x~0 2) 0) (< (div (* (- 1) (div (+ (* (- 1) (div (+ 2 (* (- 1) main_~b~0)) (- 2))) 1) (- 2))) (- 2)) .cse0))))) [2022-04-27 14:34:51,487 INFO L895 garLoopResultBuilder]: At program point L34-3(lines 34 45) the Hoare annotation is: (let ((.cse0 (* main_~b~0 main_~a~0))) (and (= main_~z~0 .cse0) (= (+ main_~z~0 (* main_~y~0 main_~x~0)) .cse0) (<= 1 main_~b~0))) [2022-04-27 14:34:51,487 INFO L902 garLoopResultBuilder]: At program point mainENTRY(lines 20 49) the Hoare annotation is: true [2022-04-27 14:34:51,487 INFO L899 garLoopResultBuilder]: For program point L28(line 28) no Hoare annotation was computed. [2022-04-27 14:34:51,487 INFO L899 garLoopResultBuilder]: For program point L39(lines 39 42) no Hoare annotation was computed. [2022-04-27 14:34:51,488 INFO L899 garLoopResultBuilder]: For program point L39-2(lines 39 42) no Hoare annotation was computed. [2022-04-27 14:34:51,488 INFO L895 garLoopResultBuilder]: At program point L35(line 35) the Hoare annotation is: (let ((.cse4 (* main_~b~0 main_~a~0))) (let ((.cse1 (= (+ main_~z~0 (* main_~y~0 main_~x~0)) .cse4)) (.cse2 (<= main_~b~0 5)) (.cse3 (<= 1 main_~b~0)) (.cse0 (+ main_~y~0 1))) (or (and (<= 1 (mod .cse0 2)) .cse1 .cse2 .cse3 (<= 0 .cse0) (<= main_~y~0 1)) (and .cse1 (= main_~b~0 main_~y~0) (<= 1 main_~y~0) (= main_~a~0 main_~x~0) (<= main_~y~0 5)) (and (<= main_~y~0 2) (= (+ main_~z~0 (* 2 (* (div (* (- 1) main_~x~0) (- 2)) main_~y~0))) .cse4) .cse2 .cse3 (= (mod main_~x~0 2) 0) (< (div (* (- 1) (div (+ (* (- 1) (div (+ 2 (* (- 1) main_~b~0)) (- 2))) 1) (- 2))) (- 2)) .cse0))))) [2022-04-27 14:34:51,488 INFO L899 garLoopResultBuilder]: For program point L35-1(lines 34 45) no Hoare annotation was computed. [2022-04-27 14:34:51,488 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2022-04-27 14:34:51,488 INFO L895 garLoopResultBuilder]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|)) [2022-04-27 14:34:51,488 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2022-04-27 14:34:51,488 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-04-27 14:34:51,488 INFO L902 garLoopResultBuilder]: At program point L-1(line -1) the Hoare annotation is: true [2022-04-27 14:34:51,488 INFO L902 garLoopResultBuilder]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2022-04-27 14:34:51,488 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2022-04-27 14:34:51,488 INFO L902 garLoopResultBuilder]: At program point __VERIFIER_assertENTRY(lines 12 18) the Hoare annotation is: true [2022-04-27 14:34:51,488 INFO L899 garLoopResultBuilder]: For program point L14(lines 14 15) no Hoare annotation was computed. [2022-04-27 14:34:51,488 INFO L899 garLoopResultBuilder]: For program point L13(lines 13 16) no Hoare annotation was computed. [2022-04-27 14:34:51,488 INFO L899 garLoopResultBuilder]: For program point L13-2(lines 12 18) no Hoare annotation was computed. [2022-04-27 14:34:51,488 INFO L899 garLoopResultBuilder]: For program point __VERIFIER_assertEXIT(lines 12 18) no Hoare annotation was computed. [2022-04-27 14:34:51,488 INFO L899 garLoopResultBuilder]: For program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 15) no Hoare annotation was computed. [2022-04-27 14:34:51,490 INFO L356 BasicCegarLoop]: Path program histogram: [3, 1, 1, 1, 1, 1, 1] [2022-04-27 14:34:51,491 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-04-27 14:34:51,493 WARN L170 areAnnotationChecker]: reach_errorENTRY has no Hoare annotation [2022-04-27 14:34:51,493 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2022-04-27 14:34:51,494 WARN L170 areAnnotationChecker]: L10 has no Hoare annotation [2022-04-27 14:34:51,494 WARN L170 areAnnotationChecker]: L13 has no Hoare annotation [2022-04-27 14:34:51,494 WARN L170 areAnnotationChecker]: reach_errorFINAL has no Hoare annotation [2022-04-27 14:34:51,494 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2022-04-27 14:34:51,494 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2022-04-27 14:34:51,494 WARN L170 areAnnotationChecker]: L10 has no Hoare annotation [2022-04-27 14:34:51,494 WARN L170 areAnnotationChecker]: L10 has no Hoare annotation [2022-04-27 14:34:51,494 WARN L170 areAnnotationChecker]: L25-1 has no Hoare annotation [2022-04-27 14:34:51,494 WARN L170 areAnnotationChecker]: L13 has no Hoare annotation [2022-04-27 14:34:51,494 WARN L170 areAnnotationChecker]: L13 has no Hoare annotation [2022-04-27 14:34:51,494 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2022-04-27 14:34:51,494 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2022-04-27 14:34:51,494 WARN L170 areAnnotationChecker]: L10-2 has no Hoare annotation [2022-04-27 14:34:51,495 WARN L170 areAnnotationChecker]: L25-1 has no Hoare annotation [2022-04-27 14:34:51,495 WARN L170 areAnnotationChecker]: L14 has no Hoare annotation [2022-04-27 14:34:51,495 WARN L170 areAnnotationChecker]: L14 has no Hoare annotation [2022-04-27 14:34:51,495 WARN L170 areAnnotationChecker]: L13-2 has no Hoare annotation [2022-04-27 14:34:51,495 WARN L170 areAnnotationChecker]: assume_abort_if_notEXIT has no Hoare annotation [2022-04-27 14:34:51,495 WARN L170 areAnnotationChecker]: assume_abort_if_notEXIT has no Hoare annotation [2022-04-27 14:34:51,495 WARN L170 areAnnotationChecker]: assume_abort_if_notEXIT has no Hoare annotation [2022-04-27 14:34:51,495 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-27 14:34:51,495 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-27 14:34:51,495 WARN L170 areAnnotationChecker]: L28 has no Hoare annotation [2022-04-27 14:34:51,495 WARN L170 areAnnotationChecker]: L28 has no Hoare annotation [2022-04-27 14:34:51,495 WARN L170 areAnnotationChecker]: L35-1 has no Hoare annotation [2022-04-27 14:34:51,495 WARN L170 areAnnotationChecker]: L35-1 has no Hoare annotation [2022-04-27 14:34:51,495 WARN L170 areAnnotationChecker]: L46 has no Hoare annotation [2022-04-27 14:34:51,504 WARN L170 areAnnotationChecker]: L46 has no Hoare annotation [2022-04-27 14:34:51,504 WARN L170 areAnnotationChecker]: L39 has no Hoare annotation [2022-04-27 14:34:51,504 WARN L170 areAnnotationChecker]: L39 has no Hoare annotation [2022-04-27 14:34:51,504 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2022-04-27 14:34:51,504 WARN L170 areAnnotationChecker]: L35-1 has no Hoare annotation [2022-04-27 14:34:51,504 WARN L170 areAnnotationChecker]: L39-2 has no Hoare annotation [2022-04-27 14:34:51,504 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2022-04-27 14:34:51,504 INFO L163 areAnnotationChecker]: CFG has 11 edges. 11 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2022-04-27 14:34:51,512 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.04 02:34:51 BoogieIcfgContainer [2022-04-27 14:34:51,512 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-04-27 14:34:51,513 INFO L158 Benchmark]: Toolchain (without parser) took 424041.48ms. Allocated memory was 188.7MB in the beginning and 255.9MB in the end (delta: 67.1MB). Free memory was 137.4MB in the beginning and 193.5MB in the end (delta: -56.1MB). Peak memory consumption was 122.1MB. Max. memory is 8.0GB. [2022-04-27 14:34:51,513 INFO L158 Benchmark]: CDTParser took 0.10ms. Allocated memory is still 188.7MB. Free memory is still 154.1MB. There was no memory consumed. Max. memory is 8.0GB. [2022-04-27 14:34:51,513 INFO L158 Benchmark]: CACSL2BoogieTranslator took 241.76ms. Allocated memory is still 188.7MB. Free memory was 137.2MB in the beginning and 163.4MB in the end (delta: -26.2MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2022-04-27 14:34:51,513 INFO L158 Benchmark]: Boogie Preprocessor took 31.29ms. Allocated memory is still 188.7MB. Free memory was 163.4MB in the beginning and 161.8MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-04-27 14:34:51,513 INFO L158 Benchmark]: RCFGBuilder took 253.56ms. Allocated memory is still 188.7MB. Free memory was 161.8MB in the beginning and 150.3MB in the end (delta: 11.5MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2022-04-27 14:34:51,514 INFO L158 Benchmark]: TraceAbstraction took 423509.32ms. Allocated memory was 188.7MB in the beginning and 255.9MB in the end (delta: 67.1MB). Free memory was 149.7MB in the beginning and 193.5MB in the end (delta: -43.7MB). Peak memory consumption was 134.0MB. Max. memory is 8.0GB. [2022-04-27 14:34:51,515 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - AssertionsEnabledResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.10ms. Allocated memory is still 188.7MB. Free memory is still 154.1MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 241.76ms. Allocated memory is still 188.7MB. Free memory was 137.2MB in the beginning and 163.4MB in the end (delta: -26.2MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * Boogie Preprocessor took 31.29ms. Allocated memory is still 188.7MB. Free memory was 163.4MB in the beginning and 161.8MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 253.56ms. Allocated memory is still 188.7MB. Free memory was 161.8MB in the beginning and 150.3MB in the end (delta: 11.5MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * TraceAbstraction took 423509.32ms. Allocated memory was 188.7MB in the beginning and 255.9MB in the end (delta: 67.1MB). Free memory was 149.7MB in the beginning and 193.5MB in the end (delta: -43.7MB). Peak memory consumption was 134.0MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 15]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 6 procedures, 35 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 423.4s, OverallIterations: 9, TraceHistogramMax: 4, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 93.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 19.7s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 8 mSolverCounterUnknown, 228 SdHoareTripleChecker+Valid, 37.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 215 mSDsluCounter, 1097 SdHoareTripleChecker+Invalid, 37.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 40 IncrementalHoareTripleChecker+Unchecked, 878 mSDsCounter, 133 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1179 IncrementalHoareTripleChecker+Invalid, 1360 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 133 mSolverCounterUnsat, 219 mSDtfsCounter, 1179 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 616 GetRequests, 464 SyntacticMatches, 15 SemanticMatches, 137 ConstructedPredicates, 0 IntricatePredicates, 2 DeprecatedPredicates, 710 ImplicationChecksByTransitivity, 41.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=70occurred in iteration=7, InterpolantAutomatonStates: 94, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 9 MinimizatonAttempts, 26 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 12 LocationsWithAnnotation, 31 PreInvPairs, 52 NumberOfFragments, 249 HoareAnnotationTreeSize, 31 FomulaSimplifications, 131 FormulaSimplificationTreeSizeReduction, 0.1s HoareSimplificationTime, 12 FomulaSimplificationsInter, 1477 FormulaSimplificationTreeSizeReductionInter, 19.6s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 295.4s InterpolantComputationTime, 363 NumberOfCodeBlocks, 363 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 576 ConstructedInterpolants, 3 QuantifiedInterpolants, 2943 SizeOfPredicates, 30 NumberOfNonLiveVariables, 948 ConjunctsInSsa, 148 ConjunctsInUnsatCore, 14 InterpolantComputations, 3 PerfectInterpolantSequences, 310/381 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 34]: Loop Invariant Derived loop invariant: ((((((1 <= (y + 1) % 2 && z + y * x == b * a) && b <= 5) && 1 <= b) && 0 <= y + 1) && y <= 1) || ((((z + y * x == b * a && b == y) && 1 <= y) && a == x) && y <= 5)) || (((((y <= 2 && z + 2 * (-1 * x / -2 * y) == b * a) && b <= 5) && 1 <= b) && x % 2 == 0) && -1 * ((-1 * ((2 + -1 * b) / -2) + 1) / -2) / -2 < y + 1) RESULT: Ultimate proved your program to be correct! [2022-04-27 14:34:51,609 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request...