/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_valuebound50.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-34549b5 [2022-04-07 15:14:09,724 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-07 15:14:09,726 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-07 15:14:09,758 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-07 15:14:09,758 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-07 15:14:09,762 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-07 15:14:09,766 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-07 15:14:09,768 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-07 15:14:09,769 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-07 15:14:09,769 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-07 15:14:09,770 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-07 15:14:09,771 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-07 15:14:09,771 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-07 15:14:09,772 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-07 15:14:09,773 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-07 15:14:09,774 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-07 15:14:09,774 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-07 15:14:09,776 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-07 15:14:09,780 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-07 15:14:09,786 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-07 15:14:09,788 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-07 15:14:09,792 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-07 15:14:09,793 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-07 15:14:09,793 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-07 15:14:09,795 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-07 15:14:09,801 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-07 15:14:09,802 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-07 15:14:09,802 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-07 15:14:09,803 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-07 15:14:09,803 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-07 15:14:09,804 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-07 15:14:09,804 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-07 15:14:09,806 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-07 15:14:09,806 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-07 15:14:09,807 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-07 15:14:09,807 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-07 15:14:09,807 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-07 15:14:09,808 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-07 15:14:09,808 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-07 15:14:09,808 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-07 15:14:09,809 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-07 15:14:09,810 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-07 15:14:09,811 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2022-04-07 15:14:09,842 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-07 15:14:09,843 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-07 15:14:09,843 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-04-07 15:14:09,843 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-04-07 15:14:09,844 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-04-07 15:14:09,844 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-04-07 15:14:09,844 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-04-07 15:14:09,845 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-04-07 15:14:09,845 INFO L138 SettingsManager]: * Use SBE=true [2022-04-07 15:14:09,845 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-07 15:14:09,846 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-07 15:14:09,846 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-07 15:14:09,846 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-07 15:14:09,846 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-07 15:14:09,846 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-07 15:14:09,846 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-07 15:14:09,846 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-07 15:14:09,846 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-07 15:14:09,846 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-07 15:14:09,847 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-07 15:14:09,847 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-07 15:14:09,847 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-07 15:14:09,847 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-07 15:14:09,847 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-07 15:14:09,847 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-07 15:14:09,847 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-07 15:14:09,847 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-04-07 15:14:09,848 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-04-07 15:14:09,848 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-04-07 15:14:09,848 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-04-07 15:14:09,848 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-04-07 15:14:09,848 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-04-07 15:14:09,848 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-07 15:14:09,848 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.core: Log level for class -> de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN; [2022-04-07 15:14:10,083 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-07 15:14:10,107 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-07 15:14:10,109 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-07 15:14:10,109 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-07 15:14:10,110 INFO L275 PluginConnector]: CDTParser initialized [2022-04-07 15:14:10,111 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/nla-digbench-scaling/prodbin-ll_valuebound50.c [2022-04-07 15:14:10,165 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/987851942/d40599c3bf5044cb950712db909625e4/FLAGdbab52b02 [2022-04-07 15:14:10,582 INFO L306 CDTParser]: Found 1 translation units. [2022-04-07 15:14:10,583 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/prodbin-ll_valuebound50.c [2022-04-07 15:14:10,589 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/987851942/d40599c3bf5044cb950712db909625e4/FLAGdbab52b02 [2022-04-07 15:14:10,606 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/987851942/d40599c3bf5044cb950712db909625e4 [2022-04-07 15:14:10,608 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-07 15:14:10,609 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-07 15:14:10,612 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-07 15:14:10,612 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-07 15:14:10,615 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-07 15:14:10,616 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.04 03:14:10" (1/1) ... [2022-04-07 15:14:10,616 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@56ecd6b5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 03:14:10, skipping insertion in model container [2022-04-07 15:14:10,617 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.04 03:14:10" (1/1) ... [2022-04-07 15:14:10,626 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-07 15:14:10,639 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-07 15:14:10,809 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_valuebound50.c[537,550] [2022-04-07 15:14:10,821 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-07 15:14:10,828 INFO L203 MainTranslator]: Completed pre-run [2022-04-07 15:14:10,837 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_valuebound50.c[537,550] [2022-04-07 15:14:10,842 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-07 15:14:10,853 INFO L208 MainTranslator]: Completed translation [2022-04-07 15:14:10,854 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 03:14:10 WrapperNode [2022-04-07 15:14:10,854 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-07 15:14:10,855 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-07 15:14:10,855 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-07 15:14:10,855 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-07 15:14:10,863 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 03:14:10" (1/1) ... [2022-04-07 15:14:10,863 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 03:14:10" (1/1) ... [2022-04-07 15:14:10,868 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 03:14:10" (1/1) ... [2022-04-07 15:14:10,868 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 03:14:10" (1/1) ... [2022-04-07 15:14:10,873 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 03:14:10" (1/1) ... [2022-04-07 15:14:10,876 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 03:14:10" (1/1) ... [2022-04-07 15:14:10,877 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 03:14:10" (1/1) ... [2022-04-07 15:14:10,878 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-07 15:14:10,879 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-07 15:14:10,879 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-07 15:14:10,879 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-07 15:14:10,880 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 03:14:10" (1/1) ... [2022-04-07 15:14:10,885 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-07 15:14:10,895 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-07 15:14:10,908 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-04-07 15:14:10,935 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-04-07 15:14:10,955 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-07 15:14:10,955 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-07 15:14:10,955 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-07 15:14:10,956 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-07 15:14:10,957 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-07 15:14:10,958 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-07 15:14:10,958 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-07 15:14:10,958 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-07 15:14:10,958 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-07 15:14:10,958 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-07 15:14:10,958 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-04-07 15:14:10,958 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-07 15:14:10,958 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-07 15:14:10,959 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-07 15:14:10,959 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-07 15:14:10,959 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-07 15:14:10,959 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-07 15:14:10,959 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-07 15:14:10,959 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-07 15:14:10,959 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-07 15:14:11,016 INFO L234 CfgBuilder]: Building ICFG [2022-04-07 15:14:11,017 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-07 15:14:11,150 INFO L275 CfgBuilder]: Performing block encoding [2022-04-07 15:14:11,155 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-07 15:14:11,156 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-07 15:14:11,157 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.04 03:14:11 BoogieIcfgContainer [2022-04-07 15:14:11,157 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-07 15:14:11,158 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-07 15:14:11,159 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-07 15:14:11,161 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-07 15:14:11,161 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.04 03:14:10" (1/3) ... [2022-04-07 15:14:11,162 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@13b4ea0d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.04 03:14:11, skipping insertion in model container [2022-04-07 15:14:11,162 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 03:14:10" (2/3) ... [2022-04-07 15:14:11,162 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@13b4ea0d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.04 03:14:11, skipping insertion in model container [2022-04-07 15:14:11,162 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.04 03:14:11" (3/3) ... [2022-04-07 15:14:11,163 INFO L111 eAbstractionObserver]: Analyzing ICFG prodbin-ll_valuebound50.c [2022-04-07 15:14:11,166 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-04-07 15:14:11,166 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-07 15:14:11,219 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-07 15:14:11,229 INFO L340 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP [2022-04-07 15:14:11,229 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-07 15:14:11,269 INFO L276 IsEmpty]: Start isEmpty. Operand has 32 states, 19 states have (on average 1.368421052631579) internal successors, (26), 20 states have internal predecessors, (26), 7 states have call successors, (7), 4 states have call predecessors, (7), 4 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-07 15:14:11,272 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-04-07 15:14:11,272 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 15:14:11,273 INFO L499 BasicCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-07 15:14:11,273 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 15:14:11,277 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 15:14:11,277 INFO L85 PathProgramCache]: Analyzing trace with hash -589322634, now seen corresponding path program 1 times [2022-04-07 15:14:11,285 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 15:14:11,286 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1673575107] [2022-04-07 15:14:11,286 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 15:14:11,287 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 15:14:11,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 15:14:11,418 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-07 15:14:11,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 15:14:11,435 INFO L290 TraceCheckUtils]: 0: Hoare triple {52#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {35#true} is VALID [2022-04-07 15:14:11,435 INFO L290 TraceCheckUtils]: 1: Hoare triple {35#true} assume true; {35#true} is VALID [2022-04-07 15:14:11,436 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {35#true} {35#true} #71#return; {35#true} is VALID [2022-04-07 15:14:11,436 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-07 15:14:11,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 15:14:11,444 INFO L290 TraceCheckUtils]: 0: Hoare triple {35#true} ~cond := #in~cond; {35#true} is VALID [2022-04-07 15:14:11,445 INFO L290 TraceCheckUtils]: 1: Hoare triple {35#true} assume 0 == ~cond;assume false; {36#false} is VALID [2022-04-07 15:14:11,445 INFO L290 TraceCheckUtils]: 2: Hoare triple {36#false} assume true; {36#false} is VALID [2022-04-07 15:14:11,445 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {36#false} {35#true} #61#return; {36#false} is VALID [2022-04-07 15:14:11,445 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-04-07 15:14:11,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 15:14:11,453 INFO L290 TraceCheckUtils]: 0: Hoare triple {35#true} ~cond := #in~cond; {35#true} is VALID [2022-04-07 15:14:11,453 INFO L290 TraceCheckUtils]: 1: Hoare triple {35#true} assume 0 == ~cond;assume false; {36#false} is VALID [2022-04-07 15:14:11,454 INFO L290 TraceCheckUtils]: 2: Hoare triple {36#false} assume true; {36#false} is VALID [2022-04-07 15:14:11,454 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {36#false} {36#false} #63#return; {36#false} is VALID [2022-04-07 15:14:11,454 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-04-07 15:14:11,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 15:14:11,461 INFO L290 TraceCheckUtils]: 0: Hoare triple {35#true} ~cond := #in~cond; {35#true} is VALID [2022-04-07 15:14:11,462 INFO L290 TraceCheckUtils]: 1: Hoare triple {35#true} assume 0 == ~cond;assume false; {36#false} is VALID [2022-04-07 15:14:11,462 INFO L290 TraceCheckUtils]: 2: Hoare triple {36#false} assume true; {36#false} is VALID [2022-04-07 15:14:11,462 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {36#false} {36#false} #65#return; {36#false} is VALID [2022-04-07 15:14:11,463 INFO L272 TraceCheckUtils]: 0: Hoare triple {35#true} call ULTIMATE.init(); {52#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-07 15:14:11,464 INFO L290 TraceCheckUtils]: 1: Hoare triple {52#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {35#true} is VALID [2022-04-07 15:14:11,464 INFO L290 TraceCheckUtils]: 2: Hoare triple {35#true} assume true; {35#true} is VALID [2022-04-07 15:14:11,464 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {35#true} {35#true} #71#return; {35#true} is VALID [2022-04-07 15:14:11,464 INFO L272 TraceCheckUtils]: 4: Hoare triple {35#true} call #t~ret6 := main(); {35#true} is VALID [2022-04-07 15:14:11,464 INFO L290 TraceCheckUtils]: 5: Hoare triple {35#true} havoc ~a~0;havoc ~b~0;havoc ~x~0;havoc ~y~0;havoc ~z~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~a~0 := #t~nondet4;havoc #t~nondet4; {35#true} is VALID [2022-04-07 15:14:11,465 INFO L272 TraceCheckUtils]: 6: Hoare triple {35#true} call assume_abort_if_not((if ~a~0 >= 0 && ~a~0 <= 50 then 1 else 0)); {35#true} is VALID [2022-04-07 15:14:11,465 INFO L290 TraceCheckUtils]: 7: Hoare triple {35#true} ~cond := #in~cond; {35#true} is VALID [2022-04-07 15:14:11,466 INFO L290 TraceCheckUtils]: 8: Hoare triple {35#true} assume 0 == ~cond;assume false; {36#false} is VALID [2022-04-07 15:14:11,466 INFO L290 TraceCheckUtils]: 9: Hoare triple {36#false} assume true; {36#false} is VALID [2022-04-07 15:14:11,466 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {36#false} {35#true} #61#return; {36#false} is VALID [2022-04-07 15:14:11,466 INFO L290 TraceCheckUtils]: 11: Hoare triple {36#false} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~b~0 := #t~nondet5;havoc #t~nondet5; {36#false} is VALID [2022-04-07 15:14:11,466 INFO L272 TraceCheckUtils]: 12: Hoare triple {36#false} call assume_abort_if_not((if ~b~0 >= 0 && ~b~0 <= 50 then 1 else 0)); {35#true} is VALID [2022-04-07 15:14:11,467 INFO L290 TraceCheckUtils]: 13: Hoare triple {35#true} ~cond := #in~cond; {35#true} is VALID [2022-04-07 15:14:11,467 INFO L290 TraceCheckUtils]: 14: Hoare triple {35#true} assume 0 == ~cond;assume false; {36#false} is VALID [2022-04-07 15:14:11,467 INFO L290 TraceCheckUtils]: 15: Hoare triple {36#false} assume true; {36#false} is VALID [2022-04-07 15:14:11,468 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {36#false} {36#false} #63#return; {36#false} is VALID [2022-04-07 15:14:11,468 INFO L272 TraceCheckUtils]: 17: Hoare triple {36#false} call assume_abort_if_not((if ~b~0 >= 1 then 1 else 0)); {35#true} is VALID [2022-04-07 15:14:11,468 INFO L290 TraceCheckUtils]: 18: Hoare triple {35#true} ~cond := #in~cond; {35#true} is VALID [2022-04-07 15:14:11,469 INFO L290 TraceCheckUtils]: 19: Hoare triple {35#true} assume 0 == ~cond;assume false; {36#false} is VALID [2022-04-07 15:14:11,469 INFO L290 TraceCheckUtils]: 20: Hoare triple {36#false} assume true; {36#false} is VALID [2022-04-07 15:14:11,469 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {36#false} {36#false} #65#return; {36#false} is VALID [2022-04-07 15:14:11,469 INFO L290 TraceCheckUtils]: 22: Hoare triple {36#false} ~x~0 := ~a~0;~y~0 := ~b~0;~z~0 := 0; {36#false} is VALID [2022-04-07 15:14:11,470 INFO L290 TraceCheckUtils]: 23: Hoare triple {36#false} assume false; {36#false} is VALID [2022-04-07 15:14:11,470 INFO L272 TraceCheckUtils]: 24: Hoare triple {36#false} call __VERIFIER_assert((if ~z~0 == ~a~0 * ~b~0 then 1 else 0)); {36#false} is VALID [2022-04-07 15:14:11,470 INFO L290 TraceCheckUtils]: 25: Hoare triple {36#false} ~cond := #in~cond; {36#false} is VALID [2022-04-07 15:14:11,470 INFO L290 TraceCheckUtils]: 26: Hoare triple {36#false} assume 0 == ~cond; {36#false} is VALID [2022-04-07 15:14:11,471 INFO L290 TraceCheckUtils]: 27: Hoare triple {36#false} assume !false; {36#false} is VALID [2022-04-07 15:14:11,471 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-04-07 15:14:11,472 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 15:14:11,472 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1673575107] [2022-04-07 15:14:11,472 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1673575107] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-07 15:14:11,473 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-07 15:14:11,473 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-07 15:14:11,474 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1683320195] [2022-04-07 15:14:11,475 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-07 15:14:11,479 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 28 [2022-04-07 15:14:11,480 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 15:14:11,483 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-07 15:14:11,509 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 22 edges. 22 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 15:14:11,509 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-07 15:14:11,509 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 15:14:11,525 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-07 15:14:11,526 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-07 15:14:11,528 INFO L87 Difference]: Start difference. First operand has 32 states, 19 states have (on average 1.368421052631579) internal successors, (26), 20 states have internal predecessors, (26), 7 states have call successors, (7), 4 states have call predecessors, (7), 4 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Second operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-07 15:14:11,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 15:14:11,624 INFO L93 Difference]: Finished difference Result 57 states and 77 transitions. [2022-04-07 15:14:11,624 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-07 15:14:11,625 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 28 [2022-04-07 15:14:11,625 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 15:14:11,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-07 15:14:11,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 77 transitions. [2022-04-07 15:14:11,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-07 15:14:11,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 77 transitions. [2022-04-07 15:14:11,663 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 77 transitions. [2022-04-07 15:14:11,791 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 77 edges. 77 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 15:14:11,802 INFO L225 Difference]: With dead ends: 57 [2022-04-07 15:14:11,802 INFO L226 Difference]: Without dead ends: 27 [2022-04-07 15:14:11,804 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-07 15:14:11,814 INFO L913 BasicCegarLoop]: 31 mSDtfsCounter, 19 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 34 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-07 15:14:11,815 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [24 Valid, 34 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-07 15:14:11,829 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2022-04-07 15:14:11,849 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2022-04-07 15:14:11,849 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 15:14:11,850 INFO L82 GeneralOperation]: Start isEquivalent. First operand 27 states. Second operand has 27 states, 16 states have (on average 1.1875) internal successors, (19), 17 states have internal predecessors, (19), 7 states have call successors, (7), 4 states have call predecessors, (7), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-07 15:14:11,851 INFO L74 IsIncluded]: Start isIncluded. First operand 27 states. Second operand has 27 states, 16 states have (on average 1.1875) internal successors, (19), 17 states have internal predecessors, (19), 7 states have call successors, (7), 4 states have call predecessors, (7), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-07 15:14:11,852 INFO L87 Difference]: Start difference. First operand 27 states. Second operand has 27 states, 16 states have (on average 1.1875) internal successors, (19), 17 states have internal predecessors, (19), 7 states have call successors, (7), 4 states have call predecessors, (7), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-07 15:14:11,859 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 15:14:11,860 INFO L93 Difference]: Finished difference Result 27 states and 31 transitions. [2022-04-07 15:14:11,860 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 31 transitions. [2022-04-07 15:14:11,860 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 15:14:11,861 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 15:14:11,861 INFO L74 IsIncluded]: Start isIncluded. First operand has 27 states, 16 states have (on average 1.1875) internal successors, (19), 17 states have internal predecessors, (19), 7 states have call successors, (7), 4 states have call predecessors, (7), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand 27 states. [2022-04-07 15:14:11,861 INFO L87 Difference]: Start difference. First operand has 27 states, 16 states have (on average 1.1875) internal successors, (19), 17 states have internal predecessors, (19), 7 states have call successors, (7), 4 states have call predecessors, (7), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand 27 states. [2022-04-07 15:14:11,866 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 15:14:11,867 INFO L93 Difference]: Finished difference Result 27 states and 31 transitions. [2022-04-07 15:14:11,867 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 31 transitions. [2022-04-07 15:14:11,867 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 15:14:11,867 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 15:14:11,868 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 15:14:11,868 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 15:14:11,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 16 states have (on average 1.1875) internal successors, (19), 17 states have internal predecessors, (19), 7 states have call successors, (7), 4 states have call predecessors, (7), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-07 15:14:11,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 31 transitions. [2022-04-07 15:14:11,874 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 31 transitions. Word has length 28 [2022-04-07 15:14:11,874 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 15:14:11,875 INFO L478 AbstractCegarLoop]: Abstraction has 27 states and 31 transitions. [2022-04-07 15:14:11,875 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-07 15:14:11,875 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 31 transitions. [2022-04-07 15:14:11,877 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-04-07 15:14:11,877 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 15:14:11,877 INFO L499 BasicCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-07 15:14:11,877 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-07 15:14:11,878 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 15:14:11,879 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 15:14:11,880 INFO L85 PathProgramCache]: Analyzing trace with hash -1736242504, now seen corresponding path program 1 times [2022-04-07 15:14:11,880 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 15:14:11,880 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1842316800] [2022-04-07 15:14:11,880 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 15:14:11,880 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 15:14:11,920 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-07 15:14:11,921 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1425803300] [2022-04-07 15:14:11,921 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 15:14:11,921 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 15:14:11,921 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-07 15:14:11,927 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-07 15:14:11,949 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-04-07 15:14:11,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 15:14:11,989 INFO L263 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 11 conjunts are in the unsatisfiable core [2022-04-07 15:14:12,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 15:14:12,016 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-07 15:14:12,186 INFO L272 TraceCheckUtils]: 0: Hoare triple {224#true} call ULTIMATE.init(); {224#true} is VALID [2022-04-07 15:14:12,186 INFO L290 TraceCheckUtils]: 1: Hoare triple {224#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {224#true} is VALID [2022-04-07 15:14:12,186 INFO L290 TraceCheckUtils]: 2: Hoare triple {224#true} assume true; {224#true} is VALID [2022-04-07 15:14:12,187 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {224#true} {224#true} #71#return; {224#true} is VALID [2022-04-07 15:14:12,187 INFO L272 TraceCheckUtils]: 4: Hoare triple {224#true} call #t~ret6 := main(); {224#true} is VALID [2022-04-07 15:14:12,187 INFO L290 TraceCheckUtils]: 5: Hoare triple {224#true} havoc ~a~0;havoc ~b~0;havoc ~x~0;havoc ~y~0;havoc ~z~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~a~0 := #t~nondet4;havoc #t~nondet4; {224#true} is VALID [2022-04-07 15:14:12,187 INFO L272 TraceCheckUtils]: 6: Hoare triple {224#true} call assume_abort_if_not((if ~a~0 >= 0 && ~a~0 <= 50 then 1 else 0)); {224#true} is VALID [2022-04-07 15:14:12,187 INFO L290 TraceCheckUtils]: 7: Hoare triple {224#true} ~cond := #in~cond; {224#true} is VALID [2022-04-07 15:14:12,188 INFO L290 TraceCheckUtils]: 8: Hoare triple {224#true} assume !(0 == ~cond); {224#true} is VALID [2022-04-07 15:14:12,188 INFO L290 TraceCheckUtils]: 9: Hoare triple {224#true} assume true; {224#true} is VALID [2022-04-07 15:14:12,188 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {224#true} {224#true} #61#return; {224#true} is VALID [2022-04-07 15:14:12,188 INFO L290 TraceCheckUtils]: 11: Hoare triple {224#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~b~0 := #t~nondet5;havoc #t~nondet5; {224#true} is VALID [2022-04-07 15:14:12,188 INFO L272 TraceCheckUtils]: 12: Hoare triple {224#true} call assume_abort_if_not((if ~b~0 >= 0 && ~b~0 <= 50 then 1 else 0)); {224#true} is VALID [2022-04-07 15:14:12,188 INFO L290 TraceCheckUtils]: 13: Hoare triple {224#true} ~cond := #in~cond; {224#true} is VALID [2022-04-07 15:14:12,189 INFO L290 TraceCheckUtils]: 14: Hoare triple {224#true} assume !(0 == ~cond); {224#true} is VALID [2022-04-07 15:14:12,189 INFO L290 TraceCheckUtils]: 15: Hoare triple {224#true} assume true; {224#true} is VALID [2022-04-07 15:14:12,189 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {224#true} {224#true} #63#return; {224#true} is VALID [2022-04-07 15:14:12,189 INFO L272 TraceCheckUtils]: 17: Hoare triple {224#true} call assume_abort_if_not((if ~b~0 >= 1 then 1 else 0)); {224#true} is VALID [2022-04-07 15:14:12,189 INFO L290 TraceCheckUtils]: 18: Hoare triple {224#true} ~cond := #in~cond; {224#true} is VALID [2022-04-07 15:14:12,189 INFO L290 TraceCheckUtils]: 19: Hoare triple {224#true} assume !(0 == ~cond); {224#true} is VALID [2022-04-07 15:14:12,190 INFO L290 TraceCheckUtils]: 20: Hoare triple {224#true} assume true; {224#true} is VALID [2022-04-07 15:14:12,190 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {224#true} {224#true} #65#return; {224#true} is VALID [2022-04-07 15:14:12,190 INFO L290 TraceCheckUtils]: 22: Hoare triple {224#true} ~x~0 := ~a~0;~y~0 := ~b~0;~z~0 := 0; {295#(and (= main_~z~0 0) (= main_~b~0 main_~y~0) (= main_~a~0 main_~x~0))} is VALID [2022-04-07 15:14:12,191 INFO L290 TraceCheckUtils]: 23: Hoare triple {295#(and (= main_~z~0 0) (= main_~b~0 main_~y~0) (= main_~a~0 main_~x~0))} assume !false; {295#(and (= main_~z~0 0) (= main_~b~0 main_~y~0) (= main_~a~0 main_~x~0))} is VALID [2022-04-07 15:14:12,192 INFO L272 TraceCheckUtils]: 24: Hoare triple {295#(and (= main_~z~0 0) (= main_~b~0 main_~y~0) (= main_~a~0 main_~x~0))} call __VERIFIER_assert((if ~z~0 + ~x~0 * ~y~0 == ~a~0 * ~b~0 then 1 else 0)); {302#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-07 15:14:12,193 INFO L290 TraceCheckUtils]: 25: Hoare triple {302#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {306#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-07 15:14:12,193 INFO L290 TraceCheckUtils]: 26: Hoare triple {306#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {225#false} is VALID [2022-04-07 15:14:12,193 INFO L290 TraceCheckUtils]: 27: Hoare triple {225#false} assume !false; {225#false} is VALID [2022-04-07 15:14:12,194 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-04-07 15:14:12,194 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-07 15:14:12,194 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 15:14:12,194 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1842316800] [2022-04-07 15:14:12,194 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-07 15:14:12,194 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1425803300] [2022-04-07 15:14:12,195 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1425803300] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-07 15:14:12,195 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-07 15:14:12,195 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-07 15:14:12,196 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1582350044] [2022-04-07 15:14:12,196 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-07 15:14:12,196 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 28 [2022-04-07 15:14:12,197 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 15:14:12,197 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2022-04-07 15:14:12,215 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 22 edges. 22 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 15:14:12,216 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-07 15:14:12,216 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 15:14:12,216 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-07 15:14:12,216 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-07 15:14:12,217 INFO L87 Difference]: Start difference. First operand 27 states and 31 transitions. Second operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2022-04-07 15:14:12,357 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 15:14:12,357 INFO L93 Difference]: Finished difference Result 39 states and 45 transitions. [2022-04-07 15:14:12,357 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-07 15:14:12,358 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 28 [2022-04-07 15:14:12,358 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 15:14:12,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2022-04-07 15:14:12,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 45 transitions. [2022-04-07 15:14:12,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2022-04-07 15:14:12,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 45 transitions. [2022-04-07 15:14:12,362 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 45 transitions. [2022-04-07 15:14:12,398 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 45 edges. 45 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 15:14:12,400 INFO L225 Difference]: With dead ends: 39 [2022-04-07 15:14:12,400 INFO L226 Difference]: Without dead ends: 37 [2022-04-07 15:14:12,400 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-07 15:14:12,401 INFO L913 BasicCegarLoop]: 25 mSDtfsCounter, 8 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 87 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-07 15:14:12,402 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [9 Valid, 87 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-07 15:14:12,402 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2022-04-07 15:14:12,407 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 33. [2022-04-07 15:14:12,407 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 15:14:12,408 INFO L82 GeneralOperation]: Start isEquivalent. First operand 37 states. Second operand has 33 states, 20 states have (on average 1.15) internal successors, (23), 22 states have internal predecessors, (23), 8 states have call successors, (8), 5 states have call predecessors, (8), 4 states have return successors, (6), 5 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-07 15:14:12,408 INFO L74 IsIncluded]: Start isIncluded. First operand 37 states. Second operand has 33 states, 20 states have (on average 1.15) internal successors, (23), 22 states have internal predecessors, (23), 8 states have call successors, (8), 5 states have call predecessors, (8), 4 states have return successors, (6), 5 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-07 15:14:12,408 INFO L87 Difference]: Start difference. First operand 37 states. Second operand has 33 states, 20 states have (on average 1.15) internal successors, (23), 22 states have internal predecessors, (23), 8 states have call successors, (8), 5 states have call predecessors, (8), 4 states have return successors, (6), 5 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-07 15:14:12,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 15:14:12,411 INFO L93 Difference]: Finished difference Result 37 states and 43 transitions. [2022-04-07 15:14:12,411 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 43 transitions. [2022-04-07 15:14:12,411 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 15:14:12,411 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 15:14:12,412 INFO L74 IsIncluded]: Start isIncluded. First operand has 33 states, 20 states have (on average 1.15) internal successors, (23), 22 states have internal predecessors, (23), 8 states have call successors, (8), 5 states have call predecessors, (8), 4 states have return successors, (6), 5 states have call predecessors, (6), 6 states have call successors, (6) Second operand 37 states. [2022-04-07 15:14:12,412 INFO L87 Difference]: Start difference. First operand has 33 states, 20 states have (on average 1.15) internal successors, (23), 22 states have internal predecessors, (23), 8 states have call successors, (8), 5 states have call predecessors, (8), 4 states have return successors, (6), 5 states have call predecessors, (6), 6 states have call successors, (6) Second operand 37 states. [2022-04-07 15:14:12,414 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 15:14:12,414 INFO L93 Difference]: Finished difference Result 37 states and 43 transitions. [2022-04-07 15:14:12,415 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 43 transitions. [2022-04-07 15:14:12,415 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 15:14:12,415 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 15:14:12,415 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 15:14:12,415 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 15:14:12,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 20 states have (on average 1.15) internal successors, (23), 22 states have internal predecessors, (23), 8 states have call successors, (8), 5 states have call predecessors, (8), 4 states have return successors, (6), 5 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-07 15:14:12,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 37 transitions. [2022-04-07 15:14:12,418 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 37 transitions. Word has length 28 [2022-04-07 15:14:12,418 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 15:14:12,418 INFO L478 AbstractCegarLoop]: Abstraction has 33 states and 37 transitions. [2022-04-07 15:14:12,418 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2022-04-07 15:14:12,418 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 37 transitions. [2022-04-07 15:14:12,419 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-04-07 15:14:12,419 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 15:14:12,419 INFO L499 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-07 15:14:12,446 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-04-07 15:14:12,645 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 15:14:12,646 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 15:14:12,647 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 15:14:12,647 INFO L85 PathProgramCache]: Analyzing trace with hash 1911690432, now seen corresponding path program 1 times [2022-04-07 15:14:12,647 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 15:14:12,647 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [989848824] [2022-04-07 15:14:12,647 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 15:14:12,648 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 15:14:12,666 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-07 15:14:12,666 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [472381700] [2022-04-07 15:14:12,666 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 15:14:12,667 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 15:14:12,667 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-07 15:14:12,672 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-07 15:14:12,675 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-04-07 15:14:12,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 15:14:12,718 INFO L263 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-07 15:14:12,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 15:14:12,727 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-07 15:14:12,842 INFO L272 TraceCheckUtils]: 0: Hoare triple {491#true} call ULTIMATE.init(); {491#true} is VALID [2022-04-07 15:14:12,842 INFO L290 TraceCheckUtils]: 1: Hoare triple {491#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {491#true} is VALID [2022-04-07 15:14:12,842 INFO L290 TraceCheckUtils]: 2: Hoare triple {491#true} assume true; {491#true} is VALID [2022-04-07 15:14:12,843 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {491#true} {491#true} #71#return; {491#true} is VALID [2022-04-07 15:14:12,843 INFO L272 TraceCheckUtils]: 4: Hoare triple {491#true} call #t~ret6 := main(); {491#true} is VALID [2022-04-07 15:14:12,843 INFO L290 TraceCheckUtils]: 5: Hoare triple {491#true} havoc ~a~0;havoc ~b~0;havoc ~x~0;havoc ~y~0;havoc ~z~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~a~0 := #t~nondet4;havoc #t~nondet4; {491#true} is VALID [2022-04-07 15:14:12,843 INFO L272 TraceCheckUtils]: 6: Hoare triple {491#true} call assume_abort_if_not((if ~a~0 >= 0 && ~a~0 <= 50 then 1 else 0)); {491#true} is VALID [2022-04-07 15:14:12,843 INFO L290 TraceCheckUtils]: 7: Hoare triple {491#true} ~cond := #in~cond; {491#true} is VALID [2022-04-07 15:14:12,843 INFO L290 TraceCheckUtils]: 8: Hoare triple {491#true} assume !(0 == ~cond); {491#true} is VALID [2022-04-07 15:14:12,844 INFO L290 TraceCheckUtils]: 9: Hoare triple {491#true} assume true; {491#true} is VALID [2022-04-07 15:14:12,844 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {491#true} {491#true} #61#return; {491#true} is VALID [2022-04-07 15:14:12,844 INFO L290 TraceCheckUtils]: 11: Hoare triple {491#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~b~0 := #t~nondet5;havoc #t~nondet5; {491#true} is VALID [2022-04-07 15:14:12,844 INFO L272 TraceCheckUtils]: 12: Hoare triple {491#true} call assume_abort_if_not((if ~b~0 >= 0 && ~b~0 <= 50 then 1 else 0)); {491#true} is VALID [2022-04-07 15:14:12,844 INFO L290 TraceCheckUtils]: 13: Hoare triple {491#true} ~cond := #in~cond; {491#true} is VALID [2022-04-07 15:14:12,844 INFO L290 TraceCheckUtils]: 14: Hoare triple {491#true} assume !(0 == ~cond); {491#true} is VALID [2022-04-07 15:14:12,844 INFO L290 TraceCheckUtils]: 15: Hoare triple {491#true} assume true; {491#true} is VALID [2022-04-07 15:14:12,845 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {491#true} {491#true} #63#return; {491#true} is VALID [2022-04-07 15:14:12,845 INFO L272 TraceCheckUtils]: 17: Hoare triple {491#true} call assume_abort_if_not((if ~b~0 >= 1 then 1 else 0)); {491#true} is VALID [2022-04-07 15:14:12,845 INFO L290 TraceCheckUtils]: 18: Hoare triple {491#true} ~cond := #in~cond; {550#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-04-07 15:14:12,846 INFO L290 TraceCheckUtils]: 19: Hoare triple {550#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} assume !(0 == ~cond); {554#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-07 15:14:12,846 INFO L290 TraceCheckUtils]: 20: Hoare triple {554#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {554#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-07 15:14:12,847 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {554#(not (= |assume_abort_if_not_#in~cond| 0))} {491#true} #65#return; {561#(<= 1 main_~b~0)} is VALID [2022-04-07 15:14:12,847 INFO L290 TraceCheckUtils]: 22: Hoare triple {561#(<= 1 main_~b~0)} ~x~0 := ~a~0;~y~0 := ~b~0;~z~0 := 0; {565#(<= 1 main_~y~0)} is VALID [2022-04-07 15:14:12,848 INFO L290 TraceCheckUtils]: 23: Hoare triple {565#(<= 1 main_~y~0)} assume !false; {565#(<= 1 main_~y~0)} is VALID [2022-04-07 15:14:12,848 INFO L272 TraceCheckUtils]: 24: Hoare triple {565#(<= 1 main_~y~0)} call __VERIFIER_assert((if ~z~0 + ~x~0 * ~y~0 == ~a~0 * ~b~0 then 1 else 0)); {491#true} is VALID [2022-04-07 15:14:12,848 INFO L290 TraceCheckUtils]: 25: Hoare triple {491#true} ~cond := #in~cond; {491#true} is VALID [2022-04-07 15:14:12,848 INFO L290 TraceCheckUtils]: 26: Hoare triple {491#true} assume !(0 == ~cond); {491#true} is VALID [2022-04-07 15:14:12,848 INFO L290 TraceCheckUtils]: 27: Hoare triple {491#true} assume true; {491#true} is VALID [2022-04-07 15:14:12,849 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {491#true} {565#(<= 1 main_~y~0)} #67#return; {565#(<= 1 main_~y~0)} is VALID [2022-04-07 15:14:12,850 INFO L290 TraceCheckUtils]: 29: Hoare triple {565#(<= 1 main_~y~0)} assume !(0 != ~y~0); {492#false} is VALID [2022-04-07 15:14:12,850 INFO L272 TraceCheckUtils]: 30: Hoare triple {492#false} call __VERIFIER_assert((if ~z~0 == ~a~0 * ~b~0 then 1 else 0)); {492#false} is VALID [2022-04-07 15:14:12,850 INFO L290 TraceCheckUtils]: 31: Hoare triple {492#false} ~cond := #in~cond; {492#false} is VALID [2022-04-07 15:14:12,850 INFO L290 TraceCheckUtils]: 32: Hoare triple {492#false} assume 0 == ~cond; {492#false} is VALID [2022-04-07 15:14:12,850 INFO L290 TraceCheckUtils]: 33: Hoare triple {492#false} assume !false; {492#false} is VALID [2022-04-07 15:14:12,851 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-04-07 15:14:12,851 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-07 15:14:12,851 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 15:14:12,851 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [989848824] [2022-04-07 15:14:12,851 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-07 15:14:12,851 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [472381700] [2022-04-07 15:14:12,851 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [472381700] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-07 15:14:12,852 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-07 15:14:12,852 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-07 15:14:12,852 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [946363930] [2022-04-07 15:14:12,852 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-07 15:14:12,853 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 5 states have internal predecessors, (19), 3 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) Word has length 34 [2022-04-07 15:14:12,853 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 15:14:12,853 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 5 states have internal predecessors, (19), 3 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-07 15:14:12,876 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 31 edges. 31 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 15:14:12,876 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-07 15:14:12,876 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 15:14:12,877 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-07 15:14:12,877 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-04-07 15:14:12,877 INFO L87 Difference]: Start difference. First operand 33 states and 37 transitions. Second operand has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 5 states have internal predecessors, (19), 3 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-07 15:14:13,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 15:14:13,045 INFO L93 Difference]: Finished difference Result 43 states and 48 transitions. [2022-04-07 15:14:13,046 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-07 15:14:13,046 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 5 states have internal predecessors, (19), 3 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) Word has length 34 [2022-04-07 15:14:13,046 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 15:14:13,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 5 states have internal predecessors, (19), 3 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-07 15:14:13,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 45 transitions. [2022-04-07 15:14:13,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 5 states have internal predecessors, (19), 3 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-07 15:14:13,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 45 transitions. [2022-04-07 15:14:13,050 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 45 transitions. [2022-04-07 15:14:13,083 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 45 edges. 45 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 15:14:13,084 INFO L225 Difference]: With dead ends: 43 [2022-04-07 15:14:13,084 INFO L226 Difference]: Without dead ends: 36 [2022-04-07 15:14:13,085 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-04-07 15:14:13,086 INFO L913 BasicCegarLoop]: 24 mSDtfsCounter, 14 mSDsluCounter, 65 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 89 SdHoareTripleChecker+Invalid, 60 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-07 15:14:13,086 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [15 Valid, 89 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-07 15:14:13,087 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2022-04-07 15:14:13,095 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 34. [2022-04-07 15:14:13,096 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 15:14:13,096 INFO L82 GeneralOperation]: Start isEquivalent. First operand 36 states. Second operand has 34 states, 21 states have (on average 1.1428571428571428) internal successors, (24), 22 states have internal predecessors, (24), 8 states have call successors, (8), 5 states have call predecessors, (8), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-07 15:14:13,096 INFO L74 IsIncluded]: Start isIncluded. First operand 36 states. Second operand has 34 states, 21 states have (on average 1.1428571428571428) internal successors, (24), 22 states have internal predecessors, (24), 8 states have call successors, (8), 5 states have call predecessors, (8), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-07 15:14:13,097 INFO L87 Difference]: Start difference. First operand 36 states. Second operand has 34 states, 21 states have (on average 1.1428571428571428) internal successors, (24), 22 states have internal predecessors, (24), 8 states have call successors, (8), 5 states have call predecessors, (8), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-07 15:14:13,098 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 15:14:13,099 INFO L93 Difference]: Finished difference Result 36 states and 41 transitions. [2022-04-07 15:14:13,099 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 41 transitions. [2022-04-07 15:14:13,099 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 15:14:13,099 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 15:14:13,100 INFO L74 IsIncluded]: Start isIncluded. First operand has 34 states, 21 states have (on average 1.1428571428571428) internal successors, (24), 22 states have internal predecessors, (24), 8 states have call successors, (8), 5 states have call predecessors, (8), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand 36 states. [2022-04-07 15:14:13,100 INFO L87 Difference]: Start difference. First operand has 34 states, 21 states have (on average 1.1428571428571428) internal successors, (24), 22 states have internal predecessors, (24), 8 states have call successors, (8), 5 states have call predecessors, (8), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand 36 states. [2022-04-07 15:14:13,101 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 15:14:13,102 INFO L93 Difference]: Finished difference Result 36 states and 41 transitions. [2022-04-07 15:14:13,102 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 41 transitions. [2022-04-07 15:14:13,102 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 15:14:13,102 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 15:14:13,102 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 15:14:13,103 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 15:14:13,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 21 states have (on average 1.1428571428571428) internal successors, (24), 22 states have internal predecessors, (24), 8 states have call successors, (8), 5 states have call predecessors, (8), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-07 15:14:13,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 38 transitions. [2022-04-07 15:14:13,104 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 38 transitions. Word has length 34 [2022-04-07 15:14:13,104 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 15:14:13,105 INFO L478 AbstractCegarLoop]: Abstraction has 34 states and 38 transitions. [2022-04-07 15:14:13,105 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 5 states have internal predecessors, (19), 3 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-07 15:14:13,105 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 38 transitions. [2022-04-07 15:14:13,106 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-04-07 15:14:13,106 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 15:14:13,106 INFO L499 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-07 15:14:13,131 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-04-07 15:14:13,326 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2022-04-07 15:14:13,326 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 15:14:13,327 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 15:14:13,327 INFO L85 PathProgramCache]: Analyzing trace with hash 2022075506, now seen corresponding path program 1 times [2022-04-07 15:14:13,327 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 15:14:13,327 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [926431994] [2022-04-07 15:14:13,327 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 15:14:13,327 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 15:14:13,350 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-07 15:14:13,351 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1504139298] [2022-04-07 15:14:13,351 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 15:14:13,351 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 15:14:13,351 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-07 15:14:13,352 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-07 15:14:13,360 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-04-07 15:14:13,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 15:14:13,409 INFO L263 TraceCheckSpWp]: Trace formula consists of 111 conjuncts, 26 conjunts are in the unsatisfiable core [2022-04-07 15:14:13,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 15:14:13,423 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-07 15:14:14,713 INFO L272 TraceCheckUtils]: 0: Hoare triple {783#true} call ULTIMATE.init(); {783#true} is VALID [2022-04-07 15:14:14,714 INFO L290 TraceCheckUtils]: 1: Hoare triple {783#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {783#true} is VALID [2022-04-07 15:14:14,714 INFO L290 TraceCheckUtils]: 2: Hoare triple {783#true} assume true; {783#true} is VALID [2022-04-07 15:14:14,714 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {783#true} {783#true} #71#return; {783#true} is VALID [2022-04-07 15:14:14,714 INFO L272 TraceCheckUtils]: 4: Hoare triple {783#true} call #t~ret6 := main(); {783#true} is VALID [2022-04-07 15:14:14,714 INFO L290 TraceCheckUtils]: 5: Hoare triple {783#true} havoc ~a~0;havoc ~b~0;havoc ~x~0;havoc ~y~0;havoc ~z~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~a~0 := #t~nondet4;havoc #t~nondet4; {783#true} is VALID [2022-04-07 15:14:14,714 INFO L272 TraceCheckUtils]: 6: Hoare triple {783#true} call assume_abort_if_not((if ~a~0 >= 0 && ~a~0 <= 50 then 1 else 0)); {783#true} is VALID [2022-04-07 15:14:14,715 INFO L290 TraceCheckUtils]: 7: Hoare triple {783#true} ~cond := #in~cond; {783#true} is VALID [2022-04-07 15:14:14,715 INFO L290 TraceCheckUtils]: 8: Hoare triple {783#true} assume !(0 == ~cond); {783#true} is VALID [2022-04-07 15:14:14,715 INFO L290 TraceCheckUtils]: 9: Hoare triple {783#true} assume true; {783#true} is VALID [2022-04-07 15:14:14,715 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {783#true} {783#true} #61#return; {783#true} is VALID [2022-04-07 15:14:14,715 INFO L290 TraceCheckUtils]: 11: Hoare triple {783#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~b~0 := #t~nondet5;havoc #t~nondet5; {783#true} is VALID [2022-04-07 15:14:14,715 INFO L272 TraceCheckUtils]: 12: Hoare triple {783#true} call assume_abort_if_not((if ~b~0 >= 0 && ~b~0 <= 50 then 1 else 0)); {783#true} is VALID [2022-04-07 15:14:14,716 INFO L290 TraceCheckUtils]: 13: Hoare triple {783#true} ~cond := #in~cond; {783#true} is VALID [2022-04-07 15:14:14,716 INFO L290 TraceCheckUtils]: 14: Hoare triple {783#true} assume !(0 == ~cond); {783#true} is VALID [2022-04-07 15:14:14,716 INFO L290 TraceCheckUtils]: 15: Hoare triple {783#true} assume true; {783#true} is VALID [2022-04-07 15:14:14,716 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {783#true} {783#true} #63#return; {783#true} is VALID [2022-04-07 15:14:14,716 INFO L272 TraceCheckUtils]: 17: Hoare triple {783#true} call assume_abort_if_not((if ~b~0 >= 1 then 1 else 0)); {783#true} is VALID [2022-04-07 15:14:14,716 INFO L290 TraceCheckUtils]: 18: Hoare triple {783#true} ~cond := #in~cond; {783#true} is VALID [2022-04-07 15:14:14,717 INFO L290 TraceCheckUtils]: 19: Hoare triple {783#true} assume !(0 == ~cond); {783#true} is VALID [2022-04-07 15:14:14,717 INFO L290 TraceCheckUtils]: 20: Hoare triple {783#true} assume true; {783#true} is VALID [2022-04-07 15:14:14,717 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {783#true} {783#true} #65#return; {783#true} is VALID [2022-04-07 15:14:14,717 INFO L290 TraceCheckUtils]: 22: Hoare triple {783#true} ~x~0 := ~a~0;~y~0 := ~b~0;~z~0 := 0; {854#(and (= main_~b~0 main_~y~0) (= main_~a~0 main_~x~0))} is VALID [2022-04-07 15:14:14,718 INFO L290 TraceCheckUtils]: 23: Hoare triple {854#(and (= main_~b~0 main_~y~0) (= main_~a~0 main_~x~0))} assume !false; {854#(and (= main_~b~0 main_~y~0) (= main_~a~0 main_~x~0))} is VALID [2022-04-07 15:14:14,718 INFO L272 TraceCheckUtils]: 24: Hoare triple {854#(and (= main_~b~0 main_~y~0) (= main_~a~0 main_~x~0))} call __VERIFIER_assert((if ~z~0 + ~x~0 * ~y~0 == ~a~0 * ~b~0 then 1 else 0)); {783#true} is VALID [2022-04-07 15:14:14,719 INFO L290 TraceCheckUtils]: 25: Hoare triple {783#true} ~cond := #in~cond; {864#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-07 15:14:14,719 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-07 15:14:14,719 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-07 15:14:14,720 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {868#(not (= |__VERIFIER_assert_#in~cond| 0))} {854#(and (= main_~b~0 main_~y~0) (= main_~a~0 main_~x~0))} #67#return; {875#(and (= (+ main_~z~0 (* main_~y~0 main_~x~0)) (* main_~b~0 main_~a~0)) (= main_~b~0 main_~y~0) (= main_~a~0 main_~x~0))} is VALID [2022-04-07 15:14:14,721 INFO L290 TraceCheckUtils]: 29: Hoare triple {875#(and (= (+ main_~z~0 (* main_~y~0 main_~x~0)) (* main_~b~0 main_~a~0)) (= main_~b~0 main_~y~0) (= main_~a~0 main_~x~0))} assume !!(0 != ~y~0); {879#(and (not (= main_~y~0 0)) (= (+ main_~z~0 (* main_~y~0 main_~x~0)) (* main_~b~0 main_~a~0)) (= main_~b~0 main_~y~0) (= main_~a~0 main_~x~0))} is VALID [2022-04-07 15:14:14,723 INFO L290 TraceCheckUtils]: 30: Hoare triple {879#(and (not (= main_~y~0 0)) (= (+ main_~z~0 (* main_~y~0 main_~x~0)) (* main_~b~0 main_~a~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; {883#(and (<= 1 (mod (+ main_~y~0 1) 2)) (= main_~b~0 (+ main_~y~0 1)) (= (+ main_~z~0 (* main_~y~0 main_~x~0)) (* main_~b~0 main_~a~0)) (= main_~a~0 main_~x~0) (<= 0 (+ main_~y~0 1)))} is VALID [2022-04-07 15:14:14,725 INFO L290 TraceCheckUtils]: 31: Hoare triple {883#(and (<= 1 (mod (+ main_~y~0 1) 2)) (= main_~b~0 (+ main_~y~0 1)) (= (+ main_~z~0 (* main_~y~0 main_~x~0)) (* main_~b~0 main_~a~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); {887#(and (<= 1 (mod main_~b~0 2)) (= (* main_~a~0 2) main_~x~0) (= (* main_~b~0 main_~a~0) (+ main_~z~0 (* main_~a~0 (+ (- 1) main_~b~0)))) (<= 0 main_~b~0) (= (div (+ (- 1) main_~b~0) 2) main_~y~0))} is VALID [2022-04-07 15:14:14,726 INFO L290 TraceCheckUtils]: 32: Hoare triple {887#(and (<= 1 (mod main_~b~0 2)) (= (* main_~a~0 2) main_~x~0) (= (* main_~b~0 main_~a~0) (+ main_~z~0 (* main_~a~0 (+ (- 1) main_~b~0)))) (<= 0 main_~b~0) (= (div (+ (- 1) main_~b~0) 2) main_~y~0))} assume !false; {887#(and (<= 1 (mod main_~b~0 2)) (= (* main_~a~0 2) main_~x~0) (= (* main_~b~0 main_~a~0) (+ main_~z~0 (* main_~a~0 (+ (- 1) main_~b~0)))) (<= 0 main_~b~0) (= (div (+ (- 1) main_~b~0) 2) main_~y~0))} is VALID [2022-04-07 15:14:14,950 INFO L272 TraceCheckUtils]: 33: Hoare triple {887#(and (<= 1 (mod main_~b~0 2)) (= (* main_~a~0 2) main_~x~0) (= (* main_~b~0 main_~a~0) (+ main_~z~0 (* main_~a~0 (+ (- 1) main_~b~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)); {894#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-07 15:14:14,950 INFO L290 TraceCheckUtils]: 34: Hoare triple {894#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {898#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-07 15:14:14,951 INFO L290 TraceCheckUtils]: 35: Hoare triple {898#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {784#false} is VALID [2022-04-07 15:14:14,951 INFO L290 TraceCheckUtils]: 36: Hoare triple {784#false} assume !false; {784#false} is VALID [2022-04-07 15:14:14,951 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-07 15:14:14,951 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-07 15:15:08,906 INFO L290 TraceCheckUtils]: 36: Hoare triple {784#false} assume !false; {784#false} is VALID [2022-04-07 15:15:08,907 INFO L290 TraceCheckUtils]: 35: Hoare triple {898#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {784#false} is VALID [2022-04-07 15:15:08,907 INFO L290 TraceCheckUtils]: 34: Hoare triple {894#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {898#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-07 15:15:08,908 INFO L272 TraceCheckUtils]: 33: Hoare triple {914#(= (+ 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)); {894#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-07 15:15:08,909 INFO L290 TraceCheckUtils]: 32: Hoare triple {914#(= (+ main_~z~0 (* main_~y~0 main_~x~0)) (* main_~b~0 main_~a~0))} assume !false; {914#(= (+ main_~z~0 (* main_~y~0 main_~x~0)) (* main_~b~0 main_~a~0))} is VALID [2022-04-07 15:15:08,915 INFO L290 TraceCheckUtils]: 31: Hoare triple {921#(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); {914#(= (+ main_~z~0 (* main_~y~0 main_~x~0)) (* main_~b~0 main_~a~0))} is VALID [2022-04-07 15:15:08,919 INFO L290 TraceCheckUtils]: 30: Hoare triple {925#(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; {921#(and (or (not (< main_~y~0 0)) (= (mod main_~y~0 2) 0) (= (+ main_~z~0 (* (* main_~x~0 2) (+ (div main_~y~0 2) 1))) (* main_~b~0 main_~a~0))) (or (= (+ main_~z~0 (* (* main_~x~0 2) (div main_~y~0 2))) (* main_~b~0 main_~a~0)) (and (not (= (mod main_~y~0 2) 0)) (< main_~y~0 0))))} is VALID [2022-04-07 15:15:08,920 INFO L290 TraceCheckUtils]: 29: Hoare triple {925#(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); {925#(or (= (+ (* (* main_~x~0 2) (div (+ (- 1) main_~y~0) 2)) main_~z~0 main_~x~0) (* main_~b~0 main_~a~0)) (not (<= 1 (mod main_~y~0 2))) (< main_~y~0 0))} is VALID [2022-04-07 15:15:09,595 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {868#(not (= |__VERIFIER_assert_#in~cond| 0))} {783#true} #67#return; {925#(or (= (+ (* (* main_~x~0 2) (div (+ (- 1) main_~y~0) 2)) main_~z~0 main_~x~0) (* main_~b~0 main_~a~0)) (not (<= 1 (mod main_~y~0 2))) (< main_~y~0 0))} is VALID [2022-04-07 15:15:09,596 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-07 15:15:09,596 INFO L290 TraceCheckUtils]: 26: Hoare triple {941#(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-07 15:15:09,597 INFO L290 TraceCheckUtils]: 25: Hoare triple {783#true} ~cond := #in~cond; {941#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-07 15:15:09,597 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-07 15:15:09,597 INFO L290 TraceCheckUtils]: 23: Hoare triple {783#true} assume !false; {783#true} is VALID [2022-04-07 15:15:09,597 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-07 15:15:09,597 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {783#true} {783#true} #65#return; {783#true} is VALID [2022-04-07 15:15:09,597 INFO L290 TraceCheckUtils]: 20: Hoare triple {783#true} assume true; {783#true} is VALID [2022-04-07 15:15:09,598 INFO L290 TraceCheckUtils]: 19: Hoare triple {783#true} assume !(0 == ~cond); {783#true} is VALID [2022-04-07 15:15:09,598 INFO L290 TraceCheckUtils]: 18: Hoare triple {783#true} ~cond := #in~cond; {783#true} is VALID [2022-04-07 15:15:09,598 INFO L272 TraceCheckUtils]: 17: Hoare triple {783#true} call assume_abort_if_not((if ~b~0 >= 1 then 1 else 0)); {783#true} is VALID [2022-04-07 15:15:09,598 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {783#true} {783#true} #63#return; {783#true} is VALID [2022-04-07 15:15:09,598 INFO L290 TraceCheckUtils]: 15: Hoare triple {783#true} assume true; {783#true} is VALID [2022-04-07 15:15:09,598 INFO L290 TraceCheckUtils]: 14: Hoare triple {783#true} assume !(0 == ~cond); {783#true} is VALID [2022-04-07 15:15:09,598 INFO L290 TraceCheckUtils]: 13: Hoare triple {783#true} ~cond := #in~cond; {783#true} is VALID [2022-04-07 15:15:09,599 INFO L272 TraceCheckUtils]: 12: Hoare triple {783#true} call assume_abort_if_not((if ~b~0 >= 0 && ~b~0 <= 50 then 1 else 0)); {783#true} is VALID [2022-04-07 15:15:09,599 INFO L290 TraceCheckUtils]: 11: Hoare triple {783#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~b~0 := #t~nondet5;havoc #t~nondet5; {783#true} is VALID [2022-04-07 15:15:09,599 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {783#true} {783#true} #61#return; {783#true} is VALID [2022-04-07 15:15:09,599 INFO L290 TraceCheckUtils]: 9: Hoare triple {783#true} assume true; {783#true} is VALID [2022-04-07 15:15:09,599 INFO L290 TraceCheckUtils]: 8: Hoare triple {783#true} assume !(0 == ~cond); {783#true} is VALID [2022-04-07 15:15:09,599 INFO L290 TraceCheckUtils]: 7: Hoare triple {783#true} ~cond := #in~cond; {783#true} is VALID [2022-04-07 15:15:09,600 INFO L272 TraceCheckUtils]: 6: Hoare triple {783#true} call assume_abort_if_not((if ~a~0 >= 0 && ~a~0 <= 50 then 1 else 0)); {783#true} is VALID [2022-04-07 15:15:09,600 INFO L290 TraceCheckUtils]: 5: Hoare triple {783#true} havoc ~a~0;havoc ~b~0;havoc ~x~0;havoc ~y~0;havoc ~z~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~a~0 := #t~nondet4;havoc #t~nondet4; {783#true} is VALID [2022-04-07 15:15:09,600 INFO L272 TraceCheckUtils]: 4: Hoare triple {783#true} call #t~ret6 := main(); {783#true} is VALID [2022-04-07 15:15:09,600 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {783#true} {783#true} #71#return; {783#true} is VALID [2022-04-07 15:15:09,600 INFO L290 TraceCheckUtils]: 2: Hoare triple {783#true} assume true; {783#true} is VALID [2022-04-07 15:15:09,600 INFO L290 TraceCheckUtils]: 1: Hoare triple {783#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {783#true} is VALID [2022-04-07 15:15:09,601 INFO L272 TraceCheckUtils]: 0: Hoare triple {783#true} call ULTIMATE.init(); {783#true} is VALID [2022-04-07 15:15:09,601 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-07 15:15:09,601 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 15:15:09,601 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [926431994] [2022-04-07 15:15:09,601 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-07 15:15:09,601 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1504139298] [2022-04-07 15:15:09,602 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1504139298] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-07 15:15:09,602 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-07 15:15:09,602 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9] total 15 [2022-04-07 15:15:09,602 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1851348701] [2022-04-07 15:15:09,602 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-07 15:15:09,603 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 1.8) 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-07 15:15:09,603 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 15:15:09,603 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 15 states, 15 states have (on average 1.8) 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-07 15:15:11,034 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 42 edges. 42 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 15:15:11,034 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-04-07 15:15:11,034 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 15:15:11,034 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-04-07 15:15:11,035 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=166, Unknown=1, NotChecked=0, Total=210 [2022-04-07 15:15:11,035 INFO L87 Difference]: Start difference. First operand 34 states and 38 transitions. Second operand has 15 states, 15 states have (on average 1.8) 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-07 15:15:20,273 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.68s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-07 15:15:22,964 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-07 15:15:25,135 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.26s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-07 15:15:26,335 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.20s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-07 15:15:30,801 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.46s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-07 15:15:34,722 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.89s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-07 15:15:37,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 15:15:37,641 INFO L93 Difference]: Finished difference Result 52 states and 60 transitions. [2022-04-07 15:15:37,641 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-04-07 15:15:37,641 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 1.8) 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-07 15:15:37,642 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 15:15:37,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 15 states have (on average 1.8) 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-07 15:15:37,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 57 transitions. [2022-04-07 15:15:37,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 15 states have (on average 1.8) 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-07 15:15:37,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 57 transitions. [2022-04-07 15:15:37,646 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 13 states and 57 transitions. [2022-04-07 15:15:41,324 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 57 edges. 56 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-07 15:15:41,325 INFO L225 Difference]: With dead ends: 52 [2022-04-07 15:15:41,325 INFO L226 Difference]: Without dead ends: 50 [2022-04-07 15:15:41,326 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 59 SyntacticMatches, 2 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 7.7s TimeCoverageRelationStatistics Valid=75, Invalid=304, Unknown=1, NotChecked=0, Total=380 [2022-04-07 15:15:41,326 INFO L913 BasicCegarLoop]: 24 mSDtfsCounter, 34 mSDsluCounter, 116 mSDsCounter, 0 mSdLazyCounter, 165 mSolverCounterSat, 21 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 11.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 140 SdHoareTripleChecker+Invalid, 187 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 165 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 11.7s IncrementalHoareTripleChecker+Time [2022-04-07 15:15:41,327 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [35 Valid, 140 Invalid, 187 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 165 Invalid, 1 Unknown, 0 Unchecked, 11.7s Time] [2022-04-07 15:15:41,327 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2022-04-07 15:15:41,349 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 47. [2022-04-07 15:15:41,349 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 15:15:41,350 INFO L82 GeneralOperation]: Start isEquivalent. First operand 50 states. Second operand has 47 states, 31 states have (on average 1.1935483870967742) internal successors, (37), 33 states have internal predecessors, (37), 10 states have call successors, (10), 6 states have call predecessors, (10), 5 states have return successors, (8), 7 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-07 15:15:41,350 INFO L74 IsIncluded]: Start isIncluded. First operand 50 states. Second operand has 47 states, 31 states have (on average 1.1935483870967742) internal successors, (37), 33 states have internal predecessors, (37), 10 states have call successors, (10), 6 states have call predecessors, (10), 5 states have return successors, (8), 7 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-07 15:15:41,350 INFO L87 Difference]: Start difference. First operand 50 states. Second operand has 47 states, 31 states have (on average 1.1935483870967742) internal successors, (37), 33 states have internal predecessors, (37), 10 states have call successors, (10), 6 states have call predecessors, (10), 5 states have return successors, (8), 7 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-07 15:15:41,353 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 15:15:41,353 INFO L93 Difference]: Finished difference Result 50 states and 58 transitions. [2022-04-07 15:15:41,353 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 58 transitions. [2022-04-07 15:15:41,354 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 15:15:41,354 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 15:15:41,354 INFO L74 IsIncluded]: Start isIncluded. First operand has 47 states, 31 states have (on average 1.1935483870967742) internal successors, (37), 33 states have internal predecessors, (37), 10 states have call successors, (10), 6 states have call predecessors, (10), 5 states have return successors, (8), 7 states have call predecessors, (8), 8 states have call successors, (8) Second operand 50 states. [2022-04-07 15:15:41,354 INFO L87 Difference]: Start difference. First operand has 47 states, 31 states have (on average 1.1935483870967742) internal successors, (37), 33 states have internal predecessors, (37), 10 states have call successors, (10), 6 states have call predecessors, (10), 5 states have return successors, (8), 7 states have call predecessors, (8), 8 states have call successors, (8) Second operand 50 states. [2022-04-07 15:15:41,356 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 15:15:41,356 INFO L93 Difference]: Finished difference Result 50 states and 58 transitions. [2022-04-07 15:15:41,357 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 58 transitions. [2022-04-07 15:15:41,357 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 15:15:41,357 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 15:15:41,357 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 15:15:41,357 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 15:15:41,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 31 states have (on average 1.1935483870967742) internal successors, (37), 33 states have internal predecessors, (37), 10 states have call successors, (10), 6 states have call predecessors, (10), 5 states have return successors, (8), 7 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-07 15:15:41,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 55 transitions. [2022-04-07 15:15:41,359 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 55 transitions. Word has length 37 [2022-04-07 15:15:41,360 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 15:15:41,360 INFO L478 AbstractCegarLoop]: Abstraction has 47 states and 55 transitions. [2022-04-07 15:15:41,360 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 1.8) 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-07 15:15:41,360 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 55 transitions. [2022-04-07 15:15:41,361 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-04-07 15:15:41,361 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 15:15:41,361 INFO L499 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-07 15:15:41,392 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-04-07 15:15:41,561 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 15:15:41,562 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 15:15:41,562 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 15:15:41,562 INFO L85 PathProgramCache]: Analyzing trace with hash -497884428, now seen corresponding path program 1 times [2022-04-07 15:15:41,562 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 15:15:41,562 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [868599592] [2022-04-07 15:15:41,563 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 15:15:41,563 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 15:15:41,578 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-07 15:15:41,579 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1775790966] [2022-04-07 15:15:41,579 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 15:15:41,579 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 15:15:41,579 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-07 15:15:41,580 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-07 15:15:41,582 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-04-07 15:15:41,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 15:15:41,624 INFO L263 TraceCheckSpWp]: Trace formula consists of 106 conjuncts, 28 conjunts are in the unsatisfiable core [2022-04-07 15:15:41,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 15:15:41,636 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-07 15:15:42,940 INFO L272 TraceCheckUtils]: 0: Hoare triple {1270#true} call ULTIMATE.init(); {1270#true} is VALID [2022-04-07 15:15:42,941 INFO L290 TraceCheckUtils]: 1: Hoare triple {1270#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); {1270#true} is VALID [2022-04-07 15:15:42,941 INFO L290 TraceCheckUtils]: 2: Hoare triple {1270#true} assume true; {1270#true} is VALID [2022-04-07 15:15:42,941 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1270#true} {1270#true} #71#return; {1270#true} is VALID [2022-04-07 15:15:42,941 INFO L272 TraceCheckUtils]: 4: Hoare triple {1270#true} call #t~ret6 := main(); {1270#true} is VALID [2022-04-07 15:15:42,941 INFO L290 TraceCheckUtils]: 5: Hoare triple {1270#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; {1270#true} is VALID [2022-04-07 15:15:42,941 INFO L272 TraceCheckUtils]: 6: Hoare triple {1270#true} call assume_abort_if_not((if ~a~0 >= 0 && ~a~0 <= 50 then 1 else 0)); {1270#true} is VALID [2022-04-07 15:15:42,941 INFO L290 TraceCheckUtils]: 7: Hoare triple {1270#true} ~cond := #in~cond; {1270#true} is VALID [2022-04-07 15:15:42,941 INFO L290 TraceCheckUtils]: 8: Hoare triple {1270#true} assume !(0 == ~cond); {1270#true} is VALID [2022-04-07 15:15:42,942 INFO L290 TraceCheckUtils]: 9: Hoare triple {1270#true} assume true; {1270#true} is VALID [2022-04-07 15:15:42,942 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1270#true} {1270#true} #61#return; {1270#true} is VALID [2022-04-07 15:15:42,942 INFO L290 TraceCheckUtils]: 11: Hoare triple {1270#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~b~0 := #t~nondet5;havoc #t~nondet5; {1270#true} is VALID [2022-04-07 15:15:42,942 INFO L272 TraceCheckUtils]: 12: Hoare triple {1270#true} call assume_abort_if_not((if ~b~0 >= 0 && ~b~0 <= 50 then 1 else 0)); {1270#true} is VALID [2022-04-07 15:15:42,942 INFO L290 TraceCheckUtils]: 13: Hoare triple {1270#true} ~cond := #in~cond; {1270#true} is VALID [2022-04-07 15:15:42,942 INFO L290 TraceCheckUtils]: 14: Hoare triple {1270#true} assume !(0 == ~cond); {1270#true} is VALID [2022-04-07 15:15:42,942 INFO L290 TraceCheckUtils]: 15: Hoare triple {1270#true} assume true; {1270#true} is VALID [2022-04-07 15:15:42,943 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {1270#true} {1270#true} #63#return; {1270#true} is VALID [2022-04-07 15:15:42,943 INFO L272 TraceCheckUtils]: 17: Hoare triple {1270#true} call assume_abort_if_not((if ~b~0 >= 1 then 1 else 0)); {1270#true} is VALID [2022-04-07 15:15:42,943 INFO L290 TraceCheckUtils]: 18: Hoare triple {1270#true} ~cond := #in~cond; {1329#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-04-07 15:15:42,944 INFO L290 TraceCheckUtils]: 19: Hoare triple {1329#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} assume !(0 == ~cond); {1333#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-07 15:15:42,944 INFO L290 TraceCheckUtils]: 20: Hoare triple {1333#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {1333#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-07 15:15:42,945 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {1333#(not (= |assume_abort_if_not_#in~cond| 0))} {1270#true} #65#return; {1340#(<= 1 main_~b~0)} is VALID [2022-04-07 15:15:42,945 INFO L290 TraceCheckUtils]: 22: Hoare triple {1340#(<= 1 main_~b~0)} ~x~0 := ~a~0;~y~0 := ~b~0;~z~0 := 0; {1344#(and (= main_~z~0 0) (= main_~b~0 main_~y~0) (<= 1 main_~b~0) (= main_~a~0 main_~x~0))} is VALID [2022-04-07 15:15:42,946 INFO L290 TraceCheckUtils]: 23: Hoare triple {1344#(and (= main_~z~0 0) (= main_~b~0 main_~y~0) (<= 1 main_~b~0) (= main_~a~0 main_~x~0))} assume !false; {1344#(and (= main_~z~0 0) (= main_~b~0 main_~y~0) (<= 1 main_~b~0) (= main_~a~0 main_~x~0))} is VALID [2022-04-07 15:15:42,946 INFO L272 TraceCheckUtils]: 24: Hoare triple {1344#(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)); {1270#true} is VALID [2022-04-07 15:15:42,946 INFO L290 TraceCheckUtils]: 25: Hoare triple {1270#true} ~cond := #in~cond; {1354#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-07 15:15:42,947 INFO L290 TraceCheckUtils]: 26: Hoare triple {1354#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {1358#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-07 15:15:42,947 INFO L290 TraceCheckUtils]: 27: Hoare triple {1358#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {1358#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-07 15:15:42,948 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {1358#(not (= |__VERIFIER_assert_#in~cond| 0))} {1344#(and (= main_~z~0 0) (= main_~b~0 main_~y~0) (<= 1 main_~b~0) (= main_~a~0 main_~x~0))} #67#return; {1344#(and (= main_~z~0 0) (= main_~b~0 main_~y~0) (<= 1 main_~b~0) (= main_~a~0 main_~x~0))} is VALID [2022-04-07 15:15:42,948 INFO L290 TraceCheckUtils]: 29: Hoare triple {1344#(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); {1344#(and (= main_~z~0 0) (= main_~b~0 main_~y~0) (<= 1 main_~b~0) (= main_~a~0 main_~x~0))} is VALID [2022-04-07 15:15:42,949 INFO L290 TraceCheckUtils]: 30: Hoare triple {1344#(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)); {1371#(and (= main_~z~0 0) (not (= (mod main_~y~0 2) 1)) (= main_~b~0 main_~y~0) (<= 1 main_~b~0) (= main_~a~0 main_~x~0))} is VALID [2022-04-07 15:15:42,950 INFO L290 TraceCheckUtils]: 31: Hoare triple {1371#(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); {1375#(and (= main_~z~0 0) (= main_~y~0 (div main_~b~0 2)) (= (* main_~a~0 2) main_~x~0) (not (= (mod main_~b~0 2) 1)) (<= 1 main_~b~0))} is VALID [2022-04-07 15:15:42,951 INFO L290 TraceCheckUtils]: 32: Hoare triple {1375#(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; {1375#(and (= main_~z~0 0) (= main_~y~0 (div main_~b~0 2)) (= (* main_~a~0 2) main_~x~0) (not (= (mod main_~b~0 2) 1)) (<= 1 main_~b~0))} is VALID [2022-04-07 15:15:42,953 INFO L272 TraceCheckUtils]: 33: Hoare triple {1375#(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)); {1382#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-07 15:15:42,953 INFO L290 TraceCheckUtils]: 34: Hoare triple {1382#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1386#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-07 15:15:42,954 INFO L290 TraceCheckUtils]: 35: Hoare triple {1386#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1271#false} is VALID [2022-04-07 15:15:42,954 INFO L290 TraceCheckUtils]: 36: Hoare triple {1271#false} assume !false; {1271#false} is VALID [2022-04-07 15:15:42,954 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 7 proven. 3 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-04-07 15:15:42,954 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-07 15:16:24,584 INFO L290 TraceCheckUtils]: 36: Hoare triple {1271#false} assume !false; {1271#false} is VALID [2022-04-07 15:16:24,584 INFO L290 TraceCheckUtils]: 35: Hoare triple {1386#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1271#false} is VALID [2022-04-07 15:16:24,585 INFO L290 TraceCheckUtils]: 34: Hoare triple {1382#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1386#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-07 15:16:24,585 INFO L272 TraceCheckUtils]: 33: Hoare triple {1402#(= (+ 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)); {1382#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-07 15:16:24,586 INFO L290 TraceCheckUtils]: 32: Hoare triple {1402#(= (+ main_~z~0 (* main_~y~0 main_~x~0)) (* main_~b~0 main_~a~0))} assume !false; {1402#(= (+ main_~z~0 (* main_~y~0 main_~x~0)) (* main_~b~0 main_~a~0))} is VALID [2022-04-07 15:16:24,590 INFO L290 TraceCheckUtils]: 31: Hoare triple {1409#(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); {1402#(= (+ main_~z~0 (* main_~y~0 main_~x~0)) (* main_~b~0 main_~a~0))} is VALID [2022-04-07 15:16:24,591 INFO L290 TraceCheckUtils]: 30: Hoare triple {1413#(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)); {1409#(and (or (not (< main_~y~0 0)) (= (mod main_~y~0 2) 0) (= (+ main_~z~0 (* (* main_~x~0 2) (+ (div main_~y~0 2) 1))) (* main_~b~0 main_~a~0))) (or (= (+ main_~z~0 (* (* main_~x~0 2) (div main_~y~0 2))) (* main_~b~0 main_~a~0)) (and (not (= (mod main_~y~0 2) 0)) (< main_~y~0 0))))} is VALID [2022-04-07 15:16:24,592 INFO L290 TraceCheckUtils]: 29: Hoare triple {1413#(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); {1413#(or (and (<= 0 main_~y~0) (= (mod main_~y~0 2) 1)) (and (or (= (mod main_~y~0 2) 0) (= (+ main_~z~0 (* (* main_~x~0 2) (+ (div main_~y~0 2) 1))) (* main_~b~0 main_~a~0))) (or (= (+ main_~z~0 (* (* main_~x~0 2) (div main_~y~0 2))) (* main_~b~0 main_~a~0)) (not (= (mod main_~y~0 2) 0)))))} is VALID [2022-04-07 15:16:24,594 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {1358#(not (= |__VERIFIER_assert_#in~cond| 0))} {1420#(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; {1413#(or (and (<= 0 main_~y~0) (= (mod main_~y~0 2) 1)) (and (or (= (mod main_~y~0 2) 0) (= (+ main_~z~0 (* (* main_~x~0 2) (+ (div main_~y~0 2) 1))) (* main_~b~0 main_~a~0))) (or (= (+ main_~z~0 (* (* main_~x~0 2) (div main_~y~0 2))) (* main_~b~0 main_~a~0)) (not (= (mod main_~y~0 2) 0)))))} is VALID [2022-04-07 15:16:24,594 INFO L290 TraceCheckUtils]: 27: Hoare triple {1358#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {1358#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-07 15:16:24,595 INFO L290 TraceCheckUtils]: 26: Hoare triple {1430#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} assume !(0 == ~cond); {1358#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-07 15:16:24,595 INFO L290 TraceCheckUtils]: 25: Hoare triple {1270#true} ~cond := #in~cond; {1430#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-07 15:16:24,595 INFO L272 TraceCheckUtils]: 24: Hoare triple {1420#(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)); {1270#true} is VALID [2022-04-07 15:16:24,595 INFO L290 TraceCheckUtils]: 23: Hoare triple {1420#(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; {1420#(or (<= 0 main_~y~0) (not (= (+ main_~z~0 (* main_~y~0 main_~x~0)) (* main_~b~0 main_~a~0))) (= (mod main_~y~0 2) 0) (= (+ main_~z~0 (* (* main_~x~0 2) (+ (div main_~y~0 2) 1))) (* main_~b~0 main_~a~0)))} is VALID [2022-04-07 15:16:24,596 INFO L290 TraceCheckUtils]: 22: Hoare triple {1440#(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; {1420#(or (<= 0 main_~y~0) (not (= (+ main_~z~0 (* main_~y~0 main_~x~0)) (* main_~b~0 main_~a~0))) (= (mod main_~y~0 2) 0) (= (+ main_~z~0 (* (* main_~x~0 2) (+ (div main_~y~0 2) 1))) (* main_~b~0 main_~a~0)))} is VALID [2022-04-07 15:16:24,597 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {1333#(not (= |assume_abort_if_not_#in~cond| 0))} {1270#true} #65#return; {1440#(or (= (* main_~b~0 main_~a~0) (* (* main_~a~0 2) (+ (div main_~b~0 2) 1))) (= (mod main_~b~0 2) 0) (<= 0 main_~b~0))} is VALID [2022-04-07 15:16:24,597 INFO L290 TraceCheckUtils]: 20: Hoare triple {1333#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {1333#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-07 15:16:24,597 INFO L290 TraceCheckUtils]: 19: Hoare triple {1453#(or (not (= |assume_abort_if_not_#in~cond| 0)) (= assume_abort_if_not_~cond 0))} assume !(0 == ~cond); {1333#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-07 15:16:24,598 INFO L290 TraceCheckUtils]: 18: Hoare triple {1270#true} ~cond := #in~cond; {1453#(or (not (= |assume_abort_if_not_#in~cond| 0)) (= assume_abort_if_not_~cond 0))} is VALID [2022-04-07 15:16:24,598 INFO L272 TraceCheckUtils]: 17: Hoare triple {1270#true} call assume_abort_if_not((if ~b~0 >= 1 then 1 else 0)); {1270#true} is VALID [2022-04-07 15:16:24,598 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {1270#true} {1270#true} #63#return; {1270#true} is VALID [2022-04-07 15:16:24,598 INFO L290 TraceCheckUtils]: 15: Hoare triple {1270#true} assume true; {1270#true} is VALID [2022-04-07 15:16:24,598 INFO L290 TraceCheckUtils]: 14: Hoare triple {1270#true} assume !(0 == ~cond); {1270#true} is VALID [2022-04-07 15:16:24,598 INFO L290 TraceCheckUtils]: 13: Hoare triple {1270#true} ~cond := #in~cond; {1270#true} is VALID [2022-04-07 15:16:24,599 INFO L272 TraceCheckUtils]: 12: Hoare triple {1270#true} call assume_abort_if_not((if ~b~0 >= 0 && ~b~0 <= 50 then 1 else 0)); {1270#true} is VALID [2022-04-07 15:16:24,599 INFO L290 TraceCheckUtils]: 11: Hoare triple {1270#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~b~0 := #t~nondet5;havoc #t~nondet5; {1270#true} is VALID [2022-04-07 15:16:24,599 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1270#true} {1270#true} #61#return; {1270#true} is VALID [2022-04-07 15:16:24,599 INFO L290 TraceCheckUtils]: 9: Hoare triple {1270#true} assume true; {1270#true} is VALID [2022-04-07 15:16:24,599 INFO L290 TraceCheckUtils]: 8: Hoare triple {1270#true} assume !(0 == ~cond); {1270#true} is VALID [2022-04-07 15:16:24,599 INFO L290 TraceCheckUtils]: 7: Hoare triple {1270#true} ~cond := #in~cond; {1270#true} is VALID [2022-04-07 15:16:24,599 INFO L272 TraceCheckUtils]: 6: Hoare triple {1270#true} call assume_abort_if_not((if ~a~0 >= 0 && ~a~0 <= 50 then 1 else 0)); {1270#true} is VALID [2022-04-07 15:16:24,600 INFO L290 TraceCheckUtils]: 5: Hoare triple {1270#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; {1270#true} is VALID [2022-04-07 15:16:24,600 INFO L272 TraceCheckUtils]: 4: Hoare triple {1270#true} call #t~ret6 := main(); {1270#true} is VALID [2022-04-07 15:16:24,600 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1270#true} {1270#true} #71#return; {1270#true} is VALID [2022-04-07 15:16:24,600 INFO L290 TraceCheckUtils]: 2: Hoare triple {1270#true} assume true; {1270#true} is VALID [2022-04-07 15:16:24,600 INFO L290 TraceCheckUtils]: 1: Hoare triple {1270#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); {1270#true} is VALID [2022-04-07 15:16:24,600 INFO L272 TraceCheckUtils]: 0: Hoare triple {1270#true} call ULTIMATE.init(); {1270#true} is VALID [2022-04-07 15:16:24,601 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 7 proven. 3 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-04-07 15:16:24,601 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 15:16:24,601 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [868599592] [2022-04-07 15:16:24,601 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-07 15:16:24,601 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1775790966] [2022-04-07 15:16:24,601 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1775790966] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-07 15:16:24,601 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-07 15:16:24,601 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 13] total 19 [2022-04-07 15:16:24,601 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [226335444] [2022-04-07 15:16:24,601 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-07 15:16:24,602 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 1.6842105263157894) internal successors, (32), 16 states have internal predecessors, (32), 5 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (7), 5 states have call predecessors, (7), 3 states have call successors, (7) Word has length 37 [2022-04-07 15:16:24,603 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 15:16:24,603 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 19 states, 19 states have (on average 1.6842105263157894) internal successors, (32), 16 states have internal predecessors, (32), 5 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (7), 5 states have call predecessors, (7), 3 states have call successors, (7) [2022-04-07 15:16:24,654 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 48 edges. 48 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 15:16:24,655 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-04-07 15:16:24,655 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 15:16:24,655 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-04-07 15:16:24,655 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=280, Unknown=0, NotChecked=0, Total=342 [2022-04-07 15:16:24,655 INFO L87 Difference]: Start difference. First operand 47 states and 55 transitions. Second operand has 19 states, 19 states have (on average 1.6842105263157894) internal successors, (32), 16 states have internal predecessors, (32), 5 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (7), 5 states have call predecessors, (7), 3 states have call successors, (7) [2022-04-07 15:16:26,946 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 15:16:26,946 INFO L93 Difference]: Finished difference Result 78 states and 92 transitions. [2022-04-07 15:16:26,946 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-04-07 15:16:26,946 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 1.6842105263157894) internal successors, (32), 16 states have internal predecessors, (32), 5 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (7), 5 states have call predecessors, (7), 3 states have call successors, (7) Word has length 37 [2022-04-07 15:16:26,947 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 15:16:26,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 19 states have (on average 1.6842105263157894) internal successors, (32), 16 states have internal predecessors, (32), 5 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (7), 5 states have call predecessors, (7), 3 states have call successors, (7) [2022-04-07 15:16:26,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 67 transitions. [2022-04-07 15:16:26,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 19 states have (on average 1.6842105263157894) internal successors, (32), 16 states have internal predecessors, (32), 5 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (7), 5 states have call predecessors, (7), 3 states have call successors, (7) [2022-04-07 15:16:26,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 67 transitions. [2022-04-07 15:16:26,952 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 17 states and 67 transitions. [2022-04-07 15:16:27,039 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 67 edges. 67 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 15:16:27,043 INFO L225 Difference]: With dead ends: 78 [2022-04-07 15:16:27,043 INFO L226 Difference]: Without dead ends: 71 [2022-04-07 15:16:27,043 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 54 SyntacticMatches, 2 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 102 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=122, Invalid=528, Unknown=0, NotChecked=0, Total=650 [2022-04-07 15:16:27,045 INFO L913 BasicCegarLoop]: 19 mSDtfsCounter, 38 mSDsluCounter, 142 mSDsCounter, 0 mSdLazyCounter, 332 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 161 SdHoareTripleChecker+Invalid, 361 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 332 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-04-07 15:16:27,045 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [40 Valid, 161 Invalid, 361 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 332 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2022-04-07 15:16:27,047 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2022-04-07 15:16:27,078 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2022-04-07 15:16:27,078 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 15:16:27,078 INFO L82 GeneralOperation]: Start isEquivalent. First operand 71 states. Second operand has 71 states, 49 states have (on average 1.183673469387755) internal successors, (58), 53 states have internal predecessors, (58), 14 states have call successors, (14), 8 states have call predecessors, (14), 7 states have return successors, (12), 9 states have call predecessors, (12), 12 states have call successors, (12) [2022-04-07 15:16:27,079 INFO L74 IsIncluded]: Start isIncluded. First operand 71 states. Second operand has 71 states, 49 states have (on average 1.183673469387755) internal successors, (58), 53 states have internal predecessors, (58), 14 states have call successors, (14), 8 states have call predecessors, (14), 7 states have return successors, (12), 9 states have call predecessors, (12), 12 states have call successors, (12) [2022-04-07 15:16:27,079 INFO L87 Difference]: Start difference. First operand 71 states. Second operand has 71 states, 49 states have (on average 1.183673469387755) internal successors, (58), 53 states have internal predecessors, (58), 14 states have call successors, (14), 8 states have call predecessors, (14), 7 states have return successors, (12), 9 states have call predecessors, (12), 12 states have call successors, (12) [2022-04-07 15:16:27,082 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 15:16:27,082 INFO L93 Difference]: Finished difference Result 71 states and 84 transitions. [2022-04-07 15:16:27,082 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 84 transitions. [2022-04-07 15:16:27,083 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 15:16:27,083 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 15:16:27,083 INFO L74 IsIncluded]: Start isIncluded. First operand has 71 states, 49 states have (on average 1.183673469387755) internal successors, (58), 53 states have internal predecessors, (58), 14 states have call successors, (14), 8 states have call predecessors, (14), 7 states have return successors, (12), 9 states have call predecessors, (12), 12 states have call successors, (12) Second operand 71 states. [2022-04-07 15:16:27,084 INFO L87 Difference]: Start difference. First operand has 71 states, 49 states have (on average 1.183673469387755) internal successors, (58), 53 states have internal predecessors, (58), 14 states have call successors, (14), 8 states have call predecessors, (14), 7 states have return successors, (12), 9 states have call predecessors, (12), 12 states have call successors, (12) Second operand 71 states. [2022-04-07 15:16:27,086 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 15:16:27,086 INFO L93 Difference]: Finished difference Result 71 states and 84 transitions. [2022-04-07 15:16:27,087 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 84 transitions. [2022-04-07 15:16:27,087 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 15:16:27,087 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 15:16:27,087 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 15:16:27,087 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 15:16:27,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 49 states have (on average 1.183673469387755) internal successors, (58), 53 states have internal predecessors, (58), 14 states have call successors, (14), 8 states have call predecessors, (14), 7 states have return successors, (12), 9 states have call predecessors, (12), 12 states have call successors, (12) [2022-04-07 15:16:27,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 84 transitions. [2022-04-07 15:16:27,090 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 84 transitions. Word has length 37 [2022-04-07 15:16:27,091 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 15:16:27,091 INFO L478 AbstractCegarLoop]: Abstraction has 71 states and 84 transitions. [2022-04-07 15:16:27,091 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 1.6842105263157894) internal successors, (32), 16 states have internal predecessors, (32), 5 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (7), 5 states have call predecessors, (7), 3 states have call successors, (7) [2022-04-07 15:16:27,091 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 84 transitions. [2022-04-07 15:16:27,092 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2022-04-07 15:16:27,092 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 15:16:27,092 INFO L499 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-07 15:16:27,117 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-04-07 15:16:27,314 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 15:16:27,314 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 15:16:27,315 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 15:16:27,315 INFO L85 PathProgramCache]: Analyzing trace with hash -1351630086, now seen corresponding path program 1 times [2022-04-07 15:16:27,315 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 15:16:27,315 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [685810346] [2022-04-07 15:16:27,315 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 15:16:27,315 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 15:16:27,329 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-07 15:16:27,330 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [17149085] [2022-04-07 15:16:27,330 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 15:16:27,330 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 15:16:27,330 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-07 15:16:27,331 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-07 15:16:27,334 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-04-07 15:16:27,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 15:16:27,372 INFO L263 TraceCheckSpWp]: Trace formula consists of 122 conjuncts, 10 conjunts are in the unsatisfiable core [2022-04-07 15:16:27,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 15:16:27,381 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-07 15:16:35,597 INFO L272 TraceCheckUtils]: 0: Hoare triple {1877#true} call ULTIMATE.init(); {1877#true} is VALID [2022-04-07 15:16:35,598 INFO L290 TraceCheckUtils]: 1: Hoare triple {1877#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); {1877#true} is VALID [2022-04-07 15:16:35,598 INFO L290 TraceCheckUtils]: 2: Hoare triple {1877#true} assume true; {1877#true} is VALID [2022-04-07 15:16:35,598 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1877#true} {1877#true} #71#return; {1877#true} is VALID [2022-04-07 15:16:35,598 INFO L272 TraceCheckUtils]: 4: Hoare triple {1877#true} call #t~ret6 := main(); {1877#true} is VALID [2022-04-07 15:16:35,598 INFO L290 TraceCheckUtils]: 5: Hoare triple {1877#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; {1877#true} is VALID [2022-04-07 15:16:35,598 INFO L272 TraceCheckUtils]: 6: Hoare triple {1877#true} call assume_abort_if_not((if ~a~0 >= 0 && ~a~0 <= 50 then 1 else 0)); {1877#true} is VALID [2022-04-07 15:16:35,599 INFO L290 TraceCheckUtils]: 7: Hoare triple {1877#true} ~cond := #in~cond; {1877#true} is VALID [2022-04-07 15:16:35,599 INFO L290 TraceCheckUtils]: 8: Hoare triple {1877#true} assume !(0 == ~cond); {1877#true} is VALID [2022-04-07 15:16:35,599 INFO L290 TraceCheckUtils]: 9: Hoare triple {1877#true} assume true; {1877#true} is VALID [2022-04-07 15:16:35,599 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1877#true} {1877#true} #61#return; {1877#true} is VALID [2022-04-07 15:16:35,599 INFO L290 TraceCheckUtils]: 11: Hoare triple {1877#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~b~0 := #t~nondet5;havoc #t~nondet5; {1877#true} is VALID [2022-04-07 15:16:35,599 INFO L272 TraceCheckUtils]: 12: Hoare triple {1877#true} call assume_abort_if_not((if ~b~0 >= 0 && ~b~0 <= 50 then 1 else 0)); {1877#true} is VALID [2022-04-07 15:16:35,599 INFO L290 TraceCheckUtils]: 13: Hoare triple {1877#true} ~cond := #in~cond; {1877#true} is VALID [2022-04-07 15:16:35,599 INFO L290 TraceCheckUtils]: 14: Hoare triple {1877#true} assume !(0 == ~cond); {1877#true} is VALID [2022-04-07 15:16:35,600 INFO L290 TraceCheckUtils]: 15: Hoare triple {1877#true} assume true; {1877#true} is VALID [2022-04-07 15:16:35,600 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {1877#true} {1877#true} #63#return; {1877#true} is VALID [2022-04-07 15:16:35,600 INFO L272 TraceCheckUtils]: 17: Hoare triple {1877#true} call assume_abort_if_not((if ~b~0 >= 1 then 1 else 0)); {1877#true} is VALID [2022-04-07 15:16:35,600 INFO L290 TraceCheckUtils]: 18: Hoare triple {1877#true} ~cond := #in~cond; {1877#true} is VALID [2022-04-07 15:16:35,600 INFO L290 TraceCheckUtils]: 19: Hoare triple {1877#true} assume !(0 == ~cond); {1877#true} is VALID [2022-04-07 15:16:35,600 INFO L290 TraceCheckUtils]: 20: Hoare triple {1877#true} assume true; {1877#true} is VALID [2022-04-07 15:16:35,600 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {1877#true} {1877#true} #65#return; {1877#true} is VALID [2022-04-07 15:16:35,600 INFO L290 TraceCheckUtils]: 22: Hoare triple {1877#true} ~x~0 := ~a~0;~y~0 := ~b~0;~z~0 := 0; {1877#true} is VALID [2022-04-07 15:16:35,601 INFO L290 TraceCheckUtils]: 23: Hoare triple {1877#true} assume !false; {1877#true} is VALID [2022-04-07 15:16:35,601 INFO L272 TraceCheckUtils]: 24: Hoare triple {1877#true} call __VERIFIER_assert((if ~z~0 + ~x~0 * ~y~0 == ~a~0 * ~b~0 then 1 else 0)); {1877#true} is VALID [2022-04-07 15:16:35,601 INFO L290 TraceCheckUtils]: 25: Hoare triple {1877#true} ~cond := #in~cond; {1877#true} is VALID [2022-04-07 15:16:35,601 INFO L290 TraceCheckUtils]: 26: Hoare triple {1877#true} assume !(0 == ~cond); {1877#true} is VALID [2022-04-07 15:16:35,601 INFO L290 TraceCheckUtils]: 27: Hoare triple {1877#true} assume true; {1877#true} is VALID [2022-04-07 15:16:35,601 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {1877#true} {1877#true} #67#return; {1877#true} is VALID [2022-04-07 15:16:35,601 INFO L290 TraceCheckUtils]: 29: Hoare triple {1877#true} assume !!(0 != ~y~0); {1877#true} is VALID [2022-04-07 15:16:35,601 INFO L290 TraceCheckUtils]: 30: Hoare triple {1877#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; {1877#true} is VALID [2022-04-07 15:16:35,601 INFO L290 TraceCheckUtils]: 31: Hoare triple {1877#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); {1877#true} is VALID [2022-04-07 15:16:35,602 INFO L290 TraceCheckUtils]: 32: Hoare triple {1877#true} assume !false; {1877#true} is VALID [2022-04-07 15:16:35,602 INFO L272 TraceCheckUtils]: 33: Hoare triple {1877#true} call __VERIFIER_assert((if ~z~0 + ~x~0 * ~y~0 == ~a~0 * ~b~0 then 1 else 0)); {1877#true} is VALID [2022-04-07 15:16:35,603 INFO L290 TraceCheckUtils]: 34: Hoare triple {1877#true} ~cond := #in~cond; {1984#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-07 15:16:35,603 INFO L290 TraceCheckUtils]: 35: Hoare triple {1984#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {1988#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-07 15:16:35,604 INFO L290 TraceCheckUtils]: 36: Hoare triple {1988#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {1988#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-07 15:16:37,606 WARN L284 TraceCheckUtils]: 37: Hoare quadruple {1988#(not (= |__VERIFIER_assert_#in~cond| 0))} {1877#true} #67#return; {1995#(or (and (not (= main_~y~0 0)) (= (mod (+ (* (- 1) main_~z~0) (* main_~b~0 main_~a~0)) main_~y~0) 0)) (= (+ (* (- 1) main_~z~0) (* main_~b~0 main_~a~0)) 0))} is UNKNOWN [2022-04-07 15:16:37,607 INFO L290 TraceCheckUtils]: 38: Hoare triple {1995#(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); {1999#(= main_~z~0 (* main_~b~0 main_~a~0))} is VALID [2022-04-07 15:16:37,607 INFO L272 TraceCheckUtils]: 39: Hoare triple {1999#(= main_~z~0 (* main_~b~0 main_~a~0))} call __VERIFIER_assert((if ~z~0 == ~a~0 * ~b~0 then 1 else 0)); {2003#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-07 15:16:37,608 INFO L290 TraceCheckUtils]: 40: Hoare triple {2003#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {2007#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-07 15:16:37,608 INFO L290 TraceCheckUtils]: 41: Hoare triple {2007#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1878#false} is VALID [2022-04-07 15:16:37,608 INFO L290 TraceCheckUtils]: 42: Hoare triple {1878#false} assume !false; {1878#false} is VALID [2022-04-07 15:16:37,608 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-04-07 15:16:37,608 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-07 15:16:42,830 INFO L290 TraceCheckUtils]: 42: Hoare triple {1878#false} assume !false; {1878#false} is VALID [2022-04-07 15:16:42,831 INFO L290 TraceCheckUtils]: 41: Hoare triple {2007#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1878#false} is VALID [2022-04-07 15:16:42,831 INFO L290 TraceCheckUtils]: 40: Hoare triple {2003#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {2007#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-07 15:16:42,832 INFO L272 TraceCheckUtils]: 39: Hoare triple {1999#(= main_~z~0 (* main_~b~0 main_~a~0))} call __VERIFIER_assert((if ~z~0 == ~a~0 * ~b~0 then 1 else 0)); {2003#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-07 15:16:42,832 INFO L290 TraceCheckUtils]: 38: Hoare triple {2026#(or (not (= main_~y~0 0)) (= main_~z~0 (* main_~b~0 main_~a~0)))} assume !(0 != ~y~0); {1999#(= main_~z~0 (* main_~b~0 main_~a~0))} is VALID [2022-04-07 15:16:42,833 INFO L284 TraceCheckUtils]: 37: Hoare quadruple {1988#(not (= |__VERIFIER_assert_#in~cond| 0))} {1877#true} #67#return; {2026#(or (not (= main_~y~0 0)) (= main_~z~0 (* main_~b~0 main_~a~0)))} is VALID [2022-04-07 15:16:42,834 INFO L290 TraceCheckUtils]: 36: Hoare triple {1988#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {1988#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-07 15:16:42,834 INFO L290 TraceCheckUtils]: 35: Hoare triple {2039#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} assume !(0 == ~cond); {1988#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-07 15:16:42,835 INFO L290 TraceCheckUtils]: 34: Hoare triple {1877#true} ~cond := #in~cond; {2039#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-07 15:16:42,835 INFO L272 TraceCheckUtils]: 33: Hoare triple {1877#true} call __VERIFIER_assert((if ~z~0 + ~x~0 * ~y~0 == ~a~0 * ~b~0 then 1 else 0)); {1877#true} is VALID [2022-04-07 15:16:42,835 INFO L290 TraceCheckUtils]: 32: Hoare triple {1877#true} assume !false; {1877#true} is VALID [2022-04-07 15:16:42,835 INFO L290 TraceCheckUtils]: 31: Hoare triple {1877#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); {1877#true} is VALID [2022-04-07 15:16:42,835 INFO L290 TraceCheckUtils]: 30: Hoare triple {1877#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; {1877#true} is VALID [2022-04-07 15:16:42,835 INFO L290 TraceCheckUtils]: 29: Hoare triple {1877#true} assume !!(0 != ~y~0); {1877#true} is VALID [2022-04-07 15:16:42,836 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {1877#true} {1877#true} #67#return; {1877#true} is VALID [2022-04-07 15:16:42,836 INFO L290 TraceCheckUtils]: 27: Hoare triple {1877#true} assume true; {1877#true} is VALID [2022-04-07 15:16:42,836 INFO L290 TraceCheckUtils]: 26: Hoare triple {1877#true} assume !(0 == ~cond); {1877#true} is VALID [2022-04-07 15:16:42,836 INFO L290 TraceCheckUtils]: 25: Hoare triple {1877#true} ~cond := #in~cond; {1877#true} is VALID [2022-04-07 15:16:42,836 INFO L272 TraceCheckUtils]: 24: Hoare triple {1877#true} call __VERIFIER_assert((if ~z~0 + ~x~0 * ~y~0 == ~a~0 * ~b~0 then 1 else 0)); {1877#true} is VALID [2022-04-07 15:16:42,836 INFO L290 TraceCheckUtils]: 23: Hoare triple {1877#true} assume !false; {1877#true} is VALID [2022-04-07 15:16:42,836 INFO L290 TraceCheckUtils]: 22: Hoare triple {1877#true} ~x~0 := ~a~0;~y~0 := ~b~0;~z~0 := 0; {1877#true} is VALID [2022-04-07 15:16:42,836 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {1877#true} {1877#true} #65#return; {1877#true} is VALID [2022-04-07 15:16:42,836 INFO L290 TraceCheckUtils]: 20: Hoare triple {1877#true} assume true; {1877#true} is VALID [2022-04-07 15:16:42,837 INFO L290 TraceCheckUtils]: 19: Hoare triple {1877#true} assume !(0 == ~cond); {1877#true} is VALID [2022-04-07 15:16:42,837 INFO L290 TraceCheckUtils]: 18: Hoare triple {1877#true} ~cond := #in~cond; {1877#true} is VALID [2022-04-07 15:16:42,837 INFO L272 TraceCheckUtils]: 17: Hoare triple {1877#true} call assume_abort_if_not((if ~b~0 >= 1 then 1 else 0)); {1877#true} is VALID [2022-04-07 15:16:42,837 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {1877#true} {1877#true} #63#return; {1877#true} is VALID [2022-04-07 15:16:42,837 INFO L290 TraceCheckUtils]: 15: Hoare triple {1877#true} assume true; {1877#true} is VALID [2022-04-07 15:16:42,837 INFO L290 TraceCheckUtils]: 14: Hoare triple {1877#true} assume !(0 == ~cond); {1877#true} is VALID [2022-04-07 15:16:42,837 INFO L290 TraceCheckUtils]: 13: Hoare triple {1877#true} ~cond := #in~cond; {1877#true} is VALID [2022-04-07 15:16:42,837 INFO L272 TraceCheckUtils]: 12: Hoare triple {1877#true} call assume_abort_if_not((if ~b~0 >= 0 && ~b~0 <= 50 then 1 else 0)); {1877#true} is VALID [2022-04-07 15:16:42,837 INFO L290 TraceCheckUtils]: 11: Hoare triple {1877#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~b~0 := #t~nondet5;havoc #t~nondet5; {1877#true} is VALID [2022-04-07 15:16:42,837 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1877#true} {1877#true} #61#return; {1877#true} is VALID [2022-04-07 15:16:42,838 INFO L290 TraceCheckUtils]: 9: Hoare triple {1877#true} assume true; {1877#true} is VALID [2022-04-07 15:16:42,838 INFO L290 TraceCheckUtils]: 8: Hoare triple {1877#true} assume !(0 == ~cond); {1877#true} is VALID [2022-04-07 15:16:42,838 INFO L290 TraceCheckUtils]: 7: Hoare triple {1877#true} ~cond := #in~cond; {1877#true} is VALID [2022-04-07 15:16:42,838 INFO L272 TraceCheckUtils]: 6: Hoare triple {1877#true} call assume_abort_if_not((if ~a~0 >= 0 && ~a~0 <= 50 then 1 else 0)); {1877#true} is VALID [2022-04-07 15:16:42,838 INFO L290 TraceCheckUtils]: 5: Hoare triple {1877#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; {1877#true} is VALID [2022-04-07 15:16:42,838 INFO L272 TraceCheckUtils]: 4: Hoare triple {1877#true} call #t~ret6 := main(); {1877#true} is VALID [2022-04-07 15:16:42,838 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1877#true} {1877#true} #71#return; {1877#true} is VALID [2022-04-07 15:16:42,838 INFO L290 TraceCheckUtils]: 2: Hoare triple {1877#true} assume true; {1877#true} is VALID [2022-04-07 15:16:42,839 INFO L290 TraceCheckUtils]: 1: Hoare triple {1877#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); {1877#true} is VALID [2022-04-07 15:16:42,839 INFO L272 TraceCheckUtils]: 0: Hoare triple {1877#true} call ULTIMATE.init(); {1877#true} is VALID [2022-04-07 15:16:42,839 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-04-07 15:16:42,839 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 15:16:42,839 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [685810346] [2022-04-07 15:16:42,839 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-07 15:16:42,839 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [17149085] [2022-04-07 15:16:42,839 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [17149085] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-07 15:16:42,839 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-07 15:16:42,840 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 10 [2022-04-07 15:16:42,840 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1706388504] [2022-04-07 15:16:42,840 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-07 15:16:42,840 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 2.7777777777777777) internal successors, (25), 7 states have internal predecessors, (25), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 3 states have call predecessors, (7), 1 states have call successors, (7) Word has length 43 [2022-04-07 15:16:42,841 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 15:16:42,841 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 10 states, 9 states have (on average 2.7777777777777777) internal successors, (25), 7 states have internal predecessors, (25), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 3 states have call predecessors, (7), 1 states have call successors, (7) [2022-04-07 15:16:44,874 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 39 edges. 38 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-07 15:16:44,875 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-04-07 15:16:44,875 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 15:16:44,875 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-04-07 15:16:44,875 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2022-04-07 15:16:44,875 INFO L87 Difference]: Start difference. First operand 71 states and 84 transitions. Second operand has 10 states, 9 states have (on average 2.7777777777777777) internal successors, (25), 7 states have internal predecessors, (25), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 3 states have call predecessors, (7), 1 states have call successors, (7) [2022-04-07 15:16:46,933 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-07 15:16:47,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 15:16:47,367 INFO L93 Difference]: Finished difference Result 77 states and 89 transitions. [2022-04-07 15:16:47,368 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-07 15:16:47,368 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 2.7777777777777777) internal successors, (25), 7 states have internal predecessors, (25), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 3 states have call predecessors, (7), 1 states have call successors, (7) Word has length 43 [2022-04-07 15:16:47,368 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 15:16:47,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 9 states have (on average 2.7777777777777777) internal successors, (25), 7 states have internal predecessors, (25), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 3 states have call predecessors, (7), 1 states have call successors, (7) [2022-04-07 15:16:47,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 40 transitions. [2022-04-07 15:16:47,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 9 states have (on average 2.7777777777777777) internal successors, (25), 7 states have internal predecessors, (25), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 3 states have call predecessors, (7), 1 states have call successors, (7) [2022-04-07 15:16:47,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 40 transitions. [2022-04-07 15:16:47,371 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 9 states and 40 transitions. [2022-04-07 15:16:51,409 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 40 edges. 38 inductive. 0 not inductive. 2 times theorem prover too weak to decide inductivity. [2022-04-07 15:16:51,411 INFO L225 Difference]: With dead ends: 77 [2022-04-07 15:16:51,411 INFO L226 Difference]: Without dead ends: 70 [2022-04-07 15:16:51,411 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 76 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2022-04-07 15:16:51,412 INFO L913 BasicCegarLoop]: 25 mSDtfsCounter, 14 mSDsluCounter, 93 mSDsCounter, 0 mSdLazyCounter, 76 mSolverCounterSat, 3 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 118 SdHoareTripleChecker+Invalid, 80 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 76 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2022-04-07 15:16:51,412 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [14 Valid, 118 Invalid, 80 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 76 Invalid, 1 Unknown, 0 Unchecked, 2.2s Time] [2022-04-07 15:16:51,413 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2022-04-07 15:16:51,438 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 70. [2022-04-07 15:16:51,438 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 15:16:51,438 INFO L82 GeneralOperation]: Start isEquivalent. First operand 70 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-07 15:16:51,439 INFO L74 IsIncluded]: Start isIncluded. First operand 70 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-07 15:16:51,439 INFO L87 Difference]: Start difference. First operand 70 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-07 15:16:51,442 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 15:16:51,442 INFO L93 Difference]: Finished difference Result 70 states and 80 transitions. [2022-04-07 15:16:51,442 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 80 transitions. [2022-04-07 15:16:51,442 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 15:16:51,442 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 15:16:51,443 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 70 states. [2022-04-07 15:16:51,443 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 70 states. [2022-04-07 15:16:51,445 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 15:16:51,445 INFO L93 Difference]: Finished difference Result 70 states and 80 transitions. [2022-04-07 15:16:51,445 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 80 transitions. [2022-04-07 15:16:51,446 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 15:16:51,446 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 15:16:51,446 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 15:16:51,446 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 15:16:51,446 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-07 15:16:51,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 80 transitions. [2022-04-07 15:16:51,449 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 80 transitions. Word has length 43 [2022-04-07 15:16:51,449 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 15:16:51,449 INFO L478 AbstractCegarLoop]: Abstraction has 70 states and 80 transitions. [2022-04-07 15:16:51,449 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 2.7777777777777777) internal successors, (25), 7 states have internal predecessors, (25), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 3 states have call predecessors, (7), 1 states have call successors, (7) [2022-04-07 15:16:51,449 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 80 transitions. [2022-04-07 15:16:51,450 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2022-04-07 15:16:51,450 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 15:16:51,450 INFO L499 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-07 15:16:51,474 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-04-07 15:16:51,671 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 15:16:51,672 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 15:16:51,672 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 15:16:51,672 INFO L85 PathProgramCache]: Analyzing trace with hash -1459553868, now seen corresponding path program 1 times [2022-04-07 15:16:51,672 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 15:16:51,672 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1861744171] [2022-04-07 15:16:51,672 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 15:16:51,673 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 15:16:51,693 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-07 15:16:51,694 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [789942408] [2022-04-07 15:16:51,694 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 15:16:51,694 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 15:16:51,694 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-07 15:16:51,710 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-07 15:16:51,713 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-04-07 15:16:51,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 15:16:51,759 INFO L263 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 44 conjunts are in the unsatisfiable core [2022-04-07 15:16:51,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 15:16:51,807 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-07 15:17:00,462 INFO L272 TraceCheckUtils]: 0: Hoare triple {2495#true} call ULTIMATE.init(); {2495#true} is VALID [2022-04-07 15:17:00,462 INFO L290 TraceCheckUtils]: 1: Hoare triple {2495#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); {2495#true} is VALID [2022-04-07 15:17:00,462 INFO L290 TraceCheckUtils]: 2: Hoare triple {2495#true} assume true; {2495#true} is VALID [2022-04-07 15:17:00,463 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2495#true} {2495#true} #71#return; {2495#true} is VALID [2022-04-07 15:17:00,463 INFO L272 TraceCheckUtils]: 4: Hoare triple {2495#true} call #t~ret6 := main(); {2495#true} is VALID [2022-04-07 15:17:00,463 INFO L290 TraceCheckUtils]: 5: Hoare triple {2495#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; {2495#true} is VALID [2022-04-07 15:17:00,463 INFO L272 TraceCheckUtils]: 6: Hoare triple {2495#true} call assume_abort_if_not((if ~a~0 >= 0 && ~a~0 <= 50 then 1 else 0)); {2495#true} is VALID [2022-04-07 15:17:00,463 INFO L290 TraceCheckUtils]: 7: Hoare triple {2495#true} ~cond := #in~cond; {2495#true} is VALID [2022-04-07 15:17:00,463 INFO L290 TraceCheckUtils]: 8: Hoare triple {2495#true} assume !(0 == ~cond); {2495#true} is VALID [2022-04-07 15:17:00,463 INFO L290 TraceCheckUtils]: 9: Hoare triple {2495#true} assume true; {2495#true} is VALID [2022-04-07 15:17:00,463 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {2495#true} {2495#true} #61#return; {2495#true} is VALID [2022-04-07 15:17:00,463 INFO L290 TraceCheckUtils]: 11: Hoare triple {2495#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~b~0 := #t~nondet5;havoc #t~nondet5; {2495#true} is VALID [2022-04-07 15:17:00,463 INFO L272 TraceCheckUtils]: 12: Hoare triple {2495#true} call assume_abort_if_not((if ~b~0 >= 0 && ~b~0 <= 50 then 1 else 0)); {2495#true} is VALID [2022-04-07 15:17:00,463 INFO L290 TraceCheckUtils]: 13: Hoare triple {2495#true} ~cond := #in~cond; {2495#true} is VALID [2022-04-07 15:17:00,463 INFO L290 TraceCheckUtils]: 14: Hoare triple {2495#true} assume !(0 == ~cond); {2495#true} is VALID [2022-04-07 15:17:00,464 INFO L290 TraceCheckUtils]: 15: Hoare triple {2495#true} assume true; {2495#true} is VALID [2022-04-07 15:17:00,464 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {2495#true} {2495#true} #63#return; {2495#true} is VALID [2022-04-07 15:17:00,464 INFO L272 TraceCheckUtils]: 17: Hoare triple {2495#true} call assume_abort_if_not((if ~b~0 >= 1 then 1 else 0)); {2495#true} is VALID [2022-04-07 15:17:00,464 INFO L290 TraceCheckUtils]: 18: Hoare triple {2495#true} ~cond := #in~cond; {2495#true} is VALID [2022-04-07 15:17:00,464 INFO L290 TraceCheckUtils]: 19: Hoare triple {2495#true} assume !(0 == ~cond); {2495#true} is VALID [2022-04-07 15:17:00,464 INFO L290 TraceCheckUtils]: 20: Hoare triple {2495#true} assume true; {2495#true} is VALID [2022-04-07 15:17:00,464 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {2495#true} {2495#true} #65#return; {2495#true} is VALID [2022-04-07 15:17:00,464 INFO L290 TraceCheckUtils]: 22: Hoare triple {2495#true} ~x~0 := ~a~0;~y~0 := ~b~0;~z~0 := 0; {2566#(and (= main_~b~0 main_~y~0) (= main_~a~0 main_~x~0))} is VALID [2022-04-07 15:17:00,465 INFO L290 TraceCheckUtils]: 23: Hoare triple {2566#(and (= main_~b~0 main_~y~0) (= main_~a~0 main_~x~0))} assume !false; {2566#(and (= main_~b~0 main_~y~0) (= main_~a~0 main_~x~0))} is VALID [2022-04-07 15:17:00,465 INFO L272 TraceCheckUtils]: 24: Hoare triple {2566#(and (= main_~b~0 main_~y~0) (= main_~a~0 main_~x~0))} call __VERIFIER_assert((if ~z~0 + ~x~0 * ~y~0 == ~a~0 * ~b~0 then 1 else 0)); {2495#true} is VALID [2022-04-07 15:17:00,465 INFO L290 TraceCheckUtils]: 25: Hoare triple {2495#true} ~cond := #in~cond; {2495#true} is VALID [2022-04-07 15:17:00,465 INFO L290 TraceCheckUtils]: 26: Hoare triple {2495#true} assume !(0 == ~cond); {2495#true} is VALID [2022-04-07 15:17:00,465 INFO L290 TraceCheckUtils]: 27: Hoare triple {2495#true} assume true; {2495#true} is VALID [2022-04-07 15:17:00,468 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {2495#true} {2566#(and (= main_~b~0 main_~y~0) (= main_~a~0 main_~x~0))} #67#return; {2566#(and (= main_~b~0 main_~y~0) (= main_~a~0 main_~x~0))} is VALID [2022-04-07 15:17:00,468 INFO L290 TraceCheckUtils]: 29: Hoare triple {2566#(and (= main_~b~0 main_~y~0) (= main_~a~0 main_~x~0))} assume !!(0 != ~y~0); {2588#(and (not (= main_~y~0 0)) (= main_~b~0 main_~y~0) (= main_~a~0 main_~x~0))} is VALID [2022-04-07 15:17:00,469 INFO L290 TraceCheckUtils]: 30: Hoare triple {2588#(and (not (= main_~y~0 0)) (= main_~b~0 main_~y~0) (= main_~a~0 main_~x~0))} assume 1 == (if ~y~0 < 0 && 0 != ~y~0 % 2 then ~y~0 % 2 - 2 else ~y~0 % 2);~z~0 := ~z~0 + ~x~0;~y~0 := ~y~0 - 1; {2592#(and (<= 1 (mod (+ main_~y~0 1) 2)) (= main_~b~0 (+ main_~y~0 1)) (= main_~a~0 main_~x~0) (<= 0 (+ main_~y~0 1)))} is VALID [2022-04-07 15:17:00,471 INFO L290 TraceCheckUtils]: 31: Hoare triple {2592#(and (<= 1 (mod (+ main_~y~0 1) 2)) (= main_~b~0 (+ main_~y~0 1)) (= 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); {2596#(and (<= 1 (mod main_~b~0 2)) (= (* main_~a~0 2) main_~x~0) (<= 0 main_~b~0) (= (div (+ (- 1) main_~b~0) 2) main_~y~0))} is VALID [2022-04-07 15:17:00,471 INFO L290 TraceCheckUtils]: 32: Hoare triple {2596#(and (<= 1 (mod main_~b~0 2)) (= (* main_~a~0 2) main_~x~0) (<= 0 main_~b~0) (= (div (+ (- 1) main_~b~0) 2) main_~y~0))} assume !false; {2596#(and (<= 1 (mod main_~b~0 2)) (= (* main_~a~0 2) main_~x~0) (<= 0 main_~b~0) (= (div (+ (- 1) main_~b~0) 2) main_~y~0))} is VALID [2022-04-07 15:17:00,471 INFO L272 TraceCheckUtils]: 33: Hoare triple {2596#(and (<= 1 (mod main_~b~0 2)) (= (* main_~a~0 2) main_~x~0) (<= 0 main_~b~0) (= (div (+ (- 1) main_~b~0) 2) main_~y~0))} call __VERIFIER_assert((if ~z~0 + ~x~0 * ~y~0 == ~a~0 * ~b~0 then 1 else 0)); {2495#true} is VALID [2022-04-07 15:17:00,472 INFO L290 TraceCheckUtils]: 34: Hoare triple {2495#true} ~cond := #in~cond; {2606#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-07 15:17:00,472 INFO L290 TraceCheckUtils]: 35: Hoare triple {2606#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {2610#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-07 15:17:00,472 INFO L290 TraceCheckUtils]: 36: Hoare triple {2610#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {2610#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-07 15:17:00,474 INFO L284 TraceCheckUtils]: 37: Hoare quadruple {2610#(not (= |__VERIFIER_assert_#in~cond| 0))} {2596#(and (<= 1 (mod main_~b~0 2)) (= (* main_~a~0 2) main_~x~0) (<= 0 main_~b~0) (= (div (+ (- 1) main_~b~0) 2) main_~y~0))} #67#return; {2617#(and (<= 1 (mod main_~b~0 2)) (= (+ main_~z~0 (* main_~y~0 main_~x~0)) (* main_~b~0 main_~a~0)) (= (* main_~a~0 2) main_~x~0) (<= 0 main_~b~0) (= (div (+ (- 1) main_~b~0) 2) main_~y~0))} is VALID [2022-04-07 15:17:00,474 INFO L290 TraceCheckUtils]: 38: Hoare triple {2617#(and (<= 1 (mod main_~b~0 2)) (= (+ main_~z~0 (* main_~y~0 main_~x~0)) (* main_~b~0 main_~a~0)) (= (* main_~a~0 2) main_~x~0) (<= 0 main_~b~0) (= (div (+ (- 1) main_~b~0) 2) main_~y~0))} assume !!(0 != ~y~0); {2621#(and (not (= main_~y~0 0)) (<= 1 (mod main_~b~0 2)) (= (+ main_~z~0 (* main_~y~0 main_~x~0)) (* main_~b~0 main_~a~0)) (= (* main_~a~0 2) main_~x~0) (<= 0 main_~b~0) (= (div (+ (- 1) main_~b~0) 2) main_~y~0))} is VALID [2022-04-07 15:17:00,477 INFO L290 TraceCheckUtils]: 39: Hoare triple {2621#(and (not (= main_~y~0 0)) (<= 1 (mod main_~b~0 2)) (= (+ main_~z~0 (* main_~y~0 main_~x~0)) (* main_~b~0 main_~a~0)) (= (* main_~a~0 2) main_~x~0) (<= 0 main_~b~0) (= (div (+ (- 1) main_~b~0) 2) main_~y~0))} assume 1 == (if ~y~0 < 0 && 0 != ~y~0 % 2 then ~y~0 % 2 - 2 else ~y~0 % 2);~z~0 := ~z~0 + ~x~0;~y~0 := ~y~0 - 1; {2625#(and (= (+ main_~z~0 (* (div (+ (- 1) main_~b~0) 2) main_~x~0)) (+ main_~x~0 (* main_~b~0 main_~a~0))) (<= 1 (mod main_~b~0 2)) (= (* main_~a~0 2) main_~x~0) (= (div (+ (- 1) main_~b~0) 2) (+ main_~y~0 1)) (<= 1 (mod (div (+ (- 1) main_~b~0) 2) 2)) (<= 0 main_~b~0))} is VALID [2022-04-07 15:17:00,482 INFO L290 TraceCheckUtils]: 40: Hoare triple {2625#(and (= (+ main_~z~0 (* (div (+ (- 1) main_~b~0) 2) main_~x~0)) (+ main_~x~0 (* main_~b~0 main_~a~0))) (<= 1 (mod main_~b~0 2)) (= (* main_~a~0 2) main_~x~0) (= (div (+ (- 1) main_~b~0) 2) (+ main_~y~0 1)) (<= 1 (mod (div (+ (- 1) main_~b~0) 2) 2)) (<= 0 main_~b~0))} ~x~0 := 2 * ~x~0;~y~0 := (if ~y~0 < 0 && 0 != ~y~0 % 2 then 1 + ~y~0 / 2 else ~y~0 / 2); {2629#(and (<= 1 (mod main_~b~0 2)) (= (* main_~a~0 4) main_~x~0) (= (div (+ (- 1) (div (+ (- 1) main_~b~0) 2)) 2) main_~y~0) (= (+ (* main_~a~0 2) (* main_~b~0 main_~a~0)) (+ main_~z~0 (* (div (+ (- 1) main_~b~0) 2) (* main_~a~0 2)))) (<= 1 (mod (div (+ (- 1) main_~b~0) 2) 2)) (<= 0 main_~b~0))} is VALID [2022-04-07 15:17:00,482 INFO L290 TraceCheckUtils]: 41: Hoare triple {2629#(and (<= 1 (mod main_~b~0 2)) (= (* main_~a~0 4) main_~x~0) (= (div (+ (- 1) (div (+ (- 1) main_~b~0) 2)) 2) main_~y~0) (= (+ (* main_~a~0 2) (* main_~b~0 main_~a~0)) (+ main_~z~0 (* (div (+ (- 1) main_~b~0) 2) (* main_~a~0 2)))) (<= 1 (mod (div (+ (- 1) main_~b~0) 2) 2)) (<= 0 main_~b~0))} assume !false; {2629#(and (<= 1 (mod main_~b~0 2)) (= (* main_~a~0 4) main_~x~0) (= (div (+ (- 1) (div (+ (- 1) main_~b~0) 2)) 2) main_~y~0) (= (+ (* main_~a~0 2) (* main_~b~0 main_~a~0)) (+ main_~z~0 (* (div (+ (- 1) main_~b~0) 2) (* main_~a~0 2)))) (<= 1 (mod (div (+ (- 1) main_~b~0) 2) 2)) (<= 0 main_~b~0))} is VALID [2022-04-07 15:17:00,482 INFO L272 TraceCheckUtils]: 42: Hoare triple {2629#(and (<= 1 (mod main_~b~0 2)) (= (* main_~a~0 4) main_~x~0) (= (div (+ (- 1) (div (+ (- 1) main_~b~0) 2)) 2) main_~y~0) (= (+ (* main_~a~0 2) (* main_~b~0 main_~a~0)) (+ main_~z~0 (* (div (+ (- 1) main_~b~0) 2) (* main_~a~0 2)))) (<= 1 (mod (div (+ (- 1) main_~b~0) 2) 2)) (<= 0 main_~b~0))} call __VERIFIER_assert((if ~z~0 + ~x~0 * ~y~0 == ~a~0 * ~b~0 then 1 else 0)); {2495#true} is VALID [2022-04-07 15:17:00,483 INFO L290 TraceCheckUtils]: 43: Hoare triple {2495#true} ~cond := #in~cond; {2606#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-07 15:17:00,484 INFO L290 TraceCheckUtils]: 44: Hoare triple {2606#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {2610#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-07 15:17:00,484 INFO L290 TraceCheckUtils]: 45: Hoare triple {2610#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {2610#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-07 15:17:00,485 INFO L284 TraceCheckUtils]: 46: Hoare quadruple {2610#(not (= |__VERIFIER_assert_#in~cond| 0))} {2629#(and (<= 1 (mod main_~b~0 2)) (= (* main_~a~0 4) main_~x~0) (= (div (+ (- 1) (div (+ (- 1) main_~b~0) 2)) 2) main_~y~0) (= (+ (* main_~a~0 2) (* main_~b~0 main_~a~0)) (+ main_~z~0 (* (div (+ (- 1) main_~b~0) 2) (* main_~a~0 2)))) (<= 1 (mod (div (+ (- 1) main_~b~0) 2) 2)) (<= 0 main_~b~0))} #67#return; {2629#(and (<= 1 (mod main_~b~0 2)) (= (* main_~a~0 4) main_~x~0) (= (div (+ (- 1) (div (+ (- 1) main_~b~0) 2)) 2) main_~y~0) (= (+ (* main_~a~0 2) (* main_~b~0 main_~a~0)) (+ main_~z~0 (* (div (+ (- 1) main_~b~0) 2) (* main_~a~0 2)))) (<= 1 (mod (div (+ (- 1) main_~b~0) 2) 2)) (<= 0 main_~b~0))} is VALID [2022-04-07 15:17:00,485 INFO L290 TraceCheckUtils]: 47: Hoare triple {2629#(and (<= 1 (mod main_~b~0 2)) (= (* main_~a~0 4) main_~x~0) (= (div (+ (- 1) (div (+ (- 1) main_~b~0) 2)) 2) main_~y~0) (= (+ (* main_~a~0 2) (* main_~b~0 main_~a~0)) (+ main_~z~0 (* (div (+ (- 1) main_~b~0) 2) (* main_~a~0 2)))) (<= 1 (mod (div (+ (- 1) main_~b~0) 2) 2)) (<= 0 main_~b~0))} assume !!(0 != ~y~0); {2629#(and (<= 1 (mod main_~b~0 2)) (= (* main_~a~0 4) main_~x~0) (= (div (+ (- 1) (div (+ (- 1) main_~b~0) 2)) 2) main_~y~0) (= (+ (* main_~a~0 2) (* main_~b~0 main_~a~0)) (+ main_~z~0 (* (div (+ (- 1) main_~b~0) 2) (* main_~a~0 2)))) (<= 1 (mod (div (+ (- 1) main_~b~0) 2) 2)) (<= 0 main_~b~0))} is VALID [2022-04-07 15:17:00,487 INFO L290 TraceCheckUtils]: 48: Hoare triple {2629#(and (<= 1 (mod main_~b~0 2)) (= (* main_~a~0 4) main_~x~0) (= (div (+ (- 1) (div (+ (- 1) main_~b~0) 2)) 2) main_~y~0) (= (+ (* main_~a~0 2) (* main_~b~0 main_~a~0)) (+ main_~z~0 (* (div (+ (- 1) main_~b~0) 2) (* main_~a~0 2)))) (<= 1 (mod (div (+ (- 1) main_~b~0) 2) 2)) (<= 0 main_~b~0))} assume !(1 == (if ~y~0 < 0 && 0 != ~y~0 % 2 then ~y~0 % 2 - 2 else ~y~0 % 2)); {2654#(and (<= 1 (mod main_~b~0 2)) (= (* main_~a~0 4) main_~x~0) (not (= (mod main_~y~0 2) 1)) (= (div (+ (- 1) (div (+ (- 1) main_~b~0) 2)) 2) main_~y~0) (<= 1 (mod (div (+ (- 1) main_~b~0) 2) 2)) (<= 0 main_~b~0) (= (+ (* main_~a~0 2) (* main_~b~0 main_~a~0)) (+ (* 2 (* (div (+ (- 1) main_~b~0) 2) main_~a~0)) main_~z~0)))} is VALID [2022-04-07 15:17:00,488 INFO L290 TraceCheckUtils]: 49: Hoare triple {2654#(and (<= 1 (mod main_~b~0 2)) (= (* main_~a~0 4) main_~x~0) (not (= (mod main_~y~0 2) 1)) (= (div (+ (- 1) (div (+ (- 1) main_~b~0) 2)) 2) main_~y~0) (<= 1 (mod (div (+ (- 1) main_~b~0) 2) 2)) (<= 0 main_~b~0) (= (+ (* main_~a~0 2) (* main_~b~0 main_~a~0)) (+ (* 2 (* (div (+ (- 1) main_~b~0) 2) main_~a~0)) main_~z~0)))} ~x~0 := 2 * ~x~0;~y~0 := (if ~y~0 < 0 && 0 != ~y~0 % 2 then 1 + ~y~0 / 2 else ~y~0 / 2); {2658#(and (<= 1 (mod main_~b~0 2)) (= (div (div (+ (- 1) (div (+ (- 1) main_~b~0) 2)) 2) 2) main_~y~0) (= main_~x~0 (* main_~a~0 8)) (not (= (mod (div (+ (- 1) (div (+ (- 1) main_~b~0) 2)) 2) 2) 1)) (<= 1 (mod (div (+ (- 1) main_~b~0) 2) 2)) (<= 0 main_~b~0) (= (+ (* main_~a~0 2) (* main_~b~0 main_~a~0)) (+ (* 2 (* (div (+ (- 1) main_~b~0) 2) main_~a~0)) main_~z~0)))} is VALID [2022-04-07 15:17:00,489 INFO L290 TraceCheckUtils]: 50: Hoare triple {2658#(and (<= 1 (mod main_~b~0 2)) (= (div (div (+ (- 1) (div (+ (- 1) main_~b~0) 2)) 2) 2) main_~y~0) (= main_~x~0 (* main_~a~0 8)) (not (= (mod (div (+ (- 1) (div (+ (- 1) main_~b~0) 2)) 2) 2) 1)) (<= 1 (mod (div (+ (- 1) main_~b~0) 2) 2)) (<= 0 main_~b~0) (= (+ (* main_~a~0 2) (* main_~b~0 main_~a~0)) (+ (* 2 (* (div (+ (- 1) main_~b~0) 2) main_~a~0)) main_~z~0)))} assume !false; {2658#(and (<= 1 (mod main_~b~0 2)) (= (div (div (+ (- 1) (div (+ (- 1) main_~b~0) 2)) 2) 2) main_~y~0) (= main_~x~0 (* main_~a~0 8)) (not (= (mod (div (+ (- 1) (div (+ (- 1) main_~b~0) 2)) 2) 2) 1)) (<= 1 (mod (div (+ (- 1) main_~b~0) 2) 2)) (<= 0 main_~b~0) (= (+ (* main_~a~0 2) (* main_~b~0 main_~a~0)) (+ (* 2 (* (div (+ (- 1) main_~b~0) 2) main_~a~0)) main_~z~0)))} is VALID [2022-04-07 15:17:00,669 INFO L272 TraceCheckUtils]: 51: Hoare triple {2658#(and (<= 1 (mod main_~b~0 2)) (= (div (div (+ (- 1) (div (+ (- 1) main_~b~0) 2)) 2) 2) main_~y~0) (= main_~x~0 (* main_~a~0 8)) (not (= (mod (div (+ (- 1) (div (+ (- 1) main_~b~0) 2)) 2) 2) 1)) (<= 1 (mod (div (+ (- 1) main_~b~0) 2) 2)) (<= 0 main_~b~0) (= (+ (* main_~a~0 2) (* main_~b~0 main_~a~0)) (+ (* 2 (* (div (+ (- 1) main_~b~0) 2) main_~a~0)) main_~z~0)))} call __VERIFIER_assert((if ~z~0 + ~x~0 * ~y~0 == ~a~0 * ~b~0 then 1 else 0)); {2665#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-07 15:17:00,670 INFO L290 TraceCheckUtils]: 52: Hoare triple {2665#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {2669#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-07 15:17:00,670 INFO L290 TraceCheckUtils]: 53: Hoare triple {2669#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {2496#false} is VALID [2022-04-07 15:17:00,670 INFO L290 TraceCheckUtils]: 54: Hoare triple {2496#false} assume !false; {2496#false} is VALID [2022-04-07 15:17:00,670 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 10 proven. 23 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2022-04-07 15:17:00,670 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-07 15:19:08,713 INFO L290 TraceCheckUtils]: 54: Hoare triple {2496#false} assume !false; {2496#false} is VALID [2022-04-07 15:19:08,714 INFO L290 TraceCheckUtils]: 53: Hoare triple {2669#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {2496#false} is VALID [2022-04-07 15:19:08,714 INFO L290 TraceCheckUtils]: 52: Hoare triple {2665#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {2669#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-07 15:19:08,715 INFO L272 TraceCheckUtils]: 51: Hoare triple {2685#(= (+ 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)); {2665#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-07 15:19:08,715 INFO L290 TraceCheckUtils]: 50: Hoare triple {2685#(= (+ main_~z~0 (* main_~y~0 main_~x~0)) (* main_~b~0 main_~a~0))} assume !false; {2685#(= (+ main_~z~0 (* main_~y~0 main_~x~0)) (* main_~b~0 main_~a~0))} is VALID [2022-04-07 15:19:08,721 INFO L290 TraceCheckUtils]: 49: Hoare triple {2692#(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); {2685#(= (+ main_~z~0 (* main_~y~0 main_~x~0)) (* main_~b~0 main_~a~0))} is VALID [2022-04-07 15:19:08,722 INFO L290 TraceCheckUtils]: 48: Hoare triple {2696#(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)); {2692#(and (or (not (< main_~y~0 0)) (= (mod main_~y~0 2) 0) (= (+ main_~z~0 (* (* main_~x~0 2) (+ (div main_~y~0 2) 1))) (* main_~b~0 main_~a~0))) (or (= (+ main_~z~0 (* (* main_~x~0 2) (div main_~y~0 2))) (* main_~b~0 main_~a~0)) (and (not (= (mod main_~y~0 2) 0)) (< main_~y~0 0))))} is VALID [2022-04-07 15:19:08,723 INFO L290 TraceCheckUtils]: 47: Hoare triple {2696#(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); {2696#(or (and (<= 0 main_~y~0) (= (mod main_~y~0 2) 1)) (and (or (= (mod main_~y~0 2) 0) (= (+ main_~z~0 (* (* main_~x~0 2) (+ (div main_~y~0 2) 1))) (* main_~b~0 main_~a~0))) (or (= (+ main_~z~0 (* (* main_~x~0 2) (div main_~y~0 2))) (* main_~b~0 main_~a~0)) (not (= (mod main_~y~0 2) 0)))))} is VALID [2022-04-07 15:19:08,725 INFO L284 TraceCheckUtils]: 46: Hoare quadruple {2610#(not (= |__VERIFIER_assert_#in~cond| 0))} {2703#(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; {2696#(or (and (<= 0 main_~y~0) (= (mod main_~y~0 2) 1)) (and (or (= (mod main_~y~0 2) 0) (= (+ main_~z~0 (* (* main_~x~0 2) (+ (div main_~y~0 2) 1))) (* main_~b~0 main_~a~0))) (or (= (+ main_~z~0 (* (* main_~x~0 2) (div main_~y~0 2))) (* main_~b~0 main_~a~0)) (not (= (mod main_~y~0 2) 0)))))} is VALID [2022-04-07 15:19:08,725 INFO L290 TraceCheckUtils]: 45: Hoare triple {2610#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {2610#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-07 15:19:08,725 INFO L290 TraceCheckUtils]: 44: Hoare triple {2713#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} assume !(0 == ~cond); {2610#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-07 15:19:08,726 INFO L290 TraceCheckUtils]: 43: Hoare triple {2495#true} ~cond := #in~cond; {2713#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-07 15:19:08,726 INFO L272 TraceCheckUtils]: 42: Hoare triple {2703#(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)); {2495#true} is VALID [2022-04-07 15:19:08,726 INFO L290 TraceCheckUtils]: 41: Hoare triple {2703#(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; {2703#(or (<= 0 main_~y~0) (not (= (+ main_~z~0 (* main_~y~0 main_~x~0)) (* main_~b~0 main_~a~0))) (= (mod main_~y~0 2) 0) (= (+ main_~z~0 (* (* main_~x~0 2) (+ (div main_~y~0 2) 1))) (* main_~b~0 main_~a~0)))} is VALID [2022-04-07 15:19:08,760 INFO L290 TraceCheckUtils]: 40: Hoare triple {2723#(forall ((aux_div_aux_mod_v_main_~y~0_33_22_69 Int)) (or (= (* main_~b~0 main_~a~0) (+ (* (* main_~x~0 aux_div_aux_mod_v_main_~y~0_33_22_69) 4) main_~z~0 (* main_~x~0 4))) (and (or (not (= (+ main_~z~0 (* (* main_~x~0 2) (div main_~y~0 2))) (* main_~b~0 main_~a~0))) (not (= (mod main_~y~0 2) 0)) (<= (+ (* 2 aux_div_aux_mod_v_main_~y~0_33_22_69) 2) (div main_~y~0 2)) (<= 0 (div main_~y~0 2)) (< (div main_~y~0 2) (* 2 aux_div_aux_mod_v_main_~y~0_33_22_69)) (<= (div (- (div main_~y~0 2)) (- 2)) (+ (div (+ (- 2) (div main_~y~0 2)) 2) 1))) (or (< (+ (div main_~y~0 2) 1) (* 2 aux_div_aux_mod_v_main_~y~0_33_22_69)) (not (< main_~y~0 0)) (= (mod main_~y~0 2) 0) (<= (+ (* 2 aux_div_aux_mod_v_main_~y~0_33_22_69) 1) (div main_~y~0 2)) (not (= (* main_~b~0 main_~a~0) (+ (* main_~x~0 2) (* 2 (* (div main_~y~0 2) main_~x~0)) main_~z~0))) (<= (div (+ (- 1) (* (- 1) (div main_~y~0 2))) (- 2)) (+ (div (+ (- 1) (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); {2703#(or (<= 0 main_~y~0) (not (= (+ main_~z~0 (* main_~y~0 main_~x~0)) (* main_~b~0 main_~a~0))) (= (mod main_~y~0 2) 0) (= (+ main_~z~0 (* (* main_~x~0 2) (+ (div main_~y~0 2) 1))) (* main_~b~0 main_~a~0)))} is VALID [2022-04-07 15:19:08,762 INFO L290 TraceCheckUtils]: 39: Hoare triple {2495#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; {2723#(forall ((aux_div_aux_mod_v_main_~y~0_33_22_69 Int)) (or (= (* main_~b~0 main_~a~0) (+ (* (* main_~x~0 aux_div_aux_mod_v_main_~y~0_33_22_69) 4) main_~z~0 (* main_~x~0 4))) (and (or (not (= (+ main_~z~0 (* (* main_~x~0 2) (div main_~y~0 2))) (* main_~b~0 main_~a~0))) (not (= (mod main_~y~0 2) 0)) (<= (+ (* 2 aux_div_aux_mod_v_main_~y~0_33_22_69) 2) (div main_~y~0 2)) (<= 0 (div main_~y~0 2)) (< (div main_~y~0 2) (* 2 aux_div_aux_mod_v_main_~y~0_33_22_69)) (<= (div (- (div main_~y~0 2)) (- 2)) (+ (div (+ (- 2) (div main_~y~0 2)) 2) 1))) (or (< (+ (div main_~y~0 2) 1) (* 2 aux_div_aux_mod_v_main_~y~0_33_22_69)) (not (< main_~y~0 0)) (= (mod main_~y~0 2) 0) (<= (+ (* 2 aux_div_aux_mod_v_main_~y~0_33_22_69) 1) (div main_~y~0 2)) (not (= (* main_~b~0 main_~a~0) (+ (* main_~x~0 2) (* 2 (* (div main_~y~0 2) main_~x~0)) main_~z~0))) (<= (div (+ (- 1) (* (- 1) (div main_~y~0 2))) (- 2)) (+ (div (+ (- 1) (div main_~y~0 2)) 2) 1))))))} is VALID [2022-04-07 15:19:08,762 INFO L290 TraceCheckUtils]: 38: Hoare triple {2495#true} assume !!(0 != ~y~0); {2495#true} is VALID [2022-04-07 15:19:08,762 INFO L284 TraceCheckUtils]: 37: Hoare quadruple {2495#true} {2495#true} #67#return; {2495#true} is VALID [2022-04-07 15:19:08,762 INFO L290 TraceCheckUtils]: 36: Hoare triple {2495#true} assume true; {2495#true} is VALID [2022-04-07 15:19:08,762 INFO L290 TraceCheckUtils]: 35: Hoare triple {2495#true} assume !(0 == ~cond); {2495#true} is VALID [2022-04-07 15:19:08,762 INFO L290 TraceCheckUtils]: 34: Hoare triple {2495#true} ~cond := #in~cond; {2495#true} is VALID [2022-04-07 15:19:08,763 INFO L272 TraceCheckUtils]: 33: Hoare triple {2495#true} call __VERIFIER_assert((if ~z~0 + ~x~0 * ~y~0 == ~a~0 * ~b~0 then 1 else 0)); {2495#true} is VALID [2022-04-07 15:19:08,763 INFO L290 TraceCheckUtils]: 32: Hoare triple {2495#true} assume !false; {2495#true} is VALID [2022-04-07 15:19:08,763 INFO L290 TraceCheckUtils]: 31: Hoare triple {2495#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); {2495#true} is VALID [2022-04-07 15:19:08,763 INFO L290 TraceCheckUtils]: 30: Hoare triple {2495#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; {2495#true} is VALID [2022-04-07 15:19:08,763 INFO L290 TraceCheckUtils]: 29: Hoare triple {2495#true} assume !!(0 != ~y~0); {2495#true} is VALID [2022-04-07 15:19:08,763 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {2495#true} {2495#true} #67#return; {2495#true} is VALID [2022-04-07 15:19:08,763 INFO L290 TraceCheckUtils]: 27: Hoare triple {2495#true} assume true; {2495#true} is VALID [2022-04-07 15:19:08,763 INFO L290 TraceCheckUtils]: 26: Hoare triple {2495#true} assume !(0 == ~cond); {2495#true} is VALID [2022-04-07 15:19:08,763 INFO L290 TraceCheckUtils]: 25: Hoare triple {2495#true} ~cond := #in~cond; {2495#true} is VALID [2022-04-07 15:19:08,764 INFO L272 TraceCheckUtils]: 24: Hoare triple {2495#true} call __VERIFIER_assert((if ~z~0 + ~x~0 * ~y~0 == ~a~0 * ~b~0 then 1 else 0)); {2495#true} is VALID [2022-04-07 15:19:08,764 INFO L290 TraceCheckUtils]: 23: Hoare triple {2495#true} assume !false; {2495#true} is VALID [2022-04-07 15:19:08,764 INFO L290 TraceCheckUtils]: 22: Hoare triple {2495#true} ~x~0 := ~a~0;~y~0 := ~b~0;~z~0 := 0; {2495#true} is VALID [2022-04-07 15:19:08,764 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {2495#true} {2495#true} #65#return; {2495#true} is VALID [2022-04-07 15:19:08,764 INFO L290 TraceCheckUtils]: 20: Hoare triple {2495#true} assume true; {2495#true} is VALID [2022-04-07 15:19:08,764 INFO L290 TraceCheckUtils]: 19: Hoare triple {2495#true} assume !(0 == ~cond); {2495#true} is VALID [2022-04-07 15:19:08,764 INFO L290 TraceCheckUtils]: 18: Hoare triple {2495#true} ~cond := #in~cond; {2495#true} is VALID [2022-04-07 15:19:08,764 INFO L272 TraceCheckUtils]: 17: Hoare triple {2495#true} call assume_abort_if_not((if ~b~0 >= 1 then 1 else 0)); {2495#true} is VALID [2022-04-07 15:19:08,764 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {2495#true} {2495#true} #63#return; {2495#true} is VALID [2022-04-07 15:19:08,764 INFO L290 TraceCheckUtils]: 15: Hoare triple {2495#true} assume true; {2495#true} is VALID [2022-04-07 15:19:08,765 INFO L290 TraceCheckUtils]: 14: Hoare triple {2495#true} assume !(0 == ~cond); {2495#true} is VALID [2022-04-07 15:19:08,765 INFO L290 TraceCheckUtils]: 13: Hoare triple {2495#true} ~cond := #in~cond; {2495#true} is VALID [2022-04-07 15:19:08,765 INFO L272 TraceCheckUtils]: 12: Hoare triple {2495#true} call assume_abort_if_not((if ~b~0 >= 0 && ~b~0 <= 50 then 1 else 0)); {2495#true} is VALID [2022-04-07 15:19:08,765 INFO L290 TraceCheckUtils]: 11: Hoare triple {2495#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~b~0 := #t~nondet5;havoc #t~nondet5; {2495#true} is VALID [2022-04-07 15:19:08,765 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {2495#true} {2495#true} #61#return; {2495#true} is VALID [2022-04-07 15:19:08,765 INFO L290 TraceCheckUtils]: 9: Hoare triple {2495#true} assume true; {2495#true} is VALID [2022-04-07 15:19:08,765 INFO L290 TraceCheckUtils]: 8: Hoare triple {2495#true} assume !(0 == ~cond); {2495#true} is VALID [2022-04-07 15:19:08,765 INFO L290 TraceCheckUtils]: 7: Hoare triple {2495#true} ~cond := #in~cond; {2495#true} is VALID [2022-04-07 15:19:08,765 INFO L272 TraceCheckUtils]: 6: Hoare triple {2495#true} call assume_abort_if_not((if ~a~0 >= 0 && ~a~0 <= 50 then 1 else 0)); {2495#true} is VALID [2022-04-07 15:19:08,765 INFO L290 TraceCheckUtils]: 5: Hoare triple {2495#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; {2495#true} is VALID [2022-04-07 15:19:08,766 INFO L272 TraceCheckUtils]: 4: Hoare triple {2495#true} call #t~ret6 := main(); {2495#true} is VALID [2022-04-07 15:19:08,766 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2495#true} {2495#true} #71#return; {2495#true} is VALID [2022-04-07 15:19:08,766 INFO L290 TraceCheckUtils]: 2: Hoare triple {2495#true} assume true; {2495#true} is VALID [2022-04-07 15:19:08,766 INFO L290 TraceCheckUtils]: 1: Hoare triple {2495#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); {2495#true} is VALID [2022-04-07 15:19:08,766 INFO L272 TraceCheckUtils]: 0: Hoare triple {2495#true} call ULTIMATE.init(); {2495#true} is VALID [2022-04-07 15:19:08,766 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 25 proven. 4 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2022-04-07 15:19:08,766 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 15:19:08,767 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1861744171] [2022-04-07 15:19:08,767 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-07 15:19:08,767 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [789942408] [2022-04-07 15:19:08,767 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [789942408] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-07 15:19:08,767 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-07 15:19:08,767 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 11] total 22 [2022-04-07 15:19:08,767 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [775453372] [2022-04-07 15:19:08,767 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-07 15:19:08,768 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 2.0) internal successors, (44), 20 states have internal predecessors, (44), 7 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (9), 5 states have call predecessors, (9), 5 states have call successors, (9) Word has length 55 [2022-04-07 15:19:08,768 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 15:19:08,769 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 22 states, 22 states have (on average 2.0) internal successors, (44), 20 states have internal predecessors, (44), 7 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (9), 5 states have call predecessors, (9), 5 states have call successors, (9) [2022-04-07 15:19:09,468 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 65 edges. 65 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 15:19:09,469 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-04-07 15:19:09,469 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 15:19:09,469 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-04-07 15:19:09,469 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=379, Unknown=0, NotChecked=0, Total=462 [2022-04-07 15:19:09,470 INFO L87 Difference]: Start difference. First operand 70 states and 80 transitions. Second operand has 22 states, 22 states have (on average 2.0) internal successors, (44), 20 states have internal predecessors, (44), 7 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (9), 5 states have call predecessors, (9), 5 states have call successors, (9) [2022-04-07 15:19:23,999 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-07 15:19:32,976 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.52s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-07 15:19:38,844 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-07 15:19:53,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 15:19:53,678 INFO L93 Difference]: Finished difference Result 94 states and 110 transitions. [2022-04-07 15:19:53,678 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-04-07 15:19:53,678 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 2.0) internal successors, (44), 20 states have internal predecessors, (44), 7 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (9), 5 states have call predecessors, (9), 5 states have call successors, (9) Word has length 55 [2022-04-07 15:19:53,679 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 15:19:53,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 22 states have (on average 2.0) internal successors, (44), 20 states have internal predecessors, (44), 7 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (9), 5 states have call predecessors, (9), 5 states have call successors, (9) [2022-04-07 15:19:53,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 75 transitions. [2022-04-07 15:19:53,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 22 states have (on average 2.0) internal successors, (44), 20 states have internal predecessors, (44), 7 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (9), 5 states have call predecessors, (9), 5 states have call successors, (9) [2022-04-07 15:19:53,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 75 transitions. [2022-04-07 15:19:53,683 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 21 states and 75 transitions. [2022-04-07 15:19:56,556 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 75 edges. 75 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 15:19:56,558 INFO L225 Difference]: With dead ends: 94 [2022-04-07 15:19:56,558 INFO L226 Difference]: Without dead ends: 92 [2022-04-07 15:19:56,558 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 88 SyntacticMatches, 3 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 188 ImplicationChecksByTransitivity, 12.2s TimeCoverageRelationStatistics Valid=171, Invalid=820, Unknown=1, NotChecked=0, Total=992 [2022-04-07 15:19:56,559 INFO L913 BasicCegarLoop]: 27 mSDtfsCounter, 41 mSDsluCounter, 217 mSDsCounter, 0 mSdLazyCounter, 441 mSolverCounterSat, 26 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 15.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 244 SdHoareTripleChecker+Invalid, 498 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 441 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 29 IncrementalHoareTripleChecker+Unchecked, 15.1s IncrementalHoareTripleChecker+Time [2022-04-07 15:19:56,559 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [43 Valid, 244 Invalid, 498 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 441 Invalid, 2 Unknown, 29 Unchecked, 15.1s Time] [2022-04-07 15:19:56,560 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2022-04-07 15:19:56,592 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 75. [2022-04-07 15:19:56,592 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 15:19:56,592 INFO L82 GeneralOperation]: Start isEquivalent. First operand 92 states. Second operand has 75 states, 53 states have (on average 1.1320754716981132) internal successors, (60), 56 states have internal predecessors, (60), 14 states have call successors, (14), 8 states have call predecessors, (14), 7 states have return successors, (13), 10 states have call predecessors, (13), 13 states have call successors, (13) [2022-04-07 15:19:56,592 INFO L74 IsIncluded]: Start isIncluded. First operand 92 states. Second operand has 75 states, 53 states have (on average 1.1320754716981132) internal successors, (60), 56 states have internal predecessors, (60), 14 states have call successors, (14), 8 states have call predecessors, (14), 7 states have return successors, (13), 10 states have call predecessors, (13), 13 states have call successors, (13) [2022-04-07 15:19:56,592 INFO L87 Difference]: Start difference. First operand 92 states. Second operand has 75 states, 53 states have (on average 1.1320754716981132) internal successors, (60), 56 states have internal predecessors, (60), 14 states have call successors, (14), 8 states have call predecessors, (14), 7 states have return successors, (13), 10 states have call predecessors, (13), 13 states have call successors, (13) [2022-04-07 15:19:56,595 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 15:19:56,596 INFO L93 Difference]: Finished difference Result 92 states and 108 transitions. [2022-04-07 15:19:56,596 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 108 transitions. [2022-04-07 15:19:56,596 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 15:19:56,596 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 15:19:56,597 INFO L74 IsIncluded]: Start isIncluded. First operand has 75 states, 53 states have (on average 1.1320754716981132) internal successors, (60), 56 states have internal predecessors, (60), 14 states have call successors, (14), 8 states have call predecessors, (14), 7 states have return successors, (13), 10 states have call predecessors, (13), 13 states have call successors, (13) Second operand 92 states. [2022-04-07 15:19:56,597 INFO L87 Difference]: Start difference. First operand has 75 states, 53 states have (on average 1.1320754716981132) internal successors, (60), 56 states have internal predecessors, (60), 14 states have call successors, (14), 8 states have call predecessors, (14), 7 states have return successors, (13), 10 states have call predecessors, (13), 13 states have call successors, (13) Second operand 92 states. [2022-04-07 15:19:56,600 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 15:19:56,600 INFO L93 Difference]: Finished difference Result 92 states and 108 transitions. [2022-04-07 15:19:56,600 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 108 transitions. [2022-04-07 15:19:56,600 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 15:19:56,600 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 15:19:56,600 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 15:19:56,601 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 15:19:56,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 53 states have (on average 1.1320754716981132) internal successors, (60), 56 states have internal predecessors, (60), 14 states have call successors, (14), 8 states have call predecessors, (14), 7 states have return successors, (13), 10 states have call predecessors, (13), 13 states have call successors, (13) [2022-04-07 15:19:56,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 87 transitions. [2022-04-07 15:19:56,603 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 87 transitions. Word has length 55 [2022-04-07 15:19:56,603 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 15:19:56,603 INFO L478 AbstractCegarLoop]: Abstraction has 75 states and 87 transitions. [2022-04-07 15:19:56,604 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 2.0) internal successors, (44), 20 states have internal predecessors, (44), 7 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (9), 5 states have call predecessors, (9), 5 states have call successors, (9) [2022-04-07 15:19:56,604 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 87 transitions. [2022-04-07 15:19:56,604 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2022-04-07 15:19:56,605 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 15:19:56,605 INFO L499 BasicCegarLoop]: trace histogram [5, 5, 5, 4, 4, 4, 4, 4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-07 15:19:56,622 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-07 15:19:56,811 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 15:19:56,811 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 15:19:56,812 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 15:19:56,812 INFO L85 PathProgramCache]: Analyzing trace with hash -699618950, now seen corresponding path program 2 times [2022-04-07 15:19:56,812 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 15:19:56,812 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [952894367] [2022-04-07 15:19:56,812 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 15:19:56,812 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 15:19:56,829 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-07 15:19:56,829 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1270676642] [2022-04-07 15:19:56,829 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-07 15:19:56,830 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 15:19:56,830 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-07 15:19:56,830 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-07 15:19:56,834 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-04-07 15:19:56,879 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-07 15:19:56,880 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-07 15:19:56,881 INFO L263 TraceCheckSpWp]: Trace formula consists of 159 conjuncts, 54 conjunts are in the unsatisfiable core [2022-04-07 15:19:56,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 15:19:56,902 INFO L286 TraceCheckSpWp]: Computing forward predicates...