/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/mannadiv_unwindbound10.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-fb4f59a-m [2022-04-28 01:09:40,920 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-28 01:09:40,921 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-28 01:09:40,990 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-28 01:09:40,991 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-28 01:09:40,992 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-28 01:09:40,995 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-28 01:09:40,999 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-28 01:09:41,000 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-28 01:09:41,004 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-28 01:09:41,005 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-28 01:09:41,006 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-28 01:09:41,006 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-28 01:09:41,006 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-28 01:09:41,007 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-28 01:09:41,008 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-28 01:09:41,009 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-28 01:09:41,009 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-28 01:09:41,010 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-28 01:09:41,012 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-28 01:09:41,013 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-28 01:09:41,016 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-28 01:09:41,017 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-28 01:09:41,019 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-28 01:09:41,020 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-28 01:09:41,030 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-28 01:09:41,030 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-28 01:09:41,031 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-28 01:09:41,031 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-28 01:09:41,032 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-28 01:09:41,033 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-28 01:09:41,033 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-28 01:09:41,035 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-28 01:09:41,035 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-28 01:09:41,036 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-28 01:09:41,036 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-28 01:09:41,036 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-28 01:09:41,037 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-28 01:09:41,037 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-28 01:09:41,037 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-28 01:09:41,038 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-28 01:09:41,039 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-28 01:09:41,040 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/loopacceleration/qvasr/qvasr_64.epf [2022-04-28 01:09:41,067 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-28 01:09:41,068 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-28 01:09:41,068 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-04-28 01:09:41,068 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-04-28 01:09:41,069 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-04-28 01:09:41,069 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-04-28 01:09:41,070 INFO L138 SettingsManager]: * Use SBE=true [2022-04-28 01:09:41,070 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-28 01:09:41,070 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-28 01:09:41,071 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-28 01:09:41,071 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-28 01:09:41,071 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-28 01:09:41,071 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-28 01:09:41,071 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-28 01:09:41,071 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-28 01:09:41,071 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-28 01:09:41,072 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-28 01:09:41,072 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-28 01:09:41,072 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-28 01:09:41,072 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-28 01:09:41,072 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-28 01:09:41,072 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-04-28 01:09:41,073 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-04-28 01:09:41,073 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-04-28 01:09:41,073 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-04-28 01:09:41,073 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-28 01:09:41,073 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-04-28 01:09:41,073 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-04-28 01:09:41,074 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-04-28 01:09:41,074 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-28 01:09:41,261 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-28 01:09:41,278 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-28 01:09:41,280 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-28 01:09:41,281 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-28 01:09:41,282 INFO L275 PluginConnector]: CDTParser initialized [2022-04-28 01:09:41,283 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/nla-digbench-scaling/mannadiv_unwindbound10.c [2022-04-28 01:09:41,345 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4835ec851/4a2027c916de4a25bd07866a6bfc900e/FLAGeeadb85a0 [2022-04-28 01:09:41,701 INFO L306 CDTParser]: Found 1 translation units. [2022-04-28 01:09:41,701 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/mannadiv_unwindbound10.c [2022-04-28 01:09:41,706 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4835ec851/4a2027c916de4a25bd07866a6bfc900e/FLAGeeadb85a0 [2022-04-28 01:09:41,717 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4835ec851/4a2027c916de4a25bd07866a6bfc900e [2022-04-28 01:09:41,718 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-28 01:09:41,719 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-04-28 01:09:41,723 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-28 01:09:41,723 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-28 01:09:41,726 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-28 01:09:41,727 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.04 01:09:41" (1/1) ... [2022-04-28 01:09:41,728 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@47fe0ef3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 01:09:41, skipping insertion in model container [2022-04-28 01:09:41,728 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.04 01:09:41" (1/1) ... [2022-04-28 01:09:41,734 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-28 01:09:41,750 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-28 01:09:41,878 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/mannadiv_unwindbound10.c[573,586] [2022-04-28 01:09:41,899 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-28 01:09:41,906 INFO L203 MainTranslator]: Completed pre-run [2022-04-28 01:09:41,916 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/mannadiv_unwindbound10.c[573,586] [2022-04-28 01:09:41,920 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-28 01:09:41,931 INFO L208 MainTranslator]: Completed translation [2022-04-28 01:09:41,931 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 01:09:41 WrapperNode [2022-04-28 01:09:41,931 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-28 01:09:41,934 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-28 01:09:41,934 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-28 01:09:41,934 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-28 01:09:41,942 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 01:09:41" (1/1) ... [2022-04-28 01:09:41,942 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 01:09:41" (1/1) ... [2022-04-28 01:09:41,946 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 01:09:41" (1/1) ... [2022-04-28 01:09:41,946 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 01:09:41" (1/1) ... [2022-04-28 01:09:41,951 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 01:09:41" (1/1) ... [2022-04-28 01:09:41,955 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 01:09:41" (1/1) ... [2022-04-28 01:09:41,955 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 01:09:41" (1/1) ... [2022-04-28 01:09:41,957 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-28 01:09:41,958 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-28 01:09:41,958 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-28 01:09:41,958 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-28 01:09:41,958 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 01:09:41" (1/1) ... [2022-04-28 01:09:41,968 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-28 01:09:41,976 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 01:09:41,985 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-28 01:09:41,995 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-28 01:09:42,016 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-28 01:09:42,016 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-28 01:09:42,017 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-28 01:09:42,017 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-28 01:09:42,017 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-28 01:09:42,017 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-28 01:09:42,017 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-28 01:09:42,018 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-28 01:09:42,018 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-28 01:09:42,018 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-28 01:09:42,018 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-04-28 01:09:42,018 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-28 01:09:42,018 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-28 01:09:42,018 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-28 01:09:42,018 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-28 01:09:42,019 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-28 01:09:42,019 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-28 01:09:42,019 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-28 01:09:42,019 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-28 01:09:42,019 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-28 01:09:42,065 INFO L234 CfgBuilder]: Building ICFG [2022-04-28 01:09:42,066 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-28 01:09:42,165 INFO L275 CfgBuilder]: Performing block encoding [2022-04-28 01:09:42,171 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-28 01:09:42,171 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-28 01:09:42,173 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.04 01:09:42 BoogieIcfgContainer [2022-04-28 01:09:42,173 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-28 01:09:42,174 INFO L113 PluginConnector]: ------------------------IcfgTransformer---------------------------- [2022-04-28 01:09:42,174 INFO L271 PluginConnector]: Initializing IcfgTransformer... [2022-04-28 01:09:42,174 INFO L275 PluginConnector]: IcfgTransformer initialized [2022-04-28 01:09:42,177 INFO L185 PluginConnector]: Executing the observer IcfgTransformationObserver from plugin IcfgTransformer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.04 01:09:42" (1/1) ... [2022-04-28 01:09:42,179 INFO L168 ansformationObserver]: Applying ICFG transformation LOOP_ACCELERATION_QVASR [2022-04-28 01:09:42,198 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 28.04 01:09:42 BasicIcfg [2022-04-28 01:09:42,198 INFO L132 PluginConnector]: ------------------------ END IcfgTransformer---------------------------- [2022-04-28 01:09:42,200 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-28 01:09:42,200 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-28 01:09:42,202 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-28 01:09:42,202 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.04 01:09:41" (1/4) ... [2022-04-28 01:09:42,203 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@29f4b895 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.04 01:09:42, skipping insertion in model container [2022-04-28 01:09:42,203 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 01:09:41" (2/4) ... [2022-04-28 01:09:42,203 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@29f4b895 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.04 01:09:42, skipping insertion in model container [2022-04-28 01:09:42,203 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.04 01:09:42" (3/4) ... [2022-04-28 01:09:42,204 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@29f4b895 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.04 01:09:42, skipping insertion in model container [2022-04-28 01:09:42,204 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 28.04 01:09:42" (4/4) ... [2022-04-28 01:09:42,204 INFO L111 eAbstractionObserver]: Analyzing ICFG mannadiv_unwindbound10.cqvasr [2022-04-28 01:09:42,216 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-04-28 01:09:42,216 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-28 01:09:42,269 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-28 01:09:42,306 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@28db03a7, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@173eccec [2022-04-28 01:09:42,306 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-28 01:09:42,314 INFO L276 IsEmpty]: Start isEmpty. Operand has 30 states, 18 states have (on average 1.3888888888888888) internal successors, (25), 19 states have internal predecessors, (25), 6 states have call successors, (6), 4 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-28 01:09:42,322 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-04-28 01:09:42,323 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 01:09:42,323 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 01:09:42,324 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 01:09:42,335 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 01:09:42,335 INFO L85 PathProgramCache]: Analyzing trace with hash 734203501, now seen corresponding path program 1 times [2022-04-28 01:09:42,343 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 01:09:42,343 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [991881061] [2022-04-28 01:09:42,344 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 01:09:42,344 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 01:09:42,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 01:09:42,537 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 01:09:42,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 01:09:42,552 INFO L290 TraceCheckUtils]: 0: Hoare triple {46#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [72] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= v_~counter~0_3 0) (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (= (select |v_#length_1| 2) 11) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (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{~counter~0=v_~counter~0_3, #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[~counter~0, #NULL.offset, #NULL.base] {33#true} is VALID [2022-04-28 01:09:42,553 INFO L290 TraceCheckUtils]: 1: Hoare triple {33#true} [75] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {33#true} is VALID [2022-04-28 01:09:42,553 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {33#true} {33#true} [101] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {33#true} is VALID [2022-04-28 01:09:42,554 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-28 01:09:42,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 01:09:42,563 INFO L290 TraceCheckUtils]: 0: Hoare triple {33#true} [78] assume_abort_if_notENTRY-->L13: 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] {33#true} is VALID [2022-04-28 01:09:42,564 INFO L290 TraceCheckUtils]: 1: Hoare triple {33#true} [80] L13-->L13-2: Formula: false InVars {} OutVars{} AuxVars[] AssignedVars[] {34#false} is VALID [2022-04-28 01:09:42,565 INFO L290 TraceCheckUtils]: 2: Hoare triple {34#false} [84] L13-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {34#false} is VALID [2022-04-28 01:09:42,565 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {34#false} {33#true} [102] assume_abort_if_notEXIT-->L29-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (<= 0 v_main_~x1~0_8) 1 0) |v_assume_abort_if_not_#in~condInParam_1|) InVars {main_~x1~0=v_main_~x1~0_8} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~x1~0, assume_abort_if_not_#in~cond] {34#false} is VALID [2022-04-28 01:09:42,565 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-04-28 01:09:42,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 01:09:42,580 INFO L290 TraceCheckUtils]: 0: Hoare triple {33#true} [78] assume_abort_if_notENTRY-->L13: 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] {33#true} is VALID [2022-04-28 01:09:42,581 INFO L290 TraceCheckUtils]: 1: Hoare triple {33#true} [80] L13-->L13-2: Formula: false InVars {} OutVars{} AuxVars[] AssignedVars[] {34#false} is VALID [2022-04-28 01:09:42,581 INFO L290 TraceCheckUtils]: 2: Hoare triple {34#false} [84] L13-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {34#false} is VALID [2022-04-28 01:09:42,581 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {34#false} {34#false} [103] assume_abort_if_notEXIT-->L30: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (not (= v_main_~x2~0_9 0)) 1 0)) InVars {main_~x2~0=v_main_~x2~0_9} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_2|} AuxVars[] AssignedVars[main_~x2~0, assume_abort_if_not_#in~cond] {34#false} is VALID [2022-04-28 01:09:42,583 INFO L272 TraceCheckUtils]: 0: Hoare triple {33#true} [70] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {46#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 01:09:42,583 INFO L290 TraceCheckUtils]: 1: Hoare triple {46#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [72] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= v_~counter~0_3 0) (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (= (select |v_#length_1| 2) 11) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (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{~counter~0=v_~counter~0_3, #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[~counter~0, #NULL.offset, #NULL.base] {33#true} is VALID [2022-04-28 01:09:42,584 INFO L290 TraceCheckUtils]: 2: Hoare triple {33#true} [75] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {33#true} is VALID [2022-04-28 01:09:42,584 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {33#true} {33#true} [101] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {33#true} is VALID [2022-04-28 01:09:42,584 INFO L272 TraceCheckUtils]: 4: Hoare triple {33#true} [71] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {33#true} is VALID [2022-04-28 01:09:42,584 INFO L290 TraceCheckUtils]: 5: Hoare triple {33#true} [74] mainENTRY-->L29: Formula: (and (<= |v_main_#t~nondet5_2| 2147483647) (= v_main_~x1~0_2 |v_main_#t~nondet4_2|) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= |v_main_#t~nondet4_2| 2147483647) (= v_main_~x2~0_4 |v_main_#t~nondet5_2|) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648))) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|, main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~x2~0=v_main_~x2~0_4, main_~x1~0=v_main_~x1~0_2, main_~y3~0=v_main_~y3~0_5, main_~y2~0=v_main_~y2~0_6, main_~y1~0=v_main_~y1~0_4} AuxVars[] AssignedVars[main_#t~nondet5, main_#t~nondet4, main_~y3~0, main_~y2~0, main_~y1~0, main_~x2~0, main_~x1~0] {33#true} is VALID [2022-04-28 01:09:42,585 INFO L272 TraceCheckUtils]: 6: Hoare triple {33#true} [76] L29-->assume_abort_if_notENTRY: Formula: (= (ite (<= 0 v_main_~x1~0_8) 1 0) |v_assume_abort_if_not_#in~condInParam_1|) InVars {main_~x1~0=v_main_~x1~0_8} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~x1~0, assume_abort_if_not_#in~cond] {33#true} is VALID [2022-04-28 01:09:42,585 INFO L290 TraceCheckUtils]: 7: Hoare triple {33#true} [78] assume_abort_if_notENTRY-->L13: 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] {33#true} is VALID [2022-04-28 01:09:42,588 INFO L290 TraceCheckUtils]: 8: Hoare triple {33#true} [80] L13-->L13-2: Formula: false InVars {} OutVars{} AuxVars[] AssignedVars[] {34#false} is VALID [2022-04-28 01:09:42,588 INFO L290 TraceCheckUtils]: 9: Hoare triple {34#false} [84] L13-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {34#false} is VALID [2022-04-28 01:09:42,588 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {34#false} {33#true} [102] assume_abort_if_notEXIT-->L29-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (<= 0 v_main_~x1~0_8) 1 0) |v_assume_abort_if_not_#in~condInParam_1|) InVars {main_~x1~0=v_main_~x1~0_8} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~x1~0, assume_abort_if_not_#in~cond] {34#false} is VALID [2022-04-28 01:09:42,589 INFO L272 TraceCheckUtils]: 11: Hoare triple {34#false} [77] L29-1-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (not (= v_main_~x2~0_9 0)) 1 0)) InVars {main_~x2~0=v_main_~x2~0_9} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_2|} AuxVars[] AssignedVars[main_~x2~0, assume_abort_if_not_#in~cond] {33#true} is VALID [2022-04-28 01:09:42,589 INFO L290 TraceCheckUtils]: 12: Hoare triple {33#true} [78] assume_abort_if_notENTRY-->L13: 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] {33#true} is VALID [2022-04-28 01:09:42,590 INFO L290 TraceCheckUtils]: 13: Hoare triple {33#true} [80] L13-->L13-2: Formula: false InVars {} OutVars{} AuxVars[] AssignedVars[] {34#false} is VALID [2022-04-28 01:09:42,590 INFO L290 TraceCheckUtils]: 14: Hoare triple {34#false} [84] L13-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {34#false} is VALID [2022-04-28 01:09:42,590 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {34#false} {34#false} [103] assume_abort_if_notEXIT-->L30: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (not (= v_main_~x2~0_9 0)) 1 0)) InVars {main_~x2~0=v_main_~x2~0_9} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_2|} AuxVars[] AssignedVars[main_~x2~0, assume_abort_if_not_#in~cond] {34#false} is VALID [2022-04-28 01:09:42,591 INFO L290 TraceCheckUtils]: 16: Hoare triple {34#false} [79] L30-->L41-2: Formula: (and (= v_main_~y1~0_5 0) (= v_main_~y2~0_7 0) (= v_main_~x1~0_6 v_main_~y3~0_6)) InVars {main_~x1~0=v_main_~x1~0_6} OutVars{main_~x1~0=v_main_~x1~0_6, main_~y3~0=v_main_~y3~0_6, main_~y2~0=v_main_~y2~0_7, main_~y1~0=v_main_~y1~0_5} AuxVars[] AssignedVars[main_~y3~0, main_~y2~0, main_~y1~0] {34#false} is VALID [2022-04-28 01:09:42,591 INFO L290 TraceCheckUtils]: 17: Hoare triple {34#false} [82] L41-2-->L36-3: Formula: false InVars {} OutVars{} AuxVars[] AssignedVars[] {34#false} is VALID [2022-04-28 01:09:42,591 INFO L272 TraceCheckUtils]: 18: Hoare triple {34#false} [85] L36-3-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (= (+ v_main_~y2~0_10 (* v_main_~y1~0_8 v_main_~x2~0_11)) v_main_~x1~0_10) 1 0)) InVars {main_~x2~0=v_main_~x2~0_11, main_~x1~0=v_main_~x1~0_10, main_~y2~0=v_main_~y2~0_10, main_~y1~0=v_main_~y1~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~y2~0, main_~y1~0, main_~x2~0, main_~x1~0] {34#false} is VALID [2022-04-28 01:09:42,591 INFO L290 TraceCheckUtils]: 19: Hoare triple {34#false} [89] __VERIFIER_assertENTRY-->L16: Formula: (= v___VERIFIER_assert_~cond_3 |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_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {34#false} is VALID [2022-04-28 01:09:42,592 INFO L290 TraceCheckUtils]: 20: Hoare triple {34#false} [92] L16-->L17: Formula: (= v___VERIFIER_assert_~cond_1 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[] {34#false} is VALID [2022-04-28 01:09:42,592 INFO L290 TraceCheckUtils]: 21: Hoare triple {34#false} [96] L17-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {34#false} is VALID [2022-04-28 01:09:42,593 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-28 01:09:42,593 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 01:09:42,593 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [991881061] [2022-04-28 01:09:42,595 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [991881061] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 01:09:42,595 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 01:09:42,595 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-28 01:09:42,597 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1488336984] [2022-04-28 01:09:42,598 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 01:09:42,603 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 22 [2022-04-28 01:09:42,604 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 01:09:42,607 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-28 01:09:42,640 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 19 edges. 19 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 01:09:42,640 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-28 01:09:42,641 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-28 01:09:42,671 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-28 01:09:42,672 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-28 01:09:42,674 INFO L87 Difference]: Start difference. First operand has 30 states, 18 states have (on average 1.3888888888888888) internal successors, (25), 19 states have internal predecessors, (25), 6 states have call successors, (6), 4 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-28 01:09:42,837 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 01:09:42,837 INFO L93 Difference]: Finished difference Result 54 states and 72 transitions. [2022-04-28 01:09:42,838 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-28 01:09:42,838 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 22 [2022-04-28 01:09:42,838 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 01:09:42,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-28 01:09:42,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 72 transitions. [2022-04-28 01:09:42,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-28 01:09:42,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 72 transitions. [2022-04-28 01:09:42,853 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 72 transitions. [2022-04-28 01:09:42,923 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 72 edges. 72 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 01:09:42,930 INFO L225 Difference]: With dead ends: 54 [2022-04-28 01:09:42,930 INFO L226 Difference]: Without dead ends: 26 [2022-04-28 01:09:42,933 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 9 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-28 01:09:42,935 INFO L413 NwaCegarLoop]: 31 mSDtfsCounter, 10 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 35 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 01:09:42,936 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 35 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 01:09:42,959 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2022-04-28 01:09:42,969 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 25. [2022-04-28 01:09:42,969 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 01:09:42,970 INFO L82 GeneralOperation]: Start isEquivalent. First operand 26 states. Second operand has 25 states, 15 states have (on average 1.2666666666666666) internal successors, (19), 16 states have internal predecessors, (19), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-28 01:09:42,970 INFO L74 IsIncluded]: Start isIncluded. First operand 26 states. Second operand has 25 states, 15 states have (on average 1.2666666666666666) internal successors, (19), 16 states have internal predecessors, (19), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-28 01:09:42,971 INFO L87 Difference]: Start difference. First operand 26 states. Second operand has 25 states, 15 states have (on average 1.2666666666666666) internal successors, (19), 16 states have internal predecessors, (19), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-28 01:09:42,976 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 01:09:42,976 INFO L93 Difference]: Finished difference Result 26 states and 30 transitions. [2022-04-28 01:09:42,976 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 30 transitions. [2022-04-28 01:09:42,976 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 01:09:42,976 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 01:09:42,977 INFO L74 IsIncluded]: Start isIncluded. First operand has 25 states, 15 states have (on average 1.2666666666666666) internal successors, (19), 16 states have internal predecessors, (19), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand 26 states. [2022-04-28 01:09:42,977 INFO L87 Difference]: Start difference. First operand has 25 states, 15 states have (on average 1.2666666666666666) internal successors, (19), 16 states have internal predecessors, (19), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand 26 states. [2022-04-28 01:09:42,981 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 01:09:42,994 INFO L93 Difference]: Finished difference Result 26 states and 30 transitions. [2022-04-28 01:09:42,994 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 30 transitions. [2022-04-28 01:09:42,995 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 01:09:42,995 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 01:09:42,995 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 01:09:42,996 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 01:09:42,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 15 states have (on average 1.2666666666666666) internal successors, (19), 16 states have internal predecessors, (19), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-28 01:09:43,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 29 transitions. [2022-04-28 01:09:43,001 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 29 transitions. Word has length 22 [2022-04-28 01:09:43,001 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 01:09:43,001 INFO L495 AbstractCegarLoop]: Abstraction has 25 states and 29 transitions. [2022-04-28 01:09:43,002 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-28 01:09:43,002 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 29 transitions. [2022-04-28 01:09:43,003 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-04-28 01:09:43,003 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 01:09:43,003 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 01:09:43,003 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-28 01:09:43,003 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 01:09:43,004 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 01:09:43,004 INFO L85 PathProgramCache]: Analyzing trace with hash -1669026344, now seen corresponding path program 1 times [2022-04-28 01:09:43,004 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 01:09:43,004 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [190074793] [2022-04-28 01:09:43,005 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 01:09:43,005 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 01:09:43,023 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 01:09:43,024 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [291558820] [2022-04-28 01:09:43,024 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 01:09:43,024 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 01:09:43,024 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 01:09:43,025 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-28 01:09:43,026 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-28 01:09:43,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 01:09:43,073 INFO L263 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 5 conjunts are in the unsatisfiable core [2022-04-28 01:09:43,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 01:09:43,087 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 01:09:43,235 INFO L272 TraceCheckUtils]: 0: Hoare triple {209#true} [70] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {209#true} is VALID [2022-04-28 01:09:43,236 INFO L290 TraceCheckUtils]: 1: Hoare triple {209#true} [72] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= v_~counter~0_3 0) (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (= (select |v_#length_1| 2) 11) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (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{~counter~0=v_~counter~0_3, #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[~counter~0, #NULL.offset, #NULL.base] {217#(<= ~counter~0 0)} is VALID [2022-04-28 01:09:43,236 INFO L290 TraceCheckUtils]: 2: Hoare triple {217#(<= ~counter~0 0)} [75] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {217#(<= ~counter~0 0)} is VALID [2022-04-28 01:09:43,237 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {217#(<= ~counter~0 0)} {209#true} [101] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {217#(<= ~counter~0 0)} is VALID [2022-04-28 01:09:43,237 INFO L272 TraceCheckUtils]: 4: Hoare triple {217#(<= ~counter~0 0)} [71] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {217#(<= ~counter~0 0)} is VALID [2022-04-28 01:09:43,238 INFO L290 TraceCheckUtils]: 5: Hoare triple {217#(<= ~counter~0 0)} [74] mainENTRY-->L29: Formula: (and (<= |v_main_#t~nondet5_2| 2147483647) (= v_main_~x1~0_2 |v_main_#t~nondet4_2|) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= |v_main_#t~nondet4_2| 2147483647) (= v_main_~x2~0_4 |v_main_#t~nondet5_2|) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648))) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|, main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~x2~0=v_main_~x2~0_4, main_~x1~0=v_main_~x1~0_2, main_~y3~0=v_main_~y3~0_5, main_~y2~0=v_main_~y2~0_6, main_~y1~0=v_main_~y1~0_4} AuxVars[] AssignedVars[main_#t~nondet5, main_#t~nondet4, main_~y3~0, main_~y2~0, main_~y1~0, main_~x2~0, main_~x1~0] {217#(<= ~counter~0 0)} is VALID [2022-04-28 01:09:43,239 INFO L272 TraceCheckUtils]: 6: Hoare triple {217#(<= ~counter~0 0)} [76] L29-->assume_abort_if_notENTRY: Formula: (= (ite (<= 0 v_main_~x1~0_8) 1 0) |v_assume_abort_if_not_#in~condInParam_1|) InVars {main_~x1~0=v_main_~x1~0_8} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~x1~0, assume_abort_if_not_#in~cond] {217#(<= ~counter~0 0)} is VALID [2022-04-28 01:09:43,239 INFO L290 TraceCheckUtils]: 7: Hoare triple {217#(<= ~counter~0 0)} [78] assume_abort_if_notENTRY-->L13: 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] {217#(<= ~counter~0 0)} is VALID [2022-04-28 01:09:43,239 INFO L290 TraceCheckUtils]: 8: Hoare triple {217#(<= ~counter~0 0)} [81] L13-->L13-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[] {217#(<= ~counter~0 0)} is VALID [2022-04-28 01:09:43,240 INFO L290 TraceCheckUtils]: 9: Hoare triple {217#(<= ~counter~0 0)} [84] L13-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {217#(<= ~counter~0 0)} is VALID [2022-04-28 01:09:43,241 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {217#(<= ~counter~0 0)} {217#(<= ~counter~0 0)} [102] assume_abort_if_notEXIT-->L29-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (<= 0 v_main_~x1~0_8) 1 0) |v_assume_abort_if_not_#in~condInParam_1|) InVars {main_~x1~0=v_main_~x1~0_8} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~x1~0, assume_abort_if_not_#in~cond] {217#(<= ~counter~0 0)} is VALID [2022-04-28 01:09:43,241 INFO L272 TraceCheckUtils]: 11: Hoare triple {217#(<= ~counter~0 0)} [77] L29-1-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (not (= v_main_~x2~0_9 0)) 1 0)) InVars {main_~x2~0=v_main_~x2~0_9} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_2|} AuxVars[] AssignedVars[main_~x2~0, assume_abort_if_not_#in~cond] {217#(<= ~counter~0 0)} is VALID [2022-04-28 01:09:43,242 INFO L290 TraceCheckUtils]: 12: Hoare triple {217#(<= ~counter~0 0)} [78] assume_abort_if_notENTRY-->L13: 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] {217#(<= ~counter~0 0)} is VALID [2022-04-28 01:09:43,242 INFO L290 TraceCheckUtils]: 13: Hoare triple {217#(<= ~counter~0 0)} [81] L13-->L13-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[] {217#(<= ~counter~0 0)} is VALID [2022-04-28 01:09:43,243 INFO L290 TraceCheckUtils]: 14: Hoare triple {217#(<= ~counter~0 0)} [84] L13-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {217#(<= ~counter~0 0)} is VALID [2022-04-28 01:09:43,243 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {217#(<= ~counter~0 0)} {217#(<= ~counter~0 0)} [103] assume_abort_if_notEXIT-->L30: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (not (= v_main_~x2~0_9 0)) 1 0)) InVars {main_~x2~0=v_main_~x2~0_9} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_2|} AuxVars[] AssignedVars[main_~x2~0, assume_abort_if_not_#in~cond] {217#(<= ~counter~0 0)} is VALID [2022-04-28 01:09:43,244 INFO L290 TraceCheckUtils]: 16: Hoare triple {217#(<= ~counter~0 0)} [79] L30-->L41-2: Formula: (and (= v_main_~y1~0_5 0) (= v_main_~y2~0_7 0) (= v_main_~x1~0_6 v_main_~y3~0_6)) InVars {main_~x1~0=v_main_~x1~0_6} OutVars{main_~x1~0=v_main_~x1~0_6, main_~y3~0=v_main_~y3~0_6, main_~y2~0=v_main_~y2~0_7, main_~y1~0=v_main_~y1~0_5} AuxVars[] AssignedVars[main_~y3~0, main_~y2~0, main_~y1~0] {217#(<= ~counter~0 0)} is VALID [2022-04-28 01:09:43,244 INFO L290 TraceCheckUtils]: 17: Hoare triple {217#(<= ~counter~0 0)} [83] L41-2-->L36-1: Formula: (and (= |v_main_#t~post6_1| v_~counter~0_2) (= v_~counter~0_1 (+ |v_main_#t~post6_1| 1))) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post6] {266#(<= |main_#t~post6| 0)} is VALID [2022-04-28 01:09:43,245 INFO L290 TraceCheckUtils]: 18: Hoare triple {266#(<= |main_#t~post6| 0)} [86] L36-1-->L36-3: Formula: (not (< |v_main_#t~post6_3| 10)) InVars {main_#t~post6=|v_main_#t~post6_3|} OutVars{} AuxVars[] AssignedVars[main_#t~post6] {210#false} is VALID [2022-04-28 01:09:43,245 INFO L272 TraceCheckUtils]: 19: Hoare triple {210#false} [85] L36-3-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (= (+ v_main_~y2~0_10 (* v_main_~y1~0_8 v_main_~x2~0_11)) v_main_~x1~0_10) 1 0)) InVars {main_~x2~0=v_main_~x2~0_11, main_~x1~0=v_main_~x1~0_10, main_~y2~0=v_main_~y2~0_10, main_~y1~0=v_main_~y1~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~y2~0, main_~y1~0, main_~x2~0, main_~x1~0] {210#false} is VALID [2022-04-28 01:09:43,245 INFO L290 TraceCheckUtils]: 20: Hoare triple {210#false} [89] __VERIFIER_assertENTRY-->L16: Formula: (= v___VERIFIER_assert_~cond_3 |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_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {210#false} is VALID [2022-04-28 01:09:43,246 INFO L290 TraceCheckUtils]: 21: Hoare triple {210#false} [92] L16-->L17: Formula: (= v___VERIFIER_assert_~cond_1 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[] {210#false} is VALID [2022-04-28 01:09:43,246 INFO L290 TraceCheckUtils]: 22: Hoare triple {210#false} [96] L17-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {210#false} is VALID [2022-04-28 01:09:43,246 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-28 01:09:43,246 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-28 01:09:43,246 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 01:09:43,247 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [190074793] [2022-04-28 01:09:43,247 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 01:09:43,247 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [291558820] [2022-04-28 01:09:43,247 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [291558820] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 01:09:43,247 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 01:09:43,247 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 01:09:43,248 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [231919215] [2022-04-28 01:09:43,248 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 01:09:43,249 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 3 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) Word has length 23 [2022-04-28 01:09:43,249 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 01:09:43,249 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 3 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-28 01:09:43,266 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 20 edges. 20 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 01:09:43,267 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-28 01:09:43,267 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-28 01:09:43,267 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-28 01:09:43,268 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-28 01:09:43,268 INFO L87 Difference]: Start difference. First operand 25 states and 29 transitions. Second operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 3 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-28 01:09:43,318 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 01:09:43,318 INFO L93 Difference]: Finished difference Result 34 states and 38 transitions. [2022-04-28 01:09:43,318 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-28 01:09:43,318 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 3 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) Word has length 23 [2022-04-28 01:09:43,319 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 01:09:43,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 3 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-28 01:09:43,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 38 transitions. [2022-04-28 01:09:43,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 3 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-28 01:09:43,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 38 transitions. [2022-04-28 01:09:43,323 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 38 transitions. [2022-04-28 01:09:43,352 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 38 edges. 38 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 01:09:43,354 INFO L225 Difference]: With dead ends: 34 [2022-04-28 01:09:43,354 INFO L226 Difference]: Without dead ends: 27 [2022-04-28 01:09:43,354 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-28 01:09:43,355 INFO L413 NwaCegarLoop]: 27 mSDtfsCounter, 0 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 67 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 01:09:43,356 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 67 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 01:09:43,356 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2022-04-28 01:09:43,363 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2022-04-28 01:09:43,363 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 01:09:43,363 INFO L82 GeneralOperation]: Start isEquivalent. First operand 27 states. Second operand has 27 states, 17 states have (on average 1.2352941176470589) internal successors, (21), 18 states have internal predecessors, (21), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-28 01:09:43,364 INFO L74 IsIncluded]: Start isIncluded. First operand 27 states. Second operand has 27 states, 17 states have (on average 1.2352941176470589) internal successors, (21), 18 states have internal predecessors, (21), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-28 01:09:43,364 INFO L87 Difference]: Start difference. First operand 27 states. Second operand has 27 states, 17 states have (on average 1.2352941176470589) internal successors, (21), 18 states have internal predecessors, (21), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-28 01:09:43,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 01:09:43,366 INFO L93 Difference]: Finished difference Result 27 states and 31 transitions. [2022-04-28 01:09:43,366 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 31 transitions. [2022-04-28 01:09:43,367 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 01:09:43,367 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 01:09:43,367 INFO L74 IsIncluded]: Start isIncluded. First operand has 27 states, 17 states have (on average 1.2352941176470589) internal successors, (21), 18 states have internal predecessors, (21), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand 27 states. [2022-04-28 01:09:43,368 INFO L87 Difference]: Start difference. First operand has 27 states, 17 states have (on average 1.2352941176470589) internal successors, (21), 18 states have internal predecessors, (21), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand 27 states. [2022-04-28 01:09:43,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 01:09:43,370 INFO L93 Difference]: Finished difference Result 27 states and 31 transitions. [2022-04-28 01:09:43,370 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 31 transitions. [2022-04-28 01:09:43,370 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 01:09:43,370 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 01:09:43,370 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 01:09:43,370 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 01:09:43,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 17 states have (on average 1.2352941176470589) internal successors, (21), 18 states have internal predecessors, (21), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-28 01:09:43,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 31 transitions. [2022-04-28 01:09:43,372 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 31 transitions. Word has length 23 [2022-04-28 01:09:43,373 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 01:09:43,373 INFO L495 AbstractCegarLoop]: Abstraction has 27 states and 31 transitions. [2022-04-28 01:09:43,373 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 3 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-28 01:09:43,373 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 31 transitions. [2022-04-28 01:09:43,373 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-04-28 01:09:43,374 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 01:09:43,374 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 01:09:43,402 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-04-28 01:09:43,599 WARN L477 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-28 01:09:43,600 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 01:09:43,600 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 01:09:43,600 INFO L85 PathProgramCache]: Analyzing trace with hash -1667953868, now seen corresponding path program 1 times [2022-04-28 01:09:43,601 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 01:09:43,601 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1186674154] [2022-04-28 01:09:43,601 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 01:09:43,601 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 01:09:43,620 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 01:09:43,621 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [131939386] [2022-04-28 01:09:43,621 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 01:09:43,621 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 01:09:43,621 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 01:09:43,626 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 01:09:43,650 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-04-28 01:09:43,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 01:09:43,671 INFO L263 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 14 conjunts are in the unsatisfiable core [2022-04-28 01:09:43,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 01:09:43,685 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 01:09:43,919 INFO L272 TraceCheckUtils]: 0: Hoare triple {422#true} [70] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {422#true} is VALID [2022-04-28 01:09:43,920 INFO L290 TraceCheckUtils]: 1: Hoare triple {422#true} [72] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= v_~counter~0_3 0) (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (= (select |v_#length_1| 2) 11) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (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{~counter~0=v_~counter~0_3, #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[~counter~0, #NULL.offset, #NULL.base] {422#true} is VALID [2022-04-28 01:09:43,920 INFO L290 TraceCheckUtils]: 2: Hoare triple {422#true} [75] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {422#true} is VALID [2022-04-28 01:09:43,920 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {422#true} {422#true} [101] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {422#true} is VALID [2022-04-28 01:09:43,920 INFO L272 TraceCheckUtils]: 4: Hoare triple {422#true} [71] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {422#true} is VALID [2022-04-28 01:09:43,921 INFO L290 TraceCheckUtils]: 5: Hoare triple {422#true} [74] mainENTRY-->L29: Formula: (and (<= |v_main_#t~nondet5_2| 2147483647) (= v_main_~x1~0_2 |v_main_#t~nondet4_2|) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= |v_main_#t~nondet4_2| 2147483647) (= v_main_~x2~0_4 |v_main_#t~nondet5_2|) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648))) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|, main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~x2~0=v_main_~x2~0_4, main_~x1~0=v_main_~x1~0_2, main_~y3~0=v_main_~y3~0_5, main_~y2~0=v_main_~y2~0_6, main_~y1~0=v_main_~y1~0_4} AuxVars[] AssignedVars[main_#t~nondet5, main_#t~nondet4, main_~y3~0, main_~y2~0, main_~y1~0, main_~x2~0, main_~x1~0] {422#true} is VALID [2022-04-28 01:09:43,921 INFO L272 TraceCheckUtils]: 6: Hoare triple {422#true} [76] L29-->assume_abort_if_notENTRY: Formula: (= (ite (<= 0 v_main_~x1~0_8) 1 0) |v_assume_abort_if_not_#in~condInParam_1|) InVars {main_~x1~0=v_main_~x1~0_8} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~x1~0, assume_abort_if_not_#in~cond] {422#true} is VALID [2022-04-28 01:09:43,921 INFO L290 TraceCheckUtils]: 7: Hoare triple {422#true} [78] assume_abort_if_notENTRY-->L13: 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] {422#true} is VALID [2022-04-28 01:09:43,922 INFO L290 TraceCheckUtils]: 8: Hoare triple {422#true} [81] L13-->L13-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[] {422#true} is VALID [2022-04-28 01:09:43,922 INFO L290 TraceCheckUtils]: 9: Hoare triple {422#true} [84] L13-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {422#true} is VALID [2022-04-28 01:09:43,922 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {422#true} {422#true} [102] assume_abort_if_notEXIT-->L29-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (<= 0 v_main_~x1~0_8) 1 0) |v_assume_abort_if_not_#in~condInParam_1|) InVars {main_~x1~0=v_main_~x1~0_8} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~x1~0, assume_abort_if_not_#in~cond] {422#true} is VALID [2022-04-28 01:09:43,922 INFO L272 TraceCheckUtils]: 11: Hoare triple {422#true} [77] L29-1-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (not (= v_main_~x2~0_9 0)) 1 0)) InVars {main_~x2~0=v_main_~x2~0_9} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_2|} AuxVars[] AssignedVars[main_~x2~0, assume_abort_if_not_#in~cond] {422#true} is VALID [2022-04-28 01:09:43,923 INFO L290 TraceCheckUtils]: 12: Hoare triple {422#true} [78] assume_abort_if_notENTRY-->L13: 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] {463#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-04-28 01:09:43,923 INFO L290 TraceCheckUtils]: 13: Hoare triple {463#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} [81] L13-->L13-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[] {467#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-28 01:09:43,924 INFO L290 TraceCheckUtils]: 14: Hoare triple {467#(not (= |assume_abort_if_not_#in~cond| 0))} [84] L13-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {467#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-28 01:09:43,925 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {467#(not (= |assume_abort_if_not_#in~cond| 0))} {422#true} [103] assume_abort_if_notEXIT-->L30: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (not (= v_main_~x2~0_9 0)) 1 0)) InVars {main_~x2~0=v_main_~x2~0_9} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_2|} AuxVars[] AssignedVars[main_~x2~0, assume_abort_if_not_#in~cond] {474#(not (= main_~x2~0 0))} is VALID [2022-04-28 01:09:43,926 INFO L290 TraceCheckUtils]: 16: Hoare triple {474#(not (= main_~x2~0 0))} [79] L30-->L41-2: Formula: (and (= v_main_~y1~0_5 0) (= v_main_~y2~0_7 0) (= v_main_~x1~0_6 v_main_~y3~0_6)) InVars {main_~x1~0=v_main_~x1~0_6} OutVars{main_~x1~0=v_main_~x1~0_6, main_~y3~0=v_main_~y3~0_6, main_~y2~0=v_main_~y2~0_7, main_~y1~0=v_main_~y1~0_5} AuxVars[] AssignedVars[main_~y3~0, main_~y2~0, main_~y1~0] {478#(and (= main_~y2~0 0) (= main_~y1~0 0) (not (= main_~x2~0 0)) (= main_~x1~0 main_~y3~0))} is VALID [2022-04-28 01:09:43,935 INFO L290 TraceCheckUtils]: 17: Hoare triple {478#(and (= main_~y2~0 0) (= main_~y1~0 0) (not (= main_~x2~0 0)) (= main_~x1~0 main_~y3~0))} [83] L41-2-->L36-1: Formula: (and (= |v_main_#t~post6_1| v_~counter~0_2) (= v_~counter~0_1 (+ |v_main_#t~post6_1| 1))) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post6] {478#(and (= main_~y2~0 0) (= main_~y1~0 0) (not (= main_~x2~0 0)) (= main_~x1~0 main_~y3~0))} is VALID [2022-04-28 01:09:43,935 INFO L290 TraceCheckUtils]: 18: Hoare triple {478#(and (= main_~y2~0 0) (= main_~y1~0 0) (not (= main_~x2~0 0)) (= main_~x1~0 main_~y3~0))} [87] L36-1-->L37: Formula: (< |v_main_#t~post6_5| 10) InVars {main_#t~post6=|v_main_#t~post6_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post6] {478#(and (= main_~y2~0 0) (= main_~y1~0 0) (not (= main_~x2~0 0)) (= main_~x1~0 main_~y3~0))} is VALID [2022-04-28 01:09:43,937 INFO L272 TraceCheckUtils]: 19: Hoare triple {478#(and (= main_~y2~0 0) (= main_~y1~0 0) (not (= main_~x2~0 0)) (= main_~x1~0 main_~y3~0))} [90] L37-->__VERIFIER_assertENTRY: Formula: (= (ite (= v_main_~x1~0_9 (+ (* v_main_~y1~0_7 v_main_~x2~0_10) v_main_~y2~0_9 v_main_~y3~0_10)) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~x2~0=v_main_~x2~0_10, main_~x1~0=v_main_~x1~0_9, main_~y3~0=v_main_~y3~0_10, main_~y2~0=v_main_~y2~0_9, main_~y1~0=v_main_~y1~0_7} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~y3~0, main_~y2~0, main_~y1~0, main_~x2~0, main_~x1~0] {488#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 01:09:43,938 INFO L290 TraceCheckUtils]: 20: Hoare triple {488#(<= 1 |__VERIFIER_assert_#in~cond|)} [89] __VERIFIER_assertENTRY-->L16: Formula: (= v___VERIFIER_assert_~cond_3 |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_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {492#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 01:09:43,938 INFO L290 TraceCheckUtils]: 21: Hoare triple {492#(<= 1 __VERIFIER_assert_~cond)} [92] L16-->L17: Formula: (= v___VERIFIER_assert_~cond_1 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[] {423#false} is VALID [2022-04-28 01:09:43,938 INFO L290 TraceCheckUtils]: 22: Hoare triple {423#false} [96] L17-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {423#false} is VALID [2022-04-28 01:09:43,939 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-28 01:09:43,939 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-28 01:09:43,939 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 01:09:43,941 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1186674154] [2022-04-28 01:09:43,941 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 01:09:43,941 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [131939386] [2022-04-28 01:09:43,941 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [131939386] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 01:09:43,942 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 01:09:43,942 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-28 01:09:43,942 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1377175673] [2022-04-28 01:09:43,942 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 01:09:43,942 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 1.875) internal successors, (15), 6 states have internal predecessors, (15), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 23 [2022-04-28 01:09:43,943 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 01:09:43,944 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 8 states, 8 states have (on average 1.875) internal successors, (15), 6 states have internal predecessors, (15), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-28 01:09:43,963 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-28 01:09:43,963 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-28 01:09:43,963 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-28 01:09:43,964 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-28 01:09:43,964 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-04-28 01:09:43,964 INFO L87 Difference]: Start difference. First operand 27 states and 31 transitions. Second operand has 8 states, 8 states have (on average 1.875) internal successors, (15), 6 states have internal predecessors, (15), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-28 01:09:44,197 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 01:09:44,197 INFO L93 Difference]: Finished difference Result 37 states and 43 transitions. [2022-04-28 01:09:44,197 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-28 01:09:44,197 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 1.875) internal successors, (15), 6 states have internal predecessors, (15), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 23 [2022-04-28 01:09:44,198 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 01:09:44,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 1.875) internal successors, (15), 6 states have internal predecessors, (15), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-28 01:09:44,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 43 transitions. [2022-04-28 01:09:44,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 1.875) internal successors, (15), 6 states have internal predecessors, (15), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-28 01:09:44,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 43 transitions. [2022-04-28 01:09:44,211 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 43 transitions. [2022-04-28 01:09:44,253 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 43 edges. 43 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 01:09:44,255 INFO L225 Difference]: With dead ends: 37 [2022-04-28 01:09:44,255 INFO L226 Difference]: Without dead ends: 35 [2022-04-28 01:09:44,255 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2022-04-28 01:09:44,256 INFO L413 NwaCegarLoop]: 20 mSDtfsCounter, 21 mSDsluCounter, 78 mSDsCounter, 0 mSdLazyCounter, 75 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 98 SdHoareTripleChecker+Invalid, 78 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 75 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 01:09:44,257 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 98 Invalid, 78 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 75 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 01:09:44,257 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2022-04-28 01:09:44,265 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 32. [2022-04-28 01:09:44,265 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 01:09:44,265 INFO L82 GeneralOperation]: Start isEquivalent. First operand 35 states. Second operand has 32 states, 20 states have (on average 1.2) internal successors, (24), 22 states have internal predecessors, (24), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (5), 4 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-28 01:09:44,265 INFO L74 IsIncluded]: Start isIncluded. First operand 35 states. Second operand has 32 states, 20 states have (on average 1.2) internal successors, (24), 22 states have internal predecessors, (24), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (5), 4 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-28 01:09:44,266 INFO L87 Difference]: Start difference. First operand 35 states. Second operand has 32 states, 20 states have (on average 1.2) internal successors, (24), 22 states have internal predecessors, (24), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (5), 4 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-28 01:09:44,268 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 01:09:44,268 INFO L93 Difference]: Finished difference Result 35 states and 41 transitions. [2022-04-28 01:09:44,269 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 41 transitions. [2022-04-28 01:09:44,269 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 01:09:44,269 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 01:09:44,269 INFO L74 IsIncluded]: Start isIncluded. First operand has 32 states, 20 states have (on average 1.2) internal successors, (24), 22 states have internal predecessors, (24), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (5), 4 states have call predecessors, (5), 5 states have call successors, (5) Second operand 35 states. [2022-04-28 01:09:44,270 INFO L87 Difference]: Start difference. First operand has 32 states, 20 states have (on average 1.2) internal successors, (24), 22 states have internal predecessors, (24), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (5), 4 states have call predecessors, (5), 5 states have call successors, (5) Second operand 35 states. [2022-04-28 01:09:44,272 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 01:09:44,272 INFO L93 Difference]: Finished difference Result 35 states and 41 transitions. [2022-04-28 01:09:44,272 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 41 transitions. [2022-04-28 01:09:44,272 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 01:09:44,272 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 01:09:44,272 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 01:09:44,272 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 01:09:44,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 20 states have (on average 1.2) internal successors, (24), 22 states have internal predecessors, (24), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (5), 4 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-28 01:09:44,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 36 transitions. [2022-04-28 01:09:44,274 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 36 transitions. Word has length 23 [2022-04-28 01:09:44,274 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 01:09:44,274 INFO L495 AbstractCegarLoop]: Abstraction has 32 states and 36 transitions. [2022-04-28 01:09:44,275 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 1.875) internal successors, (15), 6 states have internal predecessors, (15), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-28 01:09:44,275 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 36 transitions. [2022-04-28 01:09:44,275 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-04-28 01:09:44,276 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 01:09:44,276 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 01:09:44,298 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-04-28 01:09:44,476 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2022-04-28 01:09:44,477 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 01:09:44,477 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 01:09:44,477 INFO L85 PathProgramCache]: Analyzing trace with hash 1179905874, now seen corresponding path program 1 times [2022-04-28 01:09:44,477 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 01:09:44,477 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [395072311] [2022-04-28 01:09:44,478 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 01:09:44,478 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 01:09:44,506 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 01:09:44,507 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [675380543] [2022-04-28 01:09:44,507 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 01:09:44,507 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 01:09:44,507 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 01:09:44,508 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 01:09:44,512 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-04-28 01:09:44,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 01:09:44,549 INFO L263 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 10 conjunts are in the unsatisfiable core [2022-04-28 01:09:44,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 01:09:44,566 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 01:09:44,736 INFO L272 TraceCheckUtils]: 0: Hoare triple {670#true} [70] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {670#true} is VALID [2022-04-28 01:09:44,737 INFO L290 TraceCheckUtils]: 1: Hoare triple {670#true} [72] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= v_~counter~0_3 0) (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (= (select |v_#length_1| 2) 11) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (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{~counter~0=v_~counter~0_3, #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[~counter~0, #NULL.offset, #NULL.base] {670#true} is VALID [2022-04-28 01:09:44,737 INFO L290 TraceCheckUtils]: 2: Hoare triple {670#true} [75] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {670#true} is VALID [2022-04-28 01:09:44,737 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {670#true} {670#true} [101] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {670#true} is VALID [2022-04-28 01:09:44,738 INFO L272 TraceCheckUtils]: 4: Hoare triple {670#true} [71] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {670#true} is VALID [2022-04-28 01:09:44,738 INFO L290 TraceCheckUtils]: 5: Hoare triple {670#true} [74] mainENTRY-->L29: Formula: (and (<= |v_main_#t~nondet5_2| 2147483647) (= v_main_~x1~0_2 |v_main_#t~nondet4_2|) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= |v_main_#t~nondet4_2| 2147483647) (= v_main_~x2~0_4 |v_main_#t~nondet5_2|) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648))) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|, main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~x2~0=v_main_~x2~0_4, main_~x1~0=v_main_~x1~0_2, main_~y3~0=v_main_~y3~0_5, main_~y2~0=v_main_~y2~0_6, main_~y1~0=v_main_~y1~0_4} AuxVars[] AssignedVars[main_#t~nondet5, main_#t~nondet4, main_~y3~0, main_~y2~0, main_~y1~0, main_~x2~0, main_~x1~0] {670#true} is VALID [2022-04-28 01:09:44,738 INFO L272 TraceCheckUtils]: 6: Hoare triple {670#true} [76] L29-->assume_abort_if_notENTRY: Formula: (= (ite (<= 0 v_main_~x1~0_8) 1 0) |v_assume_abort_if_not_#in~condInParam_1|) InVars {main_~x1~0=v_main_~x1~0_8} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~x1~0, assume_abort_if_not_#in~cond] {670#true} is VALID [2022-04-28 01:09:44,738 INFO L290 TraceCheckUtils]: 7: Hoare triple {670#true} [78] assume_abort_if_notENTRY-->L13: 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] {670#true} is VALID [2022-04-28 01:09:44,738 INFO L290 TraceCheckUtils]: 8: Hoare triple {670#true} [81] L13-->L13-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[] {670#true} is VALID [2022-04-28 01:09:44,739 INFO L290 TraceCheckUtils]: 9: Hoare triple {670#true} [84] L13-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {670#true} is VALID [2022-04-28 01:09:44,739 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {670#true} {670#true} [102] assume_abort_if_notEXIT-->L29-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (<= 0 v_main_~x1~0_8) 1 0) |v_assume_abort_if_not_#in~condInParam_1|) InVars {main_~x1~0=v_main_~x1~0_8} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~x1~0, assume_abort_if_not_#in~cond] {670#true} is VALID [2022-04-28 01:09:44,739 INFO L272 TraceCheckUtils]: 11: Hoare triple {670#true} [77] L29-1-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (not (= v_main_~x2~0_9 0)) 1 0)) InVars {main_~x2~0=v_main_~x2~0_9} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_2|} AuxVars[] AssignedVars[main_~x2~0, assume_abort_if_not_#in~cond] {670#true} is VALID [2022-04-28 01:09:44,739 INFO L290 TraceCheckUtils]: 12: Hoare triple {670#true} [78] assume_abort_if_notENTRY-->L13: 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] {670#true} is VALID [2022-04-28 01:09:44,739 INFO L290 TraceCheckUtils]: 13: Hoare triple {670#true} [81] L13-->L13-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[] {670#true} is VALID [2022-04-28 01:09:44,740 INFO L290 TraceCheckUtils]: 14: Hoare triple {670#true} [84] L13-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {670#true} is VALID [2022-04-28 01:09:44,740 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {670#true} {670#true} [103] assume_abort_if_notEXIT-->L30: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (not (= v_main_~x2~0_9 0)) 1 0)) InVars {main_~x2~0=v_main_~x2~0_9} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_2|} AuxVars[] AssignedVars[main_~x2~0, assume_abort_if_not_#in~cond] {670#true} is VALID [2022-04-28 01:09:44,740 INFO L290 TraceCheckUtils]: 16: Hoare triple {670#true} [79] L30-->L41-2: Formula: (and (= v_main_~y1~0_5 0) (= v_main_~y2~0_7 0) (= v_main_~x1~0_6 v_main_~y3~0_6)) InVars {main_~x1~0=v_main_~x1~0_6} OutVars{main_~x1~0=v_main_~x1~0_6, main_~y3~0=v_main_~y3~0_6, main_~y2~0=v_main_~y2~0_7, main_~y1~0=v_main_~y1~0_5} AuxVars[] AssignedVars[main_~y3~0, main_~y2~0, main_~y1~0] {670#true} is VALID [2022-04-28 01:09:44,740 INFO L290 TraceCheckUtils]: 17: Hoare triple {670#true} [83] L41-2-->L36-1: Formula: (and (= |v_main_#t~post6_1| v_~counter~0_2) (= v_~counter~0_1 (+ |v_main_#t~post6_1| 1))) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post6] {670#true} is VALID [2022-04-28 01:09:44,741 INFO L290 TraceCheckUtils]: 18: Hoare triple {670#true} [87] L36-1-->L37: Formula: (< |v_main_#t~post6_5| 10) InVars {main_#t~post6=|v_main_#t~post6_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post6] {670#true} is VALID [2022-04-28 01:09:44,741 INFO L272 TraceCheckUtils]: 19: Hoare triple {670#true} [90] L37-->__VERIFIER_assertENTRY: Formula: (= (ite (= v_main_~x1~0_9 (+ (* v_main_~y1~0_7 v_main_~x2~0_10) v_main_~y2~0_9 v_main_~y3~0_10)) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~x2~0=v_main_~x2~0_10, main_~x1~0=v_main_~x1~0_9, main_~y3~0=v_main_~y3~0_10, main_~y2~0=v_main_~y2~0_9, main_~y1~0=v_main_~y1~0_7} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~y3~0, main_~y2~0, main_~y1~0, main_~x2~0, main_~x1~0] {670#true} is VALID [2022-04-28 01:09:44,741 INFO L290 TraceCheckUtils]: 20: Hoare triple {670#true} [89] __VERIFIER_assertENTRY-->L16: Formula: (= v___VERIFIER_assert_~cond_3 |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_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {735#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-28 01:09:44,742 INFO L290 TraceCheckUtils]: 21: Hoare triple {735#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} [93] L16-->L16-2: Formula: (not (= v___VERIFIER_assert_~cond_2 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {739#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 01:09:44,742 INFO L290 TraceCheckUtils]: 22: Hoare triple {739#(not (= |__VERIFIER_assert_#in~cond| 0))} [98] L16-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {739#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 01:09:44,743 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {739#(not (= |__VERIFIER_assert_#in~cond| 0))} {670#true} [105] __VERIFIER_assertEXIT-->L37-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= v_main_~x1~0_9 (+ (* v_main_~y1~0_7 v_main_~x2~0_10) v_main_~y2~0_9 v_main_~y3~0_10)) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~x2~0=v_main_~x2~0_10, main_~x1~0=v_main_~x1~0_9, main_~y3~0=v_main_~y3~0_10, main_~y2~0=v_main_~y2~0_9, main_~y1~0=v_main_~y1~0_7} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~y3~0, main_~y2~0, main_~y1~0, main_~x2~0, main_~x1~0] {746#(= (+ (* main_~x2~0 main_~y1~0) main_~y3~0 main_~y2~0) main_~x1~0)} is VALID [2022-04-28 01:09:44,745 INFO L290 TraceCheckUtils]: 24: Hoare triple {746#(= (+ (* main_~x2~0 main_~y1~0) main_~y3~0 main_~y2~0) main_~x1~0)} [94] L37-1-->L36-3: Formula: (= v_main_~y3~0_8 0) InVars {main_~y3~0=v_main_~y3~0_8} OutVars{main_~y3~0=v_main_~y3~0_8} AuxVars[] AssignedVars[] {750#(= (+ (* main_~x2~0 main_~y1~0) main_~y2~0) main_~x1~0)} is VALID [2022-04-28 01:09:44,747 INFO L272 TraceCheckUtils]: 25: Hoare triple {750#(= (+ (* main_~x2~0 main_~y1~0) main_~y2~0) main_~x1~0)} [85] L36-3-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (= (+ v_main_~y2~0_10 (* v_main_~y1~0_8 v_main_~x2~0_11)) v_main_~x1~0_10) 1 0)) InVars {main_~x2~0=v_main_~x2~0_11, main_~x1~0=v_main_~x1~0_10, main_~y2~0=v_main_~y2~0_10, main_~y1~0=v_main_~y1~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~y2~0, main_~y1~0, main_~x2~0, main_~x1~0] {754#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 01:09:44,748 INFO L290 TraceCheckUtils]: 26: Hoare triple {754#(<= 1 |__VERIFIER_assert_#in~cond|)} [89] __VERIFIER_assertENTRY-->L16: Formula: (= v___VERIFIER_assert_~cond_3 |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_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {758#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 01:09:44,748 INFO L290 TraceCheckUtils]: 27: Hoare triple {758#(<= 1 __VERIFIER_assert_~cond)} [92] L16-->L17: Formula: (= v___VERIFIER_assert_~cond_1 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[] {671#false} is VALID [2022-04-28 01:09:44,748 INFO L290 TraceCheckUtils]: 28: Hoare triple {671#false} [96] L17-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {671#false} is VALID [2022-04-28 01:09:44,749 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-28 01:09:44,749 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 01:09:49,839 INFO L290 TraceCheckUtils]: 28: Hoare triple {671#false} [96] L17-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {671#false} is VALID [2022-04-28 01:09:49,845 INFO L290 TraceCheckUtils]: 27: Hoare triple {758#(<= 1 __VERIFIER_assert_~cond)} [92] L16-->L17: Formula: (= v___VERIFIER_assert_~cond_1 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[] {671#false} is VALID [2022-04-28 01:09:49,846 INFO L290 TraceCheckUtils]: 26: Hoare triple {754#(<= 1 |__VERIFIER_assert_#in~cond|)} [89] __VERIFIER_assertENTRY-->L16: Formula: (= v___VERIFIER_assert_~cond_3 |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_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {758#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 01:09:49,847 INFO L272 TraceCheckUtils]: 25: Hoare triple {750#(= (+ (* main_~x2~0 main_~y1~0) main_~y2~0) main_~x1~0)} [85] L36-3-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (= (+ v_main_~y2~0_10 (* v_main_~y1~0_8 v_main_~x2~0_11)) v_main_~x1~0_10) 1 0)) InVars {main_~x2~0=v_main_~x2~0_11, main_~x1~0=v_main_~x1~0_10, main_~y2~0=v_main_~y2~0_10, main_~y1~0=v_main_~y1~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~y2~0, main_~y1~0, main_~x2~0, main_~x1~0] {754#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 01:09:49,847 INFO L290 TraceCheckUtils]: 24: Hoare triple {777#(or (not (= main_~y3~0 0)) (= (+ (* main_~x2~0 main_~y1~0) main_~y2~0) main_~x1~0))} [94] L37-1-->L36-3: Formula: (= v_main_~y3~0_8 0) InVars {main_~y3~0=v_main_~y3~0_8} OutVars{main_~y3~0=v_main_~y3~0_8} AuxVars[] AssignedVars[] {750#(= (+ (* main_~x2~0 main_~y1~0) main_~y2~0) main_~x1~0)} is VALID [2022-04-28 01:09:49,856 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {739#(not (= |__VERIFIER_assert_#in~cond| 0))} {670#true} [105] __VERIFIER_assertEXIT-->L37-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= v_main_~x1~0_9 (+ (* v_main_~y1~0_7 v_main_~x2~0_10) v_main_~y2~0_9 v_main_~y3~0_10)) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~x2~0=v_main_~x2~0_10, main_~x1~0=v_main_~x1~0_9, main_~y3~0=v_main_~y3~0_10, main_~y2~0=v_main_~y2~0_9, main_~y1~0=v_main_~y1~0_7} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~y3~0, main_~y2~0, main_~y1~0, main_~x2~0, main_~x1~0] {777#(or (not (= main_~y3~0 0)) (= (+ (* main_~x2~0 main_~y1~0) main_~y2~0) main_~x1~0))} is VALID [2022-04-28 01:09:49,856 INFO L290 TraceCheckUtils]: 22: Hoare triple {739#(not (= |__VERIFIER_assert_#in~cond| 0))} [98] L16-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {739#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 01:09:49,857 INFO L290 TraceCheckUtils]: 21: Hoare triple {790#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} [93] L16-->L16-2: Formula: (not (= v___VERIFIER_assert_~cond_2 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {739#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 01:09:49,859 INFO L290 TraceCheckUtils]: 20: Hoare triple {670#true} [89] __VERIFIER_assertENTRY-->L16: Formula: (= v___VERIFIER_assert_~cond_3 |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_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {790#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-28 01:09:49,859 INFO L272 TraceCheckUtils]: 19: Hoare triple {670#true} [90] L37-->__VERIFIER_assertENTRY: Formula: (= (ite (= v_main_~x1~0_9 (+ (* v_main_~y1~0_7 v_main_~x2~0_10) v_main_~y2~0_9 v_main_~y3~0_10)) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~x2~0=v_main_~x2~0_10, main_~x1~0=v_main_~x1~0_9, main_~y3~0=v_main_~y3~0_10, main_~y2~0=v_main_~y2~0_9, main_~y1~0=v_main_~y1~0_7} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~y3~0, main_~y2~0, main_~y1~0, main_~x2~0, main_~x1~0] {670#true} is VALID [2022-04-28 01:09:49,859 INFO L290 TraceCheckUtils]: 18: Hoare triple {670#true} [87] L36-1-->L37: Formula: (< |v_main_#t~post6_5| 10) InVars {main_#t~post6=|v_main_#t~post6_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post6] {670#true} is VALID [2022-04-28 01:09:49,859 INFO L290 TraceCheckUtils]: 17: Hoare triple {670#true} [83] L41-2-->L36-1: Formula: (and (= |v_main_#t~post6_1| v_~counter~0_2) (= v_~counter~0_1 (+ |v_main_#t~post6_1| 1))) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post6] {670#true} is VALID [2022-04-28 01:09:49,859 INFO L290 TraceCheckUtils]: 16: Hoare triple {670#true} [79] L30-->L41-2: Formula: (and (= v_main_~y1~0_5 0) (= v_main_~y2~0_7 0) (= v_main_~x1~0_6 v_main_~y3~0_6)) InVars {main_~x1~0=v_main_~x1~0_6} OutVars{main_~x1~0=v_main_~x1~0_6, main_~y3~0=v_main_~y3~0_6, main_~y2~0=v_main_~y2~0_7, main_~y1~0=v_main_~y1~0_5} AuxVars[] AssignedVars[main_~y3~0, main_~y2~0, main_~y1~0] {670#true} is VALID [2022-04-28 01:09:49,860 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {670#true} {670#true} [103] assume_abort_if_notEXIT-->L30: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (not (= v_main_~x2~0_9 0)) 1 0)) InVars {main_~x2~0=v_main_~x2~0_9} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_2|} AuxVars[] AssignedVars[main_~x2~0, assume_abort_if_not_#in~cond] {670#true} is VALID [2022-04-28 01:09:49,860 INFO L290 TraceCheckUtils]: 14: Hoare triple {670#true} [84] L13-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {670#true} is VALID [2022-04-28 01:09:49,860 INFO L290 TraceCheckUtils]: 13: Hoare triple {670#true} [81] L13-->L13-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[] {670#true} is VALID [2022-04-28 01:09:49,860 INFO L290 TraceCheckUtils]: 12: Hoare triple {670#true} [78] assume_abort_if_notENTRY-->L13: 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] {670#true} is VALID [2022-04-28 01:09:49,860 INFO L272 TraceCheckUtils]: 11: Hoare triple {670#true} [77] L29-1-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (not (= v_main_~x2~0_9 0)) 1 0)) InVars {main_~x2~0=v_main_~x2~0_9} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_2|} AuxVars[] AssignedVars[main_~x2~0, assume_abort_if_not_#in~cond] {670#true} is VALID [2022-04-28 01:09:49,860 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {670#true} {670#true} [102] assume_abort_if_notEXIT-->L29-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (<= 0 v_main_~x1~0_8) 1 0) |v_assume_abort_if_not_#in~condInParam_1|) InVars {main_~x1~0=v_main_~x1~0_8} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~x1~0, assume_abort_if_not_#in~cond] {670#true} is VALID [2022-04-28 01:09:49,861 INFO L290 TraceCheckUtils]: 9: Hoare triple {670#true} [84] L13-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {670#true} is VALID [2022-04-28 01:09:49,861 INFO L290 TraceCheckUtils]: 8: Hoare triple {670#true} [81] L13-->L13-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[] {670#true} is VALID [2022-04-28 01:09:49,861 INFO L290 TraceCheckUtils]: 7: Hoare triple {670#true} [78] assume_abort_if_notENTRY-->L13: 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] {670#true} is VALID [2022-04-28 01:09:49,861 INFO L272 TraceCheckUtils]: 6: Hoare triple {670#true} [76] L29-->assume_abort_if_notENTRY: Formula: (= (ite (<= 0 v_main_~x1~0_8) 1 0) |v_assume_abort_if_not_#in~condInParam_1|) InVars {main_~x1~0=v_main_~x1~0_8} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~x1~0, assume_abort_if_not_#in~cond] {670#true} is VALID [2022-04-28 01:09:49,861 INFO L290 TraceCheckUtils]: 5: Hoare triple {670#true} [74] mainENTRY-->L29: Formula: (and (<= |v_main_#t~nondet5_2| 2147483647) (= v_main_~x1~0_2 |v_main_#t~nondet4_2|) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= |v_main_#t~nondet4_2| 2147483647) (= v_main_~x2~0_4 |v_main_#t~nondet5_2|) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648))) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|, main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~x2~0=v_main_~x2~0_4, main_~x1~0=v_main_~x1~0_2, main_~y3~0=v_main_~y3~0_5, main_~y2~0=v_main_~y2~0_6, main_~y1~0=v_main_~y1~0_4} AuxVars[] AssignedVars[main_#t~nondet5, main_#t~nondet4, main_~y3~0, main_~y2~0, main_~y1~0, main_~x2~0, main_~x1~0] {670#true} is VALID [2022-04-28 01:09:49,862 INFO L272 TraceCheckUtils]: 4: Hoare triple {670#true} [71] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {670#true} is VALID [2022-04-28 01:09:49,862 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {670#true} {670#true} [101] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {670#true} is VALID [2022-04-28 01:09:49,862 INFO L290 TraceCheckUtils]: 2: Hoare triple {670#true} [75] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {670#true} is VALID [2022-04-28 01:09:49,862 INFO L290 TraceCheckUtils]: 1: Hoare triple {670#true} [72] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= v_~counter~0_3 0) (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (= (select |v_#length_1| 2) 11) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (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{~counter~0=v_~counter~0_3, #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[~counter~0, #NULL.offset, #NULL.base] {670#true} is VALID [2022-04-28 01:09:49,862 INFO L272 TraceCheckUtils]: 0: Hoare triple {670#true} [70] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {670#true} is VALID [2022-04-28 01:09:49,862 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-28 01:09:49,862 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 01:09:49,863 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [395072311] [2022-04-28 01:09:49,863 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 01:09:49,863 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [675380543] [2022-04-28 01:09:49,863 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [675380543] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 01:09:49,863 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 01:09:49,863 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 10 [2022-04-28 01:09:49,863 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [66458341] [2022-04-28 01:09:49,863 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-28 01:09:49,864 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 2.111111111111111) internal successors, (19), 7 states have internal predecessors, (19), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 3 states have call predecessors, (5), 1 states have call successors, (5) Word has length 29 [2022-04-28 01:09:49,864 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 01:09:49,864 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 10 states, 9 states have (on average 2.111111111111111) internal successors, (19), 7 states have internal predecessors, (19), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 3 states have call predecessors, (5), 1 states have call successors, (5) [2022-04-28 01:09:49,895 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 30 edges. 30 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 01:09:49,895 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-04-28 01:09:49,895 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-28 01:09:49,895 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-04-28 01:09:49,895 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2022-04-28 01:09:49,896 INFO L87 Difference]: Start difference. First operand 32 states and 36 transitions. Second operand has 10 states, 9 states have (on average 2.111111111111111) internal successors, (19), 7 states have internal predecessors, (19), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 3 states have call predecessors, (5), 1 states have call successors, (5) [2022-04-28 01:09:50,131 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 01:09:50,131 INFO L93 Difference]: Finished difference Result 39 states and 42 transitions. [2022-04-28 01:09:50,132 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-28 01:09:50,132 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 2.111111111111111) internal successors, (19), 7 states have internal predecessors, (19), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 3 states have call predecessors, (5), 1 states have call successors, (5) Word has length 29 [2022-04-28 01:09:50,132 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 01:09:50,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 9 states have (on average 2.111111111111111) internal successors, (19), 7 states have internal predecessors, (19), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 3 states have call predecessors, (5), 1 states have call successors, (5) [2022-04-28 01:09:50,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 35 transitions. [2022-04-28 01:09:50,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 9 states have (on average 2.111111111111111) internal successors, (19), 7 states have internal predecessors, (19), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 3 states have call predecessors, (5), 1 states have call successors, (5) [2022-04-28 01:09:50,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 35 transitions. [2022-04-28 01:09:50,135 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 35 transitions. [2022-04-28 01:09:50,166 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 35 edges. 35 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 01:09:50,168 INFO L225 Difference]: With dead ends: 39 [2022-04-28 01:09:50,168 INFO L226 Difference]: Without dead ends: 34 [2022-04-28 01:09:50,168 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 48 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=115, Unknown=0, NotChecked=0, Total=156 [2022-04-28 01:09:50,169 INFO L413 NwaCegarLoop]: 21 mSDtfsCounter, 17 mSDsluCounter, 99 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 120 SdHoareTripleChecker+Invalid, 67 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 61 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 01:09:50,170 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 120 Invalid, 67 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 01:09:50,170 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2022-04-28 01:09:50,177 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 29. [2022-04-28 01:09:50,177 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 01:09:50,177 INFO L82 GeneralOperation]: Start isEquivalent. First operand 34 states. Second operand has 29 states, 19 states have (on average 1.105263157894737) internal successors, (21), 19 states have internal predecessors, (21), 6 states have call successors, (6), 5 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-28 01:09:50,178 INFO L74 IsIncluded]: Start isIncluded. First operand 34 states. Second operand has 29 states, 19 states have (on average 1.105263157894737) internal successors, (21), 19 states have internal predecessors, (21), 6 states have call successors, (6), 5 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-28 01:09:50,178 INFO L87 Difference]: Start difference. First operand 34 states. Second operand has 29 states, 19 states have (on average 1.105263157894737) internal successors, (21), 19 states have internal predecessors, (21), 6 states have call successors, (6), 5 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-28 01:09:50,179 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 01:09:50,179 INFO L93 Difference]: Finished difference Result 34 states and 36 transitions. [2022-04-28 01:09:50,179 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 36 transitions. [2022-04-28 01:09:50,180 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 01:09:50,180 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 01:09:50,180 INFO L74 IsIncluded]: Start isIncluded. First operand has 29 states, 19 states have (on average 1.105263157894737) internal successors, (21), 19 states have internal predecessors, (21), 6 states have call successors, (6), 5 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand 34 states. [2022-04-28 01:09:50,180 INFO L87 Difference]: Start difference. First operand has 29 states, 19 states have (on average 1.105263157894737) internal successors, (21), 19 states have internal predecessors, (21), 6 states have call successors, (6), 5 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand 34 states. [2022-04-28 01:09:50,182 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 01:09:50,182 INFO L93 Difference]: Finished difference Result 34 states and 36 transitions. [2022-04-28 01:09:50,182 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 36 transitions. [2022-04-28 01:09:50,183 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 01:09:50,183 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 01:09:50,183 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 01:09:50,183 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 01:09:50,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 19 states have (on average 1.105263157894737) internal successors, (21), 19 states have internal predecessors, (21), 6 states have call successors, (6), 5 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-28 01:09:50,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 31 transitions. [2022-04-28 01:09:50,184 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 31 transitions. Word has length 29 [2022-04-28 01:09:50,184 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 01:09:50,185 INFO L495 AbstractCegarLoop]: Abstraction has 29 states and 31 transitions. [2022-04-28 01:09:50,185 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 2.111111111111111) internal successors, (19), 7 states have internal predecessors, (19), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 3 states have call predecessors, (5), 1 states have call successors, (5) [2022-04-28 01:09:50,185 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 31 transitions. [2022-04-28 01:09:50,186 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-04-28 01:09:50,186 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 01:09:50,186 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 01:09:50,205 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-04-28 01:09:50,399 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 01:09:50,400 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 01:09:50,400 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 01:09:50,400 INFO L85 PathProgramCache]: Analyzing trace with hash 1668946595, now seen corresponding path program 1 times [2022-04-28 01:09:50,400 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 01:09:50,400 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [889627042] [2022-04-28 01:09:50,400 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 01:09:50,400 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 01:09:50,416 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 01:09:50,416 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [120540499] [2022-04-28 01:09:50,416 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 01:09:50,416 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 01:09:50,416 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 01:09:50,419 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 01:09:50,423 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-04-28 01:09:50,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 01:09:50,469 INFO L263 TraceCheckSpWp]: Trace formula consists of 116 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-28 01:09:50,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 01:09:50,480 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 01:09:50,637 INFO L272 TraceCheckUtils]: 0: Hoare triple {1024#true} [70] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1024#true} is VALID [2022-04-28 01:09:50,637 INFO L290 TraceCheckUtils]: 1: Hoare triple {1024#true} [72] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= v_~counter~0_3 0) (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (= (select |v_#length_1| 2) 11) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (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{~counter~0=v_~counter~0_3, #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[~counter~0, #NULL.offset, #NULL.base] {1032#(<= ~counter~0 0)} is VALID [2022-04-28 01:09:50,638 INFO L290 TraceCheckUtils]: 2: Hoare triple {1032#(<= ~counter~0 0)} [75] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1032#(<= ~counter~0 0)} is VALID [2022-04-28 01:09:50,638 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1032#(<= ~counter~0 0)} {1024#true} [101] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1032#(<= ~counter~0 0)} is VALID [2022-04-28 01:09:50,639 INFO L272 TraceCheckUtils]: 4: Hoare triple {1032#(<= ~counter~0 0)} [71] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1032#(<= ~counter~0 0)} is VALID [2022-04-28 01:09:50,639 INFO L290 TraceCheckUtils]: 5: Hoare triple {1032#(<= ~counter~0 0)} [74] mainENTRY-->L29: Formula: (and (<= |v_main_#t~nondet5_2| 2147483647) (= v_main_~x1~0_2 |v_main_#t~nondet4_2|) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= |v_main_#t~nondet4_2| 2147483647) (= v_main_~x2~0_4 |v_main_#t~nondet5_2|) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648))) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|, main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~x2~0=v_main_~x2~0_4, main_~x1~0=v_main_~x1~0_2, main_~y3~0=v_main_~y3~0_5, main_~y2~0=v_main_~y2~0_6, main_~y1~0=v_main_~y1~0_4} AuxVars[] AssignedVars[main_#t~nondet5, main_#t~nondet4, main_~y3~0, main_~y2~0, main_~y1~0, main_~x2~0, main_~x1~0] {1032#(<= ~counter~0 0)} is VALID [2022-04-28 01:09:50,640 INFO L272 TraceCheckUtils]: 6: Hoare triple {1032#(<= ~counter~0 0)} [76] L29-->assume_abort_if_notENTRY: Formula: (= (ite (<= 0 v_main_~x1~0_8) 1 0) |v_assume_abort_if_not_#in~condInParam_1|) InVars {main_~x1~0=v_main_~x1~0_8} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~x1~0, assume_abort_if_not_#in~cond] {1032#(<= ~counter~0 0)} is VALID [2022-04-28 01:09:50,640 INFO L290 TraceCheckUtils]: 7: Hoare triple {1032#(<= ~counter~0 0)} [78] assume_abort_if_notENTRY-->L13: 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] {1032#(<= ~counter~0 0)} is VALID [2022-04-28 01:09:50,641 INFO L290 TraceCheckUtils]: 8: Hoare triple {1032#(<= ~counter~0 0)} [81] L13-->L13-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[] {1032#(<= ~counter~0 0)} is VALID [2022-04-28 01:09:50,642 INFO L290 TraceCheckUtils]: 9: Hoare triple {1032#(<= ~counter~0 0)} [84] L13-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1032#(<= ~counter~0 0)} is VALID [2022-04-28 01:09:50,643 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1032#(<= ~counter~0 0)} {1032#(<= ~counter~0 0)} [102] assume_abort_if_notEXIT-->L29-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (<= 0 v_main_~x1~0_8) 1 0) |v_assume_abort_if_not_#in~condInParam_1|) InVars {main_~x1~0=v_main_~x1~0_8} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~x1~0, assume_abort_if_not_#in~cond] {1032#(<= ~counter~0 0)} is VALID [2022-04-28 01:09:50,643 INFO L272 TraceCheckUtils]: 11: Hoare triple {1032#(<= ~counter~0 0)} [77] L29-1-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (not (= v_main_~x2~0_9 0)) 1 0)) InVars {main_~x2~0=v_main_~x2~0_9} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_2|} AuxVars[] AssignedVars[main_~x2~0, assume_abort_if_not_#in~cond] {1032#(<= ~counter~0 0)} is VALID [2022-04-28 01:09:50,643 INFO L290 TraceCheckUtils]: 12: Hoare triple {1032#(<= ~counter~0 0)} [78] assume_abort_if_notENTRY-->L13: 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] {1032#(<= ~counter~0 0)} is VALID [2022-04-28 01:09:50,644 INFO L290 TraceCheckUtils]: 13: Hoare triple {1032#(<= ~counter~0 0)} [81] L13-->L13-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[] {1032#(<= ~counter~0 0)} is VALID [2022-04-28 01:09:50,644 INFO L290 TraceCheckUtils]: 14: Hoare triple {1032#(<= ~counter~0 0)} [84] L13-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1032#(<= ~counter~0 0)} is VALID [2022-04-28 01:09:50,645 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {1032#(<= ~counter~0 0)} {1032#(<= ~counter~0 0)} [103] assume_abort_if_notEXIT-->L30: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (not (= v_main_~x2~0_9 0)) 1 0)) InVars {main_~x2~0=v_main_~x2~0_9} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_2|} AuxVars[] AssignedVars[main_~x2~0, assume_abort_if_not_#in~cond] {1032#(<= ~counter~0 0)} is VALID [2022-04-28 01:09:50,645 INFO L290 TraceCheckUtils]: 16: Hoare triple {1032#(<= ~counter~0 0)} [79] L30-->L41-2: Formula: (and (= v_main_~y1~0_5 0) (= v_main_~y2~0_7 0) (= v_main_~x1~0_6 v_main_~y3~0_6)) InVars {main_~x1~0=v_main_~x1~0_6} OutVars{main_~x1~0=v_main_~x1~0_6, main_~y3~0=v_main_~y3~0_6, main_~y2~0=v_main_~y2~0_7, main_~y1~0=v_main_~y1~0_5} AuxVars[] AssignedVars[main_~y3~0, main_~y2~0, main_~y1~0] {1032#(<= ~counter~0 0)} is VALID [2022-04-28 01:09:50,646 INFO L290 TraceCheckUtils]: 17: Hoare triple {1032#(<= ~counter~0 0)} [83] L41-2-->L36-1: Formula: (and (= |v_main_#t~post6_1| v_~counter~0_2) (= v_~counter~0_1 (+ |v_main_#t~post6_1| 1))) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post6] {1081#(<= ~counter~0 1)} is VALID [2022-04-28 01:09:50,646 INFO L290 TraceCheckUtils]: 18: Hoare triple {1081#(<= ~counter~0 1)} [87] L36-1-->L37: Formula: (< |v_main_#t~post6_5| 10) InVars {main_#t~post6=|v_main_#t~post6_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post6] {1081#(<= ~counter~0 1)} is VALID [2022-04-28 01:09:50,647 INFO L272 TraceCheckUtils]: 19: Hoare triple {1081#(<= ~counter~0 1)} [90] L37-->__VERIFIER_assertENTRY: Formula: (= (ite (= v_main_~x1~0_9 (+ (* v_main_~y1~0_7 v_main_~x2~0_10) v_main_~y2~0_9 v_main_~y3~0_10)) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~x2~0=v_main_~x2~0_10, main_~x1~0=v_main_~x1~0_9, main_~y3~0=v_main_~y3~0_10, main_~y2~0=v_main_~y2~0_9, main_~y1~0=v_main_~y1~0_7} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~y3~0, main_~y2~0, main_~y1~0, main_~x2~0, main_~x1~0] {1081#(<= ~counter~0 1)} is VALID [2022-04-28 01:09:50,647 INFO L290 TraceCheckUtils]: 20: Hoare triple {1081#(<= ~counter~0 1)} [89] __VERIFIER_assertENTRY-->L16: Formula: (= v___VERIFIER_assert_~cond_3 |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_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {1081#(<= ~counter~0 1)} is VALID [2022-04-28 01:09:50,647 INFO L290 TraceCheckUtils]: 21: Hoare triple {1081#(<= ~counter~0 1)} [93] L16-->L16-2: Formula: (not (= v___VERIFIER_assert_~cond_2 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {1081#(<= ~counter~0 1)} is VALID [2022-04-28 01:09:50,648 INFO L290 TraceCheckUtils]: 22: Hoare triple {1081#(<= ~counter~0 1)} [98] L16-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1081#(<= ~counter~0 1)} is VALID [2022-04-28 01:09:50,658 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {1081#(<= ~counter~0 1)} {1081#(<= ~counter~0 1)} [105] __VERIFIER_assertEXIT-->L37-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= v_main_~x1~0_9 (+ (* v_main_~y1~0_7 v_main_~x2~0_10) v_main_~y2~0_9 v_main_~y3~0_10)) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~x2~0=v_main_~x2~0_10, main_~x1~0=v_main_~x1~0_9, main_~y3~0=v_main_~y3~0_10, main_~y2~0=v_main_~y2~0_9, main_~y1~0=v_main_~y1~0_7} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~y3~0, main_~y2~0, main_~y1~0, main_~x2~0, main_~x1~0] {1081#(<= ~counter~0 1)} is VALID [2022-04-28 01:09:50,658 INFO L290 TraceCheckUtils]: 24: Hoare triple {1081#(<= ~counter~0 1)} [95] L37-1-->L41: Formula: (not (= v_main_~y3~0_9 0)) InVars {main_~y3~0=v_main_~y3~0_9} OutVars{main_~y3~0=v_main_~y3~0_9} AuxVars[] AssignedVars[] {1081#(<= ~counter~0 1)} is VALID [2022-04-28 01:09:50,659 INFO L290 TraceCheckUtils]: 25: Hoare triple {1081#(<= ~counter~0 1)} [99] L41-->L41-2: Formula: (and (= v_main_~y1~0_1 (+ v_main_~y1~0_2 1)) (= v_main_~y2~0_1 0) (= (+ v_main_~y2~0_2 1) v_main_~x2~0_1) (= v_main_~y3~0_1 (+ (- 1) v_main_~y3~0_2))) InVars {main_~x2~0=v_main_~x2~0_1, main_~y3~0=v_main_~y3~0_2, main_~y2~0=v_main_~y2~0_2, main_~y1~0=v_main_~y1~0_2} OutVars{main_~x2~0=v_main_~x2~0_1, main_~y3~0=v_main_~y3~0_1, main_~y2~0=v_main_~y2~0_1, main_~y1~0=v_main_~y1~0_1} AuxVars[] AssignedVars[main_~y3~0, main_~y2~0, main_~y1~0] {1081#(<= ~counter~0 1)} is VALID [2022-04-28 01:09:50,659 INFO L290 TraceCheckUtils]: 26: Hoare triple {1081#(<= ~counter~0 1)} [83] L41-2-->L36-1: Formula: (and (= |v_main_#t~post6_1| v_~counter~0_2) (= v_~counter~0_1 (+ |v_main_#t~post6_1| 1))) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post6] {1109#(<= |main_#t~post6| 1)} is VALID [2022-04-28 01:09:50,660 INFO L290 TraceCheckUtils]: 27: Hoare triple {1109#(<= |main_#t~post6| 1)} [86] L36-1-->L36-3: Formula: (not (< |v_main_#t~post6_3| 10)) InVars {main_#t~post6=|v_main_#t~post6_3|} OutVars{} AuxVars[] AssignedVars[main_#t~post6] {1025#false} is VALID [2022-04-28 01:09:50,660 INFO L272 TraceCheckUtils]: 28: Hoare triple {1025#false} [85] L36-3-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (= (+ v_main_~y2~0_10 (* v_main_~y1~0_8 v_main_~x2~0_11)) v_main_~x1~0_10) 1 0)) InVars {main_~x2~0=v_main_~x2~0_11, main_~x1~0=v_main_~x1~0_10, main_~y2~0=v_main_~y2~0_10, main_~y1~0=v_main_~y1~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~y2~0, main_~y1~0, main_~x2~0, main_~x1~0] {1025#false} is VALID [2022-04-28 01:09:50,660 INFO L290 TraceCheckUtils]: 29: Hoare triple {1025#false} [89] __VERIFIER_assertENTRY-->L16: Formula: (= v___VERIFIER_assert_~cond_3 |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_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {1025#false} is VALID [2022-04-28 01:09:50,660 INFO L290 TraceCheckUtils]: 30: Hoare triple {1025#false} [92] L16-->L17: Formula: (= v___VERIFIER_assert_~cond_1 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[] {1025#false} is VALID [2022-04-28 01:09:50,661 INFO L290 TraceCheckUtils]: 31: Hoare triple {1025#false} [96] L17-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1025#false} is VALID [2022-04-28 01:09:50,662 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-28 01:09:50,662 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 01:09:50,855 INFO L290 TraceCheckUtils]: 31: Hoare triple {1025#false} [96] L17-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1025#false} is VALID [2022-04-28 01:09:50,855 INFO L290 TraceCheckUtils]: 30: Hoare triple {1025#false} [92] L16-->L17: Formula: (= v___VERIFIER_assert_~cond_1 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[] {1025#false} is VALID [2022-04-28 01:09:50,856 INFO L290 TraceCheckUtils]: 29: Hoare triple {1025#false} [89] __VERIFIER_assertENTRY-->L16: Formula: (= v___VERIFIER_assert_~cond_3 |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_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {1025#false} is VALID [2022-04-28 01:09:50,856 INFO L272 TraceCheckUtils]: 28: Hoare triple {1025#false} [85] L36-3-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (= (+ v_main_~y2~0_10 (* v_main_~y1~0_8 v_main_~x2~0_11)) v_main_~x1~0_10) 1 0)) InVars {main_~x2~0=v_main_~x2~0_11, main_~x1~0=v_main_~x1~0_10, main_~y2~0=v_main_~y2~0_10, main_~y1~0=v_main_~y1~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~y2~0, main_~y1~0, main_~x2~0, main_~x1~0] {1025#false} is VALID [2022-04-28 01:09:50,859 INFO L290 TraceCheckUtils]: 27: Hoare triple {1137#(< |main_#t~post6| 10)} [86] L36-1-->L36-3: Formula: (not (< |v_main_#t~post6_3| 10)) InVars {main_#t~post6=|v_main_#t~post6_3|} OutVars{} AuxVars[] AssignedVars[main_#t~post6] {1025#false} is VALID [2022-04-28 01:09:50,860 INFO L290 TraceCheckUtils]: 26: Hoare triple {1141#(< ~counter~0 10)} [83] L41-2-->L36-1: Formula: (and (= |v_main_#t~post6_1| v_~counter~0_2) (= v_~counter~0_1 (+ |v_main_#t~post6_1| 1))) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post6] {1137#(< |main_#t~post6| 10)} is VALID [2022-04-28 01:09:50,860 INFO L290 TraceCheckUtils]: 25: Hoare triple {1141#(< ~counter~0 10)} [99] L41-->L41-2: Formula: (and (= v_main_~y1~0_1 (+ v_main_~y1~0_2 1)) (= v_main_~y2~0_1 0) (= (+ v_main_~y2~0_2 1) v_main_~x2~0_1) (= v_main_~y3~0_1 (+ (- 1) v_main_~y3~0_2))) InVars {main_~x2~0=v_main_~x2~0_1, main_~y3~0=v_main_~y3~0_2, main_~y2~0=v_main_~y2~0_2, main_~y1~0=v_main_~y1~0_2} OutVars{main_~x2~0=v_main_~x2~0_1, main_~y3~0=v_main_~y3~0_1, main_~y2~0=v_main_~y2~0_1, main_~y1~0=v_main_~y1~0_1} AuxVars[] AssignedVars[main_~y3~0, main_~y2~0, main_~y1~0] {1141#(< ~counter~0 10)} is VALID [2022-04-28 01:09:50,860 INFO L290 TraceCheckUtils]: 24: Hoare triple {1141#(< ~counter~0 10)} [95] L37-1-->L41: Formula: (not (= v_main_~y3~0_9 0)) InVars {main_~y3~0=v_main_~y3~0_9} OutVars{main_~y3~0=v_main_~y3~0_9} AuxVars[] AssignedVars[] {1141#(< ~counter~0 10)} is VALID [2022-04-28 01:09:50,861 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {1024#true} {1141#(< ~counter~0 10)} [105] __VERIFIER_assertEXIT-->L37-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= v_main_~x1~0_9 (+ (* v_main_~y1~0_7 v_main_~x2~0_10) v_main_~y2~0_9 v_main_~y3~0_10)) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~x2~0=v_main_~x2~0_10, main_~x1~0=v_main_~x1~0_9, main_~y3~0=v_main_~y3~0_10, main_~y2~0=v_main_~y2~0_9, main_~y1~0=v_main_~y1~0_7} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~y3~0, main_~y2~0, main_~y1~0, main_~x2~0, main_~x1~0] {1141#(< ~counter~0 10)} is VALID [2022-04-28 01:09:50,861 INFO L290 TraceCheckUtils]: 22: Hoare triple {1024#true} [98] L16-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1024#true} is VALID [2022-04-28 01:09:50,862 INFO L290 TraceCheckUtils]: 21: Hoare triple {1024#true} [93] L16-->L16-2: Formula: (not (= v___VERIFIER_assert_~cond_2 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {1024#true} is VALID [2022-04-28 01:09:50,862 INFO L290 TraceCheckUtils]: 20: Hoare triple {1024#true} [89] __VERIFIER_assertENTRY-->L16: Formula: (= v___VERIFIER_assert_~cond_3 |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_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {1024#true} is VALID [2022-04-28 01:09:50,862 INFO L272 TraceCheckUtils]: 19: Hoare triple {1141#(< ~counter~0 10)} [90] L37-->__VERIFIER_assertENTRY: Formula: (= (ite (= v_main_~x1~0_9 (+ (* v_main_~y1~0_7 v_main_~x2~0_10) v_main_~y2~0_9 v_main_~y3~0_10)) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~x2~0=v_main_~x2~0_10, main_~x1~0=v_main_~x1~0_9, main_~y3~0=v_main_~y3~0_10, main_~y2~0=v_main_~y2~0_9, main_~y1~0=v_main_~y1~0_7} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~y3~0, main_~y2~0, main_~y1~0, main_~x2~0, main_~x1~0] {1024#true} is VALID [2022-04-28 01:09:50,862 INFO L290 TraceCheckUtils]: 18: Hoare triple {1141#(< ~counter~0 10)} [87] L36-1-->L37: Formula: (< |v_main_#t~post6_5| 10) InVars {main_#t~post6=|v_main_#t~post6_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post6] {1141#(< ~counter~0 10)} is VALID [2022-04-28 01:09:50,863 INFO L290 TraceCheckUtils]: 17: Hoare triple {1169#(< ~counter~0 9)} [83] L41-2-->L36-1: Formula: (and (= |v_main_#t~post6_1| v_~counter~0_2) (= v_~counter~0_1 (+ |v_main_#t~post6_1| 1))) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post6] {1141#(< ~counter~0 10)} is VALID [2022-04-28 01:09:50,863 INFO L290 TraceCheckUtils]: 16: Hoare triple {1169#(< ~counter~0 9)} [79] L30-->L41-2: Formula: (and (= v_main_~y1~0_5 0) (= v_main_~y2~0_7 0) (= v_main_~x1~0_6 v_main_~y3~0_6)) InVars {main_~x1~0=v_main_~x1~0_6} OutVars{main_~x1~0=v_main_~x1~0_6, main_~y3~0=v_main_~y3~0_6, main_~y2~0=v_main_~y2~0_7, main_~y1~0=v_main_~y1~0_5} AuxVars[] AssignedVars[main_~y3~0, main_~y2~0, main_~y1~0] {1169#(< ~counter~0 9)} is VALID [2022-04-28 01:09:50,864 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {1024#true} {1169#(< ~counter~0 9)} [103] assume_abort_if_notEXIT-->L30: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (not (= v_main_~x2~0_9 0)) 1 0)) InVars {main_~x2~0=v_main_~x2~0_9} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_2|} AuxVars[] AssignedVars[main_~x2~0, assume_abort_if_not_#in~cond] {1169#(< ~counter~0 9)} is VALID [2022-04-28 01:09:50,864 INFO L290 TraceCheckUtils]: 14: Hoare triple {1024#true} [84] L13-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1024#true} is VALID [2022-04-28 01:09:50,864 INFO L290 TraceCheckUtils]: 13: Hoare triple {1024#true} [81] L13-->L13-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[] {1024#true} is VALID [2022-04-28 01:09:50,864 INFO L290 TraceCheckUtils]: 12: Hoare triple {1024#true} [78] assume_abort_if_notENTRY-->L13: 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] {1024#true} is VALID [2022-04-28 01:09:50,864 INFO L272 TraceCheckUtils]: 11: Hoare triple {1169#(< ~counter~0 9)} [77] L29-1-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (not (= v_main_~x2~0_9 0)) 1 0)) InVars {main_~x2~0=v_main_~x2~0_9} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_2|} AuxVars[] AssignedVars[main_~x2~0, assume_abort_if_not_#in~cond] {1024#true} is VALID [2022-04-28 01:09:50,865 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1024#true} {1169#(< ~counter~0 9)} [102] assume_abort_if_notEXIT-->L29-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (<= 0 v_main_~x1~0_8) 1 0) |v_assume_abort_if_not_#in~condInParam_1|) InVars {main_~x1~0=v_main_~x1~0_8} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~x1~0, assume_abort_if_not_#in~cond] {1169#(< ~counter~0 9)} is VALID [2022-04-28 01:09:50,865 INFO L290 TraceCheckUtils]: 9: Hoare triple {1024#true} [84] L13-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1024#true} is VALID [2022-04-28 01:09:50,865 INFO L290 TraceCheckUtils]: 8: Hoare triple {1024#true} [81] L13-->L13-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[] {1024#true} is VALID [2022-04-28 01:09:50,865 INFO L290 TraceCheckUtils]: 7: Hoare triple {1024#true} [78] assume_abort_if_notENTRY-->L13: 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] {1024#true} is VALID [2022-04-28 01:09:50,865 INFO L272 TraceCheckUtils]: 6: Hoare triple {1169#(< ~counter~0 9)} [76] L29-->assume_abort_if_notENTRY: Formula: (= (ite (<= 0 v_main_~x1~0_8) 1 0) |v_assume_abort_if_not_#in~condInParam_1|) InVars {main_~x1~0=v_main_~x1~0_8} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~x1~0, assume_abort_if_not_#in~cond] {1024#true} is VALID [2022-04-28 01:09:50,866 INFO L290 TraceCheckUtils]: 5: Hoare triple {1169#(< ~counter~0 9)} [74] mainENTRY-->L29: Formula: (and (<= |v_main_#t~nondet5_2| 2147483647) (= v_main_~x1~0_2 |v_main_#t~nondet4_2|) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= |v_main_#t~nondet4_2| 2147483647) (= v_main_~x2~0_4 |v_main_#t~nondet5_2|) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648))) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|, main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~x2~0=v_main_~x2~0_4, main_~x1~0=v_main_~x1~0_2, main_~y3~0=v_main_~y3~0_5, main_~y2~0=v_main_~y2~0_6, main_~y1~0=v_main_~y1~0_4} AuxVars[] AssignedVars[main_#t~nondet5, main_#t~nondet4, main_~y3~0, main_~y2~0, main_~y1~0, main_~x2~0, main_~x1~0] {1169#(< ~counter~0 9)} is VALID [2022-04-28 01:09:50,866 INFO L272 TraceCheckUtils]: 4: Hoare triple {1169#(< ~counter~0 9)} [71] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1169#(< ~counter~0 9)} is VALID [2022-04-28 01:09:50,867 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1169#(< ~counter~0 9)} {1024#true} [101] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1169#(< ~counter~0 9)} is VALID [2022-04-28 01:09:50,867 INFO L290 TraceCheckUtils]: 2: Hoare triple {1169#(< ~counter~0 9)} [75] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1169#(< ~counter~0 9)} is VALID [2022-04-28 01:09:50,868 INFO L290 TraceCheckUtils]: 1: Hoare triple {1024#true} [72] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= v_~counter~0_3 0) (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (= (select |v_#length_1| 2) 11) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (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{~counter~0=v_~counter~0_3, #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[~counter~0, #NULL.offset, #NULL.base] {1169#(< ~counter~0 9)} is VALID [2022-04-28 01:09:50,868 INFO L272 TraceCheckUtils]: 0: Hoare triple {1024#true} [70] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1024#true} is VALID [2022-04-28 01:09:50,868 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-28 01:09:50,868 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 01:09:50,869 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [889627042] [2022-04-28 01:09:50,869 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 01:09:50,869 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [120540499] [2022-04-28 01:09:50,869 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [120540499] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 01:09:50,869 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 01:09:50,869 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2022-04-28 01:09:50,869 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [362457975] [2022-04-28 01:09:50,869 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-28 01:09:50,870 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.375) internal successors, (35), 8 states have internal predecessors, (35), 6 states have call successors, (10), 5 states have call predecessors, (10), 4 states have return successors, (8), 4 states have call predecessors, (8), 5 states have call successors, (8) Word has length 32 [2022-04-28 01:09:50,870 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 01:09:50,870 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 8 states, 8 states have (on average 4.375) internal successors, (35), 8 states have internal predecessors, (35), 6 states have call successors, (10), 5 states have call predecessors, (10), 4 states have return successors, (8), 4 states have call predecessors, (8), 5 states have call successors, (8) [2022-04-28 01:09:50,914 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 53 edges. 53 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 01:09:50,915 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-28 01:09:50,915 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-28 01:09:50,915 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-28 01:09:50,915 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2022-04-28 01:09:50,915 INFO L87 Difference]: Start difference. First operand 29 states and 31 transitions. Second operand has 8 states, 8 states have (on average 4.375) internal successors, (35), 8 states have internal predecessors, (35), 6 states have call successors, (10), 5 states have call predecessors, (10), 4 states have return successors, (8), 4 states have call predecessors, (8), 5 states have call successors, (8) [2022-04-28 01:09:51,099 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 01:09:51,099 INFO L93 Difference]: Finished difference Result 61 states and 68 transitions. [2022-04-28 01:09:51,099 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-04-28 01:09:51,100 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.375) internal successors, (35), 8 states have internal predecessors, (35), 6 states have call successors, (10), 5 states have call predecessors, (10), 4 states have return successors, (8), 4 states have call predecessors, (8), 5 states have call successors, (8) Word has length 32 [2022-04-28 01:09:51,100 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 01:09:51,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 4.375) internal successors, (35), 8 states have internal predecessors, (35), 6 states have call successors, (10), 5 states have call predecessors, (10), 4 states have return successors, (8), 4 states have call predecessors, (8), 5 states have call successors, (8) [2022-04-28 01:09:51,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 67 transitions. [2022-04-28 01:09:51,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 4.375) internal successors, (35), 8 states have internal predecessors, (35), 6 states have call successors, (10), 5 states have call predecessors, (10), 4 states have return successors, (8), 4 states have call predecessors, (8), 5 states have call successors, (8) [2022-04-28 01:09:51,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 67 transitions. [2022-04-28 01:09:51,105 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 10 states and 67 transitions. [2022-04-28 01:09:51,157 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 67 edges. 67 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 01:09:51,159 INFO L225 Difference]: With dead ends: 61 [2022-04-28 01:09:51,159 INFO L226 Difference]: Without dead ends: 56 [2022-04-28 01:09:51,159 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2022-04-28 01:09:51,160 INFO L413 NwaCegarLoop]: 29 mSDtfsCounter, 43 mSDsluCounter, 87 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 116 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 01:09:51,160 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 116 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 01:09:51,161 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2022-04-28 01:09:51,176 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2022-04-28 01:09:51,176 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 01:09:51,177 INFO L82 GeneralOperation]: Start isEquivalent. First operand 56 states. Second operand has 56 states, 40 states have (on average 1.125) internal successors, (45), 40 states have internal predecessors, (45), 9 states have call successors, (9), 8 states have call predecessors, (9), 6 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-28 01:09:51,177 INFO L74 IsIncluded]: Start isIncluded. First operand 56 states. Second operand has 56 states, 40 states have (on average 1.125) internal successors, (45), 40 states have internal predecessors, (45), 9 states have call successors, (9), 8 states have call predecessors, (9), 6 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-28 01:09:51,177 INFO L87 Difference]: Start difference. First operand 56 states. Second operand has 56 states, 40 states have (on average 1.125) internal successors, (45), 40 states have internal predecessors, (45), 9 states have call successors, (9), 8 states have call predecessors, (9), 6 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-28 01:09:51,179 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 01:09:51,179 INFO L93 Difference]: Finished difference Result 56 states and 61 transitions. [2022-04-28 01:09:51,179 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 61 transitions. [2022-04-28 01:09:51,180 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 01:09:51,180 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 01:09:51,180 INFO L74 IsIncluded]: Start isIncluded. First operand has 56 states, 40 states have (on average 1.125) internal successors, (45), 40 states have internal predecessors, (45), 9 states have call successors, (9), 8 states have call predecessors, (9), 6 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Second operand 56 states. [2022-04-28 01:09:51,181 INFO L87 Difference]: Start difference. First operand has 56 states, 40 states have (on average 1.125) internal successors, (45), 40 states have internal predecessors, (45), 9 states have call successors, (9), 8 states have call predecessors, (9), 6 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Second operand 56 states. [2022-04-28 01:09:51,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 01:09:51,183 INFO L93 Difference]: Finished difference Result 56 states and 61 transitions. [2022-04-28 01:09:51,183 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 61 transitions. [2022-04-28 01:09:51,183 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 01:09:51,183 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 01:09:51,183 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 01:09:51,183 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 01:09:51,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 40 states have (on average 1.125) internal successors, (45), 40 states have internal predecessors, (45), 9 states have call successors, (9), 8 states have call predecessors, (9), 6 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-28 01:09:51,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 61 transitions. [2022-04-28 01:09:51,185 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 61 transitions. Word has length 32 [2022-04-28 01:09:51,185 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 01:09:51,185 INFO L495 AbstractCegarLoop]: Abstraction has 56 states and 61 transitions. [2022-04-28 01:09:51,186 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.375) internal successors, (35), 8 states have internal predecessors, (35), 6 states have call successors, (10), 5 states have call predecessors, (10), 4 states have return successors, (8), 4 states have call predecessors, (8), 5 states have call successors, (8) [2022-04-28 01:09:51,186 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 61 transitions. [2022-04-28 01:09:51,187 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2022-04-28 01:09:51,187 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 01:09:51,187 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 4, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 01:09:51,211 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-04-28 01:09:51,408 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 01:09:51,409 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 01:09:51,409 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 01:09:51,409 INFO L85 PathProgramCache]: Analyzing trace with hash -906969448, now seen corresponding path program 2 times [2022-04-28 01:09:51,409 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 01:09:51,409 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1327371986] [2022-04-28 01:09:51,409 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 01:09:51,409 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 01:09:51,433 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 01:09:51,433 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [20451962] [2022-04-28 01:09:51,433 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 01:09:51,433 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 01:09:51,434 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 01:09:51,440 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 01:09:51,447 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-04-28 01:09:51,494 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 01:09:51,494 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 01:09:51,495 INFO L263 TraceCheckSpWp]: Trace formula consists of 185 conjuncts, 13 conjunts are in the unsatisfiable core [2022-04-28 01:09:51,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 01:09:51,511 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 01:09:51,820 INFO L272 TraceCheckUtils]: 0: Hoare triple {1504#true} [70] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1504#true} is VALID [2022-04-28 01:09:51,821 INFO L290 TraceCheckUtils]: 1: Hoare triple {1504#true} [72] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= v_~counter~0_3 0) (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (= (select |v_#length_1| 2) 11) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (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{~counter~0=v_~counter~0_3, #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[~counter~0, #NULL.offset, #NULL.base] {1512#(<= ~counter~0 0)} is VALID [2022-04-28 01:09:51,822 INFO L290 TraceCheckUtils]: 2: Hoare triple {1512#(<= ~counter~0 0)} [75] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1512#(<= ~counter~0 0)} is VALID [2022-04-28 01:09:51,822 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1512#(<= ~counter~0 0)} {1504#true} [101] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1512#(<= ~counter~0 0)} is VALID [2022-04-28 01:09:51,822 INFO L272 TraceCheckUtils]: 4: Hoare triple {1512#(<= ~counter~0 0)} [71] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1512#(<= ~counter~0 0)} is VALID [2022-04-28 01:09:51,823 INFO L290 TraceCheckUtils]: 5: Hoare triple {1512#(<= ~counter~0 0)} [74] mainENTRY-->L29: Formula: (and (<= |v_main_#t~nondet5_2| 2147483647) (= v_main_~x1~0_2 |v_main_#t~nondet4_2|) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= |v_main_#t~nondet4_2| 2147483647) (= v_main_~x2~0_4 |v_main_#t~nondet5_2|) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648))) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|, main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~x2~0=v_main_~x2~0_4, main_~x1~0=v_main_~x1~0_2, main_~y3~0=v_main_~y3~0_5, main_~y2~0=v_main_~y2~0_6, main_~y1~0=v_main_~y1~0_4} AuxVars[] AssignedVars[main_#t~nondet5, main_#t~nondet4, main_~y3~0, main_~y2~0, main_~y1~0, main_~x2~0, main_~x1~0] {1512#(<= ~counter~0 0)} is VALID [2022-04-28 01:09:51,823 INFO L272 TraceCheckUtils]: 6: Hoare triple {1512#(<= ~counter~0 0)} [76] L29-->assume_abort_if_notENTRY: Formula: (= (ite (<= 0 v_main_~x1~0_8) 1 0) |v_assume_abort_if_not_#in~condInParam_1|) InVars {main_~x1~0=v_main_~x1~0_8} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~x1~0, assume_abort_if_not_#in~cond] {1512#(<= ~counter~0 0)} is VALID [2022-04-28 01:09:51,824 INFO L290 TraceCheckUtils]: 7: Hoare triple {1512#(<= ~counter~0 0)} [78] assume_abort_if_notENTRY-->L13: 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] {1512#(<= ~counter~0 0)} is VALID [2022-04-28 01:09:51,824 INFO L290 TraceCheckUtils]: 8: Hoare triple {1512#(<= ~counter~0 0)} [81] L13-->L13-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[] {1512#(<= ~counter~0 0)} is VALID [2022-04-28 01:09:51,824 INFO L290 TraceCheckUtils]: 9: Hoare triple {1512#(<= ~counter~0 0)} [84] L13-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1512#(<= ~counter~0 0)} is VALID [2022-04-28 01:09:51,825 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1512#(<= ~counter~0 0)} {1512#(<= ~counter~0 0)} [102] assume_abort_if_notEXIT-->L29-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (<= 0 v_main_~x1~0_8) 1 0) |v_assume_abort_if_not_#in~condInParam_1|) InVars {main_~x1~0=v_main_~x1~0_8} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~x1~0, assume_abort_if_not_#in~cond] {1512#(<= ~counter~0 0)} is VALID [2022-04-28 01:09:51,825 INFO L272 TraceCheckUtils]: 11: Hoare triple {1512#(<= ~counter~0 0)} [77] L29-1-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (not (= v_main_~x2~0_9 0)) 1 0)) InVars {main_~x2~0=v_main_~x2~0_9} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_2|} AuxVars[] AssignedVars[main_~x2~0, assume_abort_if_not_#in~cond] {1512#(<= ~counter~0 0)} is VALID [2022-04-28 01:09:51,826 INFO L290 TraceCheckUtils]: 12: Hoare triple {1512#(<= ~counter~0 0)} [78] assume_abort_if_notENTRY-->L13: 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] {1512#(<= ~counter~0 0)} is VALID [2022-04-28 01:09:51,826 INFO L290 TraceCheckUtils]: 13: Hoare triple {1512#(<= ~counter~0 0)} [81] L13-->L13-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[] {1512#(<= ~counter~0 0)} is VALID [2022-04-28 01:09:51,826 INFO L290 TraceCheckUtils]: 14: Hoare triple {1512#(<= ~counter~0 0)} [84] L13-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1512#(<= ~counter~0 0)} is VALID [2022-04-28 01:09:51,827 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {1512#(<= ~counter~0 0)} {1512#(<= ~counter~0 0)} [103] assume_abort_if_notEXIT-->L30: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (not (= v_main_~x2~0_9 0)) 1 0)) InVars {main_~x2~0=v_main_~x2~0_9} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_2|} AuxVars[] AssignedVars[main_~x2~0, assume_abort_if_not_#in~cond] {1512#(<= ~counter~0 0)} is VALID [2022-04-28 01:09:51,827 INFO L290 TraceCheckUtils]: 16: Hoare triple {1512#(<= ~counter~0 0)} [79] L30-->L41-2: Formula: (and (= v_main_~y1~0_5 0) (= v_main_~y2~0_7 0) (= v_main_~x1~0_6 v_main_~y3~0_6)) InVars {main_~x1~0=v_main_~x1~0_6} OutVars{main_~x1~0=v_main_~x1~0_6, main_~y3~0=v_main_~y3~0_6, main_~y2~0=v_main_~y2~0_7, main_~y1~0=v_main_~y1~0_5} AuxVars[] AssignedVars[main_~y3~0, main_~y2~0, main_~y1~0] {1512#(<= ~counter~0 0)} is VALID [2022-04-28 01:09:51,828 INFO L290 TraceCheckUtils]: 17: Hoare triple {1512#(<= ~counter~0 0)} [83] L41-2-->L36-1: Formula: (and (= |v_main_#t~post6_1| v_~counter~0_2) (= v_~counter~0_1 (+ |v_main_#t~post6_1| 1))) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post6] {1561#(<= ~counter~0 1)} is VALID [2022-04-28 01:09:51,828 INFO L290 TraceCheckUtils]: 18: Hoare triple {1561#(<= ~counter~0 1)} [87] L36-1-->L37: Formula: (< |v_main_#t~post6_5| 10) InVars {main_#t~post6=|v_main_#t~post6_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post6] {1561#(<= ~counter~0 1)} is VALID [2022-04-28 01:09:51,829 INFO L272 TraceCheckUtils]: 19: Hoare triple {1561#(<= ~counter~0 1)} [90] L37-->__VERIFIER_assertENTRY: Formula: (= (ite (= v_main_~x1~0_9 (+ (* v_main_~y1~0_7 v_main_~x2~0_10) v_main_~y2~0_9 v_main_~y3~0_10)) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~x2~0=v_main_~x2~0_10, main_~x1~0=v_main_~x1~0_9, main_~y3~0=v_main_~y3~0_10, main_~y2~0=v_main_~y2~0_9, main_~y1~0=v_main_~y1~0_7} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~y3~0, main_~y2~0, main_~y1~0, main_~x2~0, main_~x1~0] {1561#(<= ~counter~0 1)} is VALID [2022-04-28 01:09:51,829 INFO L290 TraceCheckUtils]: 20: Hoare triple {1561#(<= ~counter~0 1)} [89] __VERIFIER_assertENTRY-->L16: Formula: (= v___VERIFIER_assert_~cond_3 |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_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {1561#(<= ~counter~0 1)} is VALID [2022-04-28 01:09:51,830 INFO L290 TraceCheckUtils]: 21: Hoare triple {1561#(<= ~counter~0 1)} [93] L16-->L16-2: Formula: (not (= v___VERIFIER_assert_~cond_2 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {1561#(<= ~counter~0 1)} is VALID [2022-04-28 01:09:51,830 INFO L290 TraceCheckUtils]: 22: Hoare triple {1561#(<= ~counter~0 1)} [98] L16-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1561#(<= ~counter~0 1)} is VALID [2022-04-28 01:09:51,831 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {1561#(<= ~counter~0 1)} {1561#(<= ~counter~0 1)} [105] __VERIFIER_assertEXIT-->L37-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= v_main_~x1~0_9 (+ (* v_main_~y1~0_7 v_main_~x2~0_10) v_main_~y2~0_9 v_main_~y3~0_10)) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~x2~0=v_main_~x2~0_10, main_~x1~0=v_main_~x1~0_9, main_~y3~0=v_main_~y3~0_10, main_~y2~0=v_main_~y2~0_9, main_~y1~0=v_main_~y1~0_7} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~y3~0, main_~y2~0, main_~y1~0, main_~x2~0, main_~x1~0] {1561#(<= ~counter~0 1)} is VALID [2022-04-28 01:09:51,832 INFO L290 TraceCheckUtils]: 24: Hoare triple {1561#(<= ~counter~0 1)} [95] L37-1-->L41: Formula: (not (= v_main_~y3~0_9 0)) InVars {main_~y3~0=v_main_~y3~0_9} OutVars{main_~y3~0=v_main_~y3~0_9} AuxVars[] AssignedVars[] {1561#(<= ~counter~0 1)} is VALID [2022-04-28 01:09:51,833 INFO L290 TraceCheckUtils]: 25: Hoare triple {1561#(<= ~counter~0 1)} [99] L41-->L41-2: Formula: (and (= v_main_~y1~0_1 (+ v_main_~y1~0_2 1)) (= v_main_~y2~0_1 0) (= (+ v_main_~y2~0_2 1) v_main_~x2~0_1) (= v_main_~y3~0_1 (+ (- 1) v_main_~y3~0_2))) InVars {main_~x2~0=v_main_~x2~0_1, main_~y3~0=v_main_~y3~0_2, main_~y2~0=v_main_~y2~0_2, main_~y1~0=v_main_~y1~0_2} OutVars{main_~x2~0=v_main_~x2~0_1, main_~y3~0=v_main_~y3~0_1, main_~y2~0=v_main_~y2~0_1, main_~y1~0=v_main_~y1~0_1} AuxVars[] AssignedVars[main_~y3~0, main_~y2~0, main_~y1~0] {1561#(<= ~counter~0 1)} is VALID [2022-04-28 01:09:51,833 INFO L290 TraceCheckUtils]: 26: Hoare triple {1561#(<= ~counter~0 1)} [83] L41-2-->L36-1: Formula: (and (= |v_main_#t~post6_1| v_~counter~0_2) (= v_~counter~0_1 (+ |v_main_#t~post6_1| 1))) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post6] {1589#(<= ~counter~0 2)} is VALID [2022-04-28 01:09:51,834 INFO L290 TraceCheckUtils]: 27: Hoare triple {1589#(<= ~counter~0 2)} [87] L36-1-->L37: Formula: (< |v_main_#t~post6_5| 10) InVars {main_#t~post6=|v_main_#t~post6_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post6] {1589#(<= ~counter~0 2)} is VALID [2022-04-28 01:09:51,834 INFO L272 TraceCheckUtils]: 28: Hoare triple {1589#(<= ~counter~0 2)} [90] L37-->__VERIFIER_assertENTRY: Formula: (= (ite (= v_main_~x1~0_9 (+ (* v_main_~y1~0_7 v_main_~x2~0_10) v_main_~y2~0_9 v_main_~y3~0_10)) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~x2~0=v_main_~x2~0_10, main_~x1~0=v_main_~x1~0_9, main_~y3~0=v_main_~y3~0_10, main_~y2~0=v_main_~y2~0_9, main_~y1~0=v_main_~y1~0_7} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~y3~0, main_~y2~0, main_~y1~0, main_~x2~0, main_~x1~0] {1589#(<= ~counter~0 2)} is VALID [2022-04-28 01:09:51,835 INFO L290 TraceCheckUtils]: 29: Hoare triple {1589#(<= ~counter~0 2)} [89] __VERIFIER_assertENTRY-->L16: Formula: (= v___VERIFIER_assert_~cond_3 |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_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {1589#(<= ~counter~0 2)} is VALID [2022-04-28 01:09:51,835 INFO L290 TraceCheckUtils]: 30: Hoare triple {1589#(<= ~counter~0 2)} [93] L16-->L16-2: Formula: (not (= v___VERIFIER_assert_~cond_2 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {1589#(<= ~counter~0 2)} is VALID [2022-04-28 01:09:51,835 INFO L290 TraceCheckUtils]: 31: Hoare triple {1589#(<= ~counter~0 2)} [98] L16-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1589#(<= ~counter~0 2)} is VALID [2022-04-28 01:09:51,836 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {1589#(<= ~counter~0 2)} {1589#(<= ~counter~0 2)} [105] __VERIFIER_assertEXIT-->L37-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= v_main_~x1~0_9 (+ (* v_main_~y1~0_7 v_main_~x2~0_10) v_main_~y2~0_9 v_main_~y3~0_10)) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~x2~0=v_main_~x2~0_10, main_~x1~0=v_main_~x1~0_9, main_~y3~0=v_main_~y3~0_10, main_~y2~0=v_main_~y2~0_9, main_~y1~0=v_main_~y1~0_7} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~y3~0, main_~y2~0, main_~y1~0, main_~x2~0, main_~x1~0] {1589#(<= ~counter~0 2)} is VALID [2022-04-28 01:09:51,836 INFO L290 TraceCheckUtils]: 33: Hoare triple {1589#(<= ~counter~0 2)} [95] L37-1-->L41: Formula: (not (= v_main_~y3~0_9 0)) InVars {main_~y3~0=v_main_~y3~0_9} OutVars{main_~y3~0=v_main_~y3~0_9} AuxVars[] AssignedVars[] {1589#(<= ~counter~0 2)} is VALID [2022-04-28 01:09:51,837 INFO L290 TraceCheckUtils]: 34: Hoare triple {1589#(<= ~counter~0 2)} [99] L41-->L41-2: Formula: (and (= v_main_~y1~0_1 (+ v_main_~y1~0_2 1)) (= v_main_~y2~0_1 0) (= (+ v_main_~y2~0_2 1) v_main_~x2~0_1) (= v_main_~y3~0_1 (+ (- 1) v_main_~y3~0_2))) InVars {main_~x2~0=v_main_~x2~0_1, main_~y3~0=v_main_~y3~0_2, main_~y2~0=v_main_~y2~0_2, main_~y1~0=v_main_~y1~0_2} OutVars{main_~x2~0=v_main_~x2~0_1, main_~y3~0=v_main_~y3~0_1, main_~y2~0=v_main_~y2~0_1, main_~y1~0=v_main_~y1~0_1} AuxVars[] AssignedVars[main_~y3~0, main_~y2~0, main_~y1~0] {1589#(<= ~counter~0 2)} is VALID [2022-04-28 01:09:51,837 INFO L290 TraceCheckUtils]: 35: Hoare triple {1589#(<= ~counter~0 2)} [83] L41-2-->L36-1: Formula: (and (= |v_main_#t~post6_1| v_~counter~0_2) (= v_~counter~0_1 (+ |v_main_#t~post6_1| 1))) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post6] {1617#(<= ~counter~0 3)} is VALID [2022-04-28 01:09:51,838 INFO L290 TraceCheckUtils]: 36: Hoare triple {1617#(<= ~counter~0 3)} [87] L36-1-->L37: Formula: (< |v_main_#t~post6_5| 10) InVars {main_#t~post6=|v_main_#t~post6_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post6] {1617#(<= ~counter~0 3)} is VALID [2022-04-28 01:09:51,838 INFO L272 TraceCheckUtils]: 37: Hoare triple {1617#(<= ~counter~0 3)} [90] L37-->__VERIFIER_assertENTRY: Formula: (= (ite (= v_main_~x1~0_9 (+ (* v_main_~y1~0_7 v_main_~x2~0_10) v_main_~y2~0_9 v_main_~y3~0_10)) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~x2~0=v_main_~x2~0_10, main_~x1~0=v_main_~x1~0_9, main_~y3~0=v_main_~y3~0_10, main_~y2~0=v_main_~y2~0_9, main_~y1~0=v_main_~y1~0_7} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~y3~0, main_~y2~0, main_~y1~0, main_~x2~0, main_~x1~0] {1617#(<= ~counter~0 3)} is VALID [2022-04-28 01:09:51,838 INFO L290 TraceCheckUtils]: 38: Hoare triple {1617#(<= ~counter~0 3)} [89] __VERIFIER_assertENTRY-->L16: Formula: (= v___VERIFIER_assert_~cond_3 |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_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {1617#(<= ~counter~0 3)} is VALID [2022-04-28 01:09:51,839 INFO L290 TraceCheckUtils]: 39: Hoare triple {1617#(<= ~counter~0 3)} [93] L16-->L16-2: Formula: (not (= v___VERIFIER_assert_~cond_2 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {1617#(<= ~counter~0 3)} is VALID [2022-04-28 01:09:51,839 INFO L290 TraceCheckUtils]: 40: Hoare triple {1617#(<= ~counter~0 3)} [98] L16-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1617#(<= ~counter~0 3)} is VALID [2022-04-28 01:09:51,840 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {1617#(<= ~counter~0 3)} {1617#(<= ~counter~0 3)} [105] __VERIFIER_assertEXIT-->L37-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= v_main_~x1~0_9 (+ (* v_main_~y1~0_7 v_main_~x2~0_10) v_main_~y2~0_9 v_main_~y3~0_10)) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~x2~0=v_main_~x2~0_10, main_~x1~0=v_main_~x1~0_9, main_~y3~0=v_main_~y3~0_10, main_~y2~0=v_main_~y2~0_9, main_~y1~0=v_main_~y1~0_7} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~y3~0, main_~y2~0, main_~y1~0, main_~x2~0, main_~x1~0] {1617#(<= ~counter~0 3)} is VALID [2022-04-28 01:09:51,845 INFO L290 TraceCheckUtils]: 42: Hoare triple {1617#(<= ~counter~0 3)} [95] L37-1-->L41: Formula: (not (= v_main_~y3~0_9 0)) InVars {main_~y3~0=v_main_~y3~0_9} OutVars{main_~y3~0=v_main_~y3~0_9} AuxVars[] AssignedVars[] {1617#(<= ~counter~0 3)} is VALID [2022-04-28 01:09:51,846 INFO L290 TraceCheckUtils]: 43: Hoare triple {1617#(<= ~counter~0 3)} [99] L41-->L41-2: Formula: (and (= v_main_~y1~0_1 (+ v_main_~y1~0_2 1)) (= v_main_~y2~0_1 0) (= (+ v_main_~y2~0_2 1) v_main_~x2~0_1) (= v_main_~y3~0_1 (+ (- 1) v_main_~y3~0_2))) InVars {main_~x2~0=v_main_~x2~0_1, main_~y3~0=v_main_~y3~0_2, main_~y2~0=v_main_~y2~0_2, main_~y1~0=v_main_~y1~0_2} OutVars{main_~x2~0=v_main_~x2~0_1, main_~y3~0=v_main_~y3~0_1, main_~y2~0=v_main_~y2~0_1, main_~y1~0=v_main_~y1~0_1} AuxVars[] AssignedVars[main_~y3~0, main_~y2~0, main_~y1~0] {1617#(<= ~counter~0 3)} is VALID [2022-04-28 01:09:51,846 INFO L290 TraceCheckUtils]: 44: Hoare triple {1617#(<= ~counter~0 3)} [83] L41-2-->L36-1: Formula: (and (= |v_main_#t~post6_1| v_~counter~0_2) (= v_~counter~0_1 (+ |v_main_#t~post6_1| 1))) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post6] {1645#(<= ~counter~0 4)} is VALID [2022-04-28 01:09:51,847 INFO L290 TraceCheckUtils]: 45: Hoare triple {1645#(<= ~counter~0 4)} [87] L36-1-->L37: Formula: (< |v_main_#t~post6_5| 10) InVars {main_#t~post6=|v_main_#t~post6_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post6] {1645#(<= ~counter~0 4)} is VALID [2022-04-28 01:09:51,847 INFO L272 TraceCheckUtils]: 46: Hoare triple {1645#(<= ~counter~0 4)} [90] L37-->__VERIFIER_assertENTRY: Formula: (= (ite (= v_main_~x1~0_9 (+ (* v_main_~y1~0_7 v_main_~x2~0_10) v_main_~y2~0_9 v_main_~y3~0_10)) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~x2~0=v_main_~x2~0_10, main_~x1~0=v_main_~x1~0_9, main_~y3~0=v_main_~y3~0_10, main_~y2~0=v_main_~y2~0_9, main_~y1~0=v_main_~y1~0_7} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~y3~0, main_~y2~0, main_~y1~0, main_~x2~0, main_~x1~0] {1645#(<= ~counter~0 4)} is VALID [2022-04-28 01:09:51,848 INFO L290 TraceCheckUtils]: 47: Hoare triple {1645#(<= ~counter~0 4)} [89] __VERIFIER_assertENTRY-->L16: Formula: (= v___VERIFIER_assert_~cond_3 |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_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {1645#(<= ~counter~0 4)} is VALID [2022-04-28 01:09:51,848 INFO L290 TraceCheckUtils]: 48: Hoare triple {1645#(<= ~counter~0 4)} [93] L16-->L16-2: Formula: (not (= v___VERIFIER_assert_~cond_2 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {1645#(<= ~counter~0 4)} is VALID [2022-04-28 01:09:51,848 INFO L290 TraceCheckUtils]: 49: Hoare triple {1645#(<= ~counter~0 4)} [98] L16-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1645#(<= ~counter~0 4)} is VALID [2022-04-28 01:09:51,849 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {1645#(<= ~counter~0 4)} {1645#(<= ~counter~0 4)} [105] __VERIFIER_assertEXIT-->L37-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= v_main_~x1~0_9 (+ (* v_main_~y1~0_7 v_main_~x2~0_10) v_main_~y2~0_9 v_main_~y3~0_10)) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~x2~0=v_main_~x2~0_10, main_~x1~0=v_main_~x1~0_9, main_~y3~0=v_main_~y3~0_10, main_~y2~0=v_main_~y2~0_9, main_~y1~0=v_main_~y1~0_7} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~y3~0, main_~y2~0, main_~y1~0, main_~x2~0, main_~x1~0] {1645#(<= ~counter~0 4)} is VALID [2022-04-28 01:09:51,849 INFO L290 TraceCheckUtils]: 51: Hoare triple {1645#(<= ~counter~0 4)} [95] L37-1-->L41: Formula: (not (= v_main_~y3~0_9 0)) InVars {main_~y3~0=v_main_~y3~0_9} OutVars{main_~y3~0=v_main_~y3~0_9} AuxVars[] AssignedVars[] {1645#(<= ~counter~0 4)} is VALID [2022-04-28 01:09:51,850 INFO L290 TraceCheckUtils]: 52: Hoare triple {1645#(<= ~counter~0 4)} [99] L41-->L41-2: Formula: (and (= v_main_~y1~0_1 (+ v_main_~y1~0_2 1)) (= v_main_~y2~0_1 0) (= (+ v_main_~y2~0_2 1) v_main_~x2~0_1) (= v_main_~y3~0_1 (+ (- 1) v_main_~y3~0_2))) InVars {main_~x2~0=v_main_~x2~0_1, main_~y3~0=v_main_~y3~0_2, main_~y2~0=v_main_~y2~0_2, main_~y1~0=v_main_~y1~0_2} OutVars{main_~x2~0=v_main_~x2~0_1, main_~y3~0=v_main_~y3~0_1, main_~y2~0=v_main_~y2~0_1, main_~y1~0=v_main_~y1~0_1} AuxVars[] AssignedVars[main_~y3~0, main_~y2~0, main_~y1~0] {1645#(<= ~counter~0 4)} is VALID [2022-04-28 01:09:51,850 INFO L290 TraceCheckUtils]: 53: Hoare triple {1645#(<= ~counter~0 4)} [83] L41-2-->L36-1: Formula: (and (= |v_main_#t~post6_1| v_~counter~0_2) (= v_~counter~0_1 (+ |v_main_#t~post6_1| 1))) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post6] {1673#(<= |main_#t~post6| 4)} is VALID [2022-04-28 01:09:51,851 INFO L290 TraceCheckUtils]: 54: Hoare triple {1673#(<= |main_#t~post6| 4)} [86] L36-1-->L36-3: Formula: (not (< |v_main_#t~post6_3| 10)) InVars {main_#t~post6=|v_main_#t~post6_3|} OutVars{} AuxVars[] AssignedVars[main_#t~post6] {1505#false} is VALID [2022-04-28 01:09:51,851 INFO L272 TraceCheckUtils]: 55: Hoare triple {1505#false} [85] L36-3-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (= (+ v_main_~y2~0_10 (* v_main_~y1~0_8 v_main_~x2~0_11)) v_main_~x1~0_10) 1 0)) InVars {main_~x2~0=v_main_~x2~0_11, main_~x1~0=v_main_~x1~0_10, main_~y2~0=v_main_~y2~0_10, main_~y1~0=v_main_~y1~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~y2~0, main_~y1~0, main_~x2~0, main_~x1~0] {1505#false} is VALID [2022-04-28 01:09:51,851 INFO L290 TraceCheckUtils]: 56: Hoare triple {1505#false} [89] __VERIFIER_assertENTRY-->L16: Formula: (= v___VERIFIER_assert_~cond_3 |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_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {1505#false} is VALID [2022-04-28 01:09:51,851 INFO L290 TraceCheckUtils]: 57: Hoare triple {1505#false} [92] L16-->L17: Formula: (= v___VERIFIER_assert_~cond_1 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[] {1505#false} is VALID [2022-04-28 01:09:51,851 INFO L290 TraceCheckUtils]: 58: Hoare triple {1505#false} [96] L17-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1505#false} is VALID [2022-04-28 01:09:51,852 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 8 proven. 62 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-28 01:09:51,852 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 01:09:52,204 INFO L290 TraceCheckUtils]: 58: Hoare triple {1505#false} [96] L17-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1505#false} is VALID [2022-04-28 01:09:52,204 INFO L290 TraceCheckUtils]: 57: Hoare triple {1505#false} [92] L16-->L17: Formula: (= v___VERIFIER_assert_~cond_1 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[] {1505#false} is VALID [2022-04-28 01:09:52,204 INFO L290 TraceCheckUtils]: 56: Hoare triple {1505#false} [89] __VERIFIER_assertENTRY-->L16: Formula: (= v___VERIFIER_assert_~cond_3 |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_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {1505#false} is VALID [2022-04-28 01:09:52,204 INFO L272 TraceCheckUtils]: 55: Hoare triple {1505#false} [85] L36-3-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (= (+ v_main_~y2~0_10 (* v_main_~y1~0_8 v_main_~x2~0_11)) v_main_~x1~0_10) 1 0)) InVars {main_~x2~0=v_main_~x2~0_11, main_~x1~0=v_main_~x1~0_10, main_~y2~0=v_main_~y2~0_10, main_~y1~0=v_main_~y1~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~y2~0, main_~y1~0, main_~x2~0, main_~x1~0] {1505#false} is VALID [2022-04-28 01:09:52,205 INFO L290 TraceCheckUtils]: 54: Hoare triple {1701#(< |main_#t~post6| 10)} [86] L36-1-->L36-3: Formula: (not (< |v_main_#t~post6_3| 10)) InVars {main_#t~post6=|v_main_#t~post6_3|} OutVars{} AuxVars[] AssignedVars[main_#t~post6] {1505#false} is VALID [2022-04-28 01:09:52,205 INFO L290 TraceCheckUtils]: 53: Hoare triple {1705#(< ~counter~0 10)} [83] L41-2-->L36-1: Formula: (and (= |v_main_#t~post6_1| v_~counter~0_2) (= v_~counter~0_1 (+ |v_main_#t~post6_1| 1))) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post6] {1701#(< |main_#t~post6| 10)} is VALID [2022-04-28 01:09:52,206 INFO L290 TraceCheckUtils]: 52: Hoare triple {1705#(< ~counter~0 10)} [99] L41-->L41-2: Formula: (and (= v_main_~y1~0_1 (+ v_main_~y1~0_2 1)) (= v_main_~y2~0_1 0) (= (+ v_main_~y2~0_2 1) v_main_~x2~0_1) (= v_main_~y3~0_1 (+ (- 1) v_main_~y3~0_2))) InVars {main_~x2~0=v_main_~x2~0_1, main_~y3~0=v_main_~y3~0_2, main_~y2~0=v_main_~y2~0_2, main_~y1~0=v_main_~y1~0_2} OutVars{main_~x2~0=v_main_~x2~0_1, main_~y3~0=v_main_~y3~0_1, main_~y2~0=v_main_~y2~0_1, main_~y1~0=v_main_~y1~0_1} AuxVars[] AssignedVars[main_~y3~0, main_~y2~0, main_~y1~0] {1705#(< ~counter~0 10)} is VALID [2022-04-28 01:09:52,206 INFO L290 TraceCheckUtils]: 51: Hoare triple {1705#(< ~counter~0 10)} [95] L37-1-->L41: Formula: (not (= v_main_~y3~0_9 0)) InVars {main_~y3~0=v_main_~y3~0_9} OutVars{main_~y3~0=v_main_~y3~0_9} AuxVars[] AssignedVars[] {1705#(< ~counter~0 10)} is VALID [2022-04-28 01:09:52,207 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {1504#true} {1705#(< ~counter~0 10)} [105] __VERIFIER_assertEXIT-->L37-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= v_main_~x1~0_9 (+ (* v_main_~y1~0_7 v_main_~x2~0_10) v_main_~y2~0_9 v_main_~y3~0_10)) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~x2~0=v_main_~x2~0_10, main_~x1~0=v_main_~x1~0_9, main_~y3~0=v_main_~y3~0_10, main_~y2~0=v_main_~y2~0_9, main_~y1~0=v_main_~y1~0_7} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~y3~0, main_~y2~0, main_~y1~0, main_~x2~0, main_~x1~0] {1705#(< ~counter~0 10)} is VALID [2022-04-28 01:09:52,207 INFO L290 TraceCheckUtils]: 49: Hoare triple {1504#true} [98] L16-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1504#true} is VALID [2022-04-28 01:09:52,207 INFO L290 TraceCheckUtils]: 48: Hoare triple {1504#true} [93] L16-->L16-2: Formula: (not (= v___VERIFIER_assert_~cond_2 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {1504#true} is VALID [2022-04-28 01:09:52,207 INFO L290 TraceCheckUtils]: 47: Hoare triple {1504#true} [89] __VERIFIER_assertENTRY-->L16: Formula: (= v___VERIFIER_assert_~cond_3 |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_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {1504#true} is VALID [2022-04-28 01:09:52,207 INFO L272 TraceCheckUtils]: 46: Hoare triple {1705#(< ~counter~0 10)} [90] L37-->__VERIFIER_assertENTRY: Formula: (= (ite (= v_main_~x1~0_9 (+ (* v_main_~y1~0_7 v_main_~x2~0_10) v_main_~y2~0_9 v_main_~y3~0_10)) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~x2~0=v_main_~x2~0_10, main_~x1~0=v_main_~x1~0_9, main_~y3~0=v_main_~y3~0_10, main_~y2~0=v_main_~y2~0_9, main_~y1~0=v_main_~y1~0_7} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~y3~0, main_~y2~0, main_~y1~0, main_~x2~0, main_~x1~0] {1504#true} is VALID [2022-04-28 01:09:52,208 INFO L290 TraceCheckUtils]: 45: Hoare triple {1705#(< ~counter~0 10)} [87] L36-1-->L37: Formula: (< |v_main_#t~post6_5| 10) InVars {main_#t~post6=|v_main_#t~post6_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post6] {1705#(< ~counter~0 10)} is VALID [2022-04-28 01:09:52,208 INFO L290 TraceCheckUtils]: 44: Hoare triple {1733#(< ~counter~0 9)} [83] L41-2-->L36-1: Formula: (and (= |v_main_#t~post6_1| v_~counter~0_2) (= v_~counter~0_1 (+ |v_main_#t~post6_1| 1))) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post6] {1705#(< ~counter~0 10)} is VALID [2022-04-28 01:09:52,209 INFO L290 TraceCheckUtils]: 43: Hoare triple {1733#(< ~counter~0 9)} [99] L41-->L41-2: Formula: (and (= v_main_~y1~0_1 (+ v_main_~y1~0_2 1)) (= v_main_~y2~0_1 0) (= (+ v_main_~y2~0_2 1) v_main_~x2~0_1) (= v_main_~y3~0_1 (+ (- 1) v_main_~y3~0_2))) InVars {main_~x2~0=v_main_~x2~0_1, main_~y3~0=v_main_~y3~0_2, main_~y2~0=v_main_~y2~0_2, main_~y1~0=v_main_~y1~0_2} OutVars{main_~x2~0=v_main_~x2~0_1, main_~y3~0=v_main_~y3~0_1, main_~y2~0=v_main_~y2~0_1, main_~y1~0=v_main_~y1~0_1} AuxVars[] AssignedVars[main_~y3~0, main_~y2~0, main_~y1~0] {1733#(< ~counter~0 9)} is VALID [2022-04-28 01:09:52,209 INFO L290 TraceCheckUtils]: 42: Hoare triple {1733#(< ~counter~0 9)} [95] L37-1-->L41: Formula: (not (= v_main_~y3~0_9 0)) InVars {main_~y3~0=v_main_~y3~0_9} OutVars{main_~y3~0=v_main_~y3~0_9} AuxVars[] AssignedVars[] {1733#(< ~counter~0 9)} is VALID [2022-04-28 01:09:52,211 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {1504#true} {1733#(< ~counter~0 9)} [105] __VERIFIER_assertEXIT-->L37-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= v_main_~x1~0_9 (+ (* v_main_~y1~0_7 v_main_~x2~0_10) v_main_~y2~0_9 v_main_~y3~0_10)) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~x2~0=v_main_~x2~0_10, main_~x1~0=v_main_~x1~0_9, main_~y3~0=v_main_~y3~0_10, main_~y2~0=v_main_~y2~0_9, main_~y1~0=v_main_~y1~0_7} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~y3~0, main_~y2~0, main_~y1~0, main_~x2~0, main_~x1~0] {1733#(< ~counter~0 9)} is VALID [2022-04-28 01:09:52,211 INFO L290 TraceCheckUtils]: 40: Hoare triple {1504#true} [98] L16-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1504#true} is VALID [2022-04-28 01:09:52,211 INFO L290 TraceCheckUtils]: 39: Hoare triple {1504#true} [93] L16-->L16-2: Formula: (not (= v___VERIFIER_assert_~cond_2 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {1504#true} is VALID [2022-04-28 01:09:52,211 INFO L290 TraceCheckUtils]: 38: Hoare triple {1504#true} [89] __VERIFIER_assertENTRY-->L16: Formula: (= v___VERIFIER_assert_~cond_3 |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_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {1504#true} is VALID [2022-04-28 01:09:52,212 INFO L272 TraceCheckUtils]: 37: Hoare triple {1733#(< ~counter~0 9)} [90] L37-->__VERIFIER_assertENTRY: Formula: (= (ite (= v_main_~x1~0_9 (+ (* v_main_~y1~0_7 v_main_~x2~0_10) v_main_~y2~0_9 v_main_~y3~0_10)) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~x2~0=v_main_~x2~0_10, main_~x1~0=v_main_~x1~0_9, main_~y3~0=v_main_~y3~0_10, main_~y2~0=v_main_~y2~0_9, main_~y1~0=v_main_~y1~0_7} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~y3~0, main_~y2~0, main_~y1~0, main_~x2~0, main_~x1~0] {1504#true} is VALID [2022-04-28 01:09:52,212 INFO L290 TraceCheckUtils]: 36: Hoare triple {1733#(< ~counter~0 9)} [87] L36-1-->L37: Formula: (< |v_main_#t~post6_5| 10) InVars {main_#t~post6=|v_main_#t~post6_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post6] {1733#(< ~counter~0 9)} is VALID [2022-04-28 01:09:52,212 INFO L290 TraceCheckUtils]: 35: Hoare triple {1761#(< ~counter~0 8)} [83] L41-2-->L36-1: Formula: (and (= |v_main_#t~post6_1| v_~counter~0_2) (= v_~counter~0_1 (+ |v_main_#t~post6_1| 1))) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post6] {1733#(< ~counter~0 9)} is VALID [2022-04-28 01:09:52,213 INFO L290 TraceCheckUtils]: 34: Hoare triple {1761#(< ~counter~0 8)} [99] L41-->L41-2: Formula: (and (= v_main_~y1~0_1 (+ v_main_~y1~0_2 1)) (= v_main_~y2~0_1 0) (= (+ v_main_~y2~0_2 1) v_main_~x2~0_1) (= v_main_~y3~0_1 (+ (- 1) v_main_~y3~0_2))) InVars {main_~x2~0=v_main_~x2~0_1, main_~y3~0=v_main_~y3~0_2, main_~y2~0=v_main_~y2~0_2, main_~y1~0=v_main_~y1~0_2} OutVars{main_~x2~0=v_main_~x2~0_1, main_~y3~0=v_main_~y3~0_1, main_~y2~0=v_main_~y2~0_1, main_~y1~0=v_main_~y1~0_1} AuxVars[] AssignedVars[main_~y3~0, main_~y2~0, main_~y1~0] {1761#(< ~counter~0 8)} is VALID [2022-04-28 01:09:52,213 INFO L290 TraceCheckUtils]: 33: Hoare triple {1761#(< ~counter~0 8)} [95] L37-1-->L41: Formula: (not (= v_main_~y3~0_9 0)) InVars {main_~y3~0=v_main_~y3~0_9} OutVars{main_~y3~0=v_main_~y3~0_9} AuxVars[] AssignedVars[] {1761#(< ~counter~0 8)} is VALID [2022-04-28 01:09:52,214 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {1504#true} {1761#(< ~counter~0 8)} [105] __VERIFIER_assertEXIT-->L37-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= v_main_~x1~0_9 (+ (* v_main_~y1~0_7 v_main_~x2~0_10) v_main_~y2~0_9 v_main_~y3~0_10)) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~x2~0=v_main_~x2~0_10, main_~x1~0=v_main_~x1~0_9, main_~y3~0=v_main_~y3~0_10, main_~y2~0=v_main_~y2~0_9, main_~y1~0=v_main_~y1~0_7} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~y3~0, main_~y2~0, main_~y1~0, main_~x2~0, main_~x1~0] {1761#(< ~counter~0 8)} is VALID [2022-04-28 01:09:52,214 INFO L290 TraceCheckUtils]: 31: Hoare triple {1504#true} [98] L16-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1504#true} is VALID [2022-04-28 01:09:52,215 INFO L290 TraceCheckUtils]: 30: Hoare triple {1504#true} [93] L16-->L16-2: Formula: (not (= v___VERIFIER_assert_~cond_2 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {1504#true} is VALID [2022-04-28 01:09:52,215 INFO L290 TraceCheckUtils]: 29: Hoare triple {1504#true} [89] __VERIFIER_assertENTRY-->L16: Formula: (= v___VERIFIER_assert_~cond_3 |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_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {1504#true} is VALID [2022-04-28 01:09:52,215 INFO L272 TraceCheckUtils]: 28: Hoare triple {1761#(< ~counter~0 8)} [90] L37-->__VERIFIER_assertENTRY: Formula: (= (ite (= v_main_~x1~0_9 (+ (* v_main_~y1~0_7 v_main_~x2~0_10) v_main_~y2~0_9 v_main_~y3~0_10)) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~x2~0=v_main_~x2~0_10, main_~x1~0=v_main_~x1~0_9, main_~y3~0=v_main_~y3~0_10, main_~y2~0=v_main_~y2~0_9, main_~y1~0=v_main_~y1~0_7} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~y3~0, main_~y2~0, main_~y1~0, main_~x2~0, main_~x1~0] {1504#true} is VALID [2022-04-28 01:09:52,215 INFO L290 TraceCheckUtils]: 27: Hoare triple {1761#(< ~counter~0 8)} [87] L36-1-->L37: Formula: (< |v_main_#t~post6_5| 10) InVars {main_#t~post6=|v_main_#t~post6_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post6] {1761#(< ~counter~0 8)} is VALID [2022-04-28 01:09:52,216 INFO L290 TraceCheckUtils]: 26: Hoare triple {1789#(< ~counter~0 7)} [83] L41-2-->L36-1: Formula: (and (= |v_main_#t~post6_1| v_~counter~0_2) (= v_~counter~0_1 (+ |v_main_#t~post6_1| 1))) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post6] {1761#(< ~counter~0 8)} is VALID [2022-04-28 01:09:52,216 INFO L290 TraceCheckUtils]: 25: Hoare triple {1789#(< ~counter~0 7)} [99] L41-->L41-2: Formula: (and (= v_main_~y1~0_1 (+ v_main_~y1~0_2 1)) (= v_main_~y2~0_1 0) (= (+ v_main_~y2~0_2 1) v_main_~x2~0_1) (= v_main_~y3~0_1 (+ (- 1) v_main_~y3~0_2))) InVars {main_~x2~0=v_main_~x2~0_1, main_~y3~0=v_main_~y3~0_2, main_~y2~0=v_main_~y2~0_2, main_~y1~0=v_main_~y1~0_2} OutVars{main_~x2~0=v_main_~x2~0_1, main_~y3~0=v_main_~y3~0_1, main_~y2~0=v_main_~y2~0_1, main_~y1~0=v_main_~y1~0_1} AuxVars[] AssignedVars[main_~y3~0, main_~y2~0, main_~y1~0] {1789#(< ~counter~0 7)} is VALID [2022-04-28 01:09:52,217 INFO L290 TraceCheckUtils]: 24: Hoare triple {1789#(< ~counter~0 7)} [95] L37-1-->L41: Formula: (not (= v_main_~y3~0_9 0)) InVars {main_~y3~0=v_main_~y3~0_9} OutVars{main_~y3~0=v_main_~y3~0_9} AuxVars[] AssignedVars[] {1789#(< ~counter~0 7)} is VALID [2022-04-28 01:09:52,217 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {1504#true} {1789#(< ~counter~0 7)} [105] __VERIFIER_assertEXIT-->L37-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= v_main_~x1~0_9 (+ (* v_main_~y1~0_7 v_main_~x2~0_10) v_main_~y2~0_9 v_main_~y3~0_10)) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~x2~0=v_main_~x2~0_10, main_~x1~0=v_main_~x1~0_9, main_~y3~0=v_main_~y3~0_10, main_~y2~0=v_main_~y2~0_9, main_~y1~0=v_main_~y1~0_7} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~y3~0, main_~y2~0, main_~y1~0, main_~x2~0, main_~x1~0] {1789#(< ~counter~0 7)} is VALID [2022-04-28 01:09:52,217 INFO L290 TraceCheckUtils]: 22: Hoare triple {1504#true} [98] L16-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1504#true} is VALID [2022-04-28 01:09:52,218 INFO L290 TraceCheckUtils]: 21: Hoare triple {1504#true} [93] L16-->L16-2: Formula: (not (= v___VERIFIER_assert_~cond_2 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {1504#true} is VALID [2022-04-28 01:09:52,218 INFO L290 TraceCheckUtils]: 20: Hoare triple {1504#true} [89] __VERIFIER_assertENTRY-->L16: Formula: (= v___VERIFIER_assert_~cond_3 |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_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {1504#true} is VALID [2022-04-28 01:09:52,218 INFO L272 TraceCheckUtils]: 19: Hoare triple {1789#(< ~counter~0 7)} [90] L37-->__VERIFIER_assertENTRY: Formula: (= (ite (= v_main_~x1~0_9 (+ (* v_main_~y1~0_7 v_main_~x2~0_10) v_main_~y2~0_9 v_main_~y3~0_10)) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~x2~0=v_main_~x2~0_10, main_~x1~0=v_main_~x1~0_9, main_~y3~0=v_main_~y3~0_10, main_~y2~0=v_main_~y2~0_9, main_~y1~0=v_main_~y1~0_7} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~y3~0, main_~y2~0, main_~y1~0, main_~x2~0, main_~x1~0] {1504#true} is VALID [2022-04-28 01:09:52,220 INFO L290 TraceCheckUtils]: 18: Hoare triple {1789#(< ~counter~0 7)} [87] L36-1-->L37: Formula: (< |v_main_#t~post6_5| 10) InVars {main_#t~post6=|v_main_#t~post6_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post6] {1789#(< ~counter~0 7)} is VALID [2022-04-28 01:09:52,221 INFO L290 TraceCheckUtils]: 17: Hoare triple {1817#(< ~counter~0 6)} [83] L41-2-->L36-1: Formula: (and (= |v_main_#t~post6_1| v_~counter~0_2) (= v_~counter~0_1 (+ |v_main_#t~post6_1| 1))) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post6] {1789#(< ~counter~0 7)} is VALID [2022-04-28 01:09:52,221 INFO L290 TraceCheckUtils]: 16: Hoare triple {1817#(< ~counter~0 6)} [79] L30-->L41-2: Formula: (and (= v_main_~y1~0_5 0) (= v_main_~y2~0_7 0) (= v_main_~x1~0_6 v_main_~y3~0_6)) InVars {main_~x1~0=v_main_~x1~0_6} OutVars{main_~x1~0=v_main_~x1~0_6, main_~y3~0=v_main_~y3~0_6, main_~y2~0=v_main_~y2~0_7, main_~y1~0=v_main_~y1~0_5} AuxVars[] AssignedVars[main_~y3~0, main_~y2~0, main_~y1~0] {1817#(< ~counter~0 6)} is VALID [2022-04-28 01:09:52,221 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {1504#true} {1817#(< ~counter~0 6)} [103] assume_abort_if_notEXIT-->L30: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (not (= v_main_~x2~0_9 0)) 1 0)) InVars {main_~x2~0=v_main_~x2~0_9} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_2|} AuxVars[] AssignedVars[main_~x2~0, assume_abort_if_not_#in~cond] {1817#(< ~counter~0 6)} is VALID [2022-04-28 01:09:52,222 INFO L290 TraceCheckUtils]: 14: Hoare triple {1504#true} [84] L13-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1504#true} is VALID [2022-04-28 01:09:52,223 INFO L290 TraceCheckUtils]: 13: Hoare triple {1504#true} [81] L13-->L13-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[] {1504#true} is VALID [2022-04-28 01:09:52,226 INFO L290 TraceCheckUtils]: 12: Hoare triple {1504#true} [78] assume_abort_if_notENTRY-->L13: 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] {1504#true} is VALID [2022-04-28 01:09:52,226 INFO L272 TraceCheckUtils]: 11: Hoare triple {1817#(< ~counter~0 6)} [77] L29-1-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (not (= v_main_~x2~0_9 0)) 1 0)) InVars {main_~x2~0=v_main_~x2~0_9} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_2|} AuxVars[] AssignedVars[main_~x2~0, assume_abort_if_not_#in~cond] {1504#true} is VALID [2022-04-28 01:09:52,226 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1504#true} {1817#(< ~counter~0 6)} [102] assume_abort_if_notEXIT-->L29-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (<= 0 v_main_~x1~0_8) 1 0) |v_assume_abort_if_not_#in~condInParam_1|) InVars {main_~x1~0=v_main_~x1~0_8} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~x1~0, assume_abort_if_not_#in~cond] {1817#(< ~counter~0 6)} is VALID [2022-04-28 01:09:52,227 INFO L290 TraceCheckUtils]: 9: Hoare triple {1504#true} [84] L13-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1504#true} is VALID [2022-04-28 01:09:52,227 INFO L290 TraceCheckUtils]: 8: Hoare triple {1504#true} [81] L13-->L13-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[] {1504#true} is VALID [2022-04-28 01:09:52,227 INFO L290 TraceCheckUtils]: 7: Hoare triple {1504#true} [78] assume_abort_if_notENTRY-->L13: 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] {1504#true} is VALID [2022-04-28 01:09:52,227 INFO L272 TraceCheckUtils]: 6: Hoare triple {1817#(< ~counter~0 6)} [76] L29-->assume_abort_if_notENTRY: Formula: (= (ite (<= 0 v_main_~x1~0_8) 1 0) |v_assume_abort_if_not_#in~condInParam_1|) InVars {main_~x1~0=v_main_~x1~0_8} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~x1~0, assume_abort_if_not_#in~cond] {1504#true} is VALID [2022-04-28 01:09:52,227 INFO L290 TraceCheckUtils]: 5: Hoare triple {1817#(< ~counter~0 6)} [74] mainENTRY-->L29: Formula: (and (<= |v_main_#t~nondet5_2| 2147483647) (= v_main_~x1~0_2 |v_main_#t~nondet4_2|) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= |v_main_#t~nondet4_2| 2147483647) (= v_main_~x2~0_4 |v_main_#t~nondet5_2|) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648))) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|, main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~x2~0=v_main_~x2~0_4, main_~x1~0=v_main_~x1~0_2, main_~y3~0=v_main_~y3~0_5, main_~y2~0=v_main_~y2~0_6, main_~y1~0=v_main_~y1~0_4} AuxVars[] AssignedVars[main_#t~nondet5, main_#t~nondet4, main_~y3~0, main_~y2~0, main_~y1~0, main_~x2~0, main_~x1~0] {1817#(< ~counter~0 6)} is VALID [2022-04-28 01:09:52,228 INFO L272 TraceCheckUtils]: 4: Hoare triple {1817#(< ~counter~0 6)} [71] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1817#(< ~counter~0 6)} is VALID [2022-04-28 01:09:52,228 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1817#(< ~counter~0 6)} {1504#true} [101] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1817#(< ~counter~0 6)} is VALID [2022-04-28 01:09:52,228 INFO L290 TraceCheckUtils]: 2: Hoare triple {1817#(< ~counter~0 6)} [75] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1817#(< ~counter~0 6)} is VALID [2022-04-28 01:09:52,229 INFO L290 TraceCheckUtils]: 1: Hoare triple {1504#true} [72] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= v_~counter~0_3 0) (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (= (select |v_#length_1| 2) 11) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (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{~counter~0=v_~counter~0_3, #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[~counter~0, #NULL.offset, #NULL.base] {1817#(< ~counter~0 6)} is VALID [2022-04-28 01:09:52,229 INFO L272 TraceCheckUtils]: 0: Hoare triple {1504#true} [70] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1504#true} is VALID [2022-04-28 01:09:52,231 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 8 proven. 38 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2022-04-28 01:09:52,231 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 01:09:52,231 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1327371986] [2022-04-28 01:09:52,231 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 01:09:52,232 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [20451962] [2022-04-28 01:09:52,232 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [20451962] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 01:09:52,232 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 01:09:52,232 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 14 [2022-04-28 01:09:52,232 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [138459489] [2022-04-28 01:09:52,232 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-28 01:09:52,234 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 4.857142857142857) internal successors, (68), 14 states have internal predecessors, (68), 12 states have call successors, (16), 8 states have call predecessors, (16), 7 states have return successors, (14), 10 states have call predecessors, (14), 11 states have call successors, (14) Word has length 59 [2022-04-28 01:09:52,236 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 01:09:52,236 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 14 states, 14 states have (on average 4.857142857142857) internal successors, (68), 14 states have internal predecessors, (68), 12 states have call successors, (16), 8 states have call predecessors, (16), 7 states have return successors, (14), 10 states have call predecessors, (14), 11 states have call successors, (14) [2022-04-28 01:09:52,326 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 98 edges. 98 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 01:09:52,326 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-04-28 01:09:52,326 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-28 01:09:52,327 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-04-28 01:09:52,327 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=111, Unknown=0, NotChecked=0, Total=182 [2022-04-28 01:09:52,327 INFO L87 Difference]: Start difference. First operand 56 states and 61 transitions. Second operand has 14 states, 14 states have (on average 4.857142857142857) internal successors, (68), 14 states have internal predecessors, (68), 12 states have call successors, (16), 8 states have call predecessors, (16), 7 states have return successors, (14), 10 states have call predecessors, (14), 11 states have call successors, (14) [2022-04-28 01:09:52,795 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 01:09:52,795 INFO L93 Difference]: Finished difference Result 115 states and 131 transitions. [2022-04-28 01:09:52,795 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-04-28 01:09:52,796 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 4.857142857142857) internal successors, (68), 14 states have internal predecessors, (68), 12 states have call successors, (16), 8 states have call predecessors, (16), 7 states have return successors, (14), 10 states have call predecessors, (14), 11 states have call successors, (14) Word has length 59 [2022-04-28 01:09:52,796 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 01:09:52,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 4.857142857142857) internal successors, (68), 14 states have internal predecessors, (68), 12 states have call successors, (16), 8 states have call predecessors, (16), 7 states have return successors, (14), 10 states have call predecessors, (14), 11 states have call successors, (14) [2022-04-28 01:09:52,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 130 transitions. [2022-04-28 01:09:52,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 4.857142857142857) internal successors, (68), 14 states have internal predecessors, (68), 12 states have call successors, (16), 8 states have call predecessors, (16), 7 states have return successors, (14), 10 states have call predecessors, (14), 11 states have call successors, (14) [2022-04-28 01:09:52,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 130 transitions. [2022-04-28 01:09:52,805 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 22 states and 130 transitions. [2022-04-28 01:09:52,904 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 130 edges. 130 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 01:09:52,907 INFO L225 Difference]: With dead ends: 115 [2022-04-28 01:09:52,907 INFO L226 Difference]: Without dead ends: 110 [2022-04-28 01:09:52,908 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 105 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=184, Invalid=322, Unknown=0, NotChecked=0, Total=506 [2022-04-28 01:09:52,908 INFO L413 NwaCegarLoop]: 35 mSDtfsCounter, 158 mSDsluCounter, 141 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 71 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 158 SdHoareTripleChecker+Valid, 176 SdHoareTripleChecker+Invalid, 120 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 71 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 01:09:52,909 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [158 Valid, 176 Invalid, 120 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [71 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 01:09:52,909 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2022-04-28 01:09:52,956 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 110. [2022-04-28 01:09:52,956 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 01:09:52,957 INFO L82 GeneralOperation]: Start isEquivalent. First operand 110 states. Second operand has 110 states, 82 states have (on average 1.1341463414634145) internal successors, (93), 82 states have internal predecessors, (93), 15 states have call successors, (15), 14 states have call predecessors, (15), 12 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2022-04-28 01:09:52,957 INFO L74 IsIncluded]: Start isIncluded. First operand 110 states. Second operand has 110 states, 82 states have (on average 1.1341463414634145) internal successors, (93), 82 states have internal predecessors, (93), 15 states have call successors, (15), 14 states have call predecessors, (15), 12 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2022-04-28 01:09:52,957 INFO L87 Difference]: Start difference. First operand 110 states. Second operand has 110 states, 82 states have (on average 1.1341463414634145) internal successors, (93), 82 states have internal predecessors, (93), 15 states have call successors, (15), 14 states have call predecessors, (15), 12 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2022-04-28 01:09:52,961 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 01:09:52,961 INFO L93 Difference]: Finished difference Result 110 states and 121 transitions. [2022-04-28 01:09:52,961 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 121 transitions. [2022-04-28 01:09:52,962 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 01:09:52,962 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 01:09:52,962 INFO L74 IsIncluded]: Start isIncluded. First operand has 110 states, 82 states have (on average 1.1341463414634145) internal successors, (93), 82 states have internal predecessors, (93), 15 states have call successors, (15), 14 states have call predecessors, (15), 12 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) Second operand 110 states. [2022-04-28 01:09:52,963 INFO L87 Difference]: Start difference. First operand has 110 states, 82 states have (on average 1.1341463414634145) internal successors, (93), 82 states have internal predecessors, (93), 15 states have call successors, (15), 14 states have call predecessors, (15), 12 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) Second operand 110 states. [2022-04-28 01:09:52,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 01:09:52,966 INFO L93 Difference]: Finished difference Result 110 states and 121 transitions. [2022-04-28 01:09:52,967 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 121 transitions. [2022-04-28 01:09:52,967 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 01:09:52,967 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 01:09:52,967 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 01:09:52,967 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 01:09:52,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 110 states, 82 states have (on average 1.1341463414634145) internal successors, (93), 82 states have internal predecessors, (93), 15 states have call successors, (15), 14 states have call predecessors, (15), 12 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2022-04-28 01:09:52,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 121 transitions. [2022-04-28 01:09:52,971 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 121 transitions. Word has length 59 [2022-04-28 01:09:52,971 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 01:09:52,971 INFO L495 AbstractCegarLoop]: Abstraction has 110 states and 121 transitions. [2022-04-28 01:09:52,971 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 4.857142857142857) internal successors, (68), 14 states have internal predecessors, (68), 12 states have call successors, (16), 8 states have call predecessors, (16), 7 states have return successors, (14), 10 states have call predecessors, (14), 11 states have call successors, (14) [2022-04-28 01:09:52,972 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 121 transitions. [2022-04-28 01:09:52,973 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2022-04-28 01:09:52,973 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 01:09:52,974 INFO L195 NwaCegarLoop]: trace histogram [11, 11, 10, 10, 10, 10, 10, 10, 10, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 01:09:53,002 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-04-28 01:09:53,199 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 01:09:53,199 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 01:09:53,200 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 01:09:53,200 INFO L85 PathProgramCache]: Analyzing trace with hash 191644600, now seen corresponding path program 3 times [2022-04-28 01:09:53,200 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 01:09:53,200 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [488121826] [2022-04-28 01:09:53,200 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 01:09:53,200 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 01:09:53,219 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 01:09:53,219 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [627144502] [2022-04-28 01:09:53,219 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-04-28 01:09:53,220 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 01:09:53,220 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 01:09:53,221 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 01:09:53,227 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-04-28 01:09:53,317 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2022-04-28 01:09:53,317 INFO L229 tOrderPrioritization]: Conjunction of SSA is sat [2022-04-28 01:09:53,318 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-04-28 01:09:53,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-28 01:09:53,428 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-04-28 01:09:53,428 INFO L271 BasicCegarLoop]: Counterexample is feasible [2022-04-28 01:09:53,429 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-04-28 01:09:53,483 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2022-04-28 01:09:53,630 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 01:09:53,633 INFO L356 BasicCegarLoop]: Path program histogram: [3, 1, 1, 1, 1] [2022-04-28 01:09:53,636 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-04-28 01:09:53,696 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2022-04-28 01:09:53,696 WARN L170 areAnnotationChecker]: ULTIMATE.initENTRY has no Hoare annotation [2022-04-28 01:09:53,696 WARN L170 areAnnotationChecker]: mainENTRY has no Hoare annotation [2022-04-28 01:09:53,696 WARN L170 areAnnotationChecker]: assume_abort_if_notENTRY has no Hoare annotation [2022-04-28 01:09:53,696 WARN L170 areAnnotationChecker]: __VERIFIER_assertENTRY has no Hoare annotation [2022-04-28 01:09:53,696 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2022-04-28 01:09:53,696 WARN L170 areAnnotationChecker]: L29 has no Hoare annotation [2022-04-28 01:09:53,696 WARN L170 areAnnotationChecker]: L13 has no Hoare annotation [2022-04-28 01:09:53,696 WARN L170 areAnnotationChecker]: L13 has no Hoare annotation [2022-04-28 01:09:53,696 WARN L170 areAnnotationChecker]: L16 has no Hoare annotation [2022-04-28 01:09:53,696 WARN L170 areAnnotationChecker]: L16 has no Hoare annotation [2022-04-28 01:09:53,696 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2022-04-28 01:09:53,696 WARN L170 areAnnotationChecker]: L13-2 has no Hoare annotation [2022-04-28 01:09:53,696 WARN L170 areAnnotationChecker]: L17 has no Hoare annotation [2022-04-28 01:09:53,696 WARN L170 areAnnotationChecker]: L17 has no Hoare annotation [2022-04-28 01:09:53,696 WARN L170 areAnnotationChecker]: L16-2 has no Hoare annotation [2022-04-28 01:09:53,697 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2022-04-28 01:09:53,697 WARN L170 areAnnotationChecker]: assume_abort_if_notEXIT has no Hoare annotation [2022-04-28 01:09:53,697 WARN L170 areAnnotationChecker]: assume_abort_if_notEXIT has no Hoare annotation [2022-04-28 01:09:53,697 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-28 01:09:53,697 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-28 01:09:53,697 WARN L170 areAnnotationChecker]: L29-1 has no Hoare annotation [2022-04-28 01:09:53,697 WARN L170 areAnnotationChecker]: L30 has no Hoare annotation [2022-04-28 01:09:53,697 WARN L170 areAnnotationChecker]: L37-1 has no Hoare annotation [2022-04-28 01:09:53,697 WARN L170 areAnnotationChecker]: L37-1 has no Hoare annotation [2022-04-28 01:09:53,697 WARN L170 areAnnotationChecker]: L50 has no Hoare annotation [2022-04-28 01:09:53,697 WARN L170 areAnnotationChecker]: L41-2 has no Hoare annotation [2022-04-28 01:09:53,697 WARN L170 areAnnotationChecker]: L41-2 has no Hoare annotation [2022-04-28 01:09:53,697 WARN L170 areAnnotationChecker]: L36-3 has no Hoare annotation [2022-04-28 01:09:53,697 WARN L170 areAnnotationChecker]: L41 has no Hoare annotation [2022-04-28 01:09:53,697 WARN L170 areAnnotationChecker]: L41 has no Hoare annotation [2022-04-28 01:09:53,697 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2022-04-28 01:09:53,697 WARN L170 areAnnotationChecker]: L36-1 has no Hoare annotation [2022-04-28 01:09:53,697 WARN L170 areAnnotationChecker]: L36-1 has no Hoare annotation [2022-04-28 01:09:53,697 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2022-04-28 01:09:53,697 WARN L170 areAnnotationChecker]: L37 has no Hoare annotation [2022-04-28 01:09:53,697 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2022-04-28 01:09:53,697 INFO L163 areAnnotationChecker]: CFG has 0 edges. 0 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2022-04-28 01:09:53,698 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.04 01:09:53 BasicIcfg [2022-04-28 01:09:53,698 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-04-28 01:09:53,699 INFO L158 Benchmark]: Toolchain (without parser) took 11979.45ms. Allocated memory was 176.2MB in the beginning and 213.9MB in the end (delta: 37.7MB). Free memory was 128.2MB in the beginning and 111.2MB in the end (delta: 17.0MB). Peak memory consumption was 54.8MB. Max. memory is 8.0GB. [2022-04-28 01:09:53,699 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 176.2MB. Free memory was 144.6MB in the beginning and 144.5MB in the end (delta: 88.4kB). There was no memory consumed. Max. memory is 8.0GB. [2022-04-28 01:09:53,700 INFO L158 Benchmark]: CACSL2BoogieTranslator took 208.39ms. Allocated memory is still 176.2MB. Free memory was 128.0MB in the beginning and 155.9MB in the end (delta: -27.9MB). Peak memory consumption was 9.4MB. Max. memory is 8.0GB. [2022-04-28 01:09:53,700 INFO L158 Benchmark]: Boogie Preprocessor took 23.38ms. Allocated memory is still 176.2MB. Free memory was 155.9MB in the beginning and 154.4MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-04-28 01:09:53,700 INFO L158 Benchmark]: RCFGBuilder took 215.48ms. Allocated memory is still 176.2MB. Free memory was 154.4MB in the beginning and 143.4MB in the end (delta: 11.1MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. [2022-04-28 01:09:53,700 INFO L158 Benchmark]: IcfgTransformer took 24.74ms. Allocated memory is still 176.2MB. Free memory was 143.4MB in the beginning and 141.9MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-04-28 01:09:53,701 INFO L158 Benchmark]: TraceAbstraction took 11498.43ms. Allocated memory was 176.2MB in the beginning and 213.9MB in the end (delta: 37.7MB). Free memory was 141.3MB in the beginning and 111.2MB in the end (delta: 30.1MB). Peak memory consumption was 68.7MB. Max. memory is 8.0GB. [2022-04-28 01:09:53,702 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - AssertionsEnabledResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.13ms. Allocated memory is still 176.2MB. Free memory was 144.6MB in the beginning and 144.5MB in the end (delta: 88.4kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 208.39ms. Allocated memory is still 176.2MB. Free memory was 128.0MB in the beginning and 155.9MB in the end (delta: -27.9MB). Peak memory consumption was 9.4MB. Max. memory is 8.0GB. * Boogie Preprocessor took 23.38ms. Allocated memory is still 176.2MB. Free memory was 155.9MB in the beginning and 154.4MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 215.48ms. Allocated memory is still 176.2MB. Free memory was 154.4MB in the beginning and 143.4MB in the end (delta: 11.1MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. * IcfgTransformer took 24.74ms. Allocated memory is still 176.2MB. Free memory was 143.4MB in the beginning and 141.9MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * TraceAbstraction took 11498.43ms. Allocated memory was 176.2MB in the beginning and 213.9MB in the end (delta: 37.7MB). Free memory was 141.3MB in the beginning and 111.2MB in the end (delta: 30.1MB). Peak memory consumption was 68.7MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L22] int counter = 0; VAL [\old(counter)=13, counter=0] [L24] int x1, x2; [L25] int y1, y2, y3; [L26] x1 = __VERIFIER_nondet_int() [L27] x2 = __VERIFIER_nondet_int() [L29] CALL assume_abort_if_not(x1 >= 0) VAL [\old(cond)=1, \old(counter)=0, counter=0] [L13] COND FALSE !(!cond) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=0] [L29] RET assume_abort_if_not(x1 >= 0) VAL [\old(counter)=0, counter=0, x1=11, x2=1] [L30] CALL assume_abort_if_not(x2 != 0) VAL [\old(cond)=1, \old(counter)=0, counter=0] [L13] COND FALSE !(!cond) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=0] [L30] RET assume_abort_if_not(x2 != 0) VAL [\old(counter)=0, counter=0, x1=11, x2=1] [L32] y1 = 0 [L33] y2 = 0 [L34] y3 = x1 VAL [\old(counter)=0, counter=0, x1=11, x2=1, y1=0, y2=0, y3=11] [L36] EXPR counter++ VAL [\old(counter)=0, counter=1, counter++=0, x1=11, x2=1, y1=0, y2=0, y3=11] [L36] COND TRUE counter++<10 [L37] CALL __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [\old(cond)=1, \old(counter)=0, counter=1] [L16] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=1] [L37] RET __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [\old(counter)=0, counter=1, x1=11, x2=1, y1=0, y2=0, y3=11] [L39] COND FALSE !(!(y3 != 0)) VAL [\old(counter)=0, counter=1, x1=11, x2=1, y1=0, y2=0, y3=11] [L41] COND TRUE y2 + 1 == x2 [L42] y1 = y1 + 1 [L43] y2 = 0 [L44] y3 = y3 - 1 VAL [\old(counter)=0, counter=1, x1=11, x2=1, y1=1, y2=0, y3=10] [L36] EXPR counter++ VAL [\old(counter)=0, counter=2, counter++=1, x1=11, x2=1, y1=1, y2=0, y3=10] [L36] COND TRUE counter++<10 [L37] CALL __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [\old(cond)=1, \old(counter)=0, counter=2] [L16] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=2] [L37] RET __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [\old(counter)=0, counter=2, x1=11, x2=1, y1=1, y2=0, y3=10] [L39] COND FALSE !(!(y3 != 0)) VAL [\old(counter)=0, counter=2, x1=11, x2=1, y1=1, y2=0, y3=10] [L41] COND TRUE y2 + 1 == x2 [L42] y1 = y1 + 1 [L43] y2 = 0 [L44] y3 = y3 - 1 VAL [\old(counter)=0, counter=2, x1=11, x2=1, y1=2, y2=0, y3=9] [L36] EXPR counter++ VAL [\old(counter)=0, counter=3, counter++=2, x1=11, x2=1, y1=2, y2=0, y3=9] [L36] COND TRUE counter++<10 [L37] CALL __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [\old(cond)=1, \old(counter)=0, counter=3] [L16] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=3] [L37] RET __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [\old(counter)=0, counter=3, x1=11, x2=1, y1=2, y2=0, y3=9] [L39] COND FALSE !(!(y3 != 0)) VAL [\old(counter)=0, counter=3, x1=11, x2=1, y1=2, y2=0, y3=9] [L41] COND TRUE y2 + 1 == x2 [L42] y1 = y1 + 1 [L43] y2 = 0 [L44] y3 = y3 - 1 VAL [\old(counter)=0, counter=3, x1=11, x2=1, y1=3, y2=0, y3=8] [L36] EXPR counter++ VAL [\old(counter)=0, counter=4, counter++=3, x1=11, x2=1, y1=3, y2=0, y3=8] [L36] COND TRUE counter++<10 [L37] CALL __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [\old(cond)=1, \old(counter)=0, counter=4] [L16] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=4] [L37] RET __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [\old(counter)=0, counter=4, x1=11, x2=1, y1=3, y2=0, y3=8] [L39] COND FALSE !(!(y3 != 0)) VAL [\old(counter)=0, counter=4, x1=11, x2=1, y1=3, y2=0, y3=8] [L41] COND TRUE y2 + 1 == x2 [L42] y1 = y1 + 1 [L43] y2 = 0 [L44] y3 = y3 - 1 VAL [\old(counter)=0, counter=4, x1=11, x2=1, y1=4, y2=0, y3=7] [L36] EXPR counter++ VAL [\old(counter)=0, counter=5, counter++=4, x1=11, x2=1, y1=4, y2=0, y3=7] [L36] COND TRUE counter++<10 [L37] CALL __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [\old(cond)=1, \old(counter)=0, counter=5] [L16] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=5] [L37] RET __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [\old(counter)=0, counter=5, x1=11, x2=1, y1=4, y2=0, y3=7] [L39] COND FALSE !(!(y3 != 0)) VAL [\old(counter)=0, counter=5, x1=11, x2=1, y1=4, y2=0, y3=7] [L41] COND TRUE y2 + 1 == x2 [L42] y1 = y1 + 1 [L43] y2 = 0 [L44] y3 = y3 - 1 VAL [\old(counter)=0, counter=5, x1=11, x2=1, y1=5, y2=0, y3=6] [L36] EXPR counter++ VAL [\old(counter)=0, counter=6, counter++=5, x1=11, x2=1, y1=5, y2=0, y3=6] [L36] COND TRUE counter++<10 [L37] CALL __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [\old(cond)=1, \old(counter)=0, counter=6] [L16] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=6] [L37] RET __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [\old(counter)=0, counter=6, x1=11, x2=1, y1=5, y2=0, y3=6] [L39] COND FALSE !(!(y3 != 0)) VAL [\old(counter)=0, counter=6, x1=11, x2=1, y1=5, y2=0, y3=6] [L41] COND TRUE y2 + 1 == x2 [L42] y1 = y1 + 1 [L43] y2 = 0 [L44] y3 = y3 - 1 VAL [\old(counter)=0, counter=6, x1=11, x2=1, y1=6, y2=0, y3=5] [L36] EXPR counter++ VAL [\old(counter)=0, counter=7, counter++=6, x1=11, x2=1, y1=6, y2=0, y3=5] [L36] COND TRUE counter++<10 [L37] CALL __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [\old(cond)=1, \old(counter)=0, counter=7] [L16] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=7] [L37] RET __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [\old(counter)=0, counter=7, x1=11, x2=1, y1=6, y2=0, y3=5] [L39] COND FALSE !(!(y3 != 0)) VAL [\old(counter)=0, counter=7, x1=11, x2=1, y1=6, y2=0, y3=5] [L41] COND TRUE y2 + 1 == x2 [L42] y1 = y1 + 1 [L43] y2 = 0 [L44] y3 = y3 - 1 VAL [\old(counter)=0, counter=7, x1=11, x2=1, y1=7, y2=0, y3=4] [L36] EXPR counter++ VAL [\old(counter)=0, counter=8, counter++=7, x1=11, x2=1, y1=7, y2=0, y3=4] [L36] COND TRUE counter++<10 [L37] CALL __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [\old(cond)=1, \old(counter)=0, counter=8] [L16] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=8] [L37] RET __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [\old(counter)=0, counter=8, x1=11, x2=1, y1=7, y2=0, y3=4] [L39] COND FALSE !(!(y3 != 0)) VAL [\old(counter)=0, counter=8, x1=11, x2=1, y1=7, y2=0, y3=4] [L41] COND TRUE y2 + 1 == x2 [L42] y1 = y1 + 1 [L43] y2 = 0 [L44] y3 = y3 - 1 VAL [\old(counter)=0, counter=8, x1=11, x2=1, y1=8, y2=0, y3=3] [L36] EXPR counter++ VAL [\old(counter)=0, counter=9, counter++=8, x1=11, x2=1, y1=8, y2=0, y3=3] [L36] COND TRUE counter++<10 [L37] CALL __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [\old(cond)=1, \old(counter)=0, counter=9] [L16] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=9] [L37] RET __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [\old(counter)=0, counter=9, x1=11, x2=1, y1=8, y2=0, y3=3] [L39] COND FALSE !(!(y3 != 0)) VAL [\old(counter)=0, counter=9, x1=11, x2=1, y1=8, y2=0, y3=3] [L41] COND TRUE y2 + 1 == x2 [L42] y1 = y1 + 1 [L43] y2 = 0 [L44] y3 = y3 - 1 VAL [\old(counter)=0, counter=9, x1=11, x2=1, y1=9, y2=0, y3=2] [L36] EXPR counter++ VAL [\old(counter)=0, counter=10, counter++=9, x1=11, x2=1, y1=9, y2=0, y3=2] [L36] COND TRUE counter++<10 [L37] CALL __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [\old(cond)=1, \old(counter)=0, counter=10] [L16] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=10] [L37] RET __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [\old(counter)=0, counter=10, x1=11, x2=1, y1=9, y2=0, y3=2] [L39] COND FALSE !(!(y3 != 0)) VAL [\old(counter)=0, counter=10, x1=11, x2=1, y1=9, y2=0, y3=2] [L41] COND TRUE y2 + 1 == x2 [L42] y1 = y1 + 1 [L43] y2 = 0 [L44] y3 = y3 - 1 VAL [\old(counter)=0, counter=10, x1=11, x2=1, y1=10, y2=0, y3=1] [L36] EXPR counter++ VAL [\old(counter)=0, counter=11, counter++=10, x1=11, x2=1, y1=10, y2=0, y3=1] [L36] COND FALSE !(counter++<10) [L50] CALL __VERIFIER_assert(y1*x2 + y2 == x1) VAL [\old(cond)=0, \old(counter)=0, counter=11] [L16] COND TRUE !(cond) VAL [\old(cond)=0, \old(counter)=0, cond=0, counter=11] [L18] reach_error() VAL [\old(cond)=0, \old(counter)=0, cond=0, counter=11] - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 30 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 11.4s, OverallIterations: 7, TraceHistogramMax: 11, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 1.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 253 SdHoareTripleChecker+Valid, 0.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 249 mSDsluCounter, 612 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 449 mSDsCounter, 109 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 231 IncrementalHoareTripleChecker+Invalid, 340 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 109 mSolverCounterUnsat, 163 mSDtfsCounter, 231 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 308 GetRequests, 255 SyntacticMatches, 1 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 77 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=110occurred in iteration=6, InterpolantAutomatonStates: 55, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 6 MinimizatonAttempts, 9 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 7.0s InterpolantComputationTime, 301 NumberOfCodeBlocks, 301 NumberOfCodeBlocksAsserted, 18 NumberOfCheckSat, 299 ConstructedInterpolants, 0 QuantifiedInterpolants, 699 SizeOfPredicates, 18 NumberOfNonLiveVariables, 591 ConjunctsInSsa, 49 ConjunctsInUnsatCore, 9 InterpolantComputations, 3 PerfectInterpolantSequences, 82/188 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 RESULT: Ultimate proved your program to be incorrect! [2022-04-28 01:09:53,719 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...