/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/automizer/LoopAccelerationJordanC.epf -i ../../../trunk/examples/svcomp/loop-invgen/large_const.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-34549b5 [2022-04-07 17:03:04,671 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-07 17:03:04,672 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-07 17:03:04,711 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-07 17:03:04,711 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-07 17:03:04,712 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-07 17:03:04,714 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-07 17:03:04,717 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-07 17:03:04,718 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-07 17:03:04,722 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-07 17:03:04,723 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-07 17:03:04,723 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-07 17:03:04,723 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-07 17:03:04,724 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-07 17:03:04,724 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-07 17:03:04,725 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-07 17:03:04,725 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-07 17:03:04,726 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-07 17:03:04,727 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-07 17:03:04,728 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-07 17:03:04,728 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-07 17:03:04,731 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-07 17:03:04,732 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-07 17:03:04,734 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-07 17:03:04,736 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-07 17:03:04,742 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-07 17:03:04,742 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-07 17:03:04,742 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-07 17:03:04,743 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-07 17:03:04,743 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-07 17:03:04,744 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-07 17:03:04,744 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-07 17:03:04,745 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-07 17:03:04,746 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-07 17:03:04,746 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-07 17:03:04,747 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-07 17:03:04,747 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-07 17:03:04,747 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-07 17:03:04,747 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-07 17:03:04,747 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-07 17:03:04,748 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-07 17:03:04,750 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-07 17:03:04,750 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/LoopAccelerationJordanC.epf [2022-04-07 17:03:04,761 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-07 17:03:04,762 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-07 17:03:04,764 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-07 17:03:04,764 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-07 17:03:04,764 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-07 17:03:04,764 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-07 17:03:04,764 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-07 17:03:04,764 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-07 17:03:04,764 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-07 17:03:04,765 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-07 17:03:04,765 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-07 17:03:04,765 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-07 17:03:04,765 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-07 17:03:04,766 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-07 17:03:04,766 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-07 17:03:04,766 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-07 17:03:04,766 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-07 17:03:04,766 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-07 17:03:04,766 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-07 17:03:04,766 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-07 17:03:04,766 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-04-07 17:03:04,767 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-04-07 17:03:04,767 INFO L138 SettingsManager]: * TransformationType=LOOP_ACCELERATION_JORDAN WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.core: Log level for class -> de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN; [2022-04-07 17:03:04,924 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-07 17:03:04,940 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-07 17:03:04,941 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-07 17:03:04,942 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-07 17:03:04,943 INFO L275 PluginConnector]: CDTParser initialized [2022-04-07 17:03:04,944 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-invgen/large_const.i [2022-04-07 17:03:04,981 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/01f5cae84/a4f1dc057b504e6695c57bdd8e1fa4e9/FLAG90f524ec8 [2022-04-07 17:03:05,356 INFO L306 CDTParser]: Found 1 translation units. [2022-04-07 17:03:05,356 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/large_const.i [2022-04-07 17:03:05,362 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/01f5cae84/a4f1dc057b504e6695c57bdd8e1fa4e9/FLAG90f524ec8 [2022-04-07 17:03:05,372 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/01f5cae84/a4f1dc057b504e6695c57bdd8e1fa4e9 [2022-04-07 17:03:05,373 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-07 17:03:05,374 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-04-07 17:03:05,375 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-07 17:03:05,376 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-07 17:03:05,381 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-07 17:03:05,382 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.04 05:03:05" (1/1) ... [2022-04-07 17:03:05,383 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4c01269b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 05:03:05, skipping insertion in model container [2022-04-07 17:03:05,383 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.04 05:03:05" (1/1) ... [2022-04-07 17:03:05,388 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-07 17:03:05,399 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-07 17:03:05,509 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-invgen/large_const.i[893,906] [2022-04-07 17:03:05,525 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-07 17:03:05,543 INFO L203 MainTranslator]: Completed pre-run [2022-04-07 17:03:05,558 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-invgen/large_const.i[893,906] [2022-04-07 17:03:05,566 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-07 17:03:05,578 INFO L208 MainTranslator]: Completed translation [2022-04-07 17:03:05,578 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 05:03:05 WrapperNode [2022-04-07 17:03:05,578 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-07 17:03:05,579 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-07 17:03:05,579 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-07 17:03:05,579 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-07 17:03:05,587 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 05:03:05" (1/1) ... [2022-04-07 17:03:05,588 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 05:03:05" (1/1) ... [2022-04-07 17:03:05,593 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 05:03:05" (1/1) ... [2022-04-07 17:03:05,593 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 05:03:05" (1/1) ... [2022-04-07 17:03:05,597 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 05:03:05" (1/1) ... [2022-04-07 17:03:05,605 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 05:03:05" (1/1) ... [2022-04-07 17:03:05,607 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 05:03:05" (1/1) ... [2022-04-07 17:03:05,608 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-07 17:03:05,609 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-07 17:03:05,609 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-07 17:03:05,609 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-07 17:03:05,610 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 05:03:05" (1/1) ... [2022-04-07 17:03:05,614 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-07 17:03:05,621 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-07 17:03:05,631 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-04-07 17:03:05,635 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-04-07 17:03:05,656 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-07 17:03:05,656 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-07 17:03:05,656 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-07 17:03:05,656 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-07 17:03:05,657 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-07 17:03:05,657 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-07 17:03:05,657 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-07 17:03:05,657 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-07 17:03:05,657 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_perror_fail [2022-04-07 17:03:05,657 INFO L130 BoogieDeclarations]: Found specification of procedure __assert [2022-04-07 17:03:05,657 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-07 17:03:05,657 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-07 17:03:05,658 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-07 17:03:05,658 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-07 17:03:05,658 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-04-07 17:03:05,659 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-07 17:03:05,659 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-07 17:03:05,659 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-07 17:03:05,659 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-07 17:03:05,660 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-07 17:03:05,660 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-07 17:03:05,660 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-07 17:03:05,706 INFO L234 CfgBuilder]: Building ICFG [2022-04-07 17:03:05,707 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-07 17:03:05,867 INFO L275 CfgBuilder]: Performing block encoding [2022-04-07 17:03:05,872 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-07 17:03:05,872 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-04-07 17:03:05,874 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.04 05:03:05 BoogieIcfgContainer [2022-04-07 17:03:05,874 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-07 17:03:05,874 INFO L113 PluginConnector]: ------------------------IcfgTransformer---------------------------- [2022-04-07 17:03:05,874 INFO L271 PluginConnector]: Initializing IcfgTransformer... [2022-04-07 17:03:05,875 INFO L275 PluginConnector]: IcfgTransformer initialized [2022-04-07 17:03:05,877 INFO L185 PluginConnector]: Executing the observer IcfgTransformationObserver from plugin IcfgTransformer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.04 05:03:05" (1/1) ... [2022-04-07 17:03:05,878 INFO L168 ansformationObserver]: Applying ICFG transformation LOOP_ACCELERATION_JORDAN [2022-04-07 17:03:05,898 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 07.04 05:03:05 BasicIcfg [2022-04-07 17:03:05,898 INFO L132 PluginConnector]: ------------------------ END IcfgTransformer---------------------------- [2022-04-07 17:03:05,900 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-07 17:03:05,900 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-07 17:03:05,901 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-07 17:03:05,901 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.04 05:03:05" (1/4) ... [2022-04-07 17:03:05,902 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1993b464 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.04 05:03:05, skipping insertion in model container [2022-04-07 17:03:05,902 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 05:03:05" (2/4) ... [2022-04-07 17:03:05,902 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1993b464 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.04 05:03:05, skipping insertion in model container [2022-04-07 17:03:05,902 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.04 05:03:05" (3/4) ... [2022-04-07 17:03:05,902 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1993b464 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.04 05:03:05, skipping insertion in model container [2022-04-07 17:03:05,903 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 07.04 05:03:05" (4/4) ... [2022-04-07 17:03:05,903 INFO L111 eAbstractionObserver]: Analyzing ICFG large_const.iJordan [2022-04-07 17:03:05,906 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION [2022-04-07 17:03:05,906 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-07 17:03:05,933 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-07 17:03:05,937 INFO L340 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=ForwardPredicates, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=false, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP [2022-04-07 17:03:05,938 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-07 17:03:05,952 INFO L276 IsEmpty]: Start isEmpty. Operand has 26 states, 18 states have (on average 1.5555555555555556) internal successors, (28), 19 states have internal predecessors, (28), 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-07 17:03:05,957 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-04-07 17:03:05,957 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 17:03:05,957 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-07 17:03:05,958 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 17:03:05,961 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 17:03:05,961 INFO L85 PathProgramCache]: Analyzing trace with hash 1699974766, now seen corresponding path program 1 times [2022-04-07 17:03:05,968 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 17:03:05,968 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [453065903] [2022-04-07 17:03:05,968 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 17:03:05,969 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 17:03:06,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 17:03:06,149 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-07 17:03:06,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 17:03:06,169 INFO L290 TraceCheckUtils]: 0: Hoare triple {37#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [88] 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] {29#true} is VALID [2022-04-07 17:03:06,169 INFO L290 TraceCheckUtils]: 1: Hoare triple {29#true} [91] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {29#true} is VALID [2022-04-07 17:03:06,170 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {29#true} {29#true} [117] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {29#true} is VALID [2022-04-07 17:03:06,171 INFO L272 TraceCheckUtils]: 0: Hoare triple {29#true} [86] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {37#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-07 17:03:06,172 INFO L290 TraceCheckUtils]: 1: Hoare triple {37#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [88] 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] {29#true} is VALID [2022-04-07 17:03:06,172 INFO L290 TraceCheckUtils]: 2: Hoare triple {29#true} [91] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {29#true} is VALID [2022-04-07 17:03:06,172 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {29#true} {29#true} [117] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {29#true} is VALID [2022-04-07 17:03:06,173 INFO L272 TraceCheckUtils]: 4: Hoare triple {29#true} [87] L-1-->mainENTRY: Formula: (and (= |v_main_#in~argv.baseInParam_1| |v_ULTIMATE.start_#in~argv.base_2|) (= |v_main_#in~argcInParam_1| |v_ULTIMATE.start_#in~argc_2|) (= |v_main_#in~argv.offsetInParam_1| |v_ULTIMATE.start_#in~argv.offset_2|)) InVars {ULTIMATE.start_#in~argc=|v_ULTIMATE.start_#in~argc_2|, ULTIMATE.start_#in~argv.offset=|v_ULTIMATE.start_#in~argv.offset_2|, ULTIMATE.start_#in~argv.base=|v_ULTIMATE.start_#in~argv.base_2|} OutVars{main_#in~argv.base=|v_main_#in~argv.baseInParam_1|, main_#in~argc=|v_main_#in~argcInParam_1|, main_#in~argv.offset=|v_main_#in~argv.offsetInParam_1|} AuxVars[] AssignedVars[main_#in~argv.base, main_#in~argv.offset, main_#in~argc, ULTIMATE.start_#in~argc, ULTIMATE.start_#in~argv.offset, ULTIMATE.start_#in~argv.base] {29#true} is VALID [2022-04-07 17:03:06,173 INFO L290 TraceCheckUtils]: 5: Hoare triple {29#true} [90] mainENTRY-->L31: Formula: (and (= 10000 v_main_~c3~0_2) (= v_main_~argv.base_1 |v_main_#in~argv.base_1|) (<= |v_main_#t~nondet1_2| 2147483647) (= v_main_~n~0_2 |v_main_#t~nondet1_2|) (= |v_main_#in~argc_1| v_main_~argc_1) (= 2000 v_main_~c2~0_2) (= 4000 v_main_~c1~0_2) (= v_main_~argv.offset_1 |v_main_#in~argv.offset_1|) (<= 0 (+ |v_main_#t~nondet1_2| 2147483648))) InVars {main_#in~argv.base=|v_main_#in~argv.base_1|, main_#in~argc=|v_main_#in~argc_1|, main_#in~argv.offset=|v_main_#in~argv.offset_1|, main_#t~nondet1=|v_main_#t~nondet1_2|} OutVars{main_~c1~0=v_main_~c1~0_2, main_~v~0=v_main_~v~0_6, main_#in~argv.offset=|v_main_#in~argv.offset_1|, main_~j~0=v_main_~j~0_1, main_~argc=v_main_~argc_1, main_~c2~0=v_main_~c2~0_2, main_#in~argv.base=|v_main_#in~argv.base_1|, main_~k~0=v_main_~k~0_7, main_~i~0=v_main_~i~0_1, main_#in~argc=|v_main_#in~argc_1|, main_~n~0=v_main_~n~0_2, main_~argv.base=v_main_~argv.base_1, main_~c3~0=v_main_~c3~0_2, main_~argv.offset=v_main_~argv.offset_1} AuxVars[] AssignedVars[main_~c1~0, main_~v~0, main_#t~nondet1, main_~k~0, main_~j~0, main_~i~0, main_~n~0, main_~argc, main_~c2~0, main_~argv.base, main_~c3~0, main_~argv.offset] {29#true} is VALID [2022-04-07 17:03:06,174 INFO L290 TraceCheckUtils]: 6: Hoare triple {29#true} [93] L31-->L40-2: Formula: (and (<= 0 v_main_~n~0_5) (= v_main_~i~0_2 0) (< v_main_~n~0_5 10) (= v_main_~k~0_8 0)) InVars {main_~n~0=v_main_~n~0_5} OutVars{main_~i~0=v_main_~i~0_2, main_~n~0=v_main_~n~0_5, main_~k~0=v_main_~k~0_8} AuxVars[] AssignedVars[main_~k~0, main_~i~0] {34#(= main_~i~0 0)} is VALID [2022-04-07 17:03:06,175 INFO L290 TraceCheckUtils]: 7: Hoare triple {34#(= main_~i~0 0)} [96] L40-2-->L34-2: Formula: (not (< v_main_~i~0_3 v_main_~n~0_8)) InVars {main_~i~0=v_main_~i~0_3, main_~n~0=v_main_~n~0_8} OutVars{main_~i~0=v_main_~i~0_3, main_~n~0=v_main_~n~0_8} AuxVars[] AssignedVars[] {35#(<= main_~n~0 0)} is VALID [2022-04-07 17:03:06,175 INFO L290 TraceCheckUtils]: 8: Hoare triple {35#(<= main_~n~0 0)} [98] L34-2-->L46-2: Formula: (= v_main_~j~0_2 0) InVars {} OutVars{main_~j~0=v_main_~j~0_2} AuxVars[] AssignedVars[main_~j~0] {36#(and (= main_~j~0 0) (<= main_~n~0 0))} is VALID [2022-04-07 17:03:06,177 INFO L290 TraceCheckUtils]: 9: Hoare triple {36#(and (= main_~j~0 0) (<= main_~n~0 0))} [103] L46-2-->L47: Formula: (< v_main_~j~0_4 v_main_~n~0_7) InVars {main_~j~0=v_main_~j~0_4, main_~n~0=v_main_~n~0_7} OutVars{main_~j~0=v_main_~j~0_4, main_~n~0=v_main_~n~0_7} AuxVars[] AssignedVars[] {30#false} is VALID [2022-04-07 17:03:06,177 INFO L272 TraceCheckUtils]: 10: Hoare triple {30#false} [107] L47-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (< 0 v_main_~k~0_12) 1 0)) InVars {main_~k~0=v_main_~k~0_12} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~k~0] {30#false} is VALID [2022-04-07 17:03:06,178 INFO L290 TraceCheckUtils]: 11: Hoare triple {30#false} [111] __VERIFIER_assertENTRY-->L18: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {30#false} is VALID [2022-04-07 17:03:06,178 INFO L290 TraceCheckUtils]: 12: Hoare triple {30#false} [112] L18-->L19: Formula: (= v___VERIFIER_assert_~cond_2 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {30#false} is VALID [2022-04-07 17:03:06,179 INFO L290 TraceCheckUtils]: 13: Hoare triple {30#false} [114] L19-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {30#false} is VALID [2022-04-07 17:03:06,179 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-07 17:03:06,180 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 17:03:06,180 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [453065903] [2022-04-07 17:03:06,181 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [453065903] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-07 17:03:06,181 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-07 17:03:06,181 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-07 17:03:06,183 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1245751539] [2022-04-07 17:03:06,184 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-07 17:03:06,187 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 5 states have internal predecessors, (10), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 14 [2022-04-07 17:03:06,189 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 17:03:06,192 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 5 states have internal predecessors, (10), 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-07 17:03:06,209 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 14 edges. 14 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 17:03:06,210 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-07 17:03:06,210 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 17:03:06,226 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-07 17:03:06,226 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-04-07 17:03:06,229 INFO L87 Difference]: Start difference. First operand has 26 states, 18 states have (on average 1.5555555555555556) internal successors, (28), 19 states have internal predecessors, (28), 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 6 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 5 states have internal predecessors, (10), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 17:03:06,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 17:03:06,454 INFO L93 Difference]: Finished difference Result 32 states and 38 transitions. [2022-04-07 17:03:06,455 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-07 17:03:06,455 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 5 states have internal predecessors, (10), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 14 [2022-04-07 17:03:06,455 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 17:03:06,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 5 states have internal predecessors, (10), 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-07 17:03:06,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 44 transitions. [2022-04-07 17:03:06,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 5 states have internal predecessors, (10), 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-07 17:03:06,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 44 transitions. [2022-04-07 17:03:06,470 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 44 transitions. [2022-04-07 17:03:06,509 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 44 edges. 44 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 17:03:06,517 INFO L225 Difference]: With dead ends: 32 [2022-04-07 17:03:06,517 INFO L226 Difference]: Without dead ends: 22 [2022-04-07 17:03:06,519 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2022-04-07 17:03:06,521 INFO L913 BasicCegarLoop]: 29 mSDtfsCounter, 38 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 44 SdHoareTripleChecker+Invalid, 62 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 59 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-07 17:03:06,522 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [39 Valid, 44 Invalid, 62 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 59 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-07 17:03:06,533 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2022-04-07 17:03:06,544 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2022-04-07 17:03:06,544 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 17:03:06,544 INFO L82 GeneralOperation]: Start isEquivalent. First operand 22 states. Second operand has 22 states, 16 states have (on average 1.25) internal successors, (20), 16 states have internal predecessors, (20), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-07 17:03:06,545 INFO L74 IsIncluded]: Start isIncluded. First operand 22 states. Second operand has 22 states, 16 states have (on average 1.25) internal successors, (20), 16 states have internal predecessors, (20), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-07 17:03:06,546 INFO L87 Difference]: Start difference. First operand 22 states. Second operand has 22 states, 16 states have (on average 1.25) internal successors, (20), 16 states have internal predecessors, (20), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-07 17:03:06,548 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 17:03:06,548 INFO L93 Difference]: Finished difference Result 22 states and 25 transitions. [2022-04-07 17:03:06,549 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 25 transitions. [2022-04-07 17:03:06,549 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 17:03:06,549 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 17:03:06,549 INFO L74 IsIncluded]: Start isIncluded. First operand has 22 states, 16 states have (on average 1.25) internal successors, (20), 16 states have internal predecessors, (20), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 22 states. [2022-04-07 17:03:06,550 INFO L87 Difference]: Start difference. First operand has 22 states, 16 states have (on average 1.25) internal successors, (20), 16 states have internal predecessors, (20), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 22 states. [2022-04-07 17:03:06,555 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 17:03:06,556 INFO L93 Difference]: Finished difference Result 22 states and 25 transitions. [2022-04-07 17:03:06,556 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 25 transitions. [2022-04-07 17:03:06,556 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 17:03:06,556 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 17:03:06,556 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 17:03:06,557 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 17:03:06,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 16 states have (on average 1.25) internal successors, (20), 16 states have internal predecessors, (20), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-07 17:03:06,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 25 transitions. [2022-04-07 17:03:06,560 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 25 transitions. Word has length 14 [2022-04-07 17:03:06,560 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 17:03:06,561 INFO L478 AbstractCegarLoop]: Abstraction has 22 states and 25 transitions. [2022-04-07 17:03:06,562 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 5 states have internal predecessors, (10), 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-07 17:03:06,562 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 25 transitions. [2022-04-07 17:03:06,562 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-04-07 17:03:06,562 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 17:03:06,562 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-07 17:03:06,563 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-07 17:03:06,563 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 17:03:06,563 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 17:03:06,564 INFO L85 PathProgramCache]: Analyzing trace with hash -1632940157, now seen corresponding path program 1 times [2022-04-07 17:03:06,564 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 17:03:06,564 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2051155826] [2022-04-07 17:03:06,564 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 17:03:06,564 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 17:03:06,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 17:03:06,657 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-07 17:03:06,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 17:03:06,680 INFO L290 TraceCheckUtils]: 0: Hoare triple {154#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [88] 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] {144#true} is VALID [2022-04-07 17:03:06,680 INFO L290 TraceCheckUtils]: 1: Hoare triple {144#true} [91] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {144#true} is VALID [2022-04-07 17:03:06,680 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {144#true} {144#true} [117] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {144#true} is VALID [2022-04-07 17:03:06,681 INFO L272 TraceCheckUtils]: 0: Hoare triple {144#true} [86] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {154#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-07 17:03:06,681 INFO L290 TraceCheckUtils]: 1: Hoare triple {154#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [88] 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] {144#true} is VALID [2022-04-07 17:03:06,681 INFO L290 TraceCheckUtils]: 2: Hoare triple {144#true} [91] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {144#true} is VALID [2022-04-07 17:03:06,681 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {144#true} {144#true} [117] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {144#true} is VALID [2022-04-07 17:03:06,682 INFO L272 TraceCheckUtils]: 4: Hoare triple {144#true} [87] L-1-->mainENTRY: Formula: (and (= |v_main_#in~argv.baseInParam_1| |v_ULTIMATE.start_#in~argv.base_2|) (= |v_main_#in~argcInParam_1| |v_ULTIMATE.start_#in~argc_2|) (= |v_main_#in~argv.offsetInParam_1| |v_ULTIMATE.start_#in~argv.offset_2|)) InVars {ULTIMATE.start_#in~argc=|v_ULTIMATE.start_#in~argc_2|, ULTIMATE.start_#in~argv.offset=|v_ULTIMATE.start_#in~argv.offset_2|, ULTIMATE.start_#in~argv.base=|v_ULTIMATE.start_#in~argv.base_2|} OutVars{main_#in~argv.base=|v_main_#in~argv.baseInParam_1|, main_#in~argc=|v_main_#in~argcInParam_1|, main_#in~argv.offset=|v_main_#in~argv.offsetInParam_1|} AuxVars[] AssignedVars[main_#in~argv.base, main_#in~argv.offset, main_#in~argc, ULTIMATE.start_#in~argc, ULTIMATE.start_#in~argv.offset, ULTIMATE.start_#in~argv.base] {144#true} is VALID [2022-04-07 17:03:06,682 INFO L290 TraceCheckUtils]: 5: Hoare triple {144#true} [90] mainENTRY-->L31: Formula: (and (= 10000 v_main_~c3~0_2) (= v_main_~argv.base_1 |v_main_#in~argv.base_1|) (<= |v_main_#t~nondet1_2| 2147483647) (= v_main_~n~0_2 |v_main_#t~nondet1_2|) (= |v_main_#in~argc_1| v_main_~argc_1) (= 2000 v_main_~c2~0_2) (= 4000 v_main_~c1~0_2) (= v_main_~argv.offset_1 |v_main_#in~argv.offset_1|) (<= 0 (+ |v_main_#t~nondet1_2| 2147483648))) InVars {main_#in~argv.base=|v_main_#in~argv.base_1|, main_#in~argc=|v_main_#in~argc_1|, main_#in~argv.offset=|v_main_#in~argv.offset_1|, main_#t~nondet1=|v_main_#t~nondet1_2|} OutVars{main_~c1~0=v_main_~c1~0_2, main_~v~0=v_main_~v~0_6, main_#in~argv.offset=|v_main_#in~argv.offset_1|, main_~j~0=v_main_~j~0_1, main_~argc=v_main_~argc_1, main_~c2~0=v_main_~c2~0_2, main_#in~argv.base=|v_main_#in~argv.base_1|, main_~k~0=v_main_~k~0_7, main_~i~0=v_main_~i~0_1, main_#in~argc=|v_main_#in~argc_1|, main_~n~0=v_main_~n~0_2, main_~argv.base=v_main_~argv.base_1, main_~c3~0=v_main_~c3~0_2, main_~argv.offset=v_main_~argv.offset_1} AuxVars[] AssignedVars[main_~c1~0, main_~v~0, main_#t~nondet1, main_~k~0, main_~j~0, main_~i~0, main_~n~0, main_~argc, main_~c2~0, main_~argv.base, main_~c3~0, main_~argv.offset] {149#(<= 4000 main_~c1~0)} is VALID [2022-04-07 17:03:06,683 INFO L290 TraceCheckUtils]: 6: Hoare triple {149#(<= 4000 main_~c1~0)} [93] L31-->L40-2: Formula: (and (<= 0 v_main_~n~0_5) (= v_main_~i~0_2 0) (< v_main_~n~0_5 10) (= v_main_~k~0_8 0)) InVars {main_~n~0=v_main_~n~0_5} OutVars{main_~i~0=v_main_~i~0_2, main_~n~0=v_main_~n~0_5, main_~k~0=v_main_~k~0_8} AuxVars[] AssignedVars[main_~k~0, main_~i~0] {150#(and (= main_~k~0 0) (<= 4000 main_~c1~0))} is VALID [2022-04-07 17:03:06,683 INFO L290 TraceCheckUtils]: 7: Hoare triple {150#(and (= main_~k~0 0) (<= 4000 main_~c1~0))} [97] L40-2-->L37: Formula: (and (< v_main_~i~0_5 v_main_~n~0_9) (<= |v_main_#t~nondet3_2| 2147483647) (= v_main_~v~0_7 |v_main_#t~nondet3_2|) (= v_main_~i~0_4 (+ v_main_~i~0_5 1)) (<= 0 (+ |v_main_#t~nondet3_2| 2147483648))) InVars {main_~i~0=v_main_~i~0_5, main_~n~0=v_main_~n~0_9, main_#t~nondet3=|v_main_#t~nondet3_2|} OutVars{main_~i~0=v_main_~i~0_4, main_~v~0=v_main_~v~0_7, main_#t~post2=|v_main_#t~post2_1|, main_~n~0=v_main_~n~0_9} AuxVars[] AssignedVars[main_~v~0, main_#t~nondet3, main_~i~0, main_#t~post2] {150#(and (= main_~k~0 0) (<= 4000 main_~c1~0))} is VALID [2022-04-07 17:03:06,684 INFO L290 TraceCheckUtils]: 8: Hoare triple {150#(and (= main_~k~0 0) (<= 4000 main_~c1~0))} [100] L37-->L38: Formula: (and (<= 0 v_main_~v~0_1) (< v_main_~n~0_1 2)) InVars {main_~v~0=v_main_~v~0_1, main_~n~0=v_main_~n~0_1} OutVars{main_~v~0=v_main_~v~0_1, main_~n~0=v_main_~n~0_1} AuxVars[] AssignedVars[] {150#(and (= main_~k~0 0) (<= 4000 main_~c1~0))} is VALID [2022-04-07 17:03:06,684 INFO L290 TraceCheckUtils]: 9: Hoare triple {150#(and (= main_~k~0 0) (<= 4000 main_~c1~0))} [104] L38-->L40-2: Formula: (and (= v_main_~v~0_2 0) (= v_main_~k~0_1 (+ v_main_~k~0_2 v_main_~c1~0_1))) InVars {main_~c1~0=v_main_~c1~0_1, main_~v~0=v_main_~v~0_2, main_~k~0=v_main_~k~0_2} OutVars{main_~c1~0=v_main_~c1~0_1, main_~v~0=v_main_~v~0_2, main_~k~0=v_main_~k~0_1} AuxVars[] AssignedVars[main_~k~0] {151#(<= 4000 main_~k~0)} is VALID [2022-04-07 17:03:06,685 INFO L290 TraceCheckUtils]: 10: Hoare triple {151#(<= 4000 main_~k~0)} [96] L40-2-->L34-2: Formula: (not (< v_main_~i~0_3 v_main_~n~0_8)) InVars {main_~i~0=v_main_~i~0_3, main_~n~0=v_main_~n~0_8} OutVars{main_~i~0=v_main_~i~0_3, main_~n~0=v_main_~n~0_8} AuxVars[] AssignedVars[] {151#(<= 4000 main_~k~0)} is VALID [2022-04-07 17:03:06,685 INFO L290 TraceCheckUtils]: 11: Hoare triple {151#(<= 4000 main_~k~0)} [98] L34-2-->L46-2: Formula: (= v_main_~j~0_2 0) InVars {} OutVars{main_~j~0=v_main_~j~0_2} AuxVars[] AssignedVars[main_~j~0] {151#(<= 4000 main_~k~0)} is VALID [2022-04-07 17:03:06,685 INFO L290 TraceCheckUtils]: 12: Hoare triple {151#(<= 4000 main_~k~0)} [103] L46-2-->L47: Formula: (< v_main_~j~0_4 v_main_~n~0_7) InVars {main_~j~0=v_main_~j~0_4, main_~n~0=v_main_~n~0_7} OutVars{main_~j~0=v_main_~j~0_4, main_~n~0=v_main_~n~0_7} AuxVars[] AssignedVars[] {151#(<= 4000 main_~k~0)} is VALID [2022-04-07 17:03:06,686 INFO L272 TraceCheckUtils]: 13: Hoare triple {151#(<= 4000 main_~k~0)} [107] L47-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (< 0 v_main_~k~0_12) 1 0)) InVars {main_~k~0=v_main_~k~0_12} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~k~0] {152#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-07 17:03:06,686 INFO L290 TraceCheckUtils]: 14: Hoare triple {152#(not (= |__VERIFIER_assert_#in~cond| 0))} [111] __VERIFIER_assertENTRY-->L18: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {153#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-07 17:03:06,687 INFO L290 TraceCheckUtils]: 15: Hoare triple {153#(not (= __VERIFIER_assert_~cond 0))} [112] L18-->L19: Formula: (= v___VERIFIER_assert_~cond_2 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {145#false} is VALID [2022-04-07 17:03:06,687 INFO L290 TraceCheckUtils]: 16: Hoare triple {145#false} [114] L19-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {145#false} is VALID [2022-04-07 17:03:06,687 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-07 17:03:06,687 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 17:03:06,688 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2051155826] [2022-04-07 17:03:06,688 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2051155826] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-07 17:03:06,688 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1842673886] [2022-04-07 17:03:06,688 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 17:03:06,688 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 17:03:06,688 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-07 17:03:06,689 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-07 17:03:06,690 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-04-07 17:03:06,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 17:03:06,732 INFO L263 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 6 conjunts are in the unsatisfiable core [2022-04-07 17:03:06,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 17:03:06,744 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-07 17:03:06,919 INFO L272 TraceCheckUtils]: 0: Hoare triple {144#true} [86] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {144#true} is VALID [2022-04-07 17:03:06,919 INFO L290 TraceCheckUtils]: 1: Hoare triple {144#true} [88] 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] {144#true} is VALID [2022-04-07 17:03:06,920 INFO L290 TraceCheckUtils]: 2: Hoare triple {144#true} [91] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {144#true} is VALID [2022-04-07 17:03:06,920 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {144#true} {144#true} [117] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {144#true} is VALID [2022-04-07 17:03:06,921 INFO L272 TraceCheckUtils]: 4: Hoare triple {144#true} [87] L-1-->mainENTRY: Formula: (and (= |v_main_#in~argv.baseInParam_1| |v_ULTIMATE.start_#in~argv.base_2|) (= |v_main_#in~argcInParam_1| |v_ULTIMATE.start_#in~argc_2|) (= |v_main_#in~argv.offsetInParam_1| |v_ULTIMATE.start_#in~argv.offset_2|)) InVars {ULTIMATE.start_#in~argc=|v_ULTIMATE.start_#in~argc_2|, ULTIMATE.start_#in~argv.offset=|v_ULTIMATE.start_#in~argv.offset_2|, ULTIMATE.start_#in~argv.base=|v_ULTIMATE.start_#in~argv.base_2|} OutVars{main_#in~argv.base=|v_main_#in~argv.baseInParam_1|, main_#in~argc=|v_main_#in~argcInParam_1|, main_#in~argv.offset=|v_main_#in~argv.offsetInParam_1|} AuxVars[] AssignedVars[main_#in~argv.base, main_#in~argv.offset, main_#in~argc, ULTIMATE.start_#in~argc, ULTIMATE.start_#in~argv.offset, ULTIMATE.start_#in~argv.base] {144#true} is VALID [2022-04-07 17:03:06,921 INFO L290 TraceCheckUtils]: 5: Hoare triple {144#true} [90] mainENTRY-->L31: Formula: (and (= 10000 v_main_~c3~0_2) (= v_main_~argv.base_1 |v_main_#in~argv.base_1|) (<= |v_main_#t~nondet1_2| 2147483647) (= v_main_~n~0_2 |v_main_#t~nondet1_2|) (= |v_main_#in~argc_1| v_main_~argc_1) (= 2000 v_main_~c2~0_2) (= 4000 v_main_~c1~0_2) (= v_main_~argv.offset_1 |v_main_#in~argv.offset_1|) (<= 0 (+ |v_main_#t~nondet1_2| 2147483648))) InVars {main_#in~argv.base=|v_main_#in~argv.base_1|, main_#in~argc=|v_main_#in~argc_1|, main_#in~argv.offset=|v_main_#in~argv.offset_1|, main_#t~nondet1=|v_main_#t~nondet1_2|} OutVars{main_~c1~0=v_main_~c1~0_2, main_~v~0=v_main_~v~0_6, main_#in~argv.offset=|v_main_#in~argv.offset_1|, main_~j~0=v_main_~j~0_1, main_~argc=v_main_~argc_1, main_~c2~0=v_main_~c2~0_2, main_#in~argv.base=|v_main_#in~argv.base_1|, main_~k~0=v_main_~k~0_7, main_~i~0=v_main_~i~0_1, main_#in~argc=|v_main_#in~argc_1|, main_~n~0=v_main_~n~0_2, main_~argv.base=v_main_~argv.base_1, main_~c3~0=v_main_~c3~0_2, main_~argv.offset=v_main_~argv.offset_1} AuxVars[] AssignedVars[main_~c1~0, main_~v~0, main_#t~nondet1, main_~k~0, main_~j~0, main_~i~0, main_~n~0, main_~argc, main_~c2~0, main_~argv.base, main_~c3~0, main_~argv.offset] {149#(<= 4000 main_~c1~0)} is VALID [2022-04-07 17:03:06,922 INFO L290 TraceCheckUtils]: 6: Hoare triple {149#(<= 4000 main_~c1~0)} [93] L31-->L40-2: Formula: (and (<= 0 v_main_~n~0_5) (= v_main_~i~0_2 0) (< v_main_~n~0_5 10) (= v_main_~k~0_8 0)) InVars {main_~n~0=v_main_~n~0_5} OutVars{main_~i~0=v_main_~i~0_2, main_~n~0=v_main_~n~0_5, main_~k~0=v_main_~k~0_8} AuxVars[] AssignedVars[main_~k~0, main_~i~0] {176#(and (<= 0 main_~k~0) (<= 4000 main_~c1~0))} is VALID [2022-04-07 17:03:06,922 INFO L290 TraceCheckUtils]: 7: Hoare triple {176#(and (<= 0 main_~k~0) (<= 4000 main_~c1~0))} [97] L40-2-->L37: Formula: (and (< v_main_~i~0_5 v_main_~n~0_9) (<= |v_main_#t~nondet3_2| 2147483647) (= v_main_~v~0_7 |v_main_#t~nondet3_2|) (= v_main_~i~0_4 (+ v_main_~i~0_5 1)) (<= 0 (+ |v_main_#t~nondet3_2| 2147483648))) InVars {main_~i~0=v_main_~i~0_5, main_~n~0=v_main_~n~0_9, main_#t~nondet3=|v_main_#t~nondet3_2|} OutVars{main_~i~0=v_main_~i~0_4, main_~v~0=v_main_~v~0_7, main_#t~post2=|v_main_#t~post2_1|, main_~n~0=v_main_~n~0_9} AuxVars[] AssignedVars[main_~v~0, main_#t~nondet3, main_~i~0, main_#t~post2] {176#(and (<= 0 main_~k~0) (<= 4000 main_~c1~0))} is VALID [2022-04-07 17:03:06,923 INFO L290 TraceCheckUtils]: 8: Hoare triple {176#(and (<= 0 main_~k~0) (<= 4000 main_~c1~0))} [100] L37-->L38: Formula: (and (<= 0 v_main_~v~0_1) (< v_main_~n~0_1 2)) InVars {main_~v~0=v_main_~v~0_1, main_~n~0=v_main_~n~0_1} OutVars{main_~v~0=v_main_~v~0_1, main_~n~0=v_main_~n~0_1} AuxVars[] AssignedVars[] {176#(and (<= 0 main_~k~0) (<= 4000 main_~c1~0))} is VALID [2022-04-07 17:03:06,923 INFO L290 TraceCheckUtils]: 9: Hoare triple {176#(and (<= 0 main_~k~0) (<= 4000 main_~c1~0))} [104] L38-->L40-2: Formula: (and (= v_main_~v~0_2 0) (= v_main_~k~0_1 (+ v_main_~k~0_2 v_main_~c1~0_1))) InVars {main_~c1~0=v_main_~c1~0_1, main_~v~0=v_main_~v~0_2, main_~k~0=v_main_~k~0_2} OutVars{main_~c1~0=v_main_~c1~0_1, main_~v~0=v_main_~v~0_2, main_~k~0=v_main_~k~0_1} AuxVars[] AssignedVars[main_~k~0] {151#(<= 4000 main_~k~0)} is VALID [2022-04-07 17:03:06,924 INFO L290 TraceCheckUtils]: 10: Hoare triple {151#(<= 4000 main_~k~0)} [96] L40-2-->L34-2: Formula: (not (< v_main_~i~0_3 v_main_~n~0_8)) InVars {main_~i~0=v_main_~i~0_3, main_~n~0=v_main_~n~0_8} OutVars{main_~i~0=v_main_~i~0_3, main_~n~0=v_main_~n~0_8} AuxVars[] AssignedVars[] {151#(<= 4000 main_~k~0)} is VALID [2022-04-07 17:03:06,924 INFO L290 TraceCheckUtils]: 11: Hoare triple {151#(<= 4000 main_~k~0)} [98] L34-2-->L46-2: Formula: (= v_main_~j~0_2 0) InVars {} OutVars{main_~j~0=v_main_~j~0_2} AuxVars[] AssignedVars[main_~j~0] {151#(<= 4000 main_~k~0)} is VALID [2022-04-07 17:03:06,927 INFO L290 TraceCheckUtils]: 12: Hoare triple {151#(<= 4000 main_~k~0)} [103] L46-2-->L47: Formula: (< v_main_~j~0_4 v_main_~n~0_7) InVars {main_~j~0=v_main_~j~0_4, main_~n~0=v_main_~n~0_7} OutVars{main_~j~0=v_main_~j~0_4, main_~n~0=v_main_~n~0_7} AuxVars[] AssignedVars[] {151#(<= 4000 main_~k~0)} is VALID [2022-04-07 17:03:06,928 INFO L272 TraceCheckUtils]: 13: Hoare triple {151#(<= 4000 main_~k~0)} [107] L47-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (< 0 v_main_~k~0_12) 1 0)) InVars {main_~k~0=v_main_~k~0_12} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~k~0] {198#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-07 17:03:06,928 INFO L290 TraceCheckUtils]: 14: Hoare triple {198#(<= 1 |__VERIFIER_assert_#in~cond|)} [111] __VERIFIER_assertENTRY-->L18: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {202#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-07 17:03:06,928 INFO L290 TraceCheckUtils]: 15: Hoare triple {202#(<= 1 __VERIFIER_assert_~cond)} [112] L18-->L19: Formula: (= v___VERIFIER_assert_~cond_2 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {145#false} is VALID [2022-04-07 17:03:06,929 INFO L290 TraceCheckUtils]: 16: Hoare triple {145#false} [114] L19-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {145#false} is VALID [2022-04-07 17:03:06,929 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-07 17:03:06,929 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-07 17:03:07,060 INFO L290 TraceCheckUtils]: 16: Hoare triple {145#false} [114] L19-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {145#false} is VALID [2022-04-07 17:03:07,061 INFO L290 TraceCheckUtils]: 15: Hoare triple {202#(<= 1 __VERIFIER_assert_~cond)} [112] L18-->L19: Formula: (= v___VERIFIER_assert_~cond_2 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {145#false} is VALID [2022-04-07 17:03:07,061 INFO L290 TraceCheckUtils]: 14: Hoare triple {198#(<= 1 |__VERIFIER_assert_#in~cond|)} [111] __VERIFIER_assertENTRY-->L18: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {202#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-07 17:03:07,062 INFO L272 TraceCheckUtils]: 13: Hoare triple {218#(< 0 main_~k~0)} [107] L47-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (< 0 v_main_~k~0_12) 1 0)) InVars {main_~k~0=v_main_~k~0_12} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~k~0] {198#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-07 17:03:07,062 INFO L290 TraceCheckUtils]: 12: Hoare triple {218#(< 0 main_~k~0)} [103] L46-2-->L47: Formula: (< v_main_~j~0_4 v_main_~n~0_7) InVars {main_~j~0=v_main_~j~0_4, main_~n~0=v_main_~n~0_7} OutVars{main_~j~0=v_main_~j~0_4, main_~n~0=v_main_~n~0_7} AuxVars[] AssignedVars[] {218#(< 0 main_~k~0)} is VALID [2022-04-07 17:03:07,063 INFO L290 TraceCheckUtils]: 11: Hoare triple {218#(< 0 main_~k~0)} [98] L34-2-->L46-2: Formula: (= v_main_~j~0_2 0) InVars {} OutVars{main_~j~0=v_main_~j~0_2} AuxVars[] AssignedVars[main_~j~0] {218#(< 0 main_~k~0)} is VALID [2022-04-07 17:03:07,063 INFO L290 TraceCheckUtils]: 10: Hoare triple {218#(< 0 main_~k~0)} [96] L40-2-->L34-2: Formula: (not (< v_main_~i~0_3 v_main_~n~0_8)) InVars {main_~i~0=v_main_~i~0_3, main_~n~0=v_main_~n~0_8} OutVars{main_~i~0=v_main_~i~0_3, main_~n~0=v_main_~n~0_8} AuxVars[] AssignedVars[] {218#(< 0 main_~k~0)} is VALID [2022-04-07 17:03:07,064 INFO L290 TraceCheckUtils]: 9: Hoare triple {231#(< 0 (+ main_~k~0 main_~c1~0))} [104] L38-->L40-2: Formula: (and (= v_main_~v~0_2 0) (= v_main_~k~0_1 (+ v_main_~k~0_2 v_main_~c1~0_1))) InVars {main_~c1~0=v_main_~c1~0_1, main_~v~0=v_main_~v~0_2, main_~k~0=v_main_~k~0_2} OutVars{main_~c1~0=v_main_~c1~0_1, main_~v~0=v_main_~v~0_2, main_~k~0=v_main_~k~0_1} AuxVars[] AssignedVars[main_~k~0] {218#(< 0 main_~k~0)} is VALID [2022-04-07 17:03:07,064 INFO L290 TraceCheckUtils]: 8: Hoare triple {231#(< 0 (+ main_~k~0 main_~c1~0))} [100] L37-->L38: Formula: (and (<= 0 v_main_~v~0_1) (< v_main_~n~0_1 2)) InVars {main_~v~0=v_main_~v~0_1, main_~n~0=v_main_~n~0_1} OutVars{main_~v~0=v_main_~v~0_1, main_~n~0=v_main_~n~0_1} AuxVars[] AssignedVars[] {231#(< 0 (+ main_~k~0 main_~c1~0))} is VALID [2022-04-07 17:03:07,065 INFO L290 TraceCheckUtils]: 7: Hoare triple {231#(< 0 (+ main_~k~0 main_~c1~0))} [97] L40-2-->L37: Formula: (and (< v_main_~i~0_5 v_main_~n~0_9) (<= |v_main_#t~nondet3_2| 2147483647) (= v_main_~v~0_7 |v_main_#t~nondet3_2|) (= v_main_~i~0_4 (+ v_main_~i~0_5 1)) (<= 0 (+ |v_main_#t~nondet3_2| 2147483648))) InVars {main_~i~0=v_main_~i~0_5, main_~n~0=v_main_~n~0_9, main_#t~nondet3=|v_main_#t~nondet3_2|} OutVars{main_~i~0=v_main_~i~0_4, main_~v~0=v_main_~v~0_7, main_#t~post2=|v_main_#t~post2_1|, main_~n~0=v_main_~n~0_9} AuxVars[] AssignedVars[main_~v~0, main_#t~nondet3, main_~i~0, main_#t~post2] {231#(< 0 (+ main_~k~0 main_~c1~0))} is VALID [2022-04-07 17:03:07,065 INFO L290 TraceCheckUtils]: 6: Hoare triple {241#(< 0 main_~c1~0)} [93] L31-->L40-2: Formula: (and (<= 0 v_main_~n~0_5) (= v_main_~i~0_2 0) (< v_main_~n~0_5 10) (= v_main_~k~0_8 0)) InVars {main_~n~0=v_main_~n~0_5} OutVars{main_~i~0=v_main_~i~0_2, main_~n~0=v_main_~n~0_5, main_~k~0=v_main_~k~0_8} AuxVars[] AssignedVars[main_~k~0, main_~i~0] {231#(< 0 (+ main_~k~0 main_~c1~0))} is VALID [2022-04-07 17:03:07,066 INFO L290 TraceCheckUtils]: 5: Hoare triple {144#true} [90] mainENTRY-->L31: Formula: (and (= 10000 v_main_~c3~0_2) (= v_main_~argv.base_1 |v_main_#in~argv.base_1|) (<= |v_main_#t~nondet1_2| 2147483647) (= v_main_~n~0_2 |v_main_#t~nondet1_2|) (= |v_main_#in~argc_1| v_main_~argc_1) (= 2000 v_main_~c2~0_2) (= 4000 v_main_~c1~0_2) (= v_main_~argv.offset_1 |v_main_#in~argv.offset_1|) (<= 0 (+ |v_main_#t~nondet1_2| 2147483648))) InVars {main_#in~argv.base=|v_main_#in~argv.base_1|, main_#in~argc=|v_main_#in~argc_1|, main_#in~argv.offset=|v_main_#in~argv.offset_1|, main_#t~nondet1=|v_main_#t~nondet1_2|} OutVars{main_~c1~0=v_main_~c1~0_2, main_~v~0=v_main_~v~0_6, main_#in~argv.offset=|v_main_#in~argv.offset_1|, main_~j~0=v_main_~j~0_1, main_~argc=v_main_~argc_1, main_~c2~0=v_main_~c2~0_2, main_#in~argv.base=|v_main_#in~argv.base_1|, main_~k~0=v_main_~k~0_7, main_~i~0=v_main_~i~0_1, main_#in~argc=|v_main_#in~argc_1|, main_~n~0=v_main_~n~0_2, main_~argv.base=v_main_~argv.base_1, main_~c3~0=v_main_~c3~0_2, main_~argv.offset=v_main_~argv.offset_1} AuxVars[] AssignedVars[main_~c1~0, main_~v~0, main_#t~nondet1, main_~k~0, main_~j~0, main_~i~0, main_~n~0, main_~argc, main_~c2~0, main_~argv.base, main_~c3~0, main_~argv.offset] {241#(< 0 main_~c1~0)} is VALID [2022-04-07 17:03:07,066 INFO L272 TraceCheckUtils]: 4: Hoare triple {144#true} [87] L-1-->mainENTRY: Formula: (and (= |v_main_#in~argv.baseInParam_1| |v_ULTIMATE.start_#in~argv.base_2|) (= |v_main_#in~argcInParam_1| |v_ULTIMATE.start_#in~argc_2|) (= |v_main_#in~argv.offsetInParam_1| |v_ULTIMATE.start_#in~argv.offset_2|)) InVars {ULTIMATE.start_#in~argc=|v_ULTIMATE.start_#in~argc_2|, ULTIMATE.start_#in~argv.offset=|v_ULTIMATE.start_#in~argv.offset_2|, ULTIMATE.start_#in~argv.base=|v_ULTIMATE.start_#in~argv.base_2|} OutVars{main_#in~argv.base=|v_main_#in~argv.baseInParam_1|, main_#in~argc=|v_main_#in~argcInParam_1|, main_#in~argv.offset=|v_main_#in~argv.offsetInParam_1|} AuxVars[] AssignedVars[main_#in~argv.base, main_#in~argv.offset, main_#in~argc, ULTIMATE.start_#in~argc, ULTIMATE.start_#in~argv.offset, ULTIMATE.start_#in~argv.base] {144#true} is VALID [2022-04-07 17:03:07,066 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {144#true} {144#true} [117] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {144#true} is VALID [2022-04-07 17:03:07,066 INFO L290 TraceCheckUtils]: 2: Hoare triple {144#true} [91] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {144#true} is VALID [2022-04-07 17:03:07,066 INFO L290 TraceCheckUtils]: 1: Hoare triple {144#true} [88] 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] {144#true} is VALID [2022-04-07 17:03:07,066 INFO L272 TraceCheckUtils]: 0: Hoare triple {144#true} [86] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {144#true} is VALID [2022-04-07 17:03:07,067 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-07 17:03:07,067 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1842673886] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-07 17:03:07,067 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-07 17:03:07,067 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 14 [2022-04-07 17:03:07,068 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1042944128] [2022-04-07 17:03:07,068 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-07 17:03:07,069 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 2.0) internal successors, (28), 11 states have internal predecessors, (28), 3 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 17 [2022-04-07 17:03:07,069 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 17:03:07,069 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 14 states, 14 states have (on average 2.0) internal successors, (28), 11 states have internal predecessors, (28), 3 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 17:03:07,090 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 35 edges. 35 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 17:03:07,090 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-04-07 17:03:07,090 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 17:03:07,091 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-04-07 17:03:07,091 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=146, Unknown=0, NotChecked=0, Total=182 [2022-04-07 17:03:07,091 INFO L87 Difference]: Start difference. First operand 22 states and 25 transitions. Second operand has 14 states, 14 states have (on average 2.0) internal successors, (28), 11 states have internal predecessors, (28), 3 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 17:03:07,713 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 17:03:07,713 INFO L93 Difference]: Finished difference Result 46 states and 57 transitions. [2022-04-07 17:03:07,713 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-04-07 17:03:07,714 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 2.0) internal successors, (28), 11 states have internal predecessors, (28), 3 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 17 [2022-04-07 17:03:07,714 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 17:03:07,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 2.0) internal successors, (28), 11 states have internal predecessors, (28), 3 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 17:03:07,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 58 transitions. [2022-04-07 17:03:07,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 2.0) internal successors, (28), 11 states have internal predecessors, (28), 3 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 17:03:07,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 58 transitions. [2022-04-07 17:03:07,727 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 12 states and 58 transitions. [2022-04-07 17:03:07,788 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 58 edges. 58 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 17:03:07,790 INFO L225 Difference]: With dead ends: 46 [2022-04-07 17:03:07,790 INFO L226 Difference]: Without dead ends: 46 [2022-04-07 17:03:07,790 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 29 SyntacticMatches, 1 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 82 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=110, Invalid=396, Unknown=0, NotChecked=0, Total=506 [2022-04-07 17:03:07,791 INFO L913 BasicCegarLoop]: 20 mSDtfsCounter, 96 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 196 mSolverCounterSat, 60 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 96 SdHoareTripleChecker+Valid, 57 SdHoareTripleChecker+Invalid, 256 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 60 IncrementalHoareTripleChecker+Valid, 196 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-07 17:03:07,791 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [96 Valid, 57 Invalid, 256 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [60 Valid, 196 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-07 17:03:07,792 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2022-04-07 17:03:07,795 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 35. [2022-04-07 17:03:07,795 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 17:03:07,795 INFO L82 GeneralOperation]: Start isEquivalent. First operand 46 states. Second operand has 35 states, 26 states have (on average 1.2307692307692308) internal successors, (32), 27 states have internal predecessors, (32), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-07 17:03:07,795 INFO L74 IsIncluded]: Start isIncluded. First operand 46 states. Second operand has 35 states, 26 states have (on average 1.2307692307692308) internal successors, (32), 27 states have internal predecessors, (32), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-07 17:03:07,796 INFO L87 Difference]: Start difference. First operand 46 states. Second operand has 35 states, 26 states have (on average 1.2307692307692308) internal successors, (32), 27 states have internal predecessors, (32), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-07 17:03:07,798 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 17:03:07,798 INFO L93 Difference]: Finished difference Result 46 states and 57 transitions. [2022-04-07 17:03:07,798 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 57 transitions. [2022-04-07 17:03:07,799 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 17:03:07,799 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 17:03:07,799 INFO L74 IsIncluded]: Start isIncluded. First operand has 35 states, 26 states have (on average 1.2307692307692308) internal successors, (32), 27 states have internal predecessors, (32), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) Second operand 46 states. [2022-04-07 17:03:07,800 INFO L87 Difference]: Start difference. First operand has 35 states, 26 states have (on average 1.2307692307692308) internal successors, (32), 27 states have internal predecessors, (32), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) Second operand 46 states. [2022-04-07 17:03:07,810 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 17:03:07,811 INFO L93 Difference]: Finished difference Result 46 states and 57 transitions. [2022-04-07 17:03:07,811 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 57 transitions. [2022-04-07 17:03:07,811 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 17:03:07,811 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 17:03:07,811 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 17:03:07,811 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 17:03:07,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 26 states have (on average 1.2307692307692308) internal successors, (32), 27 states have internal predecessors, (32), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-07 17:03:07,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 41 transitions. [2022-04-07 17:03:07,813 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 41 transitions. Word has length 17 [2022-04-07 17:03:07,813 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 17:03:07,813 INFO L478 AbstractCegarLoop]: Abstraction has 35 states and 41 transitions. [2022-04-07 17:03:07,813 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 2.0) internal successors, (28), 11 states have internal predecessors, (28), 3 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 17:03:07,813 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 41 transitions. [2022-04-07 17:03:07,814 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-04-07 17:03:07,814 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 17:03:07,814 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-07 17:03:07,832 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-04-07 17:03:08,018 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 17:03:08,018 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 17:03:08,019 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 17:03:08,019 INFO L85 PathProgramCache]: Analyzing trace with hash 922895784, now seen corresponding path program 1 times [2022-04-07 17:03:08,019 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 17:03:08,019 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [148379879] [2022-04-07 17:03:08,019 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 17:03:08,019 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 17:03:08,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 17:03:08,076 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-07 17:03:08,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 17:03:08,091 INFO L290 TraceCheckUtils]: 0: Hoare triple {463#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [88] 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] {453#true} is VALID [2022-04-07 17:03:08,091 INFO L290 TraceCheckUtils]: 1: Hoare triple {453#true} [91] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {453#true} is VALID [2022-04-07 17:03:08,092 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {453#true} {453#true} [117] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {453#true} is VALID [2022-04-07 17:03:08,095 INFO L272 TraceCheckUtils]: 0: Hoare triple {453#true} [86] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {463#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-07 17:03:08,096 INFO L290 TraceCheckUtils]: 1: Hoare triple {463#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [88] 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] {453#true} is VALID [2022-04-07 17:03:08,096 INFO L290 TraceCheckUtils]: 2: Hoare triple {453#true} [91] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {453#true} is VALID [2022-04-07 17:03:08,096 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {453#true} {453#true} [117] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {453#true} is VALID [2022-04-07 17:03:08,096 INFO L272 TraceCheckUtils]: 4: Hoare triple {453#true} [87] L-1-->mainENTRY: Formula: (and (= |v_main_#in~argv.baseInParam_1| |v_ULTIMATE.start_#in~argv.base_2|) (= |v_main_#in~argcInParam_1| |v_ULTIMATE.start_#in~argc_2|) (= |v_main_#in~argv.offsetInParam_1| |v_ULTIMATE.start_#in~argv.offset_2|)) InVars {ULTIMATE.start_#in~argc=|v_ULTIMATE.start_#in~argc_2|, ULTIMATE.start_#in~argv.offset=|v_ULTIMATE.start_#in~argv.offset_2|, ULTIMATE.start_#in~argv.base=|v_ULTIMATE.start_#in~argv.base_2|} OutVars{main_#in~argv.base=|v_main_#in~argv.baseInParam_1|, main_#in~argc=|v_main_#in~argcInParam_1|, main_#in~argv.offset=|v_main_#in~argv.offsetInParam_1|} AuxVars[] AssignedVars[main_#in~argv.base, main_#in~argv.offset, main_#in~argc, ULTIMATE.start_#in~argc, ULTIMATE.start_#in~argv.offset, ULTIMATE.start_#in~argv.base] {453#true} is VALID [2022-04-07 17:03:08,097 INFO L290 TraceCheckUtils]: 5: Hoare triple {453#true} [90] mainENTRY-->L31: Formula: (and (= 10000 v_main_~c3~0_2) (= v_main_~argv.base_1 |v_main_#in~argv.base_1|) (<= |v_main_#t~nondet1_2| 2147483647) (= v_main_~n~0_2 |v_main_#t~nondet1_2|) (= |v_main_#in~argc_1| v_main_~argc_1) (= 2000 v_main_~c2~0_2) (= 4000 v_main_~c1~0_2) (= v_main_~argv.offset_1 |v_main_#in~argv.offset_1|) (<= 0 (+ |v_main_#t~nondet1_2| 2147483648))) InVars {main_#in~argv.base=|v_main_#in~argv.base_1|, main_#in~argc=|v_main_#in~argc_1|, main_#in~argv.offset=|v_main_#in~argv.offset_1|, main_#t~nondet1=|v_main_#t~nondet1_2|} OutVars{main_~c1~0=v_main_~c1~0_2, main_~v~0=v_main_~v~0_6, main_#in~argv.offset=|v_main_#in~argv.offset_1|, main_~j~0=v_main_~j~0_1, main_~argc=v_main_~argc_1, main_~c2~0=v_main_~c2~0_2, main_#in~argv.base=|v_main_#in~argv.base_1|, main_~k~0=v_main_~k~0_7, main_~i~0=v_main_~i~0_1, main_#in~argc=|v_main_#in~argc_1|, main_~n~0=v_main_~n~0_2, main_~argv.base=v_main_~argv.base_1, main_~c3~0=v_main_~c3~0_2, main_~argv.offset=v_main_~argv.offset_1} AuxVars[] AssignedVars[main_~c1~0, main_~v~0, main_#t~nondet1, main_~k~0, main_~j~0, main_~i~0, main_~n~0, main_~argc, main_~c2~0, main_~argv.base, main_~c3~0, main_~argv.offset] {458#(<= 2000 main_~c2~0)} is VALID [2022-04-07 17:03:08,097 INFO L290 TraceCheckUtils]: 6: Hoare triple {458#(<= 2000 main_~c2~0)} [93] L31-->L40-2: Formula: (and (<= 0 v_main_~n~0_5) (= v_main_~i~0_2 0) (< v_main_~n~0_5 10) (= v_main_~k~0_8 0)) InVars {main_~n~0=v_main_~n~0_5} OutVars{main_~i~0=v_main_~i~0_2, main_~n~0=v_main_~n~0_5, main_~k~0=v_main_~k~0_8} AuxVars[] AssignedVars[main_~k~0, main_~i~0] {459#(and (= main_~k~0 0) (<= 2000 main_~c2~0))} is VALID [2022-04-07 17:03:08,097 INFO L290 TraceCheckUtils]: 7: Hoare triple {459#(and (= main_~k~0 0) (<= 2000 main_~c2~0))} [97] L40-2-->L37: Formula: (and (< v_main_~i~0_5 v_main_~n~0_9) (<= |v_main_#t~nondet3_2| 2147483647) (= v_main_~v~0_7 |v_main_#t~nondet3_2|) (= v_main_~i~0_4 (+ v_main_~i~0_5 1)) (<= 0 (+ |v_main_#t~nondet3_2| 2147483648))) InVars {main_~i~0=v_main_~i~0_5, main_~n~0=v_main_~n~0_9, main_#t~nondet3=|v_main_#t~nondet3_2|} OutVars{main_~i~0=v_main_~i~0_4, main_~v~0=v_main_~v~0_7, main_#t~post2=|v_main_#t~post2_1|, main_~n~0=v_main_~n~0_9} AuxVars[] AssignedVars[main_~v~0, main_#t~nondet3, main_~i~0, main_#t~post2] {459#(and (= main_~k~0 0) (<= 2000 main_~c2~0))} is VALID [2022-04-07 17:03:08,098 INFO L290 TraceCheckUtils]: 8: Hoare triple {459#(and (= main_~k~0 0) (<= 2000 main_~c2~0))} [100] L37-->L38: Formula: (and (<= 0 v_main_~v~0_1) (< v_main_~n~0_1 2)) InVars {main_~v~0=v_main_~v~0_1, main_~n~0=v_main_~n~0_1} OutVars{main_~v~0=v_main_~v~0_1, main_~n~0=v_main_~n~0_1} AuxVars[] AssignedVars[] {459#(and (= main_~k~0 0) (<= 2000 main_~c2~0))} is VALID [2022-04-07 17:03:08,098 INFO L290 TraceCheckUtils]: 9: Hoare triple {459#(and (= main_~k~0 0) (<= 2000 main_~c2~0))} [105] L38-->L40: Formula: (not (= v_main_~v~0_3 0)) InVars {main_~v~0=v_main_~v~0_3} OutVars{main_~v~0=v_main_~v~0_3} AuxVars[] AssignedVars[] {459#(and (= main_~k~0 0) (<= 2000 main_~c2~0))} is VALID [2022-04-07 17:03:08,099 INFO L290 TraceCheckUtils]: 10: Hoare triple {459#(and (= main_~k~0 0) (<= 2000 main_~c2~0))} [108] L40-->L40-2: Formula: (and (= v_main_~k~0_3 (+ v_main_~k~0_4 v_main_~c2~0_1)) (= v_main_~v~0_4 1)) InVars {main_~v~0=v_main_~v~0_4, main_~c2~0=v_main_~c2~0_1, main_~k~0=v_main_~k~0_4} OutVars{main_~v~0=v_main_~v~0_4, main_~c2~0=v_main_~c2~0_1, main_~k~0=v_main_~k~0_3} AuxVars[] AssignedVars[main_~k~0] {460#(<= 2000 main_~k~0)} is VALID [2022-04-07 17:03:08,099 INFO L290 TraceCheckUtils]: 11: Hoare triple {460#(<= 2000 main_~k~0)} [96] L40-2-->L34-2: Formula: (not (< v_main_~i~0_3 v_main_~n~0_8)) InVars {main_~i~0=v_main_~i~0_3, main_~n~0=v_main_~n~0_8} OutVars{main_~i~0=v_main_~i~0_3, main_~n~0=v_main_~n~0_8} AuxVars[] AssignedVars[] {460#(<= 2000 main_~k~0)} is VALID [2022-04-07 17:03:08,099 INFO L290 TraceCheckUtils]: 12: Hoare triple {460#(<= 2000 main_~k~0)} [98] L34-2-->L46-2: Formula: (= v_main_~j~0_2 0) InVars {} OutVars{main_~j~0=v_main_~j~0_2} AuxVars[] AssignedVars[main_~j~0] {460#(<= 2000 main_~k~0)} is VALID [2022-04-07 17:03:08,100 INFO L290 TraceCheckUtils]: 13: Hoare triple {460#(<= 2000 main_~k~0)} [103] L46-2-->L47: Formula: (< v_main_~j~0_4 v_main_~n~0_7) InVars {main_~j~0=v_main_~j~0_4, main_~n~0=v_main_~n~0_7} OutVars{main_~j~0=v_main_~j~0_4, main_~n~0=v_main_~n~0_7} AuxVars[] AssignedVars[] {460#(<= 2000 main_~k~0)} is VALID [2022-04-07 17:03:08,100 INFO L272 TraceCheckUtils]: 14: Hoare triple {460#(<= 2000 main_~k~0)} [107] L47-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (< 0 v_main_~k~0_12) 1 0)) InVars {main_~k~0=v_main_~k~0_12} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~k~0] {461#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-07 17:03:08,101 INFO L290 TraceCheckUtils]: 15: Hoare triple {461#(not (= |__VERIFIER_assert_#in~cond| 0))} [111] __VERIFIER_assertENTRY-->L18: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {462#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-07 17:03:08,101 INFO L290 TraceCheckUtils]: 16: Hoare triple {462#(not (= __VERIFIER_assert_~cond 0))} [112] L18-->L19: Formula: (= v___VERIFIER_assert_~cond_2 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {454#false} is VALID [2022-04-07 17:03:08,101 INFO L290 TraceCheckUtils]: 17: Hoare triple {454#false} [114] L19-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {454#false} is VALID [2022-04-07 17:03:08,102 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-07 17:03:08,102 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 17:03:08,102 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [148379879] [2022-04-07 17:03:08,102 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [148379879] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-07 17:03:08,102 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [144397032] [2022-04-07 17:03:08,102 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 17:03:08,102 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 17:03:08,102 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-07 17:03:08,103 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-07 17:03:08,104 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-07 17:03:08,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 17:03:08,141 INFO L263 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 6 conjunts are in the unsatisfiable core [2022-04-07 17:03:08,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 17:03:08,148 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-07 17:03:08,286 INFO L272 TraceCheckUtils]: 0: Hoare triple {453#true} [86] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {453#true} is VALID [2022-04-07 17:03:08,286 INFO L290 TraceCheckUtils]: 1: Hoare triple {453#true} [88] 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] {453#true} is VALID [2022-04-07 17:03:08,286 INFO L290 TraceCheckUtils]: 2: Hoare triple {453#true} [91] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {453#true} is VALID [2022-04-07 17:03:08,286 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {453#true} {453#true} [117] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {453#true} is VALID [2022-04-07 17:03:08,287 INFO L272 TraceCheckUtils]: 4: Hoare triple {453#true} [87] L-1-->mainENTRY: Formula: (and (= |v_main_#in~argv.baseInParam_1| |v_ULTIMATE.start_#in~argv.base_2|) (= |v_main_#in~argcInParam_1| |v_ULTIMATE.start_#in~argc_2|) (= |v_main_#in~argv.offsetInParam_1| |v_ULTIMATE.start_#in~argv.offset_2|)) InVars {ULTIMATE.start_#in~argc=|v_ULTIMATE.start_#in~argc_2|, ULTIMATE.start_#in~argv.offset=|v_ULTIMATE.start_#in~argv.offset_2|, ULTIMATE.start_#in~argv.base=|v_ULTIMATE.start_#in~argv.base_2|} OutVars{main_#in~argv.base=|v_main_#in~argv.baseInParam_1|, main_#in~argc=|v_main_#in~argcInParam_1|, main_#in~argv.offset=|v_main_#in~argv.offsetInParam_1|} AuxVars[] AssignedVars[main_#in~argv.base, main_#in~argv.offset, main_#in~argc, ULTIMATE.start_#in~argc, ULTIMATE.start_#in~argv.offset, ULTIMATE.start_#in~argv.base] {453#true} is VALID [2022-04-07 17:03:08,287 INFO L290 TraceCheckUtils]: 5: Hoare triple {453#true} [90] mainENTRY-->L31: Formula: (and (= 10000 v_main_~c3~0_2) (= v_main_~argv.base_1 |v_main_#in~argv.base_1|) (<= |v_main_#t~nondet1_2| 2147483647) (= v_main_~n~0_2 |v_main_#t~nondet1_2|) (= |v_main_#in~argc_1| v_main_~argc_1) (= 2000 v_main_~c2~0_2) (= 4000 v_main_~c1~0_2) (= v_main_~argv.offset_1 |v_main_#in~argv.offset_1|) (<= 0 (+ |v_main_#t~nondet1_2| 2147483648))) InVars {main_#in~argv.base=|v_main_#in~argv.base_1|, main_#in~argc=|v_main_#in~argc_1|, main_#in~argv.offset=|v_main_#in~argv.offset_1|, main_#t~nondet1=|v_main_#t~nondet1_2|} OutVars{main_~c1~0=v_main_~c1~0_2, main_~v~0=v_main_~v~0_6, main_#in~argv.offset=|v_main_#in~argv.offset_1|, main_~j~0=v_main_~j~0_1, main_~argc=v_main_~argc_1, main_~c2~0=v_main_~c2~0_2, main_#in~argv.base=|v_main_#in~argv.base_1|, main_~k~0=v_main_~k~0_7, main_~i~0=v_main_~i~0_1, main_#in~argc=|v_main_#in~argc_1|, main_~n~0=v_main_~n~0_2, main_~argv.base=v_main_~argv.base_1, main_~c3~0=v_main_~c3~0_2, main_~argv.offset=v_main_~argv.offset_1} AuxVars[] AssignedVars[main_~c1~0, main_~v~0, main_#t~nondet1, main_~k~0, main_~j~0, main_~i~0, main_~n~0, main_~argc, main_~c2~0, main_~argv.base, main_~c3~0, main_~argv.offset] {458#(<= 2000 main_~c2~0)} is VALID [2022-04-07 17:03:08,288 INFO L290 TraceCheckUtils]: 6: Hoare triple {458#(<= 2000 main_~c2~0)} [93] L31-->L40-2: Formula: (and (<= 0 v_main_~n~0_5) (= v_main_~i~0_2 0) (< v_main_~n~0_5 10) (= v_main_~k~0_8 0)) InVars {main_~n~0=v_main_~n~0_5} OutVars{main_~i~0=v_main_~i~0_2, main_~n~0=v_main_~n~0_5, main_~k~0=v_main_~k~0_8} AuxVars[] AssignedVars[main_~k~0, main_~i~0] {485#(and (<= 0 main_~k~0) (<= 2000 main_~c2~0))} is VALID [2022-04-07 17:03:08,288 INFO L290 TraceCheckUtils]: 7: Hoare triple {485#(and (<= 0 main_~k~0) (<= 2000 main_~c2~0))} [97] L40-2-->L37: Formula: (and (< v_main_~i~0_5 v_main_~n~0_9) (<= |v_main_#t~nondet3_2| 2147483647) (= v_main_~v~0_7 |v_main_#t~nondet3_2|) (= v_main_~i~0_4 (+ v_main_~i~0_5 1)) (<= 0 (+ |v_main_#t~nondet3_2| 2147483648))) InVars {main_~i~0=v_main_~i~0_5, main_~n~0=v_main_~n~0_9, main_#t~nondet3=|v_main_#t~nondet3_2|} OutVars{main_~i~0=v_main_~i~0_4, main_~v~0=v_main_~v~0_7, main_#t~post2=|v_main_#t~post2_1|, main_~n~0=v_main_~n~0_9} AuxVars[] AssignedVars[main_~v~0, main_#t~nondet3, main_~i~0, main_#t~post2] {485#(and (<= 0 main_~k~0) (<= 2000 main_~c2~0))} is VALID [2022-04-07 17:03:08,288 INFO L290 TraceCheckUtils]: 8: Hoare triple {485#(and (<= 0 main_~k~0) (<= 2000 main_~c2~0))} [100] L37-->L38: Formula: (and (<= 0 v_main_~v~0_1) (< v_main_~n~0_1 2)) InVars {main_~v~0=v_main_~v~0_1, main_~n~0=v_main_~n~0_1} OutVars{main_~v~0=v_main_~v~0_1, main_~n~0=v_main_~n~0_1} AuxVars[] AssignedVars[] {485#(and (<= 0 main_~k~0) (<= 2000 main_~c2~0))} is VALID [2022-04-07 17:03:08,289 INFO L290 TraceCheckUtils]: 9: Hoare triple {485#(and (<= 0 main_~k~0) (<= 2000 main_~c2~0))} [105] L38-->L40: Formula: (not (= v_main_~v~0_3 0)) InVars {main_~v~0=v_main_~v~0_3} OutVars{main_~v~0=v_main_~v~0_3} AuxVars[] AssignedVars[] {485#(and (<= 0 main_~k~0) (<= 2000 main_~c2~0))} is VALID [2022-04-07 17:03:08,289 INFO L290 TraceCheckUtils]: 10: Hoare triple {485#(and (<= 0 main_~k~0) (<= 2000 main_~c2~0))} [108] L40-->L40-2: Formula: (and (= v_main_~k~0_3 (+ v_main_~k~0_4 v_main_~c2~0_1)) (= v_main_~v~0_4 1)) InVars {main_~v~0=v_main_~v~0_4, main_~c2~0=v_main_~c2~0_1, main_~k~0=v_main_~k~0_4} OutVars{main_~v~0=v_main_~v~0_4, main_~c2~0=v_main_~c2~0_1, main_~k~0=v_main_~k~0_3} AuxVars[] AssignedVars[main_~k~0] {460#(<= 2000 main_~k~0)} is VALID [2022-04-07 17:03:08,290 INFO L290 TraceCheckUtils]: 11: Hoare triple {460#(<= 2000 main_~k~0)} [96] L40-2-->L34-2: Formula: (not (< v_main_~i~0_3 v_main_~n~0_8)) InVars {main_~i~0=v_main_~i~0_3, main_~n~0=v_main_~n~0_8} OutVars{main_~i~0=v_main_~i~0_3, main_~n~0=v_main_~n~0_8} AuxVars[] AssignedVars[] {460#(<= 2000 main_~k~0)} is VALID [2022-04-07 17:03:08,292 INFO L290 TraceCheckUtils]: 12: Hoare triple {460#(<= 2000 main_~k~0)} [98] L34-2-->L46-2: Formula: (= v_main_~j~0_2 0) InVars {} OutVars{main_~j~0=v_main_~j~0_2} AuxVars[] AssignedVars[main_~j~0] {460#(<= 2000 main_~k~0)} is VALID [2022-04-07 17:03:08,292 INFO L290 TraceCheckUtils]: 13: Hoare triple {460#(<= 2000 main_~k~0)} [103] L46-2-->L47: Formula: (< v_main_~j~0_4 v_main_~n~0_7) InVars {main_~j~0=v_main_~j~0_4, main_~n~0=v_main_~n~0_7} OutVars{main_~j~0=v_main_~j~0_4, main_~n~0=v_main_~n~0_7} AuxVars[] AssignedVars[] {460#(<= 2000 main_~k~0)} is VALID [2022-04-07 17:03:08,293 INFO L272 TraceCheckUtils]: 14: Hoare triple {460#(<= 2000 main_~k~0)} [107] L47-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (< 0 v_main_~k~0_12) 1 0)) InVars {main_~k~0=v_main_~k~0_12} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~k~0] {510#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-07 17:03:08,293 INFO L290 TraceCheckUtils]: 15: Hoare triple {510#(<= 1 |__VERIFIER_assert_#in~cond|)} [111] __VERIFIER_assertENTRY-->L18: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {514#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-07 17:03:08,293 INFO L290 TraceCheckUtils]: 16: Hoare triple {514#(<= 1 __VERIFIER_assert_~cond)} [112] L18-->L19: Formula: (= v___VERIFIER_assert_~cond_2 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {454#false} is VALID [2022-04-07 17:03:08,294 INFO L290 TraceCheckUtils]: 17: Hoare triple {454#false} [114] L19-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {454#false} is VALID [2022-04-07 17:03:08,294 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-07 17:03:08,294 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-07 17:03:08,413 INFO L290 TraceCheckUtils]: 17: Hoare triple {454#false} [114] L19-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {454#false} is VALID [2022-04-07 17:03:08,414 INFO L290 TraceCheckUtils]: 16: Hoare triple {514#(<= 1 __VERIFIER_assert_~cond)} [112] L18-->L19: Formula: (= v___VERIFIER_assert_~cond_2 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {454#false} is VALID [2022-04-07 17:03:08,415 INFO L290 TraceCheckUtils]: 15: Hoare triple {510#(<= 1 |__VERIFIER_assert_#in~cond|)} [111] __VERIFIER_assertENTRY-->L18: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {514#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-07 17:03:08,416 INFO L272 TraceCheckUtils]: 14: Hoare triple {530#(< 0 main_~k~0)} [107] L47-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (< 0 v_main_~k~0_12) 1 0)) InVars {main_~k~0=v_main_~k~0_12} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~k~0] {510#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-07 17:03:08,416 INFO L290 TraceCheckUtils]: 13: Hoare triple {530#(< 0 main_~k~0)} [103] L46-2-->L47: Formula: (< v_main_~j~0_4 v_main_~n~0_7) InVars {main_~j~0=v_main_~j~0_4, main_~n~0=v_main_~n~0_7} OutVars{main_~j~0=v_main_~j~0_4, main_~n~0=v_main_~n~0_7} AuxVars[] AssignedVars[] {530#(< 0 main_~k~0)} is VALID [2022-04-07 17:03:08,417 INFO L290 TraceCheckUtils]: 12: Hoare triple {530#(< 0 main_~k~0)} [98] L34-2-->L46-2: Formula: (= v_main_~j~0_2 0) InVars {} OutVars{main_~j~0=v_main_~j~0_2} AuxVars[] AssignedVars[main_~j~0] {530#(< 0 main_~k~0)} is VALID [2022-04-07 17:03:08,418 INFO L290 TraceCheckUtils]: 11: Hoare triple {530#(< 0 main_~k~0)} [96] L40-2-->L34-2: Formula: (not (< v_main_~i~0_3 v_main_~n~0_8)) InVars {main_~i~0=v_main_~i~0_3, main_~n~0=v_main_~n~0_8} OutVars{main_~i~0=v_main_~i~0_3, main_~n~0=v_main_~n~0_8} AuxVars[] AssignedVars[] {530#(< 0 main_~k~0)} is VALID [2022-04-07 17:03:08,419 INFO L290 TraceCheckUtils]: 10: Hoare triple {543#(< 0 (+ main_~k~0 main_~c2~0))} [108] L40-->L40-2: Formula: (and (= v_main_~k~0_3 (+ v_main_~k~0_4 v_main_~c2~0_1)) (= v_main_~v~0_4 1)) InVars {main_~v~0=v_main_~v~0_4, main_~c2~0=v_main_~c2~0_1, main_~k~0=v_main_~k~0_4} OutVars{main_~v~0=v_main_~v~0_4, main_~c2~0=v_main_~c2~0_1, main_~k~0=v_main_~k~0_3} AuxVars[] AssignedVars[main_~k~0] {530#(< 0 main_~k~0)} is VALID [2022-04-07 17:03:08,420 INFO L290 TraceCheckUtils]: 9: Hoare triple {543#(< 0 (+ main_~k~0 main_~c2~0))} [105] L38-->L40: Formula: (not (= v_main_~v~0_3 0)) InVars {main_~v~0=v_main_~v~0_3} OutVars{main_~v~0=v_main_~v~0_3} AuxVars[] AssignedVars[] {543#(< 0 (+ main_~k~0 main_~c2~0))} is VALID [2022-04-07 17:03:08,421 INFO L290 TraceCheckUtils]: 8: Hoare triple {543#(< 0 (+ main_~k~0 main_~c2~0))} [100] L37-->L38: Formula: (and (<= 0 v_main_~v~0_1) (< v_main_~n~0_1 2)) InVars {main_~v~0=v_main_~v~0_1, main_~n~0=v_main_~n~0_1} OutVars{main_~v~0=v_main_~v~0_1, main_~n~0=v_main_~n~0_1} AuxVars[] AssignedVars[] {543#(< 0 (+ main_~k~0 main_~c2~0))} is VALID [2022-04-07 17:03:08,431 INFO L290 TraceCheckUtils]: 7: Hoare triple {543#(< 0 (+ main_~k~0 main_~c2~0))} [97] L40-2-->L37: Formula: (and (< v_main_~i~0_5 v_main_~n~0_9) (<= |v_main_#t~nondet3_2| 2147483647) (= v_main_~v~0_7 |v_main_#t~nondet3_2|) (= v_main_~i~0_4 (+ v_main_~i~0_5 1)) (<= 0 (+ |v_main_#t~nondet3_2| 2147483648))) InVars {main_~i~0=v_main_~i~0_5, main_~n~0=v_main_~n~0_9, main_#t~nondet3=|v_main_#t~nondet3_2|} OutVars{main_~i~0=v_main_~i~0_4, main_~v~0=v_main_~v~0_7, main_#t~post2=|v_main_#t~post2_1|, main_~n~0=v_main_~n~0_9} AuxVars[] AssignedVars[main_~v~0, main_#t~nondet3, main_~i~0, main_#t~post2] {543#(< 0 (+ main_~k~0 main_~c2~0))} is VALID [2022-04-07 17:03:08,433 INFO L290 TraceCheckUtils]: 6: Hoare triple {556#(< 0 main_~c2~0)} [93] L31-->L40-2: Formula: (and (<= 0 v_main_~n~0_5) (= v_main_~i~0_2 0) (< v_main_~n~0_5 10) (= v_main_~k~0_8 0)) InVars {main_~n~0=v_main_~n~0_5} OutVars{main_~i~0=v_main_~i~0_2, main_~n~0=v_main_~n~0_5, main_~k~0=v_main_~k~0_8} AuxVars[] AssignedVars[main_~k~0, main_~i~0] {543#(< 0 (+ main_~k~0 main_~c2~0))} is VALID [2022-04-07 17:03:08,434 INFO L290 TraceCheckUtils]: 5: Hoare triple {453#true} [90] mainENTRY-->L31: Formula: (and (= 10000 v_main_~c3~0_2) (= v_main_~argv.base_1 |v_main_#in~argv.base_1|) (<= |v_main_#t~nondet1_2| 2147483647) (= v_main_~n~0_2 |v_main_#t~nondet1_2|) (= |v_main_#in~argc_1| v_main_~argc_1) (= 2000 v_main_~c2~0_2) (= 4000 v_main_~c1~0_2) (= v_main_~argv.offset_1 |v_main_#in~argv.offset_1|) (<= 0 (+ |v_main_#t~nondet1_2| 2147483648))) InVars {main_#in~argv.base=|v_main_#in~argv.base_1|, main_#in~argc=|v_main_#in~argc_1|, main_#in~argv.offset=|v_main_#in~argv.offset_1|, main_#t~nondet1=|v_main_#t~nondet1_2|} OutVars{main_~c1~0=v_main_~c1~0_2, main_~v~0=v_main_~v~0_6, main_#in~argv.offset=|v_main_#in~argv.offset_1|, main_~j~0=v_main_~j~0_1, main_~argc=v_main_~argc_1, main_~c2~0=v_main_~c2~0_2, main_#in~argv.base=|v_main_#in~argv.base_1|, main_~k~0=v_main_~k~0_7, main_~i~0=v_main_~i~0_1, main_#in~argc=|v_main_#in~argc_1|, main_~n~0=v_main_~n~0_2, main_~argv.base=v_main_~argv.base_1, main_~c3~0=v_main_~c3~0_2, main_~argv.offset=v_main_~argv.offset_1} AuxVars[] AssignedVars[main_~c1~0, main_~v~0, main_#t~nondet1, main_~k~0, main_~j~0, main_~i~0, main_~n~0, main_~argc, main_~c2~0, main_~argv.base, main_~c3~0, main_~argv.offset] {556#(< 0 main_~c2~0)} is VALID [2022-04-07 17:03:08,434 INFO L272 TraceCheckUtils]: 4: Hoare triple {453#true} [87] L-1-->mainENTRY: Formula: (and (= |v_main_#in~argv.baseInParam_1| |v_ULTIMATE.start_#in~argv.base_2|) (= |v_main_#in~argcInParam_1| |v_ULTIMATE.start_#in~argc_2|) (= |v_main_#in~argv.offsetInParam_1| |v_ULTIMATE.start_#in~argv.offset_2|)) InVars {ULTIMATE.start_#in~argc=|v_ULTIMATE.start_#in~argc_2|, ULTIMATE.start_#in~argv.offset=|v_ULTIMATE.start_#in~argv.offset_2|, ULTIMATE.start_#in~argv.base=|v_ULTIMATE.start_#in~argv.base_2|} OutVars{main_#in~argv.base=|v_main_#in~argv.baseInParam_1|, main_#in~argc=|v_main_#in~argcInParam_1|, main_#in~argv.offset=|v_main_#in~argv.offsetInParam_1|} AuxVars[] AssignedVars[main_#in~argv.base, main_#in~argv.offset, main_#in~argc, ULTIMATE.start_#in~argc, ULTIMATE.start_#in~argv.offset, ULTIMATE.start_#in~argv.base] {453#true} is VALID [2022-04-07 17:03:08,434 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {453#true} {453#true} [117] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {453#true} is VALID [2022-04-07 17:03:08,434 INFO L290 TraceCheckUtils]: 2: Hoare triple {453#true} [91] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {453#true} is VALID [2022-04-07 17:03:08,434 INFO L290 TraceCheckUtils]: 1: Hoare triple {453#true} [88] 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] {453#true} is VALID [2022-04-07 17:03:08,434 INFO L272 TraceCheckUtils]: 0: Hoare triple {453#true} [86] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {453#true} is VALID [2022-04-07 17:03:08,435 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-07 17:03:08,435 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [144397032] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-07 17:03:08,435 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-07 17:03:08,435 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 14 [2022-04-07 17:03:08,435 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2101670847] [2022-04-07 17:03:08,435 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-07 17:03:08,436 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 2.2142857142857144) internal successors, (31), 11 states have internal predecessors, (31), 3 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 18 [2022-04-07 17:03:08,436 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 17:03:08,436 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 14 states, 14 states have (on average 2.2142857142857144) internal successors, (31), 11 states have internal predecessors, (31), 3 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 17:03:08,476 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 38 edges. 38 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 17:03:08,476 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-04-07 17:03:08,476 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 17:03:08,477 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-04-07 17:03:08,477 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=146, Unknown=0, NotChecked=0, Total=182 [2022-04-07 17:03:08,477 INFO L87 Difference]: Start difference. First operand 35 states and 41 transitions. Second operand has 14 states, 14 states have (on average 2.2142857142857144) internal successors, (31), 11 states have internal predecessors, (31), 3 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 17:03:08,971 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 17:03:08,972 INFO L93 Difference]: Finished difference Result 59 states and 73 transitions. [2022-04-07 17:03:08,972 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-04-07 17:03:08,972 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 2.2142857142857144) internal successors, (31), 11 states have internal predecessors, (31), 3 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 18 [2022-04-07 17:03:08,972 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 17:03:08,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 2.2142857142857144) internal successors, (31), 11 states have internal predecessors, (31), 3 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 17:03:08,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 58 transitions. [2022-04-07 17:03:08,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 2.2142857142857144) internal successors, (31), 11 states have internal predecessors, (31), 3 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 17:03:08,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 58 transitions. [2022-04-07 17:03:08,976 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 12 states and 58 transitions. [2022-04-07 17:03:09,038 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 58 edges. 58 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 17:03:09,042 INFO L225 Difference]: With dead ends: 59 [2022-04-07 17:03:09,043 INFO L226 Difference]: Without dead ends: 59 [2022-04-07 17:03:09,043 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 31 SyntacticMatches, 1 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 81 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=110, Invalid=396, Unknown=0, NotChecked=0, Total=506 [2022-04-07 17:03:09,044 INFO L913 BasicCegarLoop]: 28 mSDtfsCounter, 57 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 202 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 65 SdHoareTripleChecker+Invalid, 237 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 202 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-07 17:03:09,044 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [57 Valid, 65 Invalid, 237 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 202 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-07 17:03:09,044 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2022-04-07 17:03:09,051 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 41. [2022-04-07 17:03:09,051 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 17:03:09,052 INFO L82 GeneralOperation]: Start isEquivalent. First operand 59 states. Second operand has 41 states, 32 states have (on average 1.3125) internal successors, (42), 33 states have internal predecessors, (42), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-07 17:03:09,052 INFO L74 IsIncluded]: Start isIncluded. First operand 59 states. Second operand has 41 states, 32 states have (on average 1.3125) internal successors, (42), 33 states have internal predecessors, (42), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-07 17:03:09,052 INFO L87 Difference]: Start difference. First operand 59 states. Second operand has 41 states, 32 states have (on average 1.3125) internal successors, (42), 33 states have internal predecessors, (42), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-07 17:03:09,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 17:03:09,055 INFO L93 Difference]: Finished difference Result 59 states and 73 transitions. [2022-04-07 17:03:09,055 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 73 transitions. [2022-04-07 17:03:09,055 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 17:03:09,055 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 17:03:09,056 INFO L74 IsIncluded]: Start isIncluded. First operand has 41 states, 32 states have (on average 1.3125) internal successors, (42), 33 states have internal predecessors, (42), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) Second operand 59 states. [2022-04-07 17:03:09,059 INFO L87 Difference]: Start difference. First operand has 41 states, 32 states have (on average 1.3125) internal successors, (42), 33 states have internal predecessors, (42), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) Second operand 59 states. [2022-04-07 17:03:09,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 17:03:09,062 INFO L93 Difference]: Finished difference Result 59 states and 73 transitions. [2022-04-07 17:03:09,062 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 73 transitions. [2022-04-07 17:03:09,062 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 17:03:09,062 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 17:03:09,062 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 17:03:09,063 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 17:03:09,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 32 states have (on average 1.3125) internal successors, (42), 33 states have internal predecessors, (42), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-07 17:03:09,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 51 transitions. [2022-04-07 17:03:09,064 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 51 transitions. Word has length 18 [2022-04-07 17:03:09,064 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 17:03:09,064 INFO L478 AbstractCegarLoop]: Abstraction has 41 states and 51 transitions. [2022-04-07 17:03:09,065 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 2.2142857142857144) internal successors, (31), 11 states have internal predecessors, (31), 3 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 17:03:09,065 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 51 transitions. [2022-04-07 17:03:09,065 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-04-07 17:03:09,065 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 17:03:09,065 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-07 17:03:09,082 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-07 17:03:09,266 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2022-04-07 17:03:09,266 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 17:03:09,267 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 17:03:09,267 INFO L85 PathProgramCache]: Analyzing trace with hash -1629261177, now seen corresponding path program 1 times [2022-04-07 17:03:09,267 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 17:03:09,267 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [604365948] [2022-04-07 17:03:09,267 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 17:03:09,267 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 17:03:09,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 17:03:09,339 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-07 17:03:09,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 17:03:09,354 INFO L290 TraceCheckUtils]: 0: Hoare triple {823#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [88] 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] {813#true} is VALID [2022-04-07 17:03:09,354 INFO L290 TraceCheckUtils]: 1: Hoare triple {813#true} [91] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {813#true} is VALID [2022-04-07 17:03:09,354 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {813#true} {813#true} [117] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {813#true} is VALID [2022-04-07 17:03:09,355 INFO L272 TraceCheckUtils]: 0: Hoare triple {813#true} [86] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {823#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-07 17:03:09,355 INFO L290 TraceCheckUtils]: 1: Hoare triple {823#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [88] 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] {813#true} is VALID [2022-04-07 17:03:09,355 INFO L290 TraceCheckUtils]: 2: Hoare triple {813#true} [91] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {813#true} is VALID [2022-04-07 17:03:09,355 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {813#true} {813#true} [117] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {813#true} is VALID [2022-04-07 17:03:09,355 INFO L272 TraceCheckUtils]: 4: Hoare triple {813#true} [87] L-1-->mainENTRY: Formula: (and (= |v_main_#in~argv.baseInParam_1| |v_ULTIMATE.start_#in~argv.base_2|) (= |v_main_#in~argcInParam_1| |v_ULTIMATE.start_#in~argc_2|) (= |v_main_#in~argv.offsetInParam_1| |v_ULTIMATE.start_#in~argv.offset_2|)) InVars {ULTIMATE.start_#in~argc=|v_ULTIMATE.start_#in~argc_2|, ULTIMATE.start_#in~argv.offset=|v_ULTIMATE.start_#in~argv.offset_2|, ULTIMATE.start_#in~argv.base=|v_ULTIMATE.start_#in~argv.base_2|} OutVars{main_#in~argv.base=|v_main_#in~argv.baseInParam_1|, main_#in~argc=|v_main_#in~argcInParam_1|, main_#in~argv.offset=|v_main_#in~argv.offsetInParam_1|} AuxVars[] AssignedVars[main_#in~argv.base, main_#in~argv.offset, main_#in~argc, ULTIMATE.start_#in~argc, ULTIMATE.start_#in~argv.offset, ULTIMATE.start_#in~argv.base] {813#true} is VALID [2022-04-07 17:03:09,356 INFO L290 TraceCheckUtils]: 5: Hoare triple {813#true} [90] mainENTRY-->L31: Formula: (and (= 10000 v_main_~c3~0_2) (= v_main_~argv.base_1 |v_main_#in~argv.base_1|) (<= |v_main_#t~nondet1_2| 2147483647) (= v_main_~n~0_2 |v_main_#t~nondet1_2|) (= |v_main_#in~argc_1| v_main_~argc_1) (= 2000 v_main_~c2~0_2) (= 4000 v_main_~c1~0_2) (= v_main_~argv.offset_1 |v_main_#in~argv.offset_1|) (<= 0 (+ |v_main_#t~nondet1_2| 2147483648))) InVars {main_#in~argv.base=|v_main_#in~argv.base_1|, main_#in~argc=|v_main_#in~argc_1|, main_#in~argv.offset=|v_main_#in~argv.offset_1|, main_#t~nondet1=|v_main_#t~nondet1_2|} OutVars{main_~c1~0=v_main_~c1~0_2, main_~v~0=v_main_~v~0_6, main_#in~argv.offset=|v_main_#in~argv.offset_1|, main_~j~0=v_main_~j~0_1, main_~argc=v_main_~argc_1, main_~c2~0=v_main_~c2~0_2, main_#in~argv.base=|v_main_#in~argv.base_1|, main_~k~0=v_main_~k~0_7, main_~i~0=v_main_~i~0_1, main_#in~argc=|v_main_#in~argc_1|, main_~n~0=v_main_~n~0_2, main_~argv.base=v_main_~argv.base_1, main_~c3~0=v_main_~c3~0_2, main_~argv.offset=v_main_~argv.offset_1} AuxVars[] AssignedVars[main_~c1~0, main_~v~0, main_#t~nondet1, main_~k~0, main_~j~0, main_~i~0, main_~n~0, main_~argc, main_~c2~0, main_~argv.base, main_~c3~0, main_~argv.offset] {818#(<= 10000 main_~c3~0)} is VALID [2022-04-07 17:03:09,356 INFO L290 TraceCheckUtils]: 6: Hoare triple {818#(<= 10000 main_~c3~0)} [93] L31-->L40-2: Formula: (and (<= 0 v_main_~n~0_5) (= v_main_~i~0_2 0) (< v_main_~n~0_5 10) (= v_main_~k~0_8 0)) InVars {main_~n~0=v_main_~n~0_5} OutVars{main_~i~0=v_main_~i~0_2, main_~n~0=v_main_~n~0_5, main_~k~0=v_main_~k~0_8} AuxVars[] AssignedVars[main_~k~0, main_~i~0] {819#(and (<= 10000 main_~c3~0) (= main_~k~0 0))} is VALID [2022-04-07 17:03:09,357 INFO L290 TraceCheckUtils]: 7: Hoare triple {819#(and (<= 10000 main_~c3~0) (= main_~k~0 0))} [97] L40-2-->L37: Formula: (and (< v_main_~i~0_5 v_main_~n~0_9) (<= |v_main_#t~nondet3_2| 2147483647) (= v_main_~v~0_7 |v_main_#t~nondet3_2|) (= v_main_~i~0_4 (+ v_main_~i~0_5 1)) (<= 0 (+ |v_main_#t~nondet3_2| 2147483648))) InVars {main_~i~0=v_main_~i~0_5, main_~n~0=v_main_~n~0_9, main_#t~nondet3=|v_main_#t~nondet3_2|} OutVars{main_~i~0=v_main_~i~0_4, main_~v~0=v_main_~v~0_7, main_#t~post2=|v_main_#t~post2_1|, main_~n~0=v_main_~n~0_9} AuxVars[] AssignedVars[main_~v~0, main_#t~nondet3, main_~i~0, main_#t~post2] {819#(and (<= 10000 main_~c3~0) (= main_~k~0 0))} is VALID [2022-04-07 17:03:09,357 INFO L290 TraceCheckUtils]: 8: Hoare triple {819#(and (<= 10000 main_~c3~0) (= main_~k~0 0))} [100] L37-->L38: Formula: (and (<= 0 v_main_~v~0_1) (< v_main_~n~0_1 2)) InVars {main_~v~0=v_main_~v~0_1, main_~n~0=v_main_~n~0_1} OutVars{main_~v~0=v_main_~v~0_1, main_~n~0=v_main_~n~0_1} AuxVars[] AssignedVars[] {819#(and (<= 10000 main_~c3~0) (= main_~k~0 0))} is VALID [2022-04-07 17:03:09,358 INFO L290 TraceCheckUtils]: 9: Hoare triple {819#(and (<= 10000 main_~c3~0) (= main_~k~0 0))} [105] L38-->L40: Formula: (not (= v_main_~v~0_3 0)) InVars {main_~v~0=v_main_~v~0_3} OutVars{main_~v~0=v_main_~v~0_3} AuxVars[] AssignedVars[] {819#(and (<= 10000 main_~c3~0) (= main_~k~0 0))} is VALID [2022-04-07 17:03:09,358 INFO L290 TraceCheckUtils]: 10: Hoare triple {819#(and (<= 10000 main_~c3~0) (= main_~k~0 0))} [109] L40-->L40-2: Formula: (and (= v_main_~k~0_5 (+ v_main_~k~0_6 v_main_~c3~0_1)) (not (= v_main_~v~0_5 1))) InVars {main_~v~0=v_main_~v~0_5, main_~k~0=v_main_~k~0_6, main_~c3~0=v_main_~c3~0_1} OutVars{main_~v~0=v_main_~v~0_5, main_~k~0=v_main_~k~0_5, main_~c3~0=v_main_~c3~0_1} AuxVars[] AssignedVars[main_~k~0] {820#(<= 10000 main_~k~0)} is VALID [2022-04-07 17:03:09,358 INFO L290 TraceCheckUtils]: 11: Hoare triple {820#(<= 10000 main_~k~0)} [96] L40-2-->L34-2: Formula: (not (< v_main_~i~0_3 v_main_~n~0_8)) InVars {main_~i~0=v_main_~i~0_3, main_~n~0=v_main_~n~0_8} OutVars{main_~i~0=v_main_~i~0_3, main_~n~0=v_main_~n~0_8} AuxVars[] AssignedVars[] {820#(<= 10000 main_~k~0)} is VALID [2022-04-07 17:03:09,359 INFO L290 TraceCheckUtils]: 12: Hoare triple {820#(<= 10000 main_~k~0)} [98] L34-2-->L46-2: Formula: (= v_main_~j~0_2 0) InVars {} OutVars{main_~j~0=v_main_~j~0_2} AuxVars[] AssignedVars[main_~j~0] {820#(<= 10000 main_~k~0)} is VALID [2022-04-07 17:03:09,359 INFO L290 TraceCheckUtils]: 13: Hoare triple {820#(<= 10000 main_~k~0)} [103] L46-2-->L47: Formula: (< v_main_~j~0_4 v_main_~n~0_7) InVars {main_~j~0=v_main_~j~0_4, main_~n~0=v_main_~n~0_7} OutVars{main_~j~0=v_main_~j~0_4, main_~n~0=v_main_~n~0_7} AuxVars[] AssignedVars[] {820#(<= 10000 main_~k~0)} is VALID [2022-04-07 17:03:09,360 INFO L272 TraceCheckUtils]: 14: Hoare triple {820#(<= 10000 main_~k~0)} [107] L47-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (< 0 v_main_~k~0_12) 1 0)) InVars {main_~k~0=v_main_~k~0_12} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~k~0] {821#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-07 17:03:09,360 INFO L290 TraceCheckUtils]: 15: Hoare triple {821#(not (= |__VERIFIER_assert_#in~cond| 0))} [111] __VERIFIER_assertENTRY-->L18: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {822#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-07 17:03:09,360 INFO L290 TraceCheckUtils]: 16: Hoare triple {822#(not (= __VERIFIER_assert_~cond 0))} [112] L18-->L19: Formula: (= v___VERIFIER_assert_~cond_2 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {814#false} is VALID [2022-04-07 17:03:09,361 INFO L290 TraceCheckUtils]: 17: Hoare triple {814#false} [114] L19-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {814#false} is VALID [2022-04-07 17:03:09,361 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-07 17:03:09,361 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 17:03:09,361 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [604365948] [2022-04-07 17:03:09,361 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [604365948] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-07 17:03:09,361 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [98435342] [2022-04-07 17:03:09,361 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 17:03:09,361 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 17:03:09,362 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-07 17:03:09,362 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-07 17:03:09,363 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-04-07 17:03:09,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 17:03:09,394 INFO L263 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 6 conjunts are in the unsatisfiable core [2022-04-07 17:03:09,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 17:03:09,399 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-07 17:03:09,512 INFO L272 TraceCheckUtils]: 0: Hoare triple {813#true} [86] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {813#true} is VALID [2022-04-07 17:03:09,512 INFO L290 TraceCheckUtils]: 1: Hoare triple {813#true} [88] 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] {813#true} is VALID [2022-04-07 17:03:09,512 INFO L290 TraceCheckUtils]: 2: Hoare triple {813#true} [91] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {813#true} is VALID [2022-04-07 17:03:09,512 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {813#true} {813#true} [117] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {813#true} is VALID [2022-04-07 17:03:09,513 INFO L272 TraceCheckUtils]: 4: Hoare triple {813#true} [87] L-1-->mainENTRY: Formula: (and (= |v_main_#in~argv.baseInParam_1| |v_ULTIMATE.start_#in~argv.base_2|) (= |v_main_#in~argcInParam_1| |v_ULTIMATE.start_#in~argc_2|) (= |v_main_#in~argv.offsetInParam_1| |v_ULTIMATE.start_#in~argv.offset_2|)) InVars {ULTIMATE.start_#in~argc=|v_ULTIMATE.start_#in~argc_2|, ULTIMATE.start_#in~argv.offset=|v_ULTIMATE.start_#in~argv.offset_2|, ULTIMATE.start_#in~argv.base=|v_ULTIMATE.start_#in~argv.base_2|} OutVars{main_#in~argv.base=|v_main_#in~argv.baseInParam_1|, main_#in~argc=|v_main_#in~argcInParam_1|, main_#in~argv.offset=|v_main_#in~argv.offsetInParam_1|} AuxVars[] AssignedVars[main_#in~argv.base, main_#in~argv.offset, main_#in~argc, ULTIMATE.start_#in~argc, ULTIMATE.start_#in~argv.offset, ULTIMATE.start_#in~argv.base] {813#true} is VALID [2022-04-07 17:03:09,513 INFO L290 TraceCheckUtils]: 5: Hoare triple {813#true} [90] mainENTRY-->L31: Formula: (and (= 10000 v_main_~c3~0_2) (= v_main_~argv.base_1 |v_main_#in~argv.base_1|) (<= |v_main_#t~nondet1_2| 2147483647) (= v_main_~n~0_2 |v_main_#t~nondet1_2|) (= |v_main_#in~argc_1| v_main_~argc_1) (= 2000 v_main_~c2~0_2) (= 4000 v_main_~c1~0_2) (= v_main_~argv.offset_1 |v_main_#in~argv.offset_1|) (<= 0 (+ |v_main_#t~nondet1_2| 2147483648))) InVars {main_#in~argv.base=|v_main_#in~argv.base_1|, main_#in~argc=|v_main_#in~argc_1|, main_#in~argv.offset=|v_main_#in~argv.offset_1|, main_#t~nondet1=|v_main_#t~nondet1_2|} OutVars{main_~c1~0=v_main_~c1~0_2, main_~v~0=v_main_~v~0_6, main_#in~argv.offset=|v_main_#in~argv.offset_1|, main_~j~0=v_main_~j~0_1, main_~argc=v_main_~argc_1, main_~c2~0=v_main_~c2~0_2, main_#in~argv.base=|v_main_#in~argv.base_1|, main_~k~0=v_main_~k~0_7, main_~i~0=v_main_~i~0_1, main_#in~argc=|v_main_#in~argc_1|, main_~n~0=v_main_~n~0_2, main_~argv.base=v_main_~argv.base_1, main_~c3~0=v_main_~c3~0_2, main_~argv.offset=v_main_~argv.offset_1} AuxVars[] AssignedVars[main_~c1~0, main_~v~0, main_#t~nondet1, main_~k~0, main_~j~0, main_~i~0, main_~n~0, main_~argc, main_~c2~0, main_~argv.base, main_~c3~0, main_~argv.offset] {818#(<= 10000 main_~c3~0)} is VALID [2022-04-07 17:03:09,513 INFO L290 TraceCheckUtils]: 6: Hoare triple {818#(<= 10000 main_~c3~0)} [93] L31-->L40-2: Formula: (and (<= 0 v_main_~n~0_5) (= v_main_~i~0_2 0) (< v_main_~n~0_5 10) (= v_main_~k~0_8 0)) InVars {main_~n~0=v_main_~n~0_5} OutVars{main_~i~0=v_main_~i~0_2, main_~n~0=v_main_~n~0_5, main_~k~0=v_main_~k~0_8} AuxVars[] AssignedVars[main_~k~0, main_~i~0] {845#(and (<= 10000 main_~c3~0) (<= 0 main_~k~0))} is VALID [2022-04-07 17:03:09,514 INFO L290 TraceCheckUtils]: 7: Hoare triple {845#(and (<= 10000 main_~c3~0) (<= 0 main_~k~0))} [97] L40-2-->L37: Formula: (and (< v_main_~i~0_5 v_main_~n~0_9) (<= |v_main_#t~nondet3_2| 2147483647) (= v_main_~v~0_7 |v_main_#t~nondet3_2|) (= v_main_~i~0_4 (+ v_main_~i~0_5 1)) (<= 0 (+ |v_main_#t~nondet3_2| 2147483648))) InVars {main_~i~0=v_main_~i~0_5, main_~n~0=v_main_~n~0_9, main_#t~nondet3=|v_main_#t~nondet3_2|} OutVars{main_~i~0=v_main_~i~0_4, main_~v~0=v_main_~v~0_7, main_#t~post2=|v_main_#t~post2_1|, main_~n~0=v_main_~n~0_9} AuxVars[] AssignedVars[main_~v~0, main_#t~nondet3, main_~i~0, main_#t~post2] {845#(and (<= 10000 main_~c3~0) (<= 0 main_~k~0))} is VALID [2022-04-07 17:03:09,514 INFO L290 TraceCheckUtils]: 8: Hoare triple {845#(and (<= 10000 main_~c3~0) (<= 0 main_~k~0))} [100] L37-->L38: Formula: (and (<= 0 v_main_~v~0_1) (< v_main_~n~0_1 2)) InVars {main_~v~0=v_main_~v~0_1, main_~n~0=v_main_~n~0_1} OutVars{main_~v~0=v_main_~v~0_1, main_~n~0=v_main_~n~0_1} AuxVars[] AssignedVars[] {845#(and (<= 10000 main_~c3~0) (<= 0 main_~k~0))} is VALID [2022-04-07 17:03:09,515 INFO L290 TraceCheckUtils]: 9: Hoare triple {845#(and (<= 10000 main_~c3~0) (<= 0 main_~k~0))} [105] L38-->L40: Formula: (not (= v_main_~v~0_3 0)) InVars {main_~v~0=v_main_~v~0_3} OutVars{main_~v~0=v_main_~v~0_3} AuxVars[] AssignedVars[] {845#(and (<= 10000 main_~c3~0) (<= 0 main_~k~0))} is VALID [2022-04-07 17:03:09,515 INFO L290 TraceCheckUtils]: 10: Hoare triple {845#(and (<= 10000 main_~c3~0) (<= 0 main_~k~0))} [109] L40-->L40-2: Formula: (and (= v_main_~k~0_5 (+ v_main_~k~0_6 v_main_~c3~0_1)) (not (= v_main_~v~0_5 1))) InVars {main_~v~0=v_main_~v~0_5, main_~k~0=v_main_~k~0_6, main_~c3~0=v_main_~c3~0_1} OutVars{main_~v~0=v_main_~v~0_5, main_~k~0=v_main_~k~0_5, main_~c3~0=v_main_~c3~0_1} AuxVars[] AssignedVars[main_~k~0] {820#(<= 10000 main_~k~0)} is VALID [2022-04-07 17:03:09,516 INFO L290 TraceCheckUtils]: 11: Hoare triple {820#(<= 10000 main_~k~0)} [96] L40-2-->L34-2: Formula: (not (< v_main_~i~0_3 v_main_~n~0_8)) InVars {main_~i~0=v_main_~i~0_3, main_~n~0=v_main_~n~0_8} OutVars{main_~i~0=v_main_~i~0_3, main_~n~0=v_main_~n~0_8} AuxVars[] AssignedVars[] {820#(<= 10000 main_~k~0)} is VALID [2022-04-07 17:03:09,516 INFO L290 TraceCheckUtils]: 12: Hoare triple {820#(<= 10000 main_~k~0)} [98] L34-2-->L46-2: Formula: (= v_main_~j~0_2 0) InVars {} OutVars{main_~j~0=v_main_~j~0_2} AuxVars[] AssignedVars[main_~j~0] {820#(<= 10000 main_~k~0)} is VALID [2022-04-07 17:03:09,516 INFO L290 TraceCheckUtils]: 13: Hoare triple {820#(<= 10000 main_~k~0)} [103] L46-2-->L47: Formula: (< v_main_~j~0_4 v_main_~n~0_7) InVars {main_~j~0=v_main_~j~0_4, main_~n~0=v_main_~n~0_7} OutVars{main_~j~0=v_main_~j~0_4, main_~n~0=v_main_~n~0_7} AuxVars[] AssignedVars[] {820#(<= 10000 main_~k~0)} is VALID [2022-04-07 17:03:09,517 INFO L272 TraceCheckUtils]: 14: Hoare triple {820#(<= 10000 main_~k~0)} [107] L47-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (< 0 v_main_~k~0_12) 1 0)) InVars {main_~k~0=v_main_~k~0_12} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~k~0] {870#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-07 17:03:09,517 INFO L290 TraceCheckUtils]: 15: Hoare triple {870#(<= 1 |__VERIFIER_assert_#in~cond|)} [111] __VERIFIER_assertENTRY-->L18: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {874#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-07 17:03:09,517 INFO L290 TraceCheckUtils]: 16: Hoare triple {874#(<= 1 __VERIFIER_assert_~cond)} [112] L18-->L19: Formula: (= v___VERIFIER_assert_~cond_2 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {814#false} is VALID [2022-04-07 17:03:09,518 INFO L290 TraceCheckUtils]: 17: Hoare triple {814#false} [114] L19-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {814#false} is VALID [2022-04-07 17:03:09,518 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-07 17:03:09,518 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-07 17:03:09,631 INFO L290 TraceCheckUtils]: 17: Hoare triple {814#false} [114] L19-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {814#false} is VALID [2022-04-07 17:03:09,632 INFO L290 TraceCheckUtils]: 16: Hoare triple {874#(<= 1 __VERIFIER_assert_~cond)} [112] L18-->L19: Formula: (= v___VERIFIER_assert_~cond_2 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {814#false} is VALID [2022-04-07 17:03:09,633 INFO L290 TraceCheckUtils]: 15: Hoare triple {870#(<= 1 |__VERIFIER_assert_#in~cond|)} [111] __VERIFIER_assertENTRY-->L18: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {874#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-07 17:03:09,634 INFO L272 TraceCheckUtils]: 14: Hoare triple {890#(< 0 main_~k~0)} [107] L47-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (< 0 v_main_~k~0_12) 1 0)) InVars {main_~k~0=v_main_~k~0_12} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~k~0] {870#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-07 17:03:09,634 INFO L290 TraceCheckUtils]: 13: Hoare triple {890#(< 0 main_~k~0)} [103] L46-2-->L47: Formula: (< v_main_~j~0_4 v_main_~n~0_7) InVars {main_~j~0=v_main_~j~0_4, main_~n~0=v_main_~n~0_7} OutVars{main_~j~0=v_main_~j~0_4, main_~n~0=v_main_~n~0_7} AuxVars[] AssignedVars[] {890#(< 0 main_~k~0)} is VALID [2022-04-07 17:03:09,634 INFO L290 TraceCheckUtils]: 12: Hoare triple {890#(< 0 main_~k~0)} [98] L34-2-->L46-2: Formula: (= v_main_~j~0_2 0) InVars {} OutVars{main_~j~0=v_main_~j~0_2} AuxVars[] AssignedVars[main_~j~0] {890#(< 0 main_~k~0)} is VALID [2022-04-07 17:03:09,635 INFO L290 TraceCheckUtils]: 11: Hoare triple {890#(< 0 main_~k~0)} [96] L40-2-->L34-2: Formula: (not (< v_main_~i~0_3 v_main_~n~0_8)) InVars {main_~i~0=v_main_~i~0_3, main_~n~0=v_main_~n~0_8} OutVars{main_~i~0=v_main_~i~0_3, main_~n~0=v_main_~n~0_8} AuxVars[] AssignedVars[] {890#(< 0 main_~k~0)} is VALID [2022-04-07 17:03:09,635 INFO L290 TraceCheckUtils]: 10: Hoare triple {903#(< 0 (+ main_~k~0 main_~c3~0))} [109] L40-->L40-2: Formula: (and (= v_main_~k~0_5 (+ v_main_~k~0_6 v_main_~c3~0_1)) (not (= v_main_~v~0_5 1))) InVars {main_~v~0=v_main_~v~0_5, main_~k~0=v_main_~k~0_6, main_~c3~0=v_main_~c3~0_1} OutVars{main_~v~0=v_main_~v~0_5, main_~k~0=v_main_~k~0_5, main_~c3~0=v_main_~c3~0_1} AuxVars[] AssignedVars[main_~k~0] {890#(< 0 main_~k~0)} is VALID [2022-04-07 17:03:09,636 INFO L290 TraceCheckUtils]: 9: Hoare triple {903#(< 0 (+ main_~k~0 main_~c3~0))} [105] L38-->L40: Formula: (not (= v_main_~v~0_3 0)) InVars {main_~v~0=v_main_~v~0_3} OutVars{main_~v~0=v_main_~v~0_3} AuxVars[] AssignedVars[] {903#(< 0 (+ main_~k~0 main_~c3~0))} is VALID [2022-04-07 17:03:09,636 INFO L290 TraceCheckUtils]: 8: Hoare triple {903#(< 0 (+ main_~k~0 main_~c3~0))} [100] L37-->L38: Formula: (and (<= 0 v_main_~v~0_1) (< v_main_~n~0_1 2)) InVars {main_~v~0=v_main_~v~0_1, main_~n~0=v_main_~n~0_1} OutVars{main_~v~0=v_main_~v~0_1, main_~n~0=v_main_~n~0_1} AuxVars[] AssignedVars[] {903#(< 0 (+ main_~k~0 main_~c3~0))} is VALID [2022-04-07 17:03:09,636 INFO L290 TraceCheckUtils]: 7: Hoare triple {903#(< 0 (+ main_~k~0 main_~c3~0))} [97] L40-2-->L37: Formula: (and (< v_main_~i~0_5 v_main_~n~0_9) (<= |v_main_#t~nondet3_2| 2147483647) (= v_main_~v~0_7 |v_main_#t~nondet3_2|) (= v_main_~i~0_4 (+ v_main_~i~0_5 1)) (<= 0 (+ |v_main_#t~nondet3_2| 2147483648))) InVars {main_~i~0=v_main_~i~0_5, main_~n~0=v_main_~n~0_9, main_#t~nondet3=|v_main_#t~nondet3_2|} OutVars{main_~i~0=v_main_~i~0_4, main_~v~0=v_main_~v~0_7, main_#t~post2=|v_main_#t~post2_1|, main_~n~0=v_main_~n~0_9} AuxVars[] AssignedVars[main_~v~0, main_#t~nondet3, main_~i~0, main_#t~post2] {903#(< 0 (+ main_~k~0 main_~c3~0))} is VALID [2022-04-07 17:03:09,637 INFO L290 TraceCheckUtils]: 6: Hoare triple {916#(< 0 main_~c3~0)} [93] L31-->L40-2: Formula: (and (<= 0 v_main_~n~0_5) (= v_main_~i~0_2 0) (< v_main_~n~0_5 10) (= v_main_~k~0_8 0)) InVars {main_~n~0=v_main_~n~0_5} OutVars{main_~i~0=v_main_~i~0_2, main_~n~0=v_main_~n~0_5, main_~k~0=v_main_~k~0_8} AuxVars[] AssignedVars[main_~k~0, main_~i~0] {903#(< 0 (+ main_~k~0 main_~c3~0))} is VALID [2022-04-07 17:03:09,637 INFO L290 TraceCheckUtils]: 5: Hoare triple {813#true} [90] mainENTRY-->L31: Formula: (and (= 10000 v_main_~c3~0_2) (= v_main_~argv.base_1 |v_main_#in~argv.base_1|) (<= |v_main_#t~nondet1_2| 2147483647) (= v_main_~n~0_2 |v_main_#t~nondet1_2|) (= |v_main_#in~argc_1| v_main_~argc_1) (= 2000 v_main_~c2~0_2) (= 4000 v_main_~c1~0_2) (= v_main_~argv.offset_1 |v_main_#in~argv.offset_1|) (<= 0 (+ |v_main_#t~nondet1_2| 2147483648))) InVars {main_#in~argv.base=|v_main_#in~argv.base_1|, main_#in~argc=|v_main_#in~argc_1|, main_#in~argv.offset=|v_main_#in~argv.offset_1|, main_#t~nondet1=|v_main_#t~nondet1_2|} OutVars{main_~c1~0=v_main_~c1~0_2, main_~v~0=v_main_~v~0_6, main_#in~argv.offset=|v_main_#in~argv.offset_1|, main_~j~0=v_main_~j~0_1, main_~argc=v_main_~argc_1, main_~c2~0=v_main_~c2~0_2, main_#in~argv.base=|v_main_#in~argv.base_1|, main_~k~0=v_main_~k~0_7, main_~i~0=v_main_~i~0_1, main_#in~argc=|v_main_#in~argc_1|, main_~n~0=v_main_~n~0_2, main_~argv.base=v_main_~argv.base_1, main_~c3~0=v_main_~c3~0_2, main_~argv.offset=v_main_~argv.offset_1} AuxVars[] AssignedVars[main_~c1~0, main_~v~0, main_#t~nondet1, main_~k~0, main_~j~0, main_~i~0, main_~n~0, main_~argc, main_~c2~0, main_~argv.base, main_~c3~0, main_~argv.offset] {916#(< 0 main_~c3~0)} is VALID [2022-04-07 17:03:09,637 INFO L272 TraceCheckUtils]: 4: Hoare triple {813#true} [87] L-1-->mainENTRY: Formula: (and (= |v_main_#in~argv.baseInParam_1| |v_ULTIMATE.start_#in~argv.base_2|) (= |v_main_#in~argcInParam_1| |v_ULTIMATE.start_#in~argc_2|) (= |v_main_#in~argv.offsetInParam_1| |v_ULTIMATE.start_#in~argv.offset_2|)) InVars {ULTIMATE.start_#in~argc=|v_ULTIMATE.start_#in~argc_2|, ULTIMATE.start_#in~argv.offset=|v_ULTIMATE.start_#in~argv.offset_2|, ULTIMATE.start_#in~argv.base=|v_ULTIMATE.start_#in~argv.base_2|} OutVars{main_#in~argv.base=|v_main_#in~argv.baseInParam_1|, main_#in~argc=|v_main_#in~argcInParam_1|, main_#in~argv.offset=|v_main_#in~argv.offsetInParam_1|} AuxVars[] AssignedVars[main_#in~argv.base, main_#in~argv.offset, main_#in~argc, ULTIMATE.start_#in~argc, ULTIMATE.start_#in~argv.offset, ULTIMATE.start_#in~argv.base] {813#true} is VALID [2022-04-07 17:03:09,638 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {813#true} {813#true} [117] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {813#true} is VALID [2022-04-07 17:03:09,638 INFO L290 TraceCheckUtils]: 2: Hoare triple {813#true} [91] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {813#true} is VALID [2022-04-07 17:03:09,638 INFO L290 TraceCheckUtils]: 1: Hoare triple {813#true} [88] 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] {813#true} is VALID [2022-04-07 17:03:09,638 INFO L272 TraceCheckUtils]: 0: Hoare triple {813#true} [86] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {813#true} is VALID [2022-04-07 17:03:09,638 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-07 17:03:09,638 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [98435342] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-07 17:03:09,638 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-07 17:03:09,638 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 14 [2022-04-07 17:03:09,639 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1196585790] [2022-04-07 17:03:09,639 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-07 17:03:09,639 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 2.2142857142857144) internal successors, (31), 11 states have internal predecessors, (31), 3 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 18 [2022-04-07 17:03:09,639 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 17:03:09,640 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 14 states, 14 states have (on average 2.2142857142857144) internal successors, (31), 11 states have internal predecessors, (31), 3 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 17:03:09,671 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 38 edges. 38 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 17:03:09,671 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-04-07 17:03:09,671 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 17:03:09,671 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-04-07 17:03:09,672 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=146, Unknown=0, NotChecked=0, Total=182 [2022-04-07 17:03:09,672 INFO L87 Difference]: Start difference. First operand 41 states and 51 transitions. Second operand has 14 states, 14 states have (on average 2.2142857142857144) internal successors, (31), 11 states have internal predecessors, (31), 3 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 17:03:10,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 17:03:10,217 INFO L93 Difference]: Finished difference Result 63 states and 80 transitions. [2022-04-07 17:03:10,217 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-04-07 17:03:10,217 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 2.2142857142857144) internal successors, (31), 11 states have internal predecessors, (31), 3 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 18 [2022-04-07 17:03:10,218 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 17:03:10,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 2.2142857142857144) internal successors, (31), 11 states have internal predecessors, (31), 3 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 17:03:10,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 58 transitions. [2022-04-07 17:03:10,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 2.2142857142857144) internal successors, (31), 11 states have internal predecessors, (31), 3 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 17:03:10,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 58 transitions. [2022-04-07 17:03:10,221 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 12 states and 58 transitions. [2022-04-07 17:03:10,268 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 58 edges. 58 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 17:03:10,269 INFO L225 Difference]: With dead ends: 63 [2022-04-07 17:03:10,269 INFO L226 Difference]: Without dead ends: 63 [2022-04-07 17:03:10,270 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 31 SyntacticMatches, 1 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 81 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=110, Invalid=396, Unknown=0, NotChecked=0, Total=506 [2022-04-07 17:03:10,270 INFO L913 BasicCegarLoop]: 28 mSDtfsCounter, 52 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 265 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 75 SdHoareTripleChecker+Invalid, 294 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 265 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-07 17:03:10,271 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [52 Valid, 75 Invalid, 294 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 265 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-07 17:03:10,271 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2022-04-07 17:03:10,273 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 46. [2022-04-07 17:03:10,274 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 17:03:10,274 INFO L82 GeneralOperation]: Start isEquivalent. First operand 63 states. Second operand has 46 states, 37 states have (on average 1.3783783783783783) internal successors, (51), 38 states have internal predecessors, (51), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-07 17:03:10,274 INFO L74 IsIncluded]: Start isIncluded. First operand 63 states. Second operand has 46 states, 37 states have (on average 1.3783783783783783) internal successors, (51), 38 states have internal predecessors, (51), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-07 17:03:10,274 INFO L87 Difference]: Start difference. First operand 63 states. Second operand has 46 states, 37 states have (on average 1.3783783783783783) internal successors, (51), 38 states have internal predecessors, (51), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-07 17:03:10,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 17:03:10,276 INFO L93 Difference]: Finished difference Result 63 states and 80 transitions. [2022-04-07 17:03:10,276 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 80 transitions. [2022-04-07 17:03:10,277 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 17:03:10,277 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 17:03:10,277 INFO L74 IsIncluded]: Start isIncluded. First operand has 46 states, 37 states have (on average 1.3783783783783783) internal successors, (51), 38 states have internal predecessors, (51), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) Second operand 63 states. [2022-04-07 17:03:10,277 INFO L87 Difference]: Start difference. First operand has 46 states, 37 states have (on average 1.3783783783783783) internal successors, (51), 38 states have internal predecessors, (51), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) Second operand 63 states. [2022-04-07 17:03:10,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 17:03:10,292 INFO L93 Difference]: Finished difference Result 63 states and 80 transitions. [2022-04-07 17:03:10,292 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 80 transitions. [2022-04-07 17:03:10,292 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 17:03:10,292 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 17:03:10,293 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 17:03:10,293 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 17:03:10,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 37 states have (on average 1.3783783783783783) internal successors, (51), 38 states have internal predecessors, (51), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-07 17:03:10,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 60 transitions. [2022-04-07 17:03:10,294 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 60 transitions. Word has length 18 [2022-04-07 17:03:10,294 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 17:03:10,294 INFO L478 AbstractCegarLoop]: Abstraction has 46 states and 60 transitions. [2022-04-07 17:03:10,295 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 2.2142857142857144) internal successors, (31), 11 states have internal predecessors, (31), 3 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 17:03:10,295 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 60 transitions. [2022-04-07 17:03:10,295 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-04-07 17:03:10,295 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 17:03:10,295 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-07 17:03:10,314 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-04-07 17:03:10,511 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 17:03:10,512 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 17:03:10,512 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 17:03:10,512 INFO L85 PathProgramCache]: Analyzing trace with hash -1917225923, now seen corresponding path program 1 times [2022-04-07 17:03:10,512 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 17:03:10,512 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [34642655] [2022-04-07 17:03:10,512 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 17:03:10,512 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 17:03:10,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 17:03:10,550 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-07 17:03:10,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 17:03:10,554 INFO L290 TraceCheckUtils]: 0: Hoare triple {1198#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [88] 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] {1190#true} is VALID [2022-04-07 17:03:10,554 INFO L290 TraceCheckUtils]: 1: Hoare triple {1190#true} [91] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1190#true} is VALID [2022-04-07 17:03:10,554 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1190#true} {1190#true} [117] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1190#true} is VALID [2022-04-07 17:03:10,554 INFO L272 TraceCheckUtils]: 0: Hoare triple {1190#true} [86] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1198#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-07 17:03:10,555 INFO L290 TraceCheckUtils]: 1: Hoare triple {1198#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [88] 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] {1190#true} is VALID [2022-04-07 17:03:10,555 INFO L290 TraceCheckUtils]: 2: Hoare triple {1190#true} [91] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1190#true} is VALID [2022-04-07 17:03:10,555 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1190#true} {1190#true} [117] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1190#true} is VALID [2022-04-07 17:03:10,555 INFO L272 TraceCheckUtils]: 4: Hoare triple {1190#true} [87] L-1-->mainENTRY: Formula: (and (= |v_main_#in~argv.baseInParam_1| |v_ULTIMATE.start_#in~argv.base_2|) (= |v_main_#in~argcInParam_1| |v_ULTIMATE.start_#in~argc_2|) (= |v_main_#in~argv.offsetInParam_1| |v_ULTIMATE.start_#in~argv.offset_2|)) InVars {ULTIMATE.start_#in~argc=|v_ULTIMATE.start_#in~argc_2|, ULTIMATE.start_#in~argv.offset=|v_ULTIMATE.start_#in~argv.offset_2|, ULTIMATE.start_#in~argv.base=|v_ULTIMATE.start_#in~argv.base_2|} OutVars{main_#in~argv.base=|v_main_#in~argv.baseInParam_1|, main_#in~argc=|v_main_#in~argcInParam_1|, main_#in~argv.offset=|v_main_#in~argv.offsetInParam_1|} AuxVars[] AssignedVars[main_#in~argv.base, main_#in~argv.offset, main_#in~argc, ULTIMATE.start_#in~argc, ULTIMATE.start_#in~argv.offset, ULTIMATE.start_#in~argv.base] {1190#true} is VALID [2022-04-07 17:03:10,555 INFO L290 TraceCheckUtils]: 5: Hoare triple {1190#true} [90] mainENTRY-->L31: Formula: (and (= 10000 v_main_~c3~0_2) (= v_main_~argv.base_1 |v_main_#in~argv.base_1|) (<= |v_main_#t~nondet1_2| 2147483647) (= v_main_~n~0_2 |v_main_#t~nondet1_2|) (= |v_main_#in~argc_1| v_main_~argc_1) (= 2000 v_main_~c2~0_2) (= 4000 v_main_~c1~0_2) (= v_main_~argv.offset_1 |v_main_#in~argv.offset_1|) (<= 0 (+ |v_main_#t~nondet1_2| 2147483648))) InVars {main_#in~argv.base=|v_main_#in~argv.base_1|, main_#in~argc=|v_main_#in~argc_1|, main_#in~argv.offset=|v_main_#in~argv.offset_1|, main_#t~nondet1=|v_main_#t~nondet1_2|} OutVars{main_~c1~0=v_main_~c1~0_2, main_~v~0=v_main_~v~0_6, main_#in~argv.offset=|v_main_#in~argv.offset_1|, main_~j~0=v_main_~j~0_1, main_~argc=v_main_~argc_1, main_~c2~0=v_main_~c2~0_2, main_#in~argv.base=|v_main_#in~argv.base_1|, main_~k~0=v_main_~k~0_7, main_~i~0=v_main_~i~0_1, main_#in~argc=|v_main_#in~argc_1|, main_~n~0=v_main_~n~0_2, main_~argv.base=v_main_~argv.base_1, main_~c3~0=v_main_~c3~0_2, main_~argv.offset=v_main_~argv.offset_1} AuxVars[] AssignedVars[main_~c1~0, main_~v~0, main_#t~nondet1, main_~k~0, main_~j~0, main_~i~0, main_~n~0, main_~argc, main_~c2~0, main_~argv.base, main_~c3~0, main_~argv.offset] {1190#true} is VALID [2022-04-07 17:03:10,555 INFO L290 TraceCheckUtils]: 6: Hoare triple {1190#true} [93] L31-->L40-2: Formula: (and (<= 0 v_main_~n~0_5) (= v_main_~i~0_2 0) (< v_main_~n~0_5 10) (= v_main_~k~0_8 0)) InVars {main_~n~0=v_main_~n~0_5} OutVars{main_~i~0=v_main_~i~0_2, main_~n~0=v_main_~n~0_5, main_~k~0=v_main_~k~0_8} AuxVars[] AssignedVars[main_~k~0, main_~i~0] {1195#(= main_~i~0 0)} is VALID [2022-04-07 17:03:10,556 INFO L290 TraceCheckUtils]: 7: Hoare triple {1195#(= main_~i~0 0)} [97] L40-2-->L37: Formula: (and (< v_main_~i~0_5 v_main_~n~0_9) (<= |v_main_#t~nondet3_2| 2147483647) (= v_main_~v~0_7 |v_main_#t~nondet3_2|) (= v_main_~i~0_4 (+ v_main_~i~0_5 1)) (<= 0 (+ |v_main_#t~nondet3_2| 2147483648))) InVars {main_~i~0=v_main_~i~0_5, main_~n~0=v_main_~n~0_9, main_#t~nondet3=|v_main_#t~nondet3_2|} OutVars{main_~i~0=v_main_~i~0_4, main_~v~0=v_main_~v~0_7, main_#t~post2=|v_main_#t~post2_1|, main_~n~0=v_main_~n~0_9} AuxVars[] AssignedVars[main_~v~0, main_#t~nondet3, main_~i~0, main_#t~post2] {1196#(<= 1 main_~i~0)} is VALID [2022-04-07 17:03:10,556 INFO L290 TraceCheckUtils]: 8: Hoare triple {1196#(<= 1 main_~i~0)} [100] L37-->L38: Formula: (and (<= 0 v_main_~v~0_1) (< v_main_~n~0_1 2)) InVars {main_~v~0=v_main_~v~0_1, main_~n~0=v_main_~n~0_1} OutVars{main_~v~0=v_main_~v~0_1, main_~n~0=v_main_~n~0_1} AuxVars[] AssignedVars[] {1197#(<= main_~n~0 main_~i~0)} is VALID [2022-04-07 17:03:10,556 INFO L290 TraceCheckUtils]: 9: Hoare triple {1197#(<= main_~n~0 main_~i~0)} [104] L38-->L40-2: Formula: (and (= v_main_~v~0_2 0) (= v_main_~k~0_1 (+ v_main_~k~0_2 v_main_~c1~0_1))) InVars {main_~c1~0=v_main_~c1~0_1, main_~v~0=v_main_~v~0_2, main_~k~0=v_main_~k~0_2} OutVars{main_~c1~0=v_main_~c1~0_1, main_~v~0=v_main_~v~0_2, main_~k~0=v_main_~k~0_1} AuxVars[] AssignedVars[main_~k~0] {1197#(<= main_~n~0 main_~i~0)} is VALID [2022-04-07 17:03:10,557 INFO L290 TraceCheckUtils]: 10: Hoare triple {1197#(<= main_~n~0 main_~i~0)} [97] L40-2-->L37: Formula: (and (< v_main_~i~0_5 v_main_~n~0_9) (<= |v_main_#t~nondet3_2| 2147483647) (= v_main_~v~0_7 |v_main_#t~nondet3_2|) (= v_main_~i~0_4 (+ v_main_~i~0_5 1)) (<= 0 (+ |v_main_#t~nondet3_2| 2147483648))) InVars {main_~i~0=v_main_~i~0_5, main_~n~0=v_main_~n~0_9, main_#t~nondet3=|v_main_#t~nondet3_2|} OutVars{main_~i~0=v_main_~i~0_4, main_~v~0=v_main_~v~0_7, main_#t~post2=|v_main_#t~post2_1|, main_~n~0=v_main_~n~0_9} AuxVars[] AssignedVars[main_~v~0, main_#t~nondet3, main_~i~0, main_#t~post2] {1191#false} is VALID [2022-04-07 17:03:10,557 INFO L290 TraceCheckUtils]: 11: Hoare triple {1191#false} [100] L37-->L38: Formula: (and (<= 0 v_main_~v~0_1) (< v_main_~n~0_1 2)) InVars {main_~v~0=v_main_~v~0_1, main_~n~0=v_main_~n~0_1} OutVars{main_~v~0=v_main_~v~0_1, main_~n~0=v_main_~n~0_1} AuxVars[] AssignedVars[] {1191#false} is VALID [2022-04-07 17:03:10,557 INFO L290 TraceCheckUtils]: 12: Hoare triple {1191#false} [105] L38-->L40: Formula: (not (= v_main_~v~0_3 0)) InVars {main_~v~0=v_main_~v~0_3} OutVars{main_~v~0=v_main_~v~0_3} AuxVars[] AssignedVars[] {1191#false} is VALID [2022-04-07 17:03:10,557 INFO L290 TraceCheckUtils]: 13: Hoare triple {1191#false} [108] L40-->L40-2: Formula: (and (= v_main_~k~0_3 (+ v_main_~k~0_4 v_main_~c2~0_1)) (= v_main_~v~0_4 1)) InVars {main_~v~0=v_main_~v~0_4, main_~c2~0=v_main_~c2~0_1, main_~k~0=v_main_~k~0_4} OutVars{main_~v~0=v_main_~v~0_4, main_~c2~0=v_main_~c2~0_1, main_~k~0=v_main_~k~0_3} AuxVars[] AssignedVars[main_~k~0] {1191#false} is VALID [2022-04-07 17:03:10,557 INFO L290 TraceCheckUtils]: 14: Hoare triple {1191#false} [96] L40-2-->L34-2: Formula: (not (< v_main_~i~0_3 v_main_~n~0_8)) InVars {main_~i~0=v_main_~i~0_3, main_~n~0=v_main_~n~0_8} OutVars{main_~i~0=v_main_~i~0_3, main_~n~0=v_main_~n~0_8} AuxVars[] AssignedVars[] {1191#false} is VALID [2022-04-07 17:03:10,557 INFO L290 TraceCheckUtils]: 15: Hoare triple {1191#false} [98] L34-2-->L46-2: Formula: (= v_main_~j~0_2 0) InVars {} OutVars{main_~j~0=v_main_~j~0_2} AuxVars[] AssignedVars[main_~j~0] {1191#false} is VALID [2022-04-07 17:03:10,557 INFO L290 TraceCheckUtils]: 16: Hoare triple {1191#false} [103] L46-2-->L47: Formula: (< v_main_~j~0_4 v_main_~n~0_7) InVars {main_~j~0=v_main_~j~0_4, main_~n~0=v_main_~n~0_7} OutVars{main_~j~0=v_main_~j~0_4, main_~n~0=v_main_~n~0_7} AuxVars[] AssignedVars[] {1191#false} is VALID [2022-04-07 17:03:10,557 INFO L272 TraceCheckUtils]: 17: Hoare triple {1191#false} [107] L47-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (< 0 v_main_~k~0_12) 1 0)) InVars {main_~k~0=v_main_~k~0_12} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~k~0] {1191#false} is VALID [2022-04-07 17:03:10,557 INFO L290 TraceCheckUtils]: 18: Hoare triple {1191#false} [111] __VERIFIER_assertENTRY-->L18: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {1191#false} is VALID [2022-04-07 17:03:10,558 INFO L290 TraceCheckUtils]: 19: Hoare triple {1191#false} [112] L18-->L19: Formula: (= v___VERIFIER_assert_~cond_2 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {1191#false} is VALID [2022-04-07 17:03:10,558 INFO L290 TraceCheckUtils]: 20: Hoare triple {1191#false} [114] L19-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1191#false} is VALID [2022-04-07 17:03:10,558 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-07 17:03:10,558 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 17:03:10,558 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [34642655] [2022-04-07 17:03:10,558 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [34642655] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-07 17:03:10,558 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [493716110] [2022-04-07 17:03:10,558 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 17:03:10,558 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 17:03:10,558 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-07 17:03:10,559 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-07 17:03:10,589 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-04-07 17:03:10,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 17:03:10,622 INFO L263 TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 4 conjunts are in the unsatisfiable core [2022-04-07 17:03:10,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 17:03:10,627 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-07 17:03:10,698 INFO L272 TraceCheckUtils]: 0: Hoare triple {1190#true} [86] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1190#true} is VALID [2022-04-07 17:03:10,698 INFO L290 TraceCheckUtils]: 1: Hoare triple {1190#true} [88] 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] {1190#true} is VALID [2022-04-07 17:03:10,698 INFO L290 TraceCheckUtils]: 2: Hoare triple {1190#true} [91] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1190#true} is VALID [2022-04-07 17:03:10,698 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1190#true} {1190#true} [117] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1190#true} is VALID [2022-04-07 17:03:10,698 INFO L272 TraceCheckUtils]: 4: Hoare triple {1190#true} [87] L-1-->mainENTRY: Formula: (and (= |v_main_#in~argv.baseInParam_1| |v_ULTIMATE.start_#in~argv.base_2|) (= |v_main_#in~argcInParam_1| |v_ULTIMATE.start_#in~argc_2|) (= |v_main_#in~argv.offsetInParam_1| |v_ULTIMATE.start_#in~argv.offset_2|)) InVars {ULTIMATE.start_#in~argc=|v_ULTIMATE.start_#in~argc_2|, ULTIMATE.start_#in~argv.offset=|v_ULTIMATE.start_#in~argv.offset_2|, ULTIMATE.start_#in~argv.base=|v_ULTIMATE.start_#in~argv.base_2|} OutVars{main_#in~argv.base=|v_main_#in~argv.baseInParam_1|, main_#in~argc=|v_main_#in~argcInParam_1|, main_#in~argv.offset=|v_main_#in~argv.offsetInParam_1|} AuxVars[] AssignedVars[main_#in~argv.base, main_#in~argv.offset, main_#in~argc, ULTIMATE.start_#in~argc, ULTIMATE.start_#in~argv.offset, ULTIMATE.start_#in~argv.base] {1190#true} is VALID [2022-04-07 17:03:10,698 INFO L290 TraceCheckUtils]: 5: Hoare triple {1190#true} [90] mainENTRY-->L31: Formula: (and (= 10000 v_main_~c3~0_2) (= v_main_~argv.base_1 |v_main_#in~argv.base_1|) (<= |v_main_#t~nondet1_2| 2147483647) (= v_main_~n~0_2 |v_main_#t~nondet1_2|) (= |v_main_#in~argc_1| v_main_~argc_1) (= 2000 v_main_~c2~0_2) (= 4000 v_main_~c1~0_2) (= v_main_~argv.offset_1 |v_main_#in~argv.offset_1|) (<= 0 (+ |v_main_#t~nondet1_2| 2147483648))) InVars {main_#in~argv.base=|v_main_#in~argv.base_1|, main_#in~argc=|v_main_#in~argc_1|, main_#in~argv.offset=|v_main_#in~argv.offset_1|, main_#t~nondet1=|v_main_#t~nondet1_2|} OutVars{main_~c1~0=v_main_~c1~0_2, main_~v~0=v_main_~v~0_6, main_#in~argv.offset=|v_main_#in~argv.offset_1|, main_~j~0=v_main_~j~0_1, main_~argc=v_main_~argc_1, main_~c2~0=v_main_~c2~0_2, main_#in~argv.base=|v_main_#in~argv.base_1|, main_~k~0=v_main_~k~0_7, main_~i~0=v_main_~i~0_1, main_#in~argc=|v_main_#in~argc_1|, main_~n~0=v_main_~n~0_2, main_~argv.base=v_main_~argv.base_1, main_~c3~0=v_main_~c3~0_2, main_~argv.offset=v_main_~argv.offset_1} AuxVars[] AssignedVars[main_~c1~0, main_~v~0, main_#t~nondet1, main_~k~0, main_~j~0, main_~i~0, main_~n~0, main_~argc, main_~c2~0, main_~argv.base, main_~c3~0, main_~argv.offset] {1190#true} is VALID [2022-04-07 17:03:10,699 INFO L290 TraceCheckUtils]: 6: Hoare triple {1190#true} [93] L31-->L40-2: Formula: (and (<= 0 v_main_~n~0_5) (= v_main_~i~0_2 0) (< v_main_~n~0_5 10) (= v_main_~k~0_8 0)) InVars {main_~n~0=v_main_~n~0_5} OutVars{main_~i~0=v_main_~i~0_2, main_~n~0=v_main_~n~0_5, main_~k~0=v_main_~k~0_8} AuxVars[] AssignedVars[main_~k~0, main_~i~0] {1220#(<= 0 main_~i~0)} is VALID [2022-04-07 17:03:10,699 INFO L290 TraceCheckUtils]: 7: Hoare triple {1220#(<= 0 main_~i~0)} [97] L40-2-->L37: Formula: (and (< v_main_~i~0_5 v_main_~n~0_9) (<= |v_main_#t~nondet3_2| 2147483647) (= v_main_~v~0_7 |v_main_#t~nondet3_2|) (= v_main_~i~0_4 (+ v_main_~i~0_5 1)) (<= 0 (+ |v_main_#t~nondet3_2| 2147483648))) InVars {main_~i~0=v_main_~i~0_5, main_~n~0=v_main_~n~0_9, main_#t~nondet3=|v_main_#t~nondet3_2|} OutVars{main_~i~0=v_main_~i~0_4, main_~v~0=v_main_~v~0_7, main_#t~post2=|v_main_#t~post2_1|, main_~n~0=v_main_~n~0_9} AuxVars[] AssignedVars[main_~v~0, main_#t~nondet3, main_~i~0, main_#t~post2] {1196#(<= 1 main_~i~0)} is VALID [2022-04-07 17:03:10,700 INFO L290 TraceCheckUtils]: 8: Hoare triple {1196#(<= 1 main_~i~0)} [100] L37-->L38: Formula: (and (<= 0 v_main_~v~0_1) (< v_main_~n~0_1 2)) InVars {main_~v~0=v_main_~v~0_1, main_~n~0=v_main_~n~0_1} OutVars{main_~v~0=v_main_~v~0_1, main_~n~0=v_main_~n~0_1} AuxVars[] AssignedVars[] {1227#(and (< main_~n~0 2) (<= 1 main_~i~0))} is VALID [2022-04-07 17:03:10,700 INFO L290 TraceCheckUtils]: 9: Hoare triple {1227#(and (< main_~n~0 2) (<= 1 main_~i~0))} [104] L38-->L40-2: Formula: (and (= v_main_~v~0_2 0) (= v_main_~k~0_1 (+ v_main_~k~0_2 v_main_~c1~0_1))) InVars {main_~c1~0=v_main_~c1~0_1, main_~v~0=v_main_~v~0_2, main_~k~0=v_main_~k~0_2} OutVars{main_~c1~0=v_main_~c1~0_1, main_~v~0=v_main_~v~0_2, main_~k~0=v_main_~k~0_1} AuxVars[] AssignedVars[main_~k~0] {1227#(and (< main_~n~0 2) (<= 1 main_~i~0))} is VALID [2022-04-07 17:03:10,700 INFO L290 TraceCheckUtils]: 10: Hoare triple {1227#(and (< main_~n~0 2) (<= 1 main_~i~0))} [97] L40-2-->L37: Formula: (and (< v_main_~i~0_5 v_main_~n~0_9) (<= |v_main_#t~nondet3_2| 2147483647) (= v_main_~v~0_7 |v_main_#t~nondet3_2|) (= v_main_~i~0_4 (+ v_main_~i~0_5 1)) (<= 0 (+ |v_main_#t~nondet3_2| 2147483648))) InVars {main_~i~0=v_main_~i~0_5, main_~n~0=v_main_~n~0_9, main_#t~nondet3=|v_main_#t~nondet3_2|} OutVars{main_~i~0=v_main_~i~0_4, main_~v~0=v_main_~v~0_7, main_#t~post2=|v_main_#t~post2_1|, main_~n~0=v_main_~n~0_9} AuxVars[] AssignedVars[main_~v~0, main_#t~nondet3, main_~i~0, main_#t~post2] {1191#false} is VALID [2022-04-07 17:03:10,701 INFO L290 TraceCheckUtils]: 11: Hoare triple {1191#false} [100] L37-->L38: Formula: (and (<= 0 v_main_~v~0_1) (< v_main_~n~0_1 2)) InVars {main_~v~0=v_main_~v~0_1, main_~n~0=v_main_~n~0_1} OutVars{main_~v~0=v_main_~v~0_1, main_~n~0=v_main_~n~0_1} AuxVars[] AssignedVars[] {1191#false} is VALID [2022-04-07 17:03:10,701 INFO L290 TraceCheckUtils]: 12: Hoare triple {1191#false} [105] L38-->L40: Formula: (not (= v_main_~v~0_3 0)) InVars {main_~v~0=v_main_~v~0_3} OutVars{main_~v~0=v_main_~v~0_3} AuxVars[] AssignedVars[] {1191#false} is VALID [2022-04-07 17:03:10,701 INFO L290 TraceCheckUtils]: 13: Hoare triple {1191#false} [108] L40-->L40-2: Formula: (and (= v_main_~k~0_3 (+ v_main_~k~0_4 v_main_~c2~0_1)) (= v_main_~v~0_4 1)) InVars {main_~v~0=v_main_~v~0_4, main_~c2~0=v_main_~c2~0_1, main_~k~0=v_main_~k~0_4} OutVars{main_~v~0=v_main_~v~0_4, main_~c2~0=v_main_~c2~0_1, main_~k~0=v_main_~k~0_3} AuxVars[] AssignedVars[main_~k~0] {1191#false} is VALID [2022-04-07 17:03:10,701 INFO L290 TraceCheckUtils]: 14: Hoare triple {1191#false} [96] L40-2-->L34-2: Formula: (not (< v_main_~i~0_3 v_main_~n~0_8)) InVars {main_~i~0=v_main_~i~0_3, main_~n~0=v_main_~n~0_8} OutVars{main_~i~0=v_main_~i~0_3, main_~n~0=v_main_~n~0_8} AuxVars[] AssignedVars[] {1191#false} is VALID [2022-04-07 17:03:10,701 INFO L290 TraceCheckUtils]: 15: Hoare triple {1191#false} [98] L34-2-->L46-2: Formula: (= v_main_~j~0_2 0) InVars {} OutVars{main_~j~0=v_main_~j~0_2} AuxVars[] AssignedVars[main_~j~0] {1191#false} is VALID [2022-04-07 17:03:10,701 INFO L290 TraceCheckUtils]: 16: Hoare triple {1191#false} [103] L46-2-->L47: Formula: (< v_main_~j~0_4 v_main_~n~0_7) InVars {main_~j~0=v_main_~j~0_4, main_~n~0=v_main_~n~0_7} OutVars{main_~j~0=v_main_~j~0_4, main_~n~0=v_main_~n~0_7} AuxVars[] AssignedVars[] {1191#false} is VALID [2022-04-07 17:03:10,701 INFO L272 TraceCheckUtils]: 17: Hoare triple {1191#false} [107] L47-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (< 0 v_main_~k~0_12) 1 0)) InVars {main_~k~0=v_main_~k~0_12} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~k~0] {1191#false} is VALID [2022-04-07 17:03:10,701 INFO L290 TraceCheckUtils]: 18: Hoare triple {1191#false} [111] __VERIFIER_assertENTRY-->L18: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {1191#false} is VALID [2022-04-07 17:03:10,701 INFO L290 TraceCheckUtils]: 19: Hoare triple {1191#false} [112] L18-->L19: Formula: (= v___VERIFIER_assert_~cond_2 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {1191#false} is VALID [2022-04-07 17:03:10,701 INFO L290 TraceCheckUtils]: 20: Hoare triple {1191#false} [114] L19-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1191#false} is VALID [2022-04-07 17:03:10,702 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-07 17:03:10,702 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-07 17:03:10,702 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [493716110] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-07 17:03:10,702 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-04-07 17:03:10,702 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 8 [2022-04-07 17:03:10,702 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [785133484] [2022-04-07 17:03:10,702 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-07 17:03:10,703 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 21 [2022-04-07 17:03:10,703 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 17:03:10,703 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 17:03:10,713 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 21 edges. 21 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 17:03:10,714 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-07 17:03:10,714 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 17:03:10,714 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-07 17:03:10,714 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2022-04-07 17:03:10,714 INFO L87 Difference]: Start difference. First operand 46 states and 60 transitions. Second operand has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 17:03:10,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 17:03:10,746 INFO L93 Difference]: Finished difference Result 33 states and 36 transitions. [2022-04-07 17:03:10,746 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-07 17:03:10,746 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 21 [2022-04-07 17:03:10,747 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 17:03:10,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 17:03:10,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 25 transitions. [2022-04-07 17:03:10,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 17:03:10,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 25 transitions. [2022-04-07 17:03:10,748 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 25 transitions. [2022-04-07 17:03:10,770 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-07 17:03:10,771 INFO L225 Difference]: With dead ends: 33 [2022-04-07 17:03:10,771 INFO L226 Difference]: Without dead ends: 33 [2022-04-07 17:03:10,771 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2022-04-07 17:03:10,772 INFO L913 BasicCegarLoop]: 21 mSDtfsCounter, 25 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 32 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-07 17:03:10,772 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [26 Valid, 32 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-07 17:03:10,773 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2022-04-07 17:03:10,774 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 31. [2022-04-07 17:03:10,774 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 17:03:10,774 INFO L82 GeneralOperation]: Start isEquivalent. First operand 33 states. Second operand has 31 states, 22 states have (on average 1.1363636363636365) internal successors, (25), 23 states have internal predecessors, (25), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-07 17:03:10,774 INFO L74 IsIncluded]: Start isIncluded. First operand 33 states. Second operand has 31 states, 22 states have (on average 1.1363636363636365) internal successors, (25), 23 states have internal predecessors, (25), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-07 17:03:10,775 INFO L87 Difference]: Start difference. First operand 33 states. Second operand has 31 states, 22 states have (on average 1.1363636363636365) internal successors, (25), 23 states have internal predecessors, (25), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-07 17:03:10,776 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 17:03:10,776 INFO L93 Difference]: Finished difference Result 33 states and 36 transitions. [2022-04-07 17:03:10,776 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 36 transitions. [2022-04-07 17:03:10,776 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 17:03:10,776 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 17:03:10,776 INFO L74 IsIncluded]: Start isIncluded. First operand has 31 states, 22 states have (on average 1.1363636363636365) internal successors, (25), 23 states have internal predecessors, (25), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) Second operand 33 states. [2022-04-07 17:03:10,776 INFO L87 Difference]: Start difference. First operand has 31 states, 22 states have (on average 1.1363636363636365) internal successors, (25), 23 states have internal predecessors, (25), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) Second operand 33 states. [2022-04-07 17:03:10,777 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 17:03:10,777 INFO L93 Difference]: Finished difference Result 33 states and 36 transitions. [2022-04-07 17:03:10,777 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 36 transitions. [2022-04-07 17:03:10,777 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 17:03:10,778 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 17:03:10,778 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 17:03:10,778 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 17:03:10,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 22 states have (on average 1.1363636363636365) internal successors, (25), 23 states have internal predecessors, (25), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-07 17:03:10,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 34 transitions. [2022-04-07 17:03:10,779 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 34 transitions. Word has length 21 [2022-04-07 17:03:10,779 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 17:03:10,779 INFO L478 AbstractCegarLoop]: Abstraction has 31 states and 34 transitions. [2022-04-07 17:03:10,779 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 17:03:10,779 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 34 transitions. [2022-04-07 17:03:10,779 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-04-07 17:03:10,779 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 17:03:10,779 INFO L499 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-07 17:03:10,796 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2022-04-07 17:03:10,995 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 17:03:10,995 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 17:03:10,996 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 17:03:10,996 INFO L85 PathProgramCache]: Analyzing trace with hash -186078045, now seen corresponding path program 1 times [2022-04-07 17:03:10,996 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 17:03:10,996 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [127224381] [2022-04-07 17:03:10,996 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 17:03:10,996 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 17:03:11,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 17:03:11,072 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-07 17:03:11,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 17:03:11,084 INFO L290 TraceCheckUtils]: 0: Hoare triple {1413#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [88] 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] {1393#true} is VALID [2022-04-07 17:03:11,085 INFO L290 TraceCheckUtils]: 1: Hoare triple {1393#true} [91] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1393#true} is VALID [2022-04-07 17:03:11,085 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1393#true} {1393#true} [117] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1393#true} is VALID [2022-04-07 17:03:11,085 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-04-07 17:03:11,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 17:03:11,098 INFO L290 TraceCheckUtils]: 0: Hoare triple {1393#true} [111] __VERIFIER_assertENTRY-->L18: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {1393#true} is VALID [2022-04-07 17:03:11,098 INFO L290 TraceCheckUtils]: 1: Hoare triple {1393#true} [113] L18-->L18-2: Formula: (not (= 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[] {1393#true} is VALID [2022-04-07 17:03:11,098 INFO L290 TraceCheckUtils]: 2: Hoare triple {1393#true} [116] L18-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1393#true} is VALID [2022-04-07 17:03:11,099 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1393#true} {1400#(<= 4000 main_~k~0)} [119] __VERIFIER_assertEXIT-->L47-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (< 0 v_main_~k~0_12) 1 0)) InVars {main_~k~0=v_main_~k~0_12} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~k~0] {1400#(<= 4000 main_~k~0)} is VALID [2022-04-07 17:03:11,099 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-04-07 17:03:11,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 17:03:11,103 INFO L290 TraceCheckUtils]: 0: Hoare triple {1393#true} [111] __VERIFIER_assertENTRY-->L18: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {1393#true} is VALID [2022-04-07 17:03:11,103 INFO L290 TraceCheckUtils]: 1: Hoare triple {1393#true} [113] L18-->L18-2: Formula: (not (= 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[] {1393#true} is VALID [2022-04-07 17:03:11,103 INFO L290 TraceCheckUtils]: 2: Hoare triple {1393#true} [116] L18-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1393#true} is VALID [2022-04-07 17:03:11,104 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1393#true} {1405#(<= 3999 main_~k~0)} [119] __VERIFIER_assertEXIT-->L47-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (< 0 v_main_~k~0_12) 1 0)) InVars {main_~k~0=v_main_~k~0_12} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~k~0] {1405#(<= 3999 main_~k~0)} is VALID [2022-04-07 17:03:11,105 INFO L272 TraceCheckUtils]: 0: Hoare triple {1393#true} [86] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1413#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-07 17:03:11,105 INFO L290 TraceCheckUtils]: 1: Hoare triple {1413#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [88] 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] {1393#true} is VALID [2022-04-07 17:03:11,105 INFO L290 TraceCheckUtils]: 2: Hoare triple {1393#true} [91] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1393#true} is VALID [2022-04-07 17:03:11,105 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1393#true} {1393#true} [117] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1393#true} is VALID [2022-04-07 17:03:11,105 INFO L272 TraceCheckUtils]: 4: Hoare triple {1393#true} [87] L-1-->mainENTRY: Formula: (and (= |v_main_#in~argv.baseInParam_1| |v_ULTIMATE.start_#in~argv.base_2|) (= |v_main_#in~argcInParam_1| |v_ULTIMATE.start_#in~argc_2|) (= |v_main_#in~argv.offsetInParam_1| |v_ULTIMATE.start_#in~argv.offset_2|)) InVars {ULTIMATE.start_#in~argc=|v_ULTIMATE.start_#in~argc_2|, ULTIMATE.start_#in~argv.offset=|v_ULTIMATE.start_#in~argv.offset_2|, ULTIMATE.start_#in~argv.base=|v_ULTIMATE.start_#in~argv.base_2|} OutVars{main_#in~argv.base=|v_main_#in~argv.baseInParam_1|, main_#in~argc=|v_main_#in~argcInParam_1|, main_#in~argv.offset=|v_main_#in~argv.offsetInParam_1|} AuxVars[] AssignedVars[main_#in~argv.base, main_#in~argv.offset, main_#in~argc, ULTIMATE.start_#in~argc, ULTIMATE.start_#in~argv.offset, ULTIMATE.start_#in~argv.base] {1393#true} is VALID [2022-04-07 17:03:11,106 INFO L290 TraceCheckUtils]: 5: Hoare triple {1393#true} [90] mainENTRY-->L31: Formula: (and (= 10000 v_main_~c3~0_2) (= v_main_~argv.base_1 |v_main_#in~argv.base_1|) (<= |v_main_#t~nondet1_2| 2147483647) (= v_main_~n~0_2 |v_main_#t~nondet1_2|) (= |v_main_#in~argc_1| v_main_~argc_1) (= 2000 v_main_~c2~0_2) (= 4000 v_main_~c1~0_2) (= v_main_~argv.offset_1 |v_main_#in~argv.offset_1|) (<= 0 (+ |v_main_#t~nondet1_2| 2147483648))) InVars {main_#in~argv.base=|v_main_#in~argv.base_1|, main_#in~argc=|v_main_#in~argc_1|, main_#in~argv.offset=|v_main_#in~argv.offset_1|, main_#t~nondet1=|v_main_#t~nondet1_2|} OutVars{main_~c1~0=v_main_~c1~0_2, main_~v~0=v_main_~v~0_6, main_#in~argv.offset=|v_main_#in~argv.offset_1|, main_~j~0=v_main_~j~0_1, main_~argc=v_main_~argc_1, main_~c2~0=v_main_~c2~0_2, main_#in~argv.base=|v_main_#in~argv.base_1|, main_~k~0=v_main_~k~0_7, main_~i~0=v_main_~i~0_1, main_#in~argc=|v_main_#in~argc_1|, main_~n~0=v_main_~n~0_2, main_~argv.base=v_main_~argv.base_1, main_~c3~0=v_main_~c3~0_2, main_~argv.offset=v_main_~argv.offset_1} AuxVars[] AssignedVars[main_~c1~0, main_~v~0, main_#t~nondet1, main_~k~0, main_~j~0, main_~i~0, main_~n~0, main_~argc, main_~c2~0, main_~argv.base, main_~c3~0, main_~argv.offset] {1398#(<= 4000 main_~c1~0)} is VALID [2022-04-07 17:03:11,106 INFO L290 TraceCheckUtils]: 6: Hoare triple {1398#(<= 4000 main_~c1~0)} [93] L31-->L40-2: Formula: (and (<= 0 v_main_~n~0_5) (= v_main_~i~0_2 0) (< v_main_~n~0_5 10) (= v_main_~k~0_8 0)) InVars {main_~n~0=v_main_~n~0_5} OutVars{main_~i~0=v_main_~i~0_2, main_~n~0=v_main_~n~0_5, main_~k~0=v_main_~k~0_8} AuxVars[] AssignedVars[main_~k~0, main_~i~0] {1399#(and (= main_~k~0 0) (<= 4000 main_~c1~0))} is VALID [2022-04-07 17:03:11,107 INFO L290 TraceCheckUtils]: 7: Hoare triple {1399#(and (= main_~k~0 0) (<= 4000 main_~c1~0))} [97] L40-2-->L37: Formula: (and (< v_main_~i~0_5 v_main_~n~0_9) (<= |v_main_#t~nondet3_2| 2147483647) (= v_main_~v~0_7 |v_main_#t~nondet3_2|) (= v_main_~i~0_4 (+ v_main_~i~0_5 1)) (<= 0 (+ |v_main_#t~nondet3_2| 2147483648))) InVars {main_~i~0=v_main_~i~0_5, main_~n~0=v_main_~n~0_9, main_#t~nondet3=|v_main_#t~nondet3_2|} OutVars{main_~i~0=v_main_~i~0_4, main_~v~0=v_main_~v~0_7, main_#t~post2=|v_main_#t~post2_1|, main_~n~0=v_main_~n~0_9} AuxVars[] AssignedVars[main_~v~0, main_#t~nondet3, main_~i~0, main_#t~post2] {1399#(and (= main_~k~0 0) (<= 4000 main_~c1~0))} is VALID [2022-04-07 17:03:11,107 INFO L290 TraceCheckUtils]: 8: Hoare triple {1399#(and (= main_~k~0 0) (<= 4000 main_~c1~0))} [100] L37-->L38: Formula: (and (<= 0 v_main_~v~0_1) (< v_main_~n~0_1 2)) InVars {main_~v~0=v_main_~v~0_1, main_~n~0=v_main_~n~0_1} OutVars{main_~v~0=v_main_~v~0_1, main_~n~0=v_main_~n~0_1} AuxVars[] AssignedVars[] {1399#(and (= main_~k~0 0) (<= 4000 main_~c1~0))} is VALID [2022-04-07 17:03:11,108 INFO L290 TraceCheckUtils]: 9: Hoare triple {1399#(and (= main_~k~0 0) (<= 4000 main_~c1~0))} [104] L38-->L40-2: Formula: (and (= v_main_~v~0_2 0) (= v_main_~k~0_1 (+ v_main_~k~0_2 v_main_~c1~0_1))) InVars {main_~c1~0=v_main_~c1~0_1, main_~v~0=v_main_~v~0_2, main_~k~0=v_main_~k~0_2} OutVars{main_~c1~0=v_main_~c1~0_1, main_~v~0=v_main_~v~0_2, main_~k~0=v_main_~k~0_1} AuxVars[] AssignedVars[main_~k~0] {1400#(<= 4000 main_~k~0)} is VALID [2022-04-07 17:03:11,108 INFO L290 TraceCheckUtils]: 10: Hoare triple {1400#(<= 4000 main_~k~0)} [96] L40-2-->L34-2: Formula: (not (< v_main_~i~0_3 v_main_~n~0_8)) InVars {main_~i~0=v_main_~i~0_3, main_~n~0=v_main_~n~0_8} OutVars{main_~i~0=v_main_~i~0_3, main_~n~0=v_main_~n~0_8} AuxVars[] AssignedVars[] {1400#(<= 4000 main_~k~0)} is VALID [2022-04-07 17:03:11,108 INFO L290 TraceCheckUtils]: 11: Hoare triple {1400#(<= 4000 main_~k~0)} [98] L34-2-->L46-2: Formula: (= v_main_~j~0_2 0) InVars {} OutVars{main_~j~0=v_main_~j~0_2} AuxVars[] AssignedVars[main_~j~0] {1400#(<= 4000 main_~k~0)} is VALID [2022-04-07 17:03:11,108 INFO L290 TraceCheckUtils]: 12: Hoare triple {1400#(<= 4000 main_~k~0)} [103] L46-2-->L47: Formula: (< v_main_~j~0_4 v_main_~n~0_7) InVars {main_~j~0=v_main_~j~0_4, main_~n~0=v_main_~n~0_7} OutVars{main_~j~0=v_main_~j~0_4, main_~n~0=v_main_~n~0_7} AuxVars[] AssignedVars[] {1400#(<= 4000 main_~k~0)} is VALID [2022-04-07 17:03:11,109 INFO L272 TraceCheckUtils]: 13: Hoare triple {1400#(<= 4000 main_~k~0)} [107] L47-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (< 0 v_main_~k~0_12) 1 0)) InVars {main_~k~0=v_main_~k~0_12} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~k~0] {1393#true} is VALID [2022-04-07 17:03:11,109 INFO L290 TraceCheckUtils]: 14: Hoare triple {1393#true} [111] __VERIFIER_assertENTRY-->L18: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {1393#true} is VALID [2022-04-07 17:03:11,109 INFO L290 TraceCheckUtils]: 15: Hoare triple {1393#true} [113] L18-->L18-2: Formula: (not (= 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[] {1393#true} is VALID [2022-04-07 17:03:11,109 INFO L290 TraceCheckUtils]: 16: Hoare triple {1393#true} [116] L18-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1393#true} is VALID [2022-04-07 17:03:11,109 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {1393#true} {1400#(<= 4000 main_~k~0)} [119] __VERIFIER_assertEXIT-->L47-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (< 0 v_main_~k~0_12) 1 0)) InVars {main_~k~0=v_main_~k~0_12} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~k~0] {1400#(<= 4000 main_~k~0)} is VALID [2022-04-07 17:03:11,110 INFO L290 TraceCheckUtils]: 18: Hoare triple {1400#(<= 4000 main_~k~0)} [110] L47-1-->L46-2: Formula: (and (= v_main_~j~0_5 (+ v_main_~j~0_6 1)) (= v_main_~k~0_11 (+ v_main_~k~0_10 1))) InVars {main_~k~0=v_main_~k~0_11, main_~j~0=v_main_~j~0_6} OutVars{main_#t~post4=|v_main_#t~post4_1|, main_#t~post5=|v_main_#t~post5_1|, main_~k~0=v_main_~k~0_10, main_~j~0=v_main_~j~0_5} AuxVars[] AssignedVars[main_~k~0, main_~j~0, main_#t~post4, main_#t~post5] {1405#(<= 3999 main_~k~0)} is VALID [2022-04-07 17:03:11,110 INFO L290 TraceCheckUtils]: 19: Hoare triple {1405#(<= 3999 main_~k~0)} [103] L46-2-->L47: Formula: (< v_main_~j~0_4 v_main_~n~0_7) InVars {main_~j~0=v_main_~j~0_4, main_~n~0=v_main_~n~0_7} OutVars{main_~j~0=v_main_~j~0_4, main_~n~0=v_main_~n~0_7} AuxVars[] AssignedVars[] {1405#(<= 3999 main_~k~0)} is VALID [2022-04-07 17:03:11,110 INFO L272 TraceCheckUtils]: 20: Hoare triple {1405#(<= 3999 main_~k~0)} [107] L47-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (< 0 v_main_~k~0_12) 1 0)) InVars {main_~k~0=v_main_~k~0_12} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~k~0] {1393#true} is VALID [2022-04-07 17:03:11,110 INFO L290 TraceCheckUtils]: 21: Hoare triple {1393#true} [111] __VERIFIER_assertENTRY-->L18: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {1393#true} is VALID [2022-04-07 17:03:11,110 INFO L290 TraceCheckUtils]: 22: Hoare triple {1393#true} [113] L18-->L18-2: Formula: (not (= 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[] {1393#true} is VALID [2022-04-07 17:03:11,110 INFO L290 TraceCheckUtils]: 23: Hoare triple {1393#true} [116] L18-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1393#true} is VALID [2022-04-07 17:03:11,111 INFO L284 TraceCheckUtils]: 24: Hoare quadruple {1393#true} {1405#(<= 3999 main_~k~0)} [119] __VERIFIER_assertEXIT-->L47-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (< 0 v_main_~k~0_12) 1 0)) InVars {main_~k~0=v_main_~k~0_12} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~k~0] {1405#(<= 3999 main_~k~0)} is VALID [2022-04-07 17:03:11,112 INFO L290 TraceCheckUtils]: 25: Hoare triple {1405#(<= 3999 main_~k~0)} [110] L47-1-->L46-2: Formula: (and (= v_main_~j~0_5 (+ v_main_~j~0_6 1)) (= v_main_~k~0_11 (+ v_main_~k~0_10 1))) InVars {main_~k~0=v_main_~k~0_11, main_~j~0=v_main_~j~0_6} OutVars{main_#t~post4=|v_main_#t~post4_1|, main_#t~post5=|v_main_#t~post5_1|, main_~k~0=v_main_~k~0_10, main_~j~0=v_main_~j~0_5} AuxVars[] AssignedVars[main_~k~0, main_~j~0, main_#t~post4, main_#t~post5] {1410#(<= 3998 main_~k~0)} is VALID [2022-04-07 17:03:11,113 INFO L290 TraceCheckUtils]: 26: Hoare triple {1410#(<= 3998 main_~k~0)} [103] L46-2-->L47: Formula: (< v_main_~j~0_4 v_main_~n~0_7) InVars {main_~j~0=v_main_~j~0_4, main_~n~0=v_main_~n~0_7} OutVars{main_~j~0=v_main_~j~0_4, main_~n~0=v_main_~n~0_7} AuxVars[] AssignedVars[] {1410#(<= 3998 main_~k~0)} is VALID [2022-04-07 17:03:11,113 INFO L272 TraceCheckUtils]: 27: Hoare triple {1410#(<= 3998 main_~k~0)} [107] L47-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (< 0 v_main_~k~0_12) 1 0)) InVars {main_~k~0=v_main_~k~0_12} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~k~0] {1411#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-07 17:03:11,114 INFO L290 TraceCheckUtils]: 28: Hoare triple {1411#(not (= |__VERIFIER_assert_#in~cond| 0))} [111] __VERIFIER_assertENTRY-->L18: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {1412#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-07 17:03:11,114 INFO L290 TraceCheckUtils]: 29: Hoare triple {1412#(not (= __VERIFIER_assert_~cond 0))} [112] L18-->L19: Formula: (= v___VERIFIER_assert_~cond_2 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {1394#false} is VALID [2022-04-07 17:03:11,114 INFO L290 TraceCheckUtils]: 30: Hoare triple {1394#false} [114] L19-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1394#false} is VALID [2022-04-07 17:03:11,114 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 4 proven. 8 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-07 17:03:11,114 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 17:03:11,114 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [127224381] [2022-04-07 17:03:11,115 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [127224381] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-07 17:03:11,115 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1940033634] [2022-04-07 17:03:11,115 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 17:03:11,115 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 17:03:11,115 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-07 17:03:11,117 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-07 17:03:11,118 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-04-07 17:03:11,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 17:03:11,153 INFO L263 TraceCheckSpWp]: Trace formula consists of 116 conjuncts, 4 conjunts are in the unsatisfiable core [2022-04-07 17:03:11,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 17:03:11,161 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-07 17:03:11,311 INFO L272 TraceCheckUtils]: 0: Hoare triple {1393#true} [86] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1393#true} is VALID [2022-04-07 17:03:11,311 INFO L290 TraceCheckUtils]: 1: Hoare triple {1393#true} [88] 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] {1393#true} is VALID [2022-04-07 17:03:11,311 INFO L290 TraceCheckUtils]: 2: Hoare triple {1393#true} [91] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1393#true} is VALID [2022-04-07 17:03:11,311 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1393#true} {1393#true} [117] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1393#true} is VALID [2022-04-07 17:03:11,311 INFO L272 TraceCheckUtils]: 4: Hoare triple {1393#true} [87] L-1-->mainENTRY: Formula: (and (= |v_main_#in~argv.baseInParam_1| |v_ULTIMATE.start_#in~argv.base_2|) (= |v_main_#in~argcInParam_1| |v_ULTIMATE.start_#in~argc_2|) (= |v_main_#in~argv.offsetInParam_1| |v_ULTIMATE.start_#in~argv.offset_2|)) InVars {ULTIMATE.start_#in~argc=|v_ULTIMATE.start_#in~argc_2|, ULTIMATE.start_#in~argv.offset=|v_ULTIMATE.start_#in~argv.offset_2|, ULTIMATE.start_#in~argv.base=|v_ULTIMATE.start_#in~argv.base_2|} OutVars{main_#in~argv.base=|v_main_#in~argv.baseInParam_1|, main_#in~argc=|v_main_#in~argcInParam_1|, main_#in~argv.offset=|v_main_#in~argv.offsetInParam_1|} AuxVars[] AssignedVars[main_#in~argv.base, main_#in~argv.offset, main_#in~argc, ULTIMATE.start_#in~argc, ULTIMATE.start_#in~argv.offset, ULTIMATE.start_#in~argv.base] {1393#true} is VALID [2022-04-07 17:03:11,311 INFO L290 TraceCheckUtils]: 5: Hoare triple {1393#true} [90] mainENTRY-->L31: Formula: (and (= 10000 v_main_~c3~0_2) (= v_main_~argv.base_1 |v_main_#in~argv.base_1|) (<= |v_main_#t~nondet1_2| 2147483647) (= v_main_~n~0_2 |v_main_#t~nondet1_2|) (= |v_main_#in~argc_1| v_main_~argc_1) (= 2000 v_main_~c2~0_2) (= 4000 v_main_~c1~0_2) (= v_main_~argv.offset_1 |v_main_#in~argv.offset_1|) (<= 0 (+ |v_main_#t~nondet1_2| 2147483648))) InVars {main_#in~argv.base=|v_main_#in~argv.base_1|, main_#in~argc=|v_main_#in~argc_1|, main_#in~argv.offset=|v_main_#in~argv.offset_1|, main_#t~nondet1=|v_main_#t~nondet1_2|} OutVars{main_~c1~0=v_main_~c1~0_2, main_~v~0=v_main_~v~0_6, main_#in~argv.offset=|v_main_#in~argv.offset_1|, main_~j~0=v_main_~j~0_1, main_~argc=v_main_~argc_1, main_~c2~0=v_main_~c2~0_2, main_#in~argv.base=|v_main_#in~argv.base_1|, main_~k~0=v_main_~k~0_7, main_~i~0=v_main_~i~0_1, main_#in~argc=|v_main_#in~argc_1|, main_~n~0=v_main_~n~0_2, main_~argv.base=v_main_~argv.base_1, main_~c3~0=v_main_~c3~0_2, main_~argv.offset=v_main_~argv.offset_1} AuxVars[] AssignedVars[main_~c1~0, main_~v~0, main_#t~nondet1, main_~k~0, main_~j~0, main_~i~0, main_~n~0, main_~argc, main_~c2~0, main_~argv.base, main_~c3~0, main_~argv.offset] {1393#true} is VALID [2022-04-07 17:03:11,311 INFO L290 TraceCheckUtils]: 6: Hoare triple {1393#true} [93] L31-->L40-2: Formula: (and (<= 0 v_main_~n~0_5) (= v_main_~i~0_2 0) (< v_main_~n~0_5 10) (= v_main_~k~0_8 0)) InVars {main_~n~0=v_main_~n~0_5} OutVars{main_~i~0=v_main_~i~0_2, main_~n~0=v_main_~n~0_5, main_~k~0=v_main_~k~0_8} AuxVars[] AssignedVars[main_~k~0, main_~i~0] {1393#true} is VALID [2022-04-07 17:03:11,312 INFO L290 TraceCheckUtils]: 7: Hoare triple {1393#true} [97] L40-2-->L37: Formula: (and (< v_main_~i~0_5 v_main_~n~0_9) (<= |v_main_#t~nondet3_2| 2147483647) (= v_main_~v~0_7 |v_main_#t~nondet3_2|) (= v_main_~i~0_4 (+ v_main_~i~0_5 1)) (<= 0 (+ |v_main_#t~nondet3_2| 2147483648))) InVars {main_~i~0=v_main_~i~0_5, main_~n~0=v_main_~n~0_9, main_#t~nondet3=|v_main_#t~nondet3_2|} OutVars{main_~i~0=v_main_~i~0_4, main_~v~0=v_main_~v~0_7, main_#t~post2=|v_main_#t~post2_1|, main_~n~0=v_main_~n~0_9} AuxVars[] AssignedVars[main_~v~0, main_#t~nondet3, main_~i~0, main_#t~post2] {1393#true} is VALID [2022-04-07 17:03:11,312 INFO L290 TraceCheckUtils]: 8: Hoare triple {1393#true} [100] L37-->L38: Formula: (and (<= 0 v_main_~v~0_1) (< v_main_~n~0_1 2)) InVars {main_~v~0=v_main_~v~0_1, main_~n~0=v_main_~n~0_1} OutVars{main_~v~0=v_main_~v~0_1, main_~n~0=v_main_~n~0_1} AuxVars[] AssignedVars[] {1441#(< main_~n~0 2)} is VALID [2022-04-07 17:03:11,312 INFO L290 TraceCheckUtils]: 9: Hoare triple {1441#(< main_~n~0 2)} [104] L38-->L40-2: Formula: (and (= v_main_~v~0_2 0) (= v_main_~k~0_1 (+ v_main_~k~0_2 v_main_~c1~0_1))) InVars {main_~c1~0=v_main_~c1~0_1, main_~v~0=v_main_~v~0_2, main_~k~0=v_main_~k~0_2} OutVars{main_~c1~0=v_main_~c1~0_1, main_~v~0=v_main_~v~0_2, main_~k~0=v_main_~k~0_1} AuxVars[] AssignedVars[main_~k~0] {1441#(< main_~n~0 2)} is VALID [2022-04-07 17:03:11,312 INFO L290 TraceCheckUtils]: 10: Hoare triple {1441#(< main_~n~0 2)} [96] L40-2-->L34-2: Formula: (not (< v_main_~i~0_3 v_main_~n~0_8)) InVars {main_~i~0=v_main_~i~0_3, main_~n~0=v_main_~n~0_8} OutVars{main_~i~0=v_main_~i~0_3, main_~n~0=v_main_~n~0_8} AuxVars[] AssignedVars[] {1441#(< main_~n~0 2)} is VALID [2022-04-07 17:03:11,313 INFO L290 TraceCheckUtils]: 11: Hoare triple {1441#(< main_~n~0 2)} [98] L34-2-->L46-2: Formula: (= v_main_~j~0_2 0) InVars {} OutVars{main_~j~0=v_main_~j~0_2} AuxVars[] AssignedVars[main_~j~0] {1451#(and (<= 0 main_~j~0) (< main_~n~0 2))} is VALID [2022-04-07 17:03:11,313 INFO L290 TraceCheckUtils]: 12: Hoare triple {1451#(and (<= 0 main_~j~0) (< main_~n~0 2))} [103] L46-2-->L47: Formula: (< v_main_~j~0_4 v_main_~n~0_7) InVars {main_~j~0=v_main_~j~0_4, main_~n~0=v_main_~n~0_7} OutVars{main_~j~0=v_main_~j~0_4, main_~n~0=v_main_~n~0_7} AuxVars[] AssignedVars[] {1451#(and (<= 0 main_~j~0) (< main_~n~0 2))} is VALID [2022-04-07 17:03:11,313 INFO L272 TraceCheckUtils]: 13: Hoare triple {1451#(and (<= 0 main_~j~0) (< main_~n~0 2))} [107] L47-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (< 0 v_main_~k~0_12) 1 0)) InVars {main_~k~0=v_main_~k~0_12} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~k~0] {1393#true} is VALID [2022-04-07 17:03:11,313 INFO L290 TraceCheckUtils]: 14: Hoare triple {1393#true} [111] __VERIFIER_assertENTRY-->L18: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {1393#true} is VALID [2022-04-07 17:03:11,313 INFO L290 TraceCheckUtils]: 15: Hoare triple {1393#true} [113] L18-->L18-2: Formula: (not (= 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[] {1393#true} is VALID [2022-04-07 17:03:11,313 INFO L290 TraceCheckUtils]: 16: Hoare triple {1393#true} [116] L18-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1393#true} is VALID [2022-04-07 17:03:11,314 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {1393#true} {1451#(and (<= 0 main_~j~0) (< main_~n~0 2))} [119] __VERIFIER_assertEXIT-->L47-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (< 0 v_main_~k~0_12) 1 0)) InVars {main_~k~0=v_main_~k~0_12} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~k~0] {1451#(and (<= 0 main_~j~0) (< main_~n~0 2))} is VALID [2022-04-07 17:03:11,314 INFO L290 TraceCheckUtils]: 18: Hoare triple {1451#(and (<= 0 main_~j~0) (< main_~n~0 2))} [110] L47-1-->L46-2: Formula: (and (= v_main_~j~0_5 (+ v_main_~j~0_6 1)) (= v_main_~k~0_11 (+ v_main_~k~0_10 1))) InVars {main_~k~0=v_main_~k~0_11, main_~j~0=v_main_~j~0_6} OutVars{main_#t~post4=|v_main_#t~post4_1|, main_#t~post5=|v_main_#t~post5_1|, main_~k~0=v_main_~k~0_10, main_~j~0=v_main_~j~0_5} AuxVars[] AssignedVars[main_~k~0, main_~j~0, main_#t~post4, main_#t~post5] {1473#(and (<= 1 main_~j~0) (< main_~n~0 2))} is VALID [2022-04-07 17:03:11,315 INFO L290 TraceCheckUtils]: 19: Hoare triple {1473#(and (<= 1 main_~j~0) (< main_~n~0 2))} [103] L46-2-->L47: Formula: (< v_main_~j~0_4 v_main_~n~0_7) InVars {main_~j~0=v_main_~j~0_4, main_~n~0=v_main_~n~0_7} OutVars{main_~j~0=v_main_~j~0_4, main_~n~0=v_main_~n~0_7} AuxVars[] AssignedVars[] {1394#false} is VALID [2022-04-07 17:03:11,315 INFO L272 TraceCheckUtils]: 20: Hoare triple {1394#false} [107] L47-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (< 0 v_main_~k~0_12) 1 0)) InVars {main_~k~0=v_main_~k~0_12} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~k~0] {1394#false} is VALID [2022-04-07 17:03:11,315 INFO L290 TraceCheckUtils]: 21: Hoare triple {1394#false} [111] __VERIFIER_assertENTRY-->L18: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {1394#false} is VALID [2022-04-07 17:03:11,315 INFO L290 TraceCheckUtils]: 22: Hoare triple {1394#false} [113] L18-->L18-2: Formula: (not (= 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[] {1394#false} is VALID [2022-04-07 17:03:11,315 INFO L290 TraceCheckUtils]: 23: Hoare triple {1394#false} [116] L18-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1394#false} is VALID [2022-04-07 17:03:11,315 INFO L284 TraceCheckUtils]: 24: Hoare quadruple {1394#false} {1394#false} [119] __VERIFIER_assertEXIT-->L47-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (< 0 v_main_~k~0_12) 1 0)) InVars {main_~k~0=v_main_~k~0_12} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~k~0] {1394#false} is VALID [2022-04-07 17:03:11,315 INFO L290 TraceCheckUtils]: 25: Hoare triple {1394#false} [110] L47-1-->L46-2: Formula: (and (= v_main_~j~0_5 (+ v_main_~j~0_6 1)) (= v_main_~k~0_11 (+ v_main_~k~0_10 1))) InVars {main_~k~0=v_main_~k~0_11, main_~j~0=v_main_~j~0_6} OutVars{main_#t~post4=|v_main_#t~post4_1|, main_#t~post5=|v_main_#t~post5_1|, main_~k~0=v_main_~k~0_10, main_~j~0=v_main_~j~0_5} AuxVars[] AssignedVars[main_~k~0, main_~j~0, main_#t~post4, main_#t~post5] {1394#false} is VALID [2022-04-07 17:03:11,315 INFO L290 TraceCheckUtils]: 26: Hoare triple {1394#false} [103] L46-2-->L47: Formula: (< v_main_~j~0_4 v_main_~n~0_7) InVars {main_~j~0=v_main_~j~0_4, main_~n~0=v_main_~n~0_7} OutVars{main_~j~0=v_main_~j~0_4, main_~n~0=v_main_~n~0_7} AuxVars[] AssignedVars[] {1394#false} is VALID [2022-04-07 17:03:11,315 INFO L272 TraceCheckUtils]: 27: Hoare triple {1394#false} [107] L47-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (< 0 v_main_~k~0_12) 1 0)) InVars {main_~k~0=v_main_~k~0_12} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~k~0] {1394#false} is VALID [2022-04-07 17:03:11,316 INFO L290 TraceCheckUtils]: 28: Hoare triple {1394#false} [111] __VERIFIER_assertENTRY-->L18: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {1394#false} is VALID [2022-04-07 17:03:11,316 INFO L290 TraceCheckUtils]: 29: Hoare triple {1394#false} [112] L18-->L19: Formula: (= v___VERIFIER_assert_~cond_2 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {1394#false} is VALID [2022-04-07 17:03:11,316 INFO L290 TraceCheckUtils]: 30: Hoare triple {1394#false} [114] L19-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1394#false} is VALID [2022-04-07 17:03:11,316 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-04-07 17:03:11,316 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-07 17:03:11,316 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1940033634] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-07 17:03:11,316 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-04-07 17:03:11,316 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [10] total 13 [2022-04-07 17:03:11,316 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [700033452] [2022-04-07 17:03:11,316 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-07 17:03:11,317 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.4) internal successors, (22), 5 states have internal predecessors, (22), 3 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 31 [2022-04-07 17:03:11,317 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 17:03:11,317 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 4.4) internal successors, (22), 5 states have internal predecessors, (22), 3 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-07 17:03:11,333 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 29 edges. 29 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 17:03:11,333 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-07 17:03:11,333 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 17:03:11,333 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-07 17:03:11,334 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2022-04-07 17:03:11,334 INFO L87 Difference]: Start difference. First operand 31 states and 34 transitions. Second operand has 5 states, 5 states have (on average 4.4) internal successors, (22), 5 states have internal predecessors, (22), 3 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-07 17:03:11,374 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 17:03:11,374 INFO L93 Difference]: Finished difference Result 21 states and 22 transitions. [2022-04-07 17:03:11,374 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-07 17:03:11,374 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.4) internal successors, (22), 5 states have internal predecessors, (22), 3 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 31 [2022-04-07 17:03:11,375 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 17:03:11,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 4.4) internal successors, (22), 5 states have internal predecessors, (22), 3 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-07 17:03:11,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 23 transitions. [2022-04-07 17:03:11,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 4.4) internal successors, (22), 5 states have internal predecessors, (22), 3 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-07 17:03:11,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 23 transitions. [2022-04-07 17:03:11,376 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 23 transitions. [2022-04-07 17:03:11,389 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 23 edges. 23 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 17:03:11,389 INFO L225 Difference]: With dead ends: 21 [2022-04-07 17:03:11,389 INFO L226 Difference]: Without dead ends: 0 [2022-04-07 17:03:11,389 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2022-04-07 17:03:11,390 INFO L913 BasicCegarLoop]: 19 mSDtfsCounter, 5 mSDsluCounter, 35 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 54 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-07 17:03:11,390 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [5 Valid, 54 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-07 17:03:11,391 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-04-07 17:03:11,391 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-04-07 17:03:11,391 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 17:03:11,391 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-07 17:03:11,391 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-07 17:03:11,391 INFO L87 Difference]: Start difference. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-07 17:03:11,391 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 17:03:11,391 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-07 17:03:11,391 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-07 17:03:11,391 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 17:03:11,391 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 17:03:11,391 INFO L74 IsIncluded]: Start isIncluded. First operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 0 states. [2022-04-07 17:03:11,391 INFO L87 Difference]: Start difference. First operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 0 states. [2022-04-07 17:03:11,391 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 17:03:11,392 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-07 17:03:11,392 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-07 17:03:11,392 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 17:03:11,392 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 17:03:11,392 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 17:03:11,392 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 17:03:11,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-07 17:03:11,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-04-07 17:03:11,392 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 31 [2022-04-07 17:03:11,392 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 17:03:11,392 INFO L478 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-04-07 17:03:11,392 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.4) internal successors, (22), 5 states have internal predecessors, (22), 3 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-07 17:03:11,392 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-07 17:03:11,392 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 17:03:11,394 INFO L788 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-04-07 17:03:11,433 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-04-07 17:03:11,595 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 17:03:11,597 INFO L719 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1] [2022-04-07 17:03:11,598 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-04-07 17:03:11,600 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.04 05:03:11 BasicIcfg [2022-04-07 17:03:11,600 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-04-07 17:03:11,601 INFO L158 Benchmark]: Toolchain (without parser) took 6226.21ms. Allocated memory was 175.1MB in the beginning and 210.8MB in the end (delta: 35.7MB). Free memory was 128.0MB in the beginning and 123.6MB in the end (delta: 4.4MB). Peak memory consumption was 41.1MB. Max. memory is 8.0GB. [2022-04-07 17:03:11,601 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 175.1MB. Free memory is still 144.2MB. There was no memory consumed. Max. memory is 8.0GB. [2022-04-07 17:03:11,601 INFO L158 Benchmark]: CACSL2BoogieTranslator took 203.18ms. Allocated memory is still 175.1MB. Free memory was 127.6MB in the beginning and 153.4MB in the end (delta: -25.7MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2022-04-07 17:03:11,601 INFO L158 Benchmark]: Boogie Preprocessor took 29.11ms. Allocated memory is still 175.1MB. Free memory was 153.4MB in the beginning and 151.7MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-04-07 17:03:11,601 INFO L158 Benchmark]: RCFGBuilder took 264.90ms. Allocated memory is still 175.1MB. Free memory was 151.7MB in the beginning and 139.1MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2022-04-07 17:03:11,601 INFO L158 Benchmark]: IcfgTransformer took 24.25ms. Allocated memory is still 175.1MB. Free memory was 139.1MB in the beginning and 137.6MB in the end (delta: 1.5MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-04-07 17:03:11,602 INFO L158 Benchmark]: TraceAbstraction took 5700.42ms. Allocated memory was 175.1MB in the beginning and 210.8MB in the end (delta: 35.7MB). Free memory was 137.0MB in the beginning and 123.6MB in the end (delta: 13.5MB). Peak memory consumption was 49.6MB. Max. memory is 8.0GB. [2022-04-07 17:03:11,602 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.13ms. Allocated memory is still 175.1MB. Free memory is still 144.2MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 203.18ms. Allocated memory is still 175.1MB. Free memory was 127.6MB in the beginning and 153.4MB in the end (delta: -25.7MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * Boogie Preprocessor took 29.11ms. Allocated memory is still 175.1MB. Free memory was 153.4MB in the beginning and 151.7MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 264.90ms. Allocated memory is still 175.1MB. Free memory was 151.7MB in the beginning and 139.1MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * IcfgTransformer took 24.25ms. Allocated memory is still 175.1MB. Free memory was 139.1MB in the beginning and 137.6MB in the end (delta: 1.5MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * TraceAbstraction took 5700.42ms. Allocated memory was 175.1MB in the beginning and 210.8MB in the end (delta: 35.7MB). Free memory was 137.0MB in the beginning and 123.6MB in the end (delta: 13.5MB). Peak memory consumption was 49.6MB. 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, 26 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 5.7s, OverallIterations: 6, TraceHistogramMax: 3, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 2.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 275 SdHoareTripleChecker+Valid, 0.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 273 mSDsluCounter, 327 SdHoareTripleChecker+Invalid, 0.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 182 mSDsCounter, 132 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 747 IncrementalHoareTripleChecker+Invalid, 879 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 132 mSolverCounterUnsat, 145 mSDtfsCounter, 747 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 239 GetRequests, 149 SyntacticMatches, 3 SemanticMatches, 87 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 269 ImplicationChecksByTransitivity, 0.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=46occurred in iteration=4, InterpolantAutomatonStates: 52, 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, 6 MinimizatonAttempts, 48 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.6s InterpolantComputationTime, 224 NumberOfCodeBlocks, 224 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 263 ConstructedInterpolants, 0 QuantifiedInterpolants, 717 SizeOfPredicates, 9 NumberOfNonLiveVariables, 483 ConjunctsInSsa, 26 ConjunctsInUnsatCore, 14 InterpolantComputations, 3 PerfectInterpolantSequences, 33/51 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 RESULT: Ultimate proved your program to be correct! [2022-04-07 17:03:11,628 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...