/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/nla-digbench-scaling/geo3-ll_valuebound1.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-e106359-m [2022-04-15 03:13:26,490 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-15 03:13:26,492 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-15 03:13:26,538 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-15 03:13:26,538 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-15 03:13:26,539 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-15 03:13:26,542 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-15 03:13:26,544 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-15 03:13:26,546 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-15 03:13:26,550 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-15 03:13:26,551 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-15 03:13:26,552 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-15 03:13:26,553 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-15 03:13:26,554 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-15 03:13:26,555 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-15 03:13:26,558 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-15 03:13:26,559 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-15 03:13:26,559 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-15 03:13:26,561 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-15 03:13:26,566 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-15 03:13:26,568 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-15 03:13:26,569 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-15 03:13:26,570 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-15 03:13:26,571 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-15 03:13:26,572 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-15 03:13:26,578 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-15 03:13:26,578 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-15 03:13:26,578 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-15 03:13:26,579 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-15 03:13:26,579 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-15 03:13:26,581 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-15 03:13:26,581 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-15 03:13:26,583 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-15 03:13:26,583 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-15 03:13:26,584 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-15 03:13:26,584 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-15 03:13:26,584 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-15 03:13:26,585 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-15 03:13:26,585 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-15 03:13:26,585 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-15 03:13:26,586 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-15 03:13:26,588 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-15 03:13:26,588 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 03:13:26,616 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-15 03:13:26,616 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-15 03:13:26,617 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-04-15 03:13:26,617 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-04-15 03:13:26,618 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-04-15 03:13:26,618 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-04-15 03:13:26,618 INFO L138 SettingsManager]: * Use SBE=true [2022-04-15 03:13:26,619 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-15 03:13:26,619 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-15 03:13:26,619 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-15 03:13:26,620 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-15 03:13:26,620 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-15 03:13:26,620 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-15 03:13:26,620 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-15 03:13:26,620 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-15 03:13:26,620 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-15 03:13:26,621 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-15 03:13:26,621 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-15 03:13:26,621 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-15 03:13:26,621 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-15 03:13:26,621 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-15 03:13:26,621 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-04-15 03:13:26,622 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-04-15 03:13:26,622 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-04-15 03:13:26,622 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-04-15 03:13:26,622 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-15 03:13:26,622 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-04-15 03:13:26,622 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-04-15 03:13:26,624 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-04-15 03:13:26,624 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 03:13:26,862 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-15 03:13:26,886 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-15 03:13:26,888 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-15 03:13:26,889 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-15 03:13:26,890 INFO L275 PluginConnector]: CDTParser initialized [2022-04-15 03:13:26,892 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/nla-digbench-scaling/geo3-ll_valuebound1.c [2022-04-15 03:13:26,946 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/65a46fdd5/235648555a434ee7aaa022f6734c4e77/FLAG48818ead9 [2022-04-15 03:13:27,308 INFO L306 CDTParser]: Found 1 translation units. [2022-04-15 03:13:27,309 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/geo3-ll_valuebound1.c [2022-04-15 03:13:27,318 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/65a46fdd5/235648555a434ee7aaa022f6734c4e77/FLAG48818ead9 [2022-04-15 03:13:27,735 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/65a46fdd5/235648555a434ee7aaa022f6734c4e77 [2022-04-15 03:13:27,737 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-15 03:13:27,738 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-04-15 03:13:27,740 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-15 03:13:27,740 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-15 03:13:27,747 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-15 03:13:27,749 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.04 03:13:27" (1/1) ... [2022-04-15 03:13:27,751 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@43550b42 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 03:13:27, skipping insertion in model container [2022-04-15 03:13:27,751 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.04 03:13:27" (1/1) ... [2022-04-15 03:13:27,769 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-15 03:13:27,786 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-15 03:13:27,920 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/geo3-ll_valuebound1.c[525,538] [2022-04-15 03:13:27,948 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-15 03:13:27,960 INFO L203 MainTranslator]: Completed pre-run [2022-04-15 03:13:27,971 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/geo3-ll_valuebound1.c[525,538] [2022-04-15 03:13:27,977 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-15 03:13:27,989 INFO L208 MainTranslator]: Completed translation [2022-04-15 03:13:27,989 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 03:13:27 WrapperNode [2022-04-15 03:13:27,989 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-15 03:13:27,990 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-15 03:13:27,991 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-15 03:13:27,991 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-15 03:13:27,999 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 03:13:27" (1/1) ... [2022-04-15 03:13:27,999 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 03:13:27" (1/1) ... [2022-04-15 03:13:28,004 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 03:13:27" (1/1) ... [2022-04-15 03:13:28,004 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 03:13:27" (1/1) ... [2022-04-15 03:13:28,010 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 03:13:27" (1/1) ... [2022-04-15 03:13:28,014 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 03:13:27" (1/1) ... [2022-04-15 03:13:28,015 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 03:13:27" (1/1) ... [2022-04-15 03:13:28,016 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-15 03:13:28,017 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-15 03:13:28,017 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-15 03:13:28,017 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-15 03:13:28,018 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 03:13:27" (1/1) ... [2022-04-15 03:13:28,035 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-15 03:13:28,046 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 03:13:28,059 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 03:13:28,119 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 03:13:28,143 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-15 03:13:28,144 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-15 03:13:28,144 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-15 03:13:28,144 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-15 03:13:28,144 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-15 03:13:28,144 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-15 03:13:28,144 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-15 03:13:28,144 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-15 03:13:28,145 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-15 03:13:28,145 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-15 03:13:28,145 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-04-15 03:13:28,145 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-15 03:13:28,145 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-15 03:13:28,145 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-15 03:13:28,145 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-15 03:13:28,145 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-15 03:13:28,145 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-15 03:13:28,145 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-15 03:13:28,146 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-15 03:13:28,146 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-15 03:13:28,205 INFO L234 CfgBuilder]: Building ICFG [2022-04-15 03:13:28,207 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-15 03:13:28,397 INFO L275 CfgBuilder]: Performing block encoding [2022-04-15 03:13:28,403 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-15 03:13:28,403 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-15 03:13:28,405 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.04 03:13:28 BoogieIcfgContainer [2022-04-15 03:13:28,405 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-15 03:13:28,407 INFO L113 PluginConnector]: ------------------------IcfgTransformer---------------------------- [2022-04-15 03:13:28,407 INFO L271 PluginConnector]: Initializing IcfgTransformer... [2022-04-15 03:13:28,408 INFO L275 PluginConnector]: IcfgTransformer initialized [2022-04-15 03:13:28,413 INFO L185 PluginConnector]: Executing the observer IcfgTransformationObserver from plugin IcfgTransformer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.04 03:13:28" (1/1) ... [2022-04-15 03:13:28,415 INFO L168 ansformationObserver]: Applying ICFG transformation LOOP_ACCELERATION_QVASR [2022-04-15 03:13:28,450 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 15.04 03:13:28 BasicIcfg [2022-04-15 03:13:28,451 INFO L132 PluginConnector]: ------------------------ END IcfgTransformer---------------------------- [2022-04-15 03:13:28,454 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-15 03:13:28,454 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-15 03:13:28,456 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-15 03:13:28,457 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.04 03:13:27" (1/4) ... [2022-04-15 03:13:28,457 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2996a0d2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.04 03:13:28, skipping insertion in model container [2022-04-15 03:13:28,458 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 03:13:27" (2/4) ... [2022-04-15 03:13:28,458 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2996a0d2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.04 03:13:28, skipping insertion in model container [2022-04-15 03:13:28,458 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.04 03:13:28" (3/4) ... [2022-04-15 03:13:28,458 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2996a0d2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.04 03:13:28, skipping insertion in model container [2022-04-15 03:13:28,458 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 15.04 03:13:28" (4/4) ... [2022-04-15 03:13:28,459 INFO L111 eAbstractionObserver]: Analyzing ICFG geo3-ll_valuebound1.cqvasr [2022-04-15 03:13:28,464 INFO L202 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-04-15 03:13:28,464 INFO L161 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-15 03:13:28,499 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-15 03:13:28,505 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 03:13:28,505 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-15 03:13:28,533 INFO L276 IsEmpty]: Start isEmpty. Operand has 31 states, 18 states have (on average 1.3333333333333333) internal successors, (24), 19 states have internal predecessors, (24), 7 states have call successors, (7), 4 states have call predecessors, (7), 4 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-15 03:13:28,539 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-04-15 03:13:28,539 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 03:13:28,540 INFO L499 BasicCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 03:13:28,541 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 03:13:28,547 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 03:13:28,548 INFO L85 PathProgramCache]: Analyzing trace with hash 1338008438, now seen corresponding path program 1 times [2022-04-15 03:13:28,556 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 03:13:28,557 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1914961315] [2022-04-15 03:13:28,557 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 03:13:28,558 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 03:13:28,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 03:13:28,739 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 03:13:28,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 03:13:28,774 INFO L290 TraceCheckUtils]: 0: Hoare triple {51#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [70] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#length_1| 2) 10) (= (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] {34#true} is VALID [2022-04-15 03:13:28,774 INFO L290 TraceCheckUtils]: 1: Hoare triple {34#true} [73] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {34#true} is VALID [2022-04-15 03:13:28,775 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {34#true} {34#true} [99] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {34#true} is VALID [2022-04-15 03:13:28,775 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-15 03:13:28,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 03:13:28,783 INFO L290 TraceCheckUtils]: 0: Hoare triple {34#true} [76] assume_abort_if_notENTRY-->L12: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {34#true} is VALID [2022-04-15 03:13:28,784 INFO L290 TraceCheckUtils]: 1: Hoare triple {34#true} [78] L12-->L12-2: Formula: false InVars {} OutVars{} AuxVars[] AssignedVars[] {35#false} is VALID [2022-04-15 03:13:28,784 INFO L290 TraceCheckUtils]: 2: Hoare triple {35#false} [81] L12-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {35#false} is VALID [2022-04-15 03:13:28,785 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {35#false} {34#true} [100] assume_abort_if_notEXIT-->L25-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (and (<= 0 v_main_~z~0_9) (<= v_main_~z~0_9 1)) 1 0) |v_assume_abort_if_not_#in~condInParam_1|) InVars {main_~z~0=v_main_~z~0_9} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~z~0, assume_abort_if_not_#in~cond] {35#false} is VALID [2022-04-15 03:13:28,785 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-04-15 03:13:28,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 03:13:28,796 INFO L290 TraceCheckUtils]: 0: Hoare triple {34#true} [76] assume_abort_if_notENTRY-->L12: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {34#true} is VALID [2022-04-15 03:13:28,797 INFO L290 TraceCheckUtils]: 1: Hoare triple {34#true} [78] L12-->L12-2: Formula: false InVars {} OutVars{} AuxVars[] AssignedVars[] {35#false} is VALID [2022-04-15 03:13:28,797 INFO L290 TraceCheckUtils]: 2: Hoare triple {35#false} [81] L12-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {35#false} is VALID [2022-04-15 03:13:28,797 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {35#false} {35#false} [101] assume_abort_if_notEXIT-->L27-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (and (<= 0 v_main_~a~0_8) (<= v_main_~a~0_8 1)) 1 0)) InVars {main_~a~0=v_main_~a~0_8} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_2|} AuxVars[] AssignedVars[assume_abort_if_not_#in~cond, main_~a~0] {35#false} is VALID [2022-04-15 03:13:28,798 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-04-15 03:13:28,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 03:13:28,807 INFO L290 TraceCheckUtils]: 0: Hoare triple {34#true} [76] assume_abort_if_notENTRY-->L12: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {34#true} is VALID [2022-04-15 03:13:28,808 INFO L290 TraceCheckUtils]: 1: Hoare triple {34#true} [78] L12-->L12-2: Formula: false InVars {} OutVars{} AuxVars[] AssignedVars[] {35#false} is VALID [2022-04-15 03:13:28,808 INFO L290 TraceCheckUtils]: 2: Hoare triple {35#false} [81] L12-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {35#false} is VALID [2022-04-15 03:13:28,808 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {35#false} {35#false} [102] assume_abort_if_notEXIT-->L29-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (and (<= v_main_~k~0_6 1) (<= 0 v_main_~k~0_6)) 1 0) |v_assume_abort_if_not_#in~condInParam_3|) InVars {main_~k~0=v_main_~k~0_6} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_3|} AuxVars[] AssignedVars[main_~k~0, assume_abort_if_not_#in~cond] {35#false} is VALID [2022-04-15 03:13:28,810 INFO L272 TraceCheckUtils]: 0: Hoare triple {34#true} [68] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {51#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 03:13:28,810 INFO L290 TraceCheckUtils]: 1: Hoare triple {51#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [70] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#length_1| 2) 10) (= (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] {34#true} is VALID [2022-04-15 03:13:28,810 INFO L290 TraceCheckUtils]: 2: Hoare triple {34#true} [73] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {34#true} is VALID [2022-04-15 03:13:28,811 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {34#true} {34#true} [99] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {34#true} is VALID [2022-04-15 03:13:28,811 INFO L272 TraceCheckUtils]: 4: Hoare triple {34#true} [69] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {34#true} is VALID [2022-04-15 03:13:28,811 INFO L290 TraceCheckUtils]: 5: Hoare triple {34#true} [72] mainENTRY-->L25: Formula: (and (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= |v_main_#t~nondet4_2| 2147483647) (= v_main_~z~0_2 |v_main_#t~nondet4_2|)) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~az~0=v_main_~az~0_2, main_~x~0=v_main_~x~0_3, main_~z~0=v_main_~z~0_2, main_~k~0=v_main_~k~0_1, main_~c~0=v_main_~c~0_1, main_~y~0=v_main_~y~0_2, main_~a~0=v_main_~a~0_2} AuxVars[] AssignedVars[main_~az~0, main_#t~nondet4, main_~x~0, main_~z~0, main_~k~0, main_~c~0, main_~y~0, main_~a~0] {34#true} is VALID [2022-04-15 03:13:28,812 INFO L272 TraceCheckUtils]: 6: Hoare triple {34#true} [74] L25-->assume_abort_if_notENTRY: Formula: (= (ite (and (<= 0 v_main_~z~0_9) (<= v_main_~z~0_9 1)) 1 0) |v_assume_abort_if_not_#in~condInParam_1|) InVars {main_~z~0=v_main_~z~0_9} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~z~0, assume_abort_if_not_#in~cond] {34#true} is VALID [2022-04-15 03:13:28,812 INFO L290 TraceCheckUtils]: 7: Hoare triple {34#true} [76] assume_abort_if_notENTRY-->L12: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {34#true} is VALID [2022-04-15 03:13:28,813 INFO L290 TraceCheckUtils]: 8: Hoare triple {34#true} [78] L12-->L12-2: Formula: false InVars {} OutVars{} AuxVars[] AssignedVars[] {35#false} is VALID [2022-04-15 03:13:28,813 INFO L290 TraceCheckUtils]: 9: Hoare triple {35#false} [81] L12-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {35#false} is VALID [2022-04-15 03:13:28,813 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {35#false} {34#true} [100] assume_abort_if_notEXIT-->L25-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (and (<= 0 v_main_~z~0_9) (<= v_main_~z~0_9 1)) 1 0) |v_assume_abort_if_not_#in~condInParam_1|) InVars {main_~z~0=v_main_~z~0_9} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~z~0, assume_abort_if_not_#in~cond] {35#false} is VALID [2022-04-15 03:13:28,813 INFO L290 TraceCheckUtils]: 11: Hoare triple {35#false} [75] L25-1-->L27: Formula: (and (<= |v_main_#t~nondet5_2| 2147483647) (= v_main_~a~0_3 |v_main_#t~nondet5_2|) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648))) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|} OutVars{main_~a~0=v_main_~a~0_3} AuxVars[] AssignedVars[main_#t~nondet5, main_~a~0] {35#false} is VALID [2022-04-15 03:13:28,814 INFO L272 TraceCheckUtils]: 12: Hoare triple {35#false} [77] L27-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (and (<= 0 v_main_~a~0_8) (<= v_main_~a~0_8 1)) 1 0)) InVars {main_~a~0=v_main_~a~0_8} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_2|} AuxVars[] AssignedVars[assume_abort_if_not_#in~cond, main_~a~0] {34#true} is VALID [2022-04-15 03:13:28,814 INFO L290 TraceCheckUtils]: 13: Hoare triple {34#true} [76] assume_abort_if_notENTRY-->L12: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {34#true} is VALID [2022-04-15 03:13:28,815 INFO L290 TraceCheckUtils]: 14: Hoare triple {34#true} [78] L12-->L12-2: Formula: false InVars {} OutVars{} AuxVars[] AssignedVars[] {35#false} is VALID [2022-04-15 03:13:28,815 INFO L290 TraceCheckUtils]: 15: Hoare triple {35#false} [81] L12-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {35#false} is VALID [2022-04-15 03:13:28,815 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {35#false} {35#false} [101] assume_abort_if_notEXIT-->L27-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (and (<= 0 v_main_~a~0_8) (<= v_main_~a~0_8 1)) 1 0)) InVars {main_~a~0=v_main_~a~0_8} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_2|} AuxVars[] AssignedVars[assume_abort_if_not_#in~cond, main_~a~0] {35#false} is VALID [2022-04-15 03:13:28,816 INFO L290 TraceCheckUtils]: 17: Hoare triple {35#false} [80] L27-1-->L29: Formula: (and (<= |v_main_#t~nondet6_2| 2147483647) (<= 0 (+ |v_main_#t~nondet6_2| 2147483648)) (= v_main_~k~0_2 |v_main_#t~nondet6_2|)) InVars {main_#t~nondet6=|v_main_#t~nondet6_2|} OutVars{main_~k~0=v_main_~k~0_2} AuxVars[] AssignedVars[main_#t~nondet6, main_~k~0] {35#false} is VALID [2022-04-15 03:13:28,816 INFO L272 TraceCheckUtils]: 18: Hoare triple {35#false} [82] L29-->assume_abort_if_notENTRY: Formula: (= (ite (and (<= v_main_~k~0_6 1) (<= 0 v_main_~k~0_6)) 1 0) |v_assume_abort_if_not_#in~condInParam_3|) InVars {main_~k~0=v_main_~k~0_6} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_3|} AuxVars[] AssignedVars[main_~k~0, assume_abort_if_not_#in~cond] {34#true} is VALID [2022-04-15 03:13:28,816 INFO L290 TraceCheckUtils]: 19: Hoare triple {34#true} [76] assume_abort_if_notENTRY-->L12: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {34#true} is VALID [2022-04-15 03:13:28,817 INFO L290 TraceCheckUtils]: 20: Hoare triple {34#true} [78] L12-->L12-2: Formula: false InVars {} OutVars{} AuxVars[] AssignedVars[] {35#false} is VALID [2022-04-15 03:13:28,817 INFO L290 TraceCheckUtils]: 21: Hoare triple {35#false} [81] L12-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {35#false} is VALID [2022-04-15 03:13:28,818 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {35#false} {35#false} [102] assume_abort_if_notEXIT-->L29-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (and (<= v_main_~k~0_6 1) (<= 0 v_main_~k~0_6)) 1 0) |v_assume_abort_if_not_#in~condInParam_3|) InVars {main_~k~0=v_main_~k~0_6} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_3|} AuxVars[] AssignedVars[main_~k~0, assume_abort_if_not_#in~cond] {35#false} is VALID [2022-04-15 03:13:28,818 INFO L290 TraceCheckUtils]: 23: Hoare triple {35#false} [83] L29-1-->L36-2: Formula: (and (= v_main_~a~0_5 v_main_~x~0_4) (= v_main_~c~0_2 1) (= (* v_main_~a~0_5 v_main_~z~0_6) v_main_~az~0_3) (= v_main_~y~0_3 1)) InVars {main_~z~0=v_main_~z~0_6, main_~a~0=v_main_~a~0_5} OutVars{main_~az~0=v_main_~az~0_3, main_~x~0=v_main_~x~0_4, main_~z~0=v_main_~z~0_6, main_~c~0=v_main_~c~0_2, main_~y~0=v_main_~y~0_3, main_~a~0=v_main_~a~0_5} AuxVars[] AssignedVars[main_~az~0, main_~x~0, main_~c~0, main_~y~0] {35#false} is VALID [2022-04-15 03:13:28,818 INFO L290 TraceCheckUtils]: 24: Hoare triple {35#false} [84] L36-2-->L36-3: Formula: false InVars {} OutVars{} AuxVars[] AssignedVars[] {35#false} is VALID [2022-04-15 03:13:28,819 INFO L272 TraceCheckUtils]: 25: Hoare triple {35#false} [87] L36-3-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (= (+ (* v_main_~z~0_11 v_main_~x~0_9) (* (- 1) v_main_~x~0_9) (* (- 1) (* v_main_~y~0_8 v_main_~az~0_6)) v_main_~a~0_10) 0) 1 0)) InVars {main_~az~0=v_main_~az~0_6, main_~y~0=v_main_~y~0_8, main_~x~0=v_main_~x~0_9, main_~z~0=v_main_~z~0_11, main_~a~0=v_main_~a~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[main_~az~0, __VERIFIER_assert_#in~cond, main_~x~0, main_~z~0, main_~y~0, main_~a~0] {35#false} is VALID [2022-04-15 03:13:28,819 INFO L290 TraceCheckUtils]: 26: Hoare triple {35#false} [90] __VERIFIER_assertENTRY-->L15: Formula: (= v___VERIFIER_assert_~cond_2 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {35#false} is VALID [2022-04-15 03:13:28,819 INFO L290 TraceCheckUtils]: 27: Hoare triple {35#false} [94] L15-->L16: Formula: (= v___VERIFIER_assert_~cond_3 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {35#false} is VALID [2022-04-15 03:13:28,819 INFO L290 TraceCheckUtils]: 28: Hoare triple {35#false} [96] L16-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {35#false} is VALID [2022-04-15 03:13:28,820 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-04-15 03:13:28,821 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 03:13:28,821 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1914961315] [2022-04-15 03:13:28,822 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1914961315] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 03:13:28,822 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 03:13:28,822 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-15 03:13:28,823 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [205298893] [2022-04-15 03:13:28,824 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 03:13:28,829 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 2 states have internal predecessors, (13), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 29 [2022-04-15 03:13:28,831 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 03:13:28,836 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 2 states have internal predecessors, (13), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-15 03:13:28,892 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 23 edges. 23 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 03:13:28,892 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-15 03:13:28,893 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-15 03:13:28,918 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-15 03:13:28,919 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-15 03:13:28,922 INFO L87 Difference]: Start difference. First operand has 31 states, 18 states have (on average 1.3333333333333333) internal successors, (24), 19 states have internal predecessors, (24), 7 states have call successors, (7), 4 states have call predecessors, (7), 4 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Second operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 2 states have internal predecessors, (13), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-15 03:13:29,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 03:13:29,065 INFO L93 Difference]: Finished difference Result 55 states and 73 transitions. [2022-04-15 03:13:29,065 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-15 03:13:29,066 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 2 states have internal predecessors, (13), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 29 [2022-04-15 03:13:29,066 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 03:13:29,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 2 states have internal predecessors, (13), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-15 03:13:29,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 73 transitions. [2022-04-15 03:13:29,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 2 states have internal predecessors, (13), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-15 03:13:29,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 73 transitions. [2022-04-15 03:13:29,086 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 73 transitions. [2022-04-15 03:13:29,176 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 73 edges. 73 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 03:13:29,184 INFO L225 Difference]: With dead ends: 55 [2022-04-15 03:13:29,184 INFO L226 Difference]: Without dead ends: 26 [2022-04-15 03:13:29,187 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 12 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 03:13:29,190 INFO L913 BasicCegarLoop]: 29 mSDtfsCounter, 17 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 32 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 03:13:29,191 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [22 Valid, 32 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 03:13:29,217 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2022-04-15 03:13:29,253 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2022-04-15 03:13:29,253 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 03:13:29,254 INFO L82 GeneralOperation]: Start isEquivalent. First operand 26 states. Second operand has 26 states, 15 states have (on average 1.1333333333333333) internal successors, (17), 16 states have internal predecessors, (17), 7 states have call successors, (7), 4 states have call predecessors, (7), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-15 03:13:29,254 INFO L74 IsIncluded]: Start isIncluded. First operand 26 states. Second operand has 26 states, 15 states have (on average 1.1333333333333333) internal successors, (17), 16 states have internal predecessors, (17), 7 states have call successors, (7), 4 states have call predecessors, (7), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-15 03:13:29,255 INFO L87 Difference]: Start difference. First operand 26 states. Second operand has 26 states, 15 states have (on average 1.1333333333333333) internal successors, (17), 16 states have internal predecessors, (17), 7 states have call successors, (7), 4 states have call predecessors, (7), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-15 03:13:29,262 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 03:13:29,263 INFO L93 Difference]: Finished difference Result 26 states and 29 transitions. [2022-04-15 03:13:29,263 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 29 transitions. [2022-04-15 03:13:29,267 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 03:13:29,268 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 03:13:29,269 INFO L74 IsIncluded]: Start isIncluded. First operand has 26 states, 15 states have (on average 1.1333333333333333) internal successors, (17), 16 states have internal predecessors, (17), 7 states have call successors, (7), 4 states have call predecessors, (7), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand 26 states. [2022-04-15 03:13:29,270 INFO L87 Difference]: Start difference. First operand has 26 states, 15 states have (on average 1.1333333333333333) internal successors, (17), 16 states have internal predecessors, (17), 7 states have call successors, (7), 4 states have call predecessors, (7), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand 26 states. [2022-04-15 03:13:29,277 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 03:13:29,278 INFO L93 Difference]: Finished difference Result 26 states and 29 transitions. [2022-04-15 03:13:29,278 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 29 transitions. [2022-04-15 03:13:29,278 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 03:13:29,279 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 03:13:29,279 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 03:13:29,279 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 03:13:29,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 15 states have (on average 1.1333333333333333) internal successors, (17), 16 states have internal predecessors, (17), 7 states have call successors, (7), 4 states have call predecessors, (7), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-15 03:13:29,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 29 transitions. [2022-04-15 03:13:29,288 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 29 transitions. Word has length 29 [2022-04-15 03:13:29,288 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 03:13:29,288 INFO L478 AbstractCegarLoop]: Abstraction has 26 states and 29 transitions. [2022-04-15 03:13:29,289 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 2 states have internal predecessors, (13), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-15 03:13:29,290 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 29 transitions. [2022-04-15 03:13:29,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-04-15 03:13:29,291 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 03:13:29,292 INFO L499 BasicCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 03:13:29,292 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-15 03:13:29,292 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 03:13:29,293 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 03:13:29,293 INFO L85 PathProgramCache]: Analyzing trace with hash 1251333530, now seen corresponding path program 1 times [2022-04-15 03:13:29,293 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 03:13:29,294 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [969378095] [2022-04-15 03:13:29,294 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 03:13:29,294 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 03:13:29,346 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 03:13:29,346 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [225008900] [2022-04-15 03:13:29,346 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 03:13:29,347 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 03:13:29,347 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 03:13:29,348 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 03:13:29,349 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 03:13:29,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 03:13:29,434 INFO L263 TraceCheckSpWp]: Trace formula consists of 96 conjuncts, 16 conjunts are in the unsatisfiable core [2022-04-15 03:13:29,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 03:13:29,458 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 03:13:29,877 INFO L272 TraceCheckUtils]: 0: Hoare triple {218#true} [68] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {218#true} is VALID [2022-04-15 03:13:29,878 INFO L290 TraceCheckUtils]: 1: Hoare triple {218#true} [70] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#length_1| 2) 10) (= (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] {218#true} is VALID [2022-04-15 03:13:29,880 INFO L290 TraceCheckUtils]: 2: Hoare triple {218#true} [73] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {218#true} is VALID [2022-04-15 03:13:29,880 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {218#true} {218#true} [99] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {218#true} is VALID [2022-04-15 03:13:29,884 INFO L272 TraceCheckUtils]: 4: Hoare triple {218#true} [69] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {218#true} is VALID [2022-04-15 03:13:29,884 INFO L290 TraceCheckUtils]: 5: Hoare triple {218#true} [72] mainENTRY-->L25: Formula: (and (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= |v_main_#t~nondet4_2| 2147483647) (= v_main_~z~0_2 |v_main_#t~nondet4_2|)) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~az~0=v_main_~az~0_2, main_~x~0=v_main_~x~0_3, main_~z~0=v_main_~z~0_2, main_~k~0=v_main_~k~0_1, main_~c~0=v_main_~c~0_1, main_~y~0=v_main_~y~0_2, main_~a~0=v_main_~a~0_2} AuxVars[] AssignedVars[main_~az~0, main_#t~nondet4, main_~x~0, main_~z~0, main_~k~0, main_~c~0, main_~y~0, main_~a~0] {218#true} is VALID [2022-04-15 03:13:29,885 INFO L272 TraceCheckUtils]: 6: Hoare triple {218#true} [74] L25-->assume_abort_if_notENTRY: Formula: (= (ite (and (<= 0 v_main_~z~0_9) (<= v_main_~z~0_9 1)) 1 0) |v_assume_abort_if_not_#in~condInParam_1|) InVars {main_~z~0=v_main_~z~0_9} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~z~0, assume_abort_if_not_#in~cond] {218#true} is VALID [2022-04-15 03:13:29,886 INFO L290 TraceCheckUtils]: 7: Hoare triple {218#true} [76] assume_abort_if_notENTRY-->L12: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {244#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-04-15 03:13:29,888 INFO L290 TraceCheckUtils]: 8: Hoare triple {244#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} [79] L12-->L12-2: Formula: (not (= v_assume_abort_if_not_~cond_3 0)) InVars {assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} OutVars{assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} AuxVars[] AssignedVars[] {248#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-15 03:13:29,889 INFO L290 TraceCheckUtils]: 9: Hoare triple {248#(not (= |assume_abort_if_not_#in~cond| 0))} [81] L12-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {248#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-15 03:13:29,890 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {248#(not (= |assume_abort_if_not_#in~cond| 0))} {218#true} [100] assume_abort_if_notEXIT-->L25-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (and (<= 0 v_main_~z~0_9) (<= v_main_~z~0_9 1)) 1 0) |v_assume_abort_if_not_#in~condInParam_1|) InVars {main_~z~0=v_main_~z~0_9} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~z~0, assume_abort_if_not_#in~cond] {255#(and (<= main_~z~0 1) (<= 0 main_~z~0))} is VALID [2022-04-15 03:13:29,891 INFO L290 TraceCheckUtils]: 11: Hoare triple {255#(and (<= main_~z~0 1) (<= 0 main_~z~0))} [75] L25-1-->L27: Formula: (and (<= |v_main_#t~nondet5_2| 2147483647) (= v_main_~a~0_3 |v_main_#t~nondet5_2|) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648))) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|} OutVars{main_~a~0=v_main_~a~0_3} AuxVars[] AssignedVars[main_#t~nondet5, main_~a~0] {255#(and (<= main_~z~0 1) (<= 0 main_~z~0))} is VALID [2022-04-15 03:13:29,891 INFO L272 TraceCheckUtils]: 12: Hoare triple {255#(and (<= main_~z~0 1) (<= 0 main_~z~0))} [77] L27-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (and (<= 0 v_main_~a~0_8) (<= v_main_~a~0_8 1)) 1 0)) InVars {main_~a~0=v_main_~a~0_8} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_2|} AuxVars[] AssignedVars[assume_abort_if_not_#in~cond, main_~a~0] {218#true} is VALID [2022-04-15 03:13:29,892 INFO L290 TraceCheckUtils]: 13: Hoare triple {218#true} [76] assume_abort_if_notENTRY-->L12: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {218#true} is VALID [2022-04-15 03:13:29,892 INFO L290 TraceCheckUtils]: 14: Hoare triple {218#true} [79] L12-->L12-2: Formula: (not (= v_assume_abort_if_not_~cond_3 0)) InVars {assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} OutVars{assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} AuxVars[] AssignedVars[] {218#true} is VALID [2022-04-15 03:13:29,892 INFO L290 TraceCheckUtils]: 15: Hoare triple {218#true} [81] L12-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {218#true} is VALID [2022-04-15 03:13:29,893 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {218#true} {255#(and (<= main_~z~0 1) (<= 0 main_~z~0))} [101] assume_abort_if_notEXIT-->L27-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (and (<= 0 v_main_~a~0_8) (<= v_main_~a~0_8 1)) 1 0)) InVars {main_~a~0=v_main_~a~0_8} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_2|} AuxVars[] AssignedVars[assume_abort_if_not_#in~cond, main_~a~0] {255#(and (<= main_~z~0 1) (<= 0 main_~z~0))} is VALID [2022-04-15 03:13:29,894 INFO L290 TraceCheckUtils]: 17: Hoare triple {255#(and (<= main_~z~0 1) (<= 0 main_~z~0))} [80] L27-1-->L29: Formula: (and (<= |v_main_#t~nondet6_2| 2147483647) (<= 0 (+ |v_main_#t~nondet6_2| 2147483648)) (= v_main_~k~0_2 |v_main_#t~nondet6_2|)) InVars {main_#t~nondet6=|v_main_#t~nondet6_2|} OutVars{main_~k~0=v_main_~k~0_2} AuxVars[] AssignedVars[main_#t~nondet6, main_~k~0] {255#(and (<= main_~z~0 1) (<= 0 main_~z~0))} is VALID [2022-04-15 03:13:29,894 INFO L272 TraceCheckUtils]: 18: Hoare triple {255#(and (<= main_~z~0 1) (<= 0 main_~z~0))} [82] L29-->assume_abort_if_notENTRY: Formula: (= (ite (and (<= v_main_~k~0_6 1) (<= 0 v_main_~k~0_6)) 1 0) |v_assume_abort_if_not_#in~condInParam_3|) InVars {main_~k~0=v_main_~k~0_6} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_3|} AuxVars[] AssignedVars[main_~k~0, assume_abort_if_not_#in~cond] {218#true} is VALID [2022-04-15 03:13:29,894 INFO L290 TraceCheckUtils]: 19: Hoare triple {218#true} [76] assume_abort_if_notENTRY-->L12: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {218#true} is VALID [2022-04-15 03:13:29,895 INFO L290 TraceCheckUtils]: 20: Hoare triple {218#true} [79] L12-->L12-2: Formula: (not (= v_assume_abort_if_not_~cond_3 0)) InVars {assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} OutVars{assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} AuxVars[] AssignedVars[] {218#true} is VALID [2022-04-15 03:13:29,895 INFO L290 TraceCheckUtils]: 21: Hoare triple {218#true} [81] L12-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {218#true} is VALID [2022-04-15 03:13:29,896 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {218#true} {255#(and (<= main_~z~0 1) (<= 0 main_~z~0))} [102] assume_abort_if_notEXIT-->L29-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (and (<= v_main_~k~0_6 1) (<= 0 v_main_~k~0_6)) 1 0) |v_assume_abort_if_not_#in~condInParam_3|) InVars {main_~k~0=v_main_~k~0_6} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_3|} AuxVars[] AssignedVars[main_~k~0, assume_abort_if_not_#in~cond] {255#(and (<= main_~z~0 1) (<= 0 main_~z~0))} is VALID [2022-04-15 03:13:29,896 INFO L290 TraceCheckUtils]: 23: Hoare triple {255#(and (<= main_~z~0 1) (<= 0 main_~z~0))} [83] L29-1-->L36-2: Formula: (and (= v_main_~a~0_5 v_main_~x~0_4) (= v_main_~c~0_2 1) (= (* v_main_~a~0_5 v_main_~z~0_6) v_main_~az~0_3) (= v_main_~y~0_3 1)) InVars {main_~z~0=v_main_~z~0_6, main_~a~0=v_main_~a~0_5} OutVars{main_~az~0=v_main_~az~0_3, main_~x~0=v_main_~x~0_4, main_~z~0=v_main_~z~0_6, main_~c~0=v_main_~c~0_2, main_~y~0=v_main_~y~0_3, main_~a~0=v_main_~a~0_5} AuxVars[] AssignedVars[main_~az~0, main_~x~0, main_~c~0, main_~y~0] {295#(and (<= main_~z~0 1) (= main_~y~0 1) (<= 0 main_~z~0) (= main_~a~0 main_~x~0) (= (* main_~a~0 main_~z~0) main_~az~0))} is VALID [2022-04-15 03:13:29,897 INFO L290 TraceCheckUtils]: 24: Hoare triple {295#(and (<= main_~z~0 1) (= main_~y~0 1) (<= 0 main_~z~0) (= main_~a~0 main_~x~0) (= (* main_~a~0 main_~z~0) main_~az~0))} [86] L36-2-->L37: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {295#(and (<= main_~z~0 1) (= main_~y~0 1) (<= 0 main_~z~0) (= main_~a~0 main_~x~0) (= (* main_~a~0 main_~z~0) main_~az~0))} is VALID [2022-04-15 03:13:29,898 INFO L272 TraceCheckUtils]: 25: Hoare triple {295#(and (<= main_~z~0 1) (= main_~y~0 1) (<= 0 main_~z~0) (= main_~a~0 main_~x~0) (= (* main_~a~0 main_~z~0) main_~az~0))} [88] L37-->__VERIFIER_assertENTRY: Formula: (= (ite (= (+ (* (- 1) v_main_~x~0_8) v_main_~a~0_9 (* v_main_~z~0_10 v_main_~x~0_8) (* (* v_main_~y~0_7 v_main_~az~0_5) (- 1))) 0) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~az~0=v_main_~az~0_5, main_~y~0=v_main_~y~0_7, main_~x~0=v_main_~x~0_8, main_~z~0=v_main_~z~0_10, main_~a~0=v_main_~a~0_9} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_~az~0, __VERIFIER_assert_#in~cond, main_~x~0, main_~z~0, main_~y~0, main_~a~0] {302#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 03:13:29,899 INFO L290 TraceCheckUtils]: 26: Hoare triple {302#(<= 1 |__VERIFIER_assert_#in~cond|)} [90] __VERIFIER_assertENTRY-->L15: Formula: (= v___VERIFIER_assert_~cond_2 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {306#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 03:13:29,899 INFO L290 TraceCheckUtils]: 27: Hoare triple {306#(<= 1 __VERIFIER_assert_~cond)} [94] L15-->L16: Formula: (= v___VERIFIER_assert_~cond_3 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {219#false} is VALID [2022-04-15 03:13:29,900 INFO L290 TraceCheckUtils]: 28: Hoare triple {219#false} [96] L16-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {219#false} is VALID [2022-04-15 03:13:29,902 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-04-15 03:13:29,902 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 03:13:30,191 INFO L290 TraceCheckUtils]: 28: Hoare triple {219#false} [96] L16-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {219#false} is VALID [2022-04-15 03:13:30,192 INFO L290 TraceCheckUtils]: 27: Hoare triple {306#(<= 1 __VERIFIER_assert_~cond)} [94] L15-->L16: Formula: (= v___VERIFIER_assert_~cond_3 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {219#false} is VALID [2022-04-15 03:13:30,193 INFO L290 TraceCheckUtils]: 26: Hoare triple {302#(<= 1 |__VERIFIER_assert_#in~cond|)} [90] __VERIFIER_assertENTRY-->L15: Formula: (= v___VERIFIER_assert_~cond_2 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {306#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 03:13:30,194 INFO L272 TraceCheckUtils]: 25: Hoare triple {322#(= (+ (* main_~y~0 main_~az~0) main_~x~0) (+ (* main_~z~0 main_~x~0) main_~a~0))} [88] L37-->__VERIFIER_assertENTRY: Formula: (= (ite (= (+ (* (- 1) v_main_~x~0_8) v_main_~a~0_9 (* v_main_~z~0_10 v_main_~x~0_8) (* (* v_main_~y~0_7 v_main_~az~0_5) (- 1))) 0) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~az~0=v_main_~az~0_5, main_~y~0=v_main_~y~0_7, main_~x~0=v_main_~x~0_8, main_~z~0=v_main_~z~0_10, main_~a~0=v_main_~a~0_9} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_~az~0, __VERIFIER_assert_#in~cond, main_~x~0, main_~z~0, main_~y~0, main_~a~0] {302#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 03:13:30,196 INFO L290 TraceCheckUtils]: 24: Hoare triple {322#(= (+ (* main_~y~0 main_~az~0) main_~x~0) (+ (* main_~z~0 main_~x~0) main_~a~0))} [86] L36-2-->L37: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {322#(= (+ (* main_~y~0 main_~az~0) main_~x~0) (+ (* main_~z~0 main_~x~0) main_~a~0))} is VALID [2022-04-15 03:13:30,196 INFO L290 TraceCheckUtils]: 23: Hoare triple {218#true} [83] L29-1-->L36-2: Formula: (and (= v_main_~a~0_5 v_main_~x~0_4) (= v_main_~c~0_2 1) (= (* v_main_~a~0_5 v_main_~z~0_6) v_main_~az~0_3) (= v_main_~y~0_3 1)) InVars {main_~z~0=v_main_~z~0_6, main_~a~0=v_main_~a~0_5} OutVars{main_~az~0=v_main_~az~0_3, main_~x~0=v_main_~x~0_4, main_~z~0=v_main_~z~0_6, main_~c~0=v_main_~c~0_2, main_~y~0=v_main_~y~0_3, main_~a~0=v_main_~a~0_5} AuxVars[] AssignedVars[main_~az~0, main_~x~0, main_~c~0, main_~y~0] {322#(= (+ (* main_~y~0 main_~az~0) main_~x~0) (+ (* main_~z~0 main_~x~0) main_~a~0))} is VALID [2022-04-15 03:13:30,197 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {218#true} {218#true} [102] assume_abort_if_notEXIT-->L29-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (and (<= v_main_~k~0_6 1) (<= 0 v_main_~k~0_6)) 1 0) |v_assume_abort_if_not_#in~condInParam_3|) InVars {main_~k~0=v_main_~k~0_6} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_3|} AuxVars[] AssignedVars[main_~k~0, assume_abort_if_not_#in~cond] {218#true} is VALID [2022-04-15 03:13:30,197 INFO L290 TraceCheckUtils]: 21: Hoare triple {218#true} [81] L12-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {218#true} is VALID [2022-04-15 03:13:30,197 INFO L290 TraceCheckUtils]: 20: Hoare triple {218#true} [79] L12-->L12-2: Formula: (not (= v_assume_abort_if_not_~cond_3 0)) InVars {assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} OutVars{assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} AuxVars[] AssignedVars[] {218#true} is VALID [2022-04-15 03:13:30,197 INFO L290 TraceCheckUtils]: 19: Hoare triple {218#true} [76] assume_abort_if_notENTRY-->L12: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {218#true} is VALID [2022-04-15 03:13:30,198 INFO L272 TraceCheckUtils]: 18: Hoare triple {218#true} [82] L29-->assume_abort_if_notENTRY: Formula: (= (ite (and (<= v_main_~k~0_6 1) (<= 0 v_main_~k~0_6)) 1 0) |v_assume_abort_if_not_#in~condInParam_3|) InVars {main_~k~0=v_main_~k~0_6} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_3|} AuxVars[] AssignedVars[main_~k~0, assume_abort_if_not_#in~cond] {218#true} is VALID [2022-04-15 03:13:30,199 INFO L290 TraceCheckUtils]: 17: Hoare triple {218#true} [80] L27-1-->L29: Formula: (and (<= |v_main_#t~nondet6_2| 2147483647) (<= 0 (+ |v_main_#t~nondet6_2| 2147483648)) (= v_main_~k~0_2 |v_main_#t~nondet6_2|)) InVars {main_#t~nondet6=|v_main_#t~nondet6_2|} OutVars{main_~k~0=v_main_~k~0_2} AuxVars[] AssignedVars[main_#t~nondet6, main_~k~0] {218#true} is VALID [2022-04-15 03:13:30,199 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {218#true} {218#true} [101] assume_abort_if_notEXIT-->L27-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (and (<= 0 v_main_~a~0_8) (<= v_main_~a~0_8 1)) 1 0)) InVars {main_~a~0=v_main_~a~0_8} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_2|} AuxVars[] AssignedVars[assume_abort_if_not_#in~cond, main_~a~0] {218#true} is VALID [2022-04-15 03:13:30,199 INFO L290 TraceCheckUtils]: 15: Hoare triple {218#true} [81] L12-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {218#true} is VALID [2022-04-15 03:13:30,199 INFO L290 TraceCheckUtils]: 14: Hoare triple {218#true} [79] L12-->L12-2: Formula: (not (= v_assume_abort_if_not_~cond_3 0)) InVars {assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} OutVars{assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} AuxVars[] AssignedVars[] {218#true} is VALID [2022-04-15 03:13:30,200 INFO L290 TraceCheckUtils]: 13: Hoare triple {218#true} [76] assume_abort_if_notENTRY-->L12: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {218#true} is VALID [2022-04-15 03:13:30,200 INFO L272 TraceCheckUtils]: 12: Hoare triple {218#true} [77] L27-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (and (<= 0 v_main_~a~0_8) (<= v_main_~a~0_8 1)) 1 0)) InVars {main_~a~0=v_main_~a~0_8} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_2|} AuxVars[] AssignedVars[assume_abort_if_not_#in~cond, main_~a~0] {218#true} is VALID [2022-04-15 03:13:30,201 INFO L290 TraceCheckUtils]: 11: Hoare triple {218#true} [75] L25-1-->L27: Formula: (and (<= |v_main_#t~nondet5_2| 2147483647) (= v_main_~a~0_3 |v_main_#t~nondet5_2|) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648))) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|} OutVars{main_~a~0=v_main_~a~0_3} AuxVars[] AssignedVars[main_#t~nondet5, main_~a~0] {218#true} is VALID [2022-04-15 03:13:30,202 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {218#true} {218#true} [100] assume_abort_if_notEXIT-->L25-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (and (<= 0 v_main_~z~0_9) (<= v_main_~z~0_9 1)) 1 0) |v_assume_abort_if_not_#in~condInParam_1|) InVars {main_~z~0=v_main_~z~0_9} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~z~0, assume_abort_if_not_#in~cond] {218#true} is VALID [2022-04-15 03:13:30,202 INFO L290 TraceCheckUtils]: 9: Hoare triple {218#true} [81] L12-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {218#true} is VALID [2022-04-15 03:13:30,202 INFO L290 TraceCheckUtils]: 8: Hoare triple {218#true} [79] L12-->L12-2: Formula: (not (= v_assume_abort_if_not_~cond_3 0)) InVars {assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} OutVars{assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} AuxVars[] AssignedVars[] {218#true} is VALID [2022-04-15 03:13:30,202 INFO L290 TraceCheckUtils]: 7: Hoare triple {218#true} [76] assume_abort_if_notENTRY-->L12: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {218#true} is VALID [2022-04-15 03:13:30,203 INFO L272 TraceCheckUtils]: 6: Hoare triple {218#true} [74] L25-->assume_abort_if_notENTRY: Formula: (= (ite (and (<= 0 v_main_~z~0_9) (<= v_main_~z~0_9 1)) 1 0) |v_assume_abort_if_not_#in~condInParam_1|) InVars {main_~z~0=v_main_~z~0_9} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~z~0, assume_abort_if_not_#in~cond] {218#true} is VALID [2022-04-15 03:13:30,203 INFO L290 TraceCheckUtils]: 5: Hoare triple {218#true} [72] mainENTRY-->L25: Formula: (and (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= |v_main_#t~nondet4_2| 2147483647) (= v_main_~z~0_2 |v_main_#t~nondet4_2|)) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~az~0=v_main_~az~0_2, main_~x~0=v_main_~x~0_3, main_~z~0=v_main_~z~0_2, main_~k~0=v_main_~k~0_1, main_~c~0=v_main_~c~0_1, main_~y~0=v_main_~y~0_2, main_~a~0=v_main_~a~0_2} AuxVars[] AssignedVars[main_~az~0, main_#t~nondet4, main_~x~0, main_~z~0, main_~k~0, main_~c~0, main_~y~0, main_~a~0] {218#true} is VALID [2022-04-15 03:13:30,203 INFO L272 TraceCheckUtils]: 4: Hoare triple {218#true} [69] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {218#true} is VALID [2022-04-15 03:13:30,203 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {218#true} {218#true} [99] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {218#true} is VALID [2022-04-15 03:13:30,204 INFO L290 TraceCheckUtils]: 2: Hoare triple {218#true} [73] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {218#true} is VALID [2022-04-15 03:13:30,204 INFO L290 TraceCheckUtils]: 1: Hoare triple {218#true} [70] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#length_1| 2) 10) (= (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] {218#true} is VALID [2022-04-15 03:13:30,206 INFO L272 TraceCheckUtils]: 0: Hoare triple {218#true} [68] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {218#true} is VALID [2022-04-15 03:13:30,207 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-04-15 03:13:30,207 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 03:13:30,207 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [969378095] [2022-04-15 03:13:30,208 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 03:13:30,209 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [225008900] [2022-04-15 03:13:30,212 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [225008900] provided 1 perfect and 1 imperfect interpolant sequences [2022-04-15 03:13:30,214 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-04-15 03:13:30,214 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [8] total 9 [2022-04-15 03:13:30,218 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1780634977] [2022-04-15 03:13:30,218 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 03:13:30,219 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 29 [2022-04-15 03:13:30,220 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 03:13:30,220 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2022-04-15 03:13:30,245 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 23 edges. 23 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 03:13:30,246 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-15 03:13:30,246 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-15 03:13:30,247 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-15 03:13:30,247 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2022-04-15 03:13:30,248 INFO L87 Difference]: Start difference. First operand 26 states and 29 transitions. Second operand has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2022-04-15 03:13:31,071 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 03:13:31,071 INFO L93 Difference]: Finished difference Result 26 states and 29 transitions. [2022-04-15 03:13:31,071 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-15 03:13:31,072 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 29 [2022-04-15 03:13:31,072 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 03:13:31,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2022-04-15 03:13:31,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 29 transitions. [2022-04-15 03:13:31,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2022-04-15 03:13:31,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 29 transitions. [2022-04-15 03:13:31,076 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 29 transitions. [2022-04-15 03:13:31,201 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 29 edges. 29 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 03:13:31,201 INFO L225 Difference]: With dead ends: 26 [2022-04-15 03:13:31,201 INFO L226 Difference]: Without dead ends: 0 [2022-04-15 03:13:31,202 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 49 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2022-04-15 03:13:31,203 INFO L913 BasicCegarLoop]: 23 mSDtfsCounter, 6 mSDsluCounter, 54 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 77 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-04-15 03:13:31,204 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [7 Valid, 77 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-04-15 03:13:31,204 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-04-15 03:13:31,205 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-04-15 03:13:31,205 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 03:13:31,205 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 03:13:31,205 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 03:13:31,205 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 03:13:31,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 03:13:31,206 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-15 03:13:31,206 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-15 03:13:31,206 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 03:13:31,206 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 03:13:31,206 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 03:13:31,206 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 03:13:31,207 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 03:13:31,207 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-15 03:13:31,207 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-15 03:13:31,207 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 03:13:31,207 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 03:13:31,207 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 03:13:31,207 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 03:13:31,208 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 03:13:31,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-04-15 03:13:31,208 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 29 [2022-04-15 03:13:31,208 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 03:13:31,208 INFO L478 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-04-15 03:13:31,209 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2022-04-15 03:13:31,209 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-15 03:13:31,209 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 03:13:31,211 INFO L788 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-04-15 03:13:31,237 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-04-15 03:13:31,427 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 03:13:31,429 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-04-15 03:13:31,466 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 03:13:31,466 INFO L882 garLoopResultBuilder]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2022-04-15 03:13:31,466 INFO L882 garLoopResultBuilder]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2022-04-15 03:13:31,466 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2022-04-15 03:13:31,466 INFO L885 garLoopResultBuilder]: At program point L-1(line -1) the Hoare annotation is: true [2022-04-15 03:13:31,466 INFO L882 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2022-04-15 03:13:31,467 INFO L882 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-04-15 03:13:31,467 INFO L885 garLoopResultBuilder]: At program point assume_abort_if_notENTRY(lines 11 13) the Hoare annotation is: true [2022-04-15 03:13:31,467 INFO L882 garLoopResultBuilder]: For program point L12(line 12) no Hoare annotation was computed. [2022-04-15 03:13:31,467 INFO L882 garLoopResultBuilder]: For program point L12-2(lines 11 13) no Hoare annotation was computed. [2022-04-15 03:13:31,467 INFO L882 garLoopResultBuilder]: For program point assume_abort_if_notEXIT(lines 11 13) no Hoare annotation was computed. [2022-04-15 03:13:31,467 INFO L885 garLoopResultBuilder]: At program point mainENTRY(lines 21 48) the Hoare annotation is: true [2022-04-15 03:13:31,467 INFO L885 garLoopResultBuilder]: At program point L25(line 25) the Hoare annotation is: true [2022-04-15 03:13:31,468 INFO L882 garLoopResultBuilder]: For program point L25-1(line 25) no Hoare annotation was computed. [2022-04-15 03:13:31,468 INFO L885 garLoopResultBuilder]: At program point L27(line 27) the Hoare annotation is: true [2022-04-15 03:13:31,468 INFO L882 garLoopResultBuilder]: For program point L27-1(line 27) no Hoare annotation was computed. [2022-04-15 03:13:31,468 INFO L885 garLoopResultBuilder]: At program point L29(line 29) the Hoare annotation is: true [2022-04-15 03:13:31,468 INFO L882 garLoopResultBuilder]: For program point L29-1(line 29) no Hoare annotation was computed. [2022-04-15 03:13:31,468 INFO L878 garLoopResultBuilder]: At program point L36-2(lines 36 45) the Hoare annotation is: (= (+ (* main_~y~0 main_~az~0) main_~x~0) (+ (* main_~z~0 main_~x~0) main_~a~0)) [2022-04-15 03:13:31,468 INFO L878 garLoopResultBuilder]: At program point L36-3(lines 36 45) the Hoare annotation is: (= (+ (* main_~y~0 main_~az~0) main_~x~0) (+ (* main_~z~0 main_~x~0) main_~a~0)) [2022-04-15 03:13:31,469 INFO L878 garLoopResultBuilder]: At program point L37(line 37) the Hoare annotation is: (= (+ (* main_~y~0 main_~az~0) main_~x~0) (+ (* main_~z~0 main_~x~0) main_~a~0)) [2022-04-15 03:13:31,469 INFO L882 garLoopResultBuilder]: For program point L46(line 46) no Hoare annotation was computed. [2022-04-15 03:13:31,469 INFO L882 garLoopResultBuilder]: For program point L37-1(lines 36 45) no Hoare annotation was computed. [2022-04-15 03:13:31,469 INFO L882 garLoopResultBuilder]: For program point mainFINAL(lines 21 48) no Hoare annotation was computed. [2022-04-15 03:13:31,475 INFO L882 garLoopResultBuilder]: For program point mainEXIT(lines 21 48) no Hoare annotation was computed. [2022-04-15 03:13:31,476 INFO L885 garLoopResultBuilder]: At program point __VERIFIER_assertENTRY(lines 14 20) the Hoare annotation is: true [2022-04-15 03:13:31,476 INFO L882 garLoopResultBuilder]: For program point L15(lines 15 18) no Hoare annotation was computed. [2022-04-15 03:13:31,476 INFO L882 garLoopResultBuilder]: For program point L16(lines 16 17) no Hoare annotation was computed. [2022-04-15 03:13:31,476 INFO L882 garLoopResultBuilder]: For program point L15-2(lines 14 20) no Hoare annotation was computed. [2022-04-15 03:13:31,476 INFO L882 garLoopResultBuilder]: For program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 17) no Hoare annotation was computed. [2022-04-15 03:13:31,476 INFO L882 garLoopResultBuilder]: For program point __VERIFIER_assertEXIT(lines 14 20) no Hoare annotation was computed. [2022-04-15 03:13:31,480 INFO L719 BasicCegarLoop]: Path program histogram: [1, 1] [2022-04-15 03:13:31,481 INFO L177 ceAbstractionStarter]: Computing trace abstraction results [2022-04-15 03:13:31,487 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2022-04-15 03:13:31,487 WARN L170 areAnnotationChecker]: L12 has no Hoare annotation [2022-04-15 03:13:31,487 WARN L170 areAnnotationChecker]: L15 has no Hoare annotation [2022-04-15 03:13:31,487 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2022-04-15 03:13:31,488 WARN L170 areAnnotationChecker]: L12 has no Hoare annotation [2022-04-15 03:13:31,488 WARN L170 areAnnotationChecker]: L12 has no Hoare annotation [2022-04-15 03:13:31,488 WARN L170 areAnnotationChecker]: L15 has no Hoare annotation [2022-04-15 03:13:31,488 WARN L170 areAnnotationChecker]: L15 has no Hoare annotation [2022-04-15 03:13:31,488 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2022-04-15 03:13:31,488 WARN L170 areAnnotationChecker]: L12-2 has no Hoare annotation [2022-04-15 03:13:31,488 WARN L170 areAnnotationChecker]: L16 has no Hoare annotation [2022-04-15 03:13:31,488 WARN L170 areAnnotationChecker]: L16 has no Hoare annotation [2022-04-15 03:13:31,488 WARN L170 areAnnotationChecker]: L15-2 has no Hoare annotation [2022-04-15 03:13:31,489 WARN L170 areAnnotationChecker]: assume_abort_if_notEXIT has no Hoare annotation [2022-04-15 03:13:31,489 WARN L170 areAnnotationChecker]: assume_abort_if_notEXIT has no Hoare annotation [2022-04-15 03:13:31,489 WARN L170 areAnnotationChecker]: assume_abort_if_notEXIT has no Hoare annotation [2022-04-15 03:13:31,489 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-15 03:13:31,489 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-15 03:13:31,489 WARN L170 areAnnotationChecker]: L25-1 has no Hoare annotation [2022-04-15 03:13:31,489 WARN L170 areAnnotationChecker]: L27-1 has no Hoare annotation [2022-04-15 03:13:31,489 WARN L170 areAnnotationChecker]: L29-1 has no Hoare annotation [2022-04-15 03:13:31,489 WARN L170 areAnnotationChecker]: L37-1 has no Hoare annotation [2022-04-15 03:13:31,489 WARN L170 areAnnotationChecker]: L37-1 has no Hoare annotation [2022-04-15 03:13:31,490 WARN L170 areAnnotationChecker]: L46 has no Hoare annotation [2022-04-15 03:13:31,491 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2022-04-15 03:13:31,491 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2022-04-15 03:13:31,491 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2022-04-15 03:13:31,491 INFO L163 areAnnotationChecker]: CFG has 11 edges. 11 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2022-04-15 03:13:31,504 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.04 03:13:31 BasicIcfg [2022-04-15 03:13:31,504 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-04-15 03:13:31,507 INFO L158 Benchmark]: Toolchain (without parser) took 3766.70ms. Allocated memory was 204.5MB in the beginning and 300.9MB in the end (delta: 96.5MB). Free memory was 147.4MB in the beginning and 199.4MB in the end (delta: -52.0MB). Peak memory consumption was 44.0MB. Max. memory is 8.0GB. [2022-04-15 03:13:31,510 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 204.5MB. Free memory is still 163.7MB. There was no memory consumed. Max. memory is 8.0GB. [2022-04-15 03:13:31,513 INFO L158 Benchmark]: CACSL2BoogieTranslator took 249.51ms. Allocated memory was 204.5MB in the beginning and 300.9MB in the end (delta: 96.5MB). Free memory was 147.2MB in the beginning and 273.1MB in the end (delta: -125.8MB). Peak memory consumption was 7.0MB. Max. memory is 8.0GB. [2022-04-15 03:13:31,515 INFO L158 Benchmark]: Boogie Preprocessor took 26.02ms. Allocated memory is still 300.9MB. Free memory was 273.1MB in the beginning and 271.4MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-04-15 03:13:31,515 INFO L158 Benchmark]: RCFGBuilder took 387.69ms. Allocated memory is still 300.9MB. Free memory was 271.4MB in the beginning and 260.2MB in the end (delta: 11.2MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2022-04-15 03:13:31,516 INFO L158 Benchmark]: IcfgTransformer took 43.52ms. Allocated memory is still 300.9MB. Free memory was 260.2MB in the beginning and 258.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-04-15 03:13:31,518 INFO L158 Benchmark]: TraceAbstraction took 3050.17ms. Allocated memory is still 300.9MB. Free memory was 257.8MB in the beginning and 199.4MB in the end (delta: 58.4MB). Peak memory consumption was 57.9MB. Max. memory is 8.0GB. [2022-04-15 03:13:31,520 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.15ms. Allocated memory is still 204.5MB. Free memory is still 163.7MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 249.51ms. Allocated memory was 204.5MB in the beginning and 300.9MB in the end (delta: 96.5MB). Free memory was 147.2MB in the beginning and 273.1MB in the end (delta: -125.8MB). Peak memory consumption was 7.0MB. Max. memory is 8.0GB. * Boogie Preprocessor took 26.02ms. Allocated memory is still 300.9MB. Free memory was 273.1MB in the beginning and 271.4MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 387.69ms. Allocated memory is still 300.9MB. Free memory was 271.4MB in the beginning and 260.2MB in the end (delta: 11.2MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * IcfgTransformer took 43.52ms. Allocated memory is still 300.9MB. Free memory was 260.2MB in the beginning and 258.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * TraceAbstraction took 3050.17ms. Allocated memory is still 300.9MB. Free memory was 257.8MB in the beginning and 199.4MB in the end (delta: 58.4MB). Peak memory consumption was 57.9MB. 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: 17]: 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 5 procedures, 31 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 3.0s, OverallIterations: 2, TraceHistogramMax: 3, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 29 SdHoareTripleChecker+Valid, 0.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 23 mSDsluCounter, 109 SdHoareTripleChecker+Invalid, 0.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 57 mSDsCounter, 8 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 25 IncrementalHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 8 mSolverCounterUnsat, 52 mSDtfsCounter, 25 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 71 GetRequests, 61 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=31occurred in iteration=0, InterpolantAutomatonStates: 8, 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, 2 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 12 LocationsWithAnnotation, 19 PreInvPairs, 24 NumberOfFragments, 48 HoareAnnotationTreeSize, 19 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 12 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.9s InterpolantComputationTime, 58 NumberOfCodeBlocks, 58 NumberOfCodeBlocksAsserted, 2 NumberOfCheckSat, 84 ConstructedInterpolants, 0 QuantifiedInterpolants, 190 SizeOfPredicates, 2 NumberOfNonLiveVariables, 96 ConjunctsInSsa, 16 ConjunctsInUnsatCore, 3 InterpolantComputations, 2 PerfectInterpolantSequences, 30/36 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 36]: Loop Invariant Derived loop invariant: y * az + x == z * x + a RESULT: Ultimate proved your program to be correct! [2022-04-15 03:13:31,542 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...