/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/geo2-ll_valuebound100.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-fb4f59a-m [2022-04-27 13:21:23,790 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-27 13:21:23,792 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-27 13:21:23,829 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-27 13:21:23,829 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-27 13:21:23,830 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-27 13:21:23,832 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-27 13:21:23,834 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-27 13:21:23,835 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-27 13:21:23,838 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-27 13:21:23,839 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-27 13:21:23,839 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-27 13:21:23,840 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-27 13:21:23,841 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-27 13:21:23,842 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-27 13:21:23,844 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-27 13:21:23,844 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-27 13:21:23,845 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-27 13:21:23,846 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-27 13:21:23,850 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-27 13:21:23,851 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-27 13:21:23,852 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-27 13:21:23,853 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-27 13:21:23,853 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-27 13:21:23,854 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-27 13:21:23,859 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-27 13:21:23,859 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-27 13:21:23,859 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-27 13:21:23,860 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-27 13:21:23,860 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-27 13:21:23,861 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-27 13:21:23,861 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-27 13:21:23,862 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-27 13:21:23,862 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-27 13:21:23,863 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-27 13:21:23,863 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-27 13:21:23,864 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-27 13:21:23,864 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-27 13:21:23,864 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-27 13:21:23,864 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-27 13:21:23,865 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-27 13:21:23,866 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-27 13:21:23,866 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2022-04-27 13:21:23,887 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-27 13:21:23,887 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-27 13:21:23,887 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-04-27 13:21:23,887 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-04-27 13:21:23,888 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-04-27 13:21:23,888 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-04-27 13:21:23,888 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-04-27 13:21:23,888 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-04-27 13:21:23,888 INFO L138 SettingsManager]: * Use SBE=true [2022-04-27 13:21:23,889 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-27 13:21:23,889 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-27 13:21:23,889 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-27 13:21:23,889 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-27 13:21:23,889 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-27 13:21:23,890 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-27 13:21:23,890 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-27 13:21:23,890 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-27 13:21:23,891 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-27 13:21:23,891 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-27 13:21:23,891 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-27 13:21:23,891 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-27 13:21:23,891 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-27 13:21:23,891 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-27 13:21:23,891 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-27 13:21:23,891 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-27 13:21:23,891 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-27 13:21:23,891 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-04-27 13:21:23,891 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-04-27 13:21:23,892 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-04-27 13:21:23,892 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-04-27 13:21:23,892 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-04-27 13:21:23,892 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-04-27 13:21:23,892 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-27 13:21:23,892 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.core: Log level for class -> de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN; [2022-04-27 13:21:24,063 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-27 13:21:24,082 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-27 13:21:24,084 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-27 13:21:24,085 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-27 13:21:24,085 INFO L275 PluginConnector]: CDTParser initialized [2022-04-27 13:21:24,086 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/nla-digbench-scaling/geo2-ll_valuebound100.c [2022-04-27 13:21:24,141 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/54325f6d5/66247b2d93404586be9d2565ed102b43/FLAG4e1b8f81e [2022-04-27 13:21:24,486 INFO L306 CDTParser]: Found 1 translation units. [2022-04-27 13:21:24,487 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/geo2-ll_valuebound100.c [2022-04-27 13:21:24,490 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/54325f6d5/66247b2d93404586be9d2565ed102b43/FLAG4e1b8f81e [2022-04-27 13:21:24,499 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/54325f6d5/66247b2d93404586be9d2565ed102b43 [2022-04-27 13:21:24,500 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-27 13:21:24,501 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-27 13:21:24,502 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-27 13:21:24,502 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-27 13:21:24,504 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-27 13:21:24,505 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.04 01:21:24" (1/1) ... [2022-04-27 13:21:24,505 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4286e6e2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 01:21:24, skipping insertion in model container [2022-04-27 13:21:24,506 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.04 01:21:24" (1/1) ... [2022-04-27 13:21:24,510 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-27 13:21:24,517 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-27 13:21:24,633 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/geo2-ll_valuebound100.c[525,538] [2022-04-27 13:21:24,656 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-27 13:21:24,666 INFO L203 MainTranslator]: Completed pre-run [2022-04-27 13:21:24,677 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/geo2-ll_valuebound100.c[525,538] [2022-04-27 13:21:24,680 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-27 13:21:24,690 INFO L208 MainTranslator]: Completed translation [2022-04-27 13:21:24,690 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 01:21:24 WrapperNode [2022-04-27 13:21:24,690 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-27 13:21:24,691 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-27 13:21:24,691 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-27 13:21:24,691 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-27 13:21:24,699 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 01:21:24" (1/1) ... [2022-04-27 13:21:24,699 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 01:21:24" (1/1) ... [2022-04-27 13:21:24,702 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 01:21:24" (1/1) ... [2022-04-27 13:21:24,703 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 01:21:24" (1/1) ... [2022-04-27 13:21:24,711 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 01:21:24" (1/1) ... [2022-04-27 13:21:24,713 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 01:21:24" (1/1) ... [2022-04-27 13:21:24,715 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 01:21:24" (1/1) ... [2022-04-27 13:21:24,716 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-27 13:21:24,716 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-27 13:21:24,716 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-27 13:21:24,716 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-27 13:21:24,719 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 01:21:24" (1/1) ... [2022-04-27 13:21:24,740 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-27 13:21:24,748 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 13:21:24,758 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-04-27 13:21:24,790 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-04-27 13:21:24,800 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-27 13:21:24,801 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-27 13:21:24,801 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-27 13:21:24,802 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-27 13:21:24,802 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-27 13:21:24,802 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-27 13:21:24,802 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-27 13:21:24,802 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-27 13:21:24,803 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-27 13:21:24,803 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-27 13:21:24,803 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-04-27 13:21:24,803 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-27 13:21:24,803 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-27 13:21:24,803 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-27 13:21:24,803 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-27 13:21:24,803 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-27 13:21:24,805 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-27 13:21:24,806 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-27 13:21:24,806 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-27 13:21:24,806 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-27 13:21:24,845 INFO L234 CfgBuilder]: Building ICFG [2022-04-27 13:21:24,846 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-27 13:21:24,958 INFO L275 CfgBuilder]: Performing block encoding [2022-04-27 13:21:24,963 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-27 13:21:24,964 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-27 13:21:24,965 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.04 01:21:24 BoogieIcfgContainer [2022-04-27 13:21:24,965 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-27 13:21:24,966 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-27 13:21:24,966 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-27 13:21:24,969 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-27 13:21:24,969 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.04 01:21:24" (1/3) ... [2022-04-27 13:21:24,970 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@639a111e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.04 01:21:24, skipping insertion in model container [2022-04-27 13:21:24,970 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 01:21:24" (2/3) ... [2022-04-27 13:21:24,970 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@639a111e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.04 01:21:24, skipping insertion in model container [2022-04-27 13:21:24,970 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.04 01:21:24" (3/3) ... [2022-04-27 13:21:24,971 INFO L111 eAbstractionObserver]: Analyzing ICFG geo2-ll_valuebound100.c [2022-04-27 13:21:24,982 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-04-27 13:21:24,982 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-27 13:21:25,066 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-27 13:21:25,082 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@387a0a2, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@2f25b3d6 [2022-04-27 13:21:25,082 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-27 13:21:25,090 INFO L276 IsEmpty]: Start isEmpty. Operand has 29 states, 17 states have (on average 1.3529411764705883) internal successors, (23), 18 states have internal predecessors, (23), 6 states have call successors, (6), 4 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-27 13:21:25,100 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-04-27 13:21:25,101 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 13:21:25,101 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 13:21:25,102 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 13:21:25,115 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 13:21:25,116 INFO L85 PathProgramCache]: Analyzing trace with hash -1276201559, now seen corresponding path program 1 times [2022-04-27 13:21:25,122 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 13:21:25,123 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1546414217] [2022-04-27 13:21:25,123 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 13:21:25,124 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 13:21:25,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 13:21:25,250 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 13:21:25,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 13:21:25,267 INFO L290 TraceCheckUtils]: 0: Hoare triple {45#(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(10, 2);call #Ultimate.allocInit(12, 3); {32#true} is VALID [2022-04-27 13:21:25,268 INFO L290 TraceCheckUtils]: 1: Hoare triple {32#true} assume true; {32#true} is VALID [2022-04-27 13:21:25,268 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {32#true} {32#true} #61#return; {32#true} is VALID [2022-04-27 13:21:25,268 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-27 13:21:25,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 13:21:25,280 INFO L290 TraceCheckUtils]: 0: Hoare triple {32#true} ~cond := #in~cond; {32#true} is VALID [2022-04-27 13:21:25,281 INFO L290 TraceCheckUtils]: 1: Hoare triple {32#true} assume 0 == ~cond;assume false; {33#false} is VALID [2022-04-27 13:21:25,281 INFO L290 TraceCheckUtils]: 2: Hoare triple {33#false} assume true; {33#false} is VALID [2022-04-27 13:21:25,281 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {33#false} {32#true} #53#return; {33#false} is VALID [2022-04-27 13:21:25,281 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-04-27 13:21:25,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 13:21:25,290 INFO L290 TraceCheckUtils]: 0: Hoare triple {32#true} ~cond := #in~cond; {32#true} is VALID [2022-04-27 13:21:25,290 INFO L290 TraceCheckUtils]: 1: Hoare triple {32#true} assume 0 == ~cond;assume false; {33#false} is VALID [2022-04-27 13:21:25,290 INFO L290 TraceCheckUtils]: 2: Hoare triple {33#false} assume true; {33#false} is VALID [2022-04-27 13:21:25,290 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {33#false} {33#false} #55#return; {33#false} is VALID [2022-04-27 13:21:25,291 INFO L272 TraceCheckUtils]: 0: Hoare triple {32#true} call ULTIMATE.init(); {45#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 13:21:25,291 INFO L290 TraceCheckUtils]: 1: Hoare triple {45#(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(10, 2);call #Ultimate.allocInit(12, 3); {32#true} is VALID [2022-04-27 13:21:25,292 INFO L290 TraceCheckUtils]: 2: Hoare triple {32#true} assume true; {32#true} is VALID [2022-04-27 13:21:25,292 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {32#true} {32#true} #61#return; {32#true} is VALID [2022-04-27 13:21:25,292 INFO L272 TraceCheckUtils]: 4: Hoare triple {32#true} call #t~ret6 := main(); {32#true} is VALID [2022-04-27 13:21:25,292 INFO L290 TraceCheckUtils]: 5: Hoare triple {32#true} havoc ~z~0;havoc ~k~0;havoc ~x~0;havoc ~y~0;havoc ~c~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~z~0 := #t~nondet4;havoc #t~nondet4; {32#true} is VALID [2022-04-27 13:21:25,292 INFO L272 TraceCheckUtils]: 6: Hoare triple {32#true} call assume_abort_if_not((if ~z~0 >= 0 && ~z~0 <= 100 then 1 else 0)); {32#true} is VALID [2022-04-27 13:21:25,292 INFO L290 TraceCheckUtils]: 7: Hoare triple {32#true} ~cond := #in~cond; {32#true} is VALID [2022-04-27 13:21:25,293 INFO L290 TraceCheckUtils]: 8: Hoare triple {32#true} assume 0 == ~cond;assume false; {33#false} is VALID [2022-04-27 13:21:25,293 INFO L290 TraceCheckUtils]: 9: Hoare triple {33#false} assume true; {33#false} is VALID [2022-04-27 13:21:25,293 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {33#false} {32#true} #53#return; {33#false} is VALID [2022-04-27 13:21:25,293 INFO L290 TraceCheckUtils]: 11: Hoare triple {33#false} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~k~0 := #t~nondet5;havoc #t~nondet5; {33#false} is VALID [2022-04-27 13:21:25,293 INFO L272 TraceCheckUtils]: 12: Hoare triple {33#false} call assume_abort_if_not((if ~k~0 >= 0 && ~k~0 <= 100 then 1 else 0)); {32#true} is VALID [2022-04-27 13:21:25,294 INFO L290 TraceCheckUtils]: 13: Hoare triple {32#true} ~cond := #in~cond; {32#true} is VALID [2022-04-27 13:21:25,294 INFO L290 TraceCheckUtils]: 14: Hoare triple {32#true} assume 0 == ~cond;assume false; {33#false} is VALID [2022-04-27 13:21:25,294 INFO L290 TraceCheckUtils]: 15: Hoare triple {33#false} assume true; {33#false} is VALID [2022-04-27 13:21:25,294 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {33#false} {33#false} #55#return; {33#false} is VALID [2022-04-27 13:21:25,294 INFO L290 TraceCheckUtils]: 17: Hoare triple {33#false} ~x~0 := 1;~y~0 := 1;~c~0 := 1; {33#false} is VALID [2022-04-27 13:21:25,295 INFO L290 TraceCheckUtils]: 18: Hoare triple {33#false} assume false; {33#false} is VALID [2022-04-27 13:21:25,295 INFO L272 TraceCheckUtils]: 19: Hoare triple {33#false} call __VERIFIER_assert((if 0 == 1 + ~x~0 * ~z~0 - ~x~0 - ~z~0 * ~y~0 then 1 else 0)); {33#false} is VALID [2022-04-27 13:21:25,295 INFO L290 TraceCheckUtils]: 20: Hoare triple {33#false} ~cond := #in~cond; {33#false} is VALID [2022-04-27 13:21:25,295 INFO L290 TraceCheckUtils]: 21: Hoare triple {33#false} assume 0 == ~cond; {33#false} is VALID [2022-04-27 13:21:25,295 INFO L290 TraceCheckUtils]: 22: Hoare triple {33#false} assume !false; {33#false} is VALID [2022-04-27 13:21:25,295 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-27 13:21:25,296 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 13:21:25,296 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1546414217] [2022-04-27 13:21:25,296 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1546414217] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 13:21:25,297 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 13:21:25,297 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-27 13:21:25,298 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1557606306] [2022-04-27 13:21:25,298 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 13:21:25,302 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, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 23 [2022-04-27 13:21:25,303 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 13:21:25,305 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, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-27 13:21:25,339 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 20 edges. 20 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 13:21:25,340 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-27 13:21:25,340 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 13:21:25,363 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-27 13:21:25,364 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-27 13:21:25,365 INFO L87 Difference]: Start difference. First operand has 29 states, 17 states have (on average 1.3529411764705883) internal successors, (23), 18 states have internal predecessors, (23), 6 states have call successors, (6), 4 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) 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, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-27 13:21:25,451 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:21:25,451 INFO L93 Difference]: Finished difference Result 51 states and 66 transitions. [2022-04-27 13:21:25,451 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-27 13:21:25,452 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, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 23 [2022-04-27 13:21:25,452 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 13:21:25,453 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, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-27 13:21:25,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 66 transitions. [2022-04-27 13:21:25,458 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, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-27 13:21:25,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 66 transitions. [2022-04-27 13:21:25,461 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 66 transitions. [2022-04-27 13:21:25,544 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 66 edges. 66 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 13:21:25,550 INFO L225 Difference]: With dead ends: 51 [2022-04-27 13:21:25,550 INFO L226 Difference]: Without dead ends: 24 [2022-04-27 13:21:25,552 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-27 13:21:25,554 INFO L413 NwaCegarLoop]: 27 mSDtfsCounter, 16 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 30 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 13:21:25,555 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 30 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 13:21:25,568 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2022-04-27 13:21:25,589 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2022-04-27 13:21:25,590 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 13:21:25,591 INFO L82 GeneralOperation]: Start isEquivalent. First operand 24 states. Second operand has 24 states, 14 states have (on average 1.1428571428571428) internal successors, (16), 15 states have internal predecessors, (16), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-27 13:21:25,594 INFO L74 IsIncluded]: Start isIncluded. First operand 24 states. Second operand has 24 states, 14 states have (on average 1.1428571428571428) internal successors, (16), 15 states have internal predecessors, (16), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-27 13:21:25,594 INFO L87 Difference]: Start difference. First operand 24 states. Second operand has 24 states, 14 states have (on average 1.1428571428571428) internal successors, (16), 15 states have internal predecessors, (16), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-27 13:21:25,600 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:21:25,600 INFO L93 Difference]: Finished difference Result 24 states and 26 transitions. [2022-04-27 13:21:25,600 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 26 transitions. [2022-04-27 13:21:25,600 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 13:21:25,600 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 13:21:25,601 INFO L74 IsIncluded]: Start isIncluded. First operand has 24 states, 14 states have (on average 1.1428571428571428) internal successors, (16), 15 states have internal predecessors, (16), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand 24 states. [2022-04-27 13:21:25,601 INFO L87 Difference]: Start difference. First operand has 24 states, 14 states have (on average 1.1428571428571428) internal successors, (16), 15 states have internal predecessors, (16), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand 24 states. [2022-04-27 13:21:25,603 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:21:25,603 INFO L93 Difference]: Finished difference Result 24 states and 26 transitions. [2022-04-27 13:21:25,603 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 26 transitions. [2022-04-27 13:21:25,604 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 13:21:25,604 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 13:21:25,604 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 13:21:25,604 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 13:21:25,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 14 states have (on average 1.1428571428571428) internal successors, (16), 15 states have internal predecessors, (16), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-27 13:21:25,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 26 transitions. [2022-04-27 13:21:25,607 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 26 transitions. Word has length 23 [2022-04-27 13:21:25,609 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 13:21:25,609 INFO L495 AbstractCegarLoop]: Abstraction has 24 states and 26 transitions. [2022-04-27 13:21:25,610 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, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-27 13:21:25,610 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 26 transitions. [2022-04-27 13:21:25,611 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-04-27 13:21:25,611 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 13:21:25,611 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 13:21:25,612 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-27 13:21:25,612 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 13:21:25,616 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 13:21:25,616 INFO L85 PathProgramCache]: Analyzing trace with hash -1874219407, now seen corresponding path program 1 times [2022-04-27 13:21:25,616 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 13:21:25,616 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [796273646] [2022-04-27 13:21:25,616 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 13:21:25,617 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 13:21:25,649 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 13:21:25,650 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [652633551] [2022-04-27 13:21:25,650 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 13:21:25,650 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 13:21:25,650 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 13:21:25,667 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-27 13:21:25,681 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-04-27 13:21:25,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 13:21:25,758 INFO L263 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 12 conjunts are in the unsatisfiable core [2022-04-27 13:21:25,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 13:21:25,786 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 13:21:26,083 INFO L272 TraceCheckUtils]: 0: Hoare triple {199#true} call ULTIMATE.init(); {199#true} is VALID [2022-04-27 13:21:26,083 INFO L290 TraceCheckUtils]: 1: Hoare triple {199#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(10, 2);call #Ultimate.allocInit(12, 3); {199#true} is VALID [2022-04-27 13:21:26,083 INFO L290 TraceCheckUtils]: 2: Hoare triple {199#true} assume true; {199#true} is VALID [2022-04-27 13:21:26,084 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {199#true} {199#true} #61#return; {199#true} is VALID [2022-04-27 13:21:26,084 INFO L272 TraceCheckUtils]: 4: Hoare triple {199#true} call #t~ret6 := main(); {199#true} is VALID [2022-04-27 13:21:26,084 INFO L290 TraceCheckUtils]: 5: Hoare triple {199#true} havoc ~z~0;havoc ~k~0;havoc ~x~0;havoc ~y~0;havoc ~c~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~z~0 := #t~nondet4;havoc #t~nondet4; {199#true} is VALID [2022-04-27 13:21:26,084 INFO L272 TraceCheckUtils]: 6: Hoare triple {199#true} call assume_abort_if_not((if ~z~0 >= 0 && ~z~0 <= 100 then 1 else 0)); {199#true} is VALID [2022-04-27 13:21:26,085 INFO L290 TraceCheckUtils]: 7: Hoare triple {199#true} ~cond := #in~cond; {225#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-04-27 13:21:26,085 INFO L290 TraceCheckUtils]: 8: Hoare triple {225#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} assume !(0 == ~cond); {229#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-27 13:21:26,086 INFO L290 TraceCheckUtils]: 9: Hoare triple {229#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {229#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-27 13:21:26,087 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {229#(not (= |assume_abort_if_not_#in~cond| 0))} {199#true} #53#return; {236#(and (<= main_~z~0 100) (<= 0 main_~z~0))} is VALID [2022-04-27 13:21:26,087 INFO L290 TraceCheckUtils]: 11: Hoare triple {236#(and (<= main_~z~0 100) (<= 0 main_~z~0))} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~k~0 := #t~nondet5;havoc #t~nondet5; {236#(and (<= main_~z~0 100) (<= 0 main_~z~0))} is VALID [2022-04-27 13:21:26,087 INFO L272 TraceCheckUtils]: 12: Hoare triple {236#(and (<= main_~z~0 100) (<= 0 main_~z~0))} call assume_abort_if_not((if ~k~0 >= 0 && ~k~0 <= 100 then 1 else 0)); {199#true} is VALID [2022-04-27 13:21:26,088 INFO L290 TraceCheckUtils]: 13: Hoare triple {199#true} ~cond := #in~cond; {199#true} is VALID [2022-04-27 13:21:26,092 INFO L290 TraceCheckUtils]: 14: Hoare triple {199#true} assume !(0 == ~cond); {199#true} is VALID [2022-04-27 13:21:26,092 INFO L290 TraceCheckUtils]: 15: Hoare triple {199#true} assume true; {199#true} is VALID [2022-04-27 13:21:26,092 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {199#true} {236#(and (<= main_~z~0 100) (<= 0 main_~z~0))} #55#return; {236#(and (<= main_~z~0 100) (<= 0 main_~z~0))} is VALID [2022-04-27 13:21:26,093 INFO L290 TraceCheckUtils]: 17: Hoare triple {236#(and (<= main_~z~0 100) (<= 0 main_~z~0))} ~x~0 := 1;~y~0 := 1;~c~0 := 1; {258#(and (= main_~y~0 1) (= main_~x~0 1) (<= main_~z~0 100) (<= 0 main_~z~0))} is VALID [2022-04-27 13:21:26,094 INFO L290 TraceCheckUtils]: 18: Hoare triple {258#(and (= main_~y~0 1) (= main_~x~0 1) (<= main_~z~0 100) (<= 0 main_~z~0))} assume !false; {258#(and (= main_~y~0 1) (= main_~x~0 1) (<= main_~z~0 100) (<= 0 main_~z~0))} is VALID [2022-04-27 13:21:26,095 INFO L272 TraceCheckUtils]: 19: Hoare triple {258#(and (= main_~y~0 1) (= main_~x~0 1) (<= main_~z~0 100) (<= 0 main_~z~0))} call __VERIFIER_assert((if 0 == 1 + ~x~0 * ~z~0 - ~x~0 - ~z~0 * ~y~0 then 1 else 0)); {265#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 13:21:26,095 INFO L290 TraceCheckUtils]: 20: Hoare triple {265#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {269#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 13:21:26,097 INFO L290 TraceCheckUtils]: 21: Hoare triple {269#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {200#false} is VALID [2022-04-27 13:21:26,097 INFO L290 TraceCheckUtils]: 22: Hoare triple {200#false} assume !false; {200#false} is VALID [2022-04-27 13:21:26,098 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-27 13:21:26,098 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 13:21:26,265 INFO L290 TraceCheckUtils]: 22: Hoare triple {200#false} assume !false; {200#false} is VALID [2022-04-27 13:21:26,266 INFO L290 TraceCheckUtils]: 21: Hoare triple {269#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {200#false} is VALID [2022-04-27 13:21:26,266 INFO L290 TraceCheckUtils]: 20: Hoare triple {265#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {269#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 13:21:26,267 INFO L272 TraceCheckUtils]: 19: Hoare triple {285#(= (+ main_~x~0 (* main_~z~0 main_~y~0)) (+ (* main_~z~0 main_~x~0) 1))} call __VERIFIER_assert((if 0 == 1 + ~x~0 * ~z~0 - ~x~0 - ~z~0 * ~y~0 then 1 else 0)); {265#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 13:21:26,268 INFO L290 TraceCheckUtils]: 18: Hoare triple {285#(= (+ main_~x~0 (* main_~z~0 main_~y~0)) (+ (* main_~z~0 main_~x~0) 1))} assume !false; {285#(= (+ main_~x~0 (* main_~z~0 main_~y~0)) (+ (* main_~z~0 main_~x~0) 1))} is VALID [2022-04-27 13:21:26,268 INFO L290 TraceCheckUtils]: 17: Hoare triple {199#true} ~x~0 := 1;~y~0 := 1;~c~0 := 1; {285#(= (+ main_~x~0 (* main_~z~0 main_~y~0)) (+ (* main_~z~0 main_~x~0) 1))} is VALID [2022-04-27 13:21:26,268 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {199#true} {199#true} #55#return; {199#true} is VALID [2022-04-27 13:21:26,268 INFO L290 TraceCheckUtils]: 15: Hoare triple {199#true} assume true; {199#true} is VALID [2022-04-27 13:21:26,268 INFO L290 TraceCheckUtils]: 14: Hoare triple {199#true} assume !(0 == ~cond); {199#true} is VALID [2022-04-27 13:21:26,268 INFO L290 TraceCheckUtils]: 13: Hoare triple {199#true} ~cond := #in~cond; {199#true} is VALID [2022-04-27 13:21:26,269 INFO L272 TraceCheckUtils]: 12: Hoare triple {199#true} call assume_abort_if_not((if ~k~0 >= 0 && ~k~0 <= 100 then 1 else 0)); {199#true} is VALID [2022-04-27 13:21:26,269 INFO L290 TraceCheckUtils]: 11: Hoare triple {199#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~k~0 := #t~nondet5;havoc #t~nondet5; {199#true} is VALID [2022-04-27 13:21:26,269 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {199#true} {199#true} #53#return; {199#true} is VALID [2022-04-27 13:21:26,269 INFO L290 TraceCheckUtils]: 9: Hoare triple {199#true} assume true; {199#true} is VALID [2022-04-27 13:21:26,269 INFO L290 TraceCheckUtils]: 8: Hoare triple {199#true} assume !(0 == ~cond); {199#true} is VALID [2022-04-27 13:21:26,269 INFO L290 TraceCheckUtils]: 7: Hoare triple {199#true} ~cond := #in~cond; {199#true} is VALID [2022-04-27 13:21:26,269 INFO L272 TraceCheckUtils]: 6: Hoare triple {199#true} call assume_abort_if_not((if ~z~0 >= 0 && ~z~0 <= 100 then 1 else 0)); {199#true} is VALID [2022-04-27 13:21:26,269 INFO L290 TraceCheckUtils]: 5: Hoare triple {199#true} havoc ~z~0;havoc ~k~0;havoc ~x~0;havoc ~y~0;havoc ~c~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~z~0 := #t~nondet4;havoc #t~nondet4; {199#true} is VALID [2022-04-27 13:21:26,269 INFO L272 TraceCheckUtils]: 4: Hoare triple {199#true} call #t~ret6 := main(); {199#true} is VALID [2022-04-27 13:21:26,270 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {199#true} {199#true} #61#return; {199#true} is VALID [2022-04-27 13:21:26,270 INFO L290 TraceCheckUtils]: 2: Hoare triple {199#true} assume true; {199#true} is VALID [2022-04-27 13:21:26,270 INFO L290 TraceCheckUtils]: 1: Hoare triple {199#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(10, 2);call #Ultimate.allocInit(12, 3); {199#true} is VALID [2022-04-27 13:21:26,270 INFO L272 TraceCheckUtils]: 0: Hoare triple {199#true} call ULTIMATE.init(); {199#true} is VALID [2022-04-27 13:21:26,270 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-27 13:21:26,270 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 13:21:26,270 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [796273646] [2022-04-27 13:21:26,271 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 13:21:26,271 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [652633551] [2022-04-27 13:21:26,271 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [652633551] provided 1 perfect and 1 imperfect interpolant sequences [2022-04-27 13:21:26,271 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-04-27 13:21:26,271 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [8] total 9 [2022-04-27 13:21:26,272 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1855895486] [2022-04-27 13:21:26,272 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 13:21:26,272 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 23 [2022-04-27 13:21:26,272 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 13:21:26,273 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-27 13:21:26,286 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 20 edges. 20 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 13:21:26,286 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-27 13:21:26,286 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 13:21:26,287 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-27 13:21:26,287 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2022-04-27 13:21:26,287 INFO L87 Difference]: Start difference. First operand 24 states and 26 transitions. Second operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-27 13:21:26,483 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:21:26,483 INFO L93 Difference]: Finished difference Result 24 states and 26 transitions. [2022-04-27 13:21:26,483 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-27 13:21:26,484 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 23 [2022-04-27 13:21:26,484 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 13:21:26,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-27 13:21:26,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 26 transitions. [2022-04-27 13:21:26,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-27 13:21:26,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 26 transitions. [2022-04-27 13:21:26,487 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 26 transitions. [2022-04-27 13:21:26,522 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 26 edges. 26 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 13:21:26,523 INFO L225 Difference]: With dead ends: 24 [2022-04-27 13:21:26,523 INFO L226 Difference]: Without dead ends: 0 [2022-04-27 13:21:26,523 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 37 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2022-04-27 13:21:26,524 INFO L413 NwaCegarLoop]: 20 mSDtfsCounter, 6 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 67 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-27 13:21:26,524 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 67 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-27 13:21:26,525 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-04-27 13:21:26,525 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-04-27 13:21:26,525 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 13:21:26,525 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-27 13:21:26,525 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-27 13:21:26,525 INFO L87 Difference]: Start difference. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-27 13:21:26,525 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:21:26,526 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-27 13:21:26,526 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-27 13:21:26,526 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 13:21:26,526 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 13:21:26,526 INFO L74 IsIncluded]: Start isIncluded. First operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 0 states. [2022-04-27 13:21:26,526 INFO L87 Difference]: Start difference. First operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 0 states. [2022-04-27 13:21:26,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:21:26,526 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-27 13:21:26,526 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-27 13:21:26,526 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 13:21:26,526 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 13:21:26,526 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 13:21:26,526 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 13:21:26,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-27 13:21:26,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-04-27 13:21:26,527 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 23 [2022-04-27 13:21:26,527 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 13:21:26,527 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-04-27 13:21:26,527 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-27 13:21:26,527 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-27 13:21:26,527 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 13:21:26,529 INFO L805 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-04-27 13:21:26,560 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-04-27 13:21:26,747 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 13:21:26,749 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-04-27 13:21:26,773 INFO L899 garLoopResultBuilder]: For program point reach_errorEXIT(line 8) no Hoare annotation was computed. [2022-04-27 13:21:26,774 INFO L899 garLoopResultBuilder]: For program point reach_errorENTRY(line 8) no Hoare annotation was computed. [2022-04-27 13:21:26,774 INFO L899 garLoopResultBuilder]: For program point reach_errorFINAL(line 8) no Hoare annotation was computed. [2022-04-27 13:21:26,774 INFO L902 garLoopResultBuilder]: At program point assume_abort_if_notENTRY(lines 11 13) the Hoare annotation is: true [2022-04-27 13:21:26,774 INFO L899 garLoopResultBuilder]: For program point L12(line 12) no Hoare annotation was computed. [2022-04-27 13:21:26,774 INFO L899 garLoopResultBuilder]: For program point L12-2(lines 11 13) no Hoare annotation was computed. [2022-04-27 13:21:26,774 INFO L899 garLoopResultBuilder]: For program point assume_abort_if_notEXIT(lines 11 13) no Hoare annotation was computed. [2022-04-27 13:21:26,774 INFO L895 garLoopResultBuilder]: At program point L35-2(lines 35 44) the Hoare annotation is: (= (+ main_~x~0 (* main_~z~0 main_~y~0)) (+ (* main_~z~0 main_~x~0) 1)) [2022-04-27 13:21:26,775 INFO L895 garLoopResultBuilder]: At program point L35-3(lines 35 44) the Hoare annotation is: (= (+ main_~x~0 (* main_~z~0 main_~y~0)) (+ (* main_~z~0 main_~x~0) 1)) [2022-04-27 13:21:26,775 INFO L902 garLoopResultBuilder]: At program point mainENTRY(lines 23 47) the Hoare annotation is: true [2022-04-27 13:21:26,775 INFO L902 garLoopResultBuilder]: At program point L29(line 29) the Hoare annotation is: true [2022-04-27 13:21:26,775 INFO L899 garLoopResultBuilder]: For program point L29-1(line 29) no Hoare annotation was computed. [2022-04-27 13:21:26,775 INFO L902 garLoopResultBuilder]: At program point L27(line 27) the Hoare annotation is: true [2022-04-27 13:21:26,775 INFO L899 garLoopResultBuilder]: For program point L27-1(line 27) no Hoare annotation was computed. [2022-04-27 13:21:26,775 INFO L899 garLoopResultBuilder]: For program point mainEXIT(lines 23 47) no Hoare annotation was computed. [2022-04-27 13:21:26,775 INFO L899 garLoopResultBuilder]: For program point L45(line 45) no Hoare annotation was computed. [2022-04-27 13:21:26,775 INFO L899 garLoopResultBuilder]: For program point mainFINAL(lines 23 47) no Hoare annotation was computed. [2022-04-27 13:21:26,775 INFO L895 garLoopResultBuilder]: At program point L36(line 36) the Hoare annotation is: (= (+ main_~x~0 (* main_~z~0 main_~y~0)) (+ (* main_~z~0 main_~x~0) 1)) [2022-04-27 13:21:26,776 INFO L899 garLoopResultBuilder]: For program point L36-1(lines 35 44) no Hoare annotation was computed. [2022-04-27 13:21:26,776 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2022-04-27 13:21:26,776 INFO L895 garLoopResultBuilder]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|)) [2022-04-27 13:21:26,776 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2022-04-27 13:21:26,776 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-04-27 13:21:26,776 INFO L902 garLoopResultBuilder]: At program point L-1(line -1) the Hoare annotation is: true [2022-04-27 13:21:26,776 INFO L902 garLoopResultBuilder]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2022-04-27 13:21:26,776 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2022-04-27 13:21:26,776 INFO L899 garLoopResultBuilder]: For program point L16(lines 16 17) no Hoare annotation was computed. [2022-04-27 13:21:26,776 INFO L899 garLoopResultBuilder]: For program point L15(lines 15 18) no Hoare annotation was computed. [2022-04-27 13:21:26,776 INFO L902 garLoopResultBuilder]: At program point __VERIFIER_assertENTRY(lines 14 20) the Hoare annotation is: true [2022-04-27 13:21:26,776 INFO L899 garLoopResultBuilder]: For program point L15-2(lines 14 20) no Hoare annotation was computed. [2022-04-27 13:21:26,777 INFO L899 garLoopResultBuilder]: For program point __VERIFIER_assertEXIT(lines 14 20) no Hoare annotation was computed. [2022-04-27 13:21:26,777 INFO L899 garLoopResultBuilder]: For program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 17) no Hoare annotation was computed. [2022-04-27 13:21:26,779 INFO L356 BasicCegarLoop]: Path program histogram: [1, 1] [2022-04-27 13:21:26,780 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-04-27 13:21:26,783 WARN L170 areAnnotationChecker]: reach_errorENTRY has no Hoare annotation [2022-04-27 13:21:26,783 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2022-04-27 13:21:26,784 WARN L170 areAnnotationChecker]: L12 has no Hoare annotation [2022-04-27 13:21:26,784 WARN L170 areAnnotationChecker]: L15 has no Hoare annotation [2022-04-27 13:21:26,784 WARN L170 areAnnotationChecker]: reach_errorFINAL has no Hoare annotation [2022-04-27 13:21:26,784 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2022-04-27 13:21:26,784 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2022-04-27 13:21:26,784 WARN L170 areAnnotationChecker]: L12 has no Hoare annotation [2022-04-27 13:21:26,784 WARN L170 areAnnotationChecker]: L12 has no Hoare annotation [2022-04-27 13:21:26,784 WARN L170 areAnnotationChecker]: L27-1 has no Hoare annotation [2022-04-27 13:21:26,784 WARN L170 areAnnotationChecker]: L15 has no Hoare annotation [2022-04-27 13:21:26,784 WARN L170 areAnnotationChecker]: L15 has no Hoare annotation [2022-04-27 13:21:26,784 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2022-04-27 13:21:26,784 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2022-04-27 13:21:26,784 WARN L170 areAnnotationChecker]: L12-2 has no Hoare annotation [2022-04-27 13:21:26,784 WARN L170 areAnnotationChecker]: L27-1 has no Hoare annotation [2022-04-27 13:21:26,784 WARN L170 areAnnotationChecker]: L16 has no Hoare annotation [2022-04-27 13:21:26,784 WARN L170 areAnnotationChecker]: L16 has no Hoare annotation [2022-04-27 13:21:26,785 WARN L170 areAnnotationChecker]: L15-2 has no Hoare annotation [2022-04-27 13:21:26,785 WARN L170 areAnnotationChecker]: assume_abort_if_notEXIT has no Hoare annotation [2022-04-27 13:21:26,785 WARN L170 areAnnotationChecker]: assume_abort_if_notEXIT has no Hoare annotation [2022-04-27 13:21:26,785 WARN L170 areAnnotationChecker]: L29-1 has no Hoare annotation [2022-04-27 13:21:26,785 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-27 13:21:26,785 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-27 13:21:26,785 WARN L170 areAnnotationChecker]: L29-1 has no Hoare annotation [2022-04-27 13:21:26,785 WARN L170 areAnnotationChecker]: L36-1 has no Hoare annotation [2022-04-27 13:21:26,785 WARN L170 areAnnotationChecker]: L36-1 has no Hoare annotation [2022-04-27 13:21:26,785 WARN L170 areAnnotationChecker]: L45 has no Hoare annotation [2022-04-27 13:21:26,786 WARN L170 areAnnotationChecker]: L45 has no Hoare annotation [2022-04-27 13:21:26,786 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2022-04-27 13:21:26,786 WARN L170 areAnnotationChecker]: L36-1 has no Hoare annotation [2022-04-27 13:21:26,786 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2022-04-27 13:21:26,786 INFO L163 areAnnotationChecker]: CFG has 10 edges. 10 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2022-04-27 13:21:26,791 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.04 01:21:26 BoogieIcfgContainer [2022-04-27 13:21:26,791 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-04-27 13:21:26,792 INFO L158 Benchmark]: Toolchain (without parser) took 2291.05ms. Allocated memory was 180.4MB in the beginning and 247.5MB in the end (delta: 67.1MB). Free memory was 131.1MB in the beginning and 169.9MB in the end (delta: -38.9MB). Peak memory consumption was 28.8MB. Max. memory is 8.0GB. [2022-04-27 13:21:26,793 INFO L158 Benchmark]: CDTParser took 0.33ms. Allocated memory is still 180.4MB. Free memory was 147.4MB in the beginning and 147.4MB in the end (delta: 69.8kB). There was no memory consumed. Max. memory is 8.0GB. [2022-04-27 13:21:26,793 INFO L158 Benchmark]: CACSL2BoogieTranslator took 188.35ms. Allocated memory is still 180.4MB. Free memory was 130.8MB in the beginning and 155.7MB in the end (delta: -24.8MB). Peak memory consumption was 12.3MB. Max. memory is 8.0GB. [2022-04-27 13:21:26,793 INFO L158 Benchmark]: Boogie Preprocessor took 24.81ms. Allocated memory is still 180.4MB. Free memory was 155.7MB in the beginning and 154.1MB in the end (delta: 1.5MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-04-27 13:21:26,793 INFO L158 Benchmark]: RCFGBuilder took 249.03ms. Allocated memory is still 180.4MB. Free memory was 154.1MB in the beginning and 143.2MB in the end (delta: 11.0MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2022-04-27 13:21:26,794 INFO L158 Benchmark]: TraceAbstraction took 1825.16ms. Allocated memory was 180.4MB in the beginning and 247.5MB in the end (delta: 67.1MB). Free memory was 142.6MB in the beginning and 169.9MB in the end (delta: -27.3MB). Peak memory consumption was 40.6MB. Max. memory is 8.0GB. [2022-04-27 13:21:26,795 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.33ms. Allocated memory is still 180.4MB. Free memory was 147.4MB in the beginning and 147.4MB in the end (delta: 69.8kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 188.35ms. Allocated memory is still 180.4MB. Free memory was 130.8MB in the beginning and 155.7MB in the end (delta: -24.8MB). Peak memory consumption was 12.3MB. Max. memory is 8.0GB. * Boogie Preprocessor took 24.81ms. Allocated memory is still 180.4MB. Free memory was 155.7MB in the beginning and 154.1MB in the end (delta: 1.5MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 249.03ms. Allocated memory is still 180.4MB. Free memory was 154.1MB in the beginning and 143.2MB in the end (delta: 11.0MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * TraceAbstraction took 1825.16ms. Allocated memory was 180.4MB in the beginning and 247.5MB in the end (delta: 67.1MB). Free memory was 142.6MB in the beginning and 169.9MB in the end (delta: -27.3MB). Peak memory consumption was 40.6MB. 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: 17]: 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, 32 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 1.7s, OverallIterations: 2, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 27 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 22 mSDsluCounter, 97 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 50 mSDsCounter, 7 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 22 IncrementalHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 7 mSolverCounterUnsat, 47 mSDtfsCounter, 22 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 56 GetRequests, 46 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=29occurred in iteration=0, InterpolantAutomatonStates: 8, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 2 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 11 LocationsWithAnnotation, 16 PreInvPairs, 20 NumberOfFragments, 47 HoareAnnotationTreeSize, 16 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 11 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.6s InterpolantComputationTime, 46 NumberOfCodeBlocks, 46 NumberOfCodeBlocksAsserted, 2 NumberOfCheckSat, 66 ConstructedInterpolants, 0 QuantifiedInterpolants, 150 SizeOfPredicates, 2 NumberOfNonLiveVariables, 81 ConjunctsInSsa, 12 ConjunctsInUnsatCore, 3 InterpolantComputations, 2 PerfectInterpolantSequences, 9/12 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: 35]: Loop Invariant Derived loop invariant: x + z * y == z * x + 1 RESULT: Ultimate proved your program to be correct! [2022-04-27 13:21:26,808 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request...