/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/AutomizerCTransformed.xml -s ../../../trunk/examples/settings/loopacceleration/qvasr/qvasr_64.epf -i ../../../trunk/examples/svcomp/loop-lit/gsv2008.c.i.p+cfa-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-34549b5 [2022-04-07 22:35:18,988 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-07 22:35:18,990 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-07 22:35:19,037 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-07 22:35:19,037 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-07 22:35:19,038 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-07 22:35:19,038 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-07 22:35:19,040 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-07 22:35:19,041 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-07 22:35:19,046 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-07 22:35:19,047 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-07 22:35:19,047 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-07 22:35:19,047 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-07 22:35:19,048 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-07 22:35:19,048 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-07 22:35:19,049 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-07 22:35:19,049 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-07 22:35:19,050 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-07 22:35:19,051 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-07 22:35:19,051 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-07 22:35:19,052 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-07 22:35:19,054 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-07 22:35:19,056 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-07 22:35:19,059 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-07 22:35:19,060 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-07 22:35:19,067 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-07 22:35:19,067 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-07 22:35:19,068 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-07 22:35:19,068 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-07 22:35:19,068 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-07 22:35:19,069 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-07 22:35:19,069 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-07 22:35:19,069 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-07 22:35:19,070 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-07 22:35:19,070 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-07 22:35:19,070 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-07 22:35:19,071 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-07 22:35:19,071 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-07 22:35:19,071 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-07 22:35:19,071 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-07 22:35:19,072 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-07 22:35:19,077 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-07 22:35:19,078 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/loopacceleration/qvasr/qvasr_64.epf [2022-04-07 22:35:19,100 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-07 22:35:19,100 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-07 22:35:19,101 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-04-07 22:35:19,101 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-04-07 22:35:19,101 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-04-07 22:35:19,101 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-04-07 22:35:19,101 INFO L138 SettingsManager]: * Use SBE=true [2022-04-07 22:35:19,102 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-07 22:35:19,102 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-07 22:35:19,102 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-07 22:35:19,102 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-07 22:35:19,102 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-07 22:35:19,103 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-07 22:35:19,103 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-07 22:35:19,103 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-07 22:35:19,103 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-07 22:35:19,103 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-07 22:35:19,103 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-07 22:35:19,103 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-07 22:35:19,103 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-07 22:35:19,103 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-07 22:35:19,103 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-04-07 22:35:19,104 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-04-07 22:35:19,104 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-04-07 22:35:19,104 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-04-07 22:35:19,104 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-07 22:35:19,104 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-04-07 22:35:19,104 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-04-07 22:35:19,105 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-04-07 22:35:19,105 INFO L138 SettingsManager]: * TransformationType=LOOP_ACCELERATION_QVASR WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.core: Log level for class -> de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN; [2022-04-07 22:35:19,261 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-07 22:35:19,273 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-07 22:35:19,275 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-07 22:35:19,276 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-07 22:35:19,276 INFO L275 PluginConnector]: CDTParser initialized [2022-04-07 22:35:19,277 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-lit/gsv2008.c.i.p+cfa-reducer.c [2022-04-07 22:35:19,327 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5b3dfad45/00b49a994bbd4085adfc47ae8d5427d9/FLAGa5ab9b508 [2022-04-07 22:35:19,712 INFO L306 CDTParser]: Found 1 translation units. [2022-04-07 22:35:19,713 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-lit/gsv2008.c.i.p+cfa-reducer.c [2022-04-07 22:35:19,717 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5b3dfad45/00b49a994bbd4085adfc47ae8d5427d9/FLAGa5ab9b508 [2022-04-07 22:35:19,725 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5b3dfad45/00b49a994bbd4085adfc47ae8d5427d9 [2022-04-07 22:35:19,726 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-07 22:35:19,727 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-04-07 22:35:19,728 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-07 22:35:19,728 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-07 22:35:19,730 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-07 22:35:19,731 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.04 10:35:19" (1/1) ... [2022-04-07 22:35:19,732 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@18618c4c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 10:35:19, skipping insertion in model container [2022-04-07 22:35:19,732 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.04 10:35:19" (1/1) ... [2022-04-07 22:35:19,737 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-07 22:35:19,746 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-07 22:35:19,880 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-lit/gsv2008.c.i.p+cfa-reducer.c[989,1002] [2022-04-07 22:35:19,882 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-07 22:35:19,887 INFO L203 MainTranslator]: Completed pre-run [2022-04-07 22:35:19,897 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-lit/gsv2008.c.i.p+cfa-reducer.c[989,1002] [2022-04-07 22:35:19,898 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-07 22:35:19,906 INFO L208 MainTranslator]: Completed translation [2022-04-07 22:35:19,906 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 10:35:19 WrapperNode [2022-04-07 22:35:19,906 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-07 22:35:19,907 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-07 22:35:19,907 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-07 22:35:19,907 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-07 22:35:19,913 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 10:35:19" (1/1) ... [2022-04-07 22:35:19,913 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 10:35:19" (1/1) ... [2022-04-07 22:35:19,918 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 10:35:19" (1/1) ... [2022-04-07 22:35:19,918 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 10:35:19" (1/1) ... [2022-04-07 22:35:19,928 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 10:35:19" (1/1) ... [2022-04-07 22:35:19,930 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 10:35:19" (1/1) ... [2022-04-07 22:35:19,931 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 10:35:19" (1/1) ... [2022-04-07 22:35:19,935 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-07 22:35:19,935 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-07 22:35:19,935 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-07 22:35:19,935 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-07 22:35:19,936 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 10:35:19" (1/1) ... [2022-04-07 22:35:19,940 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-07 22:35:19,948 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-07 22:35:19,962 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-04-07 22:35:19,971 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-04-07 22:35:19,998 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-07 22:35:19,999 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-07 22:35:19,999 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-07 22:35:19,999 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-07 22:35:20,000 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-07 22:35:20,000 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-07 22:35:20,000 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-07 22:35:20,001 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-07 22:35:20,002 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-07 22:35:20,002 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-07 22:35:20,002 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-07 22:35:20,002 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-04-07 22:35:20,002 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-07 22:35:20,002 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-07 22:35:20,003 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-07 22:35:20,003 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-07 22:35:20,003 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-07 22:35:20,003 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-07 22:35:20,003 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-07 22:35:20,051 INFO L234 CfgBuilder]: Building ICFG [2022-04-07 22:35:20,052 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-07 22:35:20,170 INFO L275 CfgBuilder]: Performing block encoding [2022-04-07 22:35:20,174 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-07 22:35:20,174 INFO L299 CfgBuilder]: Removed 0 assume(true) statements. [2022-04-07 22:35:20,175 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.04 10:35:20 BoogieIcfgContainer [2022-04-07 22:35:20,175 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-07 22:35:20,176 INFO L113 PluginConnector]: ------------------------IcfgTransformer---------------------------- [2022-04-07 22:35:20,176 INFO L271 PluginConnector]: Initializing IcfgTransformer... [2022-04-07 22:35:20,185 INFO L275 PluginConnector]: IcfgTransformer initialized [2022-04-07 22:35:20,188 INFO L185 PluginConnector]: Executing the observer IcfgTransformationObserver from plugin IcfgTransformer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.04 10:35:20" (1/1) ... [2022-04-07 22:35:20,189 INFO L168 ansformationObserver]: Applying ICFG transformation LOOP_ACCELERATION_QVASR [2022-04-07 22:35:20,209 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 07.04 10:35:20 BasicIcfg [2022-04-07 22:35:20,209 INFO L132 PluginConnector]: ------------------------ END IcfgTransformer---------------------------- [2022-04-07 22:35:20,210 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-07 22:35:20,210 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-07 22:35:20,212 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-07 22:35:20,212 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.04 10:35:19" (1/4) ... [2022-04-07 22:35:20,213 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@27354de7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.04 10:35:20, skipping insertion in model container [2022-04-07 22:35:20,213 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 10:35:19" (2/4) ... [2022-04-07 22:35:20,213 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@27354de7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.04 10:35:20, skipping insertion in model container [2022-04-07 22:35:20,213 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.04 10:35:20" (3/4) ... [2022-04-07 22:35:20,213 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@27354de7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.04 10:35:20, skipping insertion in model container [2022-04-07 22:35:20,213 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 07.04 10:35:20" (4/4) ... [2022-04-07 22:35:20,214 INFO L111 eAbstractionObserver]: Analyzing ICFG gsv2008.c.i.p+cfa-reducer.cqvasr [2022-04-07 22:35:20,217 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-04-07 22:35:20,217 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-07 22:35:20,258 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-07 22:35:20,263 INFO L340 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP [2022-04-07 22:35:20,263 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-07 22:35:20,310 INFO L276 IsEmpty]: Start isEmpty. Operand has 16 states, 10 states have (on average 1.5) internal successors, (15), 11 states have internal predecessors, (15), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-07 22:35:20,313 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-04-07 22:35:20,313 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 22:35:20,313 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-07 22:35:20,314 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 22:35:20,317 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 22:35:20,317 INFO L85 PathProgramCache]: Analyzing trace with hash 323261602, now seen corresponding path program 1 times [2022-04-07 22:35:20,336 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 22:35:20,336 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1288497344] [2022-04-07 22:35:20,337 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 22:35:20,337 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 22:35:20,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 22:35:20,495 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-07 22:35:20,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 22:35:20,511 INFO L290 TraceCheckUtils]: 0: Hoare triple {25#(and (= ~__return_main~0 |old(~__return_main~0)|) (= |old(~__return_144~0)| ~__return_144~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [43] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= v_~__return_144~0_2 0) (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 2) 28) (= 0 v_~__return_main~0_4) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{~__return_main~0=v_~__return_main~0_4, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, ~__return_144~0=v_~__return_144~0_2, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[~__return_main~0, #NULL.offset, ~__return_144~0, #NULL.base] {19#true} is VALID [2022-04-07 22:35:20,511 INFO L290 TraceCheckUtils]: 1: Hoare triple {19#true} [46] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {19#true} is VALID [2022-04-07 22:35:20,511 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {19#true} {19#true} [58] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {19#true} is VALID [2022-04-07 22:35:20,513 INFO L272 TraceCheckUtils]: 0: Hoare triple {19#true} [41] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {25#(and (= ~__return_main~0 |old(~__return_main~0)|) (= |old(~__return_144~0)| ~__return_144~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-07 22:35:20,514 INFO L290 TraceCheckUtils]: 1: Hoare triple {25#(and (= ~__return_main~0 |old(~__return_main~0)|) (= |old(~__return_144~0)| ~__return_144~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [43] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= v_~__return_144~0_2 0) (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 2) 28) (= 0 v_~__return_main~0_4) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{~__return_main~0=v_~__return_main~0_4, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, ~__return_144~0=v_~__return_144~0_2, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[~__return_main~0, #NULL.offset, ~__return_144~0, #NULL.base] {19#true} is VALID [2022-04-07 22:35:20,514 INFO L290 TraceCheckUtils]: 2: Hoare triple {19#true} [46] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {19#true} is VALID [2022-04-07 22:35:20,514 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {19#true} {19#true} [58] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {19#true} is VALID [2022-04-07 22:35:20,514 INFO L272 TraceCheckUtils]: 4: Hoare triple {19#true} [42] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {19#true} is VALID [2022-04-07 22:35:20,515 INFO L290 TraceCheckUtils]: 5: Hoare triple {19#true} [45] mainENTRY-->L19: Formula: (and (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (= (- 50) v_main_~main__x~0_4) (<= |v_main_#t~nondet4_2| 2147483647) (= |v_main_#t~nondet4_2| v_main_~main__y~0_6)) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~main__x~0=v_main_~main__x~0_4, main_~main__y~0=v_main_~main__y~0_6} AuxVars[] AssignedVars[main_#t~nondet4, main_~main__x~0, main_~main__y~0] {24#(<= (+ main_~main__x~0 50) 0)} is VALID [2022-04-07 22:35:20,516 INFO L290 TraceCheckUtils]: 6: Hoare triple {24#(<= (+ main_~main__x~0 50) 0)} [48] L19-->L25: Formula: (< 0 (+ 1000 v_main_~main__y~0_10)) InVars {main_~main__y~0=v_main_~main__y~0_10} OutVars{main_~main__y~0=v_main_~main__y~0_10} AuxVars[] AssignedVars[] {24#(<= (+ main_~main__x~0 50) 0)} is VALID [2022-04-07 22:35:20,517 INFO L290 TraceCheckUtils]: 7: Hoare triple {24#(<= (+ main_~main__x~0 50) 0)} [51] L25-->L37: Formula: (< v_main_~main__y~0_2 1000000) InVars {main_~main__y~0=v_main_~main__y~0_2} OutVars{main_~main__y~0=v_main_~main__y~0_2} AuxVars[] AssignedVars[] {24#(<= (+ main_~main__x~0 50) 0)} is VALID [2022-04-07 22:35:20,517 INFO L290 TraceCheckUtils]: 8: Hoare triple {24#(<= (+ main_~main__x~0 50) 0)} [53] L37-->L46: Formula: (and (not (< v_main_~main__x~0_3 0)) (= v_main_~__tmp_1~0_1 v_main_~__VERIFIER_assert__cond~0_1) (= (ite (< 0 v_main_~main__y~0_5) 1 0) v_main_~__tmp_1~0_1)) InVars {main_~main__x~0=v_main_~main__x~0_3, main_~main__y~0=v_main_~main__y~0_5} OutVars{main_~__VERIFIER_assert__cond~0=v_main_~__VERIFIER_assert__cond~0_1, main_~main__x~0=v_main_~main__x~0_3, main_~main__y~0=v_main_~main__y~0_5, main_~__tmp_1~0=v_main_~__tmp_1~0_1} AuxVars[] AssignedVars[main_~__VERIFIER_assert__cond~0, main_~__tmp_1~0] {20#false} is VALID [2022-04-07 22:35:20,518 INFO L290 TraceCheckUtils]: 9: Hoare triple {20#false} [54] L46-->L48: Formula: (= v_main_~__VERIFIER_assert__cond~0_3 0) InVars {main_~__VERIFIER_assert__cond~0=v_main_~__VERIFIER_assert__cond~0_3} OutVars{main_~__VERIFIER_assert__cond~0=v_main_~__VERIFIER_assert__cond~0_3} AuxVars[] AssignedVars[] {20#false} is VALID [2022-04-07 22:35:20,518 INFO L290 TraceCheckUtils]: 10: Hoare triple {20#false} [56] L48-->mainErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {20#false} is VALID [2022-04-07 22:35:20,518 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-07 22:35:20,518 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 22:35:20,519 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1288497344] [2022-04-07 22:35:20,520 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1288497344] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-07 22:35:20,520 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-07 22:35:20,520 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-07 22:35:20,521 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [543395336] [2022-04-07 22:35:20,521 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-07 22:35:20,524 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 11 [2022-04-07 22:35:20,525 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 22:35:20,527 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 22:35:20,545 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 11 edges. 11 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 22:35:20,546 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-07 22:35:20,546 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 22:35:20,561 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-07 22:35:20,562 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-07 22:35:20,564 INFO L87 Difference]: Start difference. First operand has 16 states, 10 states have (on average 1.5) internal successors, (15), 11 states have internal predecessors, (15), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 22:35:20,676 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 22:35:20,676 INFO L93 Difference]: Finished difference Result 26 states and 30 transitions. [2022-04-07 22:35:20,676 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-07 22:35:20,676 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 11 [2022-04-07 22:35:20,677 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 22:35:20,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 22:35:20,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 30 transitions. [2022-04-07 22:35:20,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 22:35:20,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 30 transitions. [2022-04-07 22:35:20,686 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 30 transitions. [2022-04-07 22:35:20,717 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 30 edges. 30 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 22:35:20,723 INFO L225 Difference]: With dead ends: 26 [2022-04-07 22:35:20,723 INFO L226 Difference]: Without dead ends: 13 [2022-04-07 22:35:20,727 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-07 22:35:20,729 INFO L913 BasicCegarLoop]: 15 mSDtfsCounter, 13 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 25 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-07 22:35:20,729 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [13 Valid, 25 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-07 22:35:20,740 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2022-04-07 22:35:20,753 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2022-04-07 22:35:20,753 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 22:35:20,753 INFO L82 GeneralOperation]: Start isEquivalent. First operand 13 states. Second operand has 13 states, 9 states have (on average 1.1111111111111112) internal successors, (10), 9 states have internal predecessors, (10), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 22:35:20,754 INFO L74 IsIncluded]: Start isIncluded. First operand 13 states. Second operand has 13 states, 9 states have (on average 1.1111111111111112) internal successors, (10), 9 states have internal predecessors, (10), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 22:35:20,754 INFO L87 Difference]: Start difference. First operand 13 states. Second operand has 13 states, 9 states have (on average 1.1111111111111112) internal successors, (10), 9 states have internal predecessors, (10), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 22:35:20,756 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 22:35:20,756 INFO L93 Difference]: Finished difference Result 13 states and 13 transitions. [2022-04-07 22:35:20,756 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 13 transitions. [2022-04-07 22:35:20,756 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 22:35:20,756 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 22:35:20,756 INFO L74 IsIncluded]: Start isIncluded. First operand has 13 states, 9 states have (on average 1.1111111111111112) internal successors, (10), 9 states have internal predecessors, (10), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 13 states. [2022-04-07 22:35:20,757 INFO L87 Difference]: Start difference. First operand has 13 states, 9 states have (on average 1.1111111111111112) internal successors, (10), 9 states have internal predecessors, (10), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 13 states. [2022-04-07 22:35:20,758 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 22:35:20,758 INFO L93 Difference]: Finished difference Result 13 states and 13 transitions. [2022-04-07 22:35:20,758 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 13 transitions. [2022-04-07 22:35:20,758 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 22:35:20,758 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 22:35:20,759 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 22:35:20,759 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 22:35:20,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 9 states have (on average 1.1111111111111112) internal successors, (10), 9 states have internal predecessors, (10), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 22:35:20,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 13 transitions. [2022-04-07 22:35:20,760 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 13 transitions. Word has length 11 [2022-04-07 22:35:20,761 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 22:35:20,761 INFO L478 AbstractCegarLoop]: Abstraction has 13 states and 13 transitions. [2022-04-07 22:35:20,761 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 22:35:20,761 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 13 transitions. [2022-04-07 22:35:20,761 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-04-07 22:35:20,761 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 22:35:20,762 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-07 22:35:20,762 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-07 22:35:20,762 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 22:35:20,762 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 22:35:20,763 INFO L85 PathProgramCache]: Analyzing trace with hash 1431144312, now seen corresponding path program 1 times [2022-04-07 22:35:20,763 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 22:35:20,763 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1893098896] [2022-04-07 22:35:20,763 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 22:35:20,763 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 22:35:20,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 22:35:20,834 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-07 22:35:20,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 22:35:20,846 INFO L290 TraceCheckUtils]: 0: Hoare triple {115#(and (= ~__return_main~0 |old(~__return_main~0)|) (= |old(~__return_144~0)| ~__return_144~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [43] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= v_~__return_144~0_2 0) (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 2) 28) (= 0 v_~__return_main~0_4) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{~__return_main~0=v_~__return_main~0_4, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, ~__return_144~0=v_~__return_144~0_2, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[~__return_main~0, #NULL.offset, ~__return_144~0, #NULL.base] {107#true} is VALID [2022-04-07 22:35:20,846 INFO L290 TraceCheckUtils]: 1: Hoare triple {107#true} [46] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {107#true} is VALID [2022-04-07 22:35:20,846 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {107#true} {107#true} [58] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {107#true} is VALID [2022-04-07 22:35:20,847 INFO L272 TraceCheckUtils]: 0: Hoare triple {107#true} [41] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {115#(and (= ~__return_main~0 |old(~__return_main~0)|) (= |old(~__return_144~0)| ~__return_144~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-07 22:35:20,847 INFO L290 TraceCheckUtils]: 1: Hoare triple {115#(and (= ~__return_main~0 |old(~__return_main~0)|) (= |old(~__return_144~0)| ~__return_144~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [43] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= v_~__return_144~0_2 0) (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 2) 28) (= 0 v_~__return_main~0_4) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{~__return_main~0=v_~__return_main~0_4, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, ~__return_144~0=v_~__return_144~0_2, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[~__return_main~0, #NULL.offset, ~__return_144~0, #NULL.base] {107#true} is VALID [2022-04-07 22:35:20,848 INFO L290 TraceCheckUtils]: 2: Hoare triple {107#true} [46] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {107#true} is VALID [2022-04-07 22:35:20,848 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {107#true} {107#true} [58] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {107#true} is VALID [2022-04-07 22:35:20,848 INFO L272 TraceCheckUtils]: 4: Hoare triple {107#true} [42] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {107#true} is VALID [2022-04-07 22:35:20,848 INFO L290 TraceCheckUtils]: 5: Hoare triple {107#true} [45] mainENTRY-->L19: Formula: (and (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (= (- 50) v_main_~main__x~0_4) (<= |v_main_#t~nondet4_2| 2147483647) (= |v_main_#t~nondet4_2| v_main_~main__y~0_6)) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~main__x~0=v_main_~main__x~0_4, main_~main__y~0=v_main_~main__y~0_6} AuxVars[] AssignedVars[main_#t~nondet4, main_~main__x~0, main_~main__y~0] {112#(<= (+ main_~main__x~0 50) 0)} is VALID [2022-04-07 22:35:20,849 INFO L290 TraceCheckUtils]: 6: Hoare triple {112#(<= (+ main_~main__x~0 50) 0)} [48] L19-->L25: Formula: (< 0 (+ 1000 v_main_~main__y~0_10)) InVars {main_~main__y~0=v_main_~main__y~0_10} OutVars{main_~main__y~0=v_main_~main__y~0_10} AuxVars[] AssignedVars[] {112#(<= (+ main_~main__x~0 50) 0)} is VALID [2022-04-07 22:35:20,849 INFO L290 TraceCheckUtils]: 7: Hoare triple {112#(<= (+ main_~main__x~0 50) 0)} [51] L25-->L37: Formula: (< v_main_~main__y~0_2 1000000) InVars {main_~main__y~0=v_main_~main__y~0_2} OutVars{main_~main__y~0=v_main_~main__y~0_2} AuxVars[] AssignedVars[] {112#(<= (+ main_~main__x~0 50) 0)} is VALID [2022-04-07 22:35:20,850 INFO L290 TraceCheckUtils]: 8: Hoare triple {112#(<= (+ main_~main__x~0 50) 0)} [52] L37-->L37: Formula: (and (= v_main_~main____CPAchecker_TMP_0~0_1 v_main_~main__y~0_4) (= (+ v_main_~main__y~0_4 1) v_main_~main__y~0_3) (< v_main_~main__x~0_2 0) (= (+ v_main_~main__x~0_2 v_main_~main__y~0_4) v_main_~main__x~0_1)) InVars {main_~main__x~0=v_main_~main__x~0_2, main_~main__y~0=v_main_~main__y~0_4} OutVars{main_~main____CPAchecker_TMP_0~0=v_main_~main____CPAchecker_TMP_0~0_1, main_~main__x~0=v_main_~main__x~0_1, main_~main__y~0=v_main_~main__y~0_3} AuxVars[] AssignedVars[main_~main____CPAchecker_TMP_0~0, main_~main__x~0, main_~main__y~0] {113#(<= (+ 51 main_~main__x~0) main_~main__y~0)} is VALID [2022-04-07 22:35:20,851 INFO L290 TraceCheckUtils]: 9: Hoare triple {113#(<= (+ 51 main_~main__x~0) main_~main__y~0)} [53] L37-->L46: Formula: (and (not (< v_main_~main__x~0_3 0)) (= v_main_~__tmp_1~0_1 v_main_~__VERIFIER_assert__cond~0_1) (= (ite (< 0 v_main_~main__y~0_5) 1 0) v_main_~__tmp_1~0_1)) InVars {main_~main__x~0=v_main_~main__x~0_3, main_~main__y~0=v_main_~main__y~0_5} OutVars{main_~__VERIFIER_assert__cond~0=v_main_~__VERIFIER_assert__cond~0_1, main_~main__x~0=v_main_~main__x~0_3, main_~main__y~0=v_main_~main__y~0_5, main_~__tmp_1~0=v_main_~__tmp_1~0_1} AuxVars[] AssignedVars[main_~__VERIFIER_assert__cond~0, main_~__tmp_1~0] {114#(not (= main_~__VERIFIER_assert__cond~0 0))} is VALID [2022-04-07 22:35:20,851 INFO L290 TraceCheckUtils]: 10: Hoare triple {114#(not (= main_~__VERIFIER_assert__cond~0 0))} [54] L46-->L48: Formula: (= v_main_~__VERIFIER_assert__cond~0_3 0) InVars {main_~__VERIFIER_assert__cond~0=v_main_~__VERIFIER_assert__cond~0_3} OutVars{main_~__VERIFIER_assert__cond~0=v_main_~__VERIFIER_assert__cond~0_3} AuxVars[] AssignedVars[] {108#false} is VALID [2022-04-07 22:35:20,851 INFO L290 TraceCheckUtils]: 11: Hoare triple {108#false} [56] L48-->mainErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {108#false} is VALID [2022-04-07 22:35:20,852 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-07 22:35:20,852 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 22:35:20,853 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1893098896] [2022-04-07 22:35:20,853 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1893098896] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-07 22:35:20,853 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [707637485] [2022-04-07 22:35:20,853 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 22:35:20,854 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 22:35:20,854 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-07 22:35:20,858 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-07 22:35:20,862 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-04-07 22:35:20,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 22:35:20,897 INFO L263 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-07 22:35:20,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 22:35:20,907 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-07 22:35:21,062 INFO L272 TraceCheckUtils]: 0: Hoare triple {107#true} [41] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {107#true} is VALID [2022-04-07 22:35:21,062 INFO L290 TraceCheckUtils]: 1: Hoare triple {107#true} [43] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= v_~__return_144~0_2 0) (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 2) 28) (= 0 v_~__return_main~0_4) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{~__return_main~0=v_~__return_main~0_4, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, ~__return_144~0=v_~__return_144~0_2, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[~__return_main~0, #NULL.offset, ~__return_144~0, #NULL.base] {107#true} is VALID [2022-04-07 22:35:21,062 INFO L290 TraceCheckUtils]: 2: Hoare triple {107#true} [46] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {107#true} is VALID [2022-04-07 22:35:21,063 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {107#true} {107#true} [58] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {107#true} is VALID [2022-04-07 22:35:21,063 INFO L272 TraceCheckUtils]: 4: Hoare triple {107#true} [42] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {107#true} is VALID [2022-04-07 22:35:21,063 INFO L290 TraceCheckUtils]: 5: Hoare triple {107#true} [45] mainENTRY-->L19: Formula: (and (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (= (- 50) v_main_~main__x~0_4) (<= |v_main_#t~nondet4_2| 2147483647) (= |v_main_#t~nondet4_2| v_main_~main__y~0_6)) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~main__x~0=v_main_~main__x~0_4, main_~main__y~0=v_main_~main__y~0_6} AuxVars[] AssignedVars[main_#t~nondet4, main_~main__x~0, main_~main__y~0] {112#(<= (+ main_~main__x~0 50) 0)} is VALID [2022-04-07 22:35:21,064 INFO L290 TraceCheckUtils]: 6: Hoare triple {112#(<= (+ main_~main__x~0 50) 0)} [48] L19-->L25: Formula: (< 0 (+ 1000 v_main_~main__y~0_10)) InVars {main_~main__y~0=v_main_~main__y~0_10} OutVars{main_~main__y~0=v_main_~main__y~0_10} AuxVars[] AssignedVars[] {112#(<= (+ main_~main__x~0 50) 0)} is VALID [2022-04-07 22:35:21,064 INFO L290 TraceCheckUtils]: 7: Hoare triple {112#(<= (+ main_~main__x~0 50) 0)} [51] L25-->L37: Formula: (< v_main_~main__y~0_2 1000000) InVars {main_~main__y~0=v_main_~main__y~0_2} OutVars{main_~main__y~0=v_main_~main__y~0_2} AuxVars[] AssignedVars[] {112#(<= (+ main_~main__x~0 50) 0)} is VALID [2022-04-07 22:35:21,065 INFO L290 TraceCheckUtils]: 8: Hoare triple {112#(<= (+ main_~main__x~0 50) 0)} [52] L37-->L37: Formula: (and (= v_main_~main____CPAchecker_TMP_0~0_1 v_main_~main__y~0_4) (= (+ v_main_~main__y~0_4 1) v_main_~main__y~0_3) (< v_main_~main__x~0_2 0) (= (+ v_main_~main__x~0_2 v_main_~main__y~0_4) v_main_~main__x~0_1)) InVars {main_~main__x~0=v_main_~main__x~0_2, main_~main__y~0=v_main_~main__y~0_4} OutVars{main_~main____CPAchecker_TMP_0~0=v_main_~main____CPAchecker_TMP_0~0_1, main_~main__x~0=v_main_~main__x~0_1, main_~main__y~0=v_main_~main__y~0_3} AuxVars[] AssignedVars[main_~main____CPAchecker_TMP_0~0, main_~main__x~0, main_~main__y~0] {113#(<= (+ 51 main_~main__x~0) main_~main__y~0)} is VALID [2022-04-07 22:35:21,065 INFO L290 TraceCheckUtils]: 9: Hoare triple {113#(<= (+ 51 main_~main__x~0) main_~main__y~0)} [53] L37-->L46: Formula: (and (not (< v_main_~main__x~0_3 0)) (= v_main_~__tmp_1~0_1 v_main_~__VERIFIER_assert__cond~0_1) (= (ite (< 0 v_main_~main__y~0_5) 1 0) v_main_~__tmp_1~0_1)) InVars {main_~main__x~0=v_main_~main__x~0_3, main_~main__y~0=v_main_~main__y~0_5} OutVars{main_~__VERIFIER_assert__cond~0=v_main_~__VERIFIER_assert__cond~0_1, main_~main__x~0=v_main_~main__x~0_3, main_~main__y~0=v_main_~main__y~0_5, main_~__tmp_1~0=v_main_~__tmp_1~0_1} AuxVars[] AssignedVars[main_~__VERIFIER_assert__cond~0, main_~__tmp_1~0] {146#(<= 1 main_~__VERIFIER_assert__cond~0)} is VALID [2022-04-07 22:35:21,066 INFO L290 TraceCheckUtils]: 10: Hoare triple {146#(<= 1 main_~__VERIFIER_assert__cond~0)} [54] L46-->L48: Formula: (= v_main_~__VERIFIER_assert__cond~0_3 0) InVars {main_~__VERIFIER_assert__cond~0=v_main_~__VERIFIER_assert__cond~0_3} OutVars{main_~__VERIFIER_assert__cond~0=v_main_~__VERIFIER_assert__cond~0_3} AuxVars[] AssignedVars[] {108#false} is VALID [2022-04-07 22:35:21,066 INFO L290 TraceCheckUtils]: 11: Hoare triple {108#false} [56] L48-->mainErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {108#false} is VALID [2022-04-07 22:35:21,066 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-07 22:35:21,066 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-07 22:35:21,190 INFO L290 TraceCheckUtils]: 11: Hoare triple {108#false} [56] L48-->mainErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {108#false} is VALID [2022-04-07 22:35:21,191 INFO L290 TraceCheckUtils]: 10: Hoare triple {146#(<= 1 main_~__VERIFIER_assert__cond~0)} [54] L46-->L48: Formula: (= v_main_~__VERIFIER_assert__cond~0_3 0) InVars {main_~__VERIFIER_assert__cond~0=v_main_~__VERIFIER_assert__cond~0_3} OutVars{main_~__VERIFIER_assert__cond~0=v_main_~__VERIFIER_assert__cond~0_3} AuxVars[] AssignedVars[] {108#false} is VALID [2022-04-07 22:35:21,192 INFO L290 TraceCheckUtils]: 9: Hoare triple {159#(or (< main_~main__x~0 0) (< 0 main_~main__y~0))} [53] L37-->L46: Formula: (and (not (< v_main_~main__x~0_3 0)) (= v_main_~__tmp_1~0_1 v_main_~__VERIFIER_assert__cond~0_1) (= (ite (< 0 v_main_~main__y~0_5) 1 0) v_main_~__tmp_1~0_1)) InVars {main_~main__x~0=v_main_~main__x~0_3, main_~main__y~0=v_main_~main__y~0_5} OutVars{main_~__VERIFIER_assert__cond~0=v_main_~__VERIFIER_assert__cond~0_1, main_~main__x~0=v_main_~main__x~0_3, main_~main__y~0=v_main_~main__y~0_5, main_~__tmp_1~0=v_main_~__tmp_1~0_1} AuxVars[] AssignedVars[main_~__VERIFIER_assert__cond~0, main_~__tmp_1~0] {146#(<= 1 main_~__VERIFIER_assert__cond~0)} is VALID [2022-04-07 22:35:21,192 INFO L290 TraceCheckUtils]: 8: Hoare triple {163#(< main_~main__x~0 1)} [52] L37-->L37: Formula: (and (= v_main_~main____CPAchecker_TMP_0~0_1 v_main_~main__y~0_4) (= (+ v_main_~main__y~0_4 1) v_main_~main__y~0_3) (< v_main_~main__x~0_2 0) (= (+ v_main_~main__x~0_2 v_main_~main__y~0_4) v_main_~main__x~0_1)) InVars {main_~main__x~0=v_main_~main__x~0_2, main_~main__y~0=v_main_~main__y~0_4} OutVars{main_~main____CPAchecker_TMP_0~0=v_main_~main____CPAchecker_TMP_0~0_1, main_~main__x~0=v_main_~main__x~0_1, main_~main__y~0=v_main_~main__y~0_3} AuxVars[] AssignedVars[main_~main____CPAchecker_TMP_0~0, main_~main__x~0, main_~main__y~0] {159#(or (< main_~main__x~0 0) (< 0 main_~main__y~0))} is VALID [2022-04-07 22:35:21,193 INFO L290 TraceCheckUtils]: 7: Hoare triple {163#(< main_~main__x~0 1)} [51] L25-->L37: Formula: (< v_main_~main__y~0_2 1000000) InVars {main_~main__y~0=v_main_~main__y~0_2} OutVars{main_~main__y~0=v_main_~main__y~0_2} AuxVars[] AssignedVars[] {163#(< main_~main__x~0 1)} is VALID [2022-04-07 22:35:21,193 INFO L290 TraceCheckUtils]: 6: Hoare triple {163#(< main_~main__x~0 1)} [48] L19-->L25: Formula: (< 0 (+ 1000 v_main_~main__y~0_10)) InVars {main_~main__y~0=v_main_~main__y~0_10} OutVars{main_~main__y~0=v_main_~main__y~0_10} AuxVars[] AssignedVars[] {163#(< main_~main__x~0 1)} is VALID [2022-04-07 22:35:21,194 INFO L290 TraceCheckUtils]: 5: Hoare triple {107#true} [45] mainENTRY-->L19: Formula: (and (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (= (- 50) v_main_~main__x~0_4) (<= |v_main_#t~nondet4_2| 2147483647) (= |v_main_#t~nondet4_2| v_main_~main__y~0_6)) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~main__x~0=v_main_~main__x~0_4, main_~main__y~0=v_main_~main__y~0_6} AuxVars[] AssignedVars[main_#t~nondet4, main_~main__x~0, main_~main__y~0] {163#(< main_~main__x~0 1)} is VALID [2022-04-07 22:35:21,194 INFO L272 TraceCheckUtils]: 4: Hoare triple {107#true} [42] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {107#true} is VALID [2022-04-07 22:35:21,194 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {107#true} {107#true} [58] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {107#true} is VALID [2022-04-07 22:35:21,194 INFO L290 TraceCheckUtils]: 2: Hoare triple {107#true} [46] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {107#true} is VALID [2022-04-07 22:35:21,195 INFO L290 TraceCheckUtils]: 1: Hoare triple {107#true} [43] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= v_~__return_144~0_2 0) (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 2) 28) (= 0 v_~__return_main~0_4) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{~__return_main~0=v_~__return_main~0_4, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, ~__return_144~0=v_~__return_144~0_2, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[~__return_main~0, #NULL.offset, ~__return_144~0, #NULL.base] {107#true} is VALID [2022-04-07 22:35:21,195 INFO L272 TraceCheckUtils]: 0: Hoare triple {107#true} [41] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {107#true} is VALID [2022-04-07 22:35:21,195 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-07 22:35:21,195 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [707637485] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-07 22:35:21,195 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-07 22:35:21,195 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 9 [2022-04-07 22:35:21,196 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [424364991] [2022-04-07 22:35:21,196 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-07 22:35:21,197 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 1.8888888888888888) internal successors, (17), 8 states have internal predecessors, (17), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2022-04-07 22:35:21,197 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 22:35:21,197 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 9 states, 9 states have (on average 1.8888888888888888) internal successors, (17), 8 states have internal predecessors, (17), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 22:35:21,212 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 21 edges. 21 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 22:35:21,212 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-04-07 22:35:21,212 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 22:35:21,213 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-04-07 22:35:21,213 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2022-04-07 22:35:21,213 INFO L87 Difference]: Start difference. First operand 13 states and 13 transitions. Second operand has 9 states, 9 states have (on average 1.8888888888888888) internal successors, (17), 8 states have internal predecessors, (17), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 22:35:21,338 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 22:35:21,338 INFO L93 Difference]: Finished difference Result 15 states and 16 transitions. [2022-04-07 22:35:21,338 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-07 22:35:21,338 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 1.8888888888888888) internal successors, (17), 8 states have internal predecessors, (17), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2022-04-07 22:35:21,338 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 22:35:21,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 1.8888888888888888) internal successors, (17), 8 states have internal predecessors, (17), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 22:35:21,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 16 transitions. [2022-04-07 22:35:21,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 1.8888888888888888) internal successors, (17), 8 states have internal predecessors, (17), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 22:35:21,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 16 transitions. [2022-04-07 22:35:21,340 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 16 transitions. [2022-04-07 22:35:21,355 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 16 edges. 16 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 22:35:21,355 INFO L225 Difference]: With dead ends: 15 [2022-04-07 22:35:21,355 INFO L226 Difference]: Without dead ends: 0 [2022-04-07 22:35:21,355 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 22 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=53, Invalid=129, Unknown=0, NotChecked=0, Total=182 [2022-04-07 22:35:21,356 INFO L913 BasicCegarLoop]: 8 mSDtfsCounter, 9 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 40 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-07 22:35:21,356 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [9 Valid, 40 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-07 22:35:21,357 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-04-07 22:35:21,357 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-04-07 22:35:21,357 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 22:35:21,357 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-07 22:35:21,357 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-07 22:35:21,357 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-07 22:35:21,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 22:35:21,358 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-07 22:35:21,358 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-07 22:35:21,358 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 22:35:21,358 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 22:35:21,358 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-07 22:35:21,358 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-07 22:35:21,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 22:35:21,358 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-07 22:35:21,358 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-07 22:35:21,358 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 22:35:21,359 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 22:35:21,359 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 22:35:21,359 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 22:35:21,359 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-07 22:35:21,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-04-07 22:35:21,359 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 12 [2022-04-07 22:35:21,359 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 22:35:21,359 INFO L478 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-04-07 22:35:21,359 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 1.8888888888888888) internal successors, (17), 8 states have internal predecessors, (17), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 22:35:21,359 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-07 22:35:21,360 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 22:35:21,361 INFO L788 garLoopResultBuilder]: Registering result SAFE for location mainErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-04-07 22:35:21,378 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-04-07 22:35:21,575 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 22:35:21,577 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-04-07 22:35:21,606 INFO L878 garLoopResultBuilder]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (and (= ~__return_main~0 |old(~__return_main~0)|) (= |old(~__return_144~0)| ~__return_144~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|)) [2022-04-07 22:35:21,606 INFO L882 garLoopResultBuilder]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2022-04-07 22:35:21,606 INFO L882 garLoopResultBuilder]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2022-04-07 22:35:21,606 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2022-04-07 22:35:21,606 INFO L885 garLoopResultBuilder]: At program point L-1(line -1) the Hoare annotation is: true [2022-04-07 22:35:21,606 INFO L882 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2022-04-07 22:35:21,606 INFO L882 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-04-07 22:35:21,606 INFO L878 garLoopResultBuilder]: At program point mainENTRY(lines 13 60) the Hoare annotation is: (= |old(~__return_144~0)| ~__return_144~0) [2022-04-07 22:35:21,607 INFO L882 garLoopResultBuilder]: For program point L19(lines 19 59) no Hoare annotation was computed. [2022-04-07 22:35:21,607 INFO L882 garLoopResultBuilder]: For program point mainFINAL(lines 13 60) no Hoare annotation was computed. [2022-04-07 22:35:21,607 INFO L882 garLoopResultBuilder]: For program point L25(lines 25 58) no Hoare annotation was computed. [2022-04-07 22:35:21,607 INFO L882 garLoopResultBuilder]: For program point mainEXIT(lines 13 60) no Hoare annotation was computed. [2022-04-07 22:35:21,607 INFO L878 garLoopResultBuilder]: At program point L37(lines 30 58) the Hoare annotation is: (and (or (< main_~main__x~0 0) (< 0 main_~main__y~0)) (= |old(~__return_144~0)| ~__return_144~0)) [2022-04-07 22:35:21,607 INFO L882 garLoopResultBuilder]: For program point L46(lines 46 55) no Hoare annotation was computed. [2022-04-07 22:35:21,607 INFO L882 garLoopResultBuilder]: For program point L48(line 48) no Hoare annotation was computed. [2022-04-07 22:35:21,607 INFO L882 garLoopResultBuilder]: For program point mainErr0ASSERT_VIOLATIONERROR_FUNCTION(line 48) no Hoare annotation was computed. [2022-04-07 22:35:21,609 INFO L719 BasicCegarLoop]: Path program histogram: [1, 1] [2022-04-07 22:35:21,610 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-04-07 22:35:21,613 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2022-04-07 22:35:21,613 WARN L170 areAnnotationChecker]: L19 has no Hoare annotation [2022-04-07 22:35:21,613 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2022-04-07 22:35:21,613 WARN L170 areAnnotationChecker]: L19 has no Hoare annotation [2022-04-07 22:35:21,613 WARN L170 areAnnotationChecker]: L19 has no Hoare annotation [2022-04-07 22:35:21,613 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2022-04-07 22:35:21,614 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2022-04-07 22:35:21,614 WARN L170 areAnnotationChecker]: L25 has no Hoare annotation [2022-04-07 22:35:21,614 WARN L170 areAnnotationChecker]: L25 has no Hoare annotation [2022-04-07 22:35:21,614 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2022-04-07 22:35:21,615 WARN L170 areAnnotationChecker]: L46 has no Hoare annotation [2022-04-07 22:35:21,615 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2022-04-07 22:35:21,615 WARN L170 areAnnotationChecker]: L46 has no Hoare annotation [2022-04-07 22:35:21,615 WARN L170 areAnnotationChecker]: L46 has no Hoare annotation [2022-04-07 22:35:21,615 WARN L170 areAnnotationChecker]: L48 has no Hoare annotation [2022-04-07 22:35:21,615 WARN L170 areAnnotationChecker]: L48 has no Hoare annotation [2022-04-07 22:35:21,615 INFO L163 areAnnotationChecker]: CFG has 3 edges. 3 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2022-04-07 22:35:21,622 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.04 10:35:21 BasicIcfg [2022-04-07 22:35:21,622 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-04-07 22:35:21,623 INFO L158 Benchmark]: Toolchain (without parser) took 1895.66ms. Allocated memory was 177.2MB in the beginning and 212.9MB in the end (delta: 35.7MB). Free memory was 125.9MB in the beginning and 133.3MB in the end (delta: -7.4MB). Peak memory consumption was 29.0MB. Max. memory is 8.0GB. [2022-04-07 22:35:21,623 INFO L158 Benchmark]: CDTParser took 0.10ms. Allocated memory is still 177.2MB. Free memory is still 141.8MB. There was no memory consumed. Max. memory is 8.0GB. [2022-04-07 22:35:21,624 INFO L158 Benchmark]: CACSL2BoogieTranslator took 178.12ms. Allocated memory is still 177.2MB. Free memory was 125.8MB in the beginning and 152.0MB in the end (delta: -26.2MB). Peak memory consumption was 8.9MB. Max. memory is 8.0GB. [2022-04-07 22:35:21,624 INFO L158 Benchmark]: Boogie Preprocessor took 27.74ms. Allocated memory is still 177.2MB. Free memory was 152.0MB in the beginning and 150.5MB in the end (delta: 1.5MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-04-07 22:35:21,624 INFO L158 Benchmark]: RCFGBuilder took 240.03ms. Allocated memory is still 177.2MB. Free memory was 150.5MB in the beginning and 140.1MB in the end (delta: 10.4MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. [2022-04-07 22:35:21,624 INFO L158 Benchmark]: IcfgTransformer took 33.37ms. Allocated memory is still 177.2MB. Free memory was 140.1MB in the beginning and 138.7MB in the end (delta: 1.4MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-04-07 22:35:21,625 INFO L158 Benchmark]: TraceAbstraction took 1412.16ms. Allocated memory was 177.2MB in the beginning and 212.9MB in the end (delta: 35.7MB). Free memory was 138.0MB in the beginning and 133.3MB in the end (delta: 4.7MB). Peak memory consumption was 41.0MB. Max. memory is 8.0GB. [2022-04-07 22:35:21,626 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 177.2MB. Free memory is still 141.8MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 178.12ms. Allocated memory is still 177.2MB. Free memory was 125.8MB in the beginning and 152.0MB in the end (delta: -26.2MB). Peak memory consumption was 8.9MB. Max. memory is 8.0GB. * Boogie Preprocessor took 27.74ms. Allocated memory is still 177.2MB. Free memory was 152.0MB in the beginning and 150.5MB in the end (delta: 1.5MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 240.03ms. Allocated memory is still 177.2MB. Free memory was 150.5MB in the beginning and 140.1MB in the end (delta: 10.4MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. * IcfgTransformer took 33.37ms. Allocated memory is still 177.2MB. Free memory was 140.1MB in the beginning and 138.7MB in the end (delta: 1.4MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * TraceAbstraction took 1412.16ms. Allocated memory was 177.2MB in the beginning and 212.9MB in the end (delta: 35.7MB). Free memory was 138.0MB in the beginning and 133.3MB in the end (delta: 4.7MB). Peak memory consumption was 41.0MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 48]: 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 3 procedures, 16 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 1.4s, OverallIterations: 2, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 22 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 22 mSDsluCounter, 65 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 42 mSDsCounter, 10 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 38 IncrementalHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 10 mSolverCounterUnsat, 23 mSDtfsCounter, 38 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 41 GetRequests, 25 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=16occurred in iteration=0, InterpolantAutomatonStates: 12, 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, 5 LocationsWithAnnotation, 5 PreInvPairs, 7 NumberOfFragments, 29 HoareAnnotationTreeSize, 5 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 5 FomulaSimplificationsInter, 19 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.5s InterpolantComputationTime, 35 NumberOfCodeBlocks, 35 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 43 ConstructedInterpolants, 0 QuantifiedInterpolants, 130 SizeOfPredicates, 4 NumberOfNonLiveVariables, 76 ConjunctsInSsa, 7 ConjunctsInUnsatCore, 4 InterpolantComputations, 1 PerfectInterpolantSequences, 0/3 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: 30]: Loop Invariant Derived loop invariant: (main__x < 0 || 0 < main__y) && \old(__return_144) == __return_144 RESULT: Ultimate proved your program to be correct! [2022-04-07 22:35:21,651 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...