/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/afnp2014.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-fb4f59a-m [2022-04-27 21:39:14,473 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-27 21:39:14,475 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-27 21:39:14,513 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-27 21:39:14,514 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-27 21:39:14,514 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-27 21:39:14,515 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-27 21:39:14,516 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-27 21:39:14,517 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-27 21:39:14,518 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-27 21:39:14,519 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-27 21:39:14,519 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-27 21:39:14,520 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-27 21:39:14,520 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-27 21:39:14,521 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-27 21:39:14,522 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-27 21:39:14,522 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-27 21:39:14,523 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-27 21:39:14,527 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-27 21:39:14,531 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-27 21:39:14,535 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-27 21:39:14,538 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-27 21:39:14,539 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-27 21:39:14,541 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-27 21:39:14,543 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-27 21:39:14,545 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-27 21:39:14,545 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-27 21:39:14,545 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-27 21:39:14,546 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-27 21:39:14,546 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-27 21:39:14,546 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-27 21:39:14,547 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-27 21:39:14,548 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-27 21:39:14,548 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-27 21:39:14,548 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-27 21:39:14,549 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-27 21:39:14,549 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-27 21:39:14,549 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-27 21:39:14,550 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-27 21:39:14,550 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-27 21:39:14,550 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-27 21:39:14,551 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-27 21:39:14,552 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/loopacceleration/qvasr/qvasr_64.epf [2022-04-27 21:39:14,572 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-27 21:39:14,572 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-27 21:39:14,573 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-04-27 21:39:14,573 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-04-27 21:39:14,574 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-04-27 21:39:14,574 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-04-27 21:39:14,574 INFO L138 SettingsManager]: * Use SBE=true [2022-04-27 21:39:14,574 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-27 21:39:14,574 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-27 21:39:14,575 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-27 21:39:14,575 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-27 21:39:14,575 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-27 21:39:14,575 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-27 21:39:14,576 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-27 21:39:14,576 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-27 21:39:14,576 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-27 21:39:14,576 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-27 21:39:14,576 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-27 21:39:14,576 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-27 21:39:14,576 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-27 21:39:14,576 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-27 21:39:14,576 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-04-27 21:39:14,577 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-04-27 21:39:14,577 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-04-27 21:39:14,577 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-04-27 21:39:14,577 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-27 21:39:14,577 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-04-27 21:39:14,577 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-04-27 21:39:14,578 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-04-27 21:39:14,578 INFO L138 SettingsManager]: * TransformationType=LOOP_ACCELERATION_QVASR WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.core: Log level for class -> de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN; [2022-04-27 21:39:14,750 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-27 21:39:14,764 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-27 21:39:14,765 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-27 21:39:14,766 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-27 21:39:14,771 INFO L275 PluginConnector]: CDTParser initialized [2022-04-27 21:39:14,772 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-lit/afnp2014.i [2022-04-27 21:39:14,816 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c9a186ae9/ef16b87b7e0b4649a6ba626ff92bc81c/FLAG5b42134b3 [2022-04-27 21:39:15,150 INFO L306 CDTParser]: Found 1 translation units. [2022-04-27 21:39:15,150 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-lit/afnp2014.i [2022-04-27 21:39:15,155 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c9a186ae9/ef16b87b7e0b4649a6ba626ff92bc81c/FLAG5b42134b3 [2022-04-27 21:39:15,590 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c9a186ae9/ef16b87b7e0b4649a6ba626ff92bc81c [2022-04-27 21:39:15,592 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-27 21:39:15,593 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-04-27 21:39:15,601 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-27 21:39:15,601 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-27 21:39:15,603 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-27 21:39:15,604 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.04 09:39:15" (1/1) ... [2022-04-27 21:39:15,605 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3611c588 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 09:39:15, skipping insertion in model container [2022-04-27 21:39:15,605 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.04 09:39:15" (1/1) ... [2022-04-27 21:39:15,609 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-27 21:39:15,619 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-27 21:39:15,792 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/afnp2014.i[895,908] [2022-04-27 21:39:15,814 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-27 21:39:15,821 INFO L203 MainTranslator]: Completed pre-run [2022-04-27 21:39:15,832 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/afnp2014.i[895,908] [2022-04-27 21:39:15,840 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-27 21:39:15,849 INFO L208 MainTranslator]: Completed translation [2022-04-27 21:39:15,850 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 09:39:15 WrapperNode [2022-04-27 21:39:15,851 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-27 21:39:15,852 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-27 21:39:15,852 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-27 21:39:15,853 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-27 21:39:15,859 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 09:39:15" (1/1) ... [2022-04-27 21:39:15,860 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 09:39:15" (1/1) ... [2022-04-27 21:39:15,863 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 09:39:15" (1/1) ... [2022-04-27 21:39:15,863 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 09:39:15" (1/1) ... [2022-04-27 21:39:15,867 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 09:39:15" (1/1) ... [2022-04-27 21:39:15,869 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 09:39:15" (1/1) ... [2022-04-27 21:39:15,869 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 09:39:15" (1/1) ... [2022-04-27 21:39:15,870 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-27 21:39:15,871 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-27 21:39:15,871 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-27 21:39:15,871 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-27 21:39:15,872 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 09:39:15" (1/1) ... [2022-04-27 21:39:15,878 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-27 21:39:15,885 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 21:39:15,893 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-04-27 21:39:15,900 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-04-27 21:39:15,925 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-27 21:39:15,926 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-27 21:39:15,926 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-27 21:39:15,926 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-27 21:39:15,926 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-27 21:39:15,926 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-27 21:39:15,926 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-27 21:39:15,926 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-27 21:39:15,926 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_perror_fail [2022-04-27 21:39:15,926 INFO L130 BoogieDeclarations]: Found specification of procedure __assert [2022-04-27 21:39:15,926 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-27 21:39:15,926 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-27 21:39:15,926 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-27 21:39:15,926 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-27 21:39:15,926 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-04-27 21:39:15,927 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-27 21:39:15,927 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-27 21:39:15,927 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-27 21:39:15,927 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-27 21:39:15,927 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-27 21:39:15,927 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-27 21:39:15,927 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-27 21:39:15,969 INFO L234 CfgBuilder]: Building ICFG [2022-04-27 21:39:15,970 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-27 21:39:16,064 INFO L275 CfgBuilder]: Performing block encoding [2022-04-27 21:39:16,068 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-27 21:39:16,069 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-27 21:39:16,070 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.04 09:39:16 BoogieIcfgContainer [2022-04-27 21:39:16,070 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-27 21:39:16,071 INFO L113 PluginConnector]: ------------------------IcfgTransformer---------------------------- [2022-04-27 21:39:16,071 INFO L271 PluginConnector]: Initializing IcfgTransformer... [2022-04-27 21:39:16,072 INFO L275 PluginConnector]: IcfgTransformer initialized [2022-04-27 21:39:16,074 INFO L185 PluginConnector]: Executing the observer IcfgTransformationObserver from plugin IcfgTransformer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.04 09:39:16" (1/1) ... [2022-04-27 21:39:16,076 INFO L168 ansformationObserver]: Applying ICFG transformation LOOP_ACCELERATION_QVASR [2022-04-27 21:39:16,088 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 27.04 09:39:16 BasicIcfg [2022-04-27 21:39:16,088 INFO L132 PluginConnector]: ------------------------ END IcfgTransformer---------------------------- [2022-04-27 21:39:16,091 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-27 21:39:16,091 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-27 21:39:16,093 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-27 21:39:16,093 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.04 09:39:15" (1/4) ... [2022-04-27 21:39:16,094 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@17a971ad and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.04 09:39:16, skipping insertion in model container [2022-04-27 21:39:16,094 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 09:39:15" (2/4) ... [2022-04-27 21:39:16,094 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@17a971ad and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.04 09:39:16, skipping insertion in model container [2022-04-27 21:39:16,094 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.04 09:39:16" (3/4) ... [2022-04-27 21:39:16,095 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@17a971ad and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.04 09:39:16, skipping insertion in model container [2022-04-27 21:39:16,095 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 27.04 09:39:16" (4/4) ... [2022-04-27 21:39:16,095 INFO L111 eAbstractionObserver]: Analyzing ICFG afnp2014.iqvasr [2022-04-27 21:39:16,104 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-04-27 21:39:16,104 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-27 21:39:16,137 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-27 21:39:16,141 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@ffebcf2, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@a04f65e [2022-04-27 21:39:16,141 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-27 21:39:16,146 INFO L276 IsEmpty]: Start isEmpty. Operand has 21 states, 13 states have (on average 1.3846153846153846) internal successors, (18), 14 states have internal predecessors, (18), 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-27 21:39:16,151 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-04-27 21:39:16,151 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 21:39:16,152 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 21:39:16,152 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 21:39:16,155 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 21:39:16,155 INFO L85 PathProgramCache]: Analyzing trace with hash -1500993422, now seen corresponding path program 1 times [2022-04-27 21:39:16,162 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 21:39:16,162 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [198879815] [2022-04-27 21:39:16,162 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 21:39:16,163 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 21:39:16,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 21:39:16,262 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 21:39:16,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 21:39:16,279 INFO L290 TraceCheckUtils]: 0: Hoare triple {29#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [62] 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] {24#true} is VALID [2022-04-27 21:39:16,279 INFO L290 TraceCheckUtils]: 1: Hoare triple {24#true} [65] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {24#true} is VALID [2022-04-27 21:39:16,279 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {24#true} {24#true} [81] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {24#true} is VALID [2022-04-27 21:39:16,280 INFO L272 TraceCheckUtils]: 0: Hoare triple {24#true} [60] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {29#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 21:39:16,281 INFO L290 TraceCheckUtils]: 1: Hoare triple {29#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [62] 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] {24#true} is VALID [2022-04-27 21:39:16,281 INFO L290 TraceCheckUtils]: 2: Hoare triple {24#true} [65] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {24#true} is VALID [2022-04-27 21:39:16,281 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {24#true} {24#true} [81] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {24#true} is VALID [2022-04-27 21:39:16,281 INFO L272 TraceCheckUtils]: 4: Hoare triple {24#true} [61] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {24#true} is VALID [2022-04-27 21:39:16,282 INFO L290 TraceCheckUtils]: 5: Hoare triple {24#true} [64] mainENTRY-->L27-5: Formula: (and (= v_main_~x~0_2 1) (= v_main_~y~0_3 0)) InVars {} OutVars{main_~x~0=v_main_~x~0_2, main_~y~0=v_main_~y~0_3} AuxVars[] AssignedVars[main_~x~0, main_~y~0] {24#true} is VALID [2022-04-27 21:39:16,282 INFO L290 TraceCheckUtils]: 6: Hoare triple {24#true} [66] L27-5-->L27-6: Formula: false InVars {} OutVars{} AuxVars[] AssignedVars[] {25#false} is VALID [2022-04-27 21:39:16,282 INFO L272 TraceCheckUtils]: 7: Hoare triple {25#false} [68] L27-6-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (<= v_main_~y~0_6 v_main_~x~0_5) 1 0)) InVars {main_~x~0=v_main_~x~0_5, main_~y~0=v_main_~y~0_6} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {25#false} is VALID [2022-04-27 21:39:16,283 INFO L290 TraceCheckUtils]: 8: Hoare triple {25#false} [72] __VERIFIER_assertENTRY-->L18: Formula: (= v___VERIFIER_assert_~cond_2 |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_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {25#false} is VALID [2022-04-27 21:39:16,283 INFO L290 TraceCheckUtils]: 9: Hoare triple {25#false} [76] L18-->L19: Formula: (= v___VERIFIER_assert_~cond_3 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {25#false} is VALID [2022-04-27 21:39:16,283 INFO L290 TraceCheckUtils]: 10: Hoare triple {25#false} [78] L19-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {25#false} is VALID [2022-04-27 21:39:16,283 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 21:39:16,284 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 21:39:16,284 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [198879815] [2022-04-27 21:39:16,284 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [198879815] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 21:39:16,284 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 21:39:16,284 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-27 21:39:16,285 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1944263718] [2022-04-27 21:39:16,286 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 21:39:16,289 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 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 11 [2022-04-27 21:39:16,290 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 21:39:16,292 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 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-27 21:39:16,303 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 11 edges. 11 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 21:39:16,303 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-27 21:39:16,304 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 21:39:16,316 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-27 21:39:16,317 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-27 21:39:16,318 INFO L87 Difference]: Start difference. First operand has 21 states, 13 states have (on average 1.3846153846153846) internal successors, (18), 14 states have internal predecessors, (18), 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 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 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-27 21:39:16,363 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 21:39:16,363 INFO L93 Difference]: Finished difference Result 33 states and 37 transitions. [2022-04-27 21:39:16,363 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-27 21:39:16,363 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 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 11 [2022-04-27 21:39:16,363 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 21:39:16,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 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-27 21:39:16,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 37 transitions. [2022-04-27 21:39:16,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 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-27 21:39:16,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 37 transitions. [2022-04-27 21:39:16,371 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 37 transitions. [2022-04-27 21:39:16,405 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-27 21:39:16,410 INFO L225 Difference]: With dead ends: 33 [2022-04-27 21:39:16,410 INFO L226 Difference]: Without dead ends: 14 [2022-04-27 21:39:16,412 INFO L412 NwaCegarLoop]: 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-27 21:39:16,414 INFO L413 NwaCegarLoop]: 21 mSDtfsCounter, 13 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 24 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-27 21:39:16,415 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 24 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 21:39:16,425 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2022-04-27 21:39:16,436 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2022-04-27 21:39:16,436 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 21:39:16,437 INFO L82 GeneralOperation]: Start isEquivalent. First operand 14 states. Second operand has 14 states, 9 states have (on average 1.2222222222222223) internal successors, (11), 9 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-27 21:39:16,438 INFO L74 IsIncluded]: Start isIncluded. First operand 14 states. Second operand has 14 states, 9 states have (on average 1.2222222222222223) internal successors, (11), 9 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-27 21:39:16,438 INFO L87 Difference]: Start difference. First operand 14 states. Second operand has 14 states, 9 states have (on average 1.2222222222222223) internal successors, (11), 9 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-27 21:39:16,443 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 21:39:16,444 INFO L93 Difference]: Finished difference Result 14 states and 15 transitions. [2022-04-27 21:39:16,444 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 15 transitions. [2022-04-27 21:39:16,444 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 21:39:16,444 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 21:39:16,445 INFO L74 IsIncluded]: Start isIncluded. First operand has 14 states, 9 states have (on average 1.2222222222222223) internal successors, (11), 9 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 14 states. [2022-04-27 21:39:16,445 INFO L87 Difference]: Start difference. First operand has 14 states, 9 states have (on average 1.2222222222222223) internal successors, (11), 9 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 14 states. [2022-04-27 21:39:16,449 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 21:39:16,449 INFO L93 Difference]: Finished difference Result 14 states and 15 transitions. [2022-04-27 21:39:16,449 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 15 transitions. [2022-04-27 21:39:16,449 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 21:39:16,450 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 21:39:16,450 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 21:39:16,451 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 21:39:16,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 9 states have (on average 1.2222222222222223) internal successors, (11), 9 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-27 21:39:16,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 15 transitions. [2022-04-27 21:39:16,456 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 15 transitions. Word has length 11 [2022-04-27 21:39:16,457 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 21:39:16,457 INFO L495 AbstractCegarLoop]: Abstraction has 14 states and 15 transitions. [2022-04-27 21:39:16,457 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 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-27 21:39:16,457 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 15 transitions. [2022-04-27 21:39:16,458 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-04-27 21:39:16,458 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 21:39:16,458 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 21:39:16,458 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-27 21:39:16,459 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 21:39:16,459 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 21:39:16,460 INFO L85 PathProgramCache]: Analyzing trace with hash 1571147607, now seen corresponding path program 1 times [2022-04-27 21:39:16,460 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 21:39:16,460 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1553389690] [2022-04-27 21:39:16,460 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 21:39:16,460 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 21:39:16,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 21:39:16,597 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 21:39:16,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 21:39:16,609 INFO L290 TraceCheckUtils]: 0: Hoare triple {131#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [62] 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] {123#true} is VALID [2022-04-27 21:39:16,609 INFO L290 TraceCheckUtils]: 1: Hoare triple {123#true} [65] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {123#true} is VALID [2022-04-27 21:39:16,609 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {123#true} {123#true} [81] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {123#true} is VALID [2022-04-27 21:39:16,610 INFO L272 TraceCheckUtils]: 0: Hoare triple {123#true} [60] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {131#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 21:39:16,610 INFO L290 TraceCheckUtils]: 1: Hoare triple {131#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [62] 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] {123#true} is VALID [2022-04-27 21:39:16,611 INFO L290 TraceCheckUtils]: 2: Hoare triple {123#true} [65] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {123#true} is VALID [2022-04-27 21:39:16,611 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {123#true} {123#true} [81] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {123#true} is VALID [2022-04-27 21:39:16,612 INFO L272 TraceCheckUtils]: 4: Hoare triple {123#true} [61] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {123#true} is VALID [2022-04-27 21:39:16,612 INFO L290 TraceCheckUtils]: 5: Hoare triple {123#true} [64] mainENTRY-->L27-5: Formula: (and (= v_main_~x~0_2 1) (= v_main_~y~0_3 0)) InVars {} OutVars{main_~x~0=v_main_~x~0_2, main_~y~0=v_main_~y~0_3} AuxVars[] AssignedVars[main_~x~0, main_~y~0] {128#(<= main_~y~0 main_~x~0)} is VALID [2022-04-27 21:39:16,613 INFO L290 TraceCheckUtils]: 6: Hoare triple {128#(<= main_~y~0 main_~x~0)} [67] L27-5-->L27-1: Formula: (let ((.cse0 (< v_main_~y~0_2 1000))) (or (and |v_main_#t~short2_1| .cse0) (and (not .cse0) (not |v_main_#t~short2_1|)))) InVars {main_~y~0=v_main_~y~0_2} OutVars{main_#t~short2=|v_main_#t~short2_1|, main_~y~0=v_main_~y~0_2} AuxVars[] AssignedVars[main_#t~short2] {128#(<= main_~y~0 main_~x~0)} is VALID [2022-04-27 21:39:16,613 INFO L290 TraceCheckUtils]: 7: Hoare triple {128#(<= main_~y~0 main_~x~0)} [69] L27-1-->L27-3: Formula: (and |v_main_#t~short2_3| (let ((.cse0 (= |v_main_#t~nondet1_1| 0))) (or (and (not |v_main_#t~short2_2|) .cse0) (and |v_main_#t~short2_2| (not .cse0)))) (<= |v_main_#t~nondet1_1| 2147483647) (<= 0 (+ |v_main_#t~nondet1_1| 2147483648))) InVars {main_#t~nondet1=|v_main_#t~nondet1_1|, main_#t~short2=|v_main_#t~short2_3|} OutVars{main_#t~nondet1=|v_main_#t~nondet1_1|, main_#t~short2=|v_main_#t~short2_2|} AuxVars[] AssignedVars[main_#t~short2] {128#(<= main_~y~0 main_~x~0)} is VALID [2022-04-27 21:39:16,614 INFO L290 TraceCheckUtils]: 8: Hoare triple {128#(<= main_~y~0 main_~x~0)} [73] L27-3-->L27-6: Formula: (not |v_main_#t~short2_6|) InVars {main_#t~short2=|v_main_#t~short2_6|} OutVars{main_#t~nondet1=|v_main_#t~nondet1_2|} AuxVars[] AssignedVars[main_#t~nondet1, main_#t~short2] {128#(<= main_~y~0 main_~x~0)} is VALID [2022-04-27 21:39:16,615 INFO L272 TraceCheckUtils]: 9: Hoare triple {128#(<= main_~y~0 main_~x~0)} [68] L27-6-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (<= v_main_~y~0_6 v_main_~x~0_5) 1 0)) InVars {main_~x~0=v_main_~x~0_5, main_~y~0=v_main_~y~0_6} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {129#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 21:39:16,615 INFO L290 TraceCheckUtils]: 10: Hoare triple {129#(not (= |__VERIFIER_assert_#in~cond| 0))} [72] __VERIFIER_assertENTRY-->L18: Formula: (= v___VERIFIER_assert_~cond_2 |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_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {130#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-27 21:39:16,616 INFO L290 TraceCheckUtils]: 11: Hoare triple {130#(not (= __VERIFIER_assert_~cond 0))} [76] L18-->L19: Formula: (= v___VERIFIER_assert_~cond_3 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {124#false} is VALID [2022-04-27 21:39:16,616 INFO L290 TraceCheckUtils]: 12: Hoare triple {124#false} [78] L19-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {124#false} is VALID [2022-04-27 21:39:16,616 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 21:39:16,616 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 21:39:16,617 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1553389690] [2022-04-27 21:39:16,617 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1553389690] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 21:39:16,617 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 21:39:16,617 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-27 21:39:16,617 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1360163563] [2022-04-27 21:39:16,617 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 21:39:16,618 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.5) internal successors, (9), 4 states have internal predecessors, (9), 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 13 [2022-04-27 21:39:16,618 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 21:39:16,619 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 1.5) internal successors, (9), 4 states have internal predecessors, (9), 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-27 21:39:16,631 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 13 edges. 13 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 21:39:16,632 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-27 21:39:16,632 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 21:39:16,633 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-27 21:39:16,636 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-04-27 21:39:16,637 INFO L87 Difference]: Start difference. First operand 14 states and 15 transitions. Second operand has 6 states, 6 states have (on average 1.5) internal successors, (9), 4 states have internal predecessors, (9), 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-27 21:39:16,797 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 21:39:16,797 INFO L93 Difference]: Finished difference Result 22 states and 24 transitions. [2022-04-27 21:39:16,798 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-27 21:39:16,798 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.5) internal successors, (9), 4 states have internal predecessors, (9), 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 13 [2022-04-27 21:39:16,798 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 21:39:16,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 1.5) internal successors, (9), 4 states have internal predecessors, (9), 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-27 21:39:16,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 24 transitions. [2022-04-27 21:39:16,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 1.5) internal successors, (9), 4 states have internal predecessors, (9), 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-27 21:39:16,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 24 transitions. [2022-04-27 21:39:16,803 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 24 transitions. [2022-04-27 21:39:16,822 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 24 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 21:39:16,823 INFO L225 Difference]: With dead ends: 22 [2022-04-27 21:39:16,823 INFO L226 Difference]: Without dead ends: 17 [2022-04-27 21:39:16,823 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2022-04-27 21:39:16,824 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 16 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 29 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-27 21:39:16,825 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 29 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-27 21:39:16,825 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2022-04-27 21:39:16,828 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2022-04-27 21:39:16,828 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 21:39:16,829 INFO L82 GeneralOperation]: Start isEquivalent. First operand 17 states. Second operand has 17 states, 12 states have (on average 1.25) internal successors, (15), 12 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-27 21:39:16,829 INFO L74 IsIncluded]: Start isIncluded. First operand 17 states. Second operand has 17 states, 12 states have (on average 1.25) internal successors, (15), 12 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-27 21:39:16,829 INFO L87 Difference]: Start difference. First operand 17 states. Second operand has 17 states, 12 states have (on average 1.25) internal successors, (15), 12 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-27 21:39:16,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 21:39:16,830 INFO L93 Difference]: Finished difference Result 17 states and 19 transitions. [2022-04-27 21:39:16,830 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 19 transitions. [2022-04-27 21:39:16,830 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 21:39:16,831 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 21:39:16,831 INFO L74 IsIncluded]: Start isIncluded. First operand has 17 states, 12 states have (on average 1.25) internal successors, (15), 12 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 17 states. [2022-04-27 21:39:16,831 INFO L87 Difference]: Start difference. First operand has 17 states, 12 states have (on average 1.25) internal successors, (15), 12 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 17 states. [2022-04-27 21:39:16,832 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 21:39:16,832 INFO L93 Difference]: Finished difference Result 17 states and 19 transitions. [2022-04-27 21:39:16,832 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 19 transitions. [2022-04-27 21:39:16,832 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 21:39:16,832 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 21:39:16,832 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 21:39:16,833 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 21:39:16,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 12 states have (on average 1.25) internal successors, (15), 12 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-27 21:39:16,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 19 transitions. [2022-04-27 21:39:16,834 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 19 transitions. Word has length 13 [2022-04-27 21:39:16,834 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 21:39:16,834 INFO L495 AbstractCegarLoop]: Abstraction has 17 states and 19 transitions. [2022-04-27 21:39:16,834 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 1.5) internal successors, (9), 4 states have internal predecessors, (9), 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-27 21:39:16,834 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 19 transitions. [2022-04-27 21:39:16,834 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-04-27 21:39:16,835 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 21:39:16,835 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 21:39:16,835 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-27 21:39:16,835 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 21:39:16,835 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 21:39:16,836 INFO L85 PathProgramCache]: Analyzing trace with hash 271190683, now seen corresponding path program 1 times [2022-04-27 21:39:16,836 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 21:39:16,836 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1824979671] [2022-04-27 21:39:16,836 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 21:39:16,836 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 21:39:16,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 21:39:16,889 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 21:39:16,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 21:39:16,895 INFO L290 TraceCheckUtils]: 0: Hoare triple {240#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [62] 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] {231#true} is VALID [2022-04-27 21:39:16,895 INFO L290 TraceCheckUtils]: 1: Hoare triple {231#true} [65] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {231#true} is VALID [2022-04-27 21:39:16,895 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {231#true} {231#true} [81] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {231#true} is VALID [2022-04-27 21:39:16,896 INFO L272 TraceCheckUtils]: 0: Hoare triple {231#true} [60] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {240#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 21:39:16,896 INFO L290 TraceCheckUtils]: 1: Hoare triple {240#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [62] 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] {231#true} is VALID [2022-04-27 21:39:16,896 INFO L290 TraceCheckUtils]: 2: Hoare triple {231#true} [65] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {231#true} is VALID [2022-04-27 21:39:16,897 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {231#true} {231#true} [81] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {231#true} is VALID [2022-04-27 21:39:16,897 INFO L272 TraceCheckUtils]: 4: Hoare triple {231#true} [61] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {231#true} is VALID [2022-04-27 21:39:16,897 INFO L290 TraceCheckUtils]: 5: Hoare triple {231#true} [64] mainENTRY-->L27-5: Formula: (and (= v_main_~x~0_2 1) (= v_main_~y~0_3 0)) InVars {} OutVars{main_~x~0=v_main_~x~0_2, main_~y~0=v_main_~y~0_3} AuxVars[] AssignedVars[main_~x~0, main_~y~0] {236#(= (+ (- 1) main_~x~0) 0)} is VALID [2022-04-27 21:39:16,898 INFO L290 TraceCheckUtils]: 6: Hoare triple {236#(= (+ (- 1) main_~x~0) 0)} [67] L27-5-->L27-1: Formula: (let ((.cse0 (< v_main_~y~0_2 1000))) (or (and |v_main_#t~short2_1| .cse0) (and (not .cse0) (not |v_main_#t~short2_1|)))) InVars {main_~y~0=v_main_~y~0_2} OutVars{main_#t~short2=|v_main_#t~short2_1|, main_~y~0=v_main_~y~0_2} AuxVars[] AssignedVars[main_#t~short2] {236#(= (+ (- 1) main_~x~0) 0)} is VALID [2022-04-27 21:39:16,898 INFO L290 TraceCheckUtils]: 7: Hoare triple {236#(= (+ (- 1) main_~x~0) 0)} [69] L27-1-->L27-3: Formula: (and |v_main_#t~short2_3| (let ((.cse0 (= |v_main_#t~nondet1_1| 0))) (or (and (not |v_main_#t~short2_2|) .cse0) (and |v_main_#t~short2_2| (not .cse0)))) (<= |v_main_#t~nondet1_1| 2147483647) (<= 0 (+ |v_main_#t~nondet1_1| 2147483648))) InVars {main_#t~nondet1=|v_main_#t~nondet1_1|, main_#t~short2=|v_main_#t~short2_3|} OutVars{main_#t~nondet1=|v_main_#t~nondet1_1|, main_#t~short2=|v_main_#t~short2_2|} AuxVars[] AssignedVars[main_#t~short2] {236#(= (+ (- 1) main_~x~0) 0)} is VALID [2022-04-27 21:39:16,899 INFO L290 TraceCheckUtils]: 8: Hoare triple {236#(= (+ (- 1) main_~x~0) 0)} [74] L27-3-->L27-5: Formula: (and |v_main_#t~short2_8| (= v_main_~x~0_3 (+ v_main_~x~0_4 v_main_~y~0_5)) (= v_main_~y~0_4 (+ v_main_~y~0_5 1))) InVars {main_~y~0=v_main_~y~0_5, main_~x~0=v_main_~x~0_4, main_#t~short2=|v_main_#t~short2_8|} OutVars{main_~y~0=v_main_~y~0_4, main_~x~0=v_main_~x~0_3, main_#t~nondet1=|v_main_#t~nondet1_3|} AuxVars[] AssignedVars[main_~x~0, main_#t~nondet1, main_#t~short2, main_~y~0] {237#(<= main_~y~0 main_~x~0)} is VALID [2022-04-27 21:39:16,899 INFO L290 TraceCheckUtils]: 9: Hoare triple {237#(<= main_~y~0 main_~x~0)} [67] L27-5-->L27-1: Formula: (let ((.cse0 (< v_main_~y~0_2 1000))) (or (and |v_main_#t~short2_1| .cse0) (and (not .cse0) (not |v_main_#t~short2_1|)))) InVars {main_~y~0=v_main_~y~0_2} OutVars{main_#t~short2=|v_main_#t~short2_1|, main_~y~0=v_main_~y~0_2} AuxVars[] AssignedVars[main_#t~short2] {237#(<= main_~y~0 main_~x~0)} is VALID [2022-04-27 21:39:16,900 INFO L290 TraceCheckUtils]: 10: Hoare triple {237#(<= main_~y~0 main_~x~0)} [69] L27-1-->L27-3: Formula: (and |v_main_#t~short2_3| (let ((.cse0 (= |v_main_#t~nondet1_1| 0))) (or (and (not |v_main_#t~short2_2|) .cse0) (and |v_main_#t~short2_2| (not .cse0)))) (<= |v_main_#t~nondet1_1| 2147483647) (<= 0 (+ |v_main_#t~nondet1_1| 2147483648))) InVars {main_#t~nondet1=|v_main_#t~nondet1_1|, main_#t~short2=|v_main_#t~short2_3|} OutVars{main_#t~nondet1=|v_main_#t~nondet1_1|, main_#t~short2=|v_main_#t~short2_2|} AuxVars[] AssignedVars[main_#t~short2] {237#(<= main_~y~0 main_~x~0)} is VALID [2022-04-27 21:39:16,900 INFO L290 TraceCheckUtils]: 11: Hoare triple {237#(<= main_~y~0 main_~x~0)} [73] L27-3-->L27-6: Formula: (not |v_main_#t~short2_6|) InVars {main_#t~short2=|v_main_#t~short2_6|} OutVars{main_#t~nondet1=|v_main_#t~nondet1_2|} AuxVars[] AssignedVars[main_#t~nondet1, main_#t~short2] {237#(<= main_~y~0 main_~x~0)} is VALID [2022-04-27 21:39:16,902 INFO L272 TraceCheckUtils]: 12: Hoare triple {237#(<= main_~y~0 main_~x~0)} [68] L27-6-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (<= v_main_~y~0_6 v_main_~x~0_5) 1 0)) InVars {main_~x~0=v_main_~x~0_5, main_~y~0=v_main_~y~0_6} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {238#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 21:39:16,902 INFO L290 TraceCheckUtils]: 13: Hoare triple {238#(not (= |__VERIFIER_assert_#in~cond| 0))} [72] __VERIFIER_assertENTRY-->L18: Formula: (= v___VERIFIER_assert_~cond_2 |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_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {239#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-27 21:39:16,905 INFO L290 TraceCheckUtils]: 14: Hoare triple {239#(not (= __VERIFIER_assert_~cond 0))} [76] L18-->L19: Formula: (= v___VERIFIER_assert_~cond_3 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {232#false} is VALID [2022-04-27 21:39:16,905 INFO L290 TraceCheckUtils]: 15: Hoare triple {232#false} [78] L19-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {232#false} is VALID [2022-04-27 21:39:16,905 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 21:39:16,905 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 21:39:16,905 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1824979671] [2022-04-27 21:39:16,906 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1824979671] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 21:39:16,906 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [554445094] [2022-04-27 21:39:16,906 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 21:39:16,906 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 21:39:16,906 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 21:39:16,917 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-27 21:39:16,933 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-04-27 21:39:16,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 21:39:16,975 INFO L263 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 6 conjunts are in the unsatisfiable core [2022-04-27 21:39:17,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 21:39:17,011 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 21:39:17,219 INFO L272 TraceCheckUtils]: 0: Hoare triple {231#true} [60] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {231#true} is VALID [2022-04-27 21:39:17,220 INFO L290 TraceCheckUtils]: 1: Hoare triple {231#true} [62] 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] {231#true} is VALID [2022-04-27 21:39:17,220 INFO L290 TraceCheckUtils]: 2: Hoare triple {231#true} [65] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {231#true} is VALID [2022-04-27 21:39:17,220 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {231#true} {231#true} [81] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {231#true} is VALID [2022-04-27 21:39:17,222 INFO L272 TraceCheckUtils]: 4: Hoare triple {231#true} [61] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {231#true} is VALID [2022-04-27 21:39:17,222 INFO L290 TraceCheckUtils]: 5: Hoare triple {231#true} [64] mainENTRY-->L27-5: Formula: (and (= v_main_~x~0_2 1) (= v_main_~y~0_3 0)) InVars {} OutVars{main_~x~0=v_main_~x~0_2, main_~y~0=v_main_~y~0_3} AuxVars[] AssignedVars[main_~x~0, main_~y~0] {259#(<= 1 main_~x~0)} is VALID [2022-04-27 21:39:17,223 INFO L290 TraceCheckUtils]: 6: Hoare triple {259#(<= 1 main_~x~0)} [67] L27-5-->L27-1: Formula: (let ((.cse0 (< v_main_~y~0_2 1000))) (or (and |v_main_#t~short2_1| .cse0) (and (not .cse0) (not |v_main_#t~short2_1|)))) InVars {main_~y~0=v_main_~y~0_2} OutVars{main_#t~short2=|v_main_#t~short2_1|, main_~y~0=v_main_~y~0_2} AuxVars[] AssignedVars[main_#t~short2] {259#(<= 1 main_~x~0)} is VALID [2022-04-27 21:39:17,223 INFO L290 TraceCheckUtils]: 7: Hoare triple {259#(<= 1 main_~x~0)} [69] L27-1-->L27-3: Formula: (and |v_main_#t~short2_3| (let ((.cse0 (= |v_main_#t~nondet1_1| 0))) (or (and (not |v_main_#t~short2_2|) .cse0) (and |v_main_#t~short2_2| (not .cse0)))) (<= |v_main_#t~nondet1_1| 2147483647) (<= 0 (+ |v_main_#t~nondet1_1| 2147483648))) InVars {main_#t~nondet1=|v_main_#t~nondet1_1|, main_#t~short2=|v_main_#t~short2_3|} OutVars{main_#t~nondet1=|v_main_#t~nondet1_1|, main_#t~short2=|v_main_#t~short2_2|} AuxVars[] AssignedVars[main_#t~short2] {259#(<= 1 main_~x~0)} is VALID [2022-04-27 21:39:17,224 INFO L290 TraceCheckUtils]: 8: Hoare triple {259#(<= 1 main_~x~0)} [74] L27-3-->L27-5: Formula: (and |v_main_#t~short2_8| (= v_main_~x~0_3 (+ v_main_~x~0_4 v_main_~y~0_5)) (= v_main_~y~0_4 (+ v_main_~y~0_5 1))) InVars {main_~y~0=v_main_~y~0_5, main_~x~0=v_main_~x~0_4, main_#t~short2=|v_main_#t~short2_8|} OutVars{main_~y~0=v_main_~y~0_4, main_~x~0=v_main_~x~0_3, main_#t~nondet1=|v_main_#t~nondet1_3|} AuxVars[] AssignedVars[main_~x~0, main_#t~nondet1, main_#t~short2, main_~y~0] {237#(<= main_~y~0 main_~x~0)} is VALID [2022-04-27 21:39:17,226 INFO L290 TraceCheckUtils]: 9: Hoare triple {237#(<= main_~y~0 main_~x~0)} [67] L27-5-->L27-1: Formula: (let ((.cse0 (< v_main_~y~0_2 1000))) (or (and |v_main_#t~short2_1| .cse0) (and (not .cse0) (not |v_main_#t~short2_1|)))) InVars {main_~y~0=v_main_~y~0_2} OutVars{main_#t~short2=|v_main_#t~short2_1|, main_~y~0=v_main_~y~0_2} AuxVars[] AssignedVars[main_#t~short2] {237#(<= main_~y~0 main_~x~0)} is VALID [2022-04-27 21:39:17,227 INFO L290 TraceCheckUtils]: 10: Hoare triple {237#(<= main_~y~0 main_~x~0)} [69] L27-1-->L27-3: Formula: (and |v_main_#t~short2_3| (let ((.cse0 (= |v_main_#t~nondet1_1| 0))) (or (and (not |v_main_#t~short2_2|) .cse0) (and |v_main_#t~short2_2| (not .cse0)))) (<= |v_main_#t~nondet1_1| 2147483647) (<= 0 (+ |v_main_#t~nondet1_1| 2147483648))) InVars {main_#t~nondet1=|v_main_#t~nondet1_1|, main_#t~short2=|v_main_#t~short2_3|} OutVars{main_#t~nondet1=|v_main_#t~nondet1_1|, main_#t~short2=|v_main_#t~short2_2|} AuxVars[] AssignedVars[main_#t~short2] {237#(<= main_~y~0 main_~x~0)} is VALID [2022-04-27 21:39:17,227 INFO L290 TraceCheckUtils]: 11: Hoare triple {237#(<= main_~y~0 main_~x~0)} [73] L27-3-->L27-6: Formula: (not |v_main_#t~short2_6|) InVars {main_#t~short2=|v_main_#t~short2_6|} OutVars{main_#t~nondet1=|v_main_#t~nondet1_2|} AuxVars[] AssignedVars[main_#t~nondet1, main_#t~short2] {237#(<= main_~y~0 main_~x~0)} is VALID [2022-04-27 21:39:17,228 INFO L272 TraceCheckUtils]: 12: Hoare triple {237#(<= main_~y~0 main_~x~0)} [68] L27-6-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (<= v_main_~y~0_6 v_main_~x~0_5) 1 0)) InVars {main_~x~0=v_main_~x~0_5, main_~y~0=v_main_~y~0_6} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {281#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 21:39:17,228 INFO L290 TraceCheckUtils]: 13: Hoare triple {281#(<= 1 |__VERIFIER_assert_#in~cond|)} [72] __VERIFIER_assertENTRY-->L18: Formula: (= v___VERIFIER_assert_~cond_2 |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_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {285#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 21:39:17,229 INFO L290 TraceCheckUtils]: 14: Hoare triple {285#(<= 1 __VERIFIER_assert_~cond)} [76] L18-->L19: Formula: (= v___VERIFIER_assert_~cond_3 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {232#false} is VALID [2022-04-27 21:39:17,229 INFO L290 TraceCheckUtils]: 15: Hoare triple {232#false} [78] L19-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {232#false} is VALID [2022-04-27 21:39:17,229 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 21:39:17,229 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 21:39:17,424 INFO L290 TraceCheckUtils]: 15: Hoare triple {232#false} [78] L19-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {232#false} is VALID [2022-04-27 21:39:17,424 INFO L290 TraceCheckUtils]: 14: Hoare triple {285#(<= 1 __VERIFIER_assert_~cond)} [76] L18-->L19: Formula: (= v___VERIFIER_assert_~cond_3 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {232#false} is VALID [2022-04-27 21:39:17,425 INFO L290 TraceCheckUtils]: 13: Hoare triple {281#(<= 1 |__VERIFIER_assert_#in~cond|)} [72] __VERIFIER_assertENTRY-->L18: Formula: (= v___VERIFIER_assert_~cond_2 |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_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {285#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 21:39:17,425 INFO L272 TraceCheckUtils]: 12: Hoare triple {237#(<= main_~y~0 main_~x~0)} [68] L27-6-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (<= v_main_~y~0_6 v_main_~x~0_5) 1 0)) InVars {main_~x~0=v_main_~x~0_5, main_~y~0=v_main_~y~0_6} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {281#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 21:39:17,426 INFO L290 TraceCheckUtils]: 11: Hoare triple {237#(<= main_~y~0 main_~x~0)} [73] L27-3-->L27-6: Formula: (not |v_main_#t~short2_6|) InVars {main_#t~short2=|v_main_#t~short2_6|} OutVars{main_#t~nondet1=|v_main_#t~nondet1_2|} AuxVars[] AssignedVars[main_#t~nondet1, main_#t~short2] {237#(<= main_~y~0 main_~x~0)} is VALID [2022-04-27 21:39:17,426 INFO L290 TraceCheckUtils]: 10: Hoare triple {237#(<= main_~y~0 main_~x~0)} [69] L27-1-->L27-3: Formula: (and |v_main_#t~short2_3| (let ((.cse0 (= |v_main_#t~nondet1_1| 0))) (or (and (not |v_main_#t~short2_2|) .cse0) (and |v_main_#t~short2_2| (not .cse0)))) (<= |v_main_#t~nondet1_1| 2147483647) (<= 0 (+ |v_main_#t~nondet1_1| 2147483648))) InVars {main_#t~nondet1=|v_main_#t~nondet1_1|, main_#t~short2=|v_main_#t~short2_3|} OutVars{main_#t~nondet1=|v_main_#t~nondet1_1|, main_#t~short2=|v_main_#t~short2_2|} AuxVars[] AssignedVars[main_#t~short2] {237#(<= main_~y~0 main_~x~0)} is VALID [2022-04-27 21:39:17,427 INFO L290 TraceCheckUtils]: 9: Hoare triple {237#(<= main_~y~0 main_~x~0)} [67] L27-5-->L27-1: Formula: (let ((.cse0 (< v_main_~y~0_2 1000))) (or (and |v_main_#t~short2_1| .cse0) (and (not .cse0) (not |v_main_#t~short2_1|)))) InVars {main_~y~0=v_main_~y~0_2} OutVars{main_#t~short2=|v_main_#t~short2_1|, main_~y~0=v_main_~y~0_2} AuxVars[] AssignedVars[main_#t~short2] {237#(<= main_~y~0 main_~x~0)} is VALID [2022-04-27 21:39:17,427 INFO L290 TraceCheckUtils]: 8: Hoare triple {259#(<= 1 main_~x~0)} [74] L27-3-->L27-5: Formula: (and |v_main_#t~short2_8| (= v_main_~x~0_3 (+ v_main_~x~0_4 v_main_~y~0_5)) (= v_main_~y~0_4 (+ v_main_~y~0_5 1))) InVars {main_~y~0=v_main_~y~0_5, main_~x~0=v_main_~x~0_4, main_#t~short2=|v_main_#t~short2_8|} OutVars{main_~y~0=v_main_~y~0_4, main_~x~0=v_main_~x~0_3, main_#t~nondet1=|v_main_#t~nondet1_3|} AuxVars[] AssignedVars[main_~x~0, main_#t~nondet1, main_#t~short2, main_~y~0] {237#(<= main_~y~0 main_~x~0)} is VALID [2022-04-27 21:39:17,428 INFO L290 TraceCheckUtils]: 7: Hoare triple {259#(<= 1 main_~x~0)} [69] L27-1-->L27-3: Formula: (and |v_main_#t~short2_3| (let ((.cse0 (= |v_main_#t~nondet1_1| 0))) (or (and (not |v_main_#t~short2_2|) .cse0) (and |v_main_#t~short2_2| (not .cse0)))) (<= |v_main_#t~nondet1_1| 2147483647) (<= 0 (+ |v_main_#t~nondet1_1| 2147483648))) InVars {main_#t~nondet1=|v_main_#t~nondet1_1|, main_#t~short2=|v_main_#t~short2_3|} OutVars{main_#t~nondet1=|v_main_#t~nondet1_1|, main_#t~short2=|v_main_#t~short2_2|} AuxVars[] AssignedVars[main_#t~short2] {259#(<= 1 main_~x~0)} is VALID [2022-04-27 21:39:17,428 INFO L290 TraceCheckUtils]: 6: Hoare triple {259#(<= 1 main_~x~0)} [67] L27-5-->L27-1: Formula: (let ((.cse0 (< v_main_~y~0_2 1000))) (or (and |v_main_#t~short2_1| .cse0) (and (not .cse0) (not |v_main_#t~short2_1|)))) InVars {main_~y~0=v_main_~y~0_2} OutVars{main_#t~short2=|v_main_#t~short2_1|, main_~y~0=v_main_~y~0_2} AuxVars[] AssignedVars[main_#t~short2] {259#(<= 1 main_~x~0)} is VALID [2022-04-27 21:39:17,429 INFO L290 TraceCheckUtils]: 5: Hoare triple {231#true} [64] mainENTRY-->L27-5: Formula: (and (= v_main_~x~0_2 1) (= v_main_~y~0_3 0)) InVars {} OutVars{main_~x~0=v_main_~x~0_2, main_~y~0=v_main_~y~0_3} AuxVars[] AssignedVars[main_~x~0, main_~y~0] {259#(<= 1 main_~x~0)} is VALID [2022-04-27 21:39:17,429 INFO L272 TraceCheckUtils]: 4: Hoare triple {231#true} [61] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {231#true} is VALID [2022-04-27 21:39:17,429 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {231#true} {231#true} [81] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {231#true} is VALID [2022-04-27 21:39:17,429 INFO L290 TraceCheckUtils]: 2: Hoare triple {231#true} [65] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {231#true} is VALID [2022-04-27 21:39:17,430 INFO L290 TraceCheckUtils]: 1: Hoare triple {231#true} [62] 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] {231#true} is VALID [2022-04-27 21:39:17,430 INFO L272 TraceCheckUtils]: 0: Hoare triple {231#true} [60] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {231#true} is VALID [2022-04-27 21:39:17,430 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 21:39:17,430 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [554445094] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 21:39:17,431 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-27 21:39:17,431 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 10 [2022-04-27 21:39:17,431 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [428487909] [2022-04-27 21:39:17,431 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-27 21:39:17,432 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 1.9) internal successors, (19), 7 states have internal predecessors, (19), 2 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 16 [2022-04-27 21:39:17,432 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 21:39:17,432 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 10 states, 10 states have (on average 1.9) internal successors, (19), 7 states have internal predecessors, (19), 2 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 21:39:17,448 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 25 edges. 25 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 21:39:17,448 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-04-27 21:39:17,448 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 21:39:17,448 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-04-27 21:39:17,448 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2022-04-27 21:39:17,449 INFO L87 Difference]: Start difference. First operand 17 states and 19 transitions. Second operand has 10 states, 10 states have (on average 1.9) internal successors, (19), 7 states have internal predecessors, (19), 2 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 21:39:17,599 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 21:39:17,599 INFO L93 Difference]: Finished difference Result 25 states and 28 transitions. [2022-04-27 21:39:17,599 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-27 21:39:17,599 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 1.9) internal successors, (19), 7 states have internal predecessors, (19), 2 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 16 [2022-04-27 21:39:17,600 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 21:39:17,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 1.9) internal successors, (19), 7 states have internal predecessors, (19), 2 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 21:39:17,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 28 transitions. [2022-04-27 21:39:17,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 1.9) internal successors, (19), 7 states have internal predecessors, (19), 2 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 21:39:17,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 28 transitions. [2022-04-27 21:39:17,602 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 28 transitions. [2022-04-27 21:39:17,622 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-27 21:39:17,623 INFO L225 Difference]: With dead ends: 25 [2022-04-27 21:39:17,623 INFO L226 Difference]: Without dead ends: 20 [2022-04-27 21:39:17,623 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 30 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=44, Invalid=138, Unknown=0, NotChecked=0, Total=182 [2022-04-27 21:39:17,624 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 21 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 44 SdHoareTripleChecker+Invalid, 67 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 61 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-27 21:39:17,624 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 44 Invalid, 67 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-27 21:39:17,625 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2022-04-27 21:39:17,628 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2022-04-27 21:39:17,628 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 21:39:17,628 INFO L82 GeneralOperation]: Start isEquivalent. First operand 20 states. Second operand has 20 states, 15 states have (on average 1.2666666666666666) internal successors, (19), 15 states have internal predecessors, (19), 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-27 21:39:17,628 INFO L74 IsIncluded]: Start isIncluded. First operand 20 states. Second operand has 20 states, 15 states have (on average 1.2666666666666666) internal successors, (19), 15 states have internal predecessors, (19), 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-27 21:39:17,629 INFO L87 Difference]: Start difference. First operand 20 states. Second operand has 20 states, 15 states have (on average 1.2666666666666666) internal successors, (19), 15 states have internal predecessors, (19), 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-27 21:39:17,630 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 21:39:17,630 INFO L93 Difference]: Finished difference Result 20 states and 23 transitions. [2022-04-27 21:39:17,630 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 23 transitions. [2022-04-27 21:39:17,630 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 21:39:17,630 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 21:39:17,630 INFO L74 IsIncluded]: Start isIncluded. First operand has 20 states, 15 states have (on average 1.2666666666666666) internal successors, (19), 15 states have internal predecessors, (19), 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 20 states. [2022-04-27 21:39:17,630 INFO L87 Difference]: Start difference. First operand has 20 states, 15 states have (on average 1.2666666666666666) internal successors, (19), 15 states have internal predecessors, (19), 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 20 states. [2022-04-27 21:39:17,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 21:39:17,631 INFO L93 Difference]: Finished difference Result 20 states and 23 transitions. [2022-04-27 21:39:17,632 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 23 transitions. [2022-04-27 21:39:17,632 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 21:39:17,632 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 21:39:17,632 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 21:39:17,632 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 21:39:17,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 15 states have (on average 1.2666666666666666) internal successors, (19), 15 states have internal predecessors, (19), 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-27 21:39:17,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 23 transitions. [2022-04-27 21:39:17,633 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 23 transitions. Word has length 16 [2022-04-27 21:39:17,633 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 21:39:17,633 INFO L495 AbstractCegarLoop]: Abstraction has 20 states and 23 transitions. [2022-04-27 21:39:17,633 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 1.9) internal successors, (19), 7 states have internal predecessors, (19), 2 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 21:39:17,633 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 23 transitions. [2022-04-27 21:39:17,634 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-04-27 21:39:17,634 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 21:39:17,634 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 21:39:17,664 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-04-27 21:39:17,866 WARN L477 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-27 21:39:17,866 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 21:39:17,867 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 21:39:17,867 INFO L85 PathProgramCache]: Analyzing trace with hash 974575831, now seen corresponding path program 2 times [2022-04-27 21:39:17,867 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 21:39:17,867 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [73786756] [2022-04-27 21:39:17,867 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 21:39:17,867 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 21:39:17,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 21:39:17,941 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 21:39:17,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 21:39:17,952 INFO L290 TraceCheckUtils]: 0: Hoare triple {462#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [62] 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] {452#true} is VALID [2022-04-27 21:39:17,952 INFO L290 TraceCheckUtils]: 1: Hoare triple {452#true} [65] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {452#true} is VALID [2022-04-27 21:39:17,953 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {452#true} {452#true} [81] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {452#true} is VALID [2022-04-27 21:39:17,953 INFO L272 TraceCheckUtils]: 0: Hoare triple {452#true} [60] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {462#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 21:39:17,954 INFO L290 TraceCheckUtils]: 1: Hoare triple {462#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [62] 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] {452#true} is VALID [2022-04-27 21:39:17,954 INFO L290 TraceCheckUtils]: 2: Hoare triple {452#true} [65] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {452#true} is VALID [2022-04-27 21:39:17,954 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {452#true} {452#true} [81] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {452#true} is VALID [2022-04-27 21:39:17,954 INFO L272 TraceCheckUtils]: 4: Hoare triple {452#true} [61] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {452#true} is VALID [2022-04-27 21:39:17,955 INFO L290 TraceCheckUtils]: 5: Hoare triple {452#true} [64] mainENTRY-->L27-5: Formula: (and (= v_main_~x~0_2 1) (= v_main_~y~0_3 0)) InVars {} OutVars{main_~x~0=v_main_~x~0_2, main_~y~0=v_main_~y~0_3} AuxVars[] AssignedVars[main_~x~0, main_~y~0] {457#(and (= (+ (- 1) main_~x~0) 0) (= main_~y~0 0))} is VALID [2022-04-27 21:39:17,955 INFO L290 TraceCheckUtils]: 6: Hoare triple {457#(and (= (+ (- 1) main_~x~0) 0) (= main_~y~0 0))} [67] L27-5-->L27-1: Formula: (let ((.cse0 (< v_main_~y~0_2 1000))) (or (and |v_main_#t~short2_1| .cse0) (and (not .cse0) (not |v_main_#t~short2_1|)))) InVars {main_~y~0=v_main_~y~0_2} OutVars{main_#t~short2=|v_main_#t~short2_1|, main_~y~0=v_main_~y~0_2} AuxVars[] AssignedVars[main_#t~short2] {457#(and (= (+ (- 1) main_~x~0) 0) (= main_~y~0 0))} is VALID [2022-04-27 21:39:17,956 INFO L290 TraceCheckUtils]: 7: Hoare triple {457#(and (= (+ (- 1) main_~x~0) 0) (= main_~y~0 0))} [69] L27-1-->L27-3: Formula: (and |v_main_#t~short2_3| (let ((.cse0 (= |v_main_#t~nondet1_1| 0))) (or (and (not |v_main_#t~short2_2|) .cse0) (and |v_main_#t~short2_2| (not .cse0)))) (<= |v_main_#t~nondet1_1| 2147483647) (<= 0 (+ |v_main_#t~nondet1_1| 2147483648))) InVars {main_#t~nondet1=|v_main_#t~nondet1_1|, main_#t~short2=|v_main_#t~short2_3|} OutVars{main_#t~nondet1=|v_main_#t~nondet1_1|, main_#t~short2=|v_main_#t~short2_2|} AuxVars[] AssignedVars[main_#t~short2] {457#(and (= (+ (- 1) main_~x~0) 0) (= main_~y~0 0))} is VALID [2022-04-27 21:39:17,957 INFO L290 TraceCheckUtils]: 8: Hoare triple {457#(and (= (+ (- 1) main_~x~0) 0) (= main_~y~0 0))} [74] L27-3-->L27-5: Formula: (and |v_main_#t~short2_8| (= v_main_~x~0_3 (+ v_main_~x~0_4 v_main_~y~0_5)) (= v_main_~y~0_4 (+ v_main_~y~0_5 1))) InVars {main_~y~0=v_main_~y~0_5, main_~x~0=v_main_~x~0_4, main_#t~short2=|v_main_#t~short2_8|} OutVars{main_~y~0=v_main_~y~0_4, main_~x~0=v_main_~x~0_3, main_#t~nondet1=|v_main_#t~nondet1_3|} AuxVars[] AssignedVars[main_~x~0, main_#t~nondet1, main_#t~short2, main_~y~0] {458#(<= 1 main_~x~0)} is VALID [2022-04-27 21:39:17,957 INFO L290 TraceCheckUtils]: 9: Hoare triple {458#(<= 1 main_~x~0)} [67] L27-5-->L27-1: Formula: (let ((.cse0 (< v_main_~y~0_2 1000))) (or (and |v_main_#t~short2_1| .cse0) (and (not .cse0) (not |v_main_#t~short2_1|)))) InVars {main_~y~0=v_main_~y~0_2} OutVars{main_#t~short2=|v_main_#t~short2_1|, main_~y~0=v_main_~y~0_2} AuxVars[] AssignedVars[main_#t~short2] {458#(<= 1 main_~x~0)} is VALID [2022-04-27 21:39:17,957 INFO L290 TraceCheckUtils]: 10: Hoare triple {458#(<= 1 main_~x~0)} [69] L27-1-->L27-3: Formula: (and |v_main_#t~short2_3| (let ((.cse0 (= |v_main_#t~nondet1_1| 0))) (or (and (not |v_main_#t~short2_2|) .cse0) (and |v_main_#t~short2_2| (not .cse0)))) (<= |v_main_#t~nondet1_1| 2147483647) (<= 0 (+ |v_main_#t~nondet1_1| 2147483648))) InVars {main_#t~nondet1=|v_main_#t~nondet1_1|, main_#t~short2=|v_main_#t~short2_3|} OutVars{main_#t~nondet1=|v_main_#t~nondet1_1|, main_#t~short2=|v_main_#t~short2_2|} AuxVars[] AssignedVars[main_#t~short2] {458#(<= 1 main_~x~0)} is VALID [2022-04-27 21:39:17,958 INFO L290 TraceCheckUtils]: 11: Hoare triple {458#(<= 1 main_~x~0)} [74] L27-3-->L27-5: Formula: (and |v_main_#t~short2_8| (= v_main_~x~0_3 (+ v_main_~x~0_4 v_main_~y~0_5)) (= v_main_~y~0_4 (+ v_main_~y~0_5 1))) InVars {main_~y~0=v_main_~y~0_5, main_~x~0=v_main_~x~0_4, main_#t~short2=|v_main_#t~short2_8|} OutVars{main_~y~0=v_main_~y~0_4, main_~x~0=v_main_~x~0_3, main_#t~nondet1=|v_main_#t~nondet1_3|} AuxVars[] AssignedVars[main_~x~0, main_#t~nondet1, main_#t~short2, main_~y~0] {459#(<= main_~y~0 main_~x~0)} is VALID [2022-04-27 21:39:17,959 INFO L290 TraceCheckUtils]: 12: Hoare triple {459#(<= main_~y~0 main_~x~0)} [67] L27-5-->L27-1: Formula: (let ((.cse0 (< v_main_~y~0_2 1000))) (or (and |v_main_#t~short2_1| .cse0) (and (not .cse0) (not |v_main_#t~short2_1|)))) InVars {main_~y~0=v_main_~y~0_2} OutVars{main_#t~short2=|v_main_#t~short2_1|, main_~y~0=v_main_~y~0_2} AuxVars[] AssignedVars[main_#t~short2] {459#(<= main_~y~0 main_~x~0)} is VALID [2022-04-27 21:39:17,959 INFO L290 TraceCheckUtils]: 13: Hoare triple {459#(<= main_~y~0 main_~x~0)} [69] L27-1-->L27-3: Formula: (and |v_main_#t~short2_3| (let ((.cse0 (= |v_main_#t~nondet1_1| 0))) (or (and (not |v_main_#t~short2_2|) .cse0) (and |v_main_#t~short2_2| (not .cse0)))) (<= |v_main_#t~nondet1_1| 2147483647) (<= 0 (+ |v_main_#t~nondet1_1| 2147483648))) InVars {main_#t~nondet1=|v_main_#t~nondet1_1|, main_#t~short2=|v_main_#t~short2_3|} OutVars{main_#t~nondet1=|v_main_#t~nondet1_1|, main_#t~short2=|v_main_#t~short2_2|} AuxVars[] AssignedVars[main_#t~short2] {459#(<= main_~y~0 main_~x~0)} is VALID [2022-04-27 21:39:17,960 INFO L290 TraceCheckUtils]: 14: Hoare triple {459#(<= main_~y~0 main_~x~0)} [73] L27-3-->L27-6: Formula: (not |v_main_#t~short2_6|) InVars {main_#t~short2=|v_main_#t~short2_6|} OutVars{main_#t~nondet1=|v_main_#t~nondet1_2|} AuxVars[] AssignedVars[main_#t~nondet1, main_#t~short2] {459#(<= main_~y~0 main_~x~0)} is VALID [2022-04-27 21:39:17,960 INFO L272 TraceCheckUtils]: 15: Hoare triple {459#(<= main_~y~0 main_~x~0)} [68] L27-6-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (<= v_main_~y~0_6 v_main_~x~0_5) 1 0)) InVars {main_~x~0=v_main_~x~0_5, main_~y~0=v_main_~y~0_6} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {460#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 21:39:17,961 INFO L290 TraceCheckUtils]: 16: Hoare triple {460#(not (= |__VERIFIER_assert_#in~cond| 0))} [72] __VERIFIER_assertENTRY-->L18: Formula: (= v___VERIFIER_assert_~cond_2 |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_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {461#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-27 21:39:17,961 INFO L290 TraceCheckUtils]: 17: Hoare triple {461#(not (= __VERIFIER_assert_~cond 0))} [76] L18-->L19: Formula: (= v___VERIFIER_assert_~cond_3 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {453#false} is VALID [2022-04-27 21:39:17,961 INFO L290 TraceCheckUtils]: 18: Hoare triple {453#false} [78] L19-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {453#false} is VALID [2022-04-27 21:39:17,962 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 21:39:17,962 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 21:39:17,962 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [73786756] [2022-04-27 21:39:17,962 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [73786756] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 21:39:17,962 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [927538665] [2022-04-27 21:39:17,962 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-27 21:39:17,963 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 21:39:17,963 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 21:39:17,988 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-27 21:39:18,019 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-27 21:39:18,037 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-27 21:39:18,037 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-27 21:39:18,037 INFO L263 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 8 conjunts are in the unsatisfiable core [2022-04-27 21:39:18,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 21:39:18,046 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 21:39:18,200 INFO L272 TraceCheckUtils]: 0: Hoare triple {452#true} [60] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {452#true} is VALID [2022-04-27 21:39:18,201 INFO L290 TraceCheckUtils]: 1: Hoare triple {452#true} [62] 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] {452#true} is VALID [2022-04-27 21:39:18,201 INFO L290 TraceCheckUtils]: 2: Hoare triple {452#true} [65] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {452#true} is VALID [2022-04-27 21:39:18,201 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {452#true} {452#true} [81] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {452#true} is VALID [2022-04-27 21:39:18,201 INFO L272 TraceCheckUtils]: 4: Hoare triple {452#true} [61] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {452#true} is VALID [2022-04-27 21:39:18,203 INFO L290 TraceCheckUtils]: 5: Hoare triple {452#true} [64] mainENTRY-->L27-5: Formula: (and (= v_main_~x~0_2 1) (= v_main_~y~0_3 0)) InVars {} OutVars{main_~x~0=v_main_~x~0_2, main_~y~0=v_main_~y~0_3} AuxVars[] AssignedVars[main_~x~0, main_~y~0] {481#(and (<= 0 main_~y~0) (<= 1 main_~x~0))} is VALID [2022-04-27 21:39:18,203 INFO L290 TraceCheckUtils]: 6: Hoare triple {481#(and (<= 0 main_~y~0) (<= 1 main_~x~0))} [67] L27-5-->L27-1: Formula: (let ((.cse0 (< v_main_~y~0_2 1000))) (or (and |v_main_#t~short2_1| .cse0) (and (not .cse0) (not |v_main_#t~short2_1|)))) InVars {main_~y~0=v_main_~y~0_2} OutVars{main_#t~short2=|v_main_#t~short2_1|, main_~y~0=v_main_~y~0_2} AuxVars[] AssignedVars[main_#t~short2] {481#(and (<= 0 main_~y~0) (<= 1 main_~x~0))} is VALID [2022-04-27 21:39:18,204 INFO L290 TraceCheckUtils]: 7: Hoare triple {481#(and (<= 0 main_~y~0) (<= 1 main_~x~0))} [69] L27-1-->L27-3: Formula: (and |v_main_#t~short2_3| (let ((.cse0 (= |v_main_#t~nondet1_1| 0))) (or (and (not |v_main_#t~short2_2|) .cse0) (and |v_main_#t~short2_2| (not .cse0)))) (<= |v_main_#t~nondet1_1| 2147483647) (<= 0 (+ |v_main_#t~nondet1_1| 2147483648))) InVars {main_#t~nondet1=|v_main_#t~nondet1_1|, main_#t~short2=|v_main_#t~short2_3|} OutVars{main_#t~nondet1=|v_main_#t~nondet1_1|, main_#t~short2=|v_main_#t~short2_2|} AuxVars[] AssignedVars[main_#t~short2] {481#(and (<= 0 main_~y~0) (<= 1 main_~x~0))} is VALID [2022-04-27 21:39:18,205 INFO L290 TraceCheckUtils]: 8: Hoare triple {481#(and (<= 0 main_~y~0) (<= 1 main_~x~0))} [74] L27-3-->L27-5: Formula: (and |v_main_#t~short2_8| (= v_main_~x~0_3 (+ v_main_~x~0_4 v_main_~y~0_5)) (= v_main_~y~0_4 (+ v_main_~y~0_5 1))) InVars {main_~y~0=v_main_~y~0_5, main_~x~0=v_main_~x~0_4, main_#t~short2=|v_main_#t~short2_8|} OutVars{main_~y~0=v_main_~y~0_4, main_~x~0=v_main_~x~0_3, main_#t~nondet1=|v_main_#t~nondet1_3|} AuxVars[] AssignedVars[main_~x~0, main_#t~nondet1, main_#t~short2, main_~y~0] {458#(<= 1 main_~x~0)} is VALID [2022-04-27 21:39:18,205 INFO L290 TraceCheckUtils]: 9: Hoare triple {458#(<= 1 main_~x~0)} [67] L27-5-->L27-1: Formula: (let ((.cse0 (< v_main_~y~0_2 1000))) (or (and |v_main_#t~short2_1| .cse0) (and (not .cse0) (not |v_main_#t~short2_1|)))) InVars {main_~y~0=v_main_~y~0_2} OutVars{main_#t~short2=|v_main_#t~short2_1|, main_~y~0=v_main_~y~0_2} AuxVars[] AssignedVars[main_#t~short2] {458#(<= 1 main_~x~0)} is VALID [2022-04-27 21:39:18,206 INFO L290 TraceCheckUtils]: 10: Hoare triple {458#(<= 1 main_~x~0)} [69] L27-1-->L27-3: Formula: (and |v_main_#t~short2_3| (let ((.cse0 (= |v_main_#t~nondet1_1| 0))) (or (and (not |v_main_#t~short2_2|) .cse0) (and |v_main_#t~short2_2| (not .cse0)))) (<= |v_main_#t~nondet1_1| 2147483647) (<= 0 (+ |v_main_#t~nondet1_1| 2147483648))) InVars {main_#t~nondet1=|v_main_#t~nondet1_1|, main_#t~short2=|v_main_#t~short2_3|} OutVars{main_#t~nondet1=|v_main_#t~nondet1_1|, main_#t~short2=|v_main_#t~short2_2|} AuxVars[] AssignedVars[main_#t~short2] {458#(<= 1 main_~x~0)} is VALID [2022-04-27 21:39:18,206 INFO L290 TraceCheckUtils]: 11: Hoare triple {458#(<= 1 main_~x~0)} [74] L27-3-->L27-5: Formula: (and |v_main_#t~short2_8| (= v_main_~x~0_3 (+ v_main_~x~0_4 v_main_~y~0_5)) (= v_main_~y~0_4 (+ v_main_~y~0_5 1))) InVars {main_~y~0=v_main_~y~0_5, main_~x~0=v_main_~x~0_4, main_#t~short2=|v_main_#t~short2_8|} OutVars{main_~y~0=v_main_~y~0_4, main_~x~0=v_main_~x~0_3, main_#t~nondet1=|v_main_#t~nondet1_3|} AuxVars[] AssignedVars[main_~x~0, main_#t~nondet1, main_#t~short2, main_~y~0] {459#(<= main_~y~0 main_~x~0)} is VALID [2022-04-27 21:39:18,207 INFO L290 TraceCheckUtils]: 12: Hoare triple {459#(<= main_~y~0 main_~x~0)} [67] L27-5-->L27-1: Formula: (let ((.cse0 (< v_main_~y~0_2 1000))) (or (and |v_main_#t~short2_1| .cse0) (and (not .cse0) (not |v_main_#t~short2_1|)))) InVars {main_~y~0=v_main_~y~0_2} OutVars{main_#t~short2=|v_main_#t~short2_1|, main_~y~0=v_main_~y~0_2} AuxVars[] AssignedVars[main_#t~short2] {459#(<= main_~y~0 main_~x~0)} is VALID [2022-04-27 21:39:18,207 INFO L290 TraceCheckUtils]: 13: Hoare triple {459#(<= main_~y~0 main_~x~0)} [69] L27-1-->L27-3: Formula: (and |v_main_#t~short2_3| (let ((.cse0 (= |v_main_#t~nondet1_1| 0))) (or (and (not |v_main_#t~short2_2|) .cse0) (and |v_main_#t~short2_2| (not .cse0)))) (<= |v_main_#t~nondet1_1| 2147483647) (<= 0 (+ |v_main_#t~nondet1_1| 2147483648))) InVars {main_#t~nondet1=|v_main_#t~nondet1_1|, main_#t~short2=|v_main_#t~short2_3|} OutVars{main_#t~nondet1=|v_main_#t~nondet1_1|, main_#t~short2=|v_main_#t~short2_2|} AuxVars[] AssignedVars[main_#t~short2] {459#(<= main_~y~0 main_~x~0)} is VALID [2022-04-27 21:39:18,207 INFO L290 TraceCheckUtils]: 14: Hoare triple {459#(<= main_~y~0 main_~x~0)} [73] L27-3-->L27-6: Formula: (not |v_main_#t~short2_6|) InVars {main_#t~short2=|v_main_#t~short2_6|} OutVars{main_#t~nondet1=|v_main_#t~nondet1_2|} AuxVars[] AssignedVars[main_#t~nondet1, main_#t~short2] {459#(<= main_~y~0 main_~x~0)} is VALID [2022-04-27 21:39:18,208 INFO L272 TraceCheckUtils]: 15: Hoare triple {459#(<= main_~y~0 main_~x~0)} [68] L27-6-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (<= v_main_~y~0_6 v_main_~x~0_5) 1 0)) InVars {main_~x~0=v_main_~x~0_5, main_~y~0=v_main_~y~0_6} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {512#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 21:39:18,209 INFO L290 TraceCheckUtils]: 16: Hoare triple {512#(<= 1 |__VERIFIER_assert_#in~cond|)} [72] __VERIFIER_assertENTRY-->L18: Formula: (= v___VERIFIER_assert_~cond_2 |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_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {516#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 21:39:18,209 INFO L290 TraceCheckUtils]: 17: Hoare triple {516#(<= 1 __VERIFIER_assert_~cond)} [76] L18-->L19: Formula: (= v___VERIFIER_assert_~cond_3 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {453#false} is VALID [2022-04-27 21:39:18,209 INFO L290 TraceCheckUtils]: 18: Hoare triple {453#false} [78] L19-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {453#false} is VALID [2022-04-27 21:39:18,209 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 21:39:18,210 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 21:39:18,340 INFO L290 TraceCheckUtils]: 18: Hoare triple {453#false} [78] L19-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {453#false} is VALID [2022-04-27 21:39:18,350 INFO L290 TraceCheckUtils]: 17: Hoare triple {516#(<= 1 __VERIFIER_assert_~cond)} [76] L18-->L19: Formula: (= v___VERIFIER_assert_~cond_3 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {453#false} is VALID [2022-04-27 21:39:18,350 INFO L290 TraceCheckUtils]: 16: Hoare triple {512#(<= 1 |__VERIFIER_assert_#in~cond|)} [72] __VERIFIER_assertENTRY-->L18: Formula: (= v___VERIFIER_assert_~cond_2 |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_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {516#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 21:39:18,351 INFO L272 TraceCheckUtils]: 15: Hoare triple {459#(<= main_~y~0 main_~x~0)} [68] L27-6-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (<= v_main_~y~0_6 v_main_~x~0_5) 1 0)) InVars {main_~x~0=v_main_~x~0_5, main_~y~0=v_main_~y~0_6} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {512#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 21:39:18,351 INFO L290 TraceCheckUtils]: 14: Hoare triple {459#(<= main_~y~0 main_~x~0)} [73] L27-3-->L27-6: Formula: (not |v_main_#t~short2_6|) InVars {main_#t~short2=|v_main_#t~short2_6|} OutVars{main_#t~nondet1=|v_main_#t~nondet1_2|} AuxVars[] AssignedVars[main_#t~nondet1, main_#t~short2] {459#(<= main_~y~0 main_~x~0)} is VALID [2022-04-27 21:39:18,352 INFO L290 TraceCheckUtils]: 13: Hoare triple {459#(<= main_~y~0 main_~x~0)} [69] L27-1-->L27-3: Formula: (and |v_main_#t~short2_3| (let ((.cse0 (= |v_main_#t~nondet1_1| 0))) (or (and (not |v_main_#t~short2_2|) .cse0) (and |v_main_#t~short2_2| (not .cse0)))) (<= |v_main_#t~nondet1_1| 2147483647) (<= 0 (+ |v_main_#t~nondet1_1| 2147483648))) InVars {main_#t~nondet1=|v_main_#t~nondet1_1|, main_#t~short2=|v_main_#t~short2_3|} OutVars{main_#t~nondet1=|v_main_#t~nondet1_1|, main_#t~short2=|v_main_#t~short2_2|} AuxVars[] AssignedVars[main_#t~short2] {459#(<= main_~y~0 main_~x~0)} is VALID [2022-04-27 21:39:18,352 INFO L290 TraceCheckUtils]: 12: Hoare triple {459#(<= main_~y~0 main_~x~0)} [67] L27-5-->L27-1: Formula: (let ((.cse0 (< v_main_~y~0_2 1000))) (or (and |v_main_#t~short2_1| .cse0) (and (not .cse0) (not |v_main_#t~short2_1|)))) InVars {main_~y~0=v_main_~y~0_2} OutVars{main_#t~short2=|v_main_#t~short2_1|, main_~y~0=v_main_~y~0_2} AuxVars[] AssignedVars[main_#t~short2] {459#(<= main_~y~0 main_~x~0)} is VALID [2022-04-27 21:39:18,353 INFO L290 TraceCheckUtils]: 11: Hoare triple {458#(<= 1 main_~x~0)} [74] L27-3-->L27-5: Formula: (and |v_main_#t~short2_8| (= v_main_~x~0_3 (+ v_main_~x~0_4 v_main_~y~0_5)) (= v_main_~y~0_4 (+ v_main_~y~0_5 1))) InVars {main_~y~0=v_main_~y~0_5, main_~x~0=v_main_~x~0_4, main_#t~short2=|v_main_#t~short2_8|} OutVars{main_~y~0=v_main_~y~0_4, main_~x~0=v_main_~x~0_3, main_#t~nondet1=|v_main_#t~nondet1_3|} AuxVars[] AssignedVars[main_~x~0, main_#t~nondet1, main_#t~short2, main_~y~0] {459#(<= main_~y~0 main_~x~0)} is VALID [2022-04-27 21:39:18,353 INFO L290 TraceCheckUtils]: 10: Hoare triple {458#(<= 1 main_~x~0)} [69] L27-1-->L27-3: Formula: (and |v_main_#t~short2_3| (let ((.cse0 (= |v_main_#t~nondet1_1| 0))) (or (and (not |v_main_#t~short2_2|) .cse0) (and |v_main_#t~short2_2| (not .cse0)))) (<= |v_main_#t~nondet1_1| 2147483647) (<= 0 (+ |v_main_#t~nondet1_1| 2147483648))) InVars {main_#t~nondet1=|v_main_#t~nondet1_1|, main_#t~short2=|v_main_#t~short2_3|} OutVars{main_#t~nondet1=|v_main_#t~nondet1_1|, main_#t~short2=|v_main_#t~short2_2|} AuxVars[] AssignedVars[main_#t~short2] {458#(<= 1 main_~x~0)} is VALID [2022-04-27 21:39:18,353 INFO L290 TraceCheckUtils]: 9: Hoare triple {458#(<= 1 main_~x~0)} [67] L27-5-->L27-1: Formula: (let ((.cse0 (< v_main_~y~0_2 1000))) (or (and |v_main_#t~short2_1| .cse0) (and (not .cse0) (not |v_main_#t~short2_1|)))) InVars {main_~y~0=v_main_~y~0_2} OutVars{main_#t~short2=|v_main_#t~short2_1|, main_~y~0=v_main_~y~0_2} AuxVars[] AssignedVars[main_#t~short2] {458#(<= 1 main_~x~0)} is VALID [2022-04-27 21:39:18,354 INFO L290 TraceCheckUtils]: 8: Hoare triple {553#(<= 1 (+ main_~y~0 main_~x~0))} [74] L27-3-->L27-5: Formula: (and |v_main_#t~short2_8| (= v_main_~x~0_3 (+ v_main_~x~0_4 v_main_~y~0_5)) (= v_main_~y~0_4 (+ v_main_~y~0_5 1))) InVars {main_~y~0=v_main_~y~0_5, main_~x~0=v_main_~x~0_4, main_#t~short2=|v_main_#t~short2_8|} OutVars{main_~y~0=v_main_~y~0_4, main_~x~0=v_main_~x~0_3, main_#t~nondet1=|v_main_#t~nondet1_3|} AuxVars[] AssignedVars[main_~x~0, main_#t~nondet1, main_#t~short2, main_~y~0] {458#(<= 1 main_~x~0)} is VALID [2022-04-27 21:39:18,354 INFO L290 TraceCheckUtils]: 7: Hoare triple {553#(<= 1 (+ main_~y~0 main_~x~0))} [69] L27-1-->L27-3: Formula: (and |v_main_#t~short2_3| (let ((.cse0 (= |v_main_#t~nondet1_1| 0))) (or (and (not |v_main_#t~short2_2|) .cse0) (and |v_main_#t~short2_2| (not .cse0)))) (<= |v_main_#t~nondet1_1| 2147483647) (<= 0 (+ |v_main_#t~nondet1_1| 2147483648))) InVars {main_#t~nondet1=|v_main_#t~nondet1_1|, main_#t~short2=|v_main_#t~short2_3|} OutVars{main_#t~nondet1=|v_main_#t~nondet1_1|, main_#t~short2=|v_main_#t~short2_2|} AuxVars[] AssignedVars[main_#t~short2] {553#(<= 1 (+ main_~y~0 main_~x~0))} is VALID [2022-04-27 21:39:18,355 INFO L290 TraceCheckUtils]: 6: Hoare triple {553#(<= 1 (+ main_~y~0 main_~x~0))} [67] L27-5-->L27-1: Formula: (let ((.cse0 (< v_main_~y~0_2 1000))) (or (and |v_main_#t~short2_1| .cse0) (and (not .cse0) (not |v_main_#t~short2_1|)))) InVars {main_~y~0=v_main_~y~0_2} OutVars{main_#t~short2=|v_main_#t~short2_1|, main_~y~0=v_main_~y~0_2} AuxVars[] AssignedVars[main_#t~short2] {553#(<= 1 (+ main_~y~0 main_~x~0))} is VALID [2022-04-27 21:39:18,355 INFO L290 TraceCheckUtils]: 5: Hoare triple {452#true} [64] mainENTRY-->L27-5: Formula: (and (= v_main_~x~0_2 1) (= v_main_~y~0_3 0)) InVars {} OutVars{main_~x~0=v_main_~x~0_2, main_~y~0=v_main_~y~0_3} AuxVars[] AssignedVars[main_~x~0, main_~y~0] {553#(<= 1 (+ main_~y~0 main_~x~0))} is VALID [2022-04-27 21:39:18,355 INFO L272 TraceCheckUtils]: 4: Hoare triple {452#true} [61] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {452#true} is VALID [2022-04-27 21:39:18,355 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {452#true} {452#true} [81] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {452#true} is VALID [2022-04-27 21:39:18,355 INFO L290 TraceCheckUtils]: 2: Hoare triple {452#true} [65] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {452#true} is VALID [2022-04-27 21:39:18,355 INFO L290 TraceCheckUtils]: 1: Hoare triple {452#true} [62] 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] {452#true} is VALID [2022-04-27 21:39:18,356 INFO L272 TraceCheckUtils]: 0: Hoare triple {452#true} [60] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {452#true} is VALID [2022-04-27 21:39:18,356 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 21:39:18,356 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [927538665] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 21:39:18,356 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-27 21:39:18,356 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 12 [2022-04-27 21:39:18,356 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [749442857] [2022-04-27 21:39:18,356 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-27 21:39:18,357 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.1666666666666665) internal successors, (26), 9 states have internal predecessors, (26), 2 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 19 [2022-04-27 21:39:18,357 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 21:39:18,357 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 12 states, 12 states have (on average 2.1666666666666665) internal successors, (26), 9 states have internal predecessors, (26), 2 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 21:39:18,375 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 32 edges. 32 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 21:39:18,375 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-04-27 21:39:18,375 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 21:39:18,376 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-04-27 21:39:18,376 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2022-04-27 21:39:18,376 INFO L87 Difference]: Start difference. First operand 20 states and 23 transitions. Second operand has 12 states, 12 states have (on average 2.1666666666666665) internal successors, (26), 9 states have internal predecessors, (26), 2 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 21:39:18,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 21:39:18,487 INFO L93 Difference]: Finished difference Result 20 states and 23 transitions. [2022-04-27 21:39:18,487 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-27 21:39:18,487 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.1666666666666665) internal successors, (26), 9 states have internal predecessors, (26), 2 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 19 [2022-04-27 21:39:18,487 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 21:39:18,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 2.1666666666666665) internal successors, (26), 9 states have internal predecessors, (26), 2 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 21:39:18,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 19 transitions. [2022-04-27 21:39:18,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 2.1666666666666665) internal successors, (26), 9 states have internal predecessors, (26), 2 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 21:39:18,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 19 transitions. [2022-04-27 21:39:18,489 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 19 transitions. [2022-04-27 21:39:18,504 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 19 edges. 19 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 21:39:18,504 INFO L225 Difference]: With dead ends: 20 [2022-04-27 21:39:18,504 INFO L226 Difference]: Without dead ends: 0 [2022-04-27 21:39:18,505 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 35 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=58, Invalid=182, Unknown=0, NotChecked=0, Total=240 [2022-04-27 21:39:18,505 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 21 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 37 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 21:39:18,505 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 37 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 21:39:18,506 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-04-27 21:39:18,506 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-04-27 21:39:18,506 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 21:39:18,506 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-27 21:39:18,506 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-27 21:39:18,506 INFO L87 Difference]: Start difference. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-27 21:39:18,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 21:39:18,506 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-27 21:39:18,506 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-27 21:39:18,506 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 21:39:18,506 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 21:39:18,506 INFO L74 IsIncluded]: Start isIncluded. First operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 0 states. [2022-04-27 21:39:18,506 INFO L87 Difference]: Start difference. First operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 0 states. [2022-04-27 21:39:18,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 21:39:18,507 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-27 21:39:18,507 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-27 21:39:18,507 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 21:39:18,507 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 21:39:18,507 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 21:39:18,507 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 21:39:18,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-27 21:39:18,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-04-27 21:39:18,507 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 19 [2022-04-27 21:39:18,507 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 21:39:18,507 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-04-27 21:39:18,507 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 2.1666666666666665) internal successors, (26), 9 states have internal predecessors, (26), 2 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 21:39:18,507 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-27 21:39:18,507 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 21:39:18,509 INFO L805 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-04-27 21:39:18,526 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-27 21:39:18,726 WARN L477 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-27 21:39:18,728 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-04-27 21:39:18,761 INFO L895 garLoopResultBuilder]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|)) [2022-04-27 21:39:18,761 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2022-04-27 21:39:18,761 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2022-04-27 21:39:18,761 INFO L902 garLoopResultBuilder]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2022-04-27 21:39:18,761 INFO L902 garLoopResultBuilder]: At program point L-1(line -1) the Hoare annotation is: true [2022-04-27 21:39:18,761 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2022-04-27 21:39:18,761 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-04-27 21:39:18,761 INFO L902 garLoopResultBuilder]: At program point mainENTRY(lines 24 33) the Hoare annotation is: true [2022-04-27 21:39:18,761 INFO L895 garLoopResultBuilder]: At program point L27-5(lines 27 30) the Hoare annotation is: (and (<= 0 main_~y~0) (<= 1 main_~x~0) (<= main_~y~0 main_~x~0)) [2022-04-27 21:39:18,761 INFO L895 garLoopResultBuilder]: At program point L27-6(lines 27 30) the Hoare annotation is: (<= main_~y~0 main_~x~0) [2022-04-27 21:39:18,761 INFO L899 garLoopResultBuilder]: For program point L27-1(line 27) no Hoare annotation was computed. [2022-04-27 21:39:18,761 INFO L899 garLoopResultBuilder]: For program point L31(line 31) no Hoare annotation was computed. [2022-04-27 21:39:18,761 INFO L899 garLoopResultBuilder]: For program point L27-3(lines 27 30) no Hoare annotation was computed. [2022-04-27 21:39:18,761 INFO L899 garLoopResultBuilder]: For program point mainFINAL(lines 24 33) no Hoare annotation was computed. [2022-04-27 21:39:18,761 INFO L899 garLoopResultBuilder]: For program point mainEXIT(lines 24 33) no Hoare annotation was computed. [2022-04-27 21:39:18,761 INFO L902 garLoopResultBuilder]: At program point __VERIFIER_assertENTRY(lines 17 22) the Hoare annotation is: true [2022-04-27 21:39:18,761 INFO L899 garLoopResultBuilder]: For program point L18(lines 18 20) no Hoare annotation was computed. [2022-04-27 21:39:18,762 INFO L899 garLoopResultBuilder]: For program point L19(line 19) no Hoare annotation was computed. [2022-04-27 21:39:18,762 INFO L899 garLoopResultBuilder]: For program point L18-2(lines 17 22) no Hoare annotation was computed. [2022-04-27 21:39:18,762 INFO L899 garLoopResultBuilder]: For program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 19) no Hoare annotation was computed. [2022-04-27 21:39:18,762 INFO L899 garLoopResultBuilder]: For program point __VERIFIER_assertEXIT(lines 17 22) no Hoare annotation was computed. [2022-04-27 21:39:18,764 INFO L356 BasicCegarLoop]: Path program histogram: [2, 1, 1] [2022-04-27 21:39:18,765 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-04-27 21:39:18,768 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2022-04-27 21:39:18,768 WARN L170 areAnnotationChecker]: L18 has no Hoare annotation [2022-04-27 21:39:18,768 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2022-04-27 21:39:18,770 WARN L170 areAnnotationChecker]: L27-1 has no Hoare annotation [2022-04-27 21:39:18,770 WARN L170 areAnnotationChecker]: L18 has no Hoare annotation [2022-04-27 21:39:18,770 WARN L170 areAnnotationChecker]: L18 has no Hoare annotation [2022-04-27 21:39:18,770 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2022-04-27 21:39:18,770 WARN L170 areAnnotationChecker]: L27-1 has no Hoare annotation [2022-04-27 21:39:18,770 WARN L170 areAnnotationChecker]: L27-1 has no Hoare annotation [2022-04-27 21:39:18,770 WARN L170 areAnnotationChecker]: L19 has no Hoare annotation [2022-04-27 21:39:18,770 WARN L170 areAnnotationChecker]: L19 has no Hoare annotation [2022-04-27 21:39:18,770 WARN L170 areAnnotationChecker]: L18-2 has no Hoare annotation [2022-04-27 21:39:18,770 WARN L170 areAnnotationChecker]: L27-3 has no Hoare annotation [2022-04-27 21:39:18,770 WARN L170 areAnnotationChecker]: L27-3 has no Hoare annotation [2022-04-27 21:39:18,770 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-27 21:39:18,770 WARN L170 areAnnotationChecker]: L31 has no Hoare annotation [2022-04-27 21:39:18,770 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2022-04-27 21:39:18,770 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2022-04-27 21:39:18,770 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2022-04-27 21:39:18,770 INFO L163 areAnnotationChecker]: CFG has 5 edges. 5 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2022-04-27 21:39:18,777 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.04 09:39:18 BasicIcfg [2022-04-27 21:39:18,777 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-04-27 21:39:18,777 INFO L158 Benchmark]: Toolchain (without parser) took 3184.25ms. Allocated memory was 198.2MB in the beginning and 275.8MB in the end (delta: 77.6MB). Free memory was 148.6MB in the beginning and 121.9MB in the end (delta: 26.6MB). Peak memory consumption was 104.3MB. Max. memory is 8.0GB. [2022-04-27 21:39:18,778 INFO L158 Benchmark]: CDTParser took 0.10ms. Allocated memory is still 198.2MB. Free memory was 164.5MB in the beginning and 164.4MB in the end (delta: 146.9kB). There was no memory consumed. Max. memory is 8.0GB. [2022-04-27 21:39:18,778 INFO L158 Benchmark]: CACSL2BoogieTranslator took 250.85ms. Allocated memory is still 198.2MB. Free memory was 148.4MB in the beginning and 174.8MB in the end (delta: -26.4MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2022-04-27 21:39:18,778 INFO L158 Benchmark]: Boogie Preprocessor took 18.03ms. Allocated memory is still 198.2MB. Free memory was 174.8MB in the beginning and 173.2MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-04-27 21:39:18,778 INFO L158 Benchmark]: RCFGBuilder took 199.10ms. Allocated memory is still 198.2MB. Free memory was 173.2MB in the beginning and 163.2MB in the end (delta: 10.1MB). Peak memory consumption was 9.4MB. Max. memory is 8.0GB. [2022-04-27 21:39:18,778 INFO L158 Benchmark]: IcfgTransformer took 17.78ms. Allocated memory is still 198.2MB. Free memory was 163.2MB in the beginning and 161.7MB in the end (delta: 1.4MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-04-27 21:39:18,778 INFO L158 Benchmark]: TraceAbstraction took 2685.37ms. Allocated memory was 198.2MB in the beginning and 275.8MB in the end (delta: 77.6MB). Free memory was 161.1MB in the beginning and 121.9MB in the end (delta: 39.1MB). Peak memory consumption was 118.3MB. Max. memory is 8.0GB. [2022-04-27 21:39:18,779 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - AssertionsEnabledResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.10ms. Allocated memory is still 198.2MB. Free memory was 164.5MB in the beginning and 164.4MB in the end (delta: 146.9kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 250.85ms. Allocated memory is still 198.2MB. Free memory was 148.4MB in the beginning and 174.8MB in the end (delta: -26.4MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * Boogie Preprocessor took 18.03ms. Allocated memory is still 198.2MB. Free memory was 174.8MB in the beginning and 173.2MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 199.10ms. Allocated memory is still 198.2MB. Free memory was 173.2MB in the beginning and 163.2MB in the end (delta: 10.1MB). Peak memory consumption was 9.4MB. Max. memory is 8.0GB. * IcfgTransformer took 17.78ms. Allocated memory is still 198.2MB. Free memory was 163.2MB in the beginning and 161.7MB in the end (delta: 1.4MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * TraceAbstraction took 2685.37ms. Allocated memory was 198.2MB in the beginning and 275.8MB in the end (delta: 77.6MB). Free memory was 161.1MB in the beginning and 121.9MB in the end (delta: 39.1MB). Peak memory consumption was 118.3MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 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, 21 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 2.6s, OverallIterations: 4, TraceHistogramMax: 3, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 0.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 72 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 71 mSDsluCounter, 134 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 79 mSDsCounter, 22 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 125 IncrementalHoareTripleChecker+Invalid, 147 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 22 mSolverCounterUnsat, 55 mSDtfsCounter, 125 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 107 GetRequests, 71 SyntacticMatches, 2 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=21occurred in iteration=0, InterpolantAutomatonStates: 23, 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, 10 PreInvPairs, 13 NumberOfFragments, 24 HoareAnnotationTreeSize, 10 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 7 FomulaSimplificationsInter, 24 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.1s InterpolantComputationTime, 94 NumberOfCodeBlocks, 94 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 121 ConstructedInterpolants, 0 QuantifiedInterpolants, 331 SizeOfPredicates, 2 NumberOfNonLiveVariables, 138 ConjunctsInSsa, 14 ConjunctsInUnsatCore, 8 InterpolantComputations, 2 PerfectInterpolantSequences, 0/36 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: 27]: Loop Invariant Derived loop invariant: (0 <= y && 1 <= x) && y <= x RESULT: Ultimate proved your program to be correct! [2022-04-27 21:39:18,801 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...