/usr/bin/java -ea -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data --core.log.level.for.class de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN -tc ../../../trunk/examples/toolchains/AutomizerCTransformed.xml -s ../../../trunk/examples/settings/loopacceleration/qvasr/qvasr_64.epf -i ../../../trunk/examples/svcomp/loop-zilu/benchmark10_conjunctive.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-e106359-m [2022-04-15 01:33:58,434 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-15 01:33:58,436 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-15 01:33:58,471 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-15 01:33:58,472 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-15 01:33:58,473 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-15 01:33:58,476 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-15 01:33:58,478 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-15 01:33:58,480 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-15 01:33:58,480 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-15 01:33:58,481 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-15 01:33:58,482 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-15 01:33:58,482 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-15 01:33:58,483 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-15 01:33:58,484 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-15 01:33:58,485 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-15 01:33:58,486 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-15 01:33:58,486 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-15 01:33:58,488 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-15 01:33:58,489 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-15 01:33:58,490 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-15 01:33:58,491 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-15 01:33:58,492 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-15 01:33:58,493 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-15 01:33:58,494 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-15 01:33:58,496 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-15 01:33:58,496 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-15 01:33:58,497 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-15 01:33:58,497 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-15 01:33:58,498 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-15 01:33:58,498 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-15 01:33:58,499 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-15 01:33:58,499 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-15 01:33:58,500 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-15 01:33:58,501 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-15 01:33:58,501 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-15 01:33:58,502 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-15 01:33:58,502 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-15 01:33:58,502 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-15 01:33:58,502 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-15 01:33:58,503 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-15 01:33:58,505 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-15 01:33:58,506 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/loopacceleration/qvasr/qvasr_64.epf [2022-04-15 01:33:58,533 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-15 01:33:58,533 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-15 01:33:58,534 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-04-15 01:33:58,534 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-04-15 01:33:58,535 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-04-15 01:33:58,535 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-04-15 01:33:58,535 INFO L138 SettingsManager]: * Use SBE=true [2022-04-15 01:33:58,536 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-15 01:33:58,536 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-15 01:33:58,536 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-15 01:33:58,537 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-15 01:33:58,537 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-15 01:33:58,537 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-15 01:33:58,537 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-15 01:33:58,537 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-15 01:33:58,537 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-15 01:33:58,537 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-15 01:33:58,537 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-15 01:33:58,538 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-15 01:33:58,538 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-15 01:33:58,538 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-15 01:33:58,538 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-04-15 01:33:58,538 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-04-15 01:33:58,538 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-04-15 01:33:58,538 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-04-15 01:33:58,538 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-15 01:33:58,539 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-04-15 01:33:58,539 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-04-15 01:33:58,540 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-04-15 01:33:58,540 INFO L138 SettingsManager]: * TransformationType=LOOP_ACCELERATION_QVASR WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.core: Log level for class -> de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN; [2022-04-15 01:33:58,776 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-15 01:33:58,794 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-15 01:33:58,796 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-15 01:33:58,797 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-15 01:33:58,798 INFO L275 PluginConnector]: CDTParser initialized [2022-04-15 01:33:58,798 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-zilu/benchmark10_conjunctive.i [2022-04-15 01:33:58,856 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6d19752d4/447b0ffd002445188624b8e4276d5383/FLAGe407f16db [2022-04-15 01:33:59,232 INFO L306 CDTParser]: Found 1 translation units. [2022-04-15 01:33:59,233 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-zilu/benchmark10_conjunctive.i [2022-04-15 01:33:59,240 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6d19752d4/447b0ffd002445188624b8e4276d5383/FLAGe407f16db [2022-04-15 01:33:59,257 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6d19752d4/447b0ffd002445188624b8e4276d5383 [2022-04-15 01:33:59,259 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-15 01:33:59,260 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-04-15 01:33:59,261 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-15 01:33:59,262 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-15 01:33:59,265 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-15 01:33:59,265 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.04 01:33:59" (1/1) ... [2022-04-15 01:33:59,267 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@173f288d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 01:33:59, skipping insertion in model container [2022-04-15 01:33:59,267 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.04 01:33:59" (1/1) ... [2022-04-15 01:33:59,272 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-15 01:33:59,302 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-15 01:33:59,454 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-zilu/benchmark10_conjunctive.i[873,886] [2022-04-15 01:33:59,465 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-15 01:33:59,471 INFO L203 MainTranslator]: Completed pre-run [2022-04-15 01:33:59,482 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-zilu/benchmark10_conjunctive.i[873,886] [2022-04-15 01:33:59,485 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-15 01:33:59,495 INFO L208 MainTranslator]: Completed translation [2022-04-15 01:33:59,496 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 01:33:59 WrapperNode [2022-04-15 01:33:59,496 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-15 01:33:59,497 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-15 01:33:59,497 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-15 01:33:59,497 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-15 01:33:59,506 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 01:33:59" (1/1) ... [2022-04-15 01:33:59,506 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 01:33:59" (1/1) ... [2022-04-15 01:33:59,511 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 01:33:59" (1/1) ... [2022-04-15 01:33:59,511 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 01:33:59" (1/1) ... [2022-04-15 01:33:59,515 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 01:33:59" (1/1) ... [2022-04-15 01:33:59,518 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 01:33:59" (1/1) ... [2022-04-15 01:33:59,519 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 01:33:59" (1/1) ... [2022-04-15 01:33:59,520 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-15 01:33:59,521 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-15 01:33:59,521 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-15 01:33:59,521 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-15 01:33:59,522 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 01:33:59" (1/1) ... [2022-04-15 01:33:59,531 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-15 01:33:59,542 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 01:33:59,556 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-04-15 01:33:59,600 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-04-15 01:33:59,620 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-15 01:33:59,620 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-15 01:33:59,620 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-15 01:33:59,621 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-15 01:33:59,621 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-15 01:33:59,621 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-15 01:33:59,621 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_perror_fail [2022-04-15 01:33:59,622 INFO L130 BoogieDeclarations]: Found specification of procedure __assert [2022-04-15 01:33:59,623 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-15 01:33:59,624 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-15 01:33:59,624 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-04-15 01:33:59,624 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_bool [2022-04-15 01:33:59,624 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-15 01:33:59,624 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-15 01:33:59,624 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-15 01:33:59,624 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-15 01:33:59,625 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-15 01:33:59,625 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-15 01:33:59,625 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-15 01:33:59,625 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-15 01:33:59,688 INFO L234 CfgBuilder]: Building ICFG [2022-04-15 01:33:59,690 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-15 01:33:59,786 INFO L275 CfgBuilder]: Performing block encoding [2022-04-15 01:33:59,791 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-15 01:33:59,791 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-15 01:33:59,792 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.04 01:33:59 BoogieIcfgContainer [2022-04-15 01:33:59,793 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-15 01:33:59,793 INFO L113 PluginConnector]: ------------------------IcfgTransformer---------------------------- [2022-04-15 01:33:59,793 INFO L271 PluginConnector]: Initializing IcfgTransformer... [2022-04-15 01:33:59,795 INFO L275 PluginConnector]: IcfgTransformer initialized [2022-04-15 01:33:59,798 INFO L185 PluginConnector]: Executing the observer IcfgTransformationObserver from plugin IcfgTransformer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.04 01:33:59" (1/1) ... [2022-04-15 01:33:59,800 INFO L168 ansformationObserver]: Applying ICFG transformation LOOP_ACCELERATION_QVASR [2022-04-15 01:33:59,821 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 15.04 01:33:59 BasicIcfg [2022-04-15 01:33:59,821 INFO L132 PluginConnector]: ------------------------ END IcfgTransformer---------------------------- [2022-04-15 01:33:59,823 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-15 01:33:59,823 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-15 01:33:59,825 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-15 01:33:59,826 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.04 01:33:59" (1/4) ... [2022-04-15 01:33:59,826 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3beec7ae and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.04 01:33:59, skipping insertion in model container [2022-04-15 01:33:59,826 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 01:33:59" (2/4) ... [2022-04-15 01:33:59,827 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3beec7ae and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.04 01:33:59, skipping insertion in model container [2022-04-15 01:33:59,827 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.04 01:33:59" (3/4) ... [2022-04-15 01:33:59,827 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3beec7ae and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.04 01:33:59, skipping insertion in model container [2022-04-15 01:33:59,827 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 15.04 01:33:59" (4/4) ... [2022-04-15 01:33:59,828 INFO L111 eAbstractionObserver]: Analyzing ICFG benchmark10_conjunctive.iqvasr [2022-04-15 01:33:59,832 INFO L202 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-04-15 01:33:59,832 INFO L161 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-15 01:33:59,889 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-15 01:33:59,894 INFO L340 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP [2022-04-15 01:33:59,911 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-15 01:33:59,927 INFO L276 IsEmpty]: Start isEmpty. Operand has 21 states, 13 states have (on average 1.4615384615384615) internal successors, (19), 14 states have internal predecessors, (19), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 01:33:59,931 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-04-15 01:33:59,931 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 01:33:59,932 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 01:33:59,932 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 01:33:59,938 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 01:33:59,938 INFO L85 PathProgramCache]: Analyzing trace with hash 1724549087, now seen corresponding path program 1 times [2022-04-15 01:33:59,945 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 01:33:59,946 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [505668629] [2022-04-15 01:33:59,946 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 01:33:59,947 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 01:34:00,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 01:34:00,079 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 01:34:00,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 01:34:00,097 INFO L290 TraceCheckUtils]: 0: Hoare triple {29#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [55] 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) (= (select |v_#length_1| 2) 26) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {24#true} is VALID [2022-04-15 01:34:00,097 INFO L290 TraceCheckUtils]: 1: Hoare triple {24#true} [58] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {24#true} is VALID [2022-04-15 01:34:00,098 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {24#true} {24#true} [75] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {24#true} is VALID [2022-04-15 01:34:00,100 INFO L272 TraceCheckUtils]: 0: Hoare triple {24#true} [53] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {29#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 01:34:00,101 INFO L290 TraceCheckUtils]: 1: Hoare triple {29#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [55] 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) (= (select |v_#length_1| 2) 26) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {24#true} is VALID [2022-04-15 01:34:00,101 INFO L290 TraceCheckUtils]: 2: Hoare triple {24#true} [58] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {24#true} is VALID [2022-04-15 01:34:00,102 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {24#true} {24#true} [75] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {24#true} is VALID [2022-04-15 01:34:00,102 INFO L272 TraceCheckUtils]: 4: Hoare triple {24#true} [54] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {24#true} is VALID [2022-04-15 01:34:00,102 INFO L290 TraceCheckUtils]: 5: Hoare triple {24#true} [57] mainENTRY-->L22: Formula: (and (= v_main_~c~0_3 |v_main_#t~nondet2_2|) (<= |v_main_#t~nondet1_2| 2147483647) (= v_main_~i~0_4 |v_main_#t~nondet1_2|) (<= 0 (+ |v_main_#t~nondet2_2| 2147483648)) (<= |v_main_#t~nondet2_2| 2147483647) (<= 0 (+ |v_main_#t~nondet1_2| 2147483648))) InVars {main_#t~nondet1=|v_main_#t~nondet1_2|, main_#t~nondet2=|v_main_#t~nondet2_2|} OutVars{main_~i~0=v_main_~i~0_4, main_~c~0=v_main_~c~0_3} AuxVars[] AssignedVars[main_#t~nondet1, main_#t~nondet2, main_~i~0, main_~c~0] {24#true} is VALID [2022-04-15 01:34:00,103 INFO L290 TraceCheckUtils]: 6: Hoare triple {24#true} [60] L22-->L23-2: Formula: (and (= v_main_~c~0_5 0) (= v_main_~i~0_8 0)) InVars {main_~i~0=v_main_~i~0_8, main_~c~0=v_main_~c~0_5} OutVars{main_~i~0=v_main_~i~0_8, main_~c~0=v_main_~c~0_5} AuxVars[] AssignedVars[] {24#true} is VALID [2022-04-15 01:34:00,103 INFO L290 TraceCheckUtils]: 7: Hoare triple {24#true} [62] L23-2-->L23-3: Formula: false InVars {} OutVars{} AuxVars[] AssignedVars[] {25#false} is VALID [2022-04-15 01:34:00,104 INFO L272 TraceCheckUtils]: 8: Hoare triple {25#false} [65] L23-3-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (<= 0 v_main_~c~0_7) 1 0)) InVars {main_~c~0=v_main_~c~0_7} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~c~0] {25#false} is VALID [2022-04-15 01:34:00,104 INFO L290 TraceCheckUtils]: 9: Hoare triple {25#false} [69] __VERIFIER_assertENTRY-->L15: 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] {25#false} is VALID [2022-04-15 01:34:00,104 INFO L290 TraceCheckUtils]: 10: Hoare triple {25#false} [70] L15-->L16: 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[] {25#false} is VALID [2022-04-15 01:34:00,105 INFO L290 TraceCheckUtils]: 11: Hoare triple {25#false} [72] L16-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {25#false} is VALID [2022-04-15 01:34:00,105 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 01:34:00,105 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 01:34:00,106 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [505668629] [2022-04-15 01:34:00,106 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [505668629] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 01:34:00,107 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 01:34:00,107 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-15 01:34:00,108 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1795974271] [2022-04-15 01:34:00,109 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 01:34:00,113 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 states have internal predecessors, (8), 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 12 [2022-04-15 01:34:00,114 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 01:34:00,117 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 01:34:00,132 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 12 edges. 12 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 01:34:00,132 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-15 01:34:00,133 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-15 01:34:00,158 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-15 01:34:00,158 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-15 01:34:00,160 INFO L87 Difference]: Start difference. First operand has 21 states, 13 states have (on average 1.4615384615384615) internal successors, (19), 14 states have internal predecessors, (19), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 01:34:00,224 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 01:34:00,224 INFO L93 Difference]: Finished difference Result 33 states and 38 transitions. [2022-04-15 01:34:00,225 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-15 01:34:00,225 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 states have internal predecessors, (8), 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 12 [2022-04-15 01:34:00,225 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 01:34:00,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 01:34:00,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 38 transitions. [2022-04-15 01:34:00,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 01:34:00,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 38 transitions. [2022-04-15 01:34:00,238 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 38 transitions. [2022-04-15 01:34:00,300 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 38 edges. 38 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 01:34:00,306 INFO L225 Difference]: With dead ends: 33 [2022-04-15 01:34:00,306 INFO L226 Difference]: Without dead ends: 14 [2022-04-15 01:34:00,309 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-15 01:34:00,313 INFO L913 BasicCegarLoop]: 22 mSDtfsCounter, 14 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 25 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 01:34:00,313 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [15 Valid, 25 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 01:34:00,325 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2022-04-15 01:34:00,334 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2022-04-15 01:34:00,334 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 01:34:00,335 INFO L82 GeneralOperation]: Start isEquivalent. First operand 14 states. Second operand has 14 states, 9 states have (on average 1.2222222222222223) internal successors, (11), 9 states have internal predecessors, (11), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 01:34:00,336 INFO L74 IsIncluded]: Start isIncluded. First operand 14 states. Second operand has 14 states, 9 states have (on average 1.2222222222222223) internal successors, (11), 9 states have internal predecessors, (11), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 01:34:00,336 INFO L87 Difference]: Start difference. First operand 14 states. Second operand has 14 states, 9 states have (on average 1.2222222222222223) internal successors, (11), 9 states have internal predecessors, (11), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 01:34:00,339 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 01:34:00,339 INFO L93 Difference]: Finished difference Result 14 states and 15 transitions. [2022-04-15 01:34:00,339 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 15 transitions. [2022-04-15 01:34:00,340 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 01:34:00,340 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 01:34:00,340 INFO L74 IsIncluded]: Start isIncluded. First operand has 14 states, 9 states have (on average 1.2222222222222223) internal successors, (11), 9 states have internal predecessors, (11), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 14 states. [2022-04-15 01:34:00,340 INFO L87 Difference]: Start difference. First operand has 14 states, 9 states have (on average 1.2222222222222223) internal successors, (11), 9 states have internal predecessors, (11), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 14 states. [2022-04-15 01:34:00,342 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 01:34:00,343 INFO L93 Difference]: Finished difference Result 14 states and 15 transitions. [2022-04-15 01:34:00,343 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 15 transitions. [2022-04-15 01:34:00,343 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 01:34:00,343 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 01:34:00,343 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 01:34:00,344 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 01:34:00,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 9 states have (on average 1.2222222222222223) internal successors, (11), 9 states have internal predecessors, (11), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 01:34:00,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 15 transitions. [2022-04-15 01:34:00,346 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 15 transitions. Word has length 12 [2022-04-15 01:34:00,347 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 01:34:00,347 INFO L478 AbstractCegarLoop]: Abstraction has 14 states and 15 transitions. [2022-04-15 01:34:00,347 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 01:34:00,347 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 15 transitions. [2022-04-15 01:34:00,348 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-04-15 01:34:00,348 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 01:34:00,348 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 01:34:00,348 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-15 01:34:00,349 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 01:34:00,349 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 01:34:00,350 INFO L85 PathProgramCache]: Analyzing trace with hash 1725472608, now seen corresponding path program 1 times [2022-04-15 01:34:00,350 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 01:34:00,350 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1228135106] [2022-04-15 01:34:00,350 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 01:34:00,350 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 01:34:00,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 01:34:00,394 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 01:34:00,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 01:34:00,403 INFO L290 TraceCheckUtils]: 0: Hoare triple {129#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [55] 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) (= (select |v_#length_1| 2) 26) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {123#true} is VALID [2022-04-15 01:34:00,404 INFO L290 TraceCheckUtils]: 1: Hoare triple {123#true} [58] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {123#true} is VALID [2022-04-15 01:34:00,404 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {123#true} {123#true} [75] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {123#true} is VALID [2022-04-15 01:34:00,405 INFO L272 TraceCheckUtils]: 0: Hoare triple {123#true} [53] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {129#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 01:34:00,405 INFO L290 TraceCheckUtils]: 1: Hoare triple {129#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [55] 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) (= (select |v_#length_1| 2) 26) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {123#true} is VALID [2022-04-15 01:34:00,406 INFO L290 TraceCheckUtils]: 2: Hoare triple {123#true} [58] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {123#true} is VALID [2022-04-15 01:34:00,406 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {123#true} {123#true} [75] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {123#true} is VALID [2022-04-15 01:34:00,406 INFO L272 TraceCheckUtils]: 4: Hoare triple {123#true} [54] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {123#true} is VALID [2022-04-15 01:34:00,406 INFO L290 TraceCheckUtils]: 5: Hoare triple {123#true} [57] mainENTRY-->L22: Formula: (and (= v_main_~c~0_3 |v_main_#t~nondet2_2|) (<= |v_main_#t~nondet1_2| 2147483647) (= v_main_~i~0_4 |v_main_#t~nondet1_2|) (<= 0 (+ |v_main_#t~nondet2_2| 2147483648)) (<= |v_main_#t~nondet2_2| 2147483647) (<= 0 (+ |v_main_#t~nondet1_2| 2147483648))) InVars {main_#t~nondet1=|v_main_#t~nondet1_2|, main_#t~nondet2=|v_main_#t~nondet2_2|} OutVars{main_~i~0=v_main_~i~0_4, main_~c~0=v_main_~c~0_3} AuxVars[] AssignedVars[main_#t~nondet1, main_#t~nondet2, main_~i~0, main_~c~0] {123#true} is VALID [2022-04-15 01:34:00,407 INFO L290 TraceCheckUtils]: 6: Hoare triple {123#true} [60] L22-->L23-2: Formula: (and (= v_main_~c~0_5 0) (= v_main_~i~0_8 0)) InVars {main_~i~0=v_main_~i~0_8, main_~c~0=v_main_~c~0_5} OutVars{main_~i~0=v_main_~i~0_8, main_~c~0=v_main_~c~0_5} AuxVars[] AssignedVars[] {128#(<= main_~i~0 0)} is VALID [2022-04-15 01:34:00,408 INFO L290 TraceCheckUtils]: 7: Hoare triple {128#(<= main_~i~0 0)} [63] L23-2-->L23-3: Formula: (not (< v_main_~i~0_1 100)) InVars {main_~i~0=v_main_~i~0_1} OutVars{main_~i~0=v_main_~i~0_1} AuxVars[] AssignedVars[] {124#false} is VALID [2022-04-15 01:34:00,408 INFO L272 TraceCheckUtils]: 8: Hoare triple {124#false} [65] L23-3-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (<= 0 v_main_~c~0_7) 1 0)) InVars {main_~c~0=v_main_~c~0_7} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~c~0] {124#false} is VALID [2022-04-15 01:34:00,408 INFO L290 TraceCheckUtils]: 9: Hoare triple {124#false} [69] __VERIFIER_assertENTRY-->L15: 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] {124#false} is VALID [2022-04-15 01:34:00,408 INFO L290 TraceCheckUtils]: 10: Hoare triple {124#false} [70] L15-->L16: 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[] {124#false} is VALID [2022-04-15 01:34:00,409 INFO L290 TraceCheckUtils]: 11: Hoare triple {124#false} [72] L16-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {124#false} is VALID [2022-04-15 01:34:00,409 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 01:34:00,409 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 01:34:00,409 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1228135106] [2022-04-15 01:34:00,410 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1228135106] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 01:34:00,410 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 01:34:00,410 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 01:34:00,410 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [487518887] [2022-04-15 01:34:00,410 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 01:34:00,411 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 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 12 [2022-04-15 01:34:00,412 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 01:34:00,412 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 01:34:00,423 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 12 edges. 12 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 01:34:00,423 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-15 01:34:00,424 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-15 01:34:00,424 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-15 01:34:00,424 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-15 01:34:00,425 INFO L87 Difference]: Start difference. First operand 14 states and 15 transitions. Second operand has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 01:34:00,493 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 01:34:00,493 INFO L93 Difference]: Finished difference Result 21 states and 22 transitions. [2022-04-15 01:34:00,493 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-15 01:34:00,494 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 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 12 [2022-04-15 01:34:00,494 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 01:34:00,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 01:34:00,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 22 transitions. [2022-04-15 01:34:00,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 01:34:00,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 22 transitions. [2022-04-15 01:34:00,498 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 22 transitions. [2022-04-15 01:34:00,522 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 22 edges. 22 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 01:34:00,526 INFO L225 Difference]: With dead ends: 21 [2022-04-15 01:34:00,526 INFO L226 Difference]: Without dead ends: 16 [2022-04-15 01:34:00,530 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-15 01:34:00,533 INFO L913 BasicCegarLoop]: 14 mSDtfsCounter, 9 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 21 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 01:34:00,533 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [9 Valid, 21 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 01:34:00,535 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2022-04-15 01:34:00,551 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 15. [2022-04-15 01:34:00,551 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 01:34:00,552 INFO L82 GeneralOperation]: Start isEquivalent. First operand 16 states. Second operand has 15 states, 10 states have (on average 1.2) internal successors, (12), 10 states have internal predecessors, (12), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 01:34:00,552 INFO L74 IsIncluded]: Start isIncluded. First operand 16 states. Second operand has 15 states, 10 states have (on average 1.2) internal successors, (12), 10 states have internal predecessors, (12), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 01:34:00,552 INFO L87 Difference]: Start difference. First operand 16 states. Second operand has 15 states, 10 states have (on average 1.2) internal successors, (12), 10 states have internal predecessors, (12), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 01:34:00,554 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 01:34:00,554 INFO L93 Difference]: Finished difference Result 16 states and 17 transitions. [2022-04-15 01:34:00,554 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 17 transitions. [2022-04-15 01:34:00,554 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 01:34:00,554 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 01:34:00,555 INFO L74 IsIncluded]: Start isIncluded. First operand has 15 states, 10 states have (on average 1.2) internal successors, (12), 10 states have internal predecessors, (12), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 16 states. [2022-04-15 01:34:00,555 INFO L87 Difference]: Start difference. First operand has 15 states, 10 states have (on average 1.2) internal successors, (12), 10 states have internal predecessors, (12), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 16 states. [2022-04-15 01:34:00,556 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 01:34:00,556 INFO L93 Difference]: Finished difference Result 16 states and 17 transitions. [2022-04-15 01:34:00,570 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 17 transitions. [2022-04-15 01:34:00,570 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 01:34:00,570 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 01:34:00,570 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 01:34:00,570 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 01:34:00,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 10 states have (on average 1.2) internal successors, (12), 10 states have internal predecessors, (12), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 01:34:00,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 16 transitions. [2022-04-15 01:34:00,572 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 16 transitions. Word has length 12 [2022-04-15 01:34:00,572 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 01:34:00,572 INFO L478 AbstractCegarLoop]: Abstraction has 15 states and 16 transitions. [2022-04-15 01:34:00,572 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 01:34:00,572 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 16 transitions. [2022-04-15 01:34:00,573 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-04-15 01:34:00,573 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 01:34:00,573 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 01:34:00,573 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-15 01:34:00,573 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 01:34:00,574 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 01:34:00,574 INFO L85 PathProgramCache]: Analyzing trace with hash 1979475853, now seen corresponding path program 1 times [2022-04-15 01:34:00,574 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 01:34:00,574 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [310843386] [2022-04-15 01:34:00,574 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 01:34:00,574 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 01:34:00,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 01:34:00,642 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 01:34:00,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 01:34:00,662 INFO L290 TraceCheckUtils]: 0: Hoare triple {228#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [55] 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) (= (select |v_#length_1| 2) 26) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= (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] {221#true} is VALID [2022-04-15 01:34:00,662 INFO L290 TraceCheckUtils]: 1: Hoare triple {221#true} [58] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {221#true} is VALID [2022-04-15 01:34:00,662 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {221#true} {221#true} [75] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {221#true} is VALID [2022-04-15 01:34:00,663 INFO L272 TraceCheckUtils]: 0: Hoare triple {221#true} [53] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {228#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 01:34:00,663 INFO L290 TraceCheckUtils]: 1: Hoare triple {228#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [55] 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) (= (select |v_#length_1| 2) 26) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= (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] {221#true} is VALID [2022-04-15 01:34:00,664 INFO L290 TraceCheckUtils]: 2: Hoare triple {221#true} [58] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {221#true} is VALID [2022-04-15 01:34:00,664 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {221#true} {221#true} [75] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {221#true} is VALID [2022-04-15 01:34:00,664 INFO L272 TraceCheckUtils]: 4: Hoare triple {221#true} [54] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {221#true} is VALID [2022-04-15 01:34:00,664 INFO L290 TraceCheckUtils]: 5: Hoare triple {221#true} [57] mainENTRY-->L22: Formula: (and (= v_main_~c~0_3 |v_main_#t~nondet2_2|) (<= |v_main_#t~nondet1_2| 2147483647) (= v_main_~i~0_4 |v_main_#t~nondet1_2|) (<= 0 (+ |v_main_#t~nondet2_2| 2147483648)) (<= |v_main_#t~nondet2_2| 2147483647) (<= 0 (+ |v_main_#t~nondet1_2| 2147483648))) InVars {main_#t~nondet1=|v_main_#t~nondet1_2|, main_#t~nondet2=|v_main_#t~nondet2_2|} OutVars{main_~i~0=v_main_~i~0_4, main_~c~0=v_main_~c~0_3} AuxVars[] AssignedVars[main_#t~nondet1, main_#t~nondet2, main_~i~0, main_~c~0] {221#true} is VALID [2022-04-15 01:34:00,667 INFO L290 TraceCheckUtils]: 6: Hoare triple {221#true} [60] L22-->L23-2: Formula: (and (= v_main_~c~0_5 0) (= v_main_~i~0_8 0)) InVars {main_~i~0=v_main_~i~0_8, main_~c~0=v_main_~c~0_5} OutVars{main_~i~0=v_main_~i~0_8, main_~c~0=v_main_~c~0_5} AuxVars[] AssignedVars[] {226#(<= 0 main_~i~0)} is VALID [2022-04-15 01:34:00,668 INFO L290 TraceCheckUtils]: 7: Hoare triple {226#(<= 0 main_~i~0)} [64] L23-2-->L26: Formula: (and (< v_main_~i~0_3 100) (= (+ v_main_~c~0_2 v_main_~i~0_3) v_main_~c~0_1) (= v_main_~i~0_2 (+ v_main_~i~0_3 1))) InVars {main_~i~0=v_main_~i~0_3, main_~c~0=v_main_~c~0_2} OutVars{main_~i~0=v_main_~i~0_2, main_~c~0=v_main_~c~0_1} AuxVars[] AssignedVars[main_~i~0, main_~c~0] {227#(<= 1 main_~i~0)} is VALID [2022-04-15 01:34:00,669 INFO L290 TraceCheckUtils]: 8: Hoare triple {227#(<= 1 main_~i~0)} [66] L26-->L23-3: Formula: (<= v_main_~i~0_5 0) InVars {main_~i~0=v_main_~i~0_5} OutVars{main_~i~0=v_main_~i~0_5} AuxVars[] AssignedVars[] {222#false} is VALID [2022-04-15 01:34:00,669 INFO L272 TraceCheckUtils]: 9: Hoare triple {222#false} [65] L23-3-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (<= 0 v_main_~c~0_7) 1 0)) InVars {main_~c~0=v_main_~c~0_7} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~c~0] {222#false} is VALID [2022-04-15 01:34:00,670 INFO L290 TraceCheckUtils]: 10: Hoare triple {222#false} [69] __VERIFIER_assertENTRY-->L15: 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] {222#false} is VALID [2022-04-15 01:34:00,670 INFO L290 TraceCheckUtils]: 11: Hoare triple {222#false} [70] L15-->L16: 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[] {222#false} is VALID [2022-04-15 01:34:00,670 INFO L290 TraceCheckUtils]: 12: Hoare triple {222#false} [72] L16-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {222#false} is VALID [2022-04-15 01:34:00,670 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 01:34:00,670 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 01:34:00,671 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [310843386] [2022-04-15 01:34:00,671 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [310843386] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 01:34:00,671 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 01:34:00,671 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 01:34:00,671 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2057490806] [2022-04-15 01:34:00,671 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 01:34:00,672 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 13 [2022-04-15 01:34:00,672 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 01:34:00,672 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 01:34:00,684 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 13 edges. 13 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 01:34:00,684 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-15 01:34:00,684 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-15 01:34:00,685 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-15 01:34:00,685 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-04-15 01:34:00,686 INFO L87 Difference]: Start difference. First operand 15 states and 16 transitions. Second operand has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 01:34:00,763 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 01:34:00,764 INFO L93 Difference]: Finished difference Result 20 states and 20 transitions. [2022-04-15 01:34:00,764 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-15 01:34:00,764 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 13 [2022-04-15 01:34:00,764 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 01:34:00,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 01:34:00,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 20 transitions. [2022-04-15 01:34:00,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 01:34:00,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 20 transitions. [2022-04-15 01:34:00,770 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 20 transitions. [2022-04-15 01:34:00,787 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 20 edges. 20 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 01:34:00,788 INFO L225 Difference]: With dead ends: 20 [2022-04-15 01:34:00,788 INFO L226 Difference]: Without dead ends: 15 [2022-04-15 01:34:00,791 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2022-04-15 01:34:00,795 INFO L913 BasicCegarLoop]: 11 mSDtfsCounter, 9 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 23 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 01:34:00,796 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [9 Valid, 23 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 01:34:00,798 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2022-04-15 01:34:00,806 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2022-04-15 01:34:00,806 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 01:34:00,807 INFO L82 GeneralOperation]: Start isEquivalent. First operand 15 states. Second operand has 15 states, 10 states have (on average 1.1) internal successors, (11), 10 states have internal predecessors, (11), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 01:34:00,807 INFO L74 IsIncluded]: Start isIncluded. First operand 15 states. Second operand has 15 states, 10 states have (on average 1.1) internal successors, (11), 10 states have internal predecessors, (11), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 01:34:00,807 INFO L87 Difference]: Start difference. First operand 15 states. Second operand has 15 states, 10 states have (on average 1.1) internal successors, (11), 10 states have internal predecessors, (11), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 01:34:00,813 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 01:34:00,813 INFO L93 Difference]: Finished difference Result 15 states and 15 transitions. [2022-04-15 01:34:00,813 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions. [2022-04-15 01:34:00,814 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 01:34:00,814 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 01:34:00,816 INFO L74 IsIncluded]: Start isIncluded. First operand has 15 states, 10 states have (on average 1.1) internal successors, (11), 10 states have internal predecessors, (11), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 15 states. [2022-04-15 01:34:00,816 INFO L87 Difference]: Start difference. First operand has 15 states, 10 states have (on average 1.1) internal successors, (11), 10 states have internal predecessors, (11), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 15 states. [2022-04-15 01:34:00,819 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 01:34:00,819 INFO L93 Difference]: Finished difference Result 15 states and 15 transitions. [2022-04-15 01:34:00,819 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions. [2022-04-15 01:34:00,819 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 01:34:00,819 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 01:34:00,819 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 01:34:00,820 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 01:34:00,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 10 states have (on average 1.1) internal successors, (11), 10 states have internal predecessors, (11), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 01:34:00,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 15 transitions. [2022-04-15 01:34:00,823 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 15 transitions. Word has length 13 [2022-04-15 01:34:00,823 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 01:34:00,823 INFO L478 AbstractCegarLoop]: Abstraction has 15 states and 15 transitions. [2022-04-15 01:34:00,824 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 01:34:00,824 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions. [2022-04-15 01:34:00,824 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-04-15 01:34:00,824 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 01:34:00,824 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 01:34:00,825 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-04-15 01:34:00,825 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 01:34:00,826 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 01:34:00,826 INFO L85 PathProgramCache]: Analyzing trace with hash 1260871293, now seen corresponding path program 1 times [2022-04-15 01:34:00,826 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 01:34:00,827 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1013925977] [2022-04-15 01:34:00,827 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 01:34:00,827 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 01:34:00,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 01:34:00,877 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 01:34:00,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 01:34:00,886 INFO L290 TraceCheckUtils]: 0: Hoare triple {325#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [55] 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) (= (select |v_#length_1| 2) 26) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= (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] {318#true} is VALID [2022-04-15 01:34:00,886 INFO L290 TraceCheckUtils]: 1: Hoare triple {318#true} [58] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {318#true} is VALID [2022-04-15 01:34:00,887 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {318#true} {318#true} [75] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {318#true} is VALID [2022-04-15 01:34:00,887 INFO L272 TraceCheckUtils]: 0: Hoare triple {318#true} [53] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {325#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 01:34:00,888 INFO L290 TraceCheckUtils]: 1: Hoare triple {325#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [55] 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) (= (select |v_#length_1| 2) 26) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= (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] {318#true} is VALID [2022-04-15 01:34:00,888 INFO L290 TraceCheckUtils]: 2: Hoare triple {318#true} [58] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {318#true} is VALID [2022-04-15 01:34:00,888 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {318#true} {318#true} [75] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {318#true} is VALID [2022-04-15 01:34:00,889 INFO L272 TraceCheckUtils]: 4: Hoare triple {318#true} [54] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {318#true} is VALID [2022-04-15 01:34:00,889 INFO L290 TraceCheckUtils]: 5: Hoare triple {318#true} [57] mainENTRY-->L22: Formula: (and (= v_main_~c~0_3 |v_main_#t~nondet2_2|) (<= |v_main_#t~nondet1_2| 2147483647) (= v_main_~i~0_4 |v_main_#t~nondet1_2|) (<= 0 (+ |v_main_#t~nondet2_2| 2147483648)) (<= |v_main_#t~nondet2_2| 2147483647) (<= 0 (+ |v_main_#t~nondet1_2| 2147483648))) InVars {main_#t~nondet1=|v_main_#t~nondet1_2|, main_#t~nondet2=|v_main_#t~nondet2_2|} OutVars{main_~i~0=v_main_~i~0_4, main_~c~0=v_main_~c~0_3} AuxVars[] AssignedVars[main_#t~nondet1, main_#t~nondet2, main_~i~0, main_~c~0] {318#true} is VALID [2022-04-15 01:34:00,890 INFO L290 TraceCheckUtils]: 6: Hoare triple {318#true} [60] L22-->L23-2: Formula: (and (= v_main_~c~0_5 0) (= v_main_~i~0_8 0)) InVars {main_~i~0=v_main_~i~0_8, main_~c~0=v_main_~c~0_5} OutVars{main_~i~0=v_main_~i~0_8, main_~c~0=v_main_~c~0_5} AuxVars[] AssignedVars[] {323#(<= main_~i~0 0)} is VALID [2022-04-15 01:34:00,890 INFO L290 TraceCheckUtils]: 7: Hoare triple {323#(<= main_~i~0 0)} [64] L23-2-->L26: Formula: (and (< v_main_~i~0_3 100) (= (+ v_main_~c~0_2 v_main_~i~0_3) v_main_~c~0_1) (= v_main_~i~0_2 (+ v_main_~i~0_3 1))) InVars {main_~i~0=v_main_~i~0_3, main_~c~0=v_main_~c~0_2} OutVars{main_~i~0=v_main_~i~0_2, main_~c~0=v_main_~c~0_1} AuxVars[] AssignedVars[main_~i~0, main_~c~0] {324#(<= main_~i~0 1)} is VALID [2022-04-15 01:34:00,891 INFO L290 TraceCheckUtils]: 8: Hoare triple {324#(<= main_~i~0 1)} [67] L26-->L23-2: Formula: (not (<= v_main_~i~0_6 0)) InVars {main_~i~0=v_main_~i~0_6} OutVars{main_~i~0=v_main_~i~0_6} AuxVars[] AssignedVars[] {324#(<= main_~i~0 1)} is VALID [2022-04-15 01:34:00,892 INFO L290 TraceCheckUtils]: 9: Hoare triple {324#(<= main_~i~0 1)} [63] L23-2-->L23-3: Formula: (not (< v_main_~i~0_1 100)) InVars {main_~i~0=v_main_~i~0_1} OutVars{main_~i~0=v_main_~i~0_1} AuxVars[] AssignedVars[] {319#false} is VALID [2022-04-15 01:34:00,892 INFO L272 TraceCheckUtils]: 10: Hoare triple {319#false} [65] L23-3-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (<= 0 v_main_~c~0_7) 1 0)) InVars {main_~c~0=v_main_~c~0_7} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~c~0] {319#false} is VALID [2022-04-15 01:34:00,892 INFO L290 TraceCheckUtils]: 11: Hoare triple {319#false} [69] __VERIFIER_assertENTRY-->L15: 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] {319#false} is VALID [2022-04-15 01:34:00,892 INFO L290 TraceCheckUtils]: 12: Hoare triple {319#false} [70] L15-->L16: 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[] {319#false} is VALID [2022-04-15 01:34:00,892 INFO L290 TraceCheckUtils]: 13: Hoare triple {319#false} [72] L16-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {319#false} is VALID [2022-04-15 01:34:00,893 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 01:34:00,893 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 01:34:00,893 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1013925977] [2022-04-15 01:34:00,893 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1013925977] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 01:34:00,893 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [591145531] [2022-04-15 01:34:00,893 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 01:34:00,894 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 01:34:00,894 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 01:34:00,900 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 01:34:00,901 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-04-15 01:34:00,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 01:34:00,943 INFO L263 TraceCheckSpWp]: Trace formula consists of 63 conjuncts, 3 conjunts are in the unsatisfiable core [2022-04-15 01:34:00,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 01:34:00,970 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 01:34:01,049 INFO L272 TraceCheckUtils]: 0: Hoare triple {318#true} [53] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {318#true} is VALID [2022-04-15 01:34:01,050 INFO L290 TraceCheckUtils]: 1: Hoare triple {318#true} [55] 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) (= (select |v_#length_1| 2) 26) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= (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] {318#true} is VALID [2022-04-15 01:34:01,050 INFO L290 TraceCheckUtils]: 2: Hoare triple {318#true} [58] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {318#true} is VALID [2022-04-15 01:34:01,050 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {318#true} {318#true} [75] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {318#true} is VALID [2022-04-15 01:34:01,050 INFO L272 TraceCheckUtils]: 4: Hoare triple {318#true} [54] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {318#true} is VALID [2022-04-15 01:34:01,051 INFO L290 TraceCheckUtils]: 5: Hoare triple {318#true} [57] mainENTRY-->L22: Formula: (and (= v_main_~c~0_3 |v_main_#t~nondet2_2|) (<= |v_main_#t~nondet1_2| 2147483647) (= v_main_~i~0_4 |v_main_#t~nondet1_2|) (<= 0 (+ |v_main_#t~nondet2_2| 2147483648)) (<= |v_main_#t~nondet2_2| 2147483647) (<= 0 (+ |v_main_#t~nondet1_2| 2147483648))) InVars {main_#t~nondet1=|v_main_#t~nondet1_2|, main_#t~nondet2=|v_main_#t~nondet2_2|} OutVars{main_~i~0=v_main_~i~0_4, main_~c~0=v_main_~c~0_3} AuxVars[] AssignedVars[main_#t~nondet1, main_#t~nondet2, main_~i~0, main_~c~0] {318#true} is VALID [2022-04-15 01:34:01,052 INFO L290 TraceCheckUtils]: 6: Hoare triple {318#true} [60] L22-->L23-2: Formula: (and (= v_main_~c~0_5 0) (= v_main_~i~0_8 0)) InVars {main_~i~0=v_main_~i~0_8, main_~c~0=v_main_~c~0_5} OutVars{main_~i~0=v_main_~i~0_8, main_~c~0=v_main_~c~0_5} AuxVars[] AssignedVars[] {323#(<= main_~i~0 0)} is VALID [2022-04-15 01:34:01,052 INFO L290 TraceCheckUtils]: 7: Hoare triple {323#(<= main_~i~0 0)} [64] L23-2-->L26: Formula: (and (< v_main_~i~0_3 100) (= (+ v_main_~c~0_2 v_main_~i~0_3) v_main_~c~0_1) (= v_main_~i~0_2 (+ v_main_~i~0_3 1))) InVars {main_~i~0=v_main_~i~0_3, main_~c~0=v_main_~c~0_2} OutVars{main_~i~0=v_main_~i~0_2, main_~c~0=v_main_~c~0_1} AuxVars[] AssignedVars[main_~i~0, main_~c~0] {324#(<= main_~i~0 1)} is VALID [2022-04-15 01:34:01,053 INFO L290 TraceCheckUtils]: 8: Hoare triple {324#(<= main_~i~0 1)} [67] L26-->L23-2: Formula: (not (<= v_main_~i~0_6 0)) InVars {main_~i~0=v_main_~i~0_6} OutVars{main_~i~0=v_main_~i~0_6} AuxVars[] AssignedVars[] {324#(<= main_~i~0 1)} is VALID [2022-04-15 01:34:01,053 INFO L290 TraceCheckUtils]: 9: Hoare triple {324#(<= main_~i~0 1)} [63] L23-2-->L23-3: Formula: (not (< v_main_~i~0_1 100)) InVars {main_~i~0=v_main_~i~0_1} OutVars{main_~i~0=v_main_~i~0_1} AuxVars[] AssignedVars[] {319#false} is VALID [2022-04-15 01:34:01,057 INFO L272 TraceCheckUtils]: 10: Hoare triple {319#false} [65] L23-3-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (<= 0 v_main_~c~0_7) 1 0)) InVars {main_~c~0=v_main_~c~0_7} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~c~0] {319#false} is VALID [2022-04-15 01:34:01,057 INFO L290 TraceCheckUtils]: 11: Hoare triple {319#false} [69] __VERIFIER_assertENTRY-->L15: 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] {319#false} is VALID [2022-04-15 01:34:01,058 INFO L290 TraceCheckUtils]: 12: Hoare triple {319#false} [70] L15-->L16: 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[] {319#false} is VALID [2022-04-15 01:34:01,058 INFO L290 TraceCheckUtils]: 13: Hoare triple {319#false} [72] L16-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {319#false} is VALID [2022-04-15 01:34:01,058 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 01:34:01,058 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 01:34:01,158 INFO L290 TraceCheckUtils]: 13: Hoare triple {319#false} [72] L16-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {319#false} is VALID [2022-04-15 01:34:01,158 INFO L290 TraceCheckUtils]: 12: Hoare triple {319#false} [70] L15-->L16: 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[] {319#false} is VALID [2022-04-15 01:34:01,158 INFO L290 TraceCheckUtils]: 11: Hoare triple {319#false} [69] __VERIFIER_assertENTRY-->L15: 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] {319#false} is VALID [2022-04-15 01:34:01,158 INFO L272 TraceCheckUtils]: 10: Hoare triple {319#false} [65] L23-3-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (<= 0 v_main_~c~0_7) 1 0)) InVars {main_~c~0=v_main_~c~0_7} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~c~0] {319#false} is VALID [2022-04-15 01:34:01,159 INFO L290 TraceCheckUtils]: 9: Hoare triple {380#(< main_~i~0 100)} [63] L23-2-->L23-3: Formula: (not (< v_main_~i~0_1 100)) InVars {main_~i~0=v_main_~i~0_1} OutVars{main_~i~0=v_main_~i~0_1} AuxVars[] AssignedVars[] {319#false} is VALID [2022-04-15 01:34:01,159 INFO L290 TraceCheckUtils]: 8: Hoare triple {380#(< main_~i~0 100)} [67] L26-->L23-2: Formula: (not (<= v_main_~i~0_6 0)) InVars {main_~i~0=v_main_~i~0_6} OutVars{main_~i~0=v_main_~i~0_6} AuxVars[] AssignedVars[] {380#(< main_~i~0 100)} is VALID [2022-04-15 01:34:01,160 INFO L290 TraceCheckUtils]: 7: Hoare triple {387#(< main_~i~0 99)} [64] L23-2-->L26: Formula: (and (< v_main_~i~0_3 100) (= (+ v_main_~c~0_2 v_main_~i~0_3) v_main_~c~0_1) (= v_main_~i~0_2 (+ v_main_~i~0_3 1))) InVars {main_~i~0=v_main_~i~0_3, main_~c~0=v_main_~c~0_2} OutVars{main_~i~0=v_main_~i~0_2, main_~c~0=v_main_~c~0_1} AuxVars[] AssignedVars[main_~i~0, main_~c~0] {380#(< main_~i~0 100)} is VALID [2022-04-15 01:34:01,162 INFO L290 TraceCheckUtils]: 6: Hoare triple {318#true} [60] L22-->L23-2: Formula: (and (= v_main_~c~0_5 0) (= v_main_~i~0_8 0)) InVars {main_~i~0=v_main_~i~0_8, main_~c~0=v_main_~c~0_5} OutVars{main_~i~0=v_main_~i~0_8, main_~c~0=v_main_~c~0_5} AuxVars[] AssignedVars[] {387#(< main_~i~0 99)} is VALID [2022-04-15 01:34:01,163 INFO L290 TraceCheckUtils]: 5: Hoare triple {318#true} [57] mainENTRY-->L22: Formula: (and (= v_main_~c~0_3 |v_main_#t~nondet2_2|) (<= |v_main_#t~nondet1_2| 2147483647) (= v_main_~i~0_4 |v_main_#t~nondet1_2|) (<= 0 (+ |v_main_#t~nondet2_2| 2147483648)) (<= |v_main_#t~nondet2_2| 2147483647) (<= 0 (+ |v_main_#t~nondet1_2| 2147483648))) InVars {main_#t~nondet1=|v_main_#t~nondet1_2|, main_#t~nondet2=|v_main_#t~nondet2_2|} OutVars{main_~i~0=v_main_~i~0_4, main_~c~0=v_main_~c~0_3} AuxVars[] AssignedVars[main_#t~nondet1, main_#t~nondet2, main_~i~0, main_~c~0] {318#true} is VALID [2022-04-15 01:34:01,163 INFO L272 TraceCheckUtils]: 4: Hoare triple {318#true} [54] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {318#true} is VALID [2022-04-15 01:34:01,163 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {318#true} {318#true} [75] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {318#true} is VALID [2022-04-15 01:34:01,166 INFO L290 TraceCheckUtils]: 2: Hoare triple {318#true} [58] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {318#true} is VALID [2022-04-15 01:34:01,167 INFO L290 TraceCheckUtils]: 1: Hoare triple {318#true} [55] 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) (= (select |v_#length_1| 2) 26) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= (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] {318#true} is VALID [2022-04-15 01:34:01,167 INFO L272 TraceCheckUtils]: 0: Hoare triple {318#true} [53] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {318#true} is VALID [2022-04-15 01:34:01,167 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 01:34:01,168 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [591145531] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 01:34:01,168 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 01:34:01,168 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 7 [2022-04-15 01:34:01,168 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1123544398] [2022-04-15 01:34:01,168 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-15 01:34:01,169 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 6 states have internal predecessors, (15), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 14 [2022-04-15 01:34:01,169 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 01:34:01,169 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 6 states have internal predecessors, (15), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 01:34:01,185 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 20 edges. 20 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 01:34:01,185 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-15 01:34:01,185 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-15 01:34:01,186 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-15 01:34:01,186 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-04-15 01:34:01,186 INFO L87 Difference]: Start difference. First operand 15 states and 15 transitions. Second operand has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 6 states have internal predecessors, (15), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 01:34:01,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 01:34:01,332 INFO L93 Difference]: Finished difference Result 26 states and 28 transitions. [2022-04-15 01:34:01,332 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-15 01:34:01,332 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 6 states have internal predecessors, (15), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 14 [2022-04-15 01:34:01,332 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 01:34:01,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 6 states have internal predecessors, (15), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 01:34:01,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 28 transitions. [2022-04-15 01:34:01,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 6 states have internal predecessors, (15), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 01:34:01,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 28 transitions. [2022-04-15 01:34:01,337 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 28 transitions. [2022-04-15 01:34:01,363 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 28 edges. 28 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 01:34:01,364 INFO L225 Difference]: With dead ends: 26 [2022-04-15 01:34:01,364 INFO L226 Difference]: Without dead ends: 21 [2022-04-15 01:34:01,365 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2022-04-15 01:34:01,373 INFO L913 BasicCegarLoop]: 12 mSDtfsCounter, 13 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 29 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 01:34:01,374 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [13 Valid, 29 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 01:34:01,375 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2022-04-15 01:34:01,394 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2022-04-15 01:34:01,395 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 01:34:01,395 INFO L82 GeneralOperation]: Start isEquivalent. First operand 21 states. Second operand has 21 states, 16 states have (on average 1.0625) internal successors, (17), 16 states have internal predecessors, (17), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 01:34:01,395 INFO L74 IsIncluded]: Start isIncluded. First operand 21 states. Second operand has 21 states, 16 states have (on average 1.0625) internal successors, (17), 16 states have internal predecessors, (17), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 01:34:01,395 INFO L87 Difference]: Start difference. First operand 21 states. Second operand has 21 states, 16 states have (on average 1.0625) internal successors, (17), 16 states have internal predecessors, (17), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 01:34:01,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 01:34:01,397 INFO L93 Difference]: Finished difference Result 21 states and 21 transitions. [2022-04-15 01:34:01,397 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 21 transitions. [2022-04-15 01:34:01,397 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 01:34:01,397 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 01:34:01,397 INFO L74 IsIncluded]: Start isIncluded. First operand has 21 states, 16 states have (on average 1.0625) internal successors, (17), 16 states have internal predecessors, (17), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 21 states. [2022-04-15 01:34:01,397 INFO L87 Difference]: Start difference. First operand has 21 states, 16 states have (on average 1.0625) internal successors, (17), 16 states have internal predecessors, (17), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 21 states. [2022-04-15 01:34:01,398 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 01:34:01,398 INFO L93 Difference]: Finished difference Result 21 states and 21 transitions. [2022-04-15 01:34:01,398 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 21 transitions. [2022-04-15 01:34:01,399 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 01:34:01,399 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 01:34:01,399 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 01:34:01,399 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 01:34:01,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 16 states have (on average 1.0625) internal successors, (17), 16 states have internal predecessors, (17), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 01:34:01,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 21 transitions. [2022-04-15 01:34:01,400 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 21 transitions. Word has length 14 [2022-04-15 01:34:01,400 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 01:34:01,400 INFO L478 AbstractCegarLoop]: Abstraction has 21 states and 21 transitions. [2022-04-15 01:34:01,400 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 6 states have internal predecessors, (15), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 01:34:01,400 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 21 transitions. [2022-04-15 01:34:01,401 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-04-15 01:34:01,401 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 01:34:01,401 INFO L499 BasicCegarLoop]: trace histogram [4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 01:34:01,428 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-15 01:34:01,621 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 01:34:01,621 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 01:34:01,622 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 01:34:01,622 INFO L85 PathProgramCache]: Analyzing trace with hash -1622480812, now seen corresponding path program 2 times [2022-04-15 01:34:01,622 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 01:34:01,622 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [550654600] [2022-04-15 01:34:01,622 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 01:34:01,622 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 01:34:01,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 01:34:01,773 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 01:34:01,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 01:34:01,803 INFO L290 TraceCheckUtils]: 0: Hoare triple {546#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [55] 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) (= (select |v_#length_1| 2) 26) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= (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] {532#true} is VALID [2022-04-15 01:34:01,803 INFO L290 TraceCheckUtils]: 1: Hoare triple {532#true} [58] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {532#true} is VALID [2022-04-15 01:34:01,804 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {532#true} {532#true} [75] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {532#true} is VALID [2022-04-15 01:34:01,804 INFO L272 TraceCheckUtils]: 0: Hoare triple {532#true} [53] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {546#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 01:34:01,804 INFO L290 TraceCheckUtils]: 1: Hoare triple {546#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [55] 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) (= (select |v_#length_1| 2) 26) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= (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] {532#true} is VALID [2022-04-15 01:34:01,805 INFO L290 TraceCheckUtils]: 2: Hoare triple {532#true} [58] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {532#true} is VALID [2022-04-15 01:34:01,805 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {532#true} {532#true} [75] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {532#true} is VALID [2022-04-15 01:34:01,805 INFO L272 TraceCheckUtils]: 4: Hoare triple {532#true} [54] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {532#true} is VALID [2022-04-15 01:34:01,805 INFO L290 TraceCheckUtils]: 5: Hoare triple {532#true} [57] mainENTRY-->L22: Formula: (and (= v_main_~c~0_3 |v_main_#t~nondet2_2|) (<= |v_main_#t~nondet1_2| 2147483647) (= v_main_~i~0_4 |v_main_#t~nondet1_2|) (<= 0 (+ |v_main_#t~nondet2_2| 2147483648)) (<= |v_main_#t~nondet2_2| 2147483647) (<= 0 (+ |v_main_#t~nondet1_2| 2147483648))) InVars {main_#t~nondet1=|v_main_#t~nondet1_2|, main_#t~nondet2=|v_main_#t~nondet2_2|} OutVars{main_~i~0=v_main_~i~0_4, main_~c~0=v_main_~c~0_3} AuxVars[] AssignedVars[main_#t~nondet1, main_#t~nondet2, main_~i~0, main_~c~0] {532#true} is VALID [2022-04-15 01:34:01,806 INFO L290 TraceCheckUtils]: 6: Hoare triple {532#true} [60] L22-->L23-2: Formula: (and (= v_main_~c~0_5 0) (= v_main_~i~0_8 0)) InVars {main_~i~0=v_main_~i~0_8, main_~c~0=v_main_~c~0_5} OutVars{main_~i~0=v_main_~i~0_8, main_~c~0=v_main_~c~0_5} AuxVars[] AssignedVars[] {537#(<= 0 (+ main_~i~0 main_~c~0))} is VALID [2022-04-15 01:34:01,806 INFO L290 TraceCheckUtils]: 7: Hoare triple {537#(<= 0 (+ main_~i~0 main_~c~0))} [64] L23-2-->L26: Formula: (and (< v_main_~i~0_3 100) (= (+ v_main_~c~0_2 v_main_~i~0_3) v_main_~c~0_1) (= v_main_~i~0_2 (+ v_main_~i~0_3 1))) InVars {main_~i~0=v_main_~i~0_3, main_~c~0=v_main_~c~0_2} OutVars{main_~i~0=v_main_~i~0_2, main_~c~0=v_main_~c~0_1} AuxVars[] AssignedVars[main_~i~0, main_~c~0] {538#(<= 0 main_~c~0)} is VALID [2022-04-15 01:34:01,807 INFO L290 TraceCheckUtils]: 8: Hoare triple {538#(<= 0 main_~c~0)} [67] L26-->L23-2: Formula: (not (<= v_main_~i~0_6 0)) InVars {main_~i~0=v_main_~i~0_6} OutVars{main_~i~0=v_main_~i~0_6} AuxVars[] AssignedVars[] {539#(<= 1 (+ main_~i~0 main_~c~0))} is VALID [2022-04-15 01:34:01,808 INFO L290 TraceCheckUtils]: 9: Hoare triple {539#(<= 1 (+ main_~i~0 main_~c~0))} [64] L23-2-->L26: Formula: (and (< v_main_~i~0_3 100) (= (+ v_main_~c~0_2 v_main_~i~0_3) v_main_~c~0_1) (= v_main_~i~0_2 (+ v_main_~i~0_3 1))) InVars {main_~i~0=v_main_~i~0_3, main_~c~0=v_main_~c~0_2} OutVars{main_~i~0=v_main_~i~0_2, main_~c~0=v_main_~c~0_1} AuxVars[] AssignedVars[main_~i~0, main_~c~0] {540#(<= 1 main_~c~0)} is VALID [2022-04-15 01:34:01,808 INFO L290 TraceCheckUtils]: 10: Hoare triple {540#(<= 1 main_~c~0)} [67] L26-->L23-2: Formula: (not (<= v_main_~i~0_6 0)) InVars {main_~i~0=v_main_~i~0_6} OutVars{main_~i~0=v_main_~i~0_6} AuxVars[] AssignedVars[] {541#(<= 3 (+ main_~c~0 (* main_~i~0 2)))} is VALID [2022-04-15 01:34:01,809 INFO L290 TraceCheckUtils]: 11: Hoare triple {541#(<= 3 (+ main_~c~0 (* main_~i~0 2)))} [64] L23-2-->L26: Formula: (and (< v_main_~i~0_3 100) (= (+ v_main_~c~0_2 v_main_~i~0_3) v_main_~c~0_1) (= v_main_~i~0_2 (+ v_main_~i~0_3 1))) InVars {main_~i~0=v_main_~i~0_3, main_~c~0=v_main_~c~0_2} OutVars{main_~i~0=v_main_~i~0_2, main_~c~0=v_main_~c~0_1} AuxVars[] AssignedVars[main_~i~0, main_~c~0] {542#(<= 4 (+ main_~i~0 main_~c~0))} is VALID [2022-04-15 01:34:01,809 INFO L290 TraceCheckUtils]: 12: Hoare triple {542#(<= 4 (+ main_~i~0 main_~c~0))} [67] L26-->L23-2: Formula: (not (<= v_main_~i~0_6 0)) InVars {main_~i~0=v_main_~i~0_6} OutVars{main_~i~0=v_main_~i~0_6} AuxVars[] AssignedVars[] {542#(<= 4 (+ main_~i~0 main_~c~0))} is VALID [2022-04-15 01:34:01,810 INFO L290 TraceCheckUtils]: 13: Hoare triple {542#(<= 4 (+ main_~i~0 main_~c~0))} [64] L23-2-->L26: Formula: (and (< v_main_~i~0_3 100) (= (+ v_main_~c~0_2 v_main_~i~0_3) v_main_~c~0_1) (= v_main_~i~0_2 (+ v_main_~i~0_3 1))) InVars {main_~i~0=v_main_~i~0_3, main_~c~0=v_main_~c~0_2} OutVars{main_~i~0=v_main_~i~0_2, main_~c~0=v_main_~c~0_1} AuxVars[] AssignedVars[main_~i~0, main_~c~0] {543#(<= 4 main_~c~0)} is VALID [2022-04-15 01:34:01,811 INFO L290 TraceCheckUtils]: 14: Hoare triple {543#(<= 4 main_~c~0)} [67] L26-->L23-2: Formula: (not (<= v_main_~i~0_6 0)) InVars {main_~i~0=v_main_~i~0_6} OutVars{main_~i~0=v_main_~i~0_6} AuxVars[] AssignedVars[] {543#(<= 4 main_~c~0)} is VALID [2022-04-15 01:34:01,811 INFO L290 TraceCheckUtils]: 15: Hoare triple {543#(<= 4 main_~c~0)} [63] L23-2-->L23-3: Formula: (not (< v_main_~i~0_1 100)) InVars {main_~i~0=v_main_~i~0_1} OutVars{main_~i~0=v_main_~i~0_1} AuxVars[] AssignedVars[] {543#(<= 4 main_~c~0)} is VALID [2022-04-15 01:34:01,812 INFO L272 TraceCheckUtils]: 16: Hoare triple {543#(<= 4 main_~c~0)} [65] L23-3-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (<= 0 v_main_~c~0_7) 1 0)) InVars {main_~c~0=v_main_~c~0_7} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~c~0] {544#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 01:34:01,812 INFO L290 TraceCheckUtils]: 17: Hoare triple {544#(not (= |__VERIFIER_assert_#in~cond| 0))} [69] __VERIFIER_assertENTRY-->L15: 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] {545#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-15 01:34:01,813 INFO L290 TraceCheckUtils]: 18: Hoare triple {545#(not (= __VERIFIER_assert_~cond 0))} [70] L15-->L16: 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[] {533#false} is VALID [2022-04-15 01:34:01,813 INFO L290 TraceCheckUtils]: 19: Hoare triple {533#false} [72] L16-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {533#false} is VALID [2022-04-15 01:34:01,813 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 6 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 01:34:01,813 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 01:34:01,813 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [550654600] [2022-04-15 01:34:01,813 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [550654600] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 01:34:01,813 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1698209212] [2022-04-15 01:34:01,814 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 01:34:01,814 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 01:34:01,814 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 01:34:01,817 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 01:34:01,818 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-04-15 01:34:01,860 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-15 01:34:01,860 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 01:34:01,861 INFO L263 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 12 conjunts are in the unsatisfiable core [2022-04-15 01:34:01,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 01:34:01,870 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 01:34:02,176 INFO L272 TraceCheckUtils]: 0: Hoare triple {532#true} [53] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {532#true} is VALID [2022-04-15 01:34:02,176 INFO L290 TraceCheckUtils]: 1: Hoare triple {532#true} [55] 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) (= (select |v_#length_1| 2) 26) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= (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] {532#true} is VALID [2022-04-15 01:34:02,177 INFO L290 TraceCheckUtils]: 2: Hoare triple {532#true} [58] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {532#true} is VALID [2022-04-15 01:34:02,177 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {532#true} {532#true} [75] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {532#true} is VALID [2022-04-15 01:34:02,177 INFO L272 TraceCheckUtils]: 4: Hoare triple {532#true} [54] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {532#true} is VALID [2022-04-15 01:34:02,177 INFO L290 TraceCheckUtils]: 5: Hoare triple {532#true} [57] mainENTRY-->L22: Formula: (and (= v_main_~c~0_3 |v_main_#t~nondet2_2|) (<= |v_main_#t~nondet1_2| 2147483647) (= v_main_~i~0_4 |v_main_#t~nondet1_2|) (<= 0 (+ |v_main_#t~nondet2_2| 2147483648)) (<= |v_main_#t~nondet2_2| 2147483647) (<= 0 (+ |v_main_#t~nondet1_2| 2147483648))) InVars {main_#t~nondet1=|v_main_#t~nondet1_2|, main_#t~nondet2=|v_main_#t~nondet2_2|} OutVars{main_~i~0=v_main_~i~0_4, main_~c~0=v_main_~c~0_3} AuxVars[] AssignedVars[main_#t~nondet1, main_#t~nondet2, main_~i~0, main_~c~0] {532#true} is VALID [2022-04-15 01:34:02,184 INFO L290 TraceCheckUtils]: 6: Hoare triple {532#true} [60] L22-->L23-2: Formula: (and (= v_main_~c~0_5 0) (= v_main_~i~0_8 0)) InVars {main_~i~0=v_main_~i~0_8, main_~c~0=v_main_~c~0_5} OutVars{main_~i~0=v_main_~i~0_8, main_~c~0=v_main_~c~0_5} AuxVars[] AssignedVars[] {568#(and (<= 0 main_~c~0) (<= 0 main_~i~0))} is VALID [2022-04-15 01:34:02,185 INFO L290 TraceCheckUtils]: 7: Hoare triple {568#(and (<= 0 main_~c~0) (<= 0 main_~i~0))} [64] L23-2-->L26: Formula: (and (< v_main_~i~0_3 100) (= (+ v_main_~c~0_2 v_main_~i~0_3) v_main_~c~0_1) (= v_main_~i~0_2 (+ v_main_~i~0_3 1))) InVars {main_~i~0=v_main_~i~0_3, main_~c~0=v_main_~c~0_2} OutVars{main_~i~0=v_main_~i~0_2, main_~c~0=v_main_~c~0_1} AuxVars[] AssignedVars[main_~i~0, main_~c~0] {538#(<= 0 main_~c~0)} is VALID [2022-04-15 01:34:02,185 INFO L290 TraceCheckUtils]: 8: Hoare triple {538#(<= 0 main_~c~0)} [67] L26-->L23-2: Formula: (not (<= v_main_~i~0_6 0)) InVars {main_~i~0=v_main_~i~0_6} OutVars{main_~i~0=v_main_~i~0_6} AuxVars[] AssignedVars[] {575#(and (<= 0 main_~c~0) (not (<= main_~i~0 0)))} is VALID [2022-04-15 01:34:02,186 INFO L290 TraceCheckUtils]: 9: Hoare triple {575#(and (<= 0 main_~c~0) (not (<= main_~i~0 0)))} [64] L23-2-->L26: Formula: (and (< v_main_~i~0_3 100) (= (+ v_main_~c~0_2 v_main_~i~0_3) v_main_~c~0_1) (= v_main_~i~0_2 (+ v_main_~i~0_3 1))) InVars {main_~i~0=v_main_~i~0_3, main_~c~0=v_main_~c~0_2} OutVars{main_~i~0=v_main_~i~0_2, main_~c~0=v_main_~c~0_1} AuxVars[] AssignedVars[main_~i~0, main_~c~0] {579#(and (< 0 main_~c~0) (< 1 main_~i~0))} is VALID [2022-04-15 01:34:02,186 INFO L290 TraceCheckUtils]: 10: Hoare triple {579#(and (< 0 main_~c~0) (< 1 main_~i~0))} [67] L26-->L23-2: Formula: (not (<= v_main_~i~0_6 0)) InVars {main_~i~0=v_main_~i~0_6} OutVars{main_~i~0=v_main_~i~0_6} AuxVars[] AssignedVars[] {579#(and (< 0 main_~c~0) (< 1 main_~i~0))} is VALID [2022-04-15 01:34:02,187 INFO L290 TraceCheckUtils]: 11: Hoare triple {579#(and (< 0 main_~c~0) (< 1 main_~i~0))} [64] L23-2-->L26: Formula: (and (< v_main_~i~0_3 100) (= (+ v_main_~c~0_2 v_main_~i~0_3) v_main_~c~0_1) (= v_main_~i~0_2 (+ v_main_~i~0_3 1))) InVars {main_~i~0=v_main_~i~0_3, main_~c~0=v_main_~c~0_2} OutVars{main_~i~0=v_main_~i~0_2, main_~c~0=v_main_~c~0_1} AuxVars[] AssignedVars[main_~i~0, main_~c~0] {586#(and (< 2 main_~i~0) (< 2 main_~c~0))} is VALID [2022-04-15 01:34:02,188 INFO L290 TraceCheckUtils]: 12: Hoare triple {586#(and (< 2 main_~i~0) (< 2 main_~c~0))} [67] L26-->L23-2: Formula: (not (<= v_main_~i~0_6 0)) InVars {main_~i~0=v_main_~i~0_6} OutVars{main_~i~0=v_main_~i~0_6} AuxVars[] AssignedVars[] {586#(and (< 2 main_~i~0) (< 2 main_~c~0))} is VALID [2022-04-15 01:34:02,188 INFO L290 TraceCheckUtils]: 13: Hoare triple {586#(and (< 2 main_~i~0) (< 2 main_~c~0))} [64] L23-2-->L26: Formula: (and (< v_main_~i~0_3 100) (= (+ v_main_~c~0_2 v_main_~i~0_3) v_main_~c~0_1) (= v_main_~i~0_2 (+ v_main_~i~0_3 1))) InVars {main_~i~0=v_main_~i~0_3, main_~c~0=v_main_~c~0_2} OutVars{main_~i~0=v_main_~i~0_2, main_~c~0=v_main_~c~0_1} AuxVars[] AssignedVars[main_~i~0, main_~c~0] {593#(< 5 main_~c~0)} is VALID [2022-04-15 01:34:02,189 INFO L290 TraceCheckUtils]: 14: Hoare triple {593#(< 5 main_~c~0)} [67] L26-->L23-2: Formula: (not (<= v_main_~i~0_6 0)) InVars {main_~i~0=v_main_~i~0_6} OutVars{main_~i~0=v_main_~i~0_6} AuxVars[] AssignedVars[] {593#(< 5 main_~c~0)} is VALID [2022-04-15 01:34:02,189 INFO L290 TraceCheckUtils]: 15: Hoare triple {593#(< 5 main_~c~0)} [63] L23-2-->L23-3: Formula: (not (< v_main_~i~0_1 100)) InVars {main_~i~0=v_main_~i~0_1} OutVars{main_~i~0=v_main_~i~0_1} AuxVars[] AssignedVars[] {593#(< 5 main_~c~0)} is VALID [2022-04-15 01:34:02,190 INFO L272 TraceCheckUtils]: 16: Hoare triple {593#(< 5 main_~c~0)} [65] L23-3-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (<= 0 v_main_~c~0_7) 1 0)) InVars {main_~c~0=v_main_~c~0_7} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~c~0] {603#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 01:34:02,190 INFO L290 TraceCheckUtils]: 17: Hoare triple {603#(<= 1 |__VERIFIER_assert_#in~cond|)} [69] __VERIFIER_assertENTRY-->L15: 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] {607#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 01:34:02,190 INFO L290 TraceCheckUtils]: 18: Hoare triple {607#(<= 1 __VERIFIER_assert_~cond)} [70] L15-->L16: 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[] {533#false} is VALID [2022-04-15 01:34:02,191 INFO L290 TraceCheckUtils]: 19: Hoare triple {533#false} [72] L16-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {533#false} is VALID [2022-04-15 01:34:02,191 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 10 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 01:34:02,191 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 01:34:02,888 INFO L290 TraceCheckUtils]: 19: Hoare triple {533#false} [72] L16-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {533#false} is VALID [2022-04-15 01:34:02,889 INFO L290 TraceCheckUtils]: 18: Hoare triple {607#(<= 1 __VERIFIER_assert_~cond)} [70] L15-->L16: 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[] {533#false} is VALID [2022-04-15 01:34:02,889 INFO L290 TraceCheckUtils]: 17: Hoare triple {603#(<= 1 |__VERIFIER_assert_#in~cond|)} [69] __VERIFIER_assertENTRY-->L15: 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] {607#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 01:34:02,890 INFO L272 TraceCheckUtils]: 16: Hoare triple {538#(<= 0 main_~c~0)} [65] L23-3-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (<= 0 v_main_~c~0_7) 1 0)) InVars {main_~c~0=v_main_~c~0_7} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~c~0] {603#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 01:34:02,890 INFO L290 TraceCheckUtils]: 15: Hoare triple {538#(<= 0 main_~c~0)} [63] L23-2-->L23-3: Formula: (not (< v_main_~i~0_1 100)) InVars {main_~i~0=v_main_~i~0_1} OutVars{main_~i~0=v_main_~i~0_1} AuxVars[] AssignedVars[] {538#(<= 0 main_~c~0)} is VALID [2022-04-15 01:34:02,891 INFO L290 TraceCheckUtils]: 14: Hoare triple {538#(<= 0 main_~c~0)} [67] L26-->L23-2: Formula: (not (<= v_main_~i~0_6 0)) InVars {main_~i~0=v_main_~i~0_6} OutVars{main_~i~0=v_main_~i~0_6} AuxVars[] AssignedVars[] {538#(<= 0 main_~c~0)} is VALID [2022-04-15 01:34:02,892 INFO L290 TraceCheckUtils]: 13: Hoare triple {537#(<= 0 (+ main_~i~0 main_~c~0))} [64] L23-2-->L26: Formula: (and (< v_main_~i~0_3 100) (= (+ v_main_~c~0_2 v_main_~i~0_3) v_main_~c~0_1) (= v_main_~i~0_2 (+ v_main_~i~0_3 1))) InVars {main_~i~0=v_main_~i~0_3, main_~c~0=v_main_~c~0_2} OutVars{main_~i~0=v_main_~i~0_2, main_~c~0=v_main_~c~0_1} AuxVars[] AssignedVars[main_~i~0, main_~c~0] {538#(<= 0 main_~c~0)} is VALID [2022-04-15 01:34:02,893 INFO L290 TraceCheckUtils]: 12: Hoare triple {537#(<= 0 (+ main_~i~0 main_~c~0))} [67] L26-->L23-2: Formula: (not (<= v_main_~i~0_6 0)) InVars {main_~i~0=v_main_~i~0_6} OutVars{main_~i~0=v_main_~i~0_6} AuxVars[] AssignedVars[] {537#(<= 0 (+ main_~i~0 main_~c~0))} is VALID [2022-04-15 01:34:02,893 INFO L290 TraceCheckUtils]: 11: Hoare triple {638#(<= 0 (+ main_~c~0 (* main_~i~0 2) 1))} [64] L23-2-->L26: Formula: (and (< v_main_~i~0_3 100) (= (+ v_main_~c~0_2 v_main_~i~0_3) v_main_~c~0_1) (= v_main_~i~0_2 (+ v_main_~i~0_3 1))) InVars {main_~i~0=v_main_~i~0_3, main_~c~0=v_main_~c~0_2} OutVars{main_~i~0=v_main_~i~0_2, main_~c~0=v_main_~c~0_1} AuxVars[] AssignedVars[main_~i~0, main_~c~0] {537#(<= 0 (+ main_~i~0 main_~c~0))} is VALID [2022-04-15 01:34:02,894 INFO L290 TraceCheckUtils]: 10: Hoare triple {638#(<= 0 (+ main_~c~0 (* main_~i~0 2) 1))} [67] L26-->L23-2: Formula: (not (<= v_main_~i~0_6 0)) InVars {main_~i~0=v_main_~i~0_6} OutVars{main_~i~0=v_main_~i~0_6} AuxVars[] AssignedVars[] {638#(<= 0 (+ main_~c~0 (* main_~i~0 2) 1))} is VALID [2022-04-15 01:34:02,894 INFO L290 TraceCheckUtils]: 9: Hoare triple {645#(<= (div (+ main_~i~0 main_~c~0 1) (- 2)) (+ main_~i~0 1))} [64] L23-2-->L26: Formula: (and (< v_main_~i~0_3 100) (= (+ v_main_~c~0_2 v_main_~i~0_3) v_main_~c~0_1) (= v_main_~i~0_2 (+ v_main_~i~0_3 1))) InVars {main_~i~0=v_main_~i~0_3, main_~c~0=v_main_~c~0_2} OutVars{main_~i~0=v_main_~i~0_2, main_~c~0=v_main_~c~0_1} AuxVars[] AssignedVars[main_~i~0, main_~c~0] {638#(<= 0 (+ main_~c~0 (* main_~i~0 2) 1))} is VALID [2022-04-15 01:34:02,895 INFO L290 TraceCheckUtils]: 8: Hoare triple {649#(<= (div main_~c~0 (- 2)) 3)} [67] L26-->L23-2: Formula: (not (<= v_main_~i~0_6 0)) InVars {main_~i~0=v_main_~i~0_6} OutVars{main_~i~0=v_main_~i~0_6} AuxVars[] AssignedVars[] {645#(<= (div (+ main_~i~0 main_~c~0 1) (- 2)) (+ main_~i~0 1))} is VALID [2022-04-15 01:34:02,896 INFO L290 TraceCheckUtils]: 7: Hoare triple {653#(<= (div (+ (- 2) main_~i~0 main_~c~0) (- 2)) 4)} [64] L23-2-->L26: Formula: (and (< v_main_~i~0_3 100) (= (+ v_main_~c~0_2 v_main_~i~0_3) v_main_~c~0_1) (= v_main_~i~0_2 (+ v_main_~i~0_3 1))) InVars {main_~i~0=v_main_~i~0_3, main_~c~0=v_main_~c~0_2} OutVars{main_~i~0=v_main_~i~0_2, main_~c~0=v_main_~c~0_1} AuxVars[] AssignedVars[main_~i~0, main_~c~0] {649#(<= (div main_~c~0 (- 2)) 3)} is VALID [2022-04-15 01:34:02,896 INFO L290 TraceCheckUtils]: 6: Hoare triple {532#true} [60] L22-->L23-2: Formula: (and (= v_main_~c~0_5 0) (= v_main_~i~0_8 0)) InVars {main_~i~0=v_main_~i~0_8, main_~c~0=v_main_~c~0_5} OutVars{main_~i~0=v_main_~i~0_8, main_~c~0=v_main_~c~0_5} AuxVars[] AssignedVars[] {653#(<= (div (+ (- 2) main_~i~0 main_~c~0) (- 2)) 4)} is VALID [2022-04-15 01:34:02,897 INFO L290 TraceCheckUtils]: 5: Hoare triple {532#true} [57] mainENTRY-->L22: Formula: (and (= v_main_~c~0_3 |v_main_#t~nondet2_2|) (<= |v_main_#t~nondet1_2| 2147483647) (= v_main_~i~0_4 |v_main_#t~nondet1_2|) (<= 0 (+ |v_main_#t~nondet2_2| 2147483648)) (<= |v_main_#t~nondet2_2| 2147483647) (<= 0 (+ |v_main_#t~nondet1_2| 2147483648))) InVars {main_#t~nondet1=|v_main_#t~nondet1_2|, main_#t~nondet2=|v_main_#t~nondet2_2|} OutVars{main_~i~0=v_main_~i~0_4, main_~c~0=v_main_~c~0_3} AuxVars[] AssignedVars[main_#t~nondet1, main_#t~nondet2, main_~i~0, main_~c~0] {532#true} is VALID [2022-04-15 01:34:02,897 INFO L272 TraceCheckUtils]: 4: Hoare triple {532#true} [54] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {532#true} is VALID [2022-04-15 01:34:02,897 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {532#true} {532#true} [75] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {532#true} is VALID [2022-04-15 01:34:02,897 INFO L290 TraceCheckUtils]: 2: Hoare triple {532#true} [58] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {532#true} is VALID [2022-04-15 01:34:02,897 INFO L290 TraceCheckUtils]: 1: Hoare triple {532#true} [55] 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) (= (select |v_#length_1| 2) 26) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= (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] {532#true} is VALID [2022-04-15 01:34:02,897 INFO L272 TraceCheckUtils]: 0: Hoare triple {532#true} [53] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {532#true} is VALID [2022-04-15 01:34:02,898 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 2 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 01:34:02,898 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1698209212] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 01:34:02,898 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 01:34:02,898 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 10, 10] total 23 [2022-04-15 01:34:02,899 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1135740777] [2022-04-15 01:34:02,899 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-15 01:34:02,900 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 1.6521739130434783) internal successors, (38), 20 states have internal predecessors, (38), 4 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 20 [2022-04-15 01:34:02,902 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 01:34:02,902 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 23 states, 23 states have (on average 1.6521739130434783) internal successors, (38), 20 states have internal predecessors, (38), 4 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 01:34:02,940 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 45 edges. 45 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 01:34:02,940 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-04-15 01:34:02,940 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-15 01:34:02,940 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-04-15 01:34:02,941 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=406, Unknown=0, NotChecked=0, Total=506 [2022-04-15 01:34:02,941 INFO L87 Difference]: Start difference. First operand 21 states and 21 transitions. Second operand has 23 states, 23 states have (on average 1.6521739130434783) internal successors, (38), 20 states have internal predecessors, (38), 4 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 01:34:03,268 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 01:34:03,268 INFO L93 Difference]: Finished difference Result 21 states and 21 transitions. [2022-04-15 01:34:03,268 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-04-15 01:34:03,268 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 1.6521739130434783) internal successors, (38), 20 states have internal predecessors, (38), 4 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 20 [2022-04-15 01:34:03,268 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 01:34:03,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 23 states have (on average 1.6521739130434783) internal successors, (38), 20 states have internal predecessors, (38), 4 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 01:34:03,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 21 transitions. [2022-04-15 01:34:03,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 23 states have (on average 1.6521739130434783) internal successors, (38), 20 states have internal predecessors, (38), 4 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 01:34:03,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 21 transitions. [2022-04-15 01:34:03,271 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 10 states and 21 transitions. [2022-04-15 01:34:03,291 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-15 01:34:03,291 INFO L225 Difference]: With dead ends: 21 [2022-04-15 01:34:03,291 INFO L226 Difference]: Without dead ends: 0 [2022-04-15 01:34:03,292 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 30 SyntacticMatches, 1 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 175 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=196, Invalid=674, Unknown=0, NotChecked=0, Total=870 [2022-04-15 01:34:03,292 INFO L913 BasicCegarLoop]: 8 mSDtfsCounter, 13 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 90 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 55 SdHoareTripleChecker+Invalid, 99 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 90 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-15 01:34:03,293 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [13 Valid, 55 Invalid, 99 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 90 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-15 01:34:03,293 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-04-15 01:34:03,293 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-04-15 01:34:03,293 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 01:34:03,293 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-15 01:34:03,293 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-15 01:34:03,293 INFO L87 Difference]: Start difference. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-15 01:34:03,293 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 01:34:03,294 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-15 01:34:03,294 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-15 01:34:03,294 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 01:34:03,294 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 01:34:03,294 INFO L74 IsIncluded]: Start isIncluded. First operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 0 states. [2022-04-15 01:34:03,294 INFO L87 Difference]: Start difference. First operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 0 states. [2022-04-15 01:34:03,294 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 01:34:03,294 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-15 01:34:03,294 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-15 01:34:03,294 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 01:34:03,294 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 01:34:03,294 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 01:34:03,294 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 01:34:03,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-15 01:34:03,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-04-15 01:34:03,295 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 20 [2022-04-15 01:34:03,295 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 01:34:03,295 INFO L478 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-04-15 01:34:03,295 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 1.6521739130434783) internal successors, (38), 20 states have internal predecessors, (38), 4 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 01:34:03,295 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-15 01:34:03,295 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 01:34:03,297 INFO L788 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-04-15 01:34:03,322 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-04-15 01:34:03,498 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 01:34:03,500 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-04-15 01:34:03,571 INFO L878 garLoopResultBuilder]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|)) [2022-04-15 01:34:03,572 INFO L882 garLoopResultBuilder]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2022-04-15 01:34:03,572 INFO L882 garLoopResultBuilder]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2022-04-15 01:34:03,572 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2022-04-15 01:34:03,572 INFO L885 garLoopResultBuilder]: At program point L-1(line -1) the Hoare annotation is: true [2022-04-15 01:34:03,572 INFO L882 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2022-04-15 01:34:03,572 INFO L882 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-04-15 01:34:03,572 INFO L885 garLoopResultBuilder]: At program point mainENTRY(lines 19 30) the Hoare annotation is: true [2022-04-15 01:34:03,572 INFO L882 garLoopResultBuilder]: For program point L22(line 22) no Hoare annotation was computed. [2022-04-15 01:34:03,572 INFO L882 garLoopResultBuilder]: For program point mainFINAL(lines 19 30) no Hoare annotation was computed. [2022-04-15 01:34:03,572 INFO L878 garLoopResultBuilder]: At program point L23-2(lines 23 27) the Hoare annotation is: (let ((.cse0 (<= 0 main_~c~0)) (.cse1 (< 2 main_~i~0))) (or (and (<= main_~i~0 1) .cse0 (<= 1 main_~i~0)) (and .cse1 (< main_~i~0 100) (< 2 main_~c~0)) (and (<= main_~i~0 0) .cse0 (<= 0 main_~i~0)) (and .cse1 (< 5 main_~c~0)) (and (< 0 main_~c~0) (< 1 main_~i~0) (< main_~i~0 99)))) [2022-04-15 01:34:03,572 INFO L882 garLoopResultBuilder]: For program point mainEXIT(lines 19 30) no Hoare annotation was computed. [2022-04-15 01:34:03,573 INFO L878 garLoopResultBuilder]: At program point L23-3(lines 23 27) the Hoare annotation is: (and (< 2 main_~i~0) (< 5 main_~c~0)) [2022-04-15 01:34:03,573 INFO L882 garLoopResultBuilder]: For program point L26(line 26) no Hoare annotation was computed. [2022-04-15 01:34:03,573 INFO L882 garLoopResultBuilder]: For program point L28(line 28) no Hoare annotation was computed. [2022-04-15 01:34:03,573 INFO L885 garLoopResultBuilder]: At program point __VERIFIER_assertENTRY(lines 14 18) the Hoare annotation is: true [2022-04-15 01:34:03,573 INFO L882 garLoopResultBuilder]: For program point L15(lines 15 17) no Hoare annotation was computed. [2022-04-15 01:34:03,573 INFO L882 garLoopResultBuilder]: For program point L16(line 16) no Hoare annotation was computed. [2022-04-15 01:34:03,573 INFO L882 garLoopResultBuilder]: For program point L15-2(lines 14 18) no Hoare annotation was computed. [2022-04-15 01:34:03,573 INFO L882 garLoopResultBuilder]: For program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 16) no Hoare annotation was computed. [2022-04-15 01:34:03,573 INFO L882 garLoopResultBuilder]: For program point __VERIFIER_assertEXIT(lines 14 18) no Hoare annotation was computed. [2022-04-15 01:34:03,576 INFO L719 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1] [2022-04-15 01:34:03,577 INFO L177 ceAbstractionStarter]: Computing trace abstraction results [2022-04-15 01:34:03,580 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2022-04-15 01:34:03,580 WARN L170 areAnnotationChecker]: L22 has no Hoare annotation [2022-04-15 01:34:03,580 WARN L170 areAnnotationChecker]: L15 has no Hoare annotation [2022-04-15 01:34:03,580 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2022-04-15 01:34:03,580 WARN L170 areAnnotationChecker]: L22 has no Hoare annotation [2022-04-15 01:34:03,580 WARN L170 areAnnotationChecker]: L22 has no Hoare annotation [2022-04-15 01:34:03,580 WARN L170 areAnnotationChecker]: L15 has no Hoare annotation [2022-04-15 01:34:03,580 WARN L170 areAnnotationChecker]: L15 has no Hoare annotation [2022-04-15 01:34:03,580 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2022-04-15 01:34:03,580 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2022-04-15 01:34:03,587 WARN L170 areAnnotationChecker]: L26 has no Hoare annotation [2022-04-15 01:34:03,587 WARN L170 areAnnotationChecker]: L16 has no Hoare annotation [2022-04-15 01:34:03,587 WARN L170 areAnnotationChecker]: L16 has no Hoare annotation [2022-04-15 01:34:03,587 WARN L170 areAnnotationChecker]: L15-2 has no Hoare annotation [2022-04-15 01:34:03,587 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2022-04-15 01:34:03,587 WARN L170 areAnnotationChecker]: L26 has no Hoare annotation [2022-04-15 01:34:03,587 WARN L170 areAnnotationChecker]: L26 has no Hoare annotation [2022-04-15 01:34:03,587 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-15 01:34:03,587 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2022-04-15 01:34:03,587 WARN L170 areAnnotationChecker]: L28 has no Hoare annotation [2022-04-15 01:34:03,587 INFO L163 areAnnotationChecker]: CFG has 5 edges. 5 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2022-04-15 01:34:03,597 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.04 01:34:03 BasicIcfg [2022-04-15 01:34:03,597 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-04-15 01:34:03,598 INFO L158 Benchmark]: Toolchain (without parser) took 4337.92ms. Allocated memory was 199.2MB in the beginning and 269.5MB in the end (delta: 70.3MB). Free memory was 140.4MB in the beginning and 213.8MB in the end (delta: -73.4MB). There was no memory consumed. Max. memory is 8.0GB. [2022-04-15 01:34:03,598 INFO L158 Benchmark]: CDTParser took 0.10ms. Allocated memory is still 199.2MB. Free memory is still 156.7MB. There was no memory consumed. Max. memory is 8.0GB. [2022-04-15 01:34:03,599 INFO L158 Benchmark]: CACSL2BoogieTranslator took 235.02ms. Allocated memory was 199.2MB in the beginning and 269.5MB in the end (delta: 70.3MB). Free memory was 140.3MB in the beginning and 239.3MB in the end (delta: -99.0MB). Peak memory consumption was 6.2MB. Max. memory is 8.0GB. [2022-04-15 01:34:03,599 INFO L158 Benchmark]: Boogie Preprocessor took 23.08ms. Allocated memory is still 269.5MB. Free memory was 239.3MB in the beginning and 238.0MB in the end (delta: 1.3MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-04-15 01:34:03,599 INFO L158 Benchmark]: RCFGBuilder took 271.96ms. Allocated memory is still 269.5MB. Free memory was 238.0MB in the beginning and 227.5MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. [2022-04-15 01:34:03,599 INFO L158 Benchmark]: IcfgTransformer took 27.94ms. Allocated memory is still 269.5MB. Free memory was 227.1MB in the beginning and 225.7MB in the end (delta: 1.4MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-04-15 01:34:03,600 INFO L158 Benchmark]: TraceAbstraction took 3774.71ms. Allocated memory is still 269.5MB. Free memory was 225.4MB in the beginning and 213.8MB in the end (delta: 11.6MB). Peak memory consumption was 12.7MB. Max. memory is 8.0GB. [2022-04-15 01:34:03,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.10ms. Allocated memory is still 199.2MB. Free memory is still 156.7MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 235.02ms. Allocated memory was 199.2MB in the beginning and 269.5MB in the end (delta: 70.3MB). Free memory was 140.3MB in the beginning and 239.3MB in the end (delta: -99.0MB). Peak memory consumption was 6.2MB. Max. memory is 8.0GB. * Boogie Preprocessor took 23.08ms. Allocated memory is still 269.5MB. Free memory was 239.3MB in the beginning and 238.0MB in the end (delta: 1.3MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 271.96ms. Allocated memory is still 269.5MB. Free memory was 238.0MB in the beginning and 227.5MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. * IcfgTransformer took 27.94ms. Allocated memory is still 269.5MB. Free memory was 227.1MB in the beginning and 225.7MB in the end (delta: 1.4MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * TraceAbstraction took 3774.71ms. Allocated memory is still 269.5MB. Free memory was 225.4MB in the beginning and 213.8MB in the end (delta: 11.6MB). Peak memory consumption was 12.7MB. 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: 16]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 21 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 3.7s, OverallIterations: 5, TraceHistogramMax: 4, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 0.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.1s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 59 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 58 mSDsluCounter, 153 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 86 mSDsCounter, 29 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 148 IncrementalHoareTripleChecker+Invalid, 177 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 29 mSolverCounterUnsat, 67 mSDtfsCounter, 148 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 114 GetRequests, 67 SyntacticMatches, 1 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 183 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=21occurred in iteration=0, InterpolantAutomatonStates: 29, 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, 5 MinimizatonAttempts, 1 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 7 LocationsWithAnnotation, 11 PreInvPairs, 16 NumberOfFragments, 66 HoareAnnotationTreeSize, 11 FomulaSimplifications, 16 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 7 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.6s InterpolantComputationTime, 105 NumberOfCodeBlocks, 105 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 130 ConstructedInterpolants, 0 QuantifiedInterpolants, 323 SizeOfPredicates, 4 NumberOfNonLiveVariables, 144 ConjunctsInSsa, 15 ConjunctsInUnsatCore, 9 InterpolantComputations, 3 PerfectInterpolantSequences, 18/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 - InvariantResult [Line: 23]: Loop Invariant Derived loop invariant: (((((i <= 1 && 0 <= c) && 1 <= i) || ((2 < i && i < 100) && 2 < c)) || ((i <= 0 && 0 <= c) && 0 <= i)) || (2 < i && 5 < c)) || ((0 < c && 1 < i) && i < 99) RESULT: Ultimate proved your program to be correct! [2022-04-15 01:34:03,630 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...