/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_valuebound1.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-fb4f59a-m [2022-04-27 14:27:05,803 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-27 14:27:05,804 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-27 14:27:05,833 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-27 14:27:05,833 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-27 14:27:05,834 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-27 14:27:05,835 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-27 14:27:05,836 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-27 14:27:05,837 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-27 14:27:05,837 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-27 14:27:05,838 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-27 14:27:05,838 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-27 14:27:05,838 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-27 14:27:05,839 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-27 14:27:05,840 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-27 14:27:05,840 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-27 14:27:05,841 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-27 14:27:05,841 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-27 14:27:05,842 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-27 14:27:05,843 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-27 14:27:05,844 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-27 14:27:05,845 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-27 14:27:05,845 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-27 14:27:05,846 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-27 14:27:05,846 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-27 14:27:05,848 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-27 14:27:05,848 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-27 14:27:05,849 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-27 14:27:05,849 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-27 14:27:05,849 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-27 14:27:05,850 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-27 14:27:05,850 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-27 14:27:05,850 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-27 14:27:05,851 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-27 14:27:05,851 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-27 14:27:05,852 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-27 14:27:05,852 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-27 14:27:05,852 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-27 14:27:05,852 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-27 14:27:05,853 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-27 14:27:05,853 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-27 14:27:05,854 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-27 14:27:05,854 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2022-04-27 14:27:05,867 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-27 14:27:05,867 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-27 14:27:05,868 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-04-27 14:27:05,868 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-04-27 14:27:05,868 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-04-27 14:27:05,868 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-04-27 14:27:05,869 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-04-27 14:27:05,869 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-04-27 14:27:05,869 INFO L138 SettingsManager]: * Use SBE=true [2022-04-27 14:27:05,869 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-27 14:27:05,869 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-27 14:27:05,869 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-27 14:27:05,869 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-27 14:27:05,869 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-27 14:27:05,869 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-27 14:27:05,869 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-27 14:27:05,870 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-27 14:27:05,870 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-27 14:27:05,870 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-27 14:27:05,870 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-27 14:27:05,870 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-27 14:27:05,870 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-27 14:27:05,870 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-27 14:27:05,870 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-27 14:27:05,870 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-27 14:27:05,870 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-27 14:27:05,871 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-04-27 14:27:05,871 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-04-27 14:27:05,871 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-04-27 14:27:05,873 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-04-27 14:27:05,873 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-04-27 14:27:05,873 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-04-27 14:27:05,873 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-27 14:27:05,874 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.core: Log level for class -> de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN; [2022-04-27 14:27:06,026 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-27 14:27:06,045 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-27 14:27:06,046 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-27 14:27:06,048 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-27 14:27:06,049 INFO L275 PluginConnector]: CDTParser initialized [2022-04-27 14:27:06,050 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/nla-digbench-scaling/prodbin-ll_valuebound1.c [2022-04-27 14:27:06,113 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/013a1317b/0c6381cb901e45b3b37134b810de8a82/FLAG99397ad94 [2022-04-27 14:27:06,467 INFO L306 CDTParser]: Found 1 translation units. [2022-04-27 14:27:06,468 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/prodbin-ll_valuebound1.c [2022-04-27 14:27:06,471 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/013a1317b/0c6381cb901e45b3b37134b810de8a82/FLAG99397ad94 [2022-04-27 14:27:06,480 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/013a1317b/0c6381cb901e45b3b37134b810de8a82 [2022-04-27 14:27:06,482 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-27 14:27:06,484 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-27 14:27:06,485 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-27 14:27:06,486 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-27 14:27:06,488 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-27 14:27:06,488 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.04 02:27:06" (1/1) ... [2022-04-27 14:27:06,489 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7f632b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 02:27:06, skipping insertion in model container [2022-04-27 14:27:06,489 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.04 02:27:06" (1/1) ... [2022-04-27 14:27:06,493 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-27 14:27:06,503 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-27 14:27:06,630 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_valuebound1.c[537,550] [2022-04-27 14:27:06,640 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-27 14:27:06,645 INFO L203 MainTranslator]: Completed pre-run [2022-04-27 14:27:06,653 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_valuebound1.c[537,550] [2022-04-27 14:27:06,657 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-27 14:27:06,665 INFO L208 MainTranslator]: Completed translation [2022-04-27 14:27:06,666 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 02:27:06 WrapperNode [2022-04-27 14:27:06,666 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-27 14:27:06,667 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-27 14:27:06,667 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-27 14:27:06,667 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-27 14:27:06,673 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 02:27:06" (1/1) ... [2022-04-27 14:27:06,674 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 02:27:06" (1/1) ... [2022-04-27 14:27:06,677 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 02:27:06" (1/1) ... [2022-04-27 14:27:06,678 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 02:27:06" (1/1) ... [2022-04-27 14:27:06,682 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 02:27:06" (1/1) ... [2022-04-27 14:27:06,689 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 02:27:06" (1/1) ... [2022-04-27 14:27:06,690 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 02:27:06" (1/1) ... [2022-04-27 14:27:06,691 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-27 14:27:06,691 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-27 14:27:06,691 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-27 14:27:06,692 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-27 14:27:06,696 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 02:27:06" (1/1) ... [2022-04-27 14:27:06,702 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-27 14:27:06,710 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 14:27:06,727 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-04-27 14:27:06,733 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-04-27 14:27:06,761 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-27 14:27:06,762 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-27 14:27:06,762 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-27 14:27:06,762 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-27 14:27:06,764 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-27 14:27:06,764 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-27 14:27:06,764 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-27 14:27:06,764 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-27 14:27:06,764 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-27 14:27:06,765 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-27 14:27:06,765 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-04-27 14:27:06,765 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-27 14:27:06,765 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-27 14:27:06,765 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-27 14:27:06,765 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-27 14:27:06,765 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-27 14:27:06,766 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-27 14:27:06,766 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-27 14:27:06,766 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-27 14:27:06,766 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-27 14:27:06,813 INFO L234 CfgBuilder]: Building ICFG [2022-04-27 14:27:06,815 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-27 14:27:06,971 INFO L275 CfgBuilder]: Performing block encoding [2022-04-27 14:27:06,976 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-27 14:27:06,976 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-27 14:27:06,977 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.04 02:27:06 BoogieIcfgContainer [2022-04-27 14:27:06,977 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-27 14:27:06,978 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-27 14:27:06,978 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-27 14:27:06,990 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-27 14:27:06,990 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.04 02:27:06" (1/3) ... [2022-04-27 14:27:06,990 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3396728e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.04 02:27:06, skipping insertion in model container [2022-04-27 14:27:06,991 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 02:27:06" (2/3) ... [2022-04-27 14:27:06,991 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3396728e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.04 02:27:06, skipping insertion in model container [2022-04-27 14:27:06,991 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.04 02:27:06" (3/3) ... [2022-04-27 14:27:06,992 INFO L111 eAbstractionObserver]: Analyzing ICFG prodbin-ll_valuebound1.c [2022-04-27 14:27:07,001 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-04-27 14:27:07,001 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-27 14:27:07,038 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-27 14:27:07,042 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@60f0b816, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@6869b7c0 [2022-04-27 14:27:07,042 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-27 14:27:07,050 INFO L276 IsEmpty]: Start isEmpty. Operand has 32 states, 19 states have (on average 1.368421052631579) internal successors, (26), 20 states have internal predecessors, (26), 7 states have call successors, (7), 4 states have call predecessors, (7), 4 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-27 14:27:07,059 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-04-27 14:27:07,059 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 14:27:07,060 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 14:27:07,060 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 14:27:07,064 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 14:27:07,064 INFO L85 PathProgramCache]: Analyzing trace with hash -589322634, now seen corresponding path program 1 times [2022-04-27 14:27:07,071 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 14:27:07,071 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1674685957] [2022-04-27 14:27:07,071 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 14:27:07,072 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 14:27:07,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 14:27:07,191 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 14:27:07,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 14:27:07,211 INFO L290 TraceCheckUtils]: 0: Hoare triple {52#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {35#true} is VALID [2022-04-27 14:27:07,211 INFO L290 TraceCheckUtils]: 1: Hoare triple {35#true} assume true; {35#true} is VALID [2022-04-27 14:27:07,212 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {35#true} {35#true} #71#return; {35#true} is VALID [2022-04-27 14:27:07,212 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-27 14:27:07,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 14:27:07,241 INFO L290 TraceCheckUtils]: 0: Hoare triple {35#true} ~cond := #in~cond; {35#true} is VALID [2022-04-27 14:27:07,242 INFO L290 TraceCheckUtils]: 1: Hoare triple {35#true} assume 0 == ~cond;assume false; {36#false} is VALID [2022-04-27 14:27:07,242 INFO L290 TraceCheckUtils]: 2: Hoare triple {36#false} assume true; {36#false} is VALID [2022-04-27 14:27:07,242 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {36#false} {35#true} #61#return; {36#false} is VALID [2022-04-27 14:27:07,243 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-04-27 14:27:07,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 14:27:07,252 INFO L290 TraceCheckUtils]: 0: Hoare triple {35#true} ~cond := #in~cond; {35#true} is VALID [2022-04-27 14:27:07,253 INFO L290 TraceCheckUtils]: 1: Hoare triple {35#true} assume 0 == ~cond;assume false; {36#false} is VALID [2022-04-27 14:27:07,253 INFO L290 TraceCheckUtils]: 2: Hoare triple {36#false} assume true; {36#false} is VALID [2022-04-27 14:27:07,253 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {36#false} {36#false} #63#return; {36#false} is VALID [2022-04-27 14:27:07,253 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-04-27 14:27:07,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 14:27:07,266 INFO L290 TraceCheckUtils]: 0: Hoare triple {35#true} ~cond := #in~cond; {35#true} is VALID [2022-04-27 14:27:07,267 INFO L290 TraceCheckUtils]: 1: Hoare triple {35#true} assume 0 == ~cond;assume false; {36#false} is VALID [2022-04-27 14:27:07,267 INFO L290 TraceCheckUtils]: 2: Hoare triple {36#false} assume true; {36#false} is VALID [2022-04-27 14:27:07,267 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {36#false} {36#false} #65#return; {36#false} is VALID [2022-04-27 14:27:07,269 INFO L272 TraceCheckUtils]: 0: Hoare triple {35#true} call ULTIMATE.init(); {52#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 14:27:07,269 INFO L290 TraceCheckUtils]: 1: Hoare triple {52#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {35#true} is VALID [2022-04-27 14:27:07,269 INFO L290 TraceCheckUtils]: 2: Hoare triple {35#true} assume true; {35#true} is VALID [2022-04-27 14:27:07,269 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {35#true} {35#true} #71#return; {35#true} is VALID [2022-04-27 14:27:07,269 INFO L272 TraceCheckUtils]: 4: Hoare triple {35#true} call #t~ret6 := main(); {35#true} is VALID [2022-04-27 14:27:07,270 INFO L290 TraceCheckUtils]: 5: Hoare triple {35#true} havoc ~a~0;havoc ~b~0;havoc ~x~0;havoc ~y~0;havoc ~z~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~a~0 := #t~nondet4;havoc #t~nondet4; {35#true} is VALID [2022-04-27 14:27:07,270 INFO L272 TraceCheckUtils]: 6: Hoare triple {35#true} call assume_abort_if_not((if ~a~0 >= 0 && ~a~0 <= 1 then 1 else 0)); {35#true} is VALID [2022-04-27 14:27:07,270 INFO L290 TraceCheckUtils]: 7: Hoare triple {35#true} ~cond := #in~cond; {35#true} is VALID [2022-04-27 14:27:07,276 INFO L290 TraceCheckUtils]: 8: Hoare triple {35#true} assume 0 == ~cond;assume false; {36#false} is VALID [2022-04-27 14:27:07,276 INFO L290 TraceCheckUtils]: 9: Hoare triple {36#false} assume true; {36#false} is VALID [2022-04-27 14:27:07,276 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {36#false} {35#true} #61#return; {36#false} is VALID [2022-04-27 14:27:07,276 INFO L290 TraceCheckUtils]: 11: Hoare triple {36#false} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~b~0 := #t~nondet5;havoc #t~nondet5; {36#false} is VALID [2022-04-27 14:27:07,276 INFO L272 TraceCheckUtils]: 12: Hoare triple {36#false} call assume_abort_if_not((if ~b~0 >= 0 && ~b~0 <= 1 then 1 else 0)); {35#true} is VALID [2022-04-27 14:27:07,276 INFO L290 TraceCheckUtils]: 13: Hoare triple {35#true} ~cond := #in~cond; {35#true} is VALID [2022-04-27 14:27:07,277 INFO L290 TraceCheckUtils]: 14: Hoare triple {35#true} assume 0 == ~cond;assume false; {36#false} is VALID [2022-04-27 14:27:07,277 INFO L290 TraceCheckUtils]: 15: Hoare triple {36#false} assume true; {36#false} is VALID [2022-04-27 14:27:07,277 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {36#false} {36#false} #63#return; {36#false} is VALID [2022-04-27 14:27:07,277 INFO L272 TraceCheckUtils]: 17: Hoare triple {36#false} call assume_abort_if_not((if ~b~0 >= 1 then 1 else 0)); {35#true} is VALID [2022-04-27 14:27:07,277 INFO L290 TraceCheckUtils]: 18: Hoare triple {35#true} ~cond := #in~cond; {35#true} is VALID [2022-04-27 14:27:07,278 INFO L290 TraceCheckUtils]: 19: Hoare triple {35#true} assume 0 == ~cond;assume false; {36#false} is VALID [2022-04-27 14:27:07,278 INFO L290 TraceCheckUtils]: 20: Hoare triple {36#false} assume true; {36#false} is VALID [2022-04-27 14:27:07,278 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {36#false} {36#false} #65#return; {36#false} is VALID [2022-04-27 14:27:07,278 INFO L290 TraceCheckUtils]: 22: Hoare triple {36#false} ~x~0 := ~a~0;~y~0 := ~b~0;~z~0 := 0; {36#false} is VALID [2022-04-27 14:27:07,279 INFO L290 TraceCheckUtils]: 23: Hoare triple {36#false} assume false; {36#false} is VALID [2022-04-27 14:27:07,279 INFO L272 TraceCheckUtils]: 24: Hoare triple {36#false} call __VERIFIER_assert((if ~z~0 == ~a~0 * ~b~0 then 1 else 0)); {36#false} is VALID [2022-04-27 14:27:07,279 INFO L290 TraceCheckUtils]: 25: Hoare triple {36#false} ~cond := #in~cond; {36#false} is VALID [2022-04-27 14:27:07,279 INFO L290 TraceCheckUtils]: 26: Hoare triple {36#false} assume 0 == ~cond; {36#false} is VALID [2022-04-27 14:27:07,279 INFO L290 TraceCheckUtils]: 27: Hoare triple {36#false} assume !false; {36#false} is VALID [2022-04-27 14:27:07,280 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-04-27 14:27:07,280 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 14:27:07,280 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1674685957] [2022-04-27 14:27:07,281 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1674685957] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 14:27:07,281 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 14:27:07,281 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-27 14:27:07,282 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [43367535] [2022-04-27 14:27:07,282 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 14:27:07,286 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 28 [2022-04-27 14:27:07,287 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 14:27:07,289 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-27 14:27:07,335 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 22 edges. 22 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 14:27:07,335 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-27 14:27:07,336 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 14:27:07,353 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-27 14:27:07,353 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-27 14:27:07,355 INFO L87 Difference]: Start difference. First operand has 32 states, 19 states have (on average 1.368421052631579) internal successors, (26), 20 states have internal predecessors, (26), 7 states have call successors, (7), 4 states have call predecessors, (7), 4 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Second operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-27 14:27:07,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:27:07,459 INFO L93 Difference]: Finished difference Result 57 states and 77 transitions. [2022-04-27 14:27:07,459 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-27 14:27:07,460 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 28 [2022-04-27 14:27:07,460 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 14:27:07,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-27 14:27:07,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 77 transitions. [2022-04-27 14:27:07,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-27 14:27:07,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 77 transitions. [2022-04-27 14:27:07,471 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 77 transitions. [2022-04-27 14:27:07,537 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 77 edges. 77 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 14:27:07,542 INFO L225 Difference]: With dead ends: 57 [2022-04-27 14:27:07,543 INFO L226 Difference]: Without dead ends: 27 [2022-04-27 14:27:07,544 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-27 14:27:07,547 INFO L413 NwaCegarLoop]: 31 mSDtfsCounter, 19 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 34 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 14:27:07,547 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 34 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 14:27:07,558 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2022-04-27 14:27:07,572 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2022-04-27 14:27:07,573 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 14:27:07,574 INFO L82 GeneralOperation]: Start isEquivalent. First operand 27 states. Second operand has 27 states, 16 states have (on average 1.1875) internal successors, (19), 17 states have internal predecessors, (19), 7 states have call successors, (7), 4 states have call predecessors, (7), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-27 14:27:07,575 INFO L74 IsIncluded]: Start isIncluded. First operand 27 states. Second operand has 27 states, 16 states have (on average 1.1875) internal successors, (19), 17 states have internal predecessors, (19), 7 states have call successors, (7), 4 states have call predecessors, (7), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-27 14:27:07,575 INFO L87 Difference]: Start difference. First operand 27 states. Second operand has 27 states, 16 states have (on average 1.1875) internal successors, (19), 17 states have internal predecessors, (19), 7 states have call successors, (7), 4 states have call predecessors, (7), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-27 14:27:07,582 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:27:07,582 INFO L93 Difference]: Finished difference Result 27 states and 31 transitions. [2022-04-27 14:27:07,582 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 31 transitions. [2022-04-27 14:27:07,583 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:27:07,583 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 14:27:07,584 INFO L74 IsIncluded]: Start isIncluded. First operand has 27 states, 16 states have (on average 1.1875) internal successors, (19), 17 states have internal predecessors, (19), 7 states have call successors, (7), 4 states have call predecessors, (7), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand 27 states. [2022-04-27 14:27:07,584 INFO L87 Difference]: Start difference. First operand has 27 states, 16 states have (on average 1.1875) internal successors, (19), 17 states have internal predecessors, (19), 7 states have call successors, (7), 4 states have call predecessors, (7), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand 27 states. [2022-04-27 14:27:07,588 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:27:07,588 INFO L93 Difference]: Finished difference Result 27 states and 31 transitions. [2022-04-27 14:27:07,589 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 31 transitions. [2022-04-27 14:27:07,589 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:27:07,589 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 14:27:07,589 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 14:27:07,590 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 14:27:07,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 16 states have (on average 1.1875) internal successors, (19), 17 states have internal predecessors, (19), 7 states have call successors, (7), 4 states have call predecessors, (7), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-27 14:27:07,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 31 transitions. [2022-04-27 14:27:07,600 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 31 transitions. Word has length 28 [2022-04-27 14:27:07,600 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 14:27:07,601 INFO L495 AbstractCegarLoop]: Abstraction has 27 states and 31 transitions. [2022-04-27 14:27:07,601 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-27 14:27:07,602 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 31 transitions. [2022-04-27 14:27:07,603 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-04-27 14:27:07,603 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 14:27:07,603 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 14:27:07,603 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-27 14:27:07,606 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 14:27:07,606 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 14:27:07,607 INFO L85 PathProgramCache]: Analyzing trace with hash -1736242504, now seen corresponding path program 1 times [2022-04-27 14:27:07,607 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 14:27:07,607 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [91196394] [2022-04-27 14:27:07,607 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 14:27:07,607 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 14:27:07,630 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 14:27:07,630 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [332469824] [2022-04-27 14:27:07,630 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 14:27:07,630 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 14:27:07,630 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 14:27:07,666 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-27 14:27:07,683 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-04-27 14:27:07,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 14:27:07,730 INFO L263 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 21 conjunts are in the unsatisfiable core [2022-04-27 14:27:07,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 14:27:07,742 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 14:27:08,008 INFO L272 TraceCheckUtils]: 0: Hoare triple {224#true} call ULTIMATE.init(); {224#true} is VALID [2022-04-27 14:27:08,008 INFO L290 TraceCheckUtils]: 1: Hoare triple {224#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {224#true} is VALID [2022-04-27 14:27:08,008 INFO L290 TraceCheckUtils]: 2: Hoare triple {224#true} assume true; {224#true} is VALID [2022-04-27 14:27:08,008 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {224#true} {224#true} #71#return; {224#true} is VALID [2022-04-27 14:27:08,009 INFO L272 TraceCheckUtils]: 4: Hoare triple {224#true} call #t~ret6 := main(); {224#true} is VALID [2022-04-27 14:27:08,009 INFO L290 TraceCheckUtils]: 5: Hoare triple {224#true} havoc ~a~0;havoc ~b~0;havoc ~x~0;havoc ~y~0;havoc ~z~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~a~0 := #t~nondet4;havoc #t~nondet4; {224#true} is VALID [2022-04-27 14:27:08,009 INFO L272 TraceCheckUtils]: 6: Hoare triple {224#true} call assume_abort_if_not((if ~a~0 >= 0 && ~a~0 <= 1 then 1 else 0)); {224#true} is VALID [2022-04-27 14:27:08,009 INFO L290 TraceCheckUtils]: 7: Hoare triple {224#true} ~cond := #in~cond; {224#true} is VALID [2022-04-27 14:27:08,009 INFO L290 TraceCheckUtils]: 8: Hoare triple {224#true} assume !(0 == ~cond); {224#true} is VALID [2022-04-27 14:27:08,009 INFO L290 TraceCheckUtils]: 9: Hoare triple {224#true} assume true; {224#true} is VALID [2022-04-27 14:27:08,009 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {224#true} {224#true} #61#return; {224#true} is VALID [2022-04-27 14:27:08,010 INFO L290 TraceCheckUtils]: 11: Hoare triple {224#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~b~0 := #t~nondet5;havoc #t~nondet5; {224#true} is VALID [2022-04-27 14:27:08,010 INFO L272 TraceCheckUtils]: 12: Hoare triple {224#true} call assume_abort_if_not((if ~b~0 >= 0 && ~b~0 <= 1 then 1 else 0)); {224#true} is VALID [2022-04-27 14:27:08,010 INFO L290 TraceCheckUtils]: 13: Hoare triple {224#true} ~cond := #in~cond; {268#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-04-27 14:27:08,010 INFO L290 TraceCheckUtils]: 14: Hoare triple {268#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} assume !(0 == ~cond); {272#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-27 14:27:08,011 INFO L290 TraceCheckUtils]: 15: Hoare triple {272#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {272#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-27 14:27:08,011 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {272#(not (= |assume_abort_if_not_#in~cond| 0))} {224#true} #63#return; {279#(and (<= main_~b~0 1) (<= 0 main_~b~0))} is VALID [2022-04-27 14:27:08,012 INFO L272 TraceCheckUtils]: 17: Hoare triple {279#(and (<= main_~b~0 1) (<= 0 main_~b~0))} call assume_abort_if_not((if ~b~0 >= 1 then 1 else 0)); {224#true} is VALID [2022-04-27 14:27:08,012 INFO L290 TraceCheckUtils]: 18: Hoare triple {224#true} ~cond := #in~cond; {268#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-04-27 14:27:08,012 INFO L290 TraceCheckUtils]: 19: Hoare triple {268#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} assume !(0 == ~cond); {272#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-27 14:27:08,013 INFO L290 TraceCheckUtils]: 20: Hoare triple {272#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {272#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-27 14:27:08,013 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {272#(not (= |assume_abort_if_not_#in~cond| 0))} {279#(and (<= main_~b~0 1) (<= 0 main_~b~0))} #65#return; {295#(and (<= main_~b~0 1) (<= 1 main_~b~0))} is VALID [2022-04-27 14:27:08,014 INFO L290 TraceCheckUtils]: 22: Hoare triple {295#(and (<= main_~b~0 1) (<= 1 main_~b~0))} ~x~0 := ~a~0;~y~0 := ~b~0;~z~0 := 0; {299#(and (= main_~z~0 0) (<= main_~b~0 1) (= main_~b~0 main_~y~0) (<= 1 main_~b~0) (= main_~a~0 main_~x~0))} is VALID [2022-04-27 14:27:08,014 INFO L290 TraceCheckUtils]: 23: Hoare triple {299#(and (= main_~z~0 0) (<= main_~b~0 1) (= main_~b~0 main_~y~0) (<= 1 main_~b~0) (= main_~a~0 main_~x~0))} assume !false; {299#(and (= main_~z~0 0) (<= main_~b~0 1) (= main_~b~0 main_~y~0) (<= 1 main_~b~0) (= main_~a~0 main_~x~0))} is VALID [2022-04-27 14:27:08,015 INFO L272 TraceCheckUtils]: 24: Hoare triple {299#(and (= main_~z~0 0) (<= main_~b~0 1) (= 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)); {306#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 14:27:08,016 INFO L290 TraceCheckUtils]: 25: Hoare triple {306#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {310#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 14:27:08,016 INFO L290 TraceCheckUtils]: 26: Hoare triple {310#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {225#false} is VALID [2022-04-27 14:27:08,016 INFO L290 TraceCheckUtils]: 27: Hoare triple {225#false} assume !false; {225#false} is VALID [2022-04-27 14:27:08,016 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-04-27 14:27:08,017 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-27 14:27:08,017 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 14:27:08,017 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [91196394] [2022-04-27 14:27:08,017 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 14:27:08,017 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [332469824] [2022-04-27 14:27:08,017 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [332469824] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 14:27:08,017 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 14:27:08,017 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-04-27 14:27:08,018 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1709762698] [2022-04-27 14:27:08,018 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 14:27:08,019 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 1.875) internal successors, (15), 6 states have internal predecessors, (15), 3 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) Word has length 28 [2022-04-27 14:27:08,019 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 14:27:08,019 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 9 states, 8 states have (on average 1.875) internal successors, (15), 6 states have internal predecessors, (15), 3 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-27 14:27:08,036 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 25 edges. 25 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 14:27:08,036 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-04-27 14:27:08,036 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 14:27:08,037 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-04-27 14:27:08,037 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2022-04-27 14:27:08,037 INFO L87 Difference]: Start difference. First operand 27 states and 31 transitions. Second operand has 9 states, 8 states have (on average 1.875) internal successors, (15), 6 states have internal predecessors, (15), 3 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-27 14:27:08,296 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:27:08,296 INFO L93 Difference]: Finished difference Result 47 states and 56 transitions. [2022-04-27 14:27:08,297 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-27 14:27:08,297 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 1.875) internal successors, (15), 6 states have internal predecessors, (15), 3 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) Word has length 28 [2022-04-27 14:27:08,297 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 14:27:08,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 8 states have (on average 1.875) internal successors, (15), 6 states have internal predecessors, (15), 3 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-27 14:27:08,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 56 transitions. [2022-04-27 14:27:08,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 8 states have (on average 1.875) internal successors, (15), 6 states have internal predecessors, (15), 3 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-27 14:27:08,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 56 transitions. [2022-04-27 14:27:08,302 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 9 states and 56 transitions. [2022-04-27 14:27:08,351 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 56 edges. 56 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 14:27:08,352 INFO L225 Difference]: With dead ends: 47 [2022-04-27 14:27:08,353 INFO L226 Difference]: Without dead ends: 35 [2022-04-27 14:27:08,353 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2022-04-27 14:27:08,354 INFO L413 NwaCegarLoop]: 22 mSDtfsCounter, 24 mSDsluCounter, 90 mSDsCounter, 0 mSdLazyCounter, 95 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 112 SdHoareTripleChecker+Invalid, 100 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 95 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-27 14:27:08,355 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 112 Invalid, 100 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 95 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-27 14:27:08,355 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2022-04-27 14:27:08,365 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2022-04-27 14:27:08,365 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 14:27:08,366 INFO L82 GeneralOperation]: Start isEquivalent. First operand 35 states. Second operand has 35 states, 22 states have (on average 1.1363636363636365) internal successors, (25), 23 states have internal predecessors, (25), 8 states have call successors, (8), 5 states have call predecessors, (8), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-27 14:27:08,366 INFO L74 IsIncluded]: Start isIncluded. First operand 35 states. Second operand has 35 states, 22 states have (on average 1.1363636363636365) internal successors, (25), 23 states have internal predecessors, (25), 8 states have call successors, (8), 5 states have call predecessors, (8), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-27 14:27:08,366 INFO L87 Difference]: Start difference. First operand 35 states. Second operand has 35 states, 22 states have (on average 1.1363636363636365) internal successors, (25), 23 states have internal predecessors, (25), 8 states have call successors, (8), 5 states have call predecessors, (8), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-27 14:27:08,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:27:08,369 INFO L93 Difference]: Finished difference Result 35 states and 39 transitions. [2022-04-27 14:27:08,369 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 39 transitions. [2022-04-27 14:27:08,369 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:27:08,369 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 14:27:08,370 INFO L74 IsIncluded]: Start isIncluded. First operand has 35 states, 22 states have (on average 1.1363636363636365) internal successors, (25), 23 states have internal predecessors, (25), 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 35 states. [2022-04-27 14:27:08,370 INFO L87 Difference]: Start difference. First operand has 35 states, 22 states have (on average 1.1363636363636365) internal successors, (25), 23 states have internal predecessors, (25), 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 35 states. [2022-04-27 14:27:08,372 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:27:08,372 INFO L93 Difference]: Finished difference Result 35 states and 39 transitions. [2022-04-27 14:27:08,372 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 39 transitions. [2022-04-27 14:27:08,373 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:27:08,373 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 14:27:08,373 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 14:27:08,373 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 14:27:08,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 22 states have (on average 1.1363636363636365) internal successors, (25), 23 states have internal predecessors, (25), 8 states have call successors, (8), 5 states have call predecessors, (8), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-27 14:27:08,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 39 transitions. [2022-04-27 14:27:08,375 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 39 transitions. Word has length 28 [2022-04-27 14:27:08,375 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 14:27:08,375 INFO L495 AbstractCegarLoop]: Abstraction has 35 states and 39 transitions. [2022-04-27 14:27:08,376 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 1.875) internal successors, (15), 6 states have internal predecessors, (15), 3 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-27 14:27:08,376 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 39 transitions. [2022-04-27 14:27:08,376 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-04-27 14:27:08,377 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 14:27:08,377 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 14:27:08,410 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-04-27 14:27:08,599 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 14:27:08,600 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 14:27:08,600 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 14:27:08,600 INFO L85 PathProgramCache]: Analyzing trace with hash 2022075506, now seen corresponding path program 1 times [2022-04-27 14:27:08,601 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 14:27:08,601 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1740008597] [2022-04-27 14:27:08,601 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 14:27:08,601 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 14:27:08,629 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 14:27:08,630 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1888598210] [2022-04-27 14:27:08,630 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 14:27:08,630 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 14:27:08,630 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 14:27:08,635 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-27 14:27:08,637 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-04-27 14:27:08,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 14:27:08,678 INFO L263 TraceCheckSpWp]: Trace formula consists of 111 conjuncts, 36 conjunts are in the unsatisfiable core [2022-04-27 14:27:08,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 14:27:08,695 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 14:27:09,516 INFO L272 TraceCheckUtils]: 0: Hoare triple {506#true} call ULTIMATE.init(); {506#true} is VALID [2022-04-27 14:27:09,516 INFO L290 TraceCheckUtils]: 1: Hoare triple {506#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); {506#true} is VALID [2022-04-27 14:27:09,517 INFO L290 TraceCheckUtils]: 2: Hoare triple {506#true} assume true; {506#true} is VALID [2022-04-27 14:27:09,517 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {506#true} {506#true} #71#return; {506#true} is VALID [2022-04-27 14:27:09,517 INFO L272 TraceCheckUtils]: 4: Hoare triple {506#true} call #t~ret6 := main(); {506#true} is VALID [2022-04-27 14:27:09,517 INFO L290 TraceCheckUtils]: 5: Hoare triple {506#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; {506#true} is VALID [2022-04-27 14:27:09,517 INFO L272 TraceCheckUtils]: 6: Hoare triple {506#true} call assume_abort_if_not((if ~a~0 >= 0 && ~a~0 <= 1 then 1 else 0)); {506#true} is VALID [2022-04-27 14:27:09,517 INFO L290 TraceCheckUtils]: 7: Hoare triple {506#true} ~cond := #in~cond; {532#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-04-27 14:27:09,518 INFO L290 TraceCheckUtils]: 8: Hoare triple {532#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} assume !(0 == ~cond); {536#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-27 14:27:09,518 INFO L290 TraceCheckUtils]: 9: Hoare triple {536#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {536#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-27 14:27:09,519 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {536#(not (= |assume_abort_if_not_#in~cond| 0))} {506#true} #61#return; {543#(and (<= main_~a~0 1) (<= 0 main_~a~0))} is VALID [2022-04-27 14:27:09,519 INFO L290 TraceCheckUtils]: 11: Hoare triple {543#(and (<= main_~a~0 1) (<= 0 main_~a~0))} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~b~0 := #t~nondet5;havoc #t~nondet5; {543#(and (<= main_~a~0 1) (<= 0 main_~a~0))} is VALID [2022-04-27 14:27:09,519 INFO L272 TraceCheckUtils]: 12: Hoare triple {543#(and (<= main_~a~0 1) (<= 0 main_~a~0))} call assume_abort_if_not((if ~b~0 >= 0 && ~b~0 <= 1 then 1 else 0)); {506#true} is VALID [2022-04-27 14:27:09,520 INFO L290 TraceCheckUtils]: 13: Hoare triple {506#true} ~cond := #in~cond; {532#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-04-27 14:27:09,520 INFO L290 TraceCheckUtils]: 14: Hoare triple {532#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} assume !(0 == ~cond); {536#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-27 14:27:09,521 INFO L290 TraceCheckUtils]: 15: Hoare triple {536#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {536#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-27 14:27:09,521 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {536#(not (= |assume_abort_if_not_#in~cond| 0))} {543#(and (<= main_~a~0 1) (<= 0 main_~a~0))} #63#return; {562#(and (<= main_~a~0 1) (<= main_~b~0 1) (<= 0 main_~a~0) (<= 0 main_~b~0))} is VALID [2022-04-27 14:27:09,522 INFO L272 TraceCheckUtils]: 17: Hoare triple {562#(and (<= main_~a~0 1) (<= main_~b~0 1) (<= 0 main_~a~0) (<= 0 main_~b~0))} call assume_abort_if_not((if ~b~0 >= 1 then 1 else 0)); {506#true} is VALID [2022-04-27 14:27:09,522 INFO L290 TraceCheckUtils]: 18: Hoare triple {506#true} ~cond := #in~cond; {506#true} is VALID [2022-04-27 14:27:09,522 INFO L290 TraceCheckUtils]: 19: Hoare triple {506#true} assume !(0 == ~cond); {506#true} is VALID [2022-04-27 14:27:09,522 INFO L290 TraceCheckUtils]: 20: Hoare triple {506#true} assume true; {506#true} is VALID [2022-04-27 14:27:09,523 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {506#true} {562#(and (<= main_~a~0 1) (<= main_~b~0 1) (<= 0 main_~a~0) (<= 0 main_~b~0))} #65#return; {562#(and (<= main_~a~0 1) (<= main_~b~0 1) (<= 0 main_~a~0) (<= 0 main_~b~0))} is VALID [2022-04-27 14:27:09,524 INFO L290 TraceCheckUtils]: 22: Hoare triple {562#(and (<= main_~a~0 1) (<= main_~b~0 1) (<= 0 main_~a~0) (<= 0 main_~b~0))} ~x~0 := ~a~0;~y~0 := ~b~0;~z~0 := 0; {581#(and (= main_~z~0 0) (<= main_~a~0 1) (<= main_~b~0 1) (= main_~b~0 main_~y~0) (<= 0 main_~a~0) (<= 0 main_~b~0) (= main_~a~0 main_~x~0))} is VALID [2022-04-27 14:27:09,524 INFO L290 TraceCheckUtils]: 23: Hoare triple {581#(and (= main_~z~0 0) (<= main_~a~0 1) (<= main_~b~0 1) (= main_~b~0 main_~y~0) (<= 0 main_~a~0) (<= 0 main_~b~0) (= main_~a~0 main_~x~0))} assume !false; {581#(and (= main_~z~0 0) (<= main_~a~0 1) (<= main_~b~0 1) (= main_~b~0 main_~y~0) (<= 0 main_~a~0) (<= 0 main_~b~0) (= main_~a~0 main_~x~0))} is VALID [2022-04-27 14:27:09,524 INFO L272 TraceCheckUtils]: 24: Hoare triple {581#(and (= main_~z~0 0) (<= main_~a~0 1) (<= main_~b~0 1) (= main_~b~0 main_~y~0) (<= 0 main_~a~0) (<= 0 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)); {506#true} is VALID [2022-04-27 14:27:09,525 INFO L290 TraceCheckUtils]: 25: Hoare triple {506#true} ~cond := #in~cond; {591#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-27 14:27:09,526 INFO L290 TraceCheckUtils]: 26: Hoare triple {591#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {595#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 14:27:09,526 INFO L290 TraceCheckUtils]: 27: Hoare triple {595#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {595#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 14:27:09,527 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {595#(not (= |__VERIFIER_assert_#in~cond| 0))} {581#(and (= main_~z~0 0) (<= main_~a~0 1) (<= main_~b~0 1) (= main_~b~0 main_~y~0) (<= 0 main_~a~0) (<= 0 main_~b~0) (= main_~a~0 main_~x~0))} #67#return; {581#(and (= main_~z~0 0) (<= main_~a~0 1) (<= main_~b~0 1) (= main_~b~0 main_~y~0) (<= 0 main_~a~0) (<= 0 main_~b~0) (= main_~a~0 main_~x~0))} is VALID [2022-04-27 14:27:09,527 INFO L290 TraceCheckUtils]: 29: Hoare triple {581#(and (= main_~z~0 0) (<= main_~a~0 1) (<= main_~b~0 1) (= main_~b~0 main_~y~0) (<= 0 main_~a~0) (<= 0 main_~b~0) (= main_~a~0 main_~x~0))} assume !!(0 != ~y~0); {605#(and (= main_~z~0 0) (not (= main_~y~0 0)) (<= main_~a~0 1) (<= main_~b~0 1) (= main_~b~0 main_~y~0) (<= 0 main_~a~0) (<= 0 main_~b~0) (= main_~a~0 main_~x~0))} is VALID [2022-04-27 14:27:09,528 INFO L290 TraceCheckUtils]: 30: Hoare triple {605#(and (= main_~z~0 0) (not (= main_~y~0 0)) (<= main_~a~0 1) (<= main_~b~0 1) (= main_~b~0 main_~y~0) (<= 0 main_~a~0) (<= 0 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);~z~0 := ~z~0 + ~x~0;~y~0 := ~y~0 - 1; {609#(and (<= main_~a~0 1) (= main_~b~0 (+ main_~y~0 1)) (= main_~z~0 main_~x~0) (<= main_~b~0 1) (not (= (+ main_~y~0 1) 0)) (<= 0 main_~a~0) (= main_~a~0 main_~x~0) (<= 0 (+ main_~y~0 1)))} is VALID [2022-04-27 14:27:09,531 INFO L290 TraceCheckUtils]: 31: Hoare triple {609#(and (<= main_~a~0 1) (= main_~b~0 (+ main_~y~0 1)) (= main_~z~0 main_~x~0) (<= main_~b~0 1) (not (= (+ main_~y~0 1) 0)) (<= 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); {613#(and (<= main_~a~0 1) (= main_~a~0 main_~z~0) (<= main_~b~0 1) (= (* main_~a~0 2) main_~x~0) (<= 0 main_~a~0) (not (= main_~b~0 0)) (<= 0 main_~b~0) (= (div (+ (- 1) main_~b~0) 2) main_~y~0))} is VALID [2022-04-27 14:27:09,531 INFO L290 TraceCheckUtils]: 32: Hoare triple {613#(and (<= main_~a~0 1) (= main_~a~0 main_~z~0) (<= main_~b~0 1) (= (* main_~a~0 2) main_~x~0) (<= 0 main_~a~0) (not (= main_~b~0 0)) (<= 0 main_~b~0) (= (div (+ (- 1) main_~b~0) 2) main_~y~0))} assume !false; {613#(and (<= main_~a~0 1) (= main_~a~0 main_~z~0) (<= main_~b~0 1) (= (* main_~a~0 2) main_~x~0) (<= 0 main_~a~0) (not (= main_~b~0 0)) (<= 0 main_~b~0) (= (div (+ (- 1) main_~b~0) 2) main_~y~0))} is VALID [2022-04-27 14:27:09,533 INFO L272 TraceCheckUtils]: 33: Hoare triple {613#(and (<= main_~a~0 1) (= main_~a~0 main_~z~0) (<= main_~b~0 1) (= (* main_~a~0 2) main_~x~0) (<= 0 main_~a~0) (not (= main_~b~0 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)); {620#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 14:27:09,533 INFO L290 TraceCheckUtils]: 34: Hoare triple {620#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {624#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 14:27:09,534 INFO L290 TraceCheckUtils]: 35: Hoare triple {624#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {507#false} is VALID [2022-04-27 14:27:09,534 INFO L290 TraceCheckUtils]: 36: Hoare triple {507#false} assume !false; {507#false} is VALID [2022-04-27 14:27:09,534 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 1 proven. 9 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-04-27 14:27:09,534 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 14:28:00,275 INFO L290 TraceCheckUtils]: 36: Hoare triple {507#false} assume !false; {507#false} is VALID [2022-04-27 14:28:00,275 INFO L290 TraceCheckUtils]: 35: Hoare triple {624#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {507#false} is VALID [2022-04-27 14:28:00,276 INFO L290 TraceCheckUtils]: 34: Hoare triple {620#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {624#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 14:28:00,277 INFO L272 TraceCheckUtils]: 33: Hoare triple {640#(= (+ 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)); {620#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 14:28:00,277 INFO L290 TraceCheckUtils]: 32: Hoare triple {640#(= (+ main_~z~0 (* main_~y~0 main_~x~0)) (* main_~b~0 main_~a~0))} assume !false; {640#(= (+ main_~z~0 (* main_~y~0 main_~x~0)) (* main_~b~0 main_~a~0))} is VALID [2022-04-27 14:28:00,282 INFO L290 TraceCheckUtils]: 31: Hoare triple {647#(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); {640#(= (+ main_~z~0 (* main_~y~0 main_~x~0)) (* main_~b~0 main_~a~0))} is VALID [2022-04-27 14:28:00,285 INFO L290 TraceCheckUtils]: 30: Hoare triple {651#(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; {647#(and (or (not (< main_~y~0 0)) (= (mod main_~y~0 2) 0) (= (+ main_~z~0 (* (* main_~x~0 2) (+ (div main_~y~0 2) 1))) (* main_~b~0 main_~a~0))) (or (= (+ main_~z~0 (* (* main_~x~0 2) (div main_~y~0 2))) (* main_~b~0 main_~a~0)) (and (not (= (mod main_~y~0 2) 0)) (< main_~y~0 0))))} is VALID [2022-04-27 14:28:00,285 INFO L290 TraceCheckUtils]: 29: Hoare triple {651#(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); {651#(or (= (+ (* (* main_~x~0 2) (div (+ (- 1) main_~y~0) 2)) main_~z~0 main_~x~0) (* main_~b~0 main_~a~0)) (not (<= 1 (mod main_~y~0 2))) (< main_~y~0 0))} is VALID [2022-04-27 14:28:02,288 WARN L284 TraceCheckUtils]: 28: Hoare quadruple {595#(not (= |__VERIFIER_assert_#in~cond| 0))} {506#true} #67#return; {651#(or (= (+ (* (* main_~x~0 2) (div (+ (- 1) main_~y~0) 2)) main_~z~0 main_~x~0) (* main_~b~0 main_~a~0)) (not (<= 1 (mod main_~y~0 2))) (< main_~y~0 0))} is UNKNOWN [2022-04-27 14:28:02,288 INFO L290 TraceCheckUtils]: 27: Hoare triple {595#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {595#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 14:28:02,289 INFO L290 TraceCheckUtils]: 26: Hoare triple {667#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} assume !(0 == ~cond); {595#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 14:28:02,289 INFO L290 TraceCheckUtils]: 25: Hoare triple {506#true} ~cond := #in~cond; {667#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-27 14:28:02,289 INFO L272 TraceCheckUtils]: 24: Hoare triple {506#true} call __VERIFIER_assert((if ~z~0 + ~x~0 * ~y~0 == ~a~0 * ~b~0 then 1 else 0)); {506#true} is VALID [2022-04-27 14:28:02,289 INFO L290 TraceCheckUtils]: 23: Hoare triple {506#true} assume !false; {506#true} is VALID [2022-04-27 14:28:02,289 INFO L290 TraceCheckUtils]: 22: Hoare triple {506#true} ~x~0 := ~a~0;~y~0 := ~b~0;~z~0 := 0; {506#true} is VALID [2022-04-27 14:28:02,289 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {506#true} {506#true} #65#return; {506#true} is VALID [2022-04-27 14:28:02,290 INFO L290 TraceCheckUtils]: 20: Hoare triple {506#true} assume true; {506#true} is VALID [2022-04-27 14:28:02,290 INFO L290 TraceCheckUtils]: 19: Hoare triple {506#true} assume !(0 == ~cond); {506#true} is VALID [2022-04-27 14:28:02,290 INFO L290 TraceCheckUtils]: 18: Hoare triple {506#true} ~cond := #in~cond; {506#true} is VALID [2022-04-27 14:28:02,290 INFO L272 TraceCheckUtils]: 17: Hoare triple {506#true} call assume_abort_if_not((if ~b~0 >= 1 then 1 else 0)); {506#true} is VALID [2022-04-27 14:28:02,290 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {506#true} {506#true} #63#return; {506#true} is VALID [2022-04-27 14:28:02,290 INFO L290 TraceCheckUtils]: 15: Hoare triple {506#true} assume true; {506#true} is VALID [2022-04-27 14:28:02,290 INFO L290 TraceCheckUtils]: 14: Hoare triple {506#true} assume !(0 == ~cond); {506#true} is VALID [2022-04-27 14:28:02,290 INFO L290 TraceCheckUtils]: 13: Hoare triple {506#true} ~cond := #in~cond; {506#true} is VALID [2022-04-27 14:28:02,290 INFO L272 TraceCheckUtils]: 12: Hoare triple {506#true} call assume_abort_if_not((if ~b~0 >= 0 && ~b~0 <= 1 then 1 else 0)); {506#true} is VALID [2022-04-27 14:28:02,290 INFO L290 TraceCheckUtils]: 11: Hoare triple {506#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~b~0 := #t~nondet5;havoc #t~nondet5; {506#true} is VALID [2022-04-27 14:28:02,290 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {506#true} {506#true} #61#return; {506#true} is VALID [2022-04-27 14:28:02,291 INFO L290 TraceCheckUtils]: 9: Hoare triple {506#true} assume true; {506#true} is VALID [2022-04-27 14:28:02,291 INFO L290 TraceCheckUtils]: 8: Hoare triple {506#true} assume !(0 == ~cond); {506#true} is VALID [2022-04-27 14:28:02,291 INFO L290 TraceCheckUtils]: 7: Hoare triple {506#true} ~cond := #in~cond; {506#true} is VALID [2022-04-27 14:28:02,291 INFO L272 TraceCheckUtils]: 6: Hoare triple {506#true} call assume_abort_if_not((if ~a~0 >= 0 && ~a~0 <= 1 then 1 else 0)); {506#true} is VALID [2022-04-27 14:28:02,291 INFO L290 TraceCheckUtils]: 5: Hoare triple {506#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; {506#true} is VALID [2022-04-27 14:28:02,291 INFO L272 TraceCheckUtils]: 4: Hoare triple {506#true} call #t~ret6 := main(); {506#true} is VALID [2022-04-27 14:28:02,291 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {506#true} {506#true} #71#return; {506#true} is VALID [2022-04-27 14:28:02,291 INFO L290 TraceCheckUtils]: 2: Hoare triple {506#true} assume true; {506#true} is VALID [2022-04-27 14:28:02,291 INFO L290 TraceCheckUtils]: 1: Hoare triple {506#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); {506#true} is VALID [2022-04-27 14:28:02,291 INFO L272 TraceCheckUtils]: 0: Hoare triple {506#true} call ULTIMATE.init(); {506#true} is VALID [2022-04-27 14:28:02,292 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-04-27 14:28:02,292 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 14:28:02,292 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1740008597] [2022-04-27 14:28:02,292 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 14:28:02,292 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1888598210] [2022-04-27 14:28:02,292 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1888598210] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 14:28:02,292 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-27 14:28:02,292 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 9] total 18 [2022-04-27 14:28:02,292 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2020791639] [2022-04-27 14:28:02,293 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-27 14:28:02,293 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 1.7222222222222223) internal successors, (31), 16 states have internal predecessors, (31), 6 states have call successors, (11), 2 states have call predecessors, (11), 3 states have return successors, (9), 5 states have call predecessors, (9), 4 states have call successors, (9) Word has length 37 [2022-04-27 14:28:02,293 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 14:28:02,294 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 18 states, 18 states have (on average 1.7222222222222223) internal successors, (31), 16 states have internal predecessors, (31), 6 states have call successors, (11), 2 states have call predecessors, (11), 3 states have return successors, (9), 5 states have call predecessors, (9), 4 states have call successors, (9) [2022-04-27 14:28:04,072 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 51 edges. 51 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 14:28:04,073 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-04-27 14:28:04,073 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 14:28:04,073 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-04-27 14:28:04,073 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=248, Unknown=0, NotChecked=0, Total=306 [2022-04-27 14:28:04,074 INFO L87 Difference]: Start difference. First operand 35 states and 39 transitions. Second operand has 18 states, 18 states have (on average 1.7222222222222223) internal successors, (31), 16 states have internal predecessors, (31), 6 states have call successors, (11), 2 states have call predecessors, (11), 3 states have return successors, (9), 5 states have call predecessors, (9), 4 states have call successors, (9) [2022-04-27 14:28:04,689 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:28:04,690 INFO L93 Difference]: Finished difference Result 44 states and 50 transitions. [2022-04-27 14:28:04,690 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-04-27 14:28:04,692 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 1.7222222222222223) internal successors, (31), 16 states have internal predecessors, (31), 6 states have call successors, (11), 2 states have call predecessors, (11), 3 states have return successors, (9), 5 states have call predecessors, (9), 4 states have call successors, (9) Word has length 37 [2022-04-27 14:28:04,693 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 14:28:04,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 18 states have (on average 1.7222222222222223) internal successors, (31), 16 states have internal predecessors, (31), 6 states have call successors, (11), 2 states have call predecessors, (11), 3 states have return successors, (9), 5 states have call predecessors, (9), 4 states have call successors, (9) [2022-04-27 14:28:04,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 47 transitions. [2022-04-27 14:28:04,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 18 states have (on average 1.7222222222222223) internal successors, (31), 16 states have internal predecessors, (31), 6 states have call successors, (11), 2 states have call predecessors, (11), 3 states have return successors, (9), 5 states have call predecessors, (9), 4 states have call successors, (9) [2022-04-27 14:28:04,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 47 transitions. [2022-04-27 14:28:04,698 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 12 states and 47 transitions. [2022-04-27 14:28:04,736 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 47 edges. 47 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 14:28:04,736 INFO L225 Difference]: With dead ends: 44 [2022-04-27 14:28:04,736 INFO L226 Difference]: Without dead ends: 0 [2022-04-27 14:28:04,737 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 54 SyntacticMatches, 3 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 73 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=69, Invalid=311, Unknown=0, NotChecked=0, Total=380 [2022-04-27 14:28:04,737 INFO L413 NwaCegarLoop]: 18 mSDtfsCounter, 25 mSDsluCounter, 116 mSDsCounter, 0 mSdLazyCounter, 174 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 134 SdHoareTripleChecker+Invalid, 194 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 174 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-04-27 14:28:04,738 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 134 Invalid, 194 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 174 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-04-27 14:28:04,738 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-04-27 14:28:04,738 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-04-27 14:28:04,738 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 14:28:04,738 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-27 14:28:04,738 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-27 14:28:04,738 INFO L87 Difference]: Start difference. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-27 14:28:04,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:28:04,738 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-27 14:28:04,739 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-27 14:28:04,739 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:28:04,739 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 14:28:04,739 INFO L74 IsIncluded]: Start isIncluded. First operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 0 states. [2022-04-27 14:28:04,739 INFO L87 Difference]: Start difference. First operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 0 states. [2022-04-27 14:28:04,739 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:28:04,739 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-27 14:28:04,739 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-27 14:28:04,739 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:28:04,739 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 14:28:04,739 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 14:28:04,739 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 14:28:04,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-27 14:28:04,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-04-27 14:28:04,739 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 37 [2022-04-27 14:28:04,739 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 14:28:04,740 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-04-27 14:28:04,740 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 1.7222222222222223) internal successors, (31), 16 states have internal predecessors, (31), 6 states have call successors, (11), 2 states have call predecessors, (11), 3 states have return successors, (9), 5 states have call predecessors, (9), 4 states have call successors, (9) [2022-04-27 14:28:04,740 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-27 14:28:04,740 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:28:04,742 INFO L805 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-04-27 14:28:04,779 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-04-27 14:28:04,947 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2022-04-27 14:28:04,949 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-04-27 14:28:05,058 INFO L899 garLoopResultBuilder]: For program point reach_errorEXIT(line 6) no Hoare annotation was computed. [2022-04-27 14:28:05,060 INFO L899 garLoopResultBuilder]: For program point reach_errorENTRY(line 6) no Hoare annotation was computed. [2022-04-27 14:28:05,060 INFO L899 garLoopResultBuilder]: For program point reach_errorFINAL(line 6) no Hoare annotation was computed. [2022-04-27 14:28:05,060 INFO L902 garLoopResultBuilder]: At program point assume_abort_if_notENTRY(lines 9 11) the Hoare annotation is: true [2022-04-27 14:28:05,061 INFO L899 garLoopResultBuilder]: For program point L10(line 10) no Hoare annotation was computed. [2022-04-27 14:28:05,061 INFO L899 garLoopResultBuilder]: For program point L10-2(lines 9 11) no Hoare annotation was computed. [2022-04-27 14:28:05,061 INFO L899 garLoopResultBuilder]: For program point assume_abort_if_notEXIT(lines 9 11) no Hoare annotation was computed. [2022-04-27 14:28:05,061 INFO L895 garLoopResultBuilder]: At program point L27(line 27) the Hoare annotation is: (and (<= main_~a~0 1) (<= 0 main_~a~0)) [2022-04-27 14:28:05,061 INFO L895 garLoopResultBuilder]: At program point L27-1(line 27) the Hoare annotation is: (and (<= main_~a~0 1) (<= main_~b~0 1) (<= 0 main_~a~0) (<= 0 main_~b~0)) [2022-04-27 14:28:05,061 INFO L902 garLoopResultBuilder]: At program point L25(line 25) the Hoare annotation is: true [2022-04-27 14:28:05,061 INFO L899 garLoopResultBuilder]: For program point mainEXIT(lines 20 49) no Hoare annotation was computed. [2022-04-27 14:28:05,061 INFO L899 garLoopResultBuilder]: For program point L25-1(line 25) no Hoare annotation was computed. [2022-04-27 14:28:05,061 INFO L899 garLoopResultBuilder]: For program point L46(line 46) no Hoare annotation was computed. [2022-04-27 14:28:05,061 INFO L899 garLoopResultBuilder]: For program point mainFINAL(lines 20 49) no Hoare annotation was computed. [2022-04-27 14:28:05,061 INFO L895 garLoopResultBuilder]: At program point L34-2(lines 34 45) the Hoare annotation is: (let ((.cse0 (<= main_~a~0 1)) (.cse1 (<= main_~b~0 1)) (.cse2 (<= 0 main_~a~0)) (.cse3 (<= 1 main_~b~0))) (or (and (= main_~z~0 0) .cse0 .cse1 (= main_~b~0 main_~y~0) .cse2 .cse3 (= main_~a~0 main_~x~0)) (and .cse0 (= main_~a~0 main_~z~0) .cse1 (= (* main_~a~0 2) main_~x~0) .cse2 .cse3 (= (div (+ (- 1) main_~b~0) 2) main_~y~0)))) [2022-04-27 14:28:05,061 INFO L895 garLoopResultBuilder]: At program point L34-3(lines 34 45) the Hoare annotation is: (and (<= main_~a~0 1) (= main_~a~0 main_~z~0) (<= main_~b~0 1) (= (* main_~a~0 2) main_~x~0) (<= 0 main_~a~0) (<= 1 main_~b~0) (= (div (+ (- 1) main_~b~0) 2) main_~y~0)) [2022-04-27 14:28:05,061 INFO L902 garLoopResultBuilder]: At program point mainENTRY(lines 20 49) the Hoare annotation is: true [2022-04-27 14:28:05,061 INFO L899 garLoopResultBuilder]: For program point L28(line 28) no Hoare annotation was computed. [2022-04-27 14:28:05,062 INFO L899 garLoopResultBuilder]: For program point L39(lines 39 42) no Hoare annotation was computed. [2022-04-27 14:28:05,062 INFO L899 garLoopResultBuilder]: For program point L39-2(lines 39 42) no Hoare annotation was computed. [2022-04-27 14:28:05,062 INFO L895 garLoopResultBuilder]: At program point L35(line 35) the Hoare annotation is: (let ((.cse0 (<= main_~a~0 1)) (.cse1 (<= main_~b~0 1)) (.cse2 (<= 0 main_~a~0)) (.cse3 (<= 1 main_~b~0))) (or (and (= main_~z~0 0) .cse0 .cse1 (= main_~b~0 main_~y~0) .cse2 .cse3 (= main_~a~0 main_~x~0)) (and .cse0 (= main_~a~0 main_~z~0) .cse1 (= (* main_~a~0 2) main_~x~0) .cse2 .cse3 (= (div (+ (- 1) main_~b~0) 2) main_~y~0)))) [2022-04-27 14:28:05,062 INFO L899 garLoopResultBuilder]: For program point L35-1(lines 34 45) no Hoare annotation was computed. [2022-04-27 14:28:05,062 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2022-04-27 14:28:05,062 INFO L895 garLoopResultBuilder]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|)) [2022-04-27 14:28:05,062 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2022-04-27 14:28:05,062 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-04-27 14:28:05,062 INFO L902 garLoopResultBuilder]: At program point L-1(line -1) the Hoare annotation is: true [2022-04-27 14:28:05,062 INFO L902 garLoopResultBuilder]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2022-04-27 14:28:05,062 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2022-04-27 14:28:05,062 INFO L902 garLoopResultBuilder]: At program point __VERIFIER_assertENTRY(lines 12 18) the Hoare annotation is: true [2022-04-27 14:28:05,062 INFO L899 garLoopResultBuilder]: For program point L14(lines 14 15) no Hoare annotation was computed. [2022-04-27 14:28:05,062 INFO L899 garLoopResultBuilder]: For program point L13(lines 13 16) no Hoare annotation was computed. [2022-04-27 14:28:05,062 INFO L899 garLoopResultBuilder]: For program point L13-2(lines 12 18) no Hoare annotation was computed. [2022-04-27 14:28:05,063 INFO L899 garLoopResultBuilder]: For program point __VERIFIER_assertEXIT(lines 12 18) no Hoare annotation was computed. [2022-04-27 14:28:05,063 INFO L899 garLoopResultBuilder]: For program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 15) no Hoare annotation was computed. [2022-04-27 14:28:05,065 INFO L356 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2022-04-27 14:28:05,066 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-04-27 14:28:05,068 WARN L170 areAnnotationChecker]: reach_errorENTRY has no Hoare annotation [2022-04-27 14:28:05,068 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2022-04-27 14:28:05,075 WARN L170 areAnnotationChecker]: L10 has no Hoare annotation [2022-04-27 14:28:05,075 WARN L170 areAnnotationChecker]: L13 has no Hoare annotation [2022-04-27 14:28:05,075 WARN L170 areAnnotationChecker]: reach_errorFINAL has no Hoare annotation [2022-04-27 14:28:05,075 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2022-04-27 14:28:05,075 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2022-04-27 14:28:05,075 WARN L170 areAnnotationChecker]: L10 has no Hoare annotation [2022-04-27 14:28:05,075 WARN L170 areAnnotationChecker]: L10 has no Hoare annotation [2022-04-27 14:28:05,075 WARN L170 areAnnotationChecker]: L25-1 has no Hoare annotation [2022-04-27 14:28:05,075 WARN L170 areAnnotationChecker]: L13 has no Hoare annotation [2022-04-27 14:28:05,075 WARN L170 areAnnotationChecker]: L13 has no Hoare annotation [2022-04-27 14:28:05,075 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2022-04-27 14:28:05,075 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2022-04-27 14:28:05,075 WARN L170 areAnnotationChecker]: L10-2 has no Hoare annotation [2022-04-27 14:28:05,075 WARN L170 areAnnotationChecker]: L25-1 has no Hoare annotation [2022-04-27 14:28:05,075 WARN L170 areAnnotationChecker]: L14 has no Hoare annotation [2022-04-27 14:28:05,075 WARN L170 areAnnotationChecker]: L14 has no Hoare annotation [2022-04-27 14:28:05,075 WARN L170 areAnnotationChecker]: L13-2 has no Hoare annotation [2022-04-27 14:28:05,075 WARN L170 areAnnotationChecker]: assume_abort_if_notEXIT has no Hoare annotation [2022-04-27 14:28:05,075 WARN L170 areAnnotationChecker]: assume_abort_if_notEXIT has no Hoare annotation [2022-04-27 14:28:05,075 WARN L170 areAnnotationChecker]: assume_abort_if_notEXIT has no Hoare annotation [2022-04-27 14:28:05,075 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-27 14:28:05,075 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-27 14:28:05,076 WARN L170 areAnnotationChecker]: L28 has no Hoare annotation [2022-04-27 14:28:05,076 WARN L170 areAnnotationChecker]: L28 has no Hoare annotation [2022-04-27 14:28:05,076 WARN L170 areAnnotationChecker]: L35-1 has no Hoare annotation [2022-04-27 14:28:05,076 WARN L170 areAnnotationChecker]: L35-1 has no Hoare annotation [2022-04-27 14:28:05,076 WARN L170 areAnnotationChecker]: L46 has no Hoare annotation [2022-04-27 14:28:05,079 WARN L170 areAnnotationChecker]: L46 has no Hoare annotation [2022-04-27 14:28:05,079 WARN L170 areAnnotationChecker]: L39 has no Hoare annotation [2022-04-27 14:28:05,079 WARN L170 areAnnotationChecker]: L39 has no Hoare annotation [2022-04-27 14:28:05,080 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2022-04-27 14:28:05,080 WARN L170 areAnnotationChecker]: L35-1 has no Hoare annotation [2022-04-27 14:28:05,080 WARN L170 areAnnotationChecker]: L39-2 has no Hoare annotation [2022-04-27 14:28:05,081 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2022-04-27 14:28:05,085 INFO L163 areAnnotationChecker]: CFG has 11 edges. 11 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2022-04-27 14:28:05,097 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.04 02:28:05 BoogieIcfgContainer [2022-04-27 14:28:05,098 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-04-27 14:28:05,099 INFO L158 Benchmark]: Toolchain (without parser) took 58614.69ms. Allocated memory was 198.2MB in the beginning and 238.0MB in the end (delta: 39.8MB). Free memory was 147.0MB in the beginning and 156.3MB in the end (delta: -9.4MB). Peak memory consumption was 31.4MB. Max. memory is 8.0GB. [2022-04-27 14:28:05,099 INFO L158 Benchmark]: CDTParser took 0.10ms. Allocated memory is still 198.2MB. Free memory is still 163.6MB. There was no memory consumed. Max. memory is 8.0GB. [2022-04-27 14:28:05,100 INFO L158 Benchmark]: CACSL2BoogieTranslator took 180.66ms. Allocated memory was 198.2MB in the beginning and 238.0MB in the end (delta: 39.8MB). Free memory was 146.7MB in the beginning and 213.2MB in the end (delta: -66.5MB). Peak memory consumption was 14.3MB. Max. memory is 8.0GB. [2022-04-27 14:28:05,100 INFO L158 Benchmark]: Boogie Preprocessor took 24.25ms. Allocated memory is still 238.0MB. Free memory was 213.2MB in the beginning and 211.5MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-04-27 14:28:05,100 INFO L158 Benchmark]: RCFGBuilder took 285.99ms. Allocated memory is still 238.0MB. Free memory was 211.5MB in the beginning and 199.9MB in the end (delta: 11.6MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2022-04-27 14:28:05,102 INFO L158 Benchmark]: TraceAbstraction took 58119.27ms. Allocated memory is still 238.0MB. Free memory was 199.6MB in the beginning and 156.3MB in the end (delta: 43.3MB). Peak memory consumption was 44.3MB. Max. memory is 8.0GB. [2022-04-27 14:28:05,103 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - AssertionsEnabledResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.10ms. Allocated memory is still 198.2MB. Free memory is still 163.6MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 180.66ms. Allocated memory was 198.2MB in the beginning and 238.0MB in the end (delta: 39.8MB). Free memory was 146.7MB in the beginning and 213.2MB in the end (delta: -66.5MB). Peak memory consumption was 14.3MB. Max. memory is 8.0GB. * Boogie Preprocessor took 24.25ms. Allocated memory is still 238.0MB. Free memory was 213.2MB in the beginning and 211.5MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 285.99ms. Allocated memory is still 238.0MB. Free memory was 211.5MB in the beginning and 199.9MB in the end (delta: 11.6MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * TraceAbstraction took 58119.27ms. Allocated memory is still 238.0MB. Free memory was 199.6MB in the beginning and 156.3MB in the end (delta: 43.3MB). Peak memory consumption was 44.3MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 15]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 6 procedures, 35 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 58.0s, OverallIterations: 3, TraceHistogramMax: 3, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.1s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 78 SdHoareTripleChecker+Valid, 0.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 68 mSDsluCounter, 280 SdHoareTripleChecker+Invalid, 0.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 209 mSDsCounter, 31 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 276 IncrementalHoareTripleChecker+Invalid, 307 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 31 mSolverCounterUnsat, 71 mSDtfsCounter, 276 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 117 GetRequests, 86 SyntacticMatches, 3 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 82 ImplicationChecksByTransitivity, 1.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=35occurred in iteration=2, InterpolantAutomatonStates: 24, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 3 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 12 LocationsWithAnnotation, 24 PreInvPairs, 31 NumberOfFragments, 163 HoareAnnotationTreeSize, 24 FomulaSimplifications, 27 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 12 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 0.1s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 54.0s InterpolantComputationTime, 93 NumberOfCodeBlocks, 93 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 126 ConstructedInterpolants, 0 QuantifiedInterpolants, 571 SizeOfPredicates, 7 NumberOfNonLiveVariables, 201 ConjunctsInSsa, 57 ConjunctsInUnsatCore, 4 InterpolantComputations, 2 PerfectInterpolantSequences, 46/56 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 34]: Loop Invariant Derived loop invariant: ((((((z == 0 && a <= 1) && b <= 1) && b == y) && 0 <= a) && 1 <= b) && a == x) || ((((((a <= 1 && a == z) && b <= 1) && a * 2 == x) && 0 <= a) && 1 <= b) && (-1 + b) / 2 == y) RESULT: Ultimate proved your program to be correct! [2022-04-27 14:28:05,140 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...