/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/jm2006_variant.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-e106359-m [2022-04-15 00:40:26,563 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-15 00:40:26,565 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-15 00:40:26,613 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-15 00:40:26,613 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-15 00:40:26,614 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-15 00:40:26,616 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-15 00:40:26,618 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-15 00:40:26,619 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-15 00:40:26,622 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-15 00:40:26,623 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-15 00:40:26,624 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-15 00:40:26,624 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-15 00:40:26,625 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-15 00:40:26,626 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-15 00:40:26,628 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-15 00:40:26,628 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-15 00:40:26,629 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-15 00:40:26,631 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-15 00:40:26,635 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-15 00:40:26,636 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-15 00:40:26,637 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-15 00:40:26,637 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-15 00:40:26,638 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-15 00:40:26,639 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-15 00:40:26,640 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-15 00:40:26,641 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-15 00:40:26,641 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-15 00:40:26,641 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-15 00:40:26,641 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-15 00:40:26,642 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-15 00:40:26,643 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-15 00:40:26,644 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-15 00:40:26,644 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-15 00:40:26,644 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-15 00:40:26,645 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-15 00:40:26,645 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-15 00:40:26,645 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-15 00:40:26,646 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-15 00:40:26,646 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-15 00:40:26,646 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-15 00:40:26,647 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-15 00:40:26,648 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:26,668 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-15 00:40:26,669 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-15 00:40:26,669 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-04-15 00:40:26,669 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-04-15 00:40:26,670 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-04-15 00:40:26,670 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-04-15 00:40:26,670 INFO L138 SettingsManager]: * Use SBE=true [2022-04-15 00:40:26,670 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-15 00:40:26,670 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-15 00:40:26,671 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-15 00:40:26,671 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-15 00:40:26,671 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-15 00:40:26,671 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-15 00:40:26,671 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-15 00:40:26,671 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-15 00:40:26,671 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-15 00:40:26,672 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-15 00:40:26,672 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-15 00:40:26,672 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-15 00:40:26,672 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-15 00:40:26,672 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-15 00:40:26,672 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-04-15 00:40:26,672 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-04-15 00:40:26,672 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-04-15 00:40:26,672 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-04-15 00:40:26,673 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-15 00:40:26,673 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-04-15 00:40:26,673 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-04-15 00:40:26,673 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-04-15 00:40:26,673 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:26,854 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-15 00:40:26,884 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-15 00:40:26,885 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-15 00:40:26,886 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-15 00:40:26,887 INFO L275 PluginConnector]: CDTParser initialized [2022-04-15 00:40:26,888 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-lit/jm2006_variant.i [2022-04-15 00:40:26,926 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f7235854f/495c0cc754f147a7a4875d0ccb7c7dc2/FLAGd93e402d5 [2022-04-15 00:40:27,255 INFO L306 CDTParser]: Found 1 translation units. [2022-04-15 00:40:27,255 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-lit/jm2006_variant.i [2022-04-15 00:40:27,261 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f7235854f/495c0cc754f147a7a4875d0ccb7c7dc2/FLAGd93e402d5 [2022-04-15 00:40:27,684 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f7235854f/495c0cc754f147a7a4875d0ccb7c7dc2 [2022-04-15 00:40:27,686 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-15 00:40:27,687 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-04-15 00:40:27,688 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-15 00:40:27,688 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-15 00:40:27,697 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-15 00:40:27,698 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.04 12:40:27" (1/1) ... [2022-04-15 00:40:27,699 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@736d96bf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:40:27, skipping insertion in model container [2022-04-15 00:40:27,699 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.04 12:40:27" (1/1) ... [2022-04-15 00:40:27,703 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-15 00:40:27,711 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-15 00:40:27,814 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/jm2006_variant.i[895,908] [2022-04-15 00:40:27,835 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-15 00:40:27,853 INFO L203 MainTranslator]: Completed pre-run [2022-04-15 00:40:27,861 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/jm2006_variant.i[895,908] [2022-04-15 00:40:27,871 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-15 00:40:27,882 INFO L208 MainTranslator]: Completed translation [2022-04-15 00:40:27,882 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:40:27 WrapperNode [2022-04-15 00:40:27,884 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-15 00:40:27,884 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-15 00:40:27,885 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-15 00:40:27,885 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-15 00:40:27,906 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:27" (1/1) ... [2022-04-15 00:40:27,907 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:27" (1/1) ... [2022-04-15 00:40:27,910 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:27" (1/1) ... [2022-04-15 00:40:27,910 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:27" (1/1) ... [2022-04-15 00:40:27,914 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:27" (1/1) ... [2022-04-15 00:40:27,927 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:27" (1/1) ... [2022-04-15 00:40:27,932 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:27" (1/1) ... [2022-04-15 00:40:27,934 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-15 00:40:27,939 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-15 00:40:27,939 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-15 00:40:27,939 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-15 00:40:27,940 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:40:27" (1/1) ... [2022-04-15 00:40:27,947 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-15 00:40:27,953 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 00:40:27,961 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:27,963 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:27,991 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-15 00:40:27,992 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-15 00:40:27,995 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-15 00:40:27,996 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-15 00:40:27,996 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-15 00:40:27,996 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-15 00:40:27,996 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-15 00:40:27,999 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-15 00:40:28,000 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_perror_fail [2022-04-15 00:40:28,000 INFO L130 BoogieDeclarations]: Found specification of procedure __assert [2022-04-15 00:40:28,000 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-15 00:40:28,000 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-15 00:40:28,000 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-15 00:40:28,000 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-15 00:40:28,001 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-04-15 00:40:28,001 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-15 00:40:28,003 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-15 00:40:28,003 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-15 00:40:28,003 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-15 00:40:28,003 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-15 00:40:28,003 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-15 00:40:28,003 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-15 00:40:28,053 INFO L234 CfgBuilder]: Building ICFG [2022-04-15 00:40:28,054 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-15 00:40:28,151 INFO L275 CfgBuilder]: Performing block encoding [2022-04-15 00:40:28,155 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-15 00:40:28,156 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-15 00:40:28,157 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.04 12:40:28 BoogieIcfgContainer [2022-04-15 00:40:28,157 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-15 00:40:28,157 INFO L113 PluginConnector]: ------------------------IcfgTransformer---------------------------- [2022-04-15 00:40:28,158 INFO L271 PluginConnector]: Initializing IcfgTransformer... [2022-04-15 00:40:28,158 INFO L275 PluginConnector]: IcfgTransformer initialized [2022-04-15 00:40:28,160 INFO L185 PluginConnector]: Executing the observer IcfgTransformationObserver from plugin IcfgTransformer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.04 12:40:28" (1/1) ... [2022-04-15 00:40:28,162 INFO L168 ansformationObserver]: Applying ICFG transformation LOOP_ACCELERATION_QVASR [2022-04-15 00:40:28,177 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 15.04 12:40:28 BasicIcfg [2022-04-15 00:40:28,177 INFO L132 PluginConnector]: ------------------------ END IcfgTransformer---------------------------- [2022-04-15 00:40:28,179 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-15 00:40:28,179 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-15 00:40:28,181 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-15 00:40:28,181 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.04 12:40:27" (1/4) ... [2022-04-15 00:40:28,181 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5a30930d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.04 12:40:28, skipping insertion in model container [2022-04-15 00:40:28,181 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:40:27" (2/4) ... [2022-04-15 00:40:28,182 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5a30930d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.04 12:40:28, skipping insertion in model container [2022-04-15 00:40:28,182 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.04 12:40:28" (3/4) ... [2022-04-15 00:40:28,182 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5a30930d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.04 12:40:28, skipping insertion in model container [2022-04-15 00:40:28,182 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 15.04 12:40:28" (4/4) ... [2022-04-15 00:40:28,183 INFO L111 eAbstractionObserver]: Analyzing ICFG jm2006_variant.iqvasr [2022-04-15 00:40:28,186 INFO L202 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-04-15 00:40:28,186 INFO L161 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-15 00:40:28,213 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-15 00:40:28,217 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:28,217 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-15 00:40:28,230 INFO L276 IsEmpty]: Start isEmpty. Operand has 22 states, 14 states have (on average 1.5) internal successors, (21), 16 states have internal predecessors, (21), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 00:40:28,233 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-04-15 00:40:28,233 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 00:40:28,235 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 00:40:28,235 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 00:40:28,238 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 00:40:28,239 INFO L85 PathProgramCache]: Analyzing trace with hash 1409552995, now seen corresponding path program 1 times [2022-04-15 00:40:28,246 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 00:40:28,247 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1613297500] [2022-04-15 00:40:28,247 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 00:40:28,247 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 00:40:28,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 00:40:28,356 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 00:40:28,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 00:40:28,368 INFO L290 TraceCheckUtils]: 0: Hoare triple {30#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [69] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= (select |v_#length_1| 2) 9) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {25#true} is VALID [2022-04-15 00:40:28,369 INFO L290 TraceCheckUtils]: 1: Hoare triple {25#true} [72] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {25#true} is VALID [2022-04-15 00:40:28,369 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {25#true} {25#true} [91] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {25#true} is VALID [2022-04-15 00:40:28,370 INFO L272 TraceCheckUtils]: 0: Hoare triple {25#true} [67] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {30#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 00:40:28,371 INFO L290 TraceCheckUtils]: 1: Hoare triple {30#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [69] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= (select |v_#length_1| 2) 9) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {25#true} is VALID [2022-04-15 00:40:28,371 INFO L290 TraceCheckUtils]: 2: Hoare triple {25#true} [72] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {25#true} is VALID [2022-04-15 00:40:28,371 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {25#true} {25#true} [91] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {25#true} is VALID [2022-04-15 00:40:28,371 INFO L272 TraceCheckUtils]: 4: Hoare triple {25#true} [68] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {25#true} is VALID [2022-04-15 00:40:28,372 INFO L290 TraceCheckUtils]: 5: Hoare triple {25#true} [71] mainENTRY-->L28: Formula: (and (<= |v_main_#t~nondet1_2| 2147483647) (= v_main_~j~0_3 |v_main_#t~nondet2_2|) (<= 0 (+ |v_main_#t~nondet2_2| 2147483648)) (<= |v_main_#t~nondet2_2| 2147483647) (<= 0 (+ |v_main_#t~nondet1_2| 2147483648)) (= v_main_~i~0_3 |v_main_#t~nondet1_2|)) InVars {main_#t~nondet1=|v_main_#t~nondet1_2|, main_#t~nondet2=|v_main_#t~nondet2_2|} OutVars{main_~i~0=v_main_~i~0_3, main_~j~0=v_main_~j~0_3} AuxVars[] AssignedVars[main_#t~nondet1, main_~j~0, main_#t~nondet2, main_~i~0] {25#true} is VALID [2022-04-15 00:40:28,372 INFO L290 TraceCheckUtils]: 6: Hoare triple {25#true} [74] L28-->L29: Formula: (and (<= v_main_~i~0_7 1000000) (<= 0 v_main_~i~0_7)) InVars {main_~i~0=v_main_~i~0_7} OutVars{main_~i~0=v_main_~i~0_7} AuxVars[] AssignedVars[] {25#true} is VALID [2022-04-15 00:40:28,372 INFO L290 TraceCheckUtils]: 7: Hoare triple {25#true} [77] L29-->L33-2: Formula: (and (= v_main_~j~0_7 v_main_~y~0_4) (= v_main_~i~0_8 v_main_~x~0_3) (= v_main_~z~0_4 0) (<= 0 v_main_~j~0_7)) InVars {main_~i~0=v_main_~i~0_8, main_~j~0=v_main_~j~0_7} OutVars{main_~i~0=v_main_~i~0_8, main_~y~0=v_main_~y~0_4, main_~x~0=v_main_~x~0_3, main_~z~0=v_main_~z~0_4, main_~j~0=v_main_~j~0_7} AuxVars[] AssignedVars[main_~x~0, main_~z~0, main_~y~0] {25#true} is VALID [2022-04-15 00:40:28,373 INFO L290 TraceCheckUtils]: 8: Hoare triple {25#true} [78] L33-2-->L33-3: Formula: false InVars {} OutVars{} AuxVars[] AssignedVars[] {26#false} is VALID [2022-04-15 00:40:28,373 INFO L290 TraceCheckUtils]: 9: Hoare triple {26#false} [81] L33-3-->L39: Formula: (= v_main_~i~0_1 v_main_~j~0_1) InVars {main_~i~0=v_main_~i~0_1, main_~j~0=v_main_~j~0_1} OutVars{main_~i~0=v_main_~i~0_1, main_~j~0=v_main_~j~0_1} AuxVars[] AssignedVars[] {26#false} is VALID [2022-04-15 00:40:28,373 INFO L272 TraceCheckUtils]: 10: Hoare triple {26#false} [83] L39-->__VERIFIER_assertENTRY: Formula: (= (ite (= (- v_main_~z~0_5) v_main_~y~0_5) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~y~0=v_main_~y~0_5, main_~z~0=v_main_~z~0_5} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~z~0, main_~y~0] {26#false} is VALID [2022-04-15 00:40:28,373 INFO L290 TraceCheckUtils]: 11: Hoare triple {26#false} [85] __VERIFIER_assertENTRY-->L18: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {26#false} is VALID [2022-04-15 00:40:28,373 INFO L290 TraceCheckUtils]: 12: Hoare triple {26#false} [86] L18-->L19: Formula: (= v___VERIFIER_assert_~cond_2 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {26#false} is VALID [2022-04-15 00:40:28,374 INFO L290 TraceCheckUtils]: 13: Hoare triple {26#false} [88] L19-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {26#false} is VALID [2022-04-15 00:40:28,374 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:28,374 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 00:40:28,375 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1613297500] [2022-04-15 00:40:28,375 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1613297500] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 00:40:28,375 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 00:40:28,375 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-15 00:40:28,376 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [183149754] [2022-04-15 00:40:28,377 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 00:40:28,381 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 2 states have internal predecessors, (10), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 14 [2022-04-15 00:40:28,382 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 00:40:28,385 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 2 states have internal predecessors, (10), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 00:40:28,400 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:28,400 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-15 00:40:28,400 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-15 00:40:28,414 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-15 00:40:28,415 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-15 00:40:28,416 INFO L87 Difference]: Start difference. First operand has 22 states, 14 states have (on average 1.5) internal successors, (21), 16 states have internal predecessors, (21), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 2 states have internal predecessors, (10), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 00:40:28,466 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 00:40:28,467 INFO L93 Difference]: Finished difference Result 35 states and 42 transitions. [2022-04-15 00:40:28,467 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-15 00:40:28,467 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 2 states have internal predecessors, (10), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 14 [2022-04-15 00:40:28,467 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 00:40:28,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 2 states have internal predecessors, (10), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 00:40:28,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 42 transitions. [2022-04-15 00:40:28,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 2 states have internal predecessors, (10), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 00:40:28,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 42 transitions. [2022-04-15 00:40:28,478 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 42 transitions. [2022-04-15 00:40:28,519 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 42 edges. 42 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 00:40:28,524 INFO L225 Difference]: With dead ends: 35 [2022-04-15 00:40:28,524 INFO L226 Difference]: Without dead ends: 15 [2022-04-15 00:40:28,527 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-15 00:40:28,529 INFO L913 BasicCegarLoop]: 24 mSDtfsCounter, 16 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 27 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 00:40:28,530 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [17 Valid, 27 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 00:40:28,543 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2022-04-15 00:40:28,555 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2022-04-15 00:40:28,555 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 00:40:28,556 INFO L82 GeneralOperation]: Start isEquivalent. First operand 15 states. Second operand has 15 states, 10 states have (on average 1.1) internal successors, (11), 10 states have internal predecessors, (11), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 00:40:28,556 INFO L74 IsIncluded]: Start isIncluded. First operand 15 states. Second operand has 15 states, 10 states have (on average 1.1) internal successors, (11), 10 states have internal predecessors, (11), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 00:40:28,556 INFO L87 Difference]: Start difference. First operand 15 states. Second operand has 15 states, 10 states have (on average 1.1) internal successors, (11), 10 states have internal predecessors, (11), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 00:40:28,560 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 00:40:28,560 INFO L93 Difference]: Finished difference Result 15 states and 15 transitions. [2022-04-15 00:40:28,560 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions. [2022-04-15 00:40:28,561 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 00:40:28,561 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 00:40:28,561 INFO L74 IsIncluded]: Start isIncluded. First operand has 15 states, 10 states have (on average 1.1) internal successors, (11), 10 states have internal predecessors, (11), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 15 states. [2022-04-15 00:40:28,562 INFO L87 Difference]: Start difference. First operand has 15 states, 10 states have (on average 1.1) internal successors, (11), 10 states have internal predecessors, (11), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 15 states. [2022-04-15 00:40:28,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 00:40:28,564 INFO L93 Difference]: Finished difference Result 15 states and 15 transitions. [2022-04-15 00:40:28,565 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions. [2022-04-15 00:40:28,565 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 00:40:28,566 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 00:40:28,568 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 00:40:28,568 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 00:40:28,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 10 states have (on average 1.1) internal successors, (11), 10 states have internal predecessors, (11), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 00:40:28,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 15 transitions. [2022-04-15 00:40:28,579 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 15 transitions. Word has length 14 [2022-04-15 00:40:28,579 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 00:40:28,579 INFO L478 AbstractCegarLoop]: Abstraction has 15 states and 15 transitions. [2022-04-15 00:40:28,580 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 2 states have internal predecessors, (10), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 00:40:28,580 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions. [2022-04-15 00:40:28,581 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-04-15 00:40:28,581 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 00:40:28,581 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 00:40:28,581 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-15 00:40:28,581 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 00:40:28,585 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 00:40:28,585 INFO L85 PathProgramCache]: Analyzing trace with hash 1438182146, now seen corresponding path program 1 times [2022-04-15 00:40:28,585 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 00:40:28,585 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [906533172] [2022-04-15 00:40:28,585 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 00:40:28,585 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 00:40:28,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 00:40:28,921 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 00:40:28,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 00:40:28,929 INFO L290 TraceCheckUtils]: 0: Hoare triple {139#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [69] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= (select |v_#length_1| 2) 9) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {129#true} is VALID [2022-04-15 00:40:28,929 INFO L290 TraceCheckUtils]: 1: Hoare triple {129#true} [72] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {129#true} is VALID [2022-04-15 00:40:28,929 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {129#true} {129#true} [91] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {129#true} is VALID [2022-04-15 00:40:28,930 INFO L272 TraceCheckUtils]: 0: Hoare triple {129#true} [67] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {139#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 00:40:28,930 INFO L290 TraceCheckUtils]: 1: Hoare triple {139#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [69] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= (select |v_#length_1| 2) 9) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {129#true} is VALID [2022-04-15 00:40:28,930 INFO L290 TraceCheckUtils]: 2: Hoare triple {129#true} [72] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {129#true} is VALID [2022-04-15 00:40:28,930 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {129#true} {129#true} [91] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {129#true} is VALID [2022-04-15 00:40:28,931 INFO L272 TraceCheckUtils]: 4: Hoare triple {129#true} [68] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {129#true} is VALID [2022-04-15 00:40:28,931 INFO L290 TraceCheckUtils]: 5: Hoare triple {129#true} [71] mainENTRY-->L28: Formula: (and (<= |v_main_#t~nondet1_2| 2147483647) (= v_main_~j~0_3 |v_main_#t~nondet2_2|) (<= 0 (+ |v_main_#t~nondet2_2| 2147483648)) (<= |v_main_#t~nondet2_2| 2147483647) (<= 0 (+ |v_main_#t~nondet1_2| 2147483648)) (= v_main_~i~0_3 |v_main_#t~nondet1_2|)) InVars {main_#t~nondet1=|v_main_#t~nondet1_2|, main_#t~nondet2=|v_main_#t~nondet2_2|} OutVars{main_~i~0=v_main_~i~0_3, main_~j~0=v_main_~j~0_3} AuxVars[] AssignedVars[main_#t~nondet1, main_~j~0, main_#t~nondet2, main_~i~0] {129#true} is VALID [2022-04-15 00:40:28,931 INFO L290 TraceCheckUtils]: 6: Hoare triple {129#true} [74] L28-->L29: Formula: (and (<= v_main_~i~0_7 1000000) (<= 0 v_main_~i~0_7)) InVars {main_~i~0=v_main_~i~0_7} OutVars{main_~i~0=v_main_~i~0_7} AuxVars[] AssignedVars[] {129#true} is VALID [2022-04-15 00:40:28,932 INFO L290 TraceCheckUtils]: 7: Hoare triple {129#true} [77] L29-->L33-2: Formula: (and (= v_main_~j~0_7 v_main_~y~0_4) (= v_main_~i~0_8 v_main_~x~0_3) (= v_main_~z~0_4 0) (<= 0 v_main_~j~0_7)) InVars {main_~i~0=v_main_~i~0_8, main_~j~0=v_main_~j~0_7} OutVars{main_~i~0=v_main_~i~0_8, main_~y~0=v_main_~y~0_4, main_~x~0=v_main_~x~0_3, main_~z~0=v_main_~z~0_4, main_~j~0=v_main_~j~0_7} AuxVars[] AssignedVars[main_~x~0, main_~z~0, main_~y~0] {134#(and (or (= main_~i~0 0) (= main_~i~0 main_~x~0)) (or (and (= main_~z~0 0) (or (<= main_~y~0 main_~j~0) (<= (+ main_~z~0 main_~y~0) 0)) (< 0 (+ main_~z~0 main_~y~0 1))) (not (= main_~i~0 0))))} is VALID [2022-04-15 00:40:28,933 INFO L290 TraceCheckUtils]: 8: Hoare triple {134#(and (or (= main_~i~0 0) (= main_~i~0 main_~x~0)) (or (and (= main_~z~0 0) (or (<= main_~y~0 main_~j~0) (<= (+ main_~z~0 main_~y~0) 0)) (< 0 (+ main_~z~0 main_~y~0 1))) (not (= main_~i~0 0))))} [79] L33-2-->L33-3: Formula: (= v_main_~x~0_4 0) InVars {main_~x~0=v_main_~x~0_4} OutVars{main_~x~0=v_main_~x~0_4} AuxVars[] AssignedVars[] {135#(and (= main_~z~0 0) (or (<= main_~y~0 main_~j~0) (<= (+ main_~z~0 main_~y~0) 0)) (= main_~i~0 0) (< 0 (+ main_~z~0 main_~y~0 1)))} is VALID [2022-04-15 00:40:28,934 INFO L290 TraceCheckUtils]: 9: Hoare triple {135#(and (= main_~z~0 0) (or (<= main_~y~0 main_~j~0) (<= (+ main_~z~0 main_~y~0) 0)) (= main_~i~0 0) (< 0 (+ main_~z~0 main_~y~0 1)))} [81] L33-3-->L39: Formula: (= v_main_~i~0_1 v_main_~j~0_1) InVars {main_~i~0=v_main_~i~0_1, main_~j~0=v_main_~j~0_1} OutVars{main_~i~0=v_main_~i~0_1, main_~j~0=v_main_~j~0_1} AuxVars[] AssignedVars[] {136#(and (= main_~z~0 0) (<= main_~y~0 0) (< 0 (+ main_~z~0 main_~y~0 1)))} is VALID [2022-04-15 00:40:28,935 INFO L272 TraceCheckUtils]: 10: Hoare triple {136#(and (= main_~z~0 0) (<= main_~y~0 0) (< 0 (+ main_~z~0 main_~y~0 1)))} [83] L39-->__VERIFIER_assertENTRY: Formula: (= (ite (= (- v_main_~z~0_5) v_main_~y~0_5) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~y~0=v_main_~y~0_5, main_~z~0=v_main_~z~0_5} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~z~0, main_~y~0] {137#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 00:40:28,936 INFO L290 TraceCheckUtils]: 11: Hoare triple {137#(not (= |__VERIFIER_assert_#in~cond| 0))} [85] __VERIFIER_assertENTRY-->L18: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {138#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-15 00:40:28,937 INFO L290 TraceCheckUtils]: 12: Hoare triple {138#(not (= __VERIFIER_assert_~cond 0))} [86] L18-->L19: Formula: (= v___VERIFIER_assert_~cond_2 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {130#false} is VALID [2022-04-15 00:40:28,937 INFO L290 TraceCheckUtils]: 13: Hoare triple {130#false} [88] L19-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {130#false} is VALID [2022-04-15 00:40:28,937 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:28,937 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 00:40:28,938 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [906533172] [2022-04-15 00:40:28,938 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [906533172] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 00:40:28,938 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 00:40:28,938 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-15 00:40:28,938 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1119927032] [2022-04-15 00:40:28,938 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 00:40:28,939 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 1.4285714285714286) internal successors, (10), 6 states have internal predecessors, (10), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 14 [2022-04-15 00:40:28,939 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 00:40:28,940 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 8 states, 7 states have (on average 1.4285714285714286) internal successors, (10), 6 states have internal predecessors, (10), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 00:40:29,042 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:29,042 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-15 00:40:29,043 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-15 00:40:29,043 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-15 00:40:29,044 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-04-15 00:40:29,044 INFO L87 Difference]: Start difference. First operand 15 states and 15 transitions. Second operand has 8 states, 7 states have (on average 1.4285714285714286) internal successors, (10), 6 states have internal predecessors, (10), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 00:40:29,263 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 00:40:29,264 INFO L93 Difference]: Finished difference Result 22 states and 22 transitions. [2022-04-15 00:40:29,264 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-15 00:40:29,264 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 1.4285714285714286) internal successors, (10), 6 states have internal predecessors, (10), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 14 [2022-04-15 00:40:29,264 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 00:40:29,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 7 states have (on average 1.4285714285714286) internal successors, (10), 6 states have internal predecessors, (10), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 00:40:29,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 22 transitions. [2022-04-15 00:40:29,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 7 states have (on average 1.4285714285714286) internal successors, (10), 6 states have internal predecessors, (10), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 00:40:29,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 22 transitions. [2022-04-15 00:40:29,269 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 22 transitions. [2022-04-15 00:40:29,287 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 22 edges. 22 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 00:40:29,289 INFO L225 Difference]: With dead ends: 22 [2022-04-15 00:40:29,289 INFO L226 Difference]: Without dead ends: 16 [2022-04-15 00:40:29,291 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=114, Unknown=0, NotChecked=0, Total=156 [2022-04-15 00:40:29,293 INFO L913 BasicCegarLoop]: 11 mSDtfsCounter, 15 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 38 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-15 00:40:29,294 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [15 Valid, 38 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-15 00:40:29,295 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2022-04-15 00:40:29,300 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2022-04-15 00:40:29,300 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 00:40:29,300 INFO L82 GeneralOperation]: Start isEquivalent. First operand 16 states. Second operand has 16 states, 11 states have (on average 1.0909090909090908) internal successors, (12), 11 states have internal predecessors, (12), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 00:40:29,301 INFO L74 IsIncluded]: Start isIncluded. First operand 16 states. Second operand has 16 states, 11 states have (on average 1.0909090909090908) internal successors, (12), 11 states have internal predecessors, (12), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 00:40:29,302 INFO L87 Difference]: Start difference. First operand 16 states. Second operand has 16 states, 11 states have (on average 1.0909090909090908) internal successors, (12), 11 states have internal predecessors, (12), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 00:40:29,303 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 00:40:29,303 INFO L93 Difference]: Finished difference Result 16 states and 16 transitions. [2022-04-15 00:40:29,303 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 16 transitions. [2022-04-15 00:40:29,303 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 00:40:29,303 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 00:40:29,304 INFO L74 IsIncluded]: Start isIncluded. First operand has 16 states, 11 states have (on average 1.0909090909090908) internal successors, (12), 11 states have internal predecessors, (12), 3 states have call successors, (3), 3 states have call predecessors, (3), 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:29,304 INFO L87 Difference]: Start difference. First operand has 16 states, 11 states have (on average 1.0909090909090908) internal successors, (12), 11 states have internal predecessors, (12), 3 states have call successors, (3), 3 states have call predecessors, (3), 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:29,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 00:40:29,304 INFO L93 Difference]: Finished difference Result 16 states and 16 transitions. [2022-04-15 00:40:29,305 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 16 transitions. [2022-04-15 00:40:29,305 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 00:40:29,305 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 00:40:29,305 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 00:40:29,305 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 00:40:29,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 11 states have (on average 1.0909090909090908) internal successors, (12), 11 states have internal predecessors, (12), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 00:40:29,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 16 transitions. [2022-04-15 00:40:29,307 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 16 transitions. Word has length 14 [2022-04-15 00:40:29,307 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 00:40:29,307 INFO L478 AbstractCegarLoop]: Abstraction has 16 states and 16 transitions. [2022-04-15 00:40:29,307 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 1.4285714285714286) internal successors, (10), 6 states have internal predecessors, (10), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 00:40:29,308 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 16 transitions. [2022-04-15 00:40:29,308 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-04-15 00:40:29,308 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 00:40:29,308 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 00:40:29,309 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-15 00:40:29,309 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 00:40:29,310 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 00:40:29,310 INFO L85 PathProgramCache]: Analyzing trace with hash -1832655910, now seen corresponding path program 1 times [2022-04-15 00:40:29,341 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 00:40:29,341 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [338041945] [2022-04-15 00:40:29,341 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 00:40:29,341 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 00:40:29,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 00:40:29,501 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 00:40:29,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 00:40:29,506 INFO L290 TraceCheckUtils]: 0: Hoare triple {251#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [69] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= (select |v_#length_1| 2) 9) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {240#true} is VALID [2022-04-15 00:40:29,506 INFO L290 TraceCheckUtils]: 1: Hoare triple {240#true} [72] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {240#true} is VALID [2022-04-15 00:40:29,506 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {240#true} {240#true} [91] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {240#true} is VALID [2022-04-15 00:40:29,507 INFO L272 TraceCheckUtils]: 0: Hoare triple {240#true} [67] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {251#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 00:40:29,507 INFO L290 TraceCheckUtils]: 1: Hoare triple {251#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [69] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= (select |v_#length_1| 2) 9) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {240#true} is VALID [2022-04-15 00:40:29,507 INFO L290 TraceCheckUtils]: 2: Hoare triple {240#true} [72] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {240#true} is VALID [2022-04-15 00:40:29,507 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {240#true} {240#true} [91] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {240#true} is VALID [2022-04-15 00:40:29,508 INFO L272 TraceCheckUtils]: 4: Hoare triple {240#true} [68] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {240#true} is VALID [2022-04-15 00:40:29,508 INFO L290 TraceCheckUtils]: 5: Hoare triple {240#true} [71] mainENTRY-->L28: Formula: (and (<= |v_main_#t~nondet1_2| 2147483647) (= v_main_~j~0_3 |v_main_#t~nondet2_2|) (<= 0 (+ |v_main_#t~nondet2_2| 2147483648)) (<= |v_main_#t~nondet2_2| 2147483647) (<= 0 (+ |v_main_#t~nondet1_2| 2147483648)) (= v_main_~i~0_3 |v_main_#t~nondet1_2|)) InVars {main_#t~nondet1=|v_main_#t~nondet1_2|, main_#t~nondet2=|v_main_#t~nondet2_2|} OutVars{main_~i~0=v_main_~i~0_3, main_~j~0=v_main_~j~0_3} AuxVars[] AssignedVars[main_#t~nondet1, main_~j~0, main_#t~nondet2, main_~i~0] {240#true} is VALID [2022-04-15 00:40:29,508 INFO L290 TraceCheckUtils]: 6: Hoare triple {240#true} [74] L28-->L29: Formula: (and (<= v_main_~i~0_7 1000000) (<= 0 v_main_~i~0_7)) InVars {main_~i~0=v_main_~i~0_7} OutVars{main_~i~0=v_main_~i~0_7} AuxVars[] AssignedVars[] {240#true} is VALID [2022-04-15 00:40:29,508 INFO L290 TraceCheckUtils]: 7: Hoare triple {240#true} [77] L29-->L33-2: Formula: (and (= v_main_~j~0_7 v_main_~y~0_4) (= v_main_~i~0_8 v_main_~x~0_3) (= v_main_~z~0_4 0) (<= 0 v_main_~j~0_7)) InVars {main_~i~0=v_main_~i~0_8, main_~j~0=v_main_~j~0_7} OutVars{main_~i~0=v_main_~i~0_8, main_~y~0=v_main_~y~0_4, main_~x~0=v_main_~x~0_3, main_~z~0=v_main_~z~0_4, main_~j~0=v_main_~j~0_7} AuxVars[] AssignedVars[main_~x~0, main_~z~0, main_~y~0] {245#(and (= main_~z~0 0) (<= main_~j~0 main_~y~0) (<= main_~y~0 main_~j~0) (= main_~i~0 main_~x~0))} is VALID [2022-04-15 00:40:29,509 INFO L290 TraceCheckUtils]: 8: Hoare triple {245#(and (= main_~z~0 0) (<= main_~j~0 main_~y~0) (<= main_~y~0 main_~j~0) (= main_~i~0 main_~x~0))} [80] L33-2-->L33-2: Formula: (and (= v_main_~z~0_1 (+ v_main_~z~0_2 1)) (= (+ v_main_~x~0_1 1) v_main_~x~0_2) (not (= v_main_~x~0_2 0)) (= (+ (- 2) v_main_~y~0_2) v_main_~y~0_1)) InVars {main_~y~0=v_main_~y~0_2, main_~x~0=v_main_~x~0_2, main_~z~0=v_main_~z~0_2} OutVars{main_#t~post4=|v_main_#t~post4_1|, main_~y~0=v_main_~y~0_1, main_#t~post3=|v_main_#t~post3_1|, main_~x~0=v_main_~x~0_1, main_~z~0=v_main_~z~0_1} AuxVars[] AssignedVars[main_~x~0, main_~z~0, main_#t~post4, main_~y~0, main_#t~post3] {246#(and (or (<= (+ main_~z~0 main_~y~0) 0) (<= (+ main_~z~0 main_~y~0 1) main_~j~0)) (= (+ (- 1) main_~i~0 (* (- 1) main_~x~0)) 0) (or (<= main_~j~0 (+ main_~z~0 main_~y~0 1)) (not (<= (+ main_~z~0 main_~y~0 1) 0))))} is VALID [2022-04-15 00:40:29,510 INFO L290 TraceCheckUtils]: 9: Hoare triple {246#(and (or (<= (+ main_~z~0 main_~y~0) 0) (<= (+ main_~z~0 main_~y~0 1) main_~j~0)) (= (+ (- 1) main_~i~0 (* (- 1) main_~x~0)) 0) (or (<= main_~j~0 (+ main_~z~0 main_~y~0 1)) (not (<= (+ main_~z~0 main_~y~0 1) 0))))} [79] L33-2-->L33-3: Formula: (= v_main_~x~0_4 0) InVars {main_~x~0=v_main_~x~0_4} OutVars{main_~x~0=v_main_~x~0_4} AuxVars[] AssignedVars[] {247#(and (or (<= main_~j~0 (+ main_~i~0 main_~z~0 main_~y~0)) (not (<= (+ main_~z~0 main_~y~0 1) 0))) (or (<= (+ main_~z~0 main_~y~0) 0) (<= (+ main_~i~0 main_~z~0 main_~y~0) main_~j~0)))} is VALID [2022-04-15 00:40:29,510 INFO L290 TraceCheckUtils]: 10: Hoare triple {247#(and (or (<= main_~j~0 (+ main_~i~0 main_~z~0 main_~y~0)) (not (<= (+ main_~z~0 main_~y~0 1) 0))) (or (<= (+ main_~z~0 main_~y~0) 0) (<= (+ main_~i~0 main_~z~0 main_~y~0) main_~j~0)))} [81] L33-3-->L39: Formula: (= v_main_~i~0_1 v_main_~j~0_1) InVars {main_~i~0=v_main_~i~0_1, main_~j~0=v_main_~j~0_1} OutVars{main_~i~0=v_main_~i~0_1, main_~j~0=v_main_~j~0_1} AuxVars[] AssignedVars[] {248#(and (<= (+ main_~z~0 main_~y~0) 0) (< 0 (+ main_~z~0 main_~y~0 1)))} is VALID [2022-04-15 00:40:29,511 INFO L272 TraceCheckUtils]: 11: Hoare triple {248#(and (<= (+ main_~z~0 main_~y~0) 0) (< 0 (+ main_~z~0 main_~y~0 1)))} [83] L39-->__VERIFIER_assertENTRY: Formula: (= (ite (= (- v_main_~z~0_5) v_main_~y~0_5) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~y~0=v_main_~y~0_5, main_~z~0=v_main_~z~0_5} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~z~0, main_~y~0] {249#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 00:40:29,512 INFO L290 TraceCheckUtils]: 12: Hoare triple {249#(not (= |__VERIFIER_assert_#in~cond| 0))} [85] __VERIFIER_assertENTRY-->L18: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {250#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-15 00:40:29,512 INFO L290 TraceCheckUtils]: 13: Hoare triple {250#(not (= __VERIFIER_assert_~cond 0))} [86] L18-->L19: Formula: (= v___VERIFIER_assert_~cond_2 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {241#false} is VALID [2022-04-15 00:40:29,512 INFO L290 TraceCheckUtils]: 14: Hoare triple {241#false} [88] L19-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {241#false} is VALID [2022-04-15 00:40:29,512 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 00:40:29,512 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 00:40:29,513 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [338041945] [2022-04-15 00:40:29,513 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [338041945] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 00:40:29,513 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [736636404] [2022-04-15 00:40:29,513 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 00:40:29,513 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 00:40:29,513 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 00:40:29,531 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:29,536 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:29,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 00:40:29,572 INFO L263 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 19 conjunts are in the unsatisfiable core [2022-04-15 00:40:29,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 00:40:29,580 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 00:40:29,898 INFO L272 TraceCheckUtils]: 0: Hoare triple {240#true} [67] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {240#true} is VALID [2022-04-15 00:40:29,898 INFO L290 TraceCheckUtils]: 1: Hoare triple {240#true} [69] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= (select |v_#length_1| 2) 9) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {240#true} is VALID [2022-04-15 00:40:29,898 INFO L290 TraceCheckUtils]: 2: Hoare triple {240#true} [72] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {240#true} is VALID [2022-04-15 00:40:29,900 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {240#true} {240#true} [91] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {240#true} is VALID [2022-04-15 00:40:29,900 INFO L272 TraceCheckUtils]: 4: Hoare triple {240#true} [68] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {240#true} is VALID [2022-04-15 00:40:29,900 INFO L290 TraceCheckUtils]: 5: Hoare triple {240#true} [71] mainENTRY-->L28: Formula: (and (<= |v_main_#t~nondet1_2| 2147483647) (= v_main_~j~0_3 |v_main_#t~nondet2_2|) (<= 0 (+ |v_main_#t~nondet2_2| 2147483648)) (<= |v_main_#t~nondet2_2| 2147483647) (<= 0 (+ |v_main_#t~nondet1_2| 2147483648)) (= v_main_~i~0_3 |v_main_#t~nondet1_2|)) InVars {main_#t~nondet1=|v_main_#t~nondet1_2|, main_#t~nondet2=|v_main_#t~nondet2_2|} OutVars{main_~i~0=v_main_~i~0_3, main_~j~0=v_main_~j~0_3} AuxVars[] AssignedVars[main_#t~nondet1, main_~j~0, main_#t~nondet2, main_~i~0] {240#true} is VALID [2022-04-15 00:40:29,901 INFO L290 TraceCheckUtils]: 6: Hoare triple {240#true} [74] L28-->L29: Formula: (and (<= v_main_~i~0_7 1000000) (<= 0 v_main_~i~0_7)) InVars {main_~i~0=v_main_~i~0_7} OutVars{main_~i~0=v_main_~i~0_7} AuxVars[] AssignedVars[] {240#true} is VALID [2022-04-15 00:40:29,901 INFO L290 TraceCheckUtils]: 7: Hoare triple {240#true} [77] L29-->L33-2: Formula: (and (= v_main_~j~0_7 v_main_~y~0_4) (= v_main_~i~0_8 v_main_~x~0_3) (= v_main_~z~0_4 0) (<= 0 v_main_~j~0_7)) InVars {main_~i~0=v_main_~i~0_8, main_~j~0=v_main_~j~0_7} OutVars{main_~i~0=v_main_~i~0_8, main_~y~0=v_main_~y~0_4, main_~x~0=v_main_~x~0_3, main_~z~0=v_main_~z~0_4, main_~j~0=v_main_~j~0_7} AuxVars[] AssignedVars[main_~x~0, main_~z~0, main_~y~0] {245#(and (= main_~z~0 0) (<= main_~j~0 main_~y~0) (<= main_~y~0 main_~j~0) (= main_~i~0 main_~x~0))} is VALID [2022-04-15 00:40:29,902 INFO L290 TraceCheckUtils]: 8: Hoare triple {245#(and (= main_~z~0 0) (<= main_~j~0 main_~y~0) (<= main_~y~0 main_~j~0) (= main_~i~0 main_~x~0))} [80] L33-2-->L33-2: Formula: (and (= v_main_~z~0_1 (+ v_main_~z~0_2 1)) (= (+ v_main_~x~0_1 1) v_main_~x~0_2) (not (= v_main_~x~0_2 0)) (= (+ (- 2) v_main_~y~0_2) v_main_~y~0_1)) InVars {main_~y~0=v_main_~y~0_2, main_~x~0=v_main_~x~0_2, main_~z~0=v_main_~z~0_2} OutVars{main_#t~post4=|v_main_#t~post4_1|, main_~y~0=v_main_~y~0_1, main_#t~post3=|v_main_#t~post3_1|, main_~x~0=v_main_~x~0_1, main_~z~0=v_main_~z~0_1} AuxVars[] AssignedVars[main_~x~0, main_~z~0, main_#t~post4, main_~y~0, main_#t~post3] {279#(and (= (+ main_~x~0 1) main_~i~0) (<= main_~j~0 (+ main_~y~0 2)) (= (+ (- 1) main_~z~0) 0) (<= (+ main_~y~0 2) main_~j~0))} is VALID [2022-04-15 00:40:29,902 INFO L290 TraceCheckUtils]: 9: Hoare triple {279#(and (= (+ main_~x~0 1) main_~i~0) (<= main_~j~0 (+ main_~y~0 2)) (= (+ (- 1) main_~z~0) 0) (<= (+ main_~y~0 2) main_~j~0))} [79] L33-2-->L33-3: Formula: (= v_main_~x~0_4 0) InVars {main_~x~0=v_main_~x~0_4} OutVars{main_~x~0=v_main_~x~0_4} AuxVars[] AssignedVars[] {283#(and (<= main_~j~0 (+ main_~y~0 2)) (= main_~i~0 1) (= (+ (- 1) main_~z~0) 0) (<= (+ main_~y~0 2) main_~j~0))} is VALID [2022-04-15 00:40:29,903 INFO L290 TraceCheckUtils]: 10: Hoare triple {283#(and (<= main_~j~0 (+ main_~y~0 2)) (= main_~i~0 1) (= (+ (- 1) main_~z~0) 0) (<= (+ main_~y~0 2) main_~j~0))} [81] L33-3-->L39: Formula: (= v_main_~i~0_1 v_main_~j~0_1) InVars {main_~i~0=v_main_~i~0_1, main_~j~0=v_main_~j~0_1} OutVars{main_~i~0=v_main_~i~0_1, main_~j~0=v_main_~j~0_1} AuxVars[] AssignedVars[] {287#(and (= (+ (- 1) main_~z~0) 0) (<= (+ main_~y~0 1) 0) (<= 0 (+ main_~y~0 1)))} is VALID [2022-04-15 00:40:29,904 INFO L272 TraceCheckUtils]: 11: Hoare triple {287#(and (= (+ (- 1) main_~z~0) 0) (<= (+ main_~y~0 1) 0) (<= 0 (+ main_~y~0 1)))} [83] L39-->__VERIFIER_assertENTRY: Formula: (= (ite (= (- v_main_~z~0_5) v_main_~y~0_5) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~y~0=v_main_~y~0_5, main_~z~0=v_main_~z~0_5} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~z~0, main_~y~0] {291#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 00:40:29,904 INFO L290 TraceCheckUtils]: 12: Hoare triple {291#(<= 1 |__VERIFIER_assert_#in~cond|)} [85] __VERIFIER_assertENTRY-->L18: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {295#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 00:40:29,905 INFO L290 TraceCheckUtils]: 13: Hoare triple {295#(<= 1 __VERIFIER_assert_~cond)} [86] L18-->L19: Formula: (= v___VERIFIER_assert_~cond_2 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {241#false} is VALID [2022-04-15 00:40:29,905 INFO L290 TraceCheckUtils]: 14: Hoare triple {241#false} [88] L19-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {241#false} is VALID [2022-04-15 00:40:29,905 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 00:40:29,905 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 00:40:30,076 INFO L290 TraceCheckUtils]: 14: Hoare triple {241#false} [88] L19-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {241#false} is VALID [2022-04-15 00:40:30,077 INFO L290 TraceCheckUtils]: 13: Hoare triple {295#(<= 1 __VERIFIER_assert_~cond)} [86] L18-->L19: Formula: (= v___VERIFIER_assert_~cond_2 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {241#false} is VALID [2022-04-15 00:40:30,077 INFO L290 TraceCheckUtils]: 12: Hoare triple {291#(<= 1 |__VERIFIER_assert_#in~cond|)} [85] __VERIFIER_assertENTRY-->L18: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {295#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 00:40:30,078 INFO L272 TraceCheckUtils]: 11: Hoare triple {248#(and (<= (+ main_~z~0 main_~y~0) 0) (< 0 (+ main_~z~0 main_~y~0 1)))} [83] L39-->__VERIFIER_assertENTRY: Formula: (= (ite (= (- v_main_~z~0_5) v_main_~y~0_5) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~y~0=v_main_~y~0_5, main_~z~0=v_main_~z~0_5} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~z~0, main_~y~0] {291#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 00:40:30,079 INFO L290 TraceCheckUtils]: 10: Hoare triple {314#(or (not (= main_~i~0 main_~j~0)) (and (<= (+ main_~z~0 main_~y~0) 0) (< 0 (+ main_~z~0 main_~y~0 1))))} [81] L33-3-->L39: Formula: (= v_main_~i~0_1 v_main_~j~0_1) InVars {main_~i~0=v_main_~i~0_1, main_~j~0=v_main_~j~0_1} OutVars{main_~i~0=v_main_~i~0_1, main_~j~0=v_main_~j~0_1} AuxVars[] AssignedVars[] {248#(and (<= (+ main_~z~0 main_~y~0) 0) (< 0 (+ main_~z~0 main_~y~0 1)))} is VALID [2022-04-15 00:40:30,079 INFO L290 TraceCheckUtils]: 9: Hoare triple {318#(or (not (= main_~i~0 main_~j~0)) (and (<= (+ main_~z~0 main_~y~0) 0) (< 0 (+ main_~z~0 main_~y~0 1))) (not (= main_~x~0 0)))} [79] L33-2-->L33-3: Formula: (= v_main_~x~0_4 0) InVars {main_~x~0=v_main_~x~0_4} OutVars{main_~x~0=v_main_~x~0_4} AuxVars[] AssignedVars[] {314#(or (not (= main_~i~0 main_~j~0)) (and (<= (+ main_~z~0 main_~y~0) 0) (< 0 (+ main_~z~0 main_~y~0 1))))} is VALID [2022-04-15 00:40:30,080 INFO L290 TraceCheckUtils]: 8: Hoare triple {322#(or (not (= main_~i~0 main_~j~0)) (and (< 0 (+ main_~z~0 main_~y~0)) (<= (+ main_~z~0 main_~y~0) 1)) (not (= (+ (- 1) main_~x~0) 0)))} [80] L33-2-->L33-2: Formula: (and (= v_main_~z~0_1 (+ v_main_~z~0_2 1)) (= (+ v_main_~x~0_1 1) v_main_~x~0_2) (not (= v_main_~x~0_2 0)) (= (+ (- 2) v_main_~y~0_2) v_main_~y~0_1)) InVars {main_~y~0=v_main_~y~0_2, main_~x~0=v_main_~x~0_2, main_~z~0=v_main_~z~0_2} OutVars{main_#t~post4=|v_main_#t~post4_1|, main_~y~0=v_main_~y~0_1, main_#t~post3=|v_main_#t~post3_1|, main_~x~0=v_main_~x~0_1, main_~z~0=v_main_~z~0_1} AuxVars[] AssignedVars[main_~x~0, main_~z~0, main_#t~post4, main_~y~0, main_#t~post3] {318#(or (not (= main_~i~0 main_~j~0)) (and (<= (+ main_~z~0 main_~y~0) 0) (< 0 (+ main_~z~0 main_~y~0 1))) (not (= main_~x~0 0)))} is VALID [2022-04-15 00:40:30,081 INFO L290 TraceCheckUtils]: 7: Hoare triple {240#true} [77] L29-->L33-2: Formula: (and (= v_main_~j~0_7 v_main_~y~0_4) (= v_main_~i~0_8 v_main_~x~0_3) (= v_main_~z~0_4 0) (<= 0 v_main_~j~0_7)) InVars {main_~i~0=v_main_~i~0_8, main_~j~0=v_main_~j~0_7} OutVars{main_~i~0=v_main_~i~0_8, main_~y~0=v_main_~y~0_4, main_~x~0=v_main_~x~0_3, main_~z~0=v_main_~z~0_4, main_~j~0=v_main_~j~0_7} AuxVars[] AssignedVars[main_~x~0, main_~z~0, main_~y~0] {322#(or (not (= main_~i~0 main_~j~0)) (and (< 0 (+ main_~z~0 main_~y~0)) (<= (+ main_~z~0 main_~y~0) 1)) (not (= (+ (- 1) main_~x~0) 0)))} is VALID [2022-04-15 00:40:30,081 INFO L290 TraceCheckUtils]: 6: Hoare triple {240#true} [74] L28-->L29: Formula: (and (<= v_main_~i~0_7 1000000) (<= 0 v_main_~i~0_7)) InVars {main_~i~0=v_main_~i~0_7} OutVars{main_~i~0=v_main_~i~0_7} AuxVars[] AssignedVars[] {240#true} is VALID [2022-04-15 00:40:30,081 INFO L290 TraceCheckUtils]: 5: Hoare triple {240#true} [71] mainENTRY-->L28: Formula: (and (<= |v_main_#t~nondet1_2| 2147483647) (= v_main_~j~0_3 |v_main_#t~nondet2_2|) (<= 0 (+ |v_main_#t~nondet2_2| 2147483648)) (<= |v_main_#t~nondet2_2| 2147483647) (<= 0 (+ |v_main_#t~nondet1_2| 2147483648)) (= v_main_~i~0_3 |v_main_#t~nondet1_2|)) InVars {main_#t~nondet1=|v_main_#t~nondet1_2|, main_#t~nondet2=|v_main_#t~nondet2_2|} OutVars{main_~i~0=v_main_~i~0_3, main_~j~0=v_main_~j~0_3} AuxVars[] AssignedVars[main_#t~nondet1, main_~j~0, main_#t~nondet2, main_~i~0] {240#true} is VALID [2022-04-15 00:40:30,081 INFO L272 TraceCheckUtils]: 4: Hoare triple {240#true} [68] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {240#true} is VALID [2022-04-15 00:40:30,081 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {240#true} {240#true} [91] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {240#true} is VALID [2022-04-15 00:40:30,081 INFO L290 TraceCheckUtils]: 2: Hoare triple {240#true} [72] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {240#true} is VALID [2022-04-15 00:40:30,082 INFO L290 TraceCheckUtils]: 1: Hoare triple {240#true} [69] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= (select |v_#length_1| 2) 9) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {240#true} is VALID [2022-04-15 00:40:30,082 INFO L272 TraceCheckUtils]: 0: Hoare triple {240#true} [67] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {240#true} is VALID [2022-04-15 00:40:30,082 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 00:40:30,082 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [736636404] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 00:40:30,082 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 00:40:30,082 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 17 [2022-04-15 00:40:30,084 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2085946099] [2022-04-15 00:40:30,084 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-15 00:40:30,085 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 15 states have (on average 1.4) internal successors, (21), 14 states have internal predecessors, (21), 3 states have call successors, (6), 4 states have call predecessors, (6), 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:30,085 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 00:40:30,085 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 17 states, 15 states have (on average 1.4) internal successors, (21), 14 states have internal predecessors, (21), 3 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 00:40:30,103 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 28 edges. 28 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 00:40:30,104 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-04-15 00:40:30,104 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-15 00:40:30,105 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-04-15 00:40:30,106 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=220, Unknown=0, NotChecked=0, Total=272 [2022-04-15 00:40:30,107 INFO L87 Difference]: Start difference. First operand 16 states and 16 transitions. Second operand has 17 states, 15 states have (on average 1.4) internal successors, (21), 14 states have internal predecessors, (21), 3 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 00:40:30,539 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 00:40:30,540 INFO L93 Difference]: Finished difference Result 27 states and 29 transitions. [2022-04-15 00:40:30,540 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-04-15 00:40:30,540 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 15 states have (on average 1.4) internal successors, (21), 14 states have internal predecessors, (21), 3 states have call successors, (6), 4 states have call predecessors, (6), 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:30,540 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 00:40:30,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 15 states have (on average 1.4) internal successors, (21), 14 states have internal predecessors, (21), 3 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 00:40:30,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 29 transitions. [2022-04-15 00:40:30,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 15 states have (on average 1.4) internal successors, (21), 14 states have internal predecessors, (21), 3 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 00:40:30,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 29 transitions. [2022-04-15 00:40:30,543 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 14 states and 29 transitions. [2022-04-15 00:40:30,567 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 29 edges. 29 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 00:40:30,567 INFO L225 Difference]: With dead ends: 27 [2022-04-15 00:40:30,567 INFO L226 Difference]: Without dead ends: 19 [2022-04-15 00:40:30,568 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 21 SyntacticMatches, 3 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 154 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=154, Invalid=602, Unknown=0, NotChecked=0, Total=756 [2022-04-15 00:40:30,569 INFO L913 BasicCegarLoop]: 11 mSDtfsCounter, 29 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 115 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 63 SdHoareTripleChecker+Invalid, 129 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 115 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-15 00:40:30,569 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [29 Valid, 63 Invalid, 129 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 115 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-15 00:40:30,569 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2022-04-15 00:40:30,578 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2022-04-15 00:40:30,578 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 00:40:30,578 INFO L82 GeneralOperation]: Start isEquivalent. First operand 19 states. Second operand has 19 states, 14 states have (on average 1.0714285714285714) internal successors, (15), 14 states have internal predecessors, (15), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 00:40:30,579 INFO L74 IsIncluded]: Start isIncluded. First operand 19 states. Second operand has 19 states, 14 states have (on average 1.0714285714285714) internal successors, (15), 14 states have internal predecessors, (15), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 00:40:30,579 INFO L87 Difference]: Start difference. First operand 19 states. Second operand has 19 states, 14 states have (on average 1.0714285714285714) internal successors, (15), 14 states have internal predecessors, (15), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 00:40:30,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 00:40:30,580 INFO L93 Difference]: Finished difference Result 19 states and 19 transitions. [2022-04-15 00:40:30,580 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 19 transitions. [2022-04-15 00:40:30,580 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 00:40:30,580 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 00:40:30,580 INFO L74 IsIncluded]: Start isIncluded. First operand has 19 states, 14 states have (on average 1.0714285714285714) internal successors, (15), 14 states have internal predecessors, (15), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 19 states. [2022-04-15 00:40:30,580 INFO L87 Difference]: Start difference. First operand has 19 states, 14 states have (on average 1.0714285714285714) internal successors, (15), 14 states have internal predecessors, (15), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 19 states. [2022-04-15 00:40:30,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 00:40:30,581 INFO L93 Difference]: Finished difference Result 19 states and 19 transitions. [2022-04-15 00:40:30,581 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 19 transitions. [2022-04-15 00:40:30,581 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 00:40:30,581 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 00:40:30,581 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 00:40:30,582 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 00:40:30,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 14 states have (on average 1.0714285714285714) internal successors, (15), 14 states have internal predecessors, (15), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 00:40:30,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 19 transitions. [2022-04-15 00:40:30,582 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 19 transitions. Word has length 15 [2022-04-15 00:40:30,582 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 00:40:30,583 INFO L478 AbstractCegarLoop]: Abstraction has 19 states and 19 transitions. [2022-04-15 00:40:30,583 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 15 states have (on average 1.4) internal successors, (21), 14 states have internal predecessors, (21), 3 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 00:40:30,583 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 19 transitions. [2022-04-15 00:40:30,583 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-04-15 00:40:30,583 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 00:40:30,583 INFO L499 BasicCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 00:40:30,600 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:30,799 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 00:40:30,800 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 00:40:30,800 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 00:40:30,800 INFO L85 PathProgramCache]: Analyzing trace with hash -1122213630, now seen corresponding path program 2 times [2022-04-15 00:40:30,800 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 00:40:30,800 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1140316550] [2022-04-15 00:40:30,801 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 00:40:30,801 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 00:40:30,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 00:40:30,991 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 00:40:30,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 00:40:31,005 INFO L290 TraceCheckUtils]: 0: Hoare triple {493#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [69] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= (select |v_#length_1| 2) 9) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {480#true} is VALID [2022-04-15 00:40:31,005 INFO L290 TraceCheckUtils]: 1: Hoare triple {480#true} [72] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {480#true} is VALID [2022-04-15 00:40:31,005 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {480#true} {480#true} [91] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {480#true} is VALID [2022-04-15 00:40:31,006 INFO L272 TraceCheckUtils]: 0: Hoare triple {480#true} [67] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {493#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 00:40:31,007 INFO L290 TraceCheckUtils]: 1: Hoare triple {493#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [69] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= (select |v_#length_1| 2) 9) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {480#true} is VALID [2022-04-15 00:40:31,007 INFO L290 TraceCheckUtils]: 2: Hoare triple {480#true} [72] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {480#true} is VALID [2022-04-15 00:40:31,007 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {480#true} {480#true} [91] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {480#true} is VALID [2022-04-15 00:40:31,007 INFO L272 TraceCheckUtils]: 4: Hoare triple {480#true} [68] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {480#true} is VALID [2022-04-15 00:40:31,007 INFO L290 TraceCheckUtils]: 5: Hoare triple {480#true} [71] mainENTRY-->L28: Formula: (and (<= |v_main_#t~nondet1_2| 2147483647) (= v_main_~j~0_3 |v_main_#t~nondet2_2|) (<= 0 (+ |v_main_#t~nondet2_2| 2147483648)) (<= |v_main_#t~nondet2_2| 2147483647) (<= 0 (+ |v_main_#t~nondet1_2| 2147483648)) (= v_main_~i~0_3 |v_main_#t~nondet1_2|)) InVars {main_#t~nondet1=|v_main_#t~nondet1_2|, main_#t~nondet2=|v_main_#t~nondet2_2|} OutVars{main_~i~0=v_main_~i~0_3, main_~j~0=v_main_~j~0_3} AuxVars[] AssignedVars[main_#t~nondet1, main_~j~0, main_#t~nondet2, main_~i~0] {480#true} is VALID [2022-04-15 00:40:31,007 INFO L290 TraceCheckUtils]: 6: Hoare triple {480#true} [74] L28-->L29: Formula: (and (<= v_main_~i~0_7 1000000) (<= 0 v_main_~i~0_7)) InVars {main_~i~0=v_main_~i~0_7} OutVars{main_~i~0=v_main_~i~0_7} AuxVars[] AssignedVars[] {480#true} is VALID [2022-04-15 00:40:31,008 INFO L290 TraceCheckUtils]: 7: Hoare triple {480#true} [77] L29-->L33-2: Formula: (and (= v_main_~j~0_7 v_main_~y~0_4) (= v_main_~i~0_8 v_main_~x~0_3) (= v_main_~z~0_4 0) (<= 0 v_main_~j~0_7)) InVars {main_~i~0=v_main_~i~0_8, main_~j~0=v_main_~j~0_7} OutVars{main_~i~0=v_main_~i~0_8, main_~y~0=v_main_~y~0_4, main_~x~0=v_main_~x~0_3, main_~z~0=v_main_~z~0_4, main_~j~0=v_main_~j~0_7} AuxVars[] AssignedVars[main_~x~0, main_~z~0, main_~y~0] {485#(and (= main_~z~0 0) (<= main_~j~0 main_~y~0) (<= main_~y~0 main_~j~0) (= main_~i~0 main_~x~0))} is VALID [2022-04-15 00:40:31,008 INFO L290 TraceCheckUtils]: 8: Hoare triple {485#(and (= main_~z~0 0) (<= main_~j~0 main_~y~0) (<= main_~y~0 main_~j~0) (= main_~i~0 main_~x~0))} [80] L33-2-->L33-2: Formula: (and (= v_main_~z~0_1 (+ v_main_~z~0_2 1)) (= (+ v_main_~x~0_1 1) v_main_~x~0_2) (not (= v_main_~x~0_2 0)) (= (+ (- 2) v_main_~y~0_2) v_main_~y~0_1)) InVars {main_~y~0=v_main_~y~0_2, main_~x~0=v_main_~x~0_2, main_~z~0=v_main_~z~0_2} OutVars{main_#t~post4=|v_main_#t~post4_1|, main_~y~0=v_main_~y~0_1, main_#t~post3=|v_main_#t~post3_1|, main_~x~0=v_main_~x~0_1, main_~z~0=v_main_~z~0_1} AuxVars[] AssignedVars[main_~x~0, main_~z~0, main_#t~post4, main_~y~0, main_#t~post3] {486#(and (= (+ (- 1) main_~i~0 (* (- 1) main_~x~0)) 0) (<= main_~j~0 (+ main_~z~0 main_~y~0 1)) (<= (+ main_~z~0 main_~y~0 1) main_~j~0))} is VALID [2022-04-15 00:40:31,009 INFO L290 TraceCheckUtils]: 9: Hoare triple {486#(and (= (+ (- 1) main_~i~0 (* (- 1) main_~x~0)) 0) (<= main_~j~0 (+ main_~z~0 main_~y~0 1)) (<= (+ main_~z~0 main_~y~0 1) main_~j~0))} [80] L33-2-->L33-2: Formula: (and (= v_main_~z~0_1 (+ v_main_~z~0_2 1)) (= (+ v_main_~x~0_1 1) v_main_~x~0_2) (not (= v_main_~x~0_2 0)) (= (+ (- 2) v_main_~y~0_2) v_main_~y~0_1)) InVars {main_~y~0=v_main_~y~0_2, main_~x~0=v_main_~x~0_2, main_~z~0=v_main_~z~0_2} OutVars{main_#t~post4=|v_main_#t~post4_1|, main_~y~0=v_main_~y~0_1, main_#t~post3=|v_main_#t~post3_1|, main_~x~0=v_main_~x~0_1, main_~z~0=v_main_~z~0_1} AuxVars[] AssignedVars[main_~x~0, main_~z~0, main_#t~post4, main_~y~0, main_#t~post3] {487#(and (<= (+ main_~i~0 main_~z~0 main_~y~0) (+ main_~j~0 main_~x~0)) (<= (+ main_~j~0 main_~x~0) (+ main_~i~0 main_~z~0 main_~y~0)))} is VALID [2022-04-15 00:40:31,010 INFO L290 TraceCheckUtils]: 10: Hoare triple {487#(and (<= (+ main_~i~0 main_~z~0 main_~y~0) (+ main_~j~0 main_~x~0)) (<= (+ main_~j~0 main_~x~0) (+ main_~i~0 main_~z~0 main_~y~0)))} [80] L33-2-->L33-2: Formula: (and (= v_main_~z~0_1 (+ v_main_~z~0_2 1)) (= (+ v_main_~x~0_1 1) v_main_~x~0_2) (not (= v_main_~x~0_2 0)) (= (+ (- 2) v_main_~y~0_2) v_main_~y~0_1)) InVars {main_~y~0=v_main_~y~0_2, main_~x~0=v_main_~x~0_2, main_~z~0=v_main_~z~0_2} OutVars{main_#t~post4=|v_main_#t~post4_1|, main_~y~0=v_main_~y~0_1, main_#t~post3=|v_main_#t~post3_1|, main_~x~0=v_main_~x~0_1, main_~z~0=v_main_~z~0_1} AuxVars[] AssignedVars[main_~x~0, main_~z~0, main_#t~post4, main_~y~0, main_#t~post3] {487#(and (<= (+ main_~i~0 main_~z~0 main_~y~0) (+ main_~j~0 main_~x~0)) (<= (+ main_~j~0 main_~x~0) (+ main_~i~0 main_~z~0 main_~y~0)))} is VALID [2022-04-15 00:40:31,011 INFO L290 TraceCheckUtils]: 11: Hoare triple {487#(and (<= (+ main_~i~0 main_~z~0 main_~y~0) (+ main_~j~0 main_~x~0)) (<= (+ main_~j~0 main_~x~0) (+ main_~i~0 main_~z~0 main_~y~0)))} [80] L33-2-->L33-2: Formula: (and (= v_main_~z~0_1 (+ v_main_~z~0_2 1)) (= (+ v_main_~x~0_1 1) v_main_~x~0_2) (not (= v_main_~x~0_2 0)) (= (+ (- 2) v_main_~y~0_2) v_main_~y~0_1)) InVars {main_~y~0=v_main_~y~0_2, main_~x~0=v_main_~x~0_2, main_~z~0=v_main_~z~0_2} OutVars{main_#t~post4=|v_main_#t~post4_1|, main_~y~0=v_main_~y~0_1, main_#t~post3=|v_main_#t~post3_1|, main_~x~0=v_main_~x~0_1, main_~z~0=v_main_~z~0_1} AuxVars[] AssignedVars[main_~x~0, main_~z~0, main_#t~post4, main_~y~0, main_#t~post3] {488#(and (or (<= (+ main_~i~0 main_~z~0 main_~y~0) (+ main_~j~0 main_~x~0)) (<= (+ main_~z~0 main_~y~0) 0)) (or (<= (+ main_~j~0 main_~x~0) (+ main_~i~0 main_~z~0 main_~y~0)) (not (<= (+ main_~z~0 main_~y~0 1) 0))))} is VALID [2022-04-15 00:40:31,011 INFO L290 TraceCheckUtils]: 12: Hoare triple {488#(and (or (<= (+ main_~i~0 main_~z~0 main_~y~0) (+ main_~j~0 main_~x~0)) (<= (+ main_~z~0 main_~y~0) 0)) (or (<= (+ main_~j~0 main_~x~0) (+ main_~i~0 main_~z~0 main_~y~0)) (not (<= (+ main_~z~0 main_~y~0 1) 0))))} [79] L33-2-->L33-3: Formula: (= v_main_~x~0_4 0) InVars {main_~x~0=v_main_~x~0_4} OutVars{main_~x~0=v_main_~x~0_4} AuxVars[] AssignedVars[] {489#(and (or (<= main_~j~0 (+ main_~i~0 main_~z~0 main_~y~0)) (not (<= (+ main_~z~0 main_~y~0 1) 0))) (or (<= (+ main_~z~0 main_~y~0) 0) (<= (+ main_~i~0 main_~z~0 main_~y~0) main_~j~0)))} is VALID [2022-04-15 00:40:31,012 INFO L290 TraceCheckUtils]: 13: Hoare triple {489#(and (or (<= main_~j~0 (+ main_~i~0 main_~z~0 main_~y~0)) (not (<= (+ main_~z~0 main_~y~0 1) 0))) (or (<= (+ main_~z~0 main_~y~0) 0) (<= (+ main_~i~0 main_~z~0 main_~y~0) main_~j~0)))} [81] L33-3-->L39: Formula: (= v_main_~i~0_1 v_main_~j~0_1) InVars {main_~i~0=v_main_~i~0_1, main_~j~0=v_main_~j~0_1} OutVars{main_~i~0=v_main_~i~0_1, main_~j~0=v_main_~j~0_1} AuxVars[] AssignedVars[] {490#(and (<= (+ main_~z~0 main_~y~0) 0) (< 0 (+ main_~z~0 main_~y~0 1)))} is VALID [2022-04-15 00:40:31,013 INFO L272 TraceCheckUtils]: 14: Hoare triple {490#(and (<= (+ main_~z~0 main_~y~0) 0) (< 0 (+ main_~z~0 main_~y~0 1)))} [83] L39-->__VERIFIER_assertENTRY: Formula: (= (ite (= (- v_main_~z~0_5) v_main_~y~0_5) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~y~0=v_main_~y~0_5, main_~z~0=v_main_~z~0_5} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~z~0, main_~y~0] {491#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 00:40:31,013 INFO L290 TraceCheckUtils]: 15: Hoare triple {491#(not (= |__VERIFIER_assert_#in~cond| 0))} [85] __VERIFIER_assertENTRY-->L18: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {492#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-15 00:40:31,013 INFO L290 TraceCheckUtils]: 16: Hoare triple {492#(not (= __VERIFIER_assert_~cond 0))} [86] L18-->L19: Formula: (= v___VERIFIER_assert_~cond_2 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {481#false} is VALID [2022-04-15 00:40:31,015 INFO L290 TraceCheckUtils]: 17: Hoare triple {481#false} [88] L19-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {481#false} is VALID [2022-04-15 00:40:31,015 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-15 00:40:31,015 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 00:40:31,015 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1140316550] [2022-04-15 00:40:31,016 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1140316550] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 00:40:31,016 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [730442991] [2022-04-15 00:40:31,016 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 00:40:31,016 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 00:40:31,016 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 00:40:31,017 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 00:40:31,043 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-04-15 00:40:31,072 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-15 00:40:31,073 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 00:40:31,073 INFO L263 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 37 conjunts are in the unsatisfiable core [2022-04-15 00:40:31,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 00:40:31,080 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 00:40:31,424 INFO L272 TraceCheckUtils]: 0: Hoare triple {480#true} [67] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {480#true} is VALID [2022-04-15 00:40:31,424 INFO L290 TraceCheckUtils]: 1: Hoare triple {480#true} [69] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= (select |v_#length_1| 2) 9) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {480#true} is VALID [2022-04-15 00:40:31,424 INFO L290 TraceCheckUtils]: 2: Hoare triple {480#true} [72] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {480#true} is VALID [2022-04-15 00:40:31,424 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {480#true} {480#true} [91] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {480#true} is VALID [2022-04-15 00:40:31,424 INFO L272 TraceCheckUtils]: 4: Hoare triple {480#true} [68] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {480#true} is VALID [2022-04-15 00:40:31,424 INFO L290 TraceCheckUtils]: 5: Hoare triple {480#true} [71] mainENTRY-->L28: Formula: (and (<= |v_main_#t~nondet1_2| 2147483647) (= v_main_~j~0_3 |v_main_#t~nondet2_2|) (<= 0 (+ |v_main_#t~nondet2_2| 2147483648)) (<= |v_main_#t~nondet2_2| 2147483647) (<= 0 (+ |v_main_#t~nondet1_2| 2147483648)) (= v_main_~i~0_3 |v_main_#t~nondet1_2|)) InVars {main_#t~nondet1=|v_main_#t~nondet1_2|, main_#t~nondet2=|v_main_#t~nondet2_2|} OutVars{main_~i~0=v_main_~i~0_3, main_~j~0=v_main_~j~0_3} AuxVars[] AssignedVars[main_#t~nondet1, main_~j~0, main_#t~nondet2, main_~i~0] {480#true} is VALID [2022-04-15 00:40:31,425 INFO L290 TraceCheckUtils]: 6: Hoare triple {480#true} [74] L28-->L29: Formula: (and (<= v_main_~i~0_7 1000000) (<= 0 v_main_~i~0_7)) InVars {main_~i~0=v_main_~i~0_7} OutVars{main_~i~0=v_main_~i~0_7} AuxVars[] AssignedVars[] {480#true} is VALID [2022-04-15 00:40:31,425 INFO L290 TraceCheckUtils]: 7: Hoare triple {480#true} [77] L29-->L33-2: Formula: (and (= v_main_~j~0_7 v_main_~y~0_4) (= v_main_~i~0_8 v_main_~x~0_3) (= v_main_~z~0_4 0) (<= 0 v_main_~j~0_7)) InVars {main_~i~0=v_main_~i~0_8, main_~j~0=v_main_~j~0_7} OutVars{main_~i~0=v_main_~i~0_8, main_~y~0=v_main_~y~0_4, main_~x~0=v_main_~x~0_3, main_~z~0=v_main_~z~0_4, main_~j~0=v_main_~j~0_7} AuxVars[] AssignedVars[main_~x~0, main_~z~0, main_~y~0] {485#(and (= main_~z~0 0) (<= main_~j~0 main_~y~0) (<= main_~y~0 main_~j~0) (= main_~i~0 main_~x~0))} is VALID [2022-04-15 00:40:31,427 INFO L290 TraceCheckUtils]: 8: Hoare triple {485#(and (= main_~z~0 0) (<= main_~j~0 main_~y~0) (<= main_~y~0 main_~j~0) (= main_~i~0 main_~x~0))} [80] L33-2-->L33-2: Formula: (and (= v_main_~z~0_1 (+ v_main_~z~0_2 1)) (= (+ v_main_~x~0_1 1) v_main_~x~0_2) (not (= v_main_~x~0_2 0)) (= (+ (- 2) v_main_~y~0_2) v_main_~y~0_1)) InVars {main_~y~0=v_main_~y~0_2, main_~x~0=v_main_~x~0_2, main_~z~0=v_main_~z~0_2} OutVars{main_#t~post4=|v_main_#t~post4_1|, main_~y~0=v_main_~y~0_1, main_#t~post3=|v_main_#t~post3_1|, main_~x~0=v_main_~x~0_1, main_~z~0=v_main_~z~0_1} AuxVars[] AssignedVars[main_~x~0, main_~z~0, main_#t~post4, main_~y~0, main_#t~post3] {521#(and (= (+ main_~x~0 1) main_~i~0) (<= main_~j~0 (+ main_~y~0 2)) (= (+ (- 1) main_~z~0) 0) (<= (+ main_~y~0 2) main_~j~0))} is VALID [2022-04-15 00:40:31,427 INFO L290 TraceCheckUtils]: 9: Hoare triple {521#(and (= (+ main_~x~0 1) main_~i~0) (<= main_~j~0 (+ main_~y~0 2)) (= (+ (- 1) main_~z~0) 0) (<= (+ main_~y~0 2) main_~j~0))} [80] L33-2-->L33-2: Formula: (and (= v_main_~z~0_1 (+ v_main_~z~0_2 1)) (= (+ v_main_~x~0_1 1) v_main_~x~0_2) (not (= v_main_~x~0_2 0)) (= (+ (- 2) v_main_~y~0_2) v_main_~y~0_1)) InVars {main_~y~0=v_main_~y~0_2, main_~x~0=v_main_~x~0_2, main_~z~0=v_main_~z~0_2} OutVars{main_#t~post4=|v_main_#t~post4_1|, main_~y~0=v_main_~y~0_1, main_#t~post3=|v_main_#t~post3_1|, main_~x~0=v_main_~x~0_1, main_~z~0=v_main_~z~0_1} AuxVars[] AssignedVars[main_~x~0, main_~z~0, main_#t~post4, main_~y~0, main_#t~post3] {525#(and (= (+ (- 2) main_~z~0) 0) (<= (+ main_~y~0 4) main_~j~0) (= (+ main_~x~0 1) (+ (- 1) main_~i~0)) (<= main_~j~0 (+ main_~y~0 4)))} is VALID [2022-04-15 00:40:31,428 INFO L290 TraceCheckUtils]: 10: Hoare triple {525#(and (= (+ (- 2) main_~z~0) 0) (<= (+ main_~y~0 4) main_~j~0) (= (+ main_~x~0 1) (+ (- 1) main_~i~0)) (<= main_~j~0 (+ main_~y~0 4)))} [80] L33-2-->L33-2: Formula: (and (= v_main_~z~0_1 (+ v_main_~z~0_2 1)) (= (+ v_main_~x~0_1 1) v_main_~x~0_2) (not (= v_main_~x~0_2 0)) (= (+ (- 2) v_main_~y~0_2) v_main_~y~0_1)) InVars {main_~y~0=v_main_~y~0_2, main_~x~0=v_main_~x~0_2, main_~z~0=v_main_~z~0_2} OutVars{main_#t~post4=|v_main_#t~post4_1|, main_~y~0=v_main_~y~0_1, main_#t~post3=|v_main_#t~post3_1|, main_~x~0=v_main_~x~0_1, main_~z~0=v_main_~z~0_1} AuxVars[] AssignedVars[main_~x~0, main_~z~0, main_#t~post4, main_~y~0, main_#t~post3] {529#(and (<= main_~j~0 (+ main_~y~0 6)) (<= (+ main_~y~0 6) main_~j~0) (= 0 (+ main_~z~0 (- 3))) (= (+ (- 1) main_~i~0) (+ main_~x~0 2)))} is VALID [2022-04-15 00:40:31,429 INFO L290 TraceCheckUtils]: 11: Hoare triple {529#(and (<= main_~j~0 (+ main_~y~0 6)) (<= (+ main_~y~0 6) main_~j~0) (= 0 (+ main_~z~0 (- 3))) (= (+ (- 1) main_~i~0) (+ main_~x~0 2)))} [80] L33-2-->L33-2: Formula: (and (= v_main_~z~0_1 (+ v_main_~z~0_2 1)) (= (+ v_main_~x~0_1 1) v_main_~x~0_2) (not (= v_main_~x~0_2 0)) (= (+ (- 2) v_main_~y~0_2) v_main_~y~0_1)) InVars {main_~y~0=v_main_~y~0_2, main_~x~0=v_main_~x~0_2, main_~z~0=v_main_~z~0_2} OutVars{main_#t~post4=|v_main_#t~post4_1|, main_~y~0=v_main_~y~0_1, main_#t~post3=|v_main_#t~post3_1|, main_~x~0=v_main_~x~0_1, main_~z~0=v_main_~z~0_1} AuxVars[] AssignedVars[main_~x~0, main_~z~0, main_#t~post4, main_~y~0, main_#t~post3] {533#(and (= (+ main_~x~0 3) (+ (- 1) main_~i~0)) (= main_~z~0 4) (<= (+ main_~y~0 8) main_~j~0) (<= main_~j~0 (+ main_~y~0 8)))} is VALID [2022-04-15 00:40:31,430 INFO L290 TraceCheckUtils]: 12: Hoare triple {533#(and (= (+ main_~x~0 3) (+ (- 1) main_~i~0)) (= main_~z~0 4) (<= (+ main_~y~0 8) main_~j~0) (<= main_~j~0 (+ main_~y~0 8)))} [79] L33-2-->L33-3: Formula: (= v_main_~x~0_4 0) InVars {main_~x~0=v_main_~x~0_4} OutVars{main_~x~0=v_main_~x~0_4} AuxVars[] AssignedVars[] {537#(and (= main_~z~0 4) (<= (+ main_~y~0 8) main_~j~0) (= (+ (- 1) main_~i~0) 3) (<= main_~j~0 (+ main_~y~0 8)))} is VALID [2022-04-15 00:40:31,431 INFO L290 TraceCheckUtils]: 13: Hoare triple {537#(and (= main_~z~0 4) (<= (+ main_~y~0 8) main_~j~0) (= (+ (- 1) main_~i~0) 3) (<= main_~j~0 (+ main_~y~0 8)))} [81] L33-3-->L39: Formula: (= v_main_~i~0_1 v_main_~j~0_1) InVars {main_~i~0=v_main_~i~0_1, main_~j~0=v_main_~j~0_1} OutVars{main_~i~0=v_main_~i~0_1, main_~j~0=v_main_~j~0_1} AuxVars[] AssignedVars[] {541#(and (<= (+ main_~y~0 4) 0) (<= 0 (+ main_~y~0 4)) (= main_~z~0 4))} is VALID [2022-04-15 00:40:31,431 INFO L272 TraceCheckUtils]: 14: Hoare triple {541#(and (<= (+ main_~y~0 4) 0) (<= 0 (+ main_~y~0 4)) (= main_~z~0 4))} [83] L39-->__VERIFIER_assertENTRY: Formula: (= (ite (= (- v_main_~z~0_5) v_main_~y~0_5) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~y~0=v_main_~y~0_5, main_~z~0=v_main_~z~0_5} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~z~0, main_~y~0] {545#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 00:40:31,433 INFO L290 TraceCheckUtils]: 15: Hoare triple {545#(<= 1 |__VERIFIER_assert_#in~cond|)} [85] __VERIFIER_assertENTRY-->L18: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {549#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 00:40:31,433 INFO L290 TraceCheckUtils]: 16: Hoare triple {549#(<= 1 __VERIFIER_assert_~cond)} [86] L18-->L19: Formula: (= v___VERIFIER_assert_~cond_2 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {481#false} is VALID [2022-04-15 00:40:31,433 INFO L290 TraceCheckUtils]: 17: Hoare triple {481#false} [88] L19-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {481#false} is VALID [2022-04-15 00:40:31,434 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 00:40:31,434 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 00:40:31,745 INFO L290 TraceCheckUtils]: 17: Hoare triple {481#false} [88] L19-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {481#false} is VALID [2022-04-15 00:40:31,747 INFO L290 TraceCheckUtils]: 16: Hoare triple {549#(<= 1 __VERIFIER_assert_~cond)} [86] L18-->L19: Formula: (= v___VERIFIER_assert_~cond_2 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {481#false} is VALID [2022-04-15 00:40:31,748 INFO L290 TraceCheckUtils]: 15: Hoare triple {545#(<= 1 |__VERIFIER_assert_#in~cond|)} [85] __VERIFIER_assertENTRY-->L18: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {549#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 00:40:31,748 INFO L272 TraceCheckUtils]: 14: Hoare triple {490#(and (<= (+ main_~z~0 main_~y~0) 0) (< 0 (+ main_~z~0 main_~y~0 1)))} [83] L39-->__VERIFIER_assertENTRY: Formula: (= (ite (= (- v_main_~z~0_5) v_main_~y~0_5) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~y~0=v_main_~y~0_5, main_~z~0=v_main_~z~0_5} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~z~0, main_~y~0] {545#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 00:40:31,749 INFO L290 TraceCheckUtils]: 13: Hoare triple {568#(or (not (= main_~i~0 main_~j~0)) (and (<= (+ main_~z~0 main_~y~0) 0) (< 0 (+ main_~z~0 main_~y~0 1))))} [81] L33-3-->L39: Formula: (= v_main_~i~0_1 v_main_~j~0_1) InVars {main_~i~0=v_main_~i~0_1, main_~j~0=v_main_~j~0_1} OutVars{main_~i~0=v_main_~i~0_1, main_~j~0=v_main_~j~0_1} AuxVars[] AssignedVars[] {490#(and (<= (+ main_~z~0 main_~y~0) 0) (< 0 (+ main_~z~0 main_~y~0 1)))} is VALID [2022-04-15 00:40:31,749 INFO L290 TraceCheckUtils]: 12: Hoare triple {572#(or (not (= main_~i~0 main_~j~0)) (and (<= (+ main_~z~0 main_~y~0) 0) (< 0 (+ main_~z~0 main_~y~0 1))) (not (= main_~x~0 0)))} [79] L33-2-->L33-3: Formula: (= v_main_~x~0_4 0) InVars {main_~x~0=v_main_~x~0_4} OutVars{main_~x~0=v_main_~x~0_4} AuxVars[] AssignedVars[] {568#(or (not (= main_~i~0 main_~j~0)) (and (<= (+ main_~z~0 main_~y~0) 0) (< 0 (+ main_~z~0 main_~y~0 1))))} is VALID [2022-04-15 00:40:31,750 INFO L290 TraceCheckUtils]: 11: Hoare triple {576#(or (not (= main_~i~0 main_~j~0)) (not (= main_~x~0 1)) (and (< 0 (+ main_~z~0 main_~y~0)) (<= (+ main_~z~0 main_~y~0) 1)))} [80] L33-2-->L33-2: Formula: (and (= v_main_~z~0_1 (+ v_main_~z~0_2 1)) (= (+ v_main_~x~0_1 1) v_main_~x~0_2) (not (= v_main_~x~0_2 0)) (= (+ (- 2) v_main_~y~0_2) v_main_~y~0_1)) InVars {main_~y~0=v_main_~y~0_2, main_~x~0=v_main_~x~0_2, main_~z~0=v_main_~z~0_2} OutVars{main_#t~post4=|v_main_#t~post4_1|, main_~y~0=v_main_~y~0_1, main_#t~post3=|v_main_#t~post3_1|, main_~x~0=v_main_~x~0_1, main_~z~0=v_main_~z~0_1} AuxVars[] AssignedVars[main_~x~0, main_~z~0, main_#t~post4, main_~y~0, main_#t~post3] {572#(or (not (= main_~i~0 main_~j~0)) (and (<= (+ main_~z~0 main_~y~0) 0) (< 0 (+ main_~z~0 main_~y~0 1))) (not (= main_~x~0 0)))} is VALID [2022-04-15 00:40:31,750 INFO L290 TraceCheckUtils]: 10: Hoare triple {580#(or (not (= main_~i~0 main_~j~0)) (not (= main_~x~0 2)) (and (< 1 (+ main_~z~0 main_~y~0)) (<= (+ main_~z~0 main_~y~0) 2)))} [80] L33-2-->L33-2: Formula: (and (= v_main_~z~0_1 (+ v_main_~z~0_2 1)) (= (+ v_main_~x~0_1 1) v_main_~x~0_2) (not (= v_main_~x~0_2 0)) (= (+ (- 2) v_main_~y~0_2) v_main_~y~0_1)) InVars {main_~y~0=v_main_~y~0_2, main_~x~0=v_main_~x~0_2, main_~z~0=v_main_~z~0_2} OutVars{main_#t~post4=|v_main_#t~post4_1|, main_~y~0=v_main_~y~0_1, main_#t~post3=|v_main_#t~post3_1|, main_~x~0=v_main_~x~0_1, main_~z~0=v_main_~z~0_1} AuxVars[] AssignedVars[main_~x~0, main_~z~0, main_#t~post4, main_~y~0, main_#t~post3] {576#(or (not (= main_~i~0 main_~j~0)) (not (= main_~x~0 1)) (and (< 0 (+ main_~z~0 main_~y~0)) (<= (+ main_~z~0 main_~y~0) 1)))} is VALID [2022-04-15 00:40:31,751 INFO L290 TraceCheckUtils]: 9: Hoare triple {584#(or (not (= main_~i~0 main_~j~0)) (and (<= (+ main_~z~0 main_~y~0) 3) (< 2 (+ main_~z~0 main_~y~0))) (not (= (+ (- 1) main_~x~0) 2)))} [80] L33-2-->L33-2: Formula: (and (= v_main_~z~0_1 (+ v_main_~z~0_2 1)) (= (+ v_main_~x~0_1 1) v_main_~x~0_2) (not (= v_main_~x~0_2 0)) (= (+ (- 2) v_main_~y~0_2) v_main_~y~0_1)) InVars {main_~y~0=v_main_~y~0_2, main_~x~0=v_main_~x~0_2, main_~z~0=v_main_~z~0_2} OutVars{main_#t~post4=|v_main_#t~post4_1|, main_~y~0=v_main_~y~0_1, main_#t~post3=|v_main_#t~post3_1|, main_~x~0=v_main_~x~0_1, main_~z~0=v_main_~z~0_1} AuxVars[] AssignedVars[main_~x~0, main_~z~0, main_#t~post4, main_~y~0, main_#t~post3] {580#(or (not (= main_~i~0 main_~j~0)) (not (= main_~x~0 2)) (and (< 1 (+ main_~z~0 main_~y~0)) (<= (+ main_~z~0 main_~y~0) 2)))} is VALID [2022-04-15 00:40:31,752 INFO L290 TraceCheckUtils]: 8: Hoare triple {588#(or (not (= main_~i~0 main_~j~0)) (and (< 3 (+ main_~z~0 main_~y~0)) (<= (+ main_~z~0 main_~y~0) 4)) (not (= main_~x~0 4)))} [80] L33-2-->L33-2: Formula: (and (= v_main_~z~0_1 (+ v_main_~z~0_2 1)) (= (+ v_main_~x~0_1 1) v_main_~x~0_2) (not (= v_main_~x~0_2 0)) (= (+ (- 2) v_main_~y~0_2) v_main_~y~0_1)) InVars {main_~y~0=v_main_~y~0_2, main_~x~0=v_main_~x~0_2, main_~z~0=v_main_~z~0_2} OutVars{main_#t~post4=|v_main_#t~post4_1|, main_~y~0=v_main_~y~0_1, main_#t~post3=|v_main_#t~post3_1|, main_~x~0=v_main_~x~0_1, main_~z~0=v_main_~z~0_1} AuxVars[] AssignedVars[main_~x~0, main_~z~0, main_#t~post4, main_~y~0, main_#t~post3] {584#(or (not (= main_~i~0 main_~j~0)) (and (<= (+ main_~z~0 main_~y~0) 3) (< 2 (+ main_~z~0 main_~y~0))) (not (= (+ (- 1) main_~x~0) 2)))} is VALID [2022-04-15 00:40:31,753 INFO L290 TraceCheckUtils]: 7: Hoare triple {480#true} [77] L29-->L33-2: Formula: (and (= v_main_~j~0_7 v_main_~y~0_4) (= v_main_~i~0_8 v_main_~x~0_3) (= v_main_~z~0_4 0) (<= 0 v_main_~j~0_7)) InVars {main_~i~0=v_main_~i~0_8, main_~j~0=v_main_~j~0_7} OutVars{main_~i~0=v_main_~i~0_8, main_~y~0=v_main_~y~0_4, main_~x~0=v_main_~x~0_3, main_~z~0=v_main_~z~0_4, main_~j~0=v_main_~j~0_7} AuxVars[] AssignedVars[main_~x~0, main_~z~0, main_~y~0] {588#(or (not (= main_~i~0 main_~j~0)) (and (< 3 (+ main_~z~0 main_~y~0)) (<= (+ main_~z~0 main_~y~0) 4)) (not (= main_~x~0 4)))} is VALID [2022-04-15 00:40:31,753 INFO L290 TraceCheckUtils]: 6: Hoare triple {480#true} [74] L28-->L29: Formula: (and (<= v_main_~i~0_7 1000000) (<= 0 v_main_~i~0_7)) InVars {main_~i~0=v_main_~i~0_7} OutVars{main_~i~0=v_main_~i~0_7} AuxVars[] AssignedVars[] {480#true} is VALID [2022-04-15 00:40:31,753 INFO L290 TraceCheckUtils]: 5: Hoare triple {480#true} [71] mainENTRY-->L28: Formula: (and (<= |v_main_#t~nondet1_2| 2147483647) (= v_main_~j~0_3 |v_main_#t~nondet2_2|) (<= 0 (+ |v_main_#t~nondet2_2| 2147483648)) (<= |v_main_#t~nondet2_2| 2147483647) (<= 0 (+ |v_main_#t~nondet1_2| 2147483648)) (= v_main_~i~0_3 |v_main_#t~nondet1_2|)) InVars {main_#t~nondet1=|v_main_#t~nondet1_2|, main_#t~nondet2=|v_main_#t~nondet2_2|} OutVars{main_~i~0=v_main_~i~0_3, main_~j~0=v_main_~j~0_3} AuxVars[] AssignedVars[main_#t~nondet1, main_~j~0, main_#t~nondet2, main_~i~0] {480#true} is VALID [2022-04-15 00:40:31,753 INFO L272 TraceCheckUtils]: 4: Hoare triple {480#true} [68] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {480#true} is VALID [2022-04-15 00:40:31,753 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {480#true} {480#true} [91] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {480#true} is VALID [2022-04-15 00:40:31,753 INFO L290 TraceCheckUtils]: 2: Hoare triple {480#true} [72] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {480#true} is VALID [2022-04-15 00:40:31,754 INFO L290 TraceCheckUtils]: 1: Hoare triple {480#true} [69] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= (select |v_#length_1| 2) 9) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {480#true} is VALID [2022-04-15 00:40:31,754 INFO L272 TraceCheckUtils]: 0: Hoare triple {480#true} [67] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {480#true} is VALID [2022-04-15 00:40:31,754 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 00:40:31,754 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [730442991] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 00:40:31,754 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 00:40:31,754 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 25 [2022-04-15 00:40:31,754 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1398563085] [2022-04-15 00:40:31,754 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-15 00:40:31,755 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 23 states have (on average 1.3043478260869565) internal successors, (30), 22 states have internal predecessors, (30), 3 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 18 [2022-04-15 00:40:31,755 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 00:40:31,755 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 25 states, 23 states have (on average 1.3043478260869565) internal successors, (30), 22 states have internal predecessors, (30), 3 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 00:40:31,801 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 37 edges. 37 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 00:40:31,801 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2022-04-15 00:40:31,801 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-15 00:40:31,801 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2022-04-15 00:40:31,802 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=114, Invalid=486, Unknown=0, NotChecked=0, Total=600 [2022-04-15 00:40:31,802 INFO L87 Difference]: Start difference. First operand 19 states and 19 transitions. Second operand has 25 states, 23 states have (on average 1.3043478260869565) internal successors, (30), 22 states have internal predecessors, (30), 3 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 00:40:32,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 00:40:32,257 INFO L93 Difference]: Finished difference Result 22 states and 23 transitions. [2022-04-15 00:40:32,257 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-04-15 00:40:32,257 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 23 states have (on average 1.3043478260869565) internal successors, (30), 22 states have internal predecessors, (30), 3 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 18 [2022-04-15 00:40:32,257 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 00:40:32,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 23 states have (on average 1.3043478260869565) internal successors, (30), 22 states have internal predecessors, (30), 3 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 00:40:32,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 23 transitions. [2022-04-15 00:40:32,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 23 states have (on average 1.3043478260869565) internal successors, (30), 22 states have internal predecessors, (30), 3 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 00:40:32,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 23 transitions. [2022-04-15 00:40:32,260 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 15 states and 23 transitions. [2022-04-15 00:40:32,285 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 23 edges. 23 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 00:40:32,285 INFO L225 Difference]: With dead ends: 22 [2022-04-15 00:40:32,285 INFO L226 Difference]: Without dead ends: 0 [2022-04-15 00:40:32,286 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 22 SyntacticMatches, 3 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 297 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=264, Invalid=1068, Unknown=0, NotChecked=0, Total=1332 [2022-04-15 00:40:32,286 INFO L913 BasicCegarLoop]: 9 mSDtfsCounter, 28 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 99 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 51 SdHoareTripleChecker+Invalid, 118 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 99 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-15 00:40:32,286 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [28 Valid, 51 Invalid, 118 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 99 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-15 00:40:32,287 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-04-15 00:40:32,287 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-04-15 00:40:32,287 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 00:40:32,287 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:32,287 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:32,287 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:32,287 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 00:40:32,287 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-15 00:40:32,287 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-15 00:40:32,287 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 00:40:32,288 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 00:40:32,288 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:32,288 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:32,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 00:40:32,288 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-15 00:40:32,288 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-15 00:40:32,288 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 00:40:32,288 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 00:40:32,288 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 00:40:32,288 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 00:40:32,288 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:32,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-04-15 00:40:32,288 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 18 [2022-04-15 00:40:32,288 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 00:40:32,289 INFO L478 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-04-15 00:40:32,289 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 23 states have (on average 1.3043478260869565) internal successors, (30), 22 states have internal predecessors, (30), 3 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 00:40:32,289 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-15 00:40:32,289 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 00:40:32,291 INFO L788 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-04-15 00:40:32,308 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2022-04-15 00:40:32,505 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3 [2022-04-15 00:40:32,507 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-04-15 00:40:32,819 INFO L878 garLoopResultBuilder]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|)) [2022-04-15 00:40:32,820 INFO L882 garLoopResultBuilder]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2022-04-15 00:40:32,820 INFO L882 garLoopResultBuilder]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2022-04-15 00:40:32,820 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2022-04-15 00:40:32,820 INFO L885 garLoopResultBuilder]: At program point L-1(line -1) the Hoare annotation is: true [2022-04-15 00:40:32,820 INFO L882 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2022-04-15 00:40:32,820 INFO L882 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-04-15 00:40:32,820 INFO L885 garLoopResultBuilder]: At program point mainENTRY(lines 24 42) the Hoare annotation is: true [2022-04-15 00:40:32,820 INFO L882 garLoopResultBuilder]: For program point L28(line 28) no Hoare annotation was computed. [2022-04-15 00:40:32,820 INFO L882 garLoopResultBuilder]: For program point mainFINAL(lines 24 42) no Hoare annotation was computed. [2022-04-15 00:40:32,821 INFO L882 garLoopResultBuilder]: For program point L29(line 29) no Hoare annotation was computed. [2022-04-15 00:40:32,821 INFO L882 garLoopResultBuilder]: For program point mainEXIT(lines 24 42) no Hoare annotation was computed. [2022-04-15 00:40:32,821 INFO L878 garLoopResultBuilder]: At program point L33-2(lines 33 37) the Hoare annotation is: (let ((.cse1 (+ main_~j~0 main_~x~0)) (.cse0 (+ main_~i~0 main_~z~0 main_~y~0))) (and (<= .cse0 .cse1) (<= .cse1 .cse0))) [2022-04-15 00:40:32,821 INFO L882 garLoopResultBuilder]: For program point L33-3(lines 24 42) no Hoare annotation was computed. [2022-04-15 00:40:32,823 INFO L878 garLoopResultBuilder]: At program point L39(line 39) the Hoare annotation is: (let ((.cse0 (< 0 (+ main_~z~0 main_~y~0 1)))) (or (and (or (not (= main_~i~0 main_~j~0)) (not (= main_~x~0 1))) (<= (+ main_~z~0 main_~y~0) 0) .cse0) (and (= main_~z~0 0) (<= main_~y~0 0) (= main_~i~0 0) .cse0))) [2022-04-15 00:40:32,823 INFO L882 garLoopResultBuilder]: For program point L38(lines 38 40) no Hoare annotation was computed. [2022-04-15 00:40:32,823 INFO L885 garLoopResultBuilder]: At program point __VERIFIER_assertENTRY(lines 17 22) the Hoare annotation is: true [2022-04-15 00:40:32,824 INFO L882 garLoopResultBuilder]: For program point L18(lines 18 20) no Hoare annotation was computed. [2022-04-15 00:40:32,824 INFO L882 garLoopResultBuilder]: For program point L19(line 19) no Hoare annotation was computed. [2022-04-15 00:40:32,824 INFO L882 garLoopResultBuilder]: For program point L18-2(lines 17 22) no Hoare annotation was computed. [2022-04-15 00:40:32,824 INFO L882 garLoopResultBuilder]: For program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 19) no Hoare annotation was computed. [2022-04-15 00:40:32,824 INFO L882 garLoopResultBuilder]: For program point __VERIFIER_assertEXIT(lines 17 22) no Hoare annotation was computed. [2022-04-15 00:40:32,826 INFO L719 BasicCegarLoop]: Path program histogram: [2, 1, 1] [2022-04-15 00:40:32,827 INFO L177 ceAbstractionStarter]: Computing trace abstraction results [2022-04-15 00:40:32,832 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2022-04-15 00:40:32,832 WARN L170 areAnnotationChecker]: L28 has no Hoare annotation [2022-04-15 00:40:32,832 WARN L170 areAnnotationChecker]: L18 has no Hoare annotation [2022-04-15 00:40:32,832 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2022-04-15 00:40:32,832 WARN L170 areAnnotationChecker]: L28 has no Hoare annotation [2022-04-15 00:40:32,832 WARN L170 areAnnotationChecker]: L28 has no Hoare annotation [2022-04-15 00:40:32,832 WARN L170 areAnnotationChecker]: L18 has no Hoare annotation [2022-04-15 00:40:32,832 WARN L170 areAnnotationChecker]: L18 has no Hoare annotation [2022-04-15 00:40:32,832 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2022-04-15 00:40:32,832 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2022-04-15 00:40:32,832 WARN L170 areAnnotationChecker]: L29 has no Hoare annotation [2022-04-15 00:40:32,832 WARN L170 areAnnotationChecker]: L29 has no Hoare annotation [2022-04-15 00:40:32,832 WARN L170 areAnnotationChecker]: L19 has no Hoare annotation [2022-04-15 00:40:32,832 WARN L170 areAnnotationChecker]: L19 has no Hoare annotation [2022-04-15 00:40:32,832 WARN L170 areAnnotationChecker]: L18-2 has no Hoare annotation [2022-04-15 00:40:32,832 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2022-04-15 00:40:32,832 WARN L170 areAnnotationChecker]: L33-3 has no Hoare annotation [2022-04-15 00:40:32,833 WARN L170 areAnnotationChecker]: L33-3 has no Hoare annotation [2022-04-15 00:40:32,834 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-15 00:40:32,834 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2022-04-15 00:40:32,834 WARN L170 areAnnotationChecker]: L33-3 has no Hoare annotation [2022-04-15 00:40:32,834 WARN L170 areAnnotationChecker]: L33-3 has no Hoare annotation [2022-04-15 00:40:32,834 WARN L170 areAnnotationChecker]: L38 has no Hoare annotation [2022-04-15 00:40:32,834 INFO L163 areAnnotationChecker]: CFG has 4 edges. 4 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2022-04-15 00:40:32,843 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.04 12:40:32 BasicIcfg [2022-04-15 00:40:32,843 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-04-15 00:40:32,844 INFO L158 Benchmark]: Toolchain (without parser) took 5156.77ms. Allocated memory was 174.1MB in the beginning and 348.1MB in the end (delta: 174.1MB). Free memory was 145.1MB in the beginning and 165.1MB in the end (delta: -20.0MB). Peak memory consumption was 154.2MB. Max. memory is 8.0GB. [2022-04-15 00:40:32,844 INFO L158 Benchmark]: CDTParser took 0.09ms. Allocated memory is still 174.1MB. Free memory is still 130.1MB. There was no memory consumed. Max. memory is 8.0GB. [2022-04-15 00:40:32,845 INFO L158 Benchmark]: CACSL2BoogieTranslator took 196.15ms. Allocated memory was 174.1MB in the beginning and 348.1MB in the end (delta: 174.1MB). Free memory was 144.9MB in the beginning and 318.2MB in the end (delta: -173.3MB). Peak memory consumption was 8.6MB. Max. memory is 8.0GB. [2022-04-15 00:40:32,845 INFO L158 Benchmark]: Boogie Preprocessor took 49.40ms. Allocated memory is still 348.1MB. Free memory was 318.2MB in the beginning and 317.2MB in the end (delta: 1.0MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-04-15 00:40:32,845 INFO L158 Benchmark]: RCFGBuilder took 218.26ms. Allocated memory is still 348.1MB. Free memory was 316.6MB in the beginning and 305.1MB in the end (delta: 11.5MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2022-04-15 00:40:32,846 INFO L158 Benchmark]: IcfgTransformer took 20.09ms. Allocated memory is still 348.1MB. Free memory was 305.1MB in the beginning and 303.5MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-04-15 00:40:32,848 INFO L158 Benchmark]: TraceAbstraction took 4664.35ms. Allocated memory is still 348.1MB. Free memory was 303.0MB in the beginning and 165.1MB in the end (delta: 137.9MB). Peak memory consumption was 139.5MB. Max. memory is 8.0GB. [2022-04-15 00:40:32,849 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - AssertionsEnabledResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.09ms. Allocated memory is still 174.1MB. Free memory is still 130.1MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 196.15ms. Allocated memory was 174.1MB in the beginning and 348.1MB in the end (delta: 174.1MB). Free memory was 144.9MB in the beginning and 318.2MB in the end (delta: -173.3MB). Peak memory consumption was 8.6MB. Max. memory is 8.0GB. * Boogie Preprocessor took 49.40ms. Allocated memory is still 348.1MB. Free memory was 318.2MB in the beginning and 317.2MB in the end (delta: 1.0MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 218.26ms. Allocated memory is still 348.1MB. Free memory was 316.6MB in the beginning and 305.1MB in the end (delta: 11.5MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * IcfgTransformer took 20.09ms. Allocated memory is still 348.1MB. Free memory was 305.1MB in the beginning and 303.5MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * TraceAbstraction took 4664.35ms. Allocated memory is still 348.1MB. Free memory was 303.0MB in the beginning and 165.1MB in the end (delta: 137.9MB). Peak memory consumption was 139.5MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 19]: 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 4 procedures, 22 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 4.6s, OverallIterations: 4, TraceHistogramMax: 4, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 1.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.3s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 89 SdHoareTripleChecker+Valid, 0.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 88 mSDsluCounter, 179 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 124 mSDsCounter, 39 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 271 IncrementalHoareTripleChecker+Invalid, 310 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 39 mSolverCounterUnsat, 55 mSDtfsCounter, 271 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 129 GetRequests, 50 SyntacticMatches, 6 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 463 ImplicationChecksByTransitivity, 0.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=22occurred in iteration=0, InterpolantAutomatonStates: 40, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 4 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 7 LocationsWithAnnotation, 12 PreInvPairs, 22 NumberOfFragments, 66 HoareAnnotationTreeSize, 12 FomulaSimplifications, 21 FormulaSimplificationTreeSizeReduction, 0.2s HoareSimplificationTime, 7 FomulaSimplificationsInter, 318 FormulaSimplificationTreeSizeReductionInter, 0.1s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.9s InterpolantComputationTime, 94 NumberOfCodeBlocks, 94 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 119 ConstructedInterpolants, 0 QuantifiedInterpolants, 840 SizeOfPredicates, 12 NumberOfNonLiveVariables, 165 ConjunctsInSsa, 56 ConjunctsInUnsatCore, 8 InterpolantComputations, 2 PerfectInterpolantSequences, 1/33 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: i + z + y <= j + x && j + x <= i + z + y RESULT: Ultimate proved your program to be correct! [2022-04-15 00:40:32,882 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...