/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+lhb-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-e106359-m [2022-04-15 00:40:07,916 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-15 00:40:07,917 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-15 00:40:07,954 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-15 00:40:07,955 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-15 00:40:07,956 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-15 00:40:07,959 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-15 00:40:07,963 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-15 00:40:07,965 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-15 00:40:07,969 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-15 00:40:07,970 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-15 00:40:07,971 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-15 00:40:07,972 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-15 00:40:07,974 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-15 00:40:07,975 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-15 00:40:07,977 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-15 00:40:07,978 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-15 00:40:07,978 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-15 00:40:07,981 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-15 00:40:07,986 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-15 00:40:07,988 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-15 00:40:07,989 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-15 00:40:07,991 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-15 00:40:07,991 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-15 00:40:07,993 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-15 00:40:07,999 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-15 00:40:07,999 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-15 00:40:07,999 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-15 00:40:08,000 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-15 00:40:08,001 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-15 00:40:08,002 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-15 00:40:08,002 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-15 00:40:08,003 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-15 00:40:08,004 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-15 00:40:08,004 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-15 00:40:08,005 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-15 00:40:08,005 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-15 00:40:08,006 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-15 00:40:08,006 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-15 00:40:08,006 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-15 00:40:08,006 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-15 00:40:08,008 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-15 00:40:08,008 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/loopacceleration/qvasr/qvasr_64.epf [2022-04-15 00:40:08,032 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-15 00:40:08,033 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-15 00:40:08,033 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-04-15 00:40:08,033 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-04-15 00:40:08,034 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-04-15 00:40:08,034 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-04-15 00:40:08,034 INFO L138 SettingsManager]: * Use SBE=true [2022-04-15 00:40:08,034 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-15 00:40:08,034 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-15 00:40:08,035 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-15 00:40:08,035 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-15 00:40:08,035 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-15 00:40:08,035 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-15 00:40:08,035 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-15 00:40:08,035 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-15 00:40:08,035 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-15 00:40:08,036 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-15 00:40:08,036 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-15 00:40:08,036 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-15 00:40:08,036 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-15 00:40:08,036 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-15 00:40:08,036 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-04-15 00:40:08,036 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-04-15 00:40:08,036 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-04-15 00:40:08,036 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-04-15 00:40:08,037 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-15 00:40:08,037 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-04-15 00:40:08,037 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-04-15 00:40:08,038 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-04-15 00:40:08,038 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-15 00:40:08,245 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-15 00:40:08,272 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-15 00:40:08,274 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-15 00:40:08,275 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-15 00:40:08,275 INFO L275 PluginConnector]: CDTParser initialized [2022-04-15 00:40:08,276 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+lhb-reducer.c [2022-04-15 00:40:08,325 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5a7322206/c409e85838964bf899fee4e9a7bf62ed/FLAG2eb5acf38 [2022-04-15 00:40:08,661 INFO L306 CDTParser]: Found 1 translation units. [2022-04-15 00:40:08,661 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-lit/gsv2008.c.i.v+lhb-reducer.c [2022-04-15 00:40:08,666 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5a7322206/c409e85838964bf899fee4e9a7bf62ed/FLAG2eb5acf38 [2022-04-15 00:40:09,106 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5a7322206/c409e85838964bf899fee4e9a7bf62ed [2022-04-15 00:40:09,108 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-15 00:40:09,109 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-04-15 00:40:09,112 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-15 00:40:09,112 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-15 00:40:09,125 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-15 00:40:09,126 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.04 12:40:09" (1/1) ... [2022-04-15 00:40:09,126 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@42c55c07 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:40:09, skipping insertion in model container [2022-04-15 00:40:09,126 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.04 12:40:09" (1/1) ... [2022-04-15 00:40:09,131 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-15 00:40:09,151 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-15 00:40:09,336 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+lhb-reducer.c[1238,1251] [2022-04-15 00:40:09,340 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-15 00:40:09,348 INFO L203 MainTranslator]: Completed pre-run [2022-04-15 00:40:09,365 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+lhb-reducer.c[1238,1251] [2022-04-15 00:40:09,366 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-15 00:40:09,376 INFO L208 MainTranslator]: Completed translation [2022-04-15 00:40:09,377 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:40:09 WrapperNode [2022-04-15 00:40:09,377 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-15 00:40:09,379 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-15 00:40:09,379 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-15 00:40:09,379 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-15 00:40:09,389 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:40:09" (1/1) ... [2022-04-15 00:40:09,389 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:40:09" (1/1) ... [2022-04-15 00:40:09,394 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:40:09" (1/1) ... [2022-04-15 00:40:09,395 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:40:09" (1/1) ... [2022-04-15 00:40:09,407 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:40:09" (1/1) ... [2022-04-15 00:40:09,411 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:40:09" (1/1) ... [2022-04-15 00:40:09,415 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:40:09" (1/1) ... [2022-04-15 00:40:09,418 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-15 00:40:09,419 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-15 00:40:09,419 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-15 00:40:09,420 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-15 00:40:09,420 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:40:09" (1/1) ... [2022-04-15 00:40:09,427 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-15 00:40:09,437 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 00:40:09,465 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-15 00:40:09,498 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-15 00:40:09,513 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-15 00:40:09,513 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-15 00:40:09,513 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-15 00:40:09,513 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-15 00:40:09,514 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-15 00:40:09,514 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-15 00:40:09,514 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-15 00:40:09,515 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-15 00:40:09,516 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-15 00:40:09,516 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-15 00:40:09,516 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-15 00:40:09,516 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-04-15 00:40:09,517 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-15 00:40:09,517 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-15 00:40:09,517 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-15 00:40:09,517 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-15 00:40:09,517 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-15 00:40:09,517 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-15 00:40:09,517 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-15 00:40:09,576 INFO L234 CfgBuilder]: Building ICFG [2022-04-15 00:40:09,577 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-15 00:40:09,733 INFO L275 CfgBuilder]: Performing block encoding [2022-04-15 00:40:09,738 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-15 00:40:09,738 INFO L299 CfgBuilder]: Removed 0 assume(true) statements. [2022-04-15 00:40:09,739 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.04 12:40:09 BoogieIcfgContainer [2022-04-15 00:40:09,739 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-15 00:40:09,740 INFO L113 PluginConnector]: ------------------------IcfgTransformer---------------------------- [2022-04-15 00:40:09,740 INFO L271 PluginConnector]: Initializing IcfgTransformer... [2022-04-15 00:40:09,749 INFO L275 PluginConnector]: IcfgTransformer initialized [2022-04-15 00:40:09,751 INFO L185 PluginConnector]: Executing the observer IcfgTransformationObserver from plugin IcfgTransformer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.04 12:40:09" (1/1) ... [2022-04-15 00:40:09,752 INFO L168 ansformationObserver]: Applying ICFG transformation LOOP_ACCELERATION_QVASR [2022-04-15 00:40:09,782 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 15.04 12:40:09 BasicIcfg [2022-04-15 00:40:09,783 INFO L132 PluginConnector]: ------------------------ END IcfgTransformer---------------------------- [2022-04-15 00:40:09,787 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-15 00:40:09,787 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-15 00:40:09,790 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-15 00:40:09,790 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.04 12:40:09" (1/4) ... [2022-04-15 00:40:09,791 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6b967603 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.04 12:40:09, skipping insertion in model container [2022-04-15 00:40:09,791 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:40:09" (2/4) ... [2022-04-15 00:40:09,791 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6b967603 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.04 12:40:09, skipping insertion in model container [2022-04-15 00:40:09,791 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.04 12:40:09" (3/4) ... [2022-04-15 00:40:09,791 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6b967603 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.04 12:40:09, skipping insertion in model container [2022-04-15 00:40:09,792 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 15.04 12:40:09" (4/4) ... [2022-04-15 00:40:09,792 INFO L111 eAbstractionObserver]: Analyzing ICFG gsv2008.c.i.v+lhb-reducer.cqvasr [2022-04-15 00:40:09,796 INFO L202 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-04-15 00:40:09,796 INFO L161 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-15 00:40:09,842 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-15 00:40:09,848 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-15 00:40:09,849 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-15 00:40:09,867 INFO L276 IsEmpty]: Start isEmpty. Operand has 18 states, 12 states have (on average 1.5) internal successors, (18), 13 states have internal predecessors, (18), 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-15 00:40:09,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-04-15 00:40:09,871 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 00:40:09,871 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 00:40:09,872 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 00:40:09,875 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 00:40:09,876 INFO L85 PathProgramCache]: Analyzing trace with hash -1405451419, now seen corresponding path program 1 times [2022-04-15 00:40:09,883 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 00:40:09,883 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [816328376] [2022-04-15 00:40:09,883 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 00:40:09,884 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 00:40:09,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 00:40:10,116 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 00:40:10,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 00:40:10,139 INFO L290 TraceCheckUtils]: 0: Hoare triple {29#(and (= ~__return_main~0 |old(~__return_main~0)|) (= |old(~__return_65~0)| ~__return_65~0) (= ~__tmp_55_0~0 |old(~__tmp_55_0~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [48] 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_~__tmp_55_0~0_4 0) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 2) 28) (= (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) (= 0 v_~__return_main~0_5) (= 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{~__tmp_55_0~0=v_~__tmp_55_0~0_4, ~__return_main~0=v_~__return_main~0_5, #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[~__tmp_55_0~0, ~__return_main~0, #NULL.offset, ~__return_65~0, #NULL.base] {21#true} is VALID [2022-04-15 00:40:10,140 INFO L290 TraceCheckUtils]: 1: Hoare triple {21#true} [51] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {21#true} is VALID [2022-04-15 00:40:10,140 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {21#true} {21#true} [66] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {21#true} is VALID [2022-04-15 00:40:10,142 INFO L272 TraceCheckUtils]: 0: Hoare triple {21#true} [46] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {29#(and (= ~__return_main~0 |old(~__return_main~0)|) (= |old(~__return_65~0)| ~__return_65~0) (= ~__tmp_55_0~0 |old(~__tmp_55_0~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 00:40:10,143 INFO L290 TraceCheckUtils]: 1: Hoare triple {29#(and (= ~__return_main~0 |old(~__return_main~0)|) (= |old(~__return_65~0)| ~__return_65~0) (= ~__tmp_55_0~0 |old(~__tmp_55_0~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [48] 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_~__tmp_55_0~0_4 0) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 2) 28) (= (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) (= 0 v_~__return_main~0_5) (= 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{~__tmp_55_0~0=v_~__tmp_55_0~0_4, ~__return_main~0=v_~__return_main~0_5, #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[~__tmp_55_0~0, ~__return_main~0, #NULL.offset, ~__return_65~0, #NULL.base] {21#true} is VALID [2022-04-15 00:40:10,143 INFO L290 TraceCheckUtils]: 2: Hoare triple {21#true} [51] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {21#true} is VALID [2022-04-15 00:40:10,143 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {21#true} {21#true} [66] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {21#true} is VALID [2022-04-15 00:40:10,144 INFO L272 TraceCheckUtils]: 4: Hoare triple {21#true} [47] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {21#true} is VALID [2022-04-15 00:40:10,144 INFO L290 TraceCheckUtils]: 5: Hoare triple {21#true} [50] mainENTRY-->L20: Formula: (and (= |v_main_#t~nondet4_2| v_main_~main__y~0_1) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= |v_main_#t~nondet4_2| 2147483647) (= (- 50) v_main_~main__x~0_2)) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~main__x~0=v_main_~main__x~0_2, main_~main__y~0=v_main_~main__y~0_1} AuxVars[] AssignedVars[main_#t~nondet4, main_~main__x~0, main_~main__y~0] {26#(<= (+ main_~main__x~0 50) 0)} is VALID [2022-04-15 00:40:10,145 INFO L290 TraceCheckUtils]: 6: Hoare triple {26#(<= (+ main_~main__x~0 50) 0)} [53] L20-->L26: Formula: (< 0 (+ 1000 v_main_~main__y~0_5)) InVars {main_~main__y~0=v_main_~main__y~0_5} OutVars{main_~main__y~0=v_main_~main__y~0_5} AuxVars[] AssignedVars[] {26#(<= (+ main_~main__x~0 50) 0)} is VALID [2022-04-15 00:40:10,146 INFO L290 TraceCheckUtils]: 7: Hoare triple {26#(<= (+ main_~main__x~0 50) 0)} [56] L26-->L32: Formula: (< v_main_~main__y~0_7 1000000) InVars {main_~main__y~0=v_main_~main__y~0_7} OutVars{main_~main__y~0=v_main_~main__y~0_7} AuxVars[] AssignedVars[] {26#(<= (+ main_~main__x~0 50) 0)} is VALID [2022-04-15 00:40:10,147 INFO L290 TraceCheckUtils]: 8: Hoare triple {26#(<= (+ main_~main__x~0 50) 0)} [57] L32-->L46: Formula: (and (= (+ v_main_~main__x~0_6 v_main_~main__y~0_9) v_main_~main__x~0_5) (= (+ v_main_~main__y~0_9 1) v_main_~main__y~0_8) (= v_main_~main____CPAchecker_TMP_0~0_1 v_main_~main__y~0_9) (= v_main_~main____CPAchecker_TMP_0~0_1 v_~__tmp_55_0~0_1) (< v_main_~main__x~0_6 0)) InVars {main_~main__x~0=v_main_~main__x~0_6, main_~main__y~0=v_main_~main__y~0_9} OutVars{~__tmp_55_0~0=v_~__tmp_55_0~0_1, main_~main____CPAchecker_TMP_0~0=v_main_~main____CPAchecker_TMP_0~0_1, main_~main__x~0=v_main_~main__x~0_5, main_~main__y~0=v_main_~main__y~0_8} AuxVars[] AssignedVars[~__tmp_55_0~0, main_~main____CPAchecker_TMP_0~0, main_~main__x~0, main_~main__y~0] {27#(<= (+ 51 main_~main__x~0) main_~main__y~0)} is VALID [2022-04-15 00:40:10,147 INFO L290 TraceCheckUtils]: 9: Hoare triple {27#(<= (+ 51 main_~main__x~0) main_~main__y~0)} [59] L46-->L40: Formula: (= v_main_~main____CPAchecker_TMP_0~0_2 v_~__tmp_55_0~0_2) InVars {~__tmp_55_0~0=v_~__tmp_55_0~0_2} OutVars{~__tmp_55_0~0=v_~__tmp_55_0~0_2, main_~main____CPAchecker_TMP_0~0=v_main_~main____CPAchecker_TMP_0~0_2} AuxVars[] AssignedVars[main_~main____CPAchecker_TMP_0~0] {27#(<= (+ 51 main_~main__x~0) main_~main__y~0)} is VALID [2022-04-15 00:40:10,148 INFO L290 TraceCheckUtils]: 10: Hoare triple {27#(<= (+ 51 main_~main__x~0) main_~main__y~0)} [61] L40-->L55: Formula: (and (not (< v_main_~main__x~0_9 0)) (= v_main_~__tmp_1~0_1 v_main_~__VERIFIER_assert__cond~0_2) (= (ite (< 0 v_main_~main__y~0_12) 1 0) v_main_~__tmp_1~0_1)) InVars {main_~main__x~0=v_main_~main__x~0_9, main_~main__y~0=v_main_~main__y~0_12} OutVars{main_~__VERIFIER_assert__cond~0=v_main_~__VERIFIER_assert__cond~0_2, main_~main__x~0=v_main_~main__x~0_9, main_~main__y~0=v_main_~main__y~0_12, main_~__tmp_1~0=v_main_~__tmp_1~0_1} AuxVars[] AssignedVars[main_~__VERIFIER_assert__cond~0, main_~__tmp_1~0] {28#(not (= main_~__VERIFIER_assert__cond~0 0))} is VALID [2022-04-15 00:40:10,149 INFO L290 TraceCheckUtils]: 11: Hoare triple {28#(not (= main_~__VERIFIER_assert__cond~0 0))} [62] L55-->L57: Formula: (= v_main_~__VERIFIER_assert__cond~0_4 0) InVars {main_~__VERIFIER_assert__cond~0=v_main_~__VERIFIER_assert__cond~0_4} OutVars{main_~__VERIFIER_assert__cond~0=v_main_~__VERIFIER_assert__cond~0_4} AuxVars[] AssignedVars[] {22#false} is VALID [2022-04-15 00:40:10,149 INFO L290 TraceCheckUtils]: 12: Hoare triple {22#false} [64] L57-->mainErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {22#false} is VALID [2022-04-15 00:40:10,150 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-15 00:40:10,150 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 00:40:10,151 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [816328376] [2022-04-15 00:40:10,151 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [816328376] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 00:40:10,151 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 00:40:10,152 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-15 00:40:10,153 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [232932657] [2022-04-15 00:40:10,153 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 00:40:10,158 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 5 states have internal predecessors, (10), 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 13 [2022-04-15 00:40:10,160 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 00:40:10,163 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 5 states have internal predecessors, (10), 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-15 00:40:10,180 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 13 edges. 13 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 00:40:10,180 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-15 00:40:10,180 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-15 00:40:10,206 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-15 00:40:10,207 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-04-15 00:40:10,211 INFO L87 Difference]: Start difference. First operand has 18 states, 12 states have (on average 1.5) internal successors, (18), 13 states have internal predecessors, (18), 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 6 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 5 states have internal predecessors, (10), 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-15 00:40:10,513 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 00:40:10,513 INFO L93 Difference]: Finished difference Result 33 states and 38 transitions. [2022-04-15 00:40:10,514 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-15 00:40:10,514 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 5 states have internal predecessors, (10), 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 13 [2022-04-15 00:40:10,515 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 00:40:10,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 5 states have internal predecessors, (10), 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-15 00:40:10,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 38 transitions. [2022-04-15 00:40:10,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 5 states have internal predecessors, (10), 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-15 00:40:10,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 38 transitions. [2022-04-15 00:40:10,536 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 38 transitions. [2022-04-15 00:40:10,580 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 38 edges. 38 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 00:40:10,591 INFO L225 Difference]: With dead ends: 33 [2022-04-15 00:40:10,592 INFO L226 Difference]: Without dead ends: 16 [2022-04-15 00:40:10,595 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2022-04-15 00:40:10,598 INFO L913 BasicCegarLoop]: 18 mSDtfsCounter, 16 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 54 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-15 00:40:10,599 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [16 Valid, 54 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-15 00:40:10,623 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2022-04-15 00:40:10,638 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2022-04-15 00:40:10,638 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 00:40:10,640 INFO L82 GeneralOperation]: Start isEquivalent. First operand 16 states. Second operand has 16 states, 12 states have (on average 1.0833333333333333) internal successors, (13), 12 states have internal predecessors, (13), 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-15 00:40:10,640 INFO L74 IsIncluded]: Start isIncluded. First operand 16 states. Second operand has 16 states, 12 states have (on average 1.0833333333333333) internal successors, (13), 12 states have internal predecessors, (13), 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-15 00:40:10,641 INFO L87 Difference]: Start difference. First operand 16 states. Second operand has 16 states, 12 states have (on average 1.0833333333333333) internal successors, (13), 12 states have internal predecessors, (13), 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-15 00:40:10,643 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 00:40:10,643 INFO L93 Difference]: Finished difference Result 16 states and 16 transitions. [2022-04-15 00:40:10,643 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 16 transitions. [2022-04-15 00:40:10,644 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 00:40:10,644 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 00:40:10,644 INFO L74 IsIncluded]: Start isIncluded. First operand has 16 states, 12 states have (on average 1.0833333333333333) internal successors, (13), 12 states have internal predecessors, (13), 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 16 states. [2022-04-15 00:40:10,645 INFO L87 Difference]: Start difference. First operand has 16 states, 12 states have (on average 1.0833333333333333) internal successors, (13), 12 states have internal predecessors, (13), 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 16 states. [2022-04-15 00:40:10,647 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 00:40:10,648 INFO L93 Difference]: Finished difference Result 16 states and 16 transitions. [2022-04-15 00:40:10,648 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 16 transitions. [2022-04-15 00:40:10,648 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 00:40:10,648 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 00:40:10,648 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 00:40:10,649 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 00:40:10,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 12 states have (on average 1.0833333333333333) internal successors, (13), 12 states have internal predecessors, (13), 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-15 00:40:10,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 16 transitions. [2022-04-15 00:40:10,659 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 16 transitions. Word has length 13 [2022-04-15 00:40:10,660 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 00:40:10,664 INFO L478 AbstractCegarLoop]: Abstraction has 16 states and 16 transitions. [2022-04-15 00:40:10,664 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 5 states have internal predecessors, (10), 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-15 00:40:10,664 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 16 transitions. [2022-04-15 00:40:10,665 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-04-15 00:40:10,665 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 00:40:10,665 INFO L499 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 00:40:10,665 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-15 00:40:10,665 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 00:40:10,666 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 00:40:10,666 INFO L85 PathProgramCache]: Analyzing trace with hash -2020096506, now seen corresponding path program 1 times [2022-04-15 00:40:10,666 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 00:40:10,666 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1834829056] [2022-04-15 00:40:10,666 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 00:40:10,666 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 00:40:10,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 00:40:10,747 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 00:40:10,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 00:40:10,765 INFO L290 TraceCheckUtils]: 0: Hoare triple {140#(and (= ~__return_main~0 |old(~__return_main~0)|) (= |old(~__return_65~0)| ~__return_65~0) (= ~__tmp_55_0~0 |old(~__tmp_55_0~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [48] 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_~__tmp_55_0~0_4 0) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 2) 28) (= (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) (= 0 v_~__return_main~0_5) (= 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{~__tmp_55_0~0=v_~__tmp_55_0~0_4, ~__return_main~0=v_~__return_main~0_5, #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[~__tmp_55_0~0, ~__return_main~0, #NULL.offset, ~__return_65~0, #NULL.base] {131#true} is VALID [2022-04-15 00:40:10,766 INFO L290 TraceCheckUtils]: 1: Hoare triple {131#true} [51] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {131#true} is VALID [2022-04-15 00:40:10,767 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {131#true} {131#true} [66] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {131#true} is VALID [2022-04-15 00:40:10,768 INFO L272 TraceCheckUtils]: 0: Hoare triple {131#true} [46] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {140#(and (= ~__return_main~0 |old(~__return_main~0)|) (= |old(~__return_65~0)| ~__return_65~0) (= ~__tmp_55_0~0 |old(~__tmp_55_0~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 00:40:10,768 INFO L290 TraceCheckUtils]: 1: Hoare triple {140#(and (= ~__return_main~0 |old(~__return_main~0)|) (= |old(~__return_65~0)| ~__return_65~0) (= ~__tmp_55_0~0 |old(~__tmp_55_0~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [48] 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_~__tmp_55_0~0_4 0) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 2) 28) (= (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) (= 0 v_~__return_main~0_5) (= 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{~__tmp_55_0~0=v_~__tmp_55_0~0_4, ~__return_main~0=v_~__return_main~0_5, #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[~__tmp_55_0~0, ~__return_main~0, #NULL.offset, ~__return_65~0, #NULL.base] {131#true} is VALID [2022-04-15 00:40:10,768 INFO L290 TraceCheckUtils]: 2: Hoare triple {131#true} [51] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {131#true} is VALID [2022-04-15 00:40:10,768 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {131#true} {131#true} [66] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {131#true} is VALID [2022-04-15 00:40:10,769 INFO L272 TraceCheckUtils]: 4: Hoare triple {131#true} [47] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {131#true} is VALID [2022-04-15 00:40:10,769 INFO L290 TraceCheckUtils]: 5: Hoare triple {131#true} [50] mainENTRY-->L20: Formula: (and (= |v_main_#t~nondet4_2| v_main_~main__y~0_1) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= |v_main_#t~nondet4_2| 2147483647) (= (- 50) v_main_~main__x~0_2)) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~main__x~0=v_main_~main__x~0_2, main_~main__y~0=v_main_~main__y~0_1} AuxVars[] AssignedVars[main_#t~nondet4, main_~main__x~0, main_~main__y~0] {136#(<= (+ main_~main__x~0 50) 0)} is VALID [2022-04-15 00:40:10,770 INFO L290 TraceCheckUtils]: 6: Hoare triple {136#(<= (+ main_~main__x~0 50) 0)} [53] L20-->L26: Formula: (< 0 (+ 1000 v_main_~main__y~0_5)) InVars {main_~main__y~0=v_main_~main__y~0_5} OutVars{main_~main__y~0=v_main_~main__y~0_5} AuxVars[] AssignedVars[] {136#(<= (+ main_~main__x~0 50) 0)} is VALID [2022-04-15 00:40:10,770 INFO L290 TraceCheckUtils]: 7: Hoare triple {136#(<= (+ main_~main__x~0 50) 0)} [56] L26-->L32: Formula: (< v_main_~main__y~0_7 1000000) InVars {main_~main__y~0=v_main_~main__y~0_7} OutVars{main_~main__y~0=v_main_~main__y~0_7} AuxVars[] AssignedVars[] {136#(<= (+ main_~main__x~0 50) 0)} is VALID [2022-04-15 00:40:10,771 INFO L290 TraceCheckUtils]: 8: Hoare triple {136#(<= (+ main_~main__x~0 50) 0)} [57] L32-->L46: Formula: (and (= (+ v_main_~main__x~0_6 v_main_~main__y~0_9) v_main_~main__x~0_5) (= (+ v_main_~main__y~0_9 1) v_main_~main__y~0_8) (= v_main_~main____CPAchecker_TMP_0~0_1 v_main_~main__y~0_9) (= v_main_~main____CPAchecker_TMP_0~0_1 v_~__tmp_55_0~0_1) (< v_main_~main__x~0_6 0)) InVars {main_~main__x~0=v_main_~main__x~0_6, main_~main__y~0=v_main_~main__y~0_9} OutVars{~__tmp_55_0~0=v_~__tmp_55_0~0_1, main_~main____CPAchecker_TMP_0~0=v_main_~main____CPAchecker_TMP_0~0_1, main_~main__x~0=v_main_~main__x~0_5, main_~main__y~0=v_main_~main__y~0_8} AuxVars[] AssignedVars[~__tmp_55_0~0, main_~main____CPAchecker_TMP_0~0, main_~main__x~0, main_~main__y~0] {137#(<= (+ 51 main_~main__x~0) main_~main__y~0)} is VALID [2022-04-15 00:40:10,771 INFO L290 TraceCheckUtils]: 9: Hoare triple {137#(<= (+ 51 main_~main__x~0) main_~main__y~0)} [59] L46-->L40: Formula: (= v_main_~main____CPAchecker_TMP_0~0_2 v_~__tmp_55_0~0_2) InVars {~__tmp_55_0~0=v_~__tmp_55_0~0_2} OutVars{~__tmp_55_0~0=v_~__tmp_55_0~0_2, main_~main____CPAchecker_TMP_0~0=v_main_~main____CPAchecker_TMP_0~0_2} AuxVars[] AssignedVars[main_~main____CPAchecker_TMP_0~0] {137#(<= (+ 51 main_~main__x~0) main_~main__y~0)} is VALID [2022-04-15 00:40:10,772 INFO L290 TraceCheckUtils]: 10: Hoare triple {137#(<= (+ 51 main_~main__x~0) main_~main__y~0)} [60] L40-->L46: Formula: (and (= (+ v_main_~main__y~0_11 v_main_~main__x~0_8) v_main_~main__x~0_7) (= (+ v_main_~main__y~0_11 1) v_main_~main__y~0_10) (= v_main_~main____CPAchecker_TMP_0~1_1 v_main_~main__y~0_11) (< v_main_~main__x~0_8 0) (= v_main_~main____CPAchecker_TMP_0~1_1 v_~__tmp_55_0~0_3)) InVars {main_~main__x~0=v_main_~main__x~0_8, main_~main__y~0=v_main_~main__y~0_11} OutVars{~__tmp_55_0~0=v_~__tmp_55_0~0_3, main_~main____CPAchecker_TMP_0~1=v_main_~main____CPAchecker_TMP_0~1_1, main_~main__x~0=v_main_~main__x~0_7, main_~main__y~0=v_main_~main__y~0_10} AuxVars[] AssignedVars[~__tmp_55_0~0, main_~main____CPAchecker_TMP_0~1, main_~main__x~0, main_~main__y~0] {138#(<= (+ 53 main_~main__x~0) (* 2 main_~main__y~0))} is VALID [2022-04-15 00:40:10,772 INFO L290 TraceCheckUtils]: 11: Hoare triple {138#(<= (+ 53 main_~main__x~0) (* 2 main_~main__y~0))} [59] L46-->L40: Formula: (= v_main_~main____CPAchecker_TMP_0~0_2 v_~__tmp_55_0~0_2) InVars {~__tmp_55_0~0=v_~__tmp_55_0~0_2} OutVars{~__tmp_55_0~0=v_~__tmp_55_0~0_2, main_~main____CPAchecker_TMP_0~0=v_main_~main____CPAchecker_TMP_0~0_2} AuxVars[] AssignedVars[main_~main____CPAchecker_TMP_0~0] {138#(<= (+ 53 main_~main__x~0) (* 2 main_~main__y~0))} is VALID [2022-04-15 00:40:10,773 INFO L290 TraceCheckUtils]: 12: Hoare triple {138#(<= (+ 53 main_~main__x~0) (* 2 main_~main__y~0))} [61] L40-->L55: Formula: (and (not (< v_main_~main__x~0_9 0)) (= v_main_~__tmp_1~0_1 v_main_~__VERIFIER_assert__cond~0_2) (= (ite (< 0 v_main_~main__y~0_12) 1 0) v_main_~__tmp_1~0_1)) InVars {main_~main__x~0=v_main_~main__x~0_9, main_~main__y~0=v_main_~main__y~0_12} OutVars{main_~__VERIFIER_assert__cond~0=v_main_~__VERIFIER_assert__cond~0_2, main_~main__x~0=v_main_~main__x~0_9, main_~main__y~0=v_main_~main__y~0_12, main_~__tmp_1~0=v_main_~__tmp_1~0_1} AuxVars[] AssignedVars[main_~__VERIFIER_assert__cond~0, main_~__tmp_1~0] {139#(not (= main_~__VERIFIER_assert__cond~0 0))} is VALID [2022-04-15 00:40:10,773 INFO L290 TraceCheckUtils]: 13: Hoare triple {139#(not (= main_~__VERIFIER_assert__cond~0 0))} [62] L55-->L57: Formula: (= v_main_~__VERIFIER_assert__cond~0_4 0) InVars {main_~__VERIFIER_assert__cond~0=v_main_~__VERIFIER_assert__cond~0_4} OutVars{main_~__VERIFIER_assert__cond~0=v_main_~__VERIFIER_assert__cond~0_4} AuxVars[] AssignedVars[] {132#false} is VALID [2022-04-15 00:40:10,773 INFO L290 TraceCheckUtils]: 14: Hoare triple {132#false} [64] L57-->mainErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {132#false} is VALID [2022-04-15 00:40:10,774 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 00:40:10,774 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 00:40:10,774 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1834829056] [2022-04-15 00:40:10,774 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1834829056] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 00:40:10,775 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [922197194] [2022-04-15 00:40:10,775 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 00:40:10,775 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 00:40:10,775 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 00:40:10,792 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-15 00:40:10,823 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-15 00:40:10,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 00:40:10,855 INFO L263 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 9 conjunts are in the unsatisfiable core [2022-04-15 00:40:10,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 00:40:10,870 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 00:40:11,156 INFO L272 TraceCheckUtils]: 0: Hoare triple {131#true} [46] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {131#true} is VALID [2022-04-15 00:40:11,156 INFO L290 TraceCheckUtils]: 1: Hoare triple {131#true} [48] 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_~__tmp_55_0~0_4 0) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 2) 28) (= (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) (= 0 v_~__return_main~0_5) (= 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{~__tmp_55_0~0=v_~__tmp_55_0~0_4, ~__return_main~0=v_~__return_main~0_5, #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[~__tmp_55_0~0, ~__return_main~0, #NULL.offset, ~__return_65~0, #NULL.base] {131#true} is VALID [2022-04-15 00:40:11,156 INFO L290 TraceCheckUtils]: 2: Hoare triple {131#true} [51] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {131#true} is VALID [2022-04-15 00:40:11,157 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {131#true} {131#true} [66] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {131#true} is VALID [2022-04-15 00:40:11,157 INFO L272 TraceCheckUtils]: 4: Hoare triple {131#true} [47] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {131#true} is VALID [2022-04-15 00:40:11,157 INFO L290 TraceCheckUtils]: 5: Hoare triple {131#true} [50] mainENTRY-->L20: Formula: (and (= |v_main_#t~nondet4_2| v_main_~main__y~0_1) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= |v_main_#t~nondet4_2| 2147483647) (= (- 50) v_main_~main__x~0_2)) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~main__x~0=v_main_~main__x~0_2, main_~main__y~0=v_main_~main__y~0_1} AuxVars[] AssignedVars[main_#t~nondet4, main_~main__x~0, main_~main__y~0] {136#(<= (+ main_~main__x~0 50) 0)} is VALID [2022-04-15 00:40:11,158 INFO L290 TraceCheckUtils]: 6: Hoare triple {136#(<= (+ main_~main__x~0 50) 0)} [53] L20-->L26: Formula: (< 0 (+ 1000 v_main_~main__y~0_5)) InVars {main_~main__y~0=v_main_~main__y~0_5} OutVars{main_~main__y~0=v_main_~main__y~0_5} AuxVars[] AssignedVars[] {136#(<= (+ main_~main__x~0 50) 0)} is VALID [2022-04-15 00:40:11,158 INFO L290 TraceCheckUtils]: 7: Hoare triple {136#(<= (+ main_~main__x~0 50) 0)} [56] L26-->L32: Formula: (< v_main_~main__y~0_7 1000000) InVars {main_~main__y~0=v_main_~main__y~0_7} OutVars{main_~main__y~0=v_main_~main__y~0_7} AuxVars[] AssignedVars[] {136#(<= (+ main_~main__x~0 50) 0)} is VALID [2022-04-15 00:40:11,159 INFO L290 TraceCheckUtils]: 8: Hoare triple {136#(<= (+ main_~main__x~0 50) 0)} [57] L32-->L46: Formula: (and (= (+ v_main_~main__x~0_6 v_main_~main__y~0_9) v_main_~main__x~0_5) (= (+ v_main_~main__y~0_9 1) v_main_~main__y~0_8) (= v_main_~main____CPAchecker_TMP_0~0_1 v_main_~main__y~0_9) (= v_main_~main____CPAchecker_TMP_0~0_1 v_~__tmp_55_0~0_1) (< v_main_~main__x~0_6 0)) InVars {main_~main__x~0=v_main_~main__x~0_6, main_~main__y~0=v_main_~main__y~0_9} OutVars{~__tmp_55_0~0=v_~__tmp_55_0~0_1, main_~main____CPAchecker_TMP_0~0=v_main_~main____CPAchecker_TMP_0~0_1, main_~main__x~0=v_main_~main__x~0_5, main_~main__y~0=v_main_~main__y~0_8} AuxVars[] AssignedVars[~__tmp_55_0~0, main_~main____CPAchecker_TMP_0~0, main_~main__x~0, main_~main__y~0] {137#(<= (+ 51 main_~main__x~0) main_~main__y~0)} is VALID [2022-04-15 00:40:11,159 INFO L290 TraceCheckUtils]: 9: Hoare triple {137#(<= (+ 51 main_~main__x~0) main_~main__y~0)} [59] L46-->L40: Formula: (= v_main_~main____CPAchecker_TMP_0~0_2 v_~__tmp_55_0~0_2) InVars {~__tmp_55_0~0=v_~__tmp_55_0~0_2} OutVars{~__tmp_55_0~0=v_~__tmp_55_0~0_2, main_~main____CPAchecker_TMP_0~0=v_main_~main____CPAchecker_TMP_0~0_2} AuxVars[] AssignedVars[main_~main____CPAchecker_TMP_0~0] {137#(<= (+ 51 main_~main__x~0) main_~main__y~0)} is VALID [2022-04-15 00:40:11,160 INFO L290 TraceCheckUtils]: 10: Hoare triple {137#(<= (+ 51 main_~main__x~0) main_~main__y~0)} [60] L40-->L46: Formula: (and (= (+ v_main_~main__y~0_11 v_main_~main__x~0_8) v_main_~main__x~0_7) (= (+ v_main_~main__y~0_11 1) v_main_~main__y~0_10) (= v_main_~main____CPAchecker_TMP_0~1_1 v_main_~main__y~0_11) (< v_main_~main__x~0_8 0) (= v_main_~main____CPAchecker_TMP_0~1_1 v_~__tmp_55_0~0_3)) InVars {main_~main__x~0=v_main_~main__x~0_8, main_~main__y~0=v_main_~main__y~0_11} OutVars{~__tmp_55_0~0=v_~__tmp_55_0~0_3, main_~main____CPAchecker_TMP_0~1=v_main_~main____CPAchecker_TMP_0~1_1, main_~main__x~0=v_main_~main__x~0_7, main_~main__y~0=v_main_~main__y~0_10} AuxVars[] AssignedVars[~__tmp_55_0~0, main_~main____CPAchecker_TMP_0~1, main_~main__x~0, main_~main__y~0] {138#(<= (+ 53 main_~main__x~0) (* 2 main_~main__y~0))} is VALID [2022-04-15 00:40:11,160 INFO L290 TraceCheckUtils]: 11: Hoare triple {138#(<= (+ 53 main_~main__x~0) (* 2 main_~main__y~0))} [59] L46-->L40: Formula: (= v_main_~main____CPAchecker_TMP_0~0_2 v_~__tmp_55_0~0_2) InVars {~__tmp_55_0~0=v_~__tmp_55_0~0_2} OutVars{~__tmp_55_0~0=v_~__tmp_55_0~0_2, main_~main____CPAchecker_TMP_0~0=v_main_~main____CPAchecker_TMP_0~0_2} AuxVars[] AssignedVars[main_~main____CPAchecker_TMP_0~0] {138#(<= (+ 53 main_~main__x~0) (* 2 main_~main__y~0))} is VALID [2022-04-15 00:40:11,161 INFO L290 TraceCheckUtils]: 12: Hoare triple {138#(<= (+ 53 main_~main__x~0) (* 2 main_~main__y~0))} [61] L40-->L55: Formula: (and (not (< v_main_~main__x~0_9 0)) (= v_main_~__tmp_1~0_1 v_main_~__VERIFIER_assert__cond~0_2) (= (ite (< 0 v_main_~main__y~0_12) 1 0) v_main_~__tmp_1~0_1)) InVars {main_~main__x~0=v_main_~main__x~0_9, main_~main__y~0=v_main_~main__y~0_12} OutVars{main_~__VERIFIER_assert__cond~0=v_main_~__VERIFIER_assert__cond~0_2, main_~main__x~0=v_main_~main__x~0_9, main_~main__y~0=v_main_~main__y~0_12, main_~__tmp_1~0=v_main_~__tmp_1~0_1} AuxVars[] AssignedVars[main_~__VERIFIER_assert__cond~0, main_~__tmp_1~0] {180#(<= 1 main_~__VERIFIER_assert__cond~0)} is VALID [2022-04-15 00:40:11,161 INFO L290 TraceCheckUtils]: 13: Hoare triple {180#(<= 1 main_~__VERIFIER_assert__cond~0)} [62] L55-->L57: Formula: (= v_main_~__VERIFIER_assert__cond~0_4 0) InVars {main_~__VERIFIER_assert__cond~0=v_main_~__VERIFIER_assert__cond~0_4} OutVars{main_~__VERIFIER_assert__cond~0=v_main_~__VERIFIER_assert__cond~0_4} AuxVars[] AssignedVars[] {132#false} is VALID [2022-04-15 00:40:11,162 INFO L290 TraceCheckUtils]: 14: Hoare triple {132#false} [64] L57-->mainErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {132#false} is VALID [2022-04-15 00:40:11,162 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 00:40:11,162 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 00:40:11,349 INFO L290 TraceCheckUtils]: 14: Hoare triple {132#false} [64] L57-->mainErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {132#false} is VALID [2022-04-15 00:40:11,355 INFO L290 TraceCheckUtils]: 13: Hoare triple {180#(<= 1 main_~__VERIFIER_assert__cond~0)} [62] L55-->L57: Formula: (= v_main_~__VERIFIER_assert__cond~0_4 0) InVars {main_~__VERIFIER_assert__cond~0=v_main_~__VERIFIER_assert__cond~0_4} OutVars{main_~__VERIFIER_assert__cond~0=v_main_~__VERIFIER_assert__cond~0_4} AuxVars[] AssignedVars[] {132#false} is VALID [2022-04-15 00:40:11,356 INFO L290 TraceCheckUtils]: 12: Hoare triple {193#(or (< main_~main__x~0 0) (< 0 main_~main__y~0))} [61] L40-->L55: Formula: (and (not (< v_main_~main__x~0_9 0)) (= v_main_~__tmp_1~0_1 v_main_~__VERIFIER_assert__cond~0_2) (= (ite (< 0 v_main_~main__y~0_12) 1 0) v_main_~__tmp_1~0_1)) InVars {main_~main__x~0=v_main_~main__x~0_9, main_~main__y~0=v_main_~main__y~0_12} OutVars{main_~__VERIFIER_assert__cond~0=v_main_~__VERIFIER_assert__cond~0_2, main_~main__x~0=v_main_~main__x~0_9, main_~main__y~0=v_main_~main__y~0_12, main_~__tmp_1~0=v_main_~__tmp_1~0_1} AuxVars[] AssignedVars[main_~__VERIFIER_assert__cond~0, main_~__tmp_1~0] {180#(<= 1 main_~__VERIFIER_assert__cond~0)} is VALID [2022-04-15 00:40:11,356 INFO L290 TraceCheckUtils]: 11: Hoare triple {193#(or (< main_~main__x~0 0) (< 0 main_~main__y~0))} [59] L46-->L40: Formula: (= v_main_~main____CPAchecker_TMP_0~0_2 v_~__tmp_55_0~0_2) InVars {~__tmp_55_0~0=v_~__tmp_55_0~0_2} OutVars{~__tmp_55_0~0=v_~__tmp_55_0~0_2, main_~main____CPAchecker_TMP_0~0=v_main_~main____CPAchecker_TMP_0~0_2} AuxVars[] AssignedVars[main_~main____CPAchecker_TMP_0~0] {193#(or (< main_~main__x~0 0) (< 0 main_~main__y~0))} is VALID [2022-04-15 00:40:11,357 INFO L290 TraceCheckUtils]: 10: Hoare triple {200#(or (< 0 (+ main_~main__y~0 1)) (< (+ main_~main__x~0 main_~main__y~0) 0))} [60] L40-->L46: Formula: (and (= (+ v_main_~main__y~0_11 v_main_~main__x~0_8) v_main_~main__x~0_7) (= (+ v_main_~main__y~0_11 1) v_main_~main__y~0_10) (= v_main_~main____CPAchecker_TMP_0~1_1 v_main_~main__y~0_11) (< v_main_~main__x~0_8 0) (= v_main_~main____CPAchecker_TMP_0~1_1 v_~__tmp_55_0~0_3)) InVars {main_~main__x~0=v_main_~main__x~0_8, main_~main__y~0=v_main_~main__y~0_11} OutVars{~__tmp_55_0~0=v_~__tmp_55_0~0_3, main_~main____CPAchecker_TMP_0~1=v_main_~main____CPAchecker_TMP_0~1_1, main_~main__x~0=v_main_~main__x~0_7, main_~main__y~0=v_main_~main__y~0_10} AuxVars[] AssignedVars[~__tmp_55_0~0, main_~main____CPAchecker_TMP_0~1, main_~main__x~0, main_~main__y~0] {193#(or (< main_~main__x~0 0) (< 0 main_~main__y~0))} is VALID [2022-04-15 00:40:11,357 INFO L290 TraceCheckUtils]: 9: Hoare triple {200#(or (< 0 (+ main_~main__y~0 1)) (< (+ main_~main__x~0 main_~main__y~0) 0))} [59] L46-->L40: Formula: (= v_main_~main____CPAchecker_TMP_0~0_2 v_~__tmp_55_0~0_2) InVars {~__tmp_55_0~0=v_~__tmp_55_0~0_2} OutVars{~__tmp_55_0~0=v_~__tmp_55_0~0_2, main_~main____CPAchecker_TMP_0~0=v_main_~main____CPAchecker_TMP_0~0_2} AuxVars[] AssignedVars[main_~main____CPAchecker_TMP_0~0] {200#(or (< 0 (+ main_~main__y~0 1)) (< (+ main_~main__x~0 main_~main__y~0) 0))} is VALID [2022-04-15 00:40:11,358 INFO L290 TraceCheckUtils]: 8: Hoare triple {207#(< main_~main__x~0 3)} [57] L32-->L46: Formula: (and (= (+ v_main_~main__x~0_6 v_main_~main__y~0_9) v_main_~main__x~0_5) (= (+ v_main_~main__y~0_9 1) v_main_~main__y~0_8) (= v_main_~main____CPAchecker_TMP_0~0_1 v_main_~main__y~0_9) (= v_main_~main____CPAchecker_TMP_0~0_1 v_~__tmp_55_0~0_1) (< v_main_~main__x~0_6 0)) InVars {main_~main__x~0=v_main_~main__x~0_6, main_~main__y~0=v_main_~main__y~0_9} OutVars{~__tmp_55_0~0=v_~__tmp_55_0~0_1, main_~main____CPAchecker_TMP_0~0=v_main_~main____CPAchecker_TMP_0~0_1, main_~main__x~0=v_main_~main__x~0_5, main_~main__y~0=v_main_~main__y~0_8} AuxVars[] AssignedVars[~__tmp_55_0~0, main_~main____CPAchecker_TMP_0~0, main_~main__x~0, main_~main__y~0] {200#(or (< 0 (+ main_~main__y~0 1)) (< (+ main_~main__x~0 main_~main__y~0) 0))} is VALID [2022-04-15 00:40:11,358 INFO L290 TraceCheckUtils]: 7: Hoare triple {207#(< main_~main__x~0 3)} [56] L26-->L32: Formula: (< v_main_~main__y~0_7 1000000) InVars {main_~main__y~0=v_main_~main__y~0_7} OutVars{main_~main__y~0=v_main_~main__y~0_7} AuxVars[] AssignedVars[] {207#(< main_~main__x~0 3)} is VALID [2022-04-15 00:40:11,359 INFO L290 TraceCheckUtils]: 6: Hoare triple {207#(< main_~main__x~0 3)} [53] L20-->L26: Formula: (< 0 (+ 1000 v_main_~main__y~0_5)) InVars {main_~main__y~0=v_main_~main__y~0_5} OutVars{main_~main__y~0=v_main_~main__y~0_5} AuxVars[] AssignedVars[] {207#(< main_~main__x~0 3)} is VALID [2022-04-15 00:40:11,359 INFO L290 TraceCheckUtils]: 5: Hoare triple {131#true} [50] mainENTRY-->L20: Formula: (and (= |v_main_#t~nondet4_2| v_main_~main__y~0_1) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= |v_main_#t~nondet4_2| 2147483647) (= (- 50) v_main_~main__x~0_2)) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~main__x~0=v_main_~main__x~0_2, main_~main__y~0=v_main_~main__y~0_1} AuxVars[] AssignedVars[main_#t~nondet4, main_~main__x~0, main_~main__y~0] {207#(< main_~main__x~0 3)} is VALID [2022-04-15 00:40:11,359 INFO L272 TraceCheckUtils]: 4: Hoare triple {131#true} [47] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {131#true} is VALID [2022-04-15 00:40:11,360 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {131#true} {131#true} [66] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {131#true} is VALID [2022-04-15 00:40:11,360 INFO L290 TraceCheckUtils]: 2: Hoare triple {131#true} [51] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {131#true} is VALID [2022-04-15 00:40:11,360 INFO L290 TraceCheckUtils]: 1: Hoare triple {131#true} [48] 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_~__tmp_55_0~0_4 0) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 2) 28) (= (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) (= 0 v_~__return_main~0_5) (= 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{~__tmp_55_0~0=v_~__tmp_55_0~0_4, ~__return_main~0=v_~__return_main~0_5, #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[~__tmp_55_0~0, ~__return_main~0, #NULL.offset, ~__return_65~0, #NULL.base] {131#true} is VALID [2022-04-15 00:40:11,360 INFO L272 TraceCheckUtils]: 0: Hoare triple {131#true} [46] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {131#true} is VALID [2022-04-15 00:40:11,360 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 00:40:11,360 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [922197194] provided 1 perfect and 1 imperfect interpolant sequences [2022-04-15 00:40:11,361 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-04-15 00:40:11,361 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [7, 6] total 11 [2022-04-15 00:40:11,361 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1158923765] [2022-04-15 00:40:11,361 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 00:40:11,362 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.0) internal successors, (12), 6 states have internal predecessors, (12), 1 states have call successors, (2), 1 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 15 [2022-04-15 00:40:11,362 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 00:40:11,362 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 2.0) internal successors, (12), 6 states have internal predecessors, (12), 1 states have call successors, (2), 1 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-15 00:40:11,373 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 15 edges. 15 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 00:40:11,373 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-15 00:40:11,373 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-15 00:40:11,374 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-15 00:40:11,374 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2022-04-15 00:40:11,374 INFO L87 Difference]: Start difference. First operand 16 states and 16 transitions. Second operand has 6 states, 6 states have (on average 2.0) internal successors, (12), 6 states have internal predecessors, (12), 1 states have call successors, (2), 1 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-15 00:40:11,429 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 00:40:11,430 INFO L93 Difference]: Finished difference Result 16 states and 16 transitions. [2022-04-15 00:40:11,430 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-15 00:40:11,430 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.0) internal successors, (12), 6 states have internal predecessors, (12), 1 states have call successors, (2), 1 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 15 [2022-04-15 00:40:11,430 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 00:40:11,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.0) internal successors, (12), 6 states have internal predecessors, (12), 1 states have call successors, (2), 1 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-15 00:40:11,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 14 transitions. [2022-04-15 00:40:11,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.0) internal successors, (12), 6 states have internal predecessors, (12), 1 states have call successors, (2), 1 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-15 00:40:11,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 14 transitions. [2022-04-15 00:40:11,432 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 14 transitions. [2022-04-15 00:40:11,442 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 14 edges. 14 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 00:40:11,442 INFO L225 Difference]: With dead ends: 16 [2022-04-15 00:40:11,442 INFO L226 Difference]: Without dead ends: 0 [2022-04-15 00:40:11,443 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 26 SyntacticMatches, 2 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=116, Unknown=0, NotChecked=0, Total=156 [2022-04-15 00:40:11,443 INFO L913 BasicCegarLoop]: 7 mSDtfsCounter, 6 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 25 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 00:40:11,444 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [6 Valid, 25 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 00:40:11,444 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-04-15 00:40:11,444 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-04-15 00:40:11,445 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 00:40:11,445 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-15 00:40:11,445 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-15 00:40:11,445 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-15 00:40:11,445 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 00:40:11,445 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-15 00:40:11,445 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-15 00:40:11,445 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 00:40:11,445 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 00:40:11,445 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-15 00:40:11,445 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-15 00:40:11,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 00:40:11,446 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-15 00:40:11,446 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-15 00:40:11,446 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 00:40:11,446 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 00:40:11,446 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 00:40:11,446 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 00:40:11,446 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-15 00:40:11,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-04-15 00:40:11,446 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 15 [2022-04-15 00:40:11,446 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 00:40:11,447 INFO L478 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-04-15 00:40:11,447 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.0) internal successors, (12), 6 states have internal predecessors, (12), 1 states have call successors, (2), 1 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-15 00:40:11,447 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-15 00:40:11,447 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 00:40:11,449 INFO L788 garLoopResultBuilder]: Registering result SAFE for location mainErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-04-15 00:40:11,467 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-04-15 00:40:11,664 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-15 00:40:11,666 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-04-15 00:40:11,697 INFO L878 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) (= ~__tmp_55_0~0 |old(~__tmp_55_0~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|)) [2022-04-15 00:40:11,697 INFO L882 garLoopResultBuilder]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2022-04-15 00:40:11,697 INFO L882 garLoopResultBuilder]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2022-04-15 00:40:11,697 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2022-04-15 00:40:11,697 INFO L885 garLoopResultBuilder]: At program point L-1(line -1) the Hoare annotation is: true [2022-04-15 00:40:11,697 INFO L882 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2022-04-15 00:40:11,698 INFO L882 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-04-15 00:40:11,698 INFO L878 garLoopResultBuilder]: At program point mainENTRY(lines 14 74) the Hoare annotation is: (and (= |old(~__return_65~0)| ~__return_65~0) (= ~__tmp_55_0~0 |old(~__tmp_55_0~0)|)) [2022-04-15 00:40:11,698 INFO L882 garLoopResultBuilder]: For program point L20(lines 20 73) no Hoare annotation was computed. [2022-04-15 00:40:11,698 INFO L882 garLoopResultBuilder]: For program point mainFINAL(lines 14 74) no Hoare annotation was computed. [2022-04-15 00:40:11,698 INFO L882 garLoopResultBuilder]: For program point L26(lines 26 72) no Hoare annotation was computed. [2022-04-15 00:40:11,698 INFO L882 garLoopResultBuilder]: For program point mainEXIT(lines 14 74) no Hoare annotation was computed. [2022-04-15 00:40:11,698 INFO L882 garLoopResultBuilder]: For program point L32(lines 32 71) no Hoare annotation was computed. [2022-04-15 00:40:11,698 INFO L878 garLoopResultBuilder]: At program point L46(lines 33 67) the Hoare annotation is: (or (< main_~main__x~0 0) (< 0 main_~main__y~0)) [2022-04-15 00:40:11,699 INFO L882 garLoopResultBuilder]: For program point L40(lines 40 66) no Hoare annotation was computed. [2022-04-15 00:40:11,699 INFO L882 garLoopResultBuilder]: For program point L55(lines 55 64) no Hoare annotation was computed. [2022-04-15 00:40:11,699 INFO L882 garLoopResultBuilder]: For program point L57(line 57) no Hoare annotation was computed. [2022-04-15 00:40:11,699 INFO L882 garLoopResultBuilder]: For program point mainErr0ASSERT_VIOLATIONERROR_FUNCTION(line 57) no Hoare annotation was computed. [2022-04-15 00:40:11,702 INFO L719 BasicCegarLoop]: Path program histogram: [1, 1] [2022-04-15 00:40:11,703 INFO L177 ceAbstractionStarter]: Computing trace abstraction results [2022-04-15 00:40:11,708 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2022-04-15 00:40:11,708 WARN L170 areAnnotationChecker]: L20 has no Hoare annotation [2022-04-15 00:40:11,708 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2022-04-15 00:40:11,708 WARN L170 areAnnotationChecker]: L20 has no Hoare annotation [2022-04-15 00:40:11,708 WARN L170 areAnnotationChecker]: L20 has no Hoare annotation [2022-04-15 00:40:11,708 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2022-04-15 00:40:11,708 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2022-04-15 00:40:11,708 WARN L170 areAnnotationChecker]: L26 has no Hoare annotation [2022-04-15 00:40:11,708 WARN L170 areAnnotationChecker]: L26 has no Hoare annotation [2022-04-15 00:40:11,709 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2022-04-15 00:40:11,709 WARN L170 areAnnotationChecker]: L32 has no Hoare annotation [2022-04-15 00:40:11,709 WARN L170 areAnnotationChecker]: L32 has no Hoare annotation [2022-04-15 00:40:11,709 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2022-04-15 00:40:11,709 WARN L170 areAnnotationChecker]: L40 has no Hoare annotation [2022-04-15 00:40:11,709 WARN L170 areAnnotationChecker]: L40 has no Hoare annotation [2022-04-15 00:40:11,709 WARN L170 areAnnotationChecker]: L40 has no Hoare annotation [2022-04-15 00:40:11,710 WARN L170 areAnnotationChecker]: L55 has no Hoare annotation [2022-04-15 00:40:11,710 WARN L170 areAnnotationChecker]: L55 has no Hoare annotation [2022-04-15 00:40:11,710 WARN L170 areAnnotationChecker]: L57 has no Hoare annotation [2022-04-15 00:40:11,710 WARN L170 areAnnotationChecker]: L57 has no Hoare annotation [2022-04-15 00:40:11,710 INFO L163 areAnnotationChecker]: CFG has 2 edges. 2 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2022-04-15 00:40:11,719 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.04 12:40:11 BasicIcfg [2022-04-15 00:40:11,719 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-04-15 00:40:11,720 INFO L158 Benchmark]: Toolchain (without parser) took 2611.31ms. Allocated memory is still 169.9MB. Free memory was 115.8MB in the beginning and 74.7MB in the end (delta: 41.1MB). Peak memory consumption was 42.2MB. Max. memory is 8.0GB. [2022-04-15 00:40:11,720 INFO L158 Benchmark]: CDTParser took 0.09ms. Allocated memory is still 169.9MB. Free memory was 132.2MB in the beginning and 132.1MB in the end (delta: 78.9kB). There was no memory consumed. Max. memory is 8.0GB. [2022-04-15 00:40:11,720 INFO L158 Benchmark]: CACSL2BoogieTranslator took 266.38ms. Allocated memory is still 169.9MB. Free memory was 115.6MB in the beginning and 145.1MB in the end (delta: -29.5MB). Peak memory consumption was 13.2MB. Max. memory is 8.0GB. [2022-04-15 00:40:11,721 INFO L158 Benchmark]: Boogie Preprocessor took 39.25ms. Allocated memory is still 169.9MB. Free memory was 145.1MB in the beginning and 143.5MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-04-15 00:40:11,721 INFO L158 Benchmark]: RCFGBuilder took 320.12ms. Allocated memory is still 169.9MB. Free memory was 143.5MB in the beginning and 133.0MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. [2022-04-15 00:40:11,721 INFO L158 Benchmark]: IcfgTransformer took 42.74ms. Allocated memory is still 169.9MB. Free memory was 133.0MB in the beginning and 131.5MB in the end (delta: 1.5MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-04-15 00:40:11,722 INFO L158 Benchmark]: TraceAbstraction took 1931.90ms. Allocated memory is still 169.9MB. Free memory was 131.0MB in the beginning and 74.7MB in the end (delta: 56.3MB). Peak memory consumption was 57.3MB. Max. memory is 8.0GB. [2022-04-15 00:40:11,723 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.09ms. Allocated memory is still 169.9MB. Free memory was 132.2MB in the beginning and 132.1MB in the end (delta: 78.9kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 266.38ms. Allocated memory is still 169.9MB. Free memory was 115.6MB in the beginning and 145.1MB in the end (delta: -29.5MB). Peak memory consumption was 13.2MB. Max. memory is 8.0GB. * Boogie Preprocessor took 39.25ms. Allocated memory is still 169.9MB. Free memory was 145.1MB in the beginning and 143.5MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 320.12ms. Allocated memory is still 169.9MB. Free memory was 143.5MB in the beginning and 133.0MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. * IcfgTransformer took 42.74ms. Allocated memory is still 169.9MB. Free memory was 133.0MB in the beginning and 131.5MB in the end (delta: 1.5MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * TraceAbstraction took 1931.90ms. Allocated memory is still 169.9MB. Free memory was 131.0MB in the beginning and 74.7MB in the end (delta: 56.3MB). Peak memory consumption was 57.3MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 57]: 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, 18 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 1.9s, OverallIterations: 2, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 22 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 22 mSDsluCounter, 79 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 54 mSDsCounter, 8 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 57 IncrementalHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 8 mSolverCounterUnsat, 25 mSDtfsCounter, 57 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 49 GetRequests, 29 SyntacticMatches, 2 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=18occurred in iteration=0, InterpolantAutomatonStates: 13, 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, 6 NumberOfFragments, 32 HoareAnnotationTreeSize, 5 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 5 FomulaSimplificationsInter, 13 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.8s InterpolantComputationTime, 43 NumberOfCodeBlocks, 43 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 54 ConstructedInterpolants, 0 QuantifiedInterpolants, 216 SizeOfPredicates, 4 NumberOfNonLiveVariables, 101 ConjunctsInSsa, 9 ConjunctsInUnsatCore, 4 InterpolantComputations, 2 PerfectInterpolantSequences, 2/6 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: 33]: Loop Invariant Derived loop invariant: main__x < 0 || 0 < main__y RESULT: Ultimate proved your program to be correct! [2022-04-15 00:40:11,759 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...