/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.v+cfa-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-fb4f59a-m [2022-04-27 21:41:37,205 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-27 21:41:37,207 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-27 21:41:37,249 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-27 21:41:37,249 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-27 21:41:37,251 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-27 21:41:37,254 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-27 21:41:37,256 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-27 21:41:37,257 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-27 21:41:37,261 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-27 21:41:37,262 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-27 21:41:37,264 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-27 21:41:37,264 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-27 21:41:37,266 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-27 21:41:37,267 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-27 21:41:37,269 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-27 21:41:37,270 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-27 21:41:37,270 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-27 21:41:37,272 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-27 21:41:37,277 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-27 21:41:37,278 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-27 21:41:37,279 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-27 21:41:37,280 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-27 21:41:37,281 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-27 21:41:37,282 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-27 21:41:37,288 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-27 21:41:37,289 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-27 21:41:37,289 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-27 21:41:37,290 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-27 21:41:37,290 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-27 21:41:37,291 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-27 21:41:37,291 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-27 21:41:37,293 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-27 21:41:37,293 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-27 21:41:37,294 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-27 21:41:37,294 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-27 21:41:37,295 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-27 21:41:37,295 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-27 21:41:37,296 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-27 21:41:37,296 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-27 21:41:37,297 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-27 21:41:37,298 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-27 21:41:37,298 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/loopacceleration/qvasr/qvasr_64.epf [2022-04-27 21:41:37,326 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-27 21:41:37,326 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-27 21:41:37,327 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-04-27 21:41:37,327 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-04-27 21:41:37,328 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-04-27 21:41:37,328 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-04-27 21:41:37,328 INFO L138 SettingsManager]: * Use SBE=true [2022-04-27 21:41:37,328 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-27 21:41:37,329 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-27 21:41:37,329 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-27 21:41:37,329 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-27 21:41:37,330 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-27 21:41:37,330 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-27 21:41:37,330 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-27 21:41:37,330 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-27 21:41:37,330 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-27 21:41:37,330 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-27 21:41:37,331 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-27 21:41:37,331 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-27 21:41:37,331 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-27 21:41:37,331 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-27 21:41:37,331 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-04-27 21:41:37,332 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-04-27 21:41:37,332 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-04-27 21:41:37,332 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-04-27 21:41:37,332 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-27 21:41:37,333 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-04-27 21:41:37,333 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-04-27 21:41:37,334 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-04-27 21:41:37,334 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-27 21:41:37,576 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-27 21:41:37,604 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-27 21:41:37,606 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-27 21:41:37,607 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-27 21:41:37,608 INFO L275 PluginConnector]: CDTParser initialized [2022-04-27 21:41:37,608 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-lit/gsv2008.c.i.v+cfa-reducer.c [2022-04-27 21:41:37,667 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5393d4df2/d566325922df4504afa8c43cdc90ddb5/FLAGf55d3e6d9 [2022-04-27 21:41:38,010 INFO L306 CDTParser]: Found 1 translation units. [2022-04-27 21:41:38,011 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-lit/gsv2008.c.i.v+cfa-reducer.c [2022-04-27 21:41:38,015 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5393d4df2/d566325922df4504afa8c43cdc90ddb5/FLAGf55d3e6d9 [2022-04-27 21:41:38,424 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5393d4df2/d566325922df4504afa8c43cdc90ddb5 [2022-04-27 21:41:38,426 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-27 21:41:38,427 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-04-27 21:41:38,430 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-27 21:41:38,430 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-27 21:41:38,434 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-27 21:41:38,434 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.04 09:41:38" (1/1) ... [2022-04-27 21:41:38,435 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5f670595 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 09:41:38, skipping insertion in model container [2022-04-27 21:41:38,435 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.04 09:41:38" (1/1) ... [2022-04-27 21:41:38,441 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-27 21:41:38,453 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-27 21:41:38,666 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.v+cfa-reducer.c[986,999] [2022-04-27 21:41:38,668 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-27 21:41:38,678 INFO L203 MainTranslator]: Completed pre-run [2022-04-27 21:41:38,694 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.v+cfa-reducer.c[986,999] [2022-04-27 21:41:38,696 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-27 21:41:38,709 INFO L208 MainTranslator]: Completed translation [2022-04-27 21:41:38,709 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 09:41:38 WrapperNode [2022-04-27 21:41:38,709 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-27 21:41:38,711 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-27 21:41:38,711 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-27 21:41:38,711 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-27 21:41:38,720 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 09:41:38" (1/1) ... [2022-04-27 21:41:38,720 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 09:41:38" (1/1) ... [2022-04-27 21:41:38,725 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 09:41:38" (1/1) ... [2022-04-27 21:41:38,725 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 09:41:38" (1/1) ... [2022-04-27 21:41:38,737 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 09:41:38" (1/1) ... [2022-04-27 21:41:38,740 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 09:41:38" (1/1) ... [2022-04-27 21:41:38,741 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 09:41:38" (1/1) ... [2022-04-27 21:41:38,746 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-27 21:41:38,747 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-27 21:41:38,747 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-27 21:41:38,747 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-27 21:41:38,748 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 09:41:38" (1/1) ... [2022-04-27 21:41:38,753 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-27 21:41:38,761 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 21:41:38,776 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 21:41:38,783 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 21:41:38,816 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-27 21:41:38,817 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-27 21:41:38,817 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-27 21:41:38,817 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-27 21:41:38,817 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-27 21:41:38,818 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-27 21:41:38,818 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-27 21:41:38,818 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-27 21:41:38,820 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-27 21:41:38,820 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-27 21:41:38,820 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-27 21:41:38,820 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-04-27 21:41:38,820 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-27 21:41:38,821 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-27 21:41:38,821 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-27 21:41:38,821 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-27 21:41:38,821 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-27 21:41:38,821 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-27 21:41:38,821 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-27 21:41:38,875 INFO L234 CfgBuilder]: Building ICFG [2022-04-27 21:41:38,876 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-27 21:41:38,982 INFO L275 CfgBuilder]: Performing block encoding [2022-04-27 21:41:38,987 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-27 21:41:38,988 INFO L299 CfgBuilder]: Removed 0 assume(true) statements. [2022-04-27 21:41:38,989 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.04 09:41:38 BoogieIcfgContainer [2022-04-27 21:41:38,989 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-27 21:41:38,990 INFO L113 PluginConnector]: ------------------------IcfgTransformer---------------------------- [2022-04-27 21:41:38,990 INFO L271 PluginConnector]: Initializing IcfgTransformer... [2022-04-27 21:41:38,991 INFO L275 PluginConnector]: IcfgTransformer initialized [2022-04-27 21:41:38,993 INFO L185 PluginConnector]: Executing the observer IcfgTransformationObserver from plugin IcfgTransformer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.04 09:41:38" (1/1) ... [2022-04-27 21:41:38,994 INFO L168 ansformationObserver]: Applying ICFG transformation LOOP_ACCELERATION_QVASR [2022-04-27 21:41:39,024 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 27.04 09:41:39 BasicIcfg [2022-04-27 21:41:39,024 INFO L132 PluginConnector]: ------------------------ END IcfgTransformer---------------------------- [2022-04-27 21:41:39,025 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-27 21:41:39,025 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-27 21:41:39,028 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-27 21:41:39,028 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.04 09:41:38" (1/4) ... [2022-04-27 21:41:39,028 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2fc86d74 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.04 09:41:39, skipping insertion in model container [2022-04-27 21:41:39,028 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 09:41:38" (2/4) ... [2022-04-27 21:41:39,029 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2fc86d74 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.04 09:41:39, skipping insertion in model container [2022-04-27 21:41:39,029 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.04 09:41:38" (3/4) ... [2022-04-27 21:41:39,029 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2fc86d74 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.04 09:41:39, skipping insertion in model container [2022-04-27 21:41:39,029 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 27.04 09:41:39" (4/4) ... [2022-04-27 21:41:39,036 INFO L111 eAbstractionObserver]: Analyzing ICFG gsv2008.c.i.v+cfa-reducer.cqvasr [2022-04-27 21:41:39,048 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-04-27 21:41:39,048 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-27 21:41:39,109 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-27 21:41:39,114 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=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, mPorIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@5bd1bcab, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@69021c6a [2022-04-27 21:41:39,115 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-27 21:41:39,125 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-27 21:41:39,130 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-04-27 21:41:39,130 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 21:41:39,131 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 21:41:39,131 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 21:41:39,135 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 21:41:39,137 INFO L85 PathProgramCache]: Analyzing trace with hash 323261602, now seen corresponding path program 1 times [2022-04-27 21:41:39,144 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 21:41:39,145 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1486193793] [2022-04-27 21:41:39,145 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 21:41:39,145 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 21:41:39,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 21:41:39,338 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 21:41:39,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 21:41:39,354 INFO L290 TraceCheckUtils]: 0: Hoare triple {25#(and (= ~__return_main~0 |old(~__return_main~0)|) (= |old(~__return_65~0)| ~__return_65~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 (= 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) (= v_~__return_65~0_2 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_65~0=v_~__return_65~0_2, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[~__return_main~0, #NULL.offset, ~__return_65~0, #NULL.base] {19#true} is VALID [2022-04-27 21:41:39,354 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-27 21:41:39,354 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-27 21:41:39,356 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_65~0)| ~__return_65~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 21:41:39,357 INFO L290 TraceCheckUtils]: 1: Hoare triple {25#(and (= ~__return_main~0 |old(~__return_main~0)|) (= |old(~__return_65~0)| ~__return_65~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 (= 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) (= v_~__return_65~0_2 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_65~0=v_~__return_65~0_2, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[~__return_main~0, #NULL.offset, ~__return_65~0, #NULL.base] {19#true} is VALID [2022-04-27 21:41:39,357 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-27 21:41:39,357 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-27 21:41:39,357 INFO L272 TraceCheckUtils]: 4: Hoare triple {19#true} [42] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {19#true} is VALID [2022-04-27 21:41:39,358 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-27 21:41:39,359 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-27 21:41:39,359 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-27 21:41:39,360 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-27 21:41:39,361 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-27 21:41:39,361 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-27 21:41:39,361 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-27 21:41:39,362 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 21:41:39,362 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1486193793] [2022-04-27 21:41:39,362 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1486193793] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 21:41:39,363 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 21:41:39,363 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-27 21:41:39,364 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1925251902] [2022-04-27 21:41:39,364 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 21:41:39,368 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-27 21:41:39,370 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 21:41:39,372 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-27 21:41:39,394 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-27 21:41:39,394 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-27 21:41:39,395 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 21:41:39,417 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-27 21:41:39,417 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-27 21:41:39,421 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-27 21:41:39,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 21:41:39,538 INFO L93 Difference]: Finished difference Result 26 states and 30 transitions. [2022-04-27 21:41:39,538 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-27 21:41:39,538 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-27 21:41:39,538 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 21:41:39,539 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-27 21:41:39,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 30 transitions. [2022-04-27 21:41:39,556 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-27 21:41:39,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 30 transitions. [2022-04-27 21:41:39,561 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 30 transitions. [2022-04-27 21:41:39,600 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-27 21:41:39,607 INFO L225 Difference]: With dead ends: 26 [2022-04-27 21:41:39,607 INFO L226 Difference]: Without dead ends: 13 [2022-04-27 21:41:39,610 INFO L412 NwaCegarLoop]: 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-27 21:41:39,616 INFO L413 NwaCegarLoop]: 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-27 21:41:39,618 INFO L414 NwaCegarLoop]: 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-27 21:41:39,628 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2022-04-27 21:41:39,645 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2022-04-27 21:41:39,645 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 21:41:39,646 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-27 21:41:39,647 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-27 21:41:39,647 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-27 21:41:39,649 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 21:41:39,649 INFO L93 Difference]: Finished difference Result 13 states and 13 transitions. [2022-04-27 21:41:39,649 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 13 transitions. [2022-04-27 21:41:39,649 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 21:41:39,649 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 21:41:39,650 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-27 21:41:39,650 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-27 21:41:39,653 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 21:41:39,654 INFO L93 Difference]: Finished difference Result 13 states and 13 transitions. [2022-04-27 21:41:39,654 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 13 transitions. [2022-04-27 21:41:39,655 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 21:41:39,655 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 21:41:39,655 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 21:41:39,655 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 21:41:39,656 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-27 21:41:39,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 13 transitions. [2022-04-27 21:41:39,662 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 13 transitions. Word has length 11 [2022-04-27 21:41:39,662 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 21:41:39,662 INFO L495 AbstractCegarLoop]: Abstraction has 13 states and 13 transitions. [2022-04-27 21:41:39,662 INFO L496 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-27 21:41:39,662 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 13 transitions. [2022-04-27 21:41:39,663 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-04-27 21:41:39,663 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 21:41:39,663 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 21:41:39,663 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-27 21:41:39,664 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 21:41:39,664 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 21:41:39,664 INFO L85 PathProgramCache]: Analyzing trace with hash 1431144312, now seen corresponding path program 1 times [2022-04-27 21:41:39,664 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 21:41:39,665 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2085263655] [2022-04-27 21:41:39,665 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 21:41:39,665 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 21:41:39,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 21:41:39,735 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 21:41:39,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 21:41:39,750 INFO L290 TraceCheckUtils]: 0: Hoare triple {115#(and (= ~__return_main~0 |old(~__return_main~0)|) (= |old(~__return_65~0)| ~__return_65~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 (= 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) (= v_~__return_65~0_2 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_65~0=v_~__return_65~0_2, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[~__return_main~0, #NULL.offset, ~__return_65~0, #NULL.base] {107#true} is VALID [2022-04-27 21:41:39,751 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-27 21:41:39,751 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-27 21:41:39,753 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_65~0)| ~__return_65~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 21:41:39,753 INFO L290 TraceCheckUtils]: 1: Hoare triple {115#(and (= ~__return_main~0 |old(~__return_main~0)|) (= |old(~__return_65~0)| ~__return_65~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 (= 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) (= v_~__return_65~0_2 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_65~0=v_~__return_65~0_2, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[~__return_main~0, #NULL.offset, ~__return_65~0, #NULL.base] {107#true} is VALID [2022-04-27 21:41:39,754 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-27 21:41:39,754 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-27 21:41:39,754 INFO L272 TraceCheckUtils]: 4: Hoare triple {107#true} [42] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {107#true} is VALID [2022-04-27 21:41:39,757 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-27 21:41:39,757 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-27 21:41:39,758 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-27 21:41:39,759 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-27 21:41:39,759 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-27 21:41:39,760 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-27 21:41:39,760 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-27 21:41:39,761 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-27 21:41:39,761 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 21:41:39,761 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2085263655] [2022-04-27 21:41:39,761 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2085263655] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 21:41:39,761 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1696740332] [2022-04-27 21:41:39,762 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 21:41:39,762 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 21:41:39,762 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 21:41:39,769 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 21:41:39,798 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 21:41:39,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 21:41:39,835 INFO L263 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-27 21:41:39,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 21:41:39,852 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 21:41:40,107 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-27 21:41:40,108 INFO L290 TraceCheckUtils]: 1: Hoare triple {107#true} [43] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 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) (= v_~__return_65~0_2 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_65~0=v_~__return_65~0_2, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[~__return_main~0, #NULL.offset, ~__return_65~0, #NULL.base] {107#true} is VALID [2022-04-27 21:41:40,108 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-27 21:41:40,108 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-27 21:41:40,108 INFO L272 TraceCheckUtils]: 4: Hoare triple {107#true} [42] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {107#true} is VALID [2022-04-27 21:41:40,109 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-27 21:41:40,110 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-27 21:41:40,110 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-27 21:41:40,111 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-27 21:41:40,112 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-27 21:41:40,112 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-27 21:41:40,112 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-27 21:41:40,113 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-27 21:41:40,113 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 21:41:40,313 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-27 21:41:40,314 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-27 21:41:40,315 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-27 21:41:40,316 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-27 21:41:40,316 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-27 21:41:40,317 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-27 21:41:40,318 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-27 21:41:40,318 INFO L272 TraceCheckUtils]: 4: Hoare triple {107#true} [42] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {107#true} is VALID [2022-04-27 21:41:40,318 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-27 21:41:40,318 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-27 21:41:40,319 INFO L290 TraceCheckUtils]: 1: Hoare triple {107#true} [43] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 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) (= v_~__return_65~0_2 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_65~0=v_~__return_65~0_2, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[~__return_main~0, #NULL.offset, ~__return_65~0, #NULL.base] {107#true} is VALID [2022-04-27 21:41:40,319 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-27 21:41:40,319 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-27 21:41:40,320 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1696740332] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 21:41:40,320 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-27 21:41:40,320 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 9 [2022-04-27 21:41:40,321 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [817105746] [2022-04-27 21:41:40,321 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-27 21:41:40,321 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-27 21:41:40,322 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 21:41:40,322 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-27 21:41:40,342 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-27 21:41:40,343 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-04-27 21:41:40,343 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 21:41:40,343 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-04-27 21:41:40,343 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2022-04-27 21:41:40,344 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-27 21:41:40,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 21:41:40,526 INFO L93 Difference]: Finished difference Result 15 states and 16 transitions. [2022-04-27 21:41:40,526 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-27 21:41:40,526 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-27 21:41:40,527 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 21:41:40,527 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-27 21:41:40,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 16 transitions. [2022-04-27 21:41:40,528 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-27 21:41:40,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 16 transitions. [2022-04-27 21:41:40,529 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 16 transitions. [2022-04-27 21:41:40,546 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-27 21:41:40,547 INFO L225 Difference]: With dead ends: 15 [2022-04-27 21:41:40,547 INFO L226 Difference]: Without dead ends: 0 [2022-04-27 21:41:40,547 INFO L412 NwaCegarLoop]: 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-27 21:41:40,548 INFO L413 NwaCegarLoop]: 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-27 21:41:40,549 INFO L414 NwaCegarLoop]: 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-27 21:41:40,549 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-04-27 21:41:40,550 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-04-27 21:41:40,550 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 21:41:40,550 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 21:41:40,550 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 21:41:40,550 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 21:41:40,550 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 21:41:40,550 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-27 21:41:40,550 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-27 21:41:40,551 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 21:41:40,551 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 21:41:40,551 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 21:41:40,551 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 21:41:40,551 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 21:41:40,551 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-27 21:41:40,551 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-27 21:41:40,551 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 21:41:40,552 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 21:41:40,552 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 21:41:40,552 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 21:41:40,552 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 21:41:40,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-04-27 21:41:40,552 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 12 [2022-04-27 21:41:40,552 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 21:41:40,552 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-04-27 21:41:40,553 INFO L496 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-27 21:41:40,553 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-27 21:41:40,553 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 21:41:40,555 INFO L805 garLoopResultBuilder]: Registering result SAFE for location mainErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-04-27 21:41:40,580 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-04-27 21:41:40,769 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 21:41:40,771 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-04-27 21:41:40,812 INFO L895 garLoopResultBuilder]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (and (= ~__return_main~0 |old(~__return_main~0)|) (= |old(~__return_65~0)| ~__return_65~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|)) [2022-04-27 21:41:40,813 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2022-04-27 21:41:40,813 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2022-04-27 21:41:40,813 INFO L902 garLoopResultBuilder]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2022-04-27 21:41:40,813 INFO L902 garLoopResultBuilder]: At program point L-1(line -1) the Hoare annotation is: true [2022-04-27 21:41:40,813 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2022-04-27 21:41:40,813 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-04-27 21:41:40,813 INFO L895 garLoopResultBuilder]: At program point mainENTRY(lines 13 60) the Hoare annotation is: (= |old(~__return_65~0)| ~__return_65~0) [2022-04-27 21:41:40,813 INFO L899 garLoopResultBuilder]: For program point L19(lines 19 59) no Hoare annotation was computed. [2022-04-27 21:41:40,814 INFO L899 garLoopResultBuilder]: For program point mainFINAL(lines 13 60) no Hoare annotation was computed. [2022-04-27 21:41:40,814 INFO L899 garLoopResultBuilder]: For program point L25(lines 25 58) no Hoare annotation was computed. [2022-04-27 21:41:40,814 INFO L899 garLoopResultBuilder]: For program point mainEXIT(lines 13 60) no Hoare annotation was computed. [2022-04-27 21:41:40,814 INFO L895 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_65~0)| ~__return_65~0)) [2022-04-27 21:41:40,816 INFO L899 garLoopResultBuilder]: For program point L46(lines 46 55) no Hoare annotation was computed. [2022-04-27 21:41:40,816 INFO L899 garLoopResultBuilder]: For program point L48(line 48) no Hoare annotation was computed. [2022-04-27 21:41:40,816 INFO L899 garLoopResultBuilder]: For program point mainErr0ASSERT_VIOLATIONERROR_FUNCTION(line 48) no Hoare annotation was computed. [2022-04-27 21:41:40,821 INFO L356 BasicCegarLoop]: Path program histogram: [1, 1] [2022-04-27 21:41:40,822 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-04-27 21:41:40,826 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2022-04-27 21:41:40,826 WARN L170 areAnnotationChecker]: L19 has no Hoare annotation [2022-04-27 21:41:40,826 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2022-04-27 21:41:40,826 WARN L170 areAnnotationChecker]: L19 has no Hoare annotation [2022-04-27 21:41:40,826 WARN L170 areAnnotationChecker]: L19 has no Hoare annotation [2022-04-27 21:41:40,826 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2022-04-27 21:41:40,826 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2022-04-27 21:41:40,826 WARN L170 areAnnotationChecker]: L25 has no Hoare annotation [2022-04-27 21:41:40,826 WARN L170 areAnnotationChecker]: L25 has no Hoare annotation [2022-04-27 21:41:40,827 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2022-04-27 21:41:40,828 WARN L170 areAnnotationChecker]: L46 has no Hoare annotation [2022-04-27 21:41:40,828 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2022-04-27 21:41:40,828 WARN L170 areAnnotationChecker]: L46 has no Hoare annotation [2022-04-27 21:41:40,828 WARN L170 areAnnotationChecker]: L46 has no Hoare annotation [2022-04-27 21:41:40,829 WARN L170 areAnnotationChecker]: L48 has no Hoare annotation [2022-04-27 21:41:40,829 WARN L170 areAnnotationChecker]: L48 has no Hoare annotation [2022-04-27 21:41:40,829 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-27 21:41:40,840 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.04 09:41:40 BasicIcfg [2022-04-27 21:41:40,840 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-04-27 21:41:40,841 INFO L158 Benchmark]: Toolchain (without parser) took 2413.69ms. Allocated memory is still 200.3MB. Free memory was 148.5MB in the beginning and 162.0MB in the end (delta: -13.4MB). There was no memory consumed. Max. memory is 8.0GB. [2022-04-27 21:41:40,841 INFO L158 Benchmark]: CDTParser took 0.10ms. Allocated memory is still 200.3MB. Free memory is still 164.6MB. There was no memory consumed. Max. memory is 8.0GB. [2022-04-27 21:41:40,845 INFO L158 Benchmark]: CACSL2BoogieTranslator took 280.10ms. Allocated memory is still 200.3MB. Free memory was 148.3MB in the beginning and 177.1MB in the end (delta: -28.8MB). Peak memory consumption was 13.8MB. Max. memory is 8.0GB. [2022-04-27 21:41:40,846 INFO L158 Benchmark]: Boogie Preprocessor took 34.79ms. Allocated memory is still 200.3MB. Free memory was 177.1MB in the beginning and 175.6MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-04-27 21:41:40,846 INFO L158 Benchmark]: RCFGBuilder took 242.34ms. Allocated memory is still 200.3MB. Free memory was 175.6MB in the beginning and 165.1MB in the end (delta: 10.4MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. [2022-04-27 21:41:40,847 INFO L158 Benchmark]: IcfgTransformer took 34.24ms. Allocated memory is still 200.3MB. Free memory was 164.7MB in the beginning and 163.7MB in the end (delta: 1.1MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-04-27 21:41:40,847 INFO L158 Benchmark]: TraceAbstraction took 1815.18ms. Allocated memory is still 200.3MB. Free memory was 163.0MB in the beginning and 162.0MB in the end (delta: 1.1MB). Peak memory consumption was 1.5MB. Max. memory is 8.0GB. [2022-04-27 21:41:40,849 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 200.3MB. Free memory is still 164.6MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 280.10ms. Allocated memory is still 200.3MB. Free memory was 148.3MB in the beginning and 177.1MB in the end (delta: -28.8MB). Peak memory consumption was 13.8MB. Max. memory is 8.0GB. * Boogie Preprocessor took 34.79ms. Allocated memory is still 200.3MB. Free memory was 177.1MB in the beginning and 175.6MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 242.34ms. Allocated memory is still 200.3MB. Free memory was 175.6MB in the beginning and 165.1MB in the end (delta: 10.4MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. * IcfgTransformer took 34.24ms. Allocated memory is still 200.3MB. Free memory was 164.7MB in the beginning and 163.7MB in the end (delta: 1.1MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * TraceAbstraction took 1815.18ms. Allocated memory is still 200.3MB. Free memory was 163.0MB in the beginning and 162.0MB in the end (delta: 1.1MB). Peak memory consumption was 1.5MB. 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.7s, OverallIterations: 2, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 22 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 22 mSDsluCounter, 65 SdHoareTripleChecker+Invalid, 0.1s 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.1s SatisfiabilityAnalysisTime, 0.7s 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_65) == __return_65 RESULT: Ultimate proved your program to be correct! [2022-04-27 21:41:40,881 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...