/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/fermat2-ll_unwindbound5.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-e106359-m [2022-04-15 03:09:19,021 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-15 03:09:19,023 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-15 03:09:19,056 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-15 03:09:19,057 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-15 03:09:19,058 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-15 03:09:19,061 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-15 03:09:19,066 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-15 03:09:19,068 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-15 03:09:19,072 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-15 03:09:19,073 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-15 03:09:19,074 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-15 03:09:19,075 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-15 03:09:19,077 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-15 03:09:19,078 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-15 03:09:19,081 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-15 03:09:19,081 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-15 03:09:19,082 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-15 03:09:19,084 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-15 03:09:19,089 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-15 03:09:19,091 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-15 03:09:19,092 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-15 03:09:19,093 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-15 03:09:19,094 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-15 03:09:19,095 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-15 03:09:19,104 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-15 03:09:19,105 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-15 03:09:19,105 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-15 03:09:19,106 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-15 03:09:19,106 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-15 03:09:19,108 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-15 03:09:19,108 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-15 03:09:19,110 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-15 03:09:19,110 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-15 03:09:19,111 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-15 03:09:19,112 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-15 03:09:19,112 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-15 03:09:19,112 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-15 03:09:19,113 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-15 03:09:19,113 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-15 03:09:19,113 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-15 03:09:19,114 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-15 03:09:19,115 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/loopacceleration/qvasr/qvasr_64.epf [2022-04-15 03:09:19,144 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-15 03:09:19,145 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-15 03:09:19,146 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-04-15 03:09:19,146 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-04-15 03:09:19,147 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-04-15 03:09:19,147 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-04-15 03:09:19,147 INFO L138 SettingsManager]: * Use SBE=true [2022-04-15 03:09:19,147 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-15 03:09:19,148 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-15 03:09:19,148 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-15 03:09:19,148 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-15 03:09:19,149 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-15 03:09:19,149 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-15 03:09:19,149 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-15 03:09:19,149 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-15 03:09:19,149 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-15 03:09:19,149 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-15 03:09:19,149 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-15 03:09:19,149 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-15 03:09:19,149 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-15 03:09:19,150 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-15 03:09:19,150 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-04-15 03:09:19,150 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-04-15 03:09:19,150 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-04-15 03:09:19,150 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-04-15 03:09:19,151 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-15 03:09:19,151 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-04-15 03:09:19,151 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-04-15 03:09:19,153 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-04-15 03:09:19,153 INFO L138 SettingsManager]: * TransformationType=LOOP_ACCELERATION_QVASR WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.core: Log level for class -> de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN; [2022-04-15 03:09:19,373 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-15 03:09:19,395 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-15 03:09:19,397 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-15 03:09:19,398 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-15 03:09:19,399 INFO L275 PluginConnector]: CDTParser initialized [2022-04-15 03:09:19,400 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/nla-digbench-scaling/fermat2-ll_unwindbound5.c [2022-04-15 03:09:19,463 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4f4e83677/2e57d3a790bd419b9127fe24bb522f02/FLAG30b6f2260 [2022-04-15 03:09:19,960 INFO L306 CDTParser]: Found 1 translation units. [2022-04-15 03:09:19,960 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/fermat2-ll_unwindbound5.c [2022-04-15 03:09:19,966 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4f4e83677/2e57d3a790bd419b9127fe24bb522f02/FLAG30b6f2260 [2022-04-15 03:09:20,328 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4f4e83677/2e57d3a790bd419b9127fe24bb522f02 [2022-04-15 03:09:20,331 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-15 03:09:20,337 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-04-15 03:09:20,358 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-15 03:09:20,358 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-15 03:09:20,361 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-15 03:09:20,362 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.04 03:09:20" (1/1) ... [2022-04-15 03:09:20,363 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5bbeb9a8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 03:09:20, skipping insertion in model container [2022-04-15 03:09:20,363 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.04 03:09:20" (1/1) ... [2022-04-15 03:09:20,370 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-15 03:09:20,386 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-15 03:09:20,551 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/fermat2-ll_unwindbound5.c[524,537] [2022-04-15 03:09:20,594 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-15 03:09:20,601 INFO L203 MainTranslator]: Completed pre-run [2022-04-15 03:09:20,611 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/fermat2-ll_unwindbound5.c[524,537] [2022-04-15 03:09:20,618 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-15 03:09:20,631 INFO L208 MainTranslator]: Completed translation [2022-04-15 03:09:20,632 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 03:09:20 WrapperNode [2022-04-15 03:09:20,632 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-15 03:09:20,633 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-15 03:09:20,633 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-15 03:09:20,633 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-15 03:09:20,646 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 03:09:20" (1/1) ... [2022-04-15 03:09:20,646 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 03:09:20" (1/1) ... [2022-04-15 03:09:20,652 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 03:09:20" (1/1) ... [2022-04-15 03:09:20,652 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 03:09:20" (1/1) ... [2022-04-15 03:09:20,658 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 03:09:20" (1/1) ... [2022-04-15 03:09:20,662 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 03:09:20" (1/1) ... [2022-04-15 03:09:20,663 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 03:09:20" (1/1) ... [2022-04-15 03:09:20,665 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-15 03:09:20,666 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-15 03:09:20,666 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-15 03:09:20,666 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-15 03:09:20,667 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 03:09:20" (1/1) ... [2022-04-15 03:09:20,672 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-15 03:09:20,681 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 03:09:20,691 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-04-15 03:09:20,695 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-04-15 03:09:20,723 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-15 03:09:20,723 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-15 03:09:20,724 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-15 03:09:20,724 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-15 03:09:20,724 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-15 03:09:20,724 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-15 03:09:20,724 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-15 03:09:20,724 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-15 03:09:20,724 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-15 03:09:20,725 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-15 03:09:20,725 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-04-15 03:09:20,725 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-15 03:09:20,725 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-15 03:09:20,725 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-15 03:09:20,725 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-15 03:09:20,725 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-15 03:09:20,725 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-15 03:09:20,725 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-15 03:09:20,726 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-15 03:09:20,726 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-15 03:09:20,783 INFO L234 CfgBuilder]: Building ICFG [2022-04-15 03:09:20,787 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-15 03:09:20,993 INFO L275 CfgBuilder]: Performing block encoding [2022-04-15 03:09:21,000 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-15 03:09:21,000 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-15 03:09:21,002 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.04 03:09:21 BoogieIcfgContainer [2022-04-15 03:09:21,002 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-15 03:09:21,004 INFO L113 PluginConnector]: ------------------------IcfgTransformer---------------------------- [2022-04-15 03:09:21,004 INFO L271 PluginConnector]: Initializing IcfgTransformer... [2022-04-15 03:09:21,016 INFO L275 PluginConnector]: IcfgTransformer initialized [2022-04-15 03:09:21,021 INFO L185 PluginConnector]: Executing the observer IcfgTransformationObserver from plugin IcfgTransformer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.04 03:09:21" (1/1) ... [2022-04-15 03:09:21,023 INFO L168 ansformationObserver]: Applying ICFG transformation LOOP_ACCELERATION_QVASR [2022-04-15 03:09:21,068 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 15.04 03:09:21 BasicIcfg [2022-04-15 03:09:21,069 INFO L132 PluginConnector]: ------------------------ END IcfgTransformer---------------------------- [2022-04-15 03:09:21,070 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-15 03:09:21,070 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-15 03:09:21,083 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-15 03:09:21,083 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.04 03:09:20" (1/4) ... [2022-04-15 03:09:21,084 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@8d0aa86 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.04 03:09:21, skipping insertion in model container [2022-04-15 03:09:21,084 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 03:09:20" (2/4) ... [2022-04-15 03:09:21,084 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@8d0aa86 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.04 03:09:21, skipping insertion in model container [2022-04-15 03:09:21,085 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.04 03:09:21" (3/4) ... [2022-04-15 03:09:21,085 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@8d0aa86 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.04 03:09:21, skipping insertion in model container [2022-04-15 03:09:21,085 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 15.04 03:09:21" (4/4) ... [2022-04-15 03:09:21,086 INFO L111 eAbstractionObserver]: Analyzing ICFG fermat2-ll_unwindbound5.cqvasr [2022-04-15 03:09:21,090 INFO L202 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-04-15 03:09:21,091 INFO L161 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-15 03:09:21,180 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-15 03:09:21,194 INFO L340 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP [2022-04-15 03:09:21,194 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-15 03:09:21,217 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-15 03:09:21,222 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-04-15 03:09:21,222 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 03:09:21,223 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 03:09:21,224 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 03:09:21,232 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 03:09:21,233 INFO L85 PathProgramCache]: Analyzing trace with hash 734203501, now seen corresponding path program 1 times [2022-04-15 03:09:21,241 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 03:09:21,242 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [421209926] [2022-04-15 03:09:21,243 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 03:09:21,244 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 03:09:21,362 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 03:09:21,363 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [653165304] [2022-04-15 03:09:21,363 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 03:09:21,363 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 03:09:21,364 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 03:09:21,366 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 03:09:21,368 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-04-15 03:09:21,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 03:09:21,460 INFO L263 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 1 conjunts are in the unsatisfiable core [2022-04-15 03:09:21,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 03:09:21,479 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 03:09:21,609 INFO L272 TraceCheckUtils]: 0: Hoare triple {33#true} [70] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {33#true} is VALID [2022-04-15 03:09:21,612 INFO L290 TraceCheckUtils]: 1: Hoare triple {33#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) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#length_1| 2) 13) (= (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-15 03:09:21,612 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-15 03:09:21,613 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-15 03:09:21,613 INFO L272 TraceCheckUtils]: 4: Hoare triple {33#true} [71] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {33#true} is VALID [2022-04-15 03:09:21,614 INFO L290 TraceCheckUtils]: 5: Hoare triple {33#true} [74] mainENTRY-->L26: Formula: (and (<= |v_main_#t~nondet5_2| 2147483647) (= v_main_~R~0_1 |v_main_#t~nondet5_2|) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= |v_main_#t~nondet4_2| 2147483647) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648)) (= v_main_~A~0_2 |v_main_#t~nondet4_2|)) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|, main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~v~0=v_main_~v~0_4, main_~A~0=v_main_~A~0_2, main_~R~0=v_main_~R~0_1, main_~u~0=v_main_~u~0_4, main_~r~0=v_main_~r~0_5} AuxVars[] AssignedVars[main_#t~nondet5, main_#t~nondet4, main_~v~0, main_~A~0, main_~R~0, main_~u~0, main_~r~0] {33#true} is VALID [2022-04-15 03:09:21,616 INFO L272 TraceCheckUtils]: 6: Hoare triple {33#true} [76] L26-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (< (+ (* v_main_~R~0_6 v_main_~R~0_6) 1) (+ (* v_main_~R~0_6 2) v_main_~A~0_9)) 1 0)) InVars {main_~A~0=v_main_~A~0_9, main_~R~0=v_main_~R~0_6} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~A~0, assume_abort_if_not_#in~cond, main_~R~0] {33#true} is VALID [2022-04-15 03:09:21,616 INFO L290 TraceCheckUtils]: 7: Hoare triple {33#true} [78] assume_abort_if_notENTRY-->L9: 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-15 03:09:21,617 INFO L290 TraceCheckUtils]: 8: Hoare triple {33#true} [80] L9-->L9-2: Formula: false InVars {} OutVars{} AuxVars[] AssignedVars[] {34#false} is VALID [2022-04-15 03:09:21,617 INFO L290 TraceCheckUtils]: 9: Hoare triple {34#false} [84] L9-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {34#false} is VALID [2022-04-15 03:09:21,618 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {34#false} {33#true} [102] assume_abort_if_notEXIT-->L26-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (< (+ (* v_main_~R~0_6 v_main_~R~0_6) 1) (+ (* v_main_~R~0_6 2) v_main_~A~0_9)) 1 0)) InVars {main_~A~0=v_main_~A~0_9, main_~R~0=v_main_~R~0_6} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~A~0, assume_abort_if_not_#in~cond, main_~R~0] {34#false} is VALID [2022-04-15 03:09:21,618 INFO L272 TraceCheckUtils]: 11: Hoare triple {34#false} [77] L26-1-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (= (let ((.cse0 (mod v_main_~A~0_10 2))) (ite (and (not (= .cse0 0)) (< v_main_~A~0_10 0)) (+ (- 2) .cse0) .cse0)) 1) 1 0)) InVars {main_~A~0=v_main_~A~0_10} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_2|} AuxVars[] AssignedVars[main_~A~0, assume_abort_if_not_#in~cond] {34#false} is VALID [2022-04-15 03:09:21,619 INFO L290 TraceCheckUtils]: 12: Hoare triple {34#false} [78] assume_abort_if_notENTRY-->L9: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {34#false} is VALID [2022-04-15 03:09:21,623 INFO L290 TraceCheckUtils]: 13: Hoare triple {34#false} [80] L9-->L9-2: Formula: false InVars {} OutVars{} AuxVars[] AssignedVars[] {34#false} is VALID [2022-04-15 03:09:21,623 INFO L290 TraceCheckUtils]: 14: Hoare triple {34#false} [84] L9-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {34#false} is VALID [2022-04-15 03:09:21,624 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {34#false} {34#false} [103] assume_abort_if_notEXIT-->L28: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (= (let ((.cse0 (mod v_main_~A~0_10 2))) (ite (and (not (= .cse0 0)) (< v_main_~A~0_10 0)) (+ (- 2) .cse0) .cse0)) 1) 1 0)) InVars {main_~A~0=v_main_~A~0_10} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_2|} AuxVars[] AssignedVars[main_~A~0, assume_abort_if_not_#in~cond] {34#false} is VALID [2022-04-15 03:09:21,624 INFO L290 TraceCheckUtils]: 16: Hoare triple {34#false} [79] L28-->L38-2: Formula: (and (= v_main_~u~0_5 (+ (* v_main_~R~0_5 2) 1)) (= v_main_~v~0_5 1) (= v_main_~r~0_6 (+ (* v_main_~R~0_5 v_main_~R~0_5) (* (- 1) v_main_~A~0_7)))) InVars {main_~A~0=v_main_~A~0_7, main_~R~0=v_main_~R~0_5} OutVars{main_~v~0=v_main_~v~0_5, main_~A~0=v_main_~A~0_7, main_~R~0=v_main_~R~0_5, main_~u~0=v_main_~u~0_5, main_~r~0=v_main_~r~0_6} AuxVars[] AssignedVars[main_~v~0, main_~u~0, main_~r~0] {34#false} is VALID [2022-04-15 03:09:21,624 INFO L290 TraceCheckUtils]: 17: Hoare triple {34#false} [82] L38-2-->L34-3: Formula: false InVars {} OutVars{} AuxVars[] AssignedVars[] {34#false} is VALID [2022-04-15 03:09:21,625 INFO L272 TraceCheckUtils]: 18: Hoare triple {34#false} [85] L34-3-->__VERIFIER_assertENTRY: Formula: (= (ite (= (+ (* (- 2) v_main_~u~0_8) (* v_main_~v~0_8 2) (* v_main_~u~0_8 v_main_~u~0_8) (* (- 1) (* v_main_~v~0_8 v_main_~v~0_8))) (* v_main_~A~0_12 4)) 1 0) |v___VERIFIER_assert_#in~condInParam_2|) InVars {main_~v~0=v_main_~v~0_8, main_~A~0=v_main_~A~0_12, main_~u~0=v_main_~u~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~v~0, main_~A~0, main_~u~0] {34#false} is VALID [2022-04-15 03:09:21,626 INFO L290 TraceCheckUtils]: 19: Hoare triple {34#false} [89] __VERIFIER_assertENTRY-->L12: 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-15 03:09:21,626 INFO L290 TraceCheckUtils]: 20: Hoare triple {34#false} [92] L12-->L13: 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-15 03:09:21,626 INFO L290 TraceCheckUtils]: 21: Hoare triple {34#false} [96] L13-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {34#false} is VALID [2022-04-15 03:09:21,627 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-15 03:09:21,628 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-15 03:09:21,628 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 03:09:21,628 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [421209926] [2022-04-15 03:09:21,628 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 03:09:21,628 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [653165304] [2022-04-15 03:09:21,629 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [653165304] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 03:09:21,629 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 03:09:21,629 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-04-15 03:09:21,631 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [746032028] [2022-04-15 03:09:21,636 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 03:09:21,640 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 6.5) internal successors, (13), 2 states have internal predecessors, (13), 2 states have call successors, (5), 2 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-15 03:09:21,642 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 03:09:21,645 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 2 states, 2 states have (on average 6.5) internal successors, (13), 2 states have internal predecessors, (13), 2 states have call successors, (5), 2 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-15 03:09:21,678 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 21 edges. 21 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 03:09:21,678 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-04-15 03:09:21,678 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-15 03:09:21,707 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-04-15 03:09:21,708 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-04-15 03:09:21,710 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 2 states, 2 states have (on average 6.5) internal successors, (13), 2 states have internal predecessors, (13), 2 states have call successors, (5), 2 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-15 03:09:21,759 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 03:09:21,759 INFO L93 Difference]: Finished difference Result 53 states and 70 transitions. [2022-04-15 03:09:21,759 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-04-15 03:09:21,760 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 6.5) internal successors, (13), 2 states have internal predecessors, (13), 2 states have call successors, (5), 2 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-15 03:09:21,760 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 03:09:21,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 6.5) internal successors, (13), 2 states have internal predecessors, (13), 2 states have call successors, (5), 2 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-15 03:09:21,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 70 transitions. [2022-04-15 03:09:21,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 6.5) internal successors, (13), 2 states have internal predecessors, (13), 2 states have call successors, (5), 2 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-15 03:09:21,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 70 transitions. [2022-04-15 03:09:21,774 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 2 states and 70 transitions. [2022-04-15 03:09:21,854 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 70 edges. 70 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 03:09:21,865 INFO L225 Difference]: With dead ends: 53 [2022-04-15 03:09:21,866 INFO L226 Difference]: Without dead ends: 25 [2022-04-15 03:09:21,869 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-04-15 03:09:21,873 INFO L913 BasicCegarLoop]: 34 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 34 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 03:09:21,876 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 03:09:21,891 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2022-04-15 03:09:21,909 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2022-04-15 03:09:21,909 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 03:09:21,912 INFO L82 GeneralOperation]: Start isEquivalent. First operand 25 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-15 03:09:21,914 INFO L74 IsIncluded]: Start isIncluded. First operand 25 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-15 03:09:21,915 INFO L87 Difference]: Start difference. First operand 25 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-15 03:09:21,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 03:09:21,919 INFO L93 Difference]: Finished difference Result 25 states and 29 transitions. [2022-04-15 03:09:21,919 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 29 transitions. [2022-04-15 03:09:21,920 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 03:09:21,920 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 03:09:21,921 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 25 states. [2022-04-15 03:09:21,921 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 25 states. [2022-04-15 03:09:21,924 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 03:09:21,925 INFO L93 Difference]: Finished difference Result 25 states and 29 transitions. [2022-04-15 03:09:21,925 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 29 transitions. [2022-04-15 03:09:21,925 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 03:09:21,925 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 03:09:21,926 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 03:09:21,926 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 03:09:21,926 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-15 03:09:21,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 29 transitions. [2022-04-15 03:09:21,932 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 29 transitions. Word has length 22 [2022-04-15 03:09:21,932 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 03:09:21,932 INFO L478 AbstractCegarLoop]: Abstraction has 25 states and 29 transitions. [2022-04-15 03:09:21,933 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 6.5) internal successors, (13), 2 states have internal predecessors, (13), 2 states have call successors, (5), 2 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-15 03:09:21,933 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 29 transitions. [2022-04-15 03:09:21,933 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-04-15 03:09:21,934 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 03:09:21,934 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 03:09:21,951 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-04-15 03:09:22,135 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2022-04-15 03:09:22,136 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 03:09:22,137 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 03:09:22,137 INFO L85 PathProgramCache]: Analyzing trace with hash -1669026344, now seen corresponding path program 1 times [2022-04-15 03:09:22,137 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 03:09:22,137 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [678229441] [2022-04-15 03:09:22,137 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 03:09:22,138 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 03:09:22,162 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 03:09:22,163 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1076383339] [2022-04-15 03:09:22,163 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 03:09:22,163 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 03:09:22,163 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 03:09:22,164 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 03:09:22,166 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-04-15 03:09:22,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 03:09:22,210 INFO L263 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 5 conjunts are in the unsatisfiable core [2022-04-15 03:09:22,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 03:09:22,221 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 03:09:22,395 INFO L272 TraceCheckUtils]: 0: Hoare triple {256#true} [70] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {256#true} is VALID [2022-04-15 03:09:22,396 INFO L290 TraceCheckUtils]: 1: Hoare triple {256#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) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#length_1| 2) 13) (= (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] {264#(<= ~counter~0 0)} is VALID [2022-04-15 03:09:22,397 INFO L290 TraceCheckUtils]: 2: Hoare triple {264#(<= ~counter~0 0)} [75] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {264#(<= ~counter~0 0)} is VALID [2022-04-15 03:09:22,398 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {264#(<= ~counter~0 0)} {256#true} [101] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {264#(<= ~counter~0 0)} is VALID [2022-04-15 03:09:22,398 INFO L272 TraceCheckUtils]: 4: Hoare triple {264#(<= ~counter~0 0)} [71] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {264#(<= ~counter~0 0)} is VALID [2022-04-15 03:09:22,399 INFO L290 TraceCheckUtils]: 5: Hoare triple {264#(<= ~counter~0 0)} [74] mainENTRY-->L26: Formula: (and (<= |v_main_#t~nondet5_2| 2147483647) (= v_main_~R~0_1 |v_main_#t~nondet5_2|) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= |v_main_#t~nondet4_2| 2147483647) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648)) (= v_main_~A~0_2 |v_main_#t~nondet4_2|)) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|, main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~v~0=v_main_~v~0_4, main_~A~0=v_main_~A~0_2, main_~R~0=v_main_~R~0_1, main_~u~0=v_main_~u~0_4, main_~r~0=v_main_~r~0_5} AuxVars[] AssignedVars[main_#t~nondet5, main_#t~nondet4, main_~v~0, main_~A~0, main_~R~0, main_~u~0, main_~r~0] {264#(<= ~counter~0 0)} is VALID [2022-04-15 03:09:22,399 INFO L272 TraceCheckUtils]: 6: Hoare triple {264#(<= ~counter~0 0)} [76] L26-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (< (+ (* v_main_~R~0_6 v_main_~R~0_6) 1) (+ (* v_main_~R~0_6 2) v_main_~A~0_9)) 1 0)) InVars {main_~A~0=v_main_~A~0_9, main_~R~0=v_main_~R~0_6} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~A~0, assume_abort_if_not_#in~cond, main_~R~0] {264#(<= ~counter~0 0)} is VALID [2022-04-15 03:09:22,400 INFO L290 TraceCheckUtils]: 7: Hoare triple {264#(<= ~counter~0 0)} [78] assume_abort_if_notENTRY-->L9: 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] {264#(<= ~counter~0 0)} is VALID [2022-04-15 03:09:22,400 INFO L290 TraceCheckUtils]: 8: Hoare triple {264#(<= ~counter~0 0)} [81] L9-->L9-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[] {264#(<= ~counter~0 0)} is VALID [2022-04-15 03:09:22,401 INFO L290 TraceCheckUtils]: 9: Hoare triple {264#(<= ~counter~0 0)} [84] L9-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {264#(<= ~counter~0 0)} is VALID [2022-04-15 03:09:22,402 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {264#(<= ~counter~0 0)} {264#(<= ~counter~0 0)} [102] assume_abort_if_notEXIT-->L26-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (< (+ (* v_main_~R~0_6 v_main_~R~0_6) 1) (+ (* v_main_~R~0_6 2) v_main_~A~0_9)) 1 0)) InVars {main_~A~0=v_main_~A~0_9, main_~R~0=v_main_~R~0_6} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~A~0, assume_abort_if_not_#in~cond, main_~R~0] {264#(<= ~counter~0 0)} is VALID [2022-04-15 03:09:22,402 INFO L272 TraceCheckUtils]: 11: Hoare triple {264#(<= ~counter~0 0)} [77] L26-1-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (= (let ((.cse0 (mod v_main_~A~0_10 2))) (ite (and (not (= .cse0 0)) (< v_main_~A~0_10 0)) (+ (- 2) .cse0) .cse0)) 1) 1 0)) InVars {main_~A~0=v_main_~A~0_10} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_2|} AuxVars[] AssignedVars[main_~A~0, assume_abort_if_not_#in~cond] {264#(<= ~counter~0 0)} is VALID [2022-04-15 03:09:22,403 INFO L290 TraceCheckUtils]: 12: Hoare triple {264#(<= ~counter~0 0)} [78] assume_abort_if_notENTRY-->L9: 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] {264#(<= ~counter~0 0)} is VALID [2022-04-15 03:09:22,403 INFO L290 TraceCheckUtils]: 13: Hoare triple {264#(<= ~counter~0 0)} [81] L9-->L9-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[] {264#(<= ~counter~0 0)} is VALID [2022-04-15 03:09:22,404 INFO L290 TraceCheckUtils]: 14: Hoare triple {264#(<= ~counter~0 0)} [84] L9-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {264#(<= ~counter~0 0)} is VALID [2022-04-15 03:09:22,405 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {264#(<= ~counter~0 0)} {264#(<= ~counter~0 0)} [103] assume_abort_if_notEXIT-->L28: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (= (let ((.cse0 (mod v_main_~A~0_10 2))) (ite (and (not (= .cse0 0)) (< v_main_~A~0_10 0)) (+ (- 2) .cse0) .cse0)) 1) 1 0)) InVars {main_~A~0=v_main_~A~0_10} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_2|} AuxVars[] AssignedVars[main_~A~0, assume_abort_if_not_#in~cond] {264#(<= ~counter~0 0)} is VALID [2022-04-15 03:09:22,405 INFO L290 TraceCheckUtils]: 16: Hoare triple {264#(<= ~counter~0 0)} [79] L28-->L38-2: Formula: (and (= v_main_~u~0_5 (+ (* v_main_~R~0_5 2) 1)) (= v_main_~v~0_5 1) (= v_main_~r~0_6 (+ (* v_main_~R~0_5 v_main_~R~0_5) (* (- 1) v_main_~A~0_7)))) InVars {main_~A~0=v_main_~A~0_7, main_~R~0=v_main_~R~0_5} OutVars{main_~v~0=v_main_~v~0_5, main_~A~0=v_main_~A~0_7, main_~R~0=v_main_~R~0_5, main_~u~0=v_main_~u~0_5, main_~r~0=v_main_~r~0_6} AuxVars[] AssignedVars[main_~v~0, main_~u~0, main_~r~0] {264#(<= ~counter~0 0)} is VALID [2022-04-15 03:09:22,406 INFO L290 TraceCheckUtils]: 17: Hoare triple {264#(<= ~counter~0 0)} [83] L38-2-->L34-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] {313#(<= |main_#t~post6| 0)} is VALID [2022-04-15 03:09:22,406 INFO L290 TraceCheckUtils]: 18: Hoare triple {313#(<= |main_#t~post6| 0)} [86] L34-1-->L34-3: Formula: (not (< |v_main_#t~post6_3| 5)) InVars {main_#t~post6=|v_main_#t~post6_3|} OutVars{} AuxVars[] AssignedVars[main_#t~post6] {257#false} is VALID [2022-04-15 03:09:22,407 INFO L272 TraceCheckUtils]: 19: Hoare triple {257#false} [85] L34-3-->__VERIFIER_assertENTRY: Formula: (= (ite (= (+ (* (- 2) v_main_~u~0_8) (* v_main_~v~0_8 2) (* v_main_~u~0_8 v_main_~u~0_8) (* (- 1) (* v_main_~v~0_8 v_main_~v~0_8))) (* v_main_~A~0_12 4)) 1 0) |v___VERIFIER_assert_#in~condInParam_2|) InVars {main_~v~0=v_main_~v~0_8, main_~A~0=v_main_~A~0_12, main_~u~0=v_main_~u~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~v~0, main_~A~0, main_~u~0] {257#false} is VALID [2022-04-15 03:09:22,409 INFO L290 TraceCheckUtils]: 20: Hoare triple {257#false} [89] __VERIFIER_assertENTRY-->L12: 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] {257#false} is VALID [2022-04-15 03:09:22,410 INFO L290 TraceCheckUtils]: 21: Hoare triple {257#false} [92] L12-->L13: 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[] {257#false} is VALID [2022-04-15 03:09:22,410 INFO L290 TraceCheckUtils]: 22: Hoare triple {257#false} [96] L13-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {257#false} is VALID [2022-04-15 03:09:22,410 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-15 03:09:22,410 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-15 03:09:22,411 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 03:09:22,411 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [678229441] [2022-04-15 03:09:22,411 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 03:09:22,411 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1076383339] [2022-04-15 03:09:22,411 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1076383339] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 03:09:22,411 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 03:09:22,411 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 03:09:22,412 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [582433444] [2022-04-15 03:09:22,412 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 03:09:22,415 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-15 03:09:22,415 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 03:09:22,416 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-15 03:09:22,446 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 20 edges. 20 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 03:09:22,446 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-15 03:09:22,447 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-15 03:09:22,447 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-15 03:09:22,448 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-15 03:09:22,448 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-15 03:09:22,534 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 03:09:22,534 INFO L93 Difference]: Finished difference Result 34 states and 38 transitions. [2022-04-15 03:09:22,535 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-15 03:09:22,535 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-15 03:09:22,535 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 03:09:22,535 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-15 03:09:22,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 38 transitions. [2022-04-15 03:09:22,541 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-15 03:09:22,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 38 transitions. [2022-04-15 03:09:22,553 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 38 transitions. [2022-04-15 03:09:22,584 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 38 edges. 38 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 03:09:22,587 INFO L225 Difference]: With dead ends: 34 [2022-04-15 03:09:22,587 INFO L226 Difference]: Without dead ends: 27 [2022-04-15 03:09:22,588 INFO L912 BasicCegarLoop]: 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-15 03:09:22,591 INFO L913 BasicCegarLoop]: 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-15 03:09:22,592 INFO L914 BasicCegarLoop]: 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-15 03:09:22,594 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2022-04-15 03:09:22,607 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2022-04-15 03:09:22,607 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 03:09:22,608 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-15 03:09:22,608 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-15 03:09:22,609 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-15 03:09:22,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 03:09:22,611 INFO L93 Difference]: Finished difference Result 27 states and 31 transitions. [2022-04-15 03:09:22,611 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 31 transitions. [2022-04-15 03:09:22,611 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 03:09:22,611 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 03:09:22,612 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-15 03:09:22,612 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-15 03:09:22,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 03:09:22,614 INFO L93 Difference]: Finished difference Result 27 states and 31 transitions. [2022-04-15 03:09:22,614 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 31 transitions. [2022-04-15 03:09:22,615 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 03:09:22,615 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 03:09:22,615 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 03:09:22,615 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 03:09:22,616 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-15 03:09:22,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 31 transitions. [2022-04-15 03:09:22,634 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 31 transitions. Word has length 23 [2022-04-15 03:09:22,635 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 03:09:22,635 INFO L478 AbstractCegarLoop]: Abstraction has 27 states and 31 transitions. [2022-04-15 03:09:22,635 INFO L479 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-15 03:09:22,635 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 31 transitions. [2022-04-15 03:09:22,636 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-04-15 03:09:22,636 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 03:09:22,636 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 03:09:22,656 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-04-15 03:09:22,847 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable1 [2022-04-15 03:09:22,848 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 03:09:22,849 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 03:09:22,849 INFO L85 PathProgramCache]: Analyzing trace with hash -1667953868, now seen corresponding path program 1 times [2022-04-15 03:09:22,849 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 03:09:22,849 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [442454198] [2022-04-15 03:09:22,850 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 03:09:22,850 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 03:09:22,919 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 03:09:22,920 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2073395975] [2022-04-15 03:09:22,920 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 03:09:22,920 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 03:09:22,920 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 03:09:22,924 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-15 03:09:22,948 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-15 03:09:22,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 03:09:22,994 INFO L263 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 13 conjunts are in the unsatisfiable core [2022-04-15 03:09:23,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 03:09:23,012 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 03:09:24,024 INFO L272 TraceCheckUtils]: 0: Hoare triple {469#true} [70] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {469#true} is VALID [2022-04-15 03:09:24,026 INFO L290 TraceCheckUtils]: 1: Hoare triple {469#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) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#length_1| 2) 13) (= (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] {469#true} is VALID [2022-04-15 03:09:24,027 INFO L290 TraceCheckUtils]: 2: Hoare triple {469#true} [75] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {469#true} is VALID [2022-04-15 03:09:24,032 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {469#true} {469#true} [101] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {469#true} is VALID [2022-04-15 03:09:24,032 INFO L272 TraceCheckUtils]: 4: Hoare triple {469#true} [71] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {469#true} is VALID [2022-04-15 03:09:24,032 INFO L290 TraceCheckUtils]: 5: Hoare triple {469#true} [74] mainENTRY-->L26: Formula: (and (<= |v_main_#t~nondet5_2| 2147483647) (= v_main_~R~0_1 |v_main_#t~nondet5_2|) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= |v_main_#t~nondet4_2| 2147483647) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648)) (= v_main_~A~0_2 |v_main_#t~nondet4_2|)) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|, main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~v~0=v_main_~v~0_4, main_~A~0=v_main_~A~0_2, main_~R~0=v_main_~R~0_1, main_~u~0=v_main_~u~0_4, main_~r~0=v_main_~r~0_5} AuxVars[] AssignedVars[main_#t~nondet5, main_#t~nondet4, main_~v~0, main_~A~0, main_~R~0, main_~u~0, main_~r~0] {469#true} is VALID [2022-04-15 03:09:24,033 INFO L272 TraceCheckUtils]: 6: Hoare triple {469#true} [76] L26-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (< (+ (* v_main_~R~0_6 v_main_~R~0_6) 1) (+ (* v_main_~R~0_6 2) v_main_~A~0_9)) 1 0)) InVars {main_~A~0=v_main_~A~0_9, main_~R~0=v_main_~R~0_6} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~A~0, assume_abort_if_not_#in~cond, main_~R~0] {469#true} is VALID [2022-04-15 03:09:24,033 INFO L290 TraceCheckUtils]: 7: Hoare triple {469#true} [78] assume_abort_if_notENTRY-->L9: 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] {469#true} is VALID [2022-04-15 03:09:24,033 INFO L290 TraceCheckUtils]: 8: Hoare triple {469#true} [81] L9-->L9-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[] {469#true} is VALID [2022-04-15 03:09:24,033 INFO L290 TraceCheckUtils]: 9: Hoare triple {469#true} [84] L9-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {469#true} is VALID [2022-04-15 03:09:24,034 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {469#true} {469#true} [102] assume_abort_if_notEXIT-->L26-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (< (+ (* v_main_~R~0_6 v_main_~R~0_6) 1) (+ (* v_main_~R~0_6 2) v_main_~A~0_9)) 1 0)) InVars {main_~A~0=v_main_~A~0_9, main_~R~0=v_main_~R~0_6} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~A~0, assume_abort_if_not_#in~cond, main_~R~0] {469#true} is VALID [2022-04-15 03:09:24,034 INFO L272 TraceCheckUtils]: 11: Hoare triple {469#true} [77] L26-1-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (= (let ((.cse0 (mod v_main_~A~0_10 2))) (ite (and (not (= .cse0 0)) (< v_main_~A~0_10 0)) (+ (- 2) .cse0) .cse0)) 1) 1 0)) InVars {main_~A~0=v_main_~A~0_10} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_2|} AuxVars[] AssignedVars[main_~A~0, assume_abort_if_not_#in~cond] {469#true} is VALID [2022-04-15 03:09:24,034 INFO L290 TraceCheckUtils]: 12: Hoare triple {469#true} [78] assume_abort_if_notENTRY-->L9: 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] {469#true} is VALID [2022-04-15 03:09:24,034 INFO L290 TraceCheckUtils]: 13: Hoare triple {469#true} [81] L9-->L9-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[] {469#true} is VALID [2022-04-15 03:09:24,035 INFO L290 TraceCheckUtils]: 14: Hoare triple {469#true} [84] L9-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {469#true} is VALID [2022-04-15 03:09:24,035 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {469#true} {469#true} [103] assume_abort_if_notEXIT-->L28: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (= (let ((.cse0 (mod v_main_~A~0_10 2))) (ite (and (not (= .cse0 0)) (< v_main_~A~0_10 0)) (+ (- 2) .cse0) .cse0)) 1) 1 0)) InVars {main_~A~0=v_main_~A~0_10} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_2|} AuxVars[] AssignedVars[main_~A~0, assume_abort_if_not_#in~cond] {469#true} is VALID [2022-04-15 03:09:26,040 WARN L290 TraceCheckUtils]: 16: Hoare triple {469#true} [79] L28-->L38-2: Formula: (and (= v_main_~u~0_5 (+ (* v_main_~R~0_5 2) 1)) (= v_main_~v~0_5 1) (= v_main_~r~0_6 (+ (* v_main_~R~0_5 v_main_~R~0_5) (* (- 1) v_main_~A~0_7)))) InVars {main_~A~0=v_main_~A~0_7, main_~R~0=v_main_~R~0_5} OutVars{main_~v~0=v_main_~v~0_5, main_~A~0=v_main_~A~0_7, main_~R~0=v_main_~R~0_5, main_~u~0=v_main_~u~0_5, main_~r~0=v_main_~r~0_6} AuxVars[] AssignedVars[main_~v~0, main_~u~0, main_~r~0] {522#(and (= (+ (* (- 1) main_~A~0) (* (div (+ (* (- 1) main_~u~0) 1) (- 2)) (div (+ (* (- 1) main_~u~0) 1) (- 2)))) main_~r~0) (= (mod (+ main_~u~0 1) 2) 0) (= main_~v~0 1))} is UNKNOWN [2022-04-15 03:09:26,041 INFO L290 TraceCheckUtils]: 17: Hoare triple {522#(and (= (+ (* (- 1) main_~A~0) (* (div (+ (* (- 1) main_~u~0) 1) (- 2)) (div (+ (* (- 1) main_~u~0) 1) (- 2)))) main_~r~0) (= (mod (+ main_~u~0 1) 2) 0) (= main_~v~0 1))} [83] L38-2-->L34-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] {522#(and (= (+ (* (- 1) main_~A~0) (* (div (+ (* (- 1) main_~u~0) 1) (- 2)) (div (+ (* (- 1) main_~u~0) 1) (- 2)))) main_~r~0) (= (mod (+ main_~u~0 1) 2) 0) (= main_~v~0 1))} is VALID [2022-04-15 03:09:26,047 INFO L290 TraceCheckUtils]: 18: Hoare triple {522#(and (= (+ (* (- 1) main_~A~0) (* (div (+ (* (- 1) main_~u~0) 1) (- 2)) (div (+ (* (- 1) main_~u~0) 1) (- 2)))) main_~r~0) (= (mod (+ main_~u~0 1) 2) 0) (= main_~v~0 1))} [87] L34-1-->L35: Formula: (< |v_main_#t~post6_5| 5) InVars {main_#t~post6=|v_main_#t~post6_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post6] {522#(and (= (+ (* (- 1) main_~A~0) (* (div (+ (* (- 1) main_~u~0) 1) (- 2)) (div (+ (* (- 1) main_~u~0) 1) (- 2)))) main_~r~0) (= (mod (+ main_~u~0 1) 2) 0) (= main_~v~0 1))} is VALID [2022-04-15 03:09:26,736 INFO L272 TraceCheckUtils]: 19: Hoare triple {522#(and (= (+ (* (- 1) main_~A~0) (* (div (+ (* (- 1) main_~u~0) 1) (- 2)) (div (+ (* (- 1) main_~u~0) 1) (- 2)))) main_~r~0) (= (mod (+ main_~u~0 1) 2) 0) (= main_~v~0 1))} [90] L35-->__VERIFIER_assertENTRY: Formula: (= (ite (= (+ (* v_main_~r~0_10 4) (* v_main_~A~0_11 4)) (+ (* v_main_~u~0_7 v_main_~u~0_7) (* (- 1) (* v_main_~v~0_7 v_main_~v~0_7)) (* (- 2) v_main_~u~0_7) (* v_main_~v~0_7 2))) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~v~0=v_main_~v~0_7, main_~A~0=v_main_~A~0_11, main_~u~0=v_main_~u~0_7, main_~r~0=v_main_~r~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~v~0, main_~A~0, main_~u~0, main_~r~0] {532#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 03:09:26,736 INFO L290 TraceCheckUtils]: 20: Hoare triple {532#(<= 1 |__VERIFIER_assert_#in~cond|)} [89] __VERIFIER_assertENTRY-->L12: 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] {536#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 03:09:26,737 INFO L290 TraceCheckUtils]: 21: Hoare triple {536#(<= 1 __VERIFIER_assert_~cond)} [92] L12-->L13: 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[] {470#false} is VALID [2022-04-15 03:09:26,737 INFO L290 TraceCheckUtils]: 22: Hoare triple {470#false} [96] L13-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {470#false} is VALID [2022-04-15 03:09:26,737 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-15 03:09:26,737 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-15 03:09:26,738 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 03:09:26,738 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [442454198] [2022-04-15 03:09:26,738 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 03:09:26,738 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2073395975] [2022-04-15 03:09:26,738 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2073395975] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 03:09:26,738 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 03:09:26,738 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 03:09:26,739 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1697767716] [2022-04-15 03:09:26,739 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 03:09:26,739 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 23 [2022-04-15 03:09:26,739 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 03:09:26,740 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-15 03:09:29,534 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 20 edges. 20 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 03:09:29,534 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-15 03:09:29,534 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-15 03:09:29,535 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-15 03:09:29,535 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-15 03:09:29,535 INFO L87 Difference]: Start difference. First operand 27 states and 31 transitions. Second operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-15 03:09:32,743 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-15 03:09:32,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 03:09:32,780 INFO L93 Difference]: Finished difference Result 37 states and 43 transitions. [2022-04-15 03:09:32,780 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-15 03:09:32,781 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 23 [2022-04-15 03:09:32,781 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 03:09:32,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-15 03:09:32,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-04-15 03:09:32,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-15 03:09:32,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-04-15 03:09:32,784 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 43 transitions. [2022-04-15 03:09:33,526 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-15 03:09:33,528 INFO L225 Difference]: With dead ends: 37 [2022-04-15 03:09:33,528 INFO L226 Difference]: Without dead ends: 35 [2022-04-15 03:09:33,528 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-15 03:09:33,529 INFO L913 BasicCegarLoop]: 23 mSDtfsCounter, 7 mSDsluCounter, 59 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 0 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 82 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.1s IncrementalHoareTripleChecker+Time [2022-04-15 03:09:33,530 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [8 Valid, 82 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 36 Invalid, 1 Unknown, 0 Unchecked, 3.1s Time] [2022-04-15 03:09:33,530 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2022-04-15 03:09:33,560 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 32. [2022-04-15 03:09:33,561 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 03:09:33,561 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-15 03:09:33,561 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-15 03:09:33,562 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-15 03:09:33,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 03:09:33,564 INFO L93 Difference]: Finished difference Result 35 states and 41 transitions. [2022-04-15 03:09:33,564 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 41 transitions. [2022-04-15 03:09:33,564 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 03:09:33,565 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 03:09:33,565 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-15 03:09:33,565 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-15 03:09:33,567 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 03:09:33,568 INFO L93 Difference]: Finished difference Result 35 states and 41 transitions. [2022-04-15 03:09:33,568 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 41 transitions. [2022-04-15 03:09:33,568 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 03:09:33,568 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 03:09:33,568 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 03:09:33,569 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 03:09:33,569 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-15 03:09:33,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 36 transitions. [2022-04-15 03:09:33,571 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 36 transitions. Word has length 23 [2022-04-15 03:09:33,571 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 03:09:33,571 INFO L478 AbstractCegarLoop]: Abstraction has 32 states and 36 transitions. [2022-04-15 03:09:33,572 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-15 03:09:33,572 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 36 transitions. [2022-04-15 03:09:33,573 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-04-15 03:09:33,573 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 03:09:33,573 INFO L499 BasicCegarLoop]: 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-15 03:09:33,603 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2022-04-15 03:09:33,798 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 03:09:33,798 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 03:09:33,799 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 03:09:33,799 INFO L85 PathProgramCache]: Analyzing trace with hash 1179905874, now seen corresponding path program 1 times [2022-04-15 03:09:33,803 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 03:09:33,803 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [583451328] [2022-04-15 03:09:33,803 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 03:09:33,803 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 03:09:33,832 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 03:09:33,833 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [754943998] [2022-04-15 03:09:33,833 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 03:09:33,833 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 03:09:33,833 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 03:09:33,848 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-15 03:09:33,885 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-15 03:09:33,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 03:09:33,933 INFO L263 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 10 conjunts are in the unsatisfiable core [2022-04-15 03:09:33,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 03:09:33,959 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 03:09:34,251 INFO L272 TraceCheckUtils]: 0: Hoare triple {712#true} [70] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {712#true} is VALID [2022-04-15 03:09:34,252 INFO L290 TraceCheckUtils]: 1: Hoare triple {712#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) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#length_1| 2) 13) (= (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] {712#true} is VALID [2022-04-15 03:09:34,252 INFO L290 TraceCheckUtils]: 2: Hoare triple {712#true} [75] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {712#true} is VALID [2022-04-15 03:09:34,252 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {712#true} {712#true} [101] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {712#true} is VALID [2022-04-15 03:09:34,253 INFO L272 TraceCheckUtils]: 4: Hoare triple {712#true} [71] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {712#true} is VALID [2022-04-15 03:09:34,253 INFO L290 TraceCheckUtils]: 5: Hoare triple {712#true} [74] mainENTRY-->L26: Formula: (and (<= |v_main_#t~nondet5_2| 2147483647) (= v_main_~R~0_1 |v_main_#t~nondet5_2|) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= |v_main_#t~nondet4_2| 2147483647) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648)) (= v_main_~A~0_2 |v_main_#t~nondet4_2|)) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|, main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~v~0=v_main_~v~0_4, main_~A~0=v_main_~A~0_2, main_~R~0=v_main_~R~0_1, main_~u~0=v_main_~u~0_4, main_~r~0=v_main_~r~0_5} AuxVars[] AssignedVars[main_#t~nondet5, main_#t~nondet4, main_~v~0, main_~A~0, main_~R~0, main_~u~0, main_~r~0] {712#true} is VALID [2022-04-15 03:09:34,253 INFO L272 TraceCheckUtils]: 6: Hoare triple {712#true} [76] L26-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (< (+ (* v_main_~R~0_6 v_main_~R~0_6) 1) (+ (* v_main_~R~0_6 2) v_main_~A~0_9)) 1 0)) InVars {main_~A~0=v_main_~A~0_9, main_~R~0=v_main_~R~0_6} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~A~0, assume_abort_if_not_#in~cond, main_~R~0] {712#true} is VALID [2022-04-15 03:09:34,253 INFO L290 TraceCheckUtils]: 7: Hoare triple {712#true} [78] assume_abort_if_notENTRY-->L9: 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] {712#true} is VALID [2022-04-15 03:09:34,253 INFO L290 TraceCheckUtils]: 8: Hoare triple {712#true} [81] L9-->L9-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[] {712#true} is VALID [2022-04-15 03:09:34,254 INFO L290 TraceCheckUtils]: 9: Hoare triple {712#true} [84] L9-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {712#true} is VALID [2022-04-15 03:09:34,254 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {712#true} {712#true} [102] assume_abort_if_notEXIT-->L26-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (< (+ (* v_main_~R~0_6 v_main_~R~0_6) 1) (+ (* v_main_~R~0_6 2) v_main_~A~0_9)) 1 0)) InVars {main_~A~0=v_main_~A~0_9, main_~R~0=v_main_~R~0_6} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~A~0, assume_abort_if_not_#in~cond, main_~R~0] {712#true} is VALID [2022-04-15 03:09:34,267 INFO L272 TraceCheckUtils]: 11: Hoare triple {712#true} [77] L26-1-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (= (let ((.cse0 (mod v_main_~A~0_10 2))) (ite (and (not (= .cse0 0)) (< v_main_~A~0_10 0)) (+ (- 2) .cse0) .cse0)) 1) 1 0)) InVars {main_~A~0=v_main_~A~0_10} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_2|} AuxVars[] AssignedVars[main_~A~0, assume_abort_if_not_#in~cond] {712#true} is VALID [2022-04-15 03:09:34,268 INFO L290 TraceCheckUtils]: 12: Hoare triple {712#true} [78] assume_abort_if_notENTRY-->L9: 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] {712#true} is VALID [2022-04-15 03:09:34,268 INFO L290 TraceCheckUtils]: 13: Hoare triple {712#true} [81] L9-->L9-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[] {712#true} is VALID [2022-04-15 03:09:34,268 INFO L290 TraceCheckUtils]: 14: Hoare triple {712#true} [84] L9-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {712#true} is VALID [2022-04-15 03:09:34,268 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {712#true} {712#true} [103] assume_abort_if_notEXIT-->L28: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (= (let ((.cse0 (mod v_main_~A~0_10 2))) (ite (and (not (= .cse0 0)) (< v_main_~A~0_10 0)) (+ (- 2) .cse0) .cse0)) 1) 1 0)) InVars {main_~A~0=v_main_~A~0_10} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_2|} AuxVars[] AssignedVars[main_~A~0, assume_abort_if_not_#in~cond] {712#true} is VALID [2022-04-15 03:09:34,268 INFO L290 TraceCheckUtils]: 16: Hoare triple {712#true} [79] L28-->L38-2: Formula: (and (= v_main_~u~0_5 (+ (* v_main_~R~0_5 2) 1)) (= v_main_~v~0_5 1) (= v_main_~r~0_6 (+ (* v_main_~R~0_5 v_main_~R~0_5) (* (- 1) v_main_~A~0_7)))) InVars {main_~A~0=v_main_~A~0_7, main_~R~0=v_main_~R~0_5} OutVars{main_~v~0=v_main_~v~0_5, main_~A~0=v_main_~A~0_7, main_~R~0=v_main_~R~0_5, main_~u~0=v_main_~u~0_5, main_~r~0=v_main_~r~0_6} AuxVars[] AssignedVars[main_~v~0, main_~u~0, main_~r~0] {712#true} is VALID [2022-04-15 03:09:34,268 INFO L290 TraceCheckUtils]: 17: Hoare triple {712#true} [83] L38-2-->L34-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] {712#true} is VALID [2022-04-15 03:09:34,269 INFO L290 TraceCheckUtils]: 18: Hoare triple {712#true} [87] L34-1-->L35: Formula: (< |v_main_#t~post6_5| 5) InVars {main_#t~post6=|v_main_#t~post6_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post6] {712#true} is VALID [2022-04-15 03:09:34,269 INFO L272 TraceCheckUtils]: 19: Hoare triple {712#true} [90] L35-->__VERIFIER_assertENTRY: Formula: (= (ite (= (+ (* v_main_~r~0_10 4) (* v_main_~A~0_11 4)) (+ (* v_main_~u~0_7 v_main_~u~0_7) (* (- 1) (* v_main_~v~0_7 v_main_~v~0_7)) (* (- 2) v_main_~u~0_7) (* v_main_~v~0_7 2))) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~v~0=v_main_~v~0_7, main_~A~0=v_main_~A~0_11, main_~u~0=v_main_~u~0_7, main_~r~0=v_main_~r~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~v~0, main_~A~0, main_~u~0, main_~r~0] {712#true} is VALID [2022-04-15 03:09:34,270 INFO L290 TraceCheckUtils]: 20: Hoare triple {712#true} [89] __VERIFIER_assertENTRY-->L12: 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] {777#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-15 03:09:34,270 INFO L290 TraceCheckUtils]: 21: Hoare triple {777#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} [93] L12-->L12-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[] {781#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 03:09:34,271 INFO L290 TraceCheckUtils]: 22: Hoare triple {781#(not (= |__VERIFIER_assert_#in~cond| 0))} [98] L12-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {781#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 03:09:34,272 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {781#(not (= |__VERIFIER_assert_#in~cond| 0))} {712#true} [105] __VERIFIER_assertEXIT-->L35-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= (+ (* v_main_~r~0_10 4) (* v_main_~A~0_11 4)) (+ (* v_main_~u~0_7 v_main_~u~0_7) (* (- 1) (* v_main_~v~0_7 v_main_~v~0_7)) (* (- 2) v_main_~u~0_7) (* v_main_~v~0_7 2))) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~v~0=v_main_~v~0_7, main_~A~0=v_main_~A~0_11, main_~u~0=v_main_~u~0_7, main_~r~0=v_main_~r~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~v~0, main_~A~0, main_~u~0, main_~r~0] {788#(= (+ (* main_~v~0 2) (* main_~u~0 main_~u~0)) (+ (* main_~v~0 main_~v~0) (* main_~u~0 2) (* main_~A~0 4) (* main_~r~0 4)))} is VALID [2022-04-15 03:09:34,273 INFO L290 TraceCheckUtils]: 24: Hoare triple {788#(= (+ (* main_~v~0 2) (* main_~u~0 main_~u~0)) (+ (* main_~v~0 main_~v~0) (* main_~u~0 2) (* main_~A~0 4) (* main_~r~0 4)))} [94] L35-1-->L34-3: Formula: (= v_main_~r~0_8 0) InVars {main_~r~0=v_main_~r~0_8} OutVars{main_~r~0=v_main_~r~0_8} AuxVars[] AssignedVars[] {792#(= (+ (* main_~v~0 2) (* main_~u~0 main_~u~0)) (+ (* main_~v~0 main_~v~0) (* main_~u~0 2) (* main_~A~0 4)))} is VALID [2022-04-15 03:09:34,274 INFO L272 TraceCheckUtils]: 25: Hoare triple {792#(= (+ (* main_~v~0 2) (* main_~u~0 main_~u~0)) (+ (* main_~v~0 main_~v~0) (* main_~u~0 2) (* main_~A~0 4)))} [85] L34-3-->__VERIFIER_assertENTRY: Formula: (= (ite (= (+ (* (- 2) v_main_~u~0_8) (* v_main_~v~0_8 2) (* v_main_~u~0_8 v_main_~u~0_8) (* (- 1) (* v_main_~v~0_8 v_main_~v~0_8))) (* v_main_~A~0_12 4)) 1 0) |v___VERIFIER_assert_#in~condInParam_2|) InVars {main_~v~0=v_main_~v~0_8, main_~A~0=v_main_~A~0_12, main_~u~0=v_main_~u~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~v~0, main_~A~0, main_~u~0] {796#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 03:09:34,274 INFO L290 TraceCheckUtils]: 26: Hoare triple {796#(<= 1 |__VERIFIER_assert_#in~cond|)} [89] __VERIFIER_assertENTRY-->L12: 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] {800#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 03:09:34,275 INFO L290 TraceCheckUtils]: 27: Hoare triple {800#(<= 1 __VERIFIER_assert_~cond)} [92] L12-->L13: 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[] {713#false} is VALID [2022-04-15 03:09:34,275 INFO L290 TraceCheckUtils]: 28: Hoare triple {713#false} [96] L13-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {713#false} is VALID [2022-04-15 03:09:34,276 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-15 03:09:34,276 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 03:09:34,800 INFO L290 TraceCheckUtils]: 28: Hoare triple {713#false} [96] L13-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {713#false} is VALID [2022-04-15 03:09:34,800 INFO L290 TraceCheckUtils]: 27: Hoare triple {800#(<= 1 __VERIFIER_assert_~cond)} [92] L12-->L13: 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[] {713#false} is VALID [2022-04-15 03:09:34,801 INFO L290 TraceCheckUtils]: 26: Hoare triple {796#(<= 1 |__VERIFIER_assert_#in~cond|)} [89] __VERIFIER_assertENTRY-->L12: 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] {800#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 03:09:34,802 INFO L272 TraceCheckUtils]: 25: Hoare triple {792#(= (+ (* main_~v~0 2) (* main_~u~0 main_~u~0)) (+ (* main_~v~0 main_~v~0) (* main_~u~0 2) (* main_~A~0 4)))} [85] L34-3-->__VERIFIER_assertENTRY: Formula: (= (ite (= (+ (* (- 2) v_main_~u~0_8) (* v_main_~v~0_8 2) (* v_main_~u~0_8 v_main_~u~0_8) (* (- 1) (* v_main_~v~0_8 v_main_~v~0_8))) (* v_main_~A~0_12 4)) 1 0) |v___VERIFIER_assert_#in~condInParam_2|) InVars {main_~v~0=v_main_~v~0_8, main_~A~0=v_main_~A~0_12, main_~u~0=v_main_~u~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~v~0, main_~A~0, main_~u~0] {796#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 03:09:34,802 INFO L290 TraceCheckUtils]: 24: Hoare triple {819#(or (not (= main_~r~0 0)) (= (+ (* main_~v~0 2) (* main_~u~0 main_~u~0)) (+ (* main_~v~0 main_~v~0) (* main_~u~0 2) (* main_~A~0 4))))} [94] L35-1-->L34-3: Formula: (= v_main_~r~0_8 0) InVars {main_~r~0=v_main_~r~0_8} OutVars{main_~r~0=v_main_~r~0_8} AuxVars[] AssignedVars[] {792#(= (+ (* main_~v~0 2) (* main_~u~0 main_~u~0)) (+ (* main_~v~0 main_~v~0) (* main_~u~0 2) (* main_~A~0 4)))} is VALID [2022-04-15 03:09:34,805 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {781#(not (= |__VERIFIER_assert_#in~cond| 0))} {712#true} [105] __VERIFIER_assertEXIT-->L35-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= (+ (* v_main_~r~0_10 4) (* v_main_~A~0_11 4)) (+ (* v_main_~u~0_7 v_main_~u~0_7) (* (- 1) (* v_main_~v~0_7 v_main_~v~0_7)) (* (- 2) v_main_~u~0_7) (* v_main_~v~0_7 2))) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~v~0=v_main_~v~0_7, main_~A~0=v_main_~A~0_11, main_~u~0=v_main_~u~0_7, main_~r~0=v_main_~r~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~v~0, main_~A~0, main_~u~0, main_~r~0] {819#(or (not (= main_~r~0 0)) (= (+ (* main_~v~0 2) (* main_~u~0 main_~u~0)) (+ (* main_~v~0 main_~v~0) (* main_~u~0 2) (* main_~A~0 4))))} is VALID [2022-04-15 03:09:34,805 INFO L290 TraceCheckUtils]: 22: Hoare triple {781#(not (= |__VERIFIER_assert_#in~cond| 0))} [98] L12-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {781#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 03:09:34,806 INFO L290 TraceCheckUtils]: 21: Hoare triple {832#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} [93] L12-->L12-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[] {781#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 03:09:34,806 INFO L290 TraceCheckUtils]: 20: Hoare triple {712#true} [89] __VERIFIER_assertENTRY-->L12: 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] {832#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-15 03:09:34,807 INFO L272 TraceCheckUtils]: 19: Hoare triple {712#true} [90] L35-->__VERIFIER_assertENTRY: Formula: (= (ite (= (+ (* v_main_~r~0_10 4) (* v_main_~A~0_11 4)) (+ (* v_main_~u~0_7 v_main_~u~0_7) (* (- 1) (* v_main_~v~0_7 v_main_~v~0_7)) (* (- 2) v_main_~u~0_7) (* v_main_~v~0_7 2))) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~v~0=v_main_~v~0_7, main_~A~0=v_main_~A~0_11, main_~u~0=v_main_~u~0_7, main_~r~0=v_main_~r~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~v~0, main_~A~0, main_~u~0, main_~r~0] {712#true} is VALID [2022-04-15 03:09:34,807 INFO L290 TraceCheckUtils]: 18: Hoare triple {712#true} [87] L34-1-->L35: Formula: (< |v_main_#t~post6_5| 5) InVars {main_#t~post6=|v_main_#t~post6_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post6] {712#true} is VALID [2022-04-15 03:09:34,807 INFO L290 TraceCheckUtils]: 17: Hoare triple {712#true} [83] L38-2-->L34-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] {712#true} is VALID [2022-04-15 03:09:34,807 INFO L290 TraceCheckUtils]: 16: Hoare triple {712#true} [79] L28-->L38-2: Formula: (and (= v_main_~u~0_5 (+ (* v_main_~R~0_5 2) 1)) (= v_main_~v~0_5 1) (= v_main_~r~0_6 (+ (* v_main_~R~0_5 v_main_~R~0_5) (* (- 1) v_main_~A~0_7)))) InVars {main_~A~0=v_main_~A~0_7, main_~R~0=v_main_~R~0_5} OutVars{main_~v~0=v_main_~v~0_5, main_~A~0=v_main_~A~0_7, main_~R~0=v_main_~R~0_5, main_~u~0=v_main_~u~0_5, main_~r~0=v_main_~r~0_6} AuxVars[] AssignedVars[main_~v~0, main_~u~0, main_~r~0] {712#true} is VALID [2022-04-15 03:09:34,807 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {712#true} {712#true} [103] assume_abort_if_notEXIT-->L28: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (= (let ((.cse0 (mod v_main_~A~0_10 2))) (ite (and (not (= .cse0 0)) (< v_main_~A~0_10 0)) (+ (- 2) .cse0) .cse0)) 1) 1 0)) InVars {main_~A~0=v_main_~A~0_10} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_2|} AuxVars[] AssignedVars[main_~A~0, assume_abort_if_not_#in~cond] {712#true} is VALID [2022-04-15 03:09:34,808 INFO L290 TraceCheckUtils]: 14: Hoare triple {712#true} [84] L9-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {712#true} is VALID [2022-04-15 03:09:34,808 INFO L290 TraceCheckUtils]: 13: Hoare triple {712#true} [81] L9-->L9-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[] {712#true} is VALID [2022-04-15 03:09:34,808 INFO L290 TraceCheckUtils]: 12: Hoare triple {712#true} [78] assume_abort_if_notENTRY-->L9: 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] {712#true} is VALID [2022-04-15 03:09:34,808 INFO L272 TraceCheckUtils]: 11: Hoare triple {712#true} [77] L26-1-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (= (let ((.cse0 (mod v_main_~A~0_10 2))) (ite (and (not (= .cse0 0)) (< v_main_~A~0_10 0)) (+ (- 2) .cse0) .cse0)) 1) 1 0)) InVars {main_~A~0=v_main_~A~0_10} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_2|} AuxVars[] AssignedVars[main_~A~0, assume_abort_if_not_#in~cond] {712#true} is VALID [2022-04-15 03:09:34,808 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {712#true} {712#true} [102] assume_abort_if_notEXIT-->L26-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (< (+ (* v_main_~R~0_6 v_main_~R~0_6) 1) (+ (* v_main_~R~0_6 2) v_main_~A~0_9)) 1 0)) InVars {main_~A~0=v_main_~A~0_9, main_~R~0=v_main_~R~0_6} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~A~0, assume_abort_if_not_#in~cond, main_~R~0] {712#true} is VALID [2022-04-15 03:09:34,809 INFO L290 TraceCheckUtils]: 9: Hoare triple {712#true} [84] L9-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {712#true} is VALID [2022-04-15 03:09:34,809 INFO L290 TraceCheckUtils]: 8: Hoare triple {712#true} [81] L9-->L9-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[] {712#true} is VALID [2022-04-15 03:09:34,809 INFO L290 TraceCheckUtils]: 7: Hoare triple {712#true} [78] assume_abort_if_notENTRY-->L9: 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] {712#true} is VALID [2022-04-15 03:09:34,809 INFO L272 TraceCheckUtils]: 6: Hoare triple {712#true} [76] L26-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (< (+ (* v_main_~R~0_6 v_main_~R~0_6) 1) (+ (* v_main_~R~0_6 2) v_main_~A~0_9)) 1 0)) InVars {main_~A~0=v_main_~A~0_9, main_~R~0=v_main_~R~0_6} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~A~0, assume_abort_if_not_#in~cond, main_~R~0] {712#true} is VALID [2022-04-15 03:09:34,809 INFO L290 TraceCheckUtils]: 5: Hoare triple {712#true} [74] mainENTRY-->L26: Formula: (and (<= |v_main_#t~nondet5_2| 2147483647) (= v_main_~R~0_1 |v_main_#t~nondet5_2|) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= |v_main_#t~nondet4_2| 2147483647) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648)) (= v_main_~A~0_2 |v_main_#t~nondet4_2|)) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|, main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~v~0=v_main_~v~0_4, main_~A~0=v_main_~A~0_2, main_~R~0=v_main_~R~0_1, main_~u~0=v_main_~u~0_4, main_~r~0=v_main_~r~0_5} AuxVars[] AssignedVars[main_#t~nondet5, main_#t~nondet4, main_~v~0, main_~A~0, main_~R~0, main_~u~0, main_~r~0] {712#true} is VALID [2022-04-15 03:09:34,810 INFO L272 TraceCheckUtils]: 4: Hoare triple {712#true} [71] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {712#true} is VALID [2022-04-15 03:09:34,810 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {712#true} {712#true} [101] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {712#true} is VALID [2022-04-15 03:09:34,810 INFO L290 TraceCheckUtils]: 2: Hoare triple {712#true} [75] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {712#true} is VALID [2022-04-15 03:09:34,810 INFO L290 TraceCheckUtils]: 1: Hoare triple {712#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) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#length_1| 2) 13) (= (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] {712#true} is VALID [2022-04-15 03:09:34,810 INFO L272 TraceCheckUtils]: 0: Hoare triple {712#true} [70] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {712#true} is VALID [2022-04-15 03:09:34,811 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-15 03:09:34,811 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 03:09:34,811 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [583451328] [2022-04-15 03:09:34,811 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 03:09:34,811 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [754943998] [2022-04-15 03:09:34,811 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [754943998] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 03:09:34,811 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-15 03:09:34,811 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 10 [2022-04-15 03:09:34,812 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [205489577] [2022-04-15 03:09:34,812 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-15 03:09:34,812 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-15 03:09:34,813 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 03:09:34,813 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-15 03:09:34,844 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-15 03:09:34,846 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-04-15 03:09:34,846 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-15 03:09:34,847 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-04-15 03:09:34,847 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2022-04-15 03:09:34,847 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-15 03:09:35,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 03:09:35,245 INFO L93 Difference]: Finished difference Result 39 states and 42 transitions. [2022-04-15 03:09:35,245 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-15 03:09:35,245 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-15 03:09:35,246 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 03:09:35,246 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-15 03:09:35,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 35 transitions. [2022-04-15 03:09:35,248 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-15 03:09:35,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 35 transitions. [2022-04-15 03:09:35,249 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 35 transitions. [2022-04-15 03:09:35,297 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-15 03:09:35,298 INFO L225 Difference]: With dead ends: 39 [2022-04-15 03:09:35,298 INFO L226 Difference]: Without dead ends: 34 [2022-04-15 03:09:35,299 INFO L912 BasicCegarLoop]: 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-15 03:09:35,299 INFO L913 BasicCegarLoop]: 21 mSDtfsCounter, 23 mSDsluCounter, 94 mSDsCounter, 0 mSdLazyCounter, 64 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 115 SdHoareTripleChecker+Invalid, 70 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 64 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-15 03:09:35,300 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [23 Valid, 115 Invalid, 70 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 64 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-15 03:09:35,300 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2022-04-15 03:09:35,308 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 29. [2022-04-15 03:09:35,308 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 03:09:35,309 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-15 03:09:35,309 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-15 03:09:35,309 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-15 03:09:35,311 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 03:09:35,311 INFO L93 Difference]: Finished difference Result 34 states and 36 transitions. [2022-04-15 03:09:35,311 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 36 transitions. [2022-04-15 03:09:35,312 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 03:09:35,312 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 03:09:35,312 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-15 03:09:35,312 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-15 03:09:35,314 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 03:09:35,314 INFO L93 Difference]: Finished difference Result 34 states and 36 transitions. [2022-04-15 03:09:35,314 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 36 transitions. [2022-04-15 03:09:35,314 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 03:09:35,315 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 03:09:35,315 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 03:09:35,315 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 03:09:35,315 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-15 03:09:35,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 31 transitions. [2022-04-15 03:09:35,316 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 31 transitions. Word has length 29 [2022-04-15 03:09:35,316 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 03:09:35,316 INFO L478 AbstractCegarLoop]: Abstraction has 29 states and 31 transitions. [2022-04-15 03:09:35,317 INFO L479 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-15 03:09:35,317 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 31 transitions. [2022-04-15 03:09:35,317 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-04-15 03:09:35,317 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 03:09:35,318 INFO L499 BasicCegarLoop]: 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-15 03:09:35,345 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-15 03:09:35,530 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 03:09:35,531 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 03:09:35,531 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 03:09:35,531 INFO L85 PathProgramCache]: Analyzing trace with hash 1668946595, now seen corresponding path program 1 times [2022-04-15 03:09:35,531 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 03:09:35,532 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [70038610] [2022-04-15 03:09:35,532 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 03:09:35,532 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 03:09:35,583 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 03:09:35,583 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2075141225] [2022-04-15 03:09:35,583 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 03:09:35,583 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 03:09:35,584 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 03:09:35,585 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-15 03:09:35,589 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-15 03:09:35,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 03:09:35,640 INFO L263 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-15 03:09:35,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 03:09:35,652 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 03:09:35,821 INFO L272 TraceCheckUtils]: 0: Hoare triple {1066#true} [70] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1066#true} is VALID [2022-04-15 03:09:35,822 INFO L290 TraceCheckUtils]: 1: Hoare triple {1066#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) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#length_1| 2) 13) (= (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] {1074#(<= ~counter~0 0)} is VALID [2022-04-15 03:09:35,822 INFO L290 TraceCheckUtils]: 2: Hoare triple {1074#(<= ~counter~0 0)} [75] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1074#(<= ~counter~0 0)} is VALID [2022-04-15 03:09:35,823 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1074#(<= ~counter~0 0)} {1066#true} [101] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1074#(<= ~counter~0 0)} is VALID [2022-04-15 03:09:35,823 INFO L272 TraceCheckUtils]: 4: Hoare triple {1074#(<= ~counter~0 0)} [71] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1074#(<= ~counter~0 0)} is VALID [2022-04-15 03:09:35,823 INFO L290 TraceCheckUtils]: 5: Hoare triple {1074#(<= ~counter~0 0)} [74] mainENTRY-->L26: Formula: (and (<= |v_main_#t~nondet5_2| 2147483647) (= v_main_~R~0_1 |v_main_#t~nondet5_2|) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= |v_main_#t~nondet4_2| 2147483647) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648)) (= v_main_~A~0_2 |v_main_#t~nondet4_2|)) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|, main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~v~0=v_main_~v~0_4, main_~A~0=v_main_~A~0_2, main_~R~0=v_main_~R~0_1, main_~u~0=v_main_~u~0_4, main_~r~0=v_main_~r~0_5} AuxVars[] AssignedVars[main_#t~nondet5, main_#t~nondet4, main_~v~0, main_~A~0, main_~R~0, main_~u~0, main_~r~0] {1074#(<= ~counter~0 0)} is VALID [2022-04-15 03:09:35,824 INFO L272 TraceCheckUtils]: 6: Hoare triple {1074#(<= ~counter~0 0)} [76] L26-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (< (+ (* v_main_~R~0_6 v_main_~R~0_6) 1) (+ (* v_main_~R~0_6 2) v_main_~A~0_9)) 1 0)) InVars {main_~A~0=v_main_~A~0_9, main_~R~0=v_main_~R~0_6} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~A~0, assume_abort_if_not_#in~cond, main_~R~0] {1074#(<= ~counter~0 0)} is VALID [2022-04-15 03:09:35,824 INFO L290 TraceCheckUtils]: 7: Hoare triple {1074#(<= ~counter~0 0)} [78] assume_abort_if_notENTRY-->L9: 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] {1074#(<= ~counter~0 0)} is VALID [2022-04-15 03:09:35,825 INFO L290 TraceCheckUtils]: 8: Hoare triple {1074#(<= ~counter~0 0)} [81] L9-->L9-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[] {1074#(<= ~counter~0 0)} is VALID [2022-04-15 03:09:35,825 INFO L290 TraceCheckUtils]: 9: Hoare triple {1074#(<= ~counter~0 0)} [84] L9-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1074#(<= ~counter~0 0)} is VALID [2022-04-15 03:09:35,826 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1074#(<= ~counter~0 0)} {1074#(<= ~counter~0 0)} [102] assume_abort_if_notEXIT-->L26-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (< (+ (* v_main_~R~0_6 v_main_~R~0_6) 1) (+ (* v_main_~R~0_6 2) v_main_~A~0_9)) 1 0)) InVars {main_~A~0=v_main_~A~0_9, main_~R~0=v_main_~R~0_6} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~A~0, assume_abort_if_not_#in~cond, main_~R~0] {1074#(<= ~counter~0 0)} is VALID [2022-04-15 03:09:35,826 INFO L272 TraceCheckUtils]: 11: Hoare triple {1074#(<= ~counter~0 0)} [77] L26-1-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (= (let ((.cse0 (mod v_main_~A~0_10 2))) (ite (and (not (= .cse0 0)) (< v_main_~A~0_10 0)) (+ (- 2) .cse0) .cse0)) 1) 1 0)) InVars {main_~A~0=v_main_~A~0_10} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_2|} AuxVars[] AssignedVars[main_~A~0, assume_abort_if_not_#in~cond] {1074#(<= ~counter~0 0)} is VALID [2022-04-15 03:09:35,827 INFO L290 TraceCheckUtils]: 12: Hoare triple {1074#(<= ~counter~0 0)} [78] assume_abort_if_notENTRY-->L9: 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] {1074#(<= ~counter~0 0)} is VALID [2022-04-15 03:09:35,827 INFO L290 TraceCheckUtils]: 13: Hoare triple {1074#(<= ~counter~0 0)} [81] L9-->L9-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[] {1074#(<= ~counter~0 0)} is VALID [2022-04-15 03:09:35,827 INFO L290 TraceCheckUtils]: 14: Hoare triple {1074#(<= ~counter~0 0)} [84] L9-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1074#(<= ~counter~0 0)} is VALID [2022-04-15 03:09:35,828 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {1074#(<= ~counter~0 0)} {1074#(<= ~counter~0 0)} [103] assume_abort_if_notEXIT-->L28: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (= (let ((.cse0 (mod v_main_~A~0_10 2))) (ite (and (not (= .cse0 0)) (< v_main_~A~0_10 0)) (+ (- 2) .cse0) .cse0)) 1) 1 0)) InVars {main_~A~0=v_main_~A~0_10} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_2|} AuxVars[] AssignedVars[main_~A~0, assume_abort_if_not_#in~cond] {1074#(<= ~counter~0 0)} is VALID [2022-04-15 03:09:35,830 INFO L290 TraceCheckUtils]: 16: Hoare triple {1074#(<= ~counter~0 0)} [79] L28-->L38-2: Formula: (and (= v_main_~u~0_5 (+ (* v_main_~R~0_5 2) 1)) (= v_main_~v~0_5 1) (= v_main_~r~0_6 (+ (* v_main_~R~0_5 v_main_~R~0_5) (* (- 1) v_main_~A~0_7)))) InVars {main_~A~0=v_main_~A~0_7, main_~R~0=v_main_~R~0_5} OutVars{main_~v~0=v_main_~v~0_5, main_~A~0=v_main_~A~0_7, main_~R~0=v_main_~R~0_5, main_~u~0=v_main_~u~0_5, main_~r~0=v_main_~r~0_6} AuxVars[] AssignedVars[main_~v~0, main_~u~0, main_~r~0] {1074#(<= ~counter~0 0)} is VALID [2022-04-15 03:09:35,832 INFO L290 TraceCheckUtils]: 17: Hoare triple {1074#(<= ~counter~0 0)} [83] L38-2-->L34-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] {1123#(<= ~counter~0 1)} is VALID [2022-04-15 03:09:35,832 INFO L290 TraceCheckUtils]: 18: Hoare triple {1123#(<= ~counter~0 1)} [87] L34-1-->L35: Formula: (< |v_main_#t~post6_5| 5) InVars {main_#t~post6=|v_main_#t~post6_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post6] {1123#(<= ~counter~0 1)} is VALID [2022-04-15 03:09:35,833 INFO L272 TraceCheckUtils]: 19: Hoare triple {1123#(<= ~counter~0 1)} [90] L35-->__VERIFIER_assertENTRY: Formula: (= (ite (= (+ (* v_main_~r~0_10 4) (* v_main_~A~0_11 4)) (+ (* v_main_~u~0_7 v_main_~u~0_7) (* (- 1) (* v_main_~v~0_7 v_main_~v~0_7)) (* (- 2) v_main_~u~0_7) (* v_main_~v~0_7 2))) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~v~0=v_main_~v~0_7, main_~A~0=v_main_~A~0_11, main_~u~0=v_main_~u~0_7, main_~r~0=v_main_~r~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~v~0, main_~A~0, main_~u~0, main_~r~0] {1123#(<= ~counter~0 1)} is VALID [2022-04-15 03:09:35,833 INFO L290 TraceCheckUtils]: 20: Hoare triple {1123#(<= ~counter~0 1)} [89] __VERIFIER_assertENTRY-->L12: 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] {1123#(<= ~counter~0 1)} is VALID [2022-04-15 03:09:35,834 INFO L290 TraceCheckUtils]: 21: Hoare triple {1123#(<= ~counter~0 1)} [93] L12-->L12-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[] {1123#(<= ~counter~0 1)} is VALID [2022-04-15 03:09:35,834 INFO L290 TraceCheckUtils]: 22: Hoare triple {1123#(<= ~counter~0 1)} [98] L12-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1123#(<= ~counter~0 1)} is VALID [2022-04-15 03:09:35,835 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {1123#(<= ~counter~0 1)} {1123#(<= ~counter~0 1)} [105] __VERIFIER_assertEXIT-->L35-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= (+ (* v_main_~r~0_10 4) (* v_main_~A~0_11 4)) (+ (* v_main_~u~0_7 v_main_~u~0_7) (* (- 1) (* v_main_~v~0_7 v_main_~v~0_7)) (* (- 2) v_main_~u~0_7) (* v_main_~v~0_7 2))) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~v~0=v_main_~v~0_7, main_~A~0=v_main_~A~0_11, main_~u~0=v_main_~u~0_7, main_~r~0=v_main_~r~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~v~0, main_~A~0, main_~u~0, main_~r~0] {1123#(<= ~counter~0 1)} is VALID [2022-04-15 03:09:35,835 INFO L290 TraceCheckUtils]: 24: Hoare triple {1123#(<= ~counter~0 1)} [95] L35-1-->L38: Formula: (not (= v_main_~r~0_9 0)) InVars {main_~r~0=v_main_~r~0_9} OutVars{main_~r~0=v_main_~r~0_9} AuxVars[] AssignedVars[] {1123#(<= ~counter~0 1)} is VALID [2022-04-15 03:09:35,836 INFO L290 TraceCheckUtils]: 25: Hoare triple {1123#(<= ~counter~0 1)} [99] L38-->L38-2: Formula: (and (< 0 v_main_~r~0_2) (= (+ v_main_~r~0_2 (* (- 1) v_main_~v~0_2)) v_main_~r~0_1) (= (+ v_main_~v~0_2 2) v_main_~v~0_1)) InVars {main_~v~0=v_main_~v~0_2, main_~r~0=v_main_~r~0_2} OutVars{main_~v~0=v_main_~v~0_1, main_~r~0=v_main_~r~0_1} AuxVars[] AssignedVars[main_~v~0, main_~r~0] {1123#(<= ~counter~0 1)} is VALID [2022-04-15 03:09:35,836 INFO L290 TraceCheckUtils]: 26: Hoare triple {1123#(<= ~counter~0 1)} [83] L38-2-->L34-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] {1151#(<= |main_#t~post6| 1)} is VALID [2022-04-15 03:09:35,837 INFO L290 TraceCheckUtils]: 27: Hoare triple {1151#(<= |main_#t~post6| 1)} [86] L34-1-->L34-3: Formula: (not (< |v_main_#t~post6_3| 5)) InVars {main_#t~post6=|v_main_#t~post6_3|} OutVars{} AuxVars[] AssignedVars[main_#t~post6] {1067#false} is VALID [2022-04-15 03:09:35,837 INFO L272 TraceCheckUtils]: 28: Hoare triple {1067#false} [85] L34-3-->__VERIFIER_assertENTRY: Formula: (= (ite (= (+ (* (- 2) v_main_~u~0_8) (* v_main_~v~0_8 2) (* v_main_~u~0_8 v_main_~u~0_8) (* (- 1) (* v_main_~v~0_8 v_main_~v~0_8))) (* v_main_~A~0_12 4)) 1 0) |v___VERIFIER_assert_#in~condInParam_2|) InVars {main_~v~0=v_main_~v~0_8, main_~A~0=v_main_~A~0_12, main_~u~0=v_main_~u~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~v~0, main_~A~0, main_~u~0] {1067#false} is VALID [2022-04-15 03:09:35,837 INFO L290 TraceCheckUtils]: 29: Hoare triple {1067#false} [89] __VERIFIER_assertENTRY-->L12: 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] {1067#false} is VALID [2022-04-15 03:09:35,837 INFO L290 TraceCheckUtils]: 30: Hoare triple {1067#false} [92] L12-->L13: 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[] {1067#false} is VALID [2022-04-15 03:09:35,837 INFO L290 TraceCheckUtils]: 31: Hoare triple {1067#false} [96] L13-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1067#false} is VALID [2022-04-15 03:09:35,838 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-15 03:09:35,838 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 03:09:36,038 INFO L290 TraceCheckUtils]: 31: Hoare triple {1067#false} [96] L13-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1067#false} is VALID [2022-04-15 03:09:36,039 INFO L290 TraceCheckUtils]: 30: Hoare triple {1067#false} [92] L12-->L13: 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[] {1067#false} is VALID [2022-04-15 03:09:36,039 INFO L290 TraceCheckUtils]: 29: Hoare triple {1067#false} [89] __VERIFIER_assertENTRY-->L12: 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] {1067#false} is VALID [2022-04-15 03:09:36,039 INFO L272 TraceCheckUtils]: 28: Hoare triple {1067#false} [85] L34-3-->__VERIFIER_assertENTRY: Formula: (= (ite (= (+ (* (- 2) v_main_~u~0_8) (* v_main_~v~0_8 2) (* v_main_~u~0_8 v_main_~u~0_8) (* (- 1) (* v_main_~v~0_8 v_main_~v~0_8))) (* v_main_~A~0_12 4)) 1 0) |v___VERIFIER_assert_#in~condInParam_2|) InVars {main_~v~0=v_main_~v~0_8, main_~A~0=v_main_~A~0_12, main_~u~0=v_main_~u~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~v~0, main_~A~0, main_~u~0] {1067#false} is VALID [2022-04-15 03:09:36,039 INFO L290 TraceCheckUtils]: 27: Hoare triple {1179#(< |main_#t~post6| 5)} [86] L34-1-->L34-3: Formula: (not (< |v_main_#t~post6_3| 5)) InVars {main_#t~post6=|v_main_#t~post6_3|} OutVars{} AuxVars[] AssignedVars[main_#t~post6] {1067#false} is VALID [2022-04-15 03:09:36,040 INFO L290 TraceCheckUtils]: 26: Hoare triple {1183#(< ~counter~0 5)} [83] L38-2-->L34-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] {1179#(< |main_#t~post6| 5)} is VALID [2022-04-15 03:09:36,040 INFO L290 TraceCheckUtils]: 25: Hoare triple {1183#(< ~counter~0 5)} [99] L38-->L38-2: Formula: (and (< 0 v_main_~r~0_2) (= (+ v_main_~r~0_2 (* (- 1) v_main_~v~0_2)) v_main_~r~0_1) (= (+ v_main_~v~0_2 2) v_main_~v~0_1)) InVars {main_~v~0=v_main_~v~0_2, main_~r~0=v_main_~r~0_2} OutVars{main_~v~0=v_main_~v~0_1, main_~r~0=v_main_~r~0_1} AuxVars[] AssignedVars[main_~v~0, main_~r~0] {1183#(< ~counter~0 5)} is VALID [2022-04-15 03:09:36,041 INFO L290 TraceCheckUtils]: 24: Hoare triple {1183#(< ~counter~0 5)} [95] L35-1-->L38: Formula: (not (= v_main_~r~0_9 0)) InVars {main_~r~0=v_main_~r~0_9} OutVars{main_~r~0=v_main_~r~0_9} AuxVars[] AssignedVars[] {1183#(< ~counter~0 5)} is VALID [2022-04-15 03:09:36,041 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {1066#true} {1183#(< ~counter~0 5)} [105] __VERIFIER_assertEXIT-->L35-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= (+ (* v_main_~r~0_10 4) (* v_main_~A~0_11 4)) (+ (* v_main_~u~0_7 v_main_~u~0_7) (* (- 1) (* v_main_~v~0_7 v_main_~v~0_7)) (* (- 2) v_main_~u~0_7) (* v_main_~v~0_7 2))) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~v~0=v_main_~v~0_7, main_~A~0=v_main_~A~0_11, main_~u~0=v_main_~u~0_7, main_~r~0=v_main_~r~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~v~0, main_~A~0, main_~u~0, main_~r~0] {1183#(< ~counter~0 5)} is VALID [2022-04-15 03:09:36,042 INFO L290 TraceCheckUtils]: 22: Hoare triple {1066#true} [98] L12-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1066#true} is VALID [2022-04-15 03:09:36,042 INFO L290 TraceCheckUtils]: 21: Hoare triple {1066#true} [93] L12-->L12-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[] {1066#true} is VALID [2022-04-15 03:09:36,042 INFO L290 TraceCheckUtils]: 20: Hoare triple {1066#true} [89] __VERIFIER_assertENTRY-->L12: 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] {1066#true} is VALID [2022-04-15 03:09:36,042 INFO L272 TraceCheckUtils]: 19: Hoare triple {1183#(< ~counter~0 5)} [90] L35-->__VERIFIER_assertENTRY: Formula: (= (ite (= (+ (* v_main_~r~0_10 4) (* v_main_~A~0_11 4)) (+ (* v_main_~u~0_7 v_main_~u~0_7) (* (- 1) (* v_main_~v~0_7 v_main_~v~0_7)) (* (- 2) v_main_~u~0_7) (* v_main_~v~0_7 2))) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~v~0=v_main_~v~0_7, main_~A~0=v_main_~A~0_11, main_~u~0=v_main_~u~0_7, main_~r~0=v_main_~r~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~v~0, main_~A~0, main_~u~0, main_~r~0] {1066#true} is VALID [2022-04-15 03:09:36,042 INFO L290 TraceCheckUtils]: 18: Hoare triple {1183#(< ~counter~0 5)} [87] L34-1-->L35: Formula: (< |v_main_#t~post6_5| 5) InVars {main_#t~post6=|v_main_#t~post6_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post6] {1183#(< ~counter~0 5)} is VALID [2022-04-15 03:09:36,043 INFO L290 TraceCheckUtils]: 17: Hoare triple {1211#(< ~counter~0 4)} [83] L38-2-->L34-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] {1183#(< ~counter~0 5)} is VALID [2022-04-15 03:09:36,044 INFO L290 TraceCheckUtils]: 16: Hoare triple {1211#(< ~counter~0 4)} [79] L28-->L38-2: Formula: (and (= v_main_~u~0_5 (+ (* v_main_~R~0_5 2) 1)) (= v_main_~v~0_5 1) (= v_main_~r~0_6 (+ (* v_main_~R~0_5 v_main_~R~0_5) (* (- 1) v_main_~A~0_7)))) InVars {main_~A~0=v_main_~A~0_7, main_~R~0=v_main_~R~0_5} OutVars{main_~v~0=v_main_~v~0_5, main_~A~0=v_main_~A~0_7, main_~R~0=v_main_~R~0_5, main_~u~0=v_main_~u~0_5, main_~r~0=v_main_~r~0_6} AuxVars[] AssignedVars[main_~v~0, main_~u~0, main_~r~0] {1211#(< ~counter~0 4)} is VALID [2022-04-15 03:09:36,044 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {1066#true} {1211#(< ~counter~0 4)} [103] assume_abort_if_notEXIT-->L28: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (= (let ((.cse0 (mod v_main_~A~0_10 2))) (ite (and (not (= .cse0 0)) (< v_main_~A~0_10 0)) (+ (- 2) .cse0) .cse0)) 1) 1 0)) InVars {main_~A~0=v_main_~A~0_10} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_2|} AuxVars[] AssignedVars[main_~A~0, assume_abort_if_not_#in~cond] {1211#(< ~counter~0 4)} is VALID [2022-04-15 03:09:36,044 INFO L290 TraceCheckUtils]: 14: Hoare triple {1066#true} [84] L9-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1066#true} is VALID [2022-04-15 03:09:36,045 INFO L290 TraceCheckUtils]: 13: Hoare triple {1066#true} [81] L9-->L9-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[] {1066#true} is VALID [2022-04-15 03:09:36,045 INFO L290 TraceCheckUtils]: 12: Hoare triple {1066#true} [78] assume_abort_if_notENTRY-->L9: 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] {1066#true} is VALID [2022-04-15 03:09:36,045 INFO L272 TraceCheckUtils]: 11: Hoare triple {1211#(< ~counter~0 4)} [77] L26-1-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (= (let ((.cse0 (mod v_main_~A~0_10 2))) (ite (and (not (= .cse0 0)) (< v_main_~A~0_10 0)) (+ (- 2) .cse0) .cse0)) 1) 1 0)) InVars {main_~A~0=v_main_~A~0_10} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_2|} AuxVars[] AssignedVars[main_~A~0, assume_abort_if_not_#in~cond] {1066#true} is VALID [2022-04-15 03:09:36,046 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1066#true} {1211#(< ~counter~0 4)} [102] assume_abort_if_notEXIT-->L26-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (< (+ (* v_main_~R~0_6 v_main_~R~0_6) 1) (+ (* v_main_~R~0_6 2) v_main_~A~0_9)) 1 0)) InVars {main_~A~0=v_main_~A~0_9, main_~R~0=v_main_~R~0_6} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~A~0, assume_abort_if_not_#in~cond, main_~R~0] {1211#(< ~counter~0 4)} is VALID [2022-04-15 03:09:36,046 INFO L290 TraceCheckUtils]: 9: Hoare triple {1066#true} [84] L9-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1066#true} is VALID [2022-04-15 03:09:36,046 INFO L290 TraceCheckUtils]: 8: Hoare triple {1066#true} [81] L9-->L9-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[] {1066#true} is VALID [2022-04-15 03:09:36,046 INFO L290 TraceCheckUtils]: 7: Hoare triple {1066#true} [78] assume_abort_if_notENTRY-->L9: 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] {1066#true} is VALID [2022-04-15 03:09:36,046 INFO L272 TraceCheckUtils]: 6: Hoare triple {1211#(< ~counter~0 4)} [76] L26-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (< (+ (* v_main_~R~0_6 v_main_~R~0_6) 1) (+ (* v_main_~R~0_6 2) v_main_~A~0_9)) 1 0)) InVars {main_~A~0=v_main_~A~0_9, main_~R~0=v_main_~R~0_6} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~A~0, assume_abort_if_not_#in~cond, main_~R~0] {1066#true} is VALID [2022-04-15 03:09:36,055 INFO L290 TraceCheckUtils]: 5: Hoare triple {1211#(< ~counter~0 4)} [74] mainENTRY-->L26: Formula: (and (<= |v_main_#t~nondet5_2| 2147483647) (= v_main_~R~0_1 |v_main_#t~nondet5_2|) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= |v_main_#t~nondet4_2| 2147483647) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648)) (= v_main_~A~0_2 |v_main_#t~nondet4_2|)) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|, main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~v~0=v_main_~v~0_4, main_~A~0=v_main_~A~0_2, main_~R~0=v_main_~R~0_1, main_~u~0=v_main_~u~0_4, main_~r~0=v_main_~r~0_5} AuxVars[] AssignedVars[main_#t~nondet5, main_#t~nondet4, main_~v~0, main_~A~0, main_~R~0, main_~u~0, main_~r~0] {1211#(< ~counter~0 4)} is VALID [2022-04-15 03:09:36,056 INFO L272 TraceCheckUtils]: 4: Hoare triple {1211#(< ~counter~0 4)} [71] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1211#(< ~counter~0 4)} is VALID [2022-04-15 03:09:36,057 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1211#(< ~counter~0 4)} {1066#true} [101] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1211#(< ~counter~0 4)} is VALID [2022-04-15 03:09:36,057 INFO L290 TraceCheckUtils]: 2: Hoare triple {1211#(< ~counter~0 4)} [75] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1211#(< ~counter~0 4)} is VALID [2022-04-15 03:09:36,058 INFO L290 TraceCheckUtils]: 1: Hoare triple {1066#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) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#length_1| 2) 13) (= (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] {1211#(< ~counter~0 4)} is VALID [2022-04-15 03:09:36,058 INFO L272 TraceCheckUtils]: 0: Hoare triple {1066#true} [70] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1066#true} is VALID [2022-04-15 03:09:36,058 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-15 03:09:36,058 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 03:09:36,058 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [70038610] [2022-04-15 03:09:36,058 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 03:09:36,059 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2075141225] [2022-04-15 03:09:36,059 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2075141225] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 03:09:36,059 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-15 03:09:36,059 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2022-04-15 03:09:36,059 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [246634366] [2022-04-15 03:09:36,059 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-15 03:09:36,060 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-15 03:09:36,062 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 03:09:36,063 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-15 03:09:36,106 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-15 03:09:36,106 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-15 03:09:36,106 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-15 03:09:36,107 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-15 03:09:36,107 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2022-04-15 03:09:36,107 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-15 03:09:36,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 03:09:36,345 INFO L93 Difference]: Finished difference Result 61 states and 68 transitions. [2022-04-15 03:09:36,345 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-04-15 03:09:36,346 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-15 03:09:36,346 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 03:09:36,346 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-15 03:09:36,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 67 transitions. [2022-04-15 03:09:36,349 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-15 03:09:36,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 67 transitions. [2022-04-15 03:09:36,351 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 10 states and 67 transitions. [2022-04-15 03:09:36,419 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-15 03:09:36,420 INFO L225 Difference]: With dead ends: 61 [2022-04-15 03:09:36,421 INFO L226 Difference]: Without dead ends: 56 [2022-04-15 03:09:36,421 INFO L912 BasicCegarLoop]: 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-15 03:09:36,422 INFO L913 BasicCegarLoop]: 29 mSDtfsCounter, 32 mSDsluCounter, 99 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 128 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-15 03:09:36,422 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [32 Valid, 128 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-15 03:09:36,423 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2022-04-15 03:09:36,442 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2022-04-15 03:09:36,442 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 03:09:36,442 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-15 03:09:36,443 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-15 03:09:36,443 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-15 03:09:36,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 03:09:36,446 INFO L93 Difference]: Finished difference Result 56 states and 61 transitions. [2022-04-15 03:09:36,446 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 61 transitions. [2022-04-15 03:09:36,446 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 03:09:36,446 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 03:09:36,447 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-15 03:09:36,447 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-15 03:09:36,449 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 03:09:36,449 INFO L93 Difference]: Finished difference Result 56 states and 61 transitions. [2022-04-15 03:09:36,450 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 61 transitions. [2022-04-15 03:09:36,450 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 03:09:36,450 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 03:09:36,450 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 03:09:36,450 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 03:09:36,451 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-15 03:09:36,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 61 transitions. [2022-04-15 03:09:36,453 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 61 transitions. Word has length 32 [2022-04-15 03:09:36,453 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 03:09:36,453 INFO L478 AbstractCegarLoop]: Abstraction has 56 states and 61 transitions. [2022-04-15 03:09:36,453 INFO L479 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-15 03:09:36,453 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 61 transitions. [2022-04-15 03:09:36,454 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2022-04-15 03:09:36,455 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 03:09:36,455 INFO L499 BasicCegarLoop]: 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-15 03:09:36,484 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-15 03:09:36,683 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 03:09:36,684 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 03:09:36,684 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 03:09:36,684 INFO L85 PathProgramCache]: Analyzing trace with hash -906969448, now seen corresponding path program 2 times [2022-04-15 03:09:36,684 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 03:09:36,684 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2131221816] [2022-04-15 03:09:36,684 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 03:09:36,685 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 03:09:36,733 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 03:09:36,734 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [314722515] [2022-04-15 03:09:36,734 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 03:09:36,734 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 03:09:36,734 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 03:09:36,735 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-15 03:09:36,740 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-15 03:09:36,802 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-15 03:09:36,802 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 03:09:36,804 INFO L263 TraceCheckSpWp]: Trace formula consists of 173 conjuncts, 13 conjunts are in the unsatisfiable core [2022-04-15 03:09:36,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 03:09:36,822 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 03:09:37,225 INFO L272 TraceCheckUtils]: 0: Hoare triple {1546#true} [70] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1546#true} is VALID [2022-04-15 03:09:37,226 INFO L290 TraceCheckUtils]: 1: Hoare triple {1546#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) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#length_1| 2) 13) (= (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] {1554#(<= ~counter~0 0)} is VALID [2022-04-15 03:09:37,227 INFO L290 TraceCheckUtils]: 2: Hoare triple {1554#(<= ~counter~0 0)} [75] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1554#(<= ~counter~0 0)} is VALID [2022-04-15 03:09:37,227 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1554#(<= ~counter~0 0)} {1546#true} [101] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1554#(<= ~counter~0 0)} is VALID [2022-04-15 03:09:37,228 INFO L272 TraceCheckUtils]: 4: Hoare triple {1554#(<= ~counter~0 0)} [71] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1554#(<= ~counter~0 0)} is VALID [2022-04-15 03:09:37,228 INFO L290 TraceCheckUtils]: 5: Hoare triple {1554#(<= ~counter~0 0)} [74] mainENTRY-->L26: Formula: (and (<= |v_main_#t~nondet5_2| 2147483647) (= v_main_~R~0_1 |v_main_#t~nondet5_2|) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= |v_main_#t~nondet4_2| 2147483647) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648)) (= v_main_~A~0_2 |v_main_#t~nondet4_2|)) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|, main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~v~0=v_main_~v~0_4, main_~A~0=v_main_~A~0_2, main_~R~0=v_main_~R~0_1, main_~u~0=v_main_~u~0_4, main_~r~0=v_main_~r~0_5} AuxVars[] AssignedVars[main_#t~nondet5, main_#t~nondet4, main_~v~0, main_~A~0, main_~R~0, main_~u~0, main_~r~0] {1554#(<= ~counter~0 0)} is VALID [2022-04-15 03:09:37,229 INFO L272 TraceCheckUtils]: 6: Hoare triple {1554#(<= ~counter~0 0)} [76] L26-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (< (+ (* v_main_~R~0_6 v_main_~R~0_6) 1) (+ (* v_main_~R~0_6 2) v_main_~A~0_9)) 1 0)) InVars {main_~A~0=v_main_~A~0_9, main_~R~0=v_main_~R~0_6} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~A~0, assume_abort_if_not_#in~cond, main_~R~0] {1554#(<= ~counter~0 0)} is VALID [2022-04-15 03:09:37,229 INFO L290 TraceCheckUtils]: 7: Hoare triple {1554#(<= ~counter~0 0)} [78] assume_abort_if_notENTRY-->L9: 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] {1554#(<= ~counter~0 0)} is VALID [2022-04-15 03:09:37,234 INFO L290 TraceCheckUtils]: 8: Hoare triple {1554#(<= ~counter~0 0)} [81] L9-->L9-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[] {1554#(<= ~counter~0 0)} is VALID [2022-04-15 03:09:37,234 INFO L290 TraceCheckUtils]: 9: Hoare triple {1554#(<= ~counter~0 0)} [84] L9-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1554#(<= ~counter~0 0)} is VALID [2022-04-15 03:09:37,235 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1554#(<= ~counter~0 0)} {1554#(<= ~counter~0 0)} [102] assume_abort_if_notEXIT-->L26-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (< (+ (* v_main_~R~0_6 v_main_~R~0_6) 1) (+ (* v_main_~R~0_6 2) v_main_~A~0_9)) 1 0)) InVars {main_~A~0=v_main_~A~0_9, main_~R~0=v_main_~R~0_6} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~A~0, assume_abort_if_not_#in~cond, main_~R~0] {1554#(<= ~counter~0 0)} is VALID [2022-04-15 03:09:37,236 INFO L272 TraceCheckUtils]: 11: Hoare triple {1554#(<= ~counter~0 0)} [77] L26-1-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (= (let ((.cse0 (mod v_main_~A~0_10 2))) (ite (and (not (= .cse0 0)) (< v_main_~A~0_10 0)) (+ (- 2) .cse0) .cse0)) 1) 1 0)) InVars {main_~A~0=v_main_~A~0_10} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_2|} AuxVars[] AssignedVars[main_~A~0, assume_abort_if_not_#in~cond] {1554#(<= ~counter~0 0)} is VALID [2022-04-15 03:09:37,236 INFO L290 TraceCheckUtils]: 12: Hoare triple {1554#(<= ~counter~0 0)} [78] assume_abort_if_notENTRY-->L9: 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] {1554#(<= ~counter~0 0)} is VALID [2022-04-15 03:09:37,236 INFO L290 TraceCheckUtils]: 13: Hoare triple {1554#(<= ~counter~0 0)} [81] L9-->L9-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[] {1554#(<= ~counter~0 0)} is VALID [2022-04-15 03:09:37,237 INFO L290 TraceCheckUtils]: 14: Hoare triple {1554#(<= ~counter~0 0)} [84] L9-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1554#(<= ~counter~0 0)} is VALID [2022-04-15 03:09:37,237 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {1554#(<= ~counter~0 0)} {1554#(<= ~counter~0 0)} [103] assume_abort_if_notEXIT-->L28: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (= (let ((.cse0 (mod v_main_~A~0_10 2))) (ite (and (not (= .cse0 0)) (< v_main_~A~0_10 0)) (+ (- 2) .cse0) .cse0)) 1) 1 0)) InVars {main_~A~0=v_main_~A~0_10} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_2|} AuxVars[] AssignedVars[main_~A~0, assume_abort_if_not_#in~cond] {1554#(<= ~counter~0 0)} is VALID [2022-04-15 03:09:37,238 INFO L290 TraceCheckUtils]: 16: Hoare triple {1554#(<= ~counter~0 0)} [79] L28-->L38-2: Formula: (and (= v_main_~u~0_5 (+ (* v_main_~R~0_5 2) 1)) (= v_main_~v~0_5 1) (= v_main_~r~0_6 (+ (* v_main_~R~0_5 v_main_~R~0_5) (* (- 1) v_main_~A~0_7)))) InVars {main_~A~0=v_main_~A~0_7, main_~R~0=v_main_~R~0_5} OutVars{main_~v~0=v_main_~v~0_5, main_~A~0=v_main_~A~0_7, main_~R~0=v_main_~R~0_5, main_~u~0=v_main_~u~0_5, main_~r~0=v_main_~r~0_6} AuxVars[] AssignedVars[main_~v~0, main_~u~0, main_~r~0] {1554#(<= ~counter~0 0)} is VALID [2022-04-15 03:09:37,238 INFO L290 TraceCheckUtils]: 17: Hoare triple {1554#(<= ~counter~0 0)} [83] L38-2-->L34-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] {1603#(<= ~counter~0 1)} is VALID [2022-04-15 03:09:37,239 INFO L290 TraceCheckUtils]: 18: Hoare triple {1603#(<= ~counter~0 1)} [87] L34-1-->L35: Formula: (< |v_main_#t~post6_5| 5) InVars {main_#t~post6=|v_main_#t~post6_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post6] {1603#(<= ~counter~0 1)} is VALID [2022-04-15 03:09:37,241 INFO L272 TraceCheckUtils]: 19: Hoare triple {1603#(<= ~counter~0 1)} [90] L35-->__VERIFIER_assertENTRY: Formula: (= (ite (= (+ (* v_main_~r~0_10 4) (* v_main_~A~0_11 4)) (+ (* v_main_~u~0_7 v_main_~u~0_7) (* (- 1) (* v_main_~v~0_7 v_main_~v~0_7)) (* (- 2) v_main_~u~0_7) (* v_main_~v~0_7 2))) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~v~0=v_main_~v~0_7, main_~A~0=v_main_~A~0_11, main_~u~0=v_main_~u~0_7, main_~r~0=v_main_~r~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~v~0, main_~A~0, main_~u~0, main_~r~0] {1603#(<= ~counter~0 1)} is VALID [2022-04-15 03:09:37,242 INFO L290 TraceCheckUtils]: 20: Hoare triple {1603#(<= ~counter~0 1)} [89] __VERIFIER_assertENTRY-->L12: 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] {1603#(<= ~counter~0 1)} is VALID [2022-04-15 03:09:37,242 INFO L290 TraceCheckUtils]: 21: Hoare triple {1603#(<= ~counter~0 1)} [93] L12-->L12-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[] {1603#(<= ~counter~0 1)} is VALID [2022-04-15 03:09:37,243 INFO L290 TraceCheckUtils]: 22: Hoare triple {1603#(<= ~counter~0 1)} [98] L12-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1603#(<= ~counter~0 1)} is VALID [2022-04-15 03:09:37,244 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {1603#(<= ~counter~0 1)} {1603#(<= ~counter~0 1)} [105] __VERIFIER_assertEXIT-->L35-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= (+ (* v_main_~r~0_10 4) (* v_main_~A~0_11 4)) (+ (* v_main_~u~0_7 v_main_~u~0_7) (* (- 1) (* v_main_~v~0_7 v_main_~v~0_7)) (* (- 2) v_main_~u~0_7) (* v_main_~v~0_7 2))) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~v~0=v_main_~v~0_7, main_~A~0=v_main_~A~0_11, main_~u~0=v_main_~u~0_7, main_~r~0=v_main_~r~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~v~0, main_~A~0, main_~u~0, main_~r~0] {1603#(<= ~counter~0 1)} is VALID [2022-04-15 03:09:37,244 INFO L290 TraceCheckUtils]: 24: Hoare triple {1603#(<= ~counter~0 1)} [95] L35-1-->L38: Formula: (not (= v_main_~r~0_9 0)) InVars {main_~r~0=v_main_~r~0_9} OutVars{main_~r~0=v_main_~r~0_9} AuxVars[] AssignedVars[] {1603#(<= ~counter~0 1)} is VALID [2022-04-15 03:09:37,245 INFO L290 TraceCheckUtils]: 25: Hoare triple {1603#(<= ~counter~0 1)} [99] L38-->L38-2: Formula: (and (< 0 v_main_~r~0_2) (= (+ v_main_~r~0_2 (* (- 1) v_main_~v~0_2)) v_main_~r~0_1) (= (+ v_main_~v~0_2 2) v_main_~v~0_1)) InVars {main_~v~0=v_main_~v~0_2, main_~r~0=v_main_~r~0_2} OutVars{main_~v~0=v_main_~v~0_1, main_~r~0=v_main_~r~0_1} AuxVars[] AssignedVars[main_~v~0, main_~r~0] {1603#(<= ~counter~0 1)} is VALID [2022-04-15 03:09:37,245 INFO L290 TraceCheckUtils]: 26: Hoare triple {1603#(<= ~counter~0 1)} [83] L38-2-->L34-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] {1631#(<= ~counter~0 2)} is VALID [2022-04-15 03:09:37,246 INFO L290 TraceCheckUtils]: 27: Hoare triple {1631#(<= ~counter~0 2)} [87] L34-1-->L35: Formula: (< |v_main_#t~post6_5| 5) InVars {main_#t~post6=|v_main_#t~post6_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post6] {1631#(<= ~counter~0 2)} is VALID [2022-04-15 03:09:37,247 INFO L272 TraceCheckUtils]: 28: Hoare triple {1631#(<= ~counter~0 2)} [90] L35-->__VERIFIER_assertENTRY: Formula: (= (ite (= (+ (* v_main_~r~0_10 4) (* v_main_~A~0_11 4)) (+ (* v_main_~u~0_7 v_main_~u~0_7) (* (- 1) (* v_main_~v~0_7 v_main_~v~0_7)) (* (- 2) v_main_~u~0_7) (* v_main_~v~0_7 2))) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~v~0=v_main_~v~0_7, main_~A~0=v_main_~A~0_11, main_~u~0=v_main_~u~0_7, main_~r~0=v_main_~r~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~v~0, main_~A~0, main_~u~0, main_~r~0] {1631#(<= ~counter~0 2)} is VALID [2022-04-15 03:09:37,247 INFO L290 TraceCheckUtils]: 29: Hoare triple {1631#(<= ~counter~0 2)} [89] __VERIFIER_assertENTRY-->L12: 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] {1631#(<= ~counter~0 2)} is VALID [2022-04-15 03:09:37,248 INFO L290 TraceCheckUtils]: 30: Hoare triple {1631#(<= ~counter~0 2)} [93] L12-->L12-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[] {1631#(<= ~counter~0 2)} is VALID [2022-04-15 03:09:37,248 INFO L290 TraceCheckUtils]: 31: Hoare triple {1631#(<= ~counter~0 2)} [98] L12-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1631#(<= ~counter~0 2)} is VALID [2022-04-15 03:09:37,249 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {1631#(<= ~counter~0 2)} {1631#(<= ~counter~0 2)} [105] __VERIFIER_assertEXIT-->L35-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= (+ (* v_main_~r~0_10 4) (* v_main_~A~0_11 4)) (+ (* v_main_~u~0_7 v_main_~u~0_7) (* (- 1) (* v_main_~v~0_7 v_main_~v~0_7)) (* (- 2) v_main_~u~0_7) (* v_main_~v~0_7 2))) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~v~0=v_main_~v~0_7, main_~A~0=v_main_~A~0_11, main_~u~0=v_main_~u~0_7, main_~r~0=v_main_~r~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~v~0, main_~A~0, main_~u~0, main_~r~0] {1631#(<= ~counter~0 2)} is VALID [2022-04-15 03:09:37,249 INFO L290 TraceCheckUtils]: 33: Hoare triple {1631#(<= ~counter~0 2)} [95] L35-1-->L38: Formula: (not (= v_main_~r~0_9 0)) InVars {main_~r~0=v_main_~r~0_9} OutVars{main_~r~0=v_main_~r~0_9} AuxVars[] AssignedVars[] {1631#(<= ~counter~0 2)} is VALID [2022-04-15 03:09:37,250 INFO L290 TraceCheckUtils]: 34: Hoare triple {1631#(<= ~counter~0 2)} [99] L38-->L38-2: Formula: (and (< 0 v_main_~r~0_2) (= (+ v_main_~r~0_2 (* (- 1) v_main_~v~0_2)) v_main_~r~0_1) (= (+ v_main_~v~0_2 2) v_main_~v~0_1)) InVars {main_~v~0=v_main_~v~0_2, main_~r~0=v_main_~r~0_2} OutVars{main_~v~0=v_main_~v~0_1, main_~r~0=v_main_~r~0_1} AuxVars[] AssignedVars[main_~v~0, main_~r~0] {1631#(<= ~counter~0 2)} is VALID [2022-04-15 03:09:37,251 INFO L290 TraceCheckUtils]: 35: Hoare triple {1631#(<= ~counter~0 2)} [83] L38-2-->L34-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] {1659#(<= ~counter~0 3)} is VALID [2022-04-15 03:09:37,252 INFO L290 TraceCheckUtils]: 36: Hoare triple {1659#(<= ~counter~0 3)} [87] L34-1-->L35: Formula: (< |v_main_#t~post6_5| 5) InVars {main_#t~post6=|v_main_#t~post6_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post6] {1659#(<= ~counter~0 3)} is VALID [2022-04-15 03:09:37,253 INFO L272 TraceCheckUtils]: 37: Hoare triple {1659#(<= ~counter~0 3)} [90] L35-->__VERIFIER_assertENTRY: Formula: (= (ite (= (+ (* v_main_~r~0_10 4) (* v_main_~A~0_11 4)) (+ (* v_main_~u~0_7 v_main_~u~0_7) (* (- 1) (* v_main_~v~0_7 v_main_~v~0_7)) (* (- 2) v_main_~u~0_7) (* v_main_~v~0_7 2))) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~v~0=v_main_~v~0_7, main_~A~0=v_main_~A~0_11, main_~u~0=v_main_~u~0_7, main_~r~0=v_main_~r~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~v~0, main_~A~0, main_~u~0, main_~r~0] {1659#(<= ~counter~0 3)} is VALID [2022-04-15 03:09:37,253 INFO L290 TraceCheckUtils]: 38: Hoare triple {1659#(<= ~counter~0 3)} [89] __VERIFIER_assertENTRY-->L12: 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] {1659#(<= ~counter~0 3)} is VALID [2022-04-15 03:09:37,254 INFO L290 TraceCheckUtils]: 39: Hoare triple {1659#(<= ~counter~0 3)} [93] L12-->L12-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[] {1659#(<= ~counter~0 3)} is VALID [2022-04-15 03:09:37,254 INFO L290 TraceCheckUtils]: 40: Hoare triple {1659#(<= ~counter~0 3)} [98] L12-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1659#(<= ~counter~0 3)} is VALID [2022-04-15 03:09:37,255 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {1659#(<= ~counter~0 3)} {1659#(<= ~counter~0 3)} [105] __VERIFIER_assertEXIT-->L35-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= (+ (* v_main_~r~0_10 4) (* v_main_~A~0_11 4)) (+ (* v_main_~u~0_7 v_main_~u~0_7) (* (- 1) (* v_main_~v~0_7 v_main_~v~0_7)) (* (- 2) v_main_~u~0_7) (* v_main_~v~0_7 2))) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~v~0=v_main_~v~0_7, main_~A~0=v_main_~A~0_11, main_~u~0=v_main_~u~0_7, main_~r~0=v_main_~r~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~v~0, main_~A~0, main_~u~0, main_~r~0] {1659#(<= ~counter~0 3)} is VALID [2022-04-15 03:09:37,255 INFO L290 TraceCheckUtils]: 42: Hoare triple {1659#(<= ~counter~0 3)} [95] L35-1-->L38: Formula: (not (= v_main_~r~0_9 0)) InVars {main_~r~0=v_main_~r~0_9} OutVars{main_~r~0=v_main_~r~0_9} AuxVars[] AssignedVars[] {1659#(<= ~counter~0 3)} is VALID [2022-04-15 03:09:37,267 INFO L290 TraceCheckUtils]: 43: Hoare triple {1659#(<= ~counter~0 3)} [99] L38-->L38-2: Formula: (and (< 0 v_main_~r~0_2) (= (+ v_main_~r~0_2 (* (- 1) v_main_~v~0_2)) v_main_~r~0_1) (= (+ v_main_~v~0_2 2) v_main_~v~0_1)) InVars {main_~v~0=v_main_~v~0_2, main_~r~0=v_main_~r~0_2} OutVars{main_~v~0=v_main_~v~0_1, main_~r~0=v_main_~r~0_1} AuxVars[] AssignedVars[main_~v~0, main_~r~0] {1659#(<= ~counter~0 3)} is VALID [2022-04-15 03:09:37,268 INFO L290 TraceCheckUtils]: 44: Hoare triple {1659#(<= ~counter~0 3)} [83] L38-2-->L34-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] {1687#(<= ~counter~0 4)} is VALID [2022-04-15 03:09:37,269 INFO L290 TraceCheckUtils]: 45: Hoare triple {1687#(<= ~counter~0 4)} [87] L34-1-->L35: Formula: (< |v_main_#t~post6_5| 5) InVars {main_#t~post6=|v_main_#t~post6_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post6] {1687#(<= ~counter~0 4)} is VALID [2022-04-15 03:09:37,270 INFO L272 TraceCheckUtils]: 46: Hoare triple {1687#(<= ~counter~0 4)} [90] L35-->__VERIFIER_assertENTRY: Formula: (= (ite (= (+ (* v_main_~r~0_10 4) (* v_main_~A~0_11 4)) (+ (* v_main_~u~0_7 v_main_~u~0_7) (* (- 1) (* v_main_~v~0_7 v_main_~v~0_7)) (* (- 2) v_main_~u~0_7) (* v_main_~v~0_7 2))) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~v~0=v_main_~v~0_7, main_~A~0=v_main_~A~0_11, main_~u~0=v_main_~u~0_7, main_~r~0=v_main_~r~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~v~0, main_~A~0, main_~u~0, main_~r~0] {1687#(<= ~counter~0 4)} is VALID [2022-04-15 03:09:37,275 INFO L290 TraceCheckUtils]: 47: Hoare triple {1687#(<= ~counter~0 4)} [89] __VERIFIER_assertENTRY-->L12: 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] {1687#(<= ~counter~0 4)} is VALID [2022-04-15 03:09:37,276 INFO L290 TraceCheckUtils]: 48: Hoare triple {1687#(<= ~counter~0 4)} [93] L12-->L12-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[] {1687#(<= ~counter~0 4)} is VALID [2022-04-15 03:09:37,276 INFO L290 TraceCheckUtils]: 49: Hoare triple {1687#(<= ~counter~0 4)} [98] L12-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1687#(<= ~counter~0 4)} is VALID [2022-04-15 03:09:37,277 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {1687#(<= ~counter~0 4)} {1687#(<= ~counter~0 4)} [105] __VERIFIER_assertEXIT-->L35-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= (+ (* v_main_~r~0_10 4) (* v_main_~A~0_11 4)) (+ (* v_main_~u~0_7 v_main_~u~0_7) (* (- 1) (* v_main_~v~0_7 v_main_~v~0_7)) (* (- 2) v_main_~u~0_7) (* v_main_~v~0_7 2))) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~v~0=v_main_~v~0_7, main_~A~0=v_main_~A~0_11, main_~u~0=v_main_~u~0_7, main_~r~0=v_main_~r~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~v~0, main_~A~0, main_~u~0, main_~r~0] {1687#(<= ~counter~0 4)} is VALID [2022-04-15 03:09:37,278 INFO L290 TraceCheckUtils]: 51: Hoare triple {1687#(<= ~counter~0 4)} [95] L35-1-->L38: Formula: (not (= v_main_~r~0_9 0)) InVars {main_~r~0=v_main_~r~0_9} OutVars{main_~r~0=v_main_~r~0_9} AuxVars[] AssignedVars[] {1687#(<= ~counter~0 4)} is VALID [2022-04-15 03:09:37,278 INFO L290 TraceCheckUtils]: 52: Hoare triple {1687#(<= ~counter~0 4)} [99] L38-->L38-2: Formula: (and (< 0 v_main_~r~0_2) (= (+ v_main_~r~0_2 (* (- 1) v_main_~v~0_2)) v_main_~r~0_1) (= (+ v_main_~v~0_2 2) v_main_~v~0_1)) InVars {main_~v~0=v_main_~v~0_2, main_~r~0=v_main_~r~0_2} OutVars{main_~v~0=v_main_~v~0_1, main_~r~0=v_main_~r~0_1} AuxVars[] AssignedVars[main_~v~0, main_~r~0] {1687#(<= ~counter~0 4)} is VALID [2022-04-15 03:09:37,279 INFO L290 TraceCheckUtils]: 53: Hoare triple {1687#(<= ~counter~0 4)} [83] L38-2-->L34-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] {1715#(<= |main_#t~post6| 4)} is VALID [2022-04-15 03:09:37,279 INFO L290 TraceCheckUtils]: 54: Hoare triple {1715#(<= |main_#t~post6| 4)} [86] L34-1-->L34-3: Formula: (not (< |v_main_#t~post6_3| 5)) InVars {main_#t~post6=|v_main_#t~post6_3|} OutVars{} AuxVars[] AssignedVars[main_#t~post6] {1547#false} is VALID [2022-04-15 03:09:37,279 INFO L272 TraceCheckUtils]: 55: Hoare triple {1547#false} [85] L34-3-->__VERIFIER_assertENTRY: Formula: (= (ite (= (+ (* (- 2) v_main_~u~0_8) (* v_main_~v~0_8 2) (* v_main_~u~0_8 v_main_~u~0_8) (* (- 1) (* v_main_~v~0_8 v_main_~v~0_8))) (* v_main_~A~0_12 4)) 1 0) |v___VERIFIER_assert_#in~condInParam_2|) InVars {main_~v~0=v_main_~v~0_8, main_~A~0=v_main_~A~0_12, main_~u~0=v_main_~u~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~v~0, main_~A~0, main_~u~0] {1547#false} is VALID [2022-04-15 03:09:37,279 INFO L290 TraceCheckUtils]: 56: Hoare triple {1547#false} [89] __VERIFIER_assertENTRY-->L12: 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] {1547#false} is VALID [2022-04-15 03:09:37,279 INFO L290 TraceCheckUtils]: 57: Hoare triple {1547#false} [92] L12-->L13: 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[] {1547#false} is VALID [2022-04-15 03:09:37,280 INFO L290 TraceCheckUtils]: 58: Hoare triple {1547#false} [96] L13-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1547#false} is VALID [2022-04-15 03:09:37,280 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-15 03:09:37,280 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 03:09:37,685 INFO L290 TraceCheckUtils]: 58: Hoare triple {1547#false} [96] L13-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1547#false} is VALID [2022-04-15 03:09:37,685 INFO L290 TraceCheckUtils]: 57: Hoare triple {1547#false} [92] L12-->L13: 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[] {1547#false} is VALID [2022-04-15 03:09:37,685 INFO L290 TraceCheckUtils]: 56: Hoare triple {1547#false} [89] __VERIFIER_assertENTRY-->L12: 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] {1547#false} is VALID [2022-04-15 03:09:37,685 INFO L272 TraceCheckUtils]: 55: Hoare triple {1547#false} [85] L34-3-->__VERIFIER_assertENTRY: Formula: (= (ite (= (+ (* (- 2) v_main_~u~0_8) (* v_main_~v~0_8 2) (* v_main_~u~0_8 v_main_~u~0_8) (* (- 1) (* v_main_~v~0_8 v_main_~v~0_8))) (* v_main_~A~0_12 4)) 1 0) |v___VERIFIER_assert_#in~condInParam_2|) InVars {main_~v~0=v_main_~v~0_8, main_~A~0=v_main_~A~0_12, main_~u~0=v_main_~u~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~v~0, main_~A~0, main_~u~0] {1547#false} is VALID [2022-04-15 03:09:37,686 INFO L290 TraceCheckUtils]: 54: Hoare triple {1715#(<= |main_#t~post6| 4)} [86] L34-1-->L34-3: Formula: (not (< |v_main_#t~post6_3| 5)) InVars {main_#t~post6=|v_main_#t~post6_3|} OutVars{} AuxVars[] AssignedVars[main_#t~post6] {1547#false} is VALID [2022-04-15 03:09:37,686 INFO L290 TraceCheckUtils]: 53: Hoare triple {1687#(<= ~counter~0 4)} [83] L38-2-->L34-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] {1715#(<= |main_#t~post6| 4)} is VALID [2022-04-15 03:09:37,687 INFO L290 TraceCheckUtils]: 52: Hoare triple {1687#(<= ~counter~0 4)} [99] L38-->L38-2: Formula: (and (< 0 v_main_~r~0_2) (= (+ v_main_~r~0_2 (* (- 1) v_main_~v~0_2)) v_main_~r~0_1) (= (+ v_main_~v~0_2 2) v_main_~v~0_1)) InVars {main_~v~0=v_main_~v~0_2, main_~r~0=v_main_~r~0_2} OutVars{main_~v~0=v_main_~v~0_1, main_~r~0=v_main_~r~0_1} AuxVars[] AssignedVars[main_~v~0, main_~r~0] {1687#(<= ~counter~0 4)} is VALID [2022-04-15 03:09:37,687 INFO L290 TraceCheckUtils]: 51: Hoare triple {1687#(<= ~counter~0 4)} [95] L35-1-->L38: Formula: (not (= v_main_~r~0_9 0)) InVars {main_~r~0=v_main_~r~0_9} OutVars{main_~r~0=v_main_~r~0_9} AuxVars[] AssignedVars[] {1687#(<= ~counter~0 4)} is VALID [2022-04-15 03:09:37,688 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {1546#true} {1687#(<= ~counter~0 4)} [105] __VERIFIER_assertEXIT-->L35-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= (+ (* v_main_~r~0_10 4) (* v_main_~A~0_11 4)) (+ (* v_main_~u~0_7 v_main_~u~0_7) (* (- 1) (* v_main_~v~0_7 v_main_~v~0_7)) (* (- 2) v_main_~u~0_7) (* v_main_~v~0_7 2))) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~v~0=v_main_~v~0_7, main_~A~0=v_main_~A~0_11, main_~u~0=v_main_~u~0_7, main_~r~0=v_main_~r~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~v~0, main_~A~0, main_~u~0, main_~r~0] {1687#(<= ~counter~0 4)} is VALID [2022-04-15 03:09:37,688 INFO L290 TraceCheckUtils]: 49: Hoare triple {1546#true} [98] L12-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1546#true} is VALID [2022-04-15 03:09:37,688 INFO L290 TraceCheckUtils]: 48: Hoare triple {1546#true} [93] L12-->L12-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[] {1546#true} is VALID [2022-04-15 03:09:37,688 INFO L290 TraceCheckUtils]: 47: Hoare triple {1546#true} [89] __VERIFIER_assertENTRY-->L12: 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] {1546#true} is VALID [2022-04-15 03:09:37,689 INFO L272 TraceCheckUtils]: 46: Hoare triple {1687#(<= ~counter~0 4)} [90] L35-->__VERIFIER_assertENTRY: Formula: (= (ite (= (+ (* v_main_~r~0_10 4) (* v_main_~A~0_11 4)) (+ (* v_main_~u~0_7 v_main_~u~0_7) (* (- 1) (* v_main_~v~0_7 v_main_~v~0_7)) (* (- 2) v_main_~u~0_7) (* v_main_~v~0_7 2))) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~v~0=v_main_~v~0_7, main_~A~0=v_main_~A~0_11, main_~u~0=v_main_~u~0_7, main_~r~0=v_main_~r~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~v~0, main_~A~0, main_~u~0, main_~r~0] {1546#true} is VALID [2022-04-15 03:09:37,689 INFO L290 TraceCheckUtils]: 45: Hoare triple {1687#(<= ~counter~0 4)} [87] L34-1-->L35: Formula: (< |v_main_#t~post6_5| 5) InVars {main_#t~post6=|v_main_#t~post6_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post6] {1687#(<= ~counter~0 4)} is VALID [2022-04-15 03:09:37,690 INFO L290 TraceCheckUtils]: 44: Hoare triple {1659#(<= ~counter~0 3)} [83] L38-2-->L34-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] {1687#(<= ~counter~0 4)} is VALID [2022-04-15 03:09:37,690 INFO L290 TraceCheckUtils]: 43: Hoare triple {1659#(<= ~counter~0 3)} [99] L38-->L38-2: Formula: (and (< 0 v_main_~r~0_2) (= (+ v_main_~r~0_2 (* (- 1) v_main_~v~0_2)) v_main_~r~0_1) (= (+ v_main_~v~0_2 2) v_main_~v~0_1)) InVars {main_~v~0=v_main_~v~0_2, main_~r~0=v_main_~r~0_2} OutVars{main_~v~0=v_main_~v~0_1, main_~r~0=v_main_~r~0_1} AuxVars[] AssignedVars[main_~v~0, main_~r~0] {1659#(<= ~counter~0 3)} is VALID [2022-04-15 03:09:37,690 INFO L290 TraceCheckUtils]: 42: Hoare triple {1659#(<= ~counter~0 3)} [95] L35-1-->L38: Formula: (not (= v_main_~r~0_9 0)) InVars {main_~r~0=v_main_~r~0_9} OutVars{main_~r~0=v_main_~r~0_9} AuxVars[] AssignedVars[] {1659#(<= ~counter~0 3)} is VALID [2022-04-15 03:09:37,691 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {1546#true} {1659#(<= ~counter~0 3)} [105] __VERIFIER_assertEXIT-->L35-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= (+ (* v_main_~r~0_10 4) (* v_main_~A~0_11 4)) (+ (* v_main_~u~0_7 v_main_~u~0_7) (* (- 1) (* v_main_~v~0_7 v_main_~v~0_7)) (* (- 2) v_main_~u~0_7) (* v_main_~v~0_7 2))) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~v~0=v_main_~v~0_7, main_~A~0=v_main_~A~0_11, main_~u~0=v_main_~u~0_7, main_~r~0=v_main_~r~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~v~0, main_~A~0, main_~u~0, main_~r~0] {1659#(<= ~counter~0 3)} is VALID [2022-04-15 03:09:37,691 INFO L290 TraceCheckUtils]: 40: Hoare triple {1546#true} [98] L12-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1546#true} is VALID [2022-04-15 03:09:37,691 INFO L290 TraceCheckUtils]: 39: Hoare triple {1546#true} [93] L12-->L12-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[] {1546#true} is VALID [2022-04-15 03:09:37,692 INFO L290 TraceCheckUtils]: 38: Hoare triple {1546#true} [89] __VERIFIER_assertENTRY-->L12: 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] {1546#true} is VALID [2022-04-15 03:09:37,692 INFO L272 TraceCheckUtils]: 37: Hoare triple {1659#(<= ~counter~0 3)} [90] L35-->__VERIFIER_assertENTRY: Formula: (= (ite (= (+ (* v_main_~r~0_10 4) (* v_main_~A~0_11 4)) (+ (* v_main_~u~0_7 v_main_~u~0_7) (* (- 1) (* v_main_~v~0_7 v_main_~v~0_7)) (* (- 2) v_main_~u~0_7) (* v_main_~v~0_7 2))) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~v~0=v_main_~v~0_7, main_~A~0=v_main_~A~0_11, main_~u~0=v_main_~u~0_7, main_~r~0=v_main_~r~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~v~0, main_~A~0, main_~u~0, main_~r~0] {1546#true} is VALID [2022-04-15 03:09:37,692 INFO L290 TraceCheckUtils]: 36: Hoare triple {1659#(<= ~counter~0 3)} [87] L34-1-->L35: Formula: (< |v_main_#t~post6_5| 5) InVars {main_#t~post6=|v_main_#t~post6_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post6] {1659#(<= ~counter~0 3)} is VALID [2022-04-15 03:09:37,693 INFO L290 TraceCheckUtils]: 35: Hoare triple {1631#(<= ~counter~0 2)} [83] L38-2-->L34-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] {1659#(<= ~counter~0 3)} is VALID [2022-04-15 03:09:37,693 INFO L290 TraceCheckUtils]: 34: Hoare triple {1631#(<= ~counter~0 2)} [99] L38-->L38-2: Formula: (and (< 0 v_main_~r~0_2) (= (+ v_main_~r~0_2 (* (- 1) v_main_~v~0_2)) v_main_~r~0_1) (= (+ v_main_~v~0_2 2) v_main_~v~0_1)) InVars {main_~v~0=v_main_~v~0_2, main_~r~0=v_main_~r~0_2} OutVars{main_~v~0=v_main_~v~0_1, main_~r~0=v_main_~r~0_1} AuxVars[] AssignedVars[main_~v~0, main_~r~0] {1631#(<= ~counter~0 2)} is VALID [2022-04-15 03:09:37,693 INFO L290 TraceCheckUtils]: 33: Hoare triple {1631#(<= ~counter~0 2)} [95] L35-1-->L38: Formula: (not (= v_main_~r~0_9 0)) InVars {main_~r~0=v_main_~r~0_9} OutVars{main_~r~0=v_main_~r~0_9} AuxVars[] AssignedVars[] {1631#(<= ~counter~0 2)} is VALID [2022-04-15 03:09:37,694 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {1546#true} {1631#(<= ~counter~0 2)} [105] __VERIFIER_assertEXIT-->L35-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= (+ (* v_main_~r~0_10 4) (* v_main_~A~0_11 4)) (+ (* v_main_~u~0_7 v_main_~u~0_7) (* (- 1) (* v_main_~v~0_7 v_main_~v~0_7)) (* (- 2) v_main_~u~0_7) (* v_main_~v~0_7 2))) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~v~0=v_main_~v~0_7, main_~A~0=v_main_~A~0_11, main_~u~0=v_main_~u~0_7, main_~r~0=v_main_~r~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~v~0, main_~A~0, main_~u~0, main_~r~0] {1631#(<= ~counter~0 2)} is VALID [2022-04-15 03:09:37,694 INFO L290 TraceCheckUtils]: 31: Hoare triple {1546#true} [98] L12-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1546#true} is VALID [2022-04-15 03:09:37,695 INFO L290 TraceCheckUtils]: 30: Hoare triple {1546#true} [93] L12-->L12-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[] {1546#true} is VALID [2022-04-15 03:09:37,695 INFO L290 TraceCheckUtils]: 29: Hoare triple {1546#true} [89] __VERIFIER_assertENTRY-->L12: 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] {1546#true} is VALID [2022-04-15 03:09:37,695 INFO L272 TraceCheckUtils]: 28: Hoare triple {1631#(<= ~counter~0 2)} [90] L35-->__VERIFIER_assertENTRY: Formula: (= (ite (= (+ (* v_main_~r~0_10 4) (* v_main_~A~0_11 4)) (+ (* v_main_~u~0_7 v_main_~u~0_7) (* (- 1) (* v_main_~v~0_7 v_main_~v~0_7)) (* (- 2) v_main_~u~0_7) (* v_main_~v~0_7 2))) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~v~0=v_main_~v~0_7, main_~A~0=v_main_~A~0_11, main_~u~0=v_main_~u~0_7, main_~r~0=v_main_~r~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~v~0, main_~A~0, main_~u~0, main_~r~0] {1546#true} is VALID [2022-04-15 03:09:37,695 INFO L290 TraceCheckUtils]: 27: Hoare triple {1631#(<= ~counter~0 2)} [87] L34-1-->L35: Formula: (< |v_main_#t~post6_5| 5) InVars {main_#t~post6=|v_main_#t~post6_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post6] {1631#(<= ~counter~0 2)} is VALID [2022-04-15 03:09:37,696 INFO L290 TraceCheckUtils]: 26: Hoare triple {1603#(<= ~counter~0 1)} [83] L38-2-->L34-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] {1631#(<= ~counter~0 2)} is VALID [2022-04-15 03:09:37,696 INFO L290 TraceCheckUtils]: 25: Hoare triple {1603#(<= ~counter~0 1)} [99] L38-->L38-2: Formula: (and (< 0 v_main_~r~0_2) (= (+ v_main_~r~0_2 (* (- 1) v_main_~v~0_2)) v_main_~r~0_1) (= (+ v_main_~v~0_2 2) v_main_~v~0_1)) InVars {main_~v~0=v_main_~v~0_2, main_~r~0=v_main_~r~0_2} OutVars{main_~v~0=v_main_~v~0_1, main_~r~0=v_main_~r~0_1} AuxVars[] AssignedVars[main_~v~0, main_~r~0] {1603#(<= ~counter~0 1)} is VALID [2022-04-15 03:09:37,697 INFO L290 TraceCheckUtils]: 24: Hoare triple {1603#(<= ~counter~0 1)} [95] L35-1-->L38: Formula: (not (= v_main_~r~0_9 0)) InVars {main_~r~0=v_main_~r~0_9} OutVars{main_~r~0=v_main_~r~0_9} AuxVars[] AssignedVars[] {1603#(<= ~counter~0 1)} is VALID [2022-04-15 03:09:37,697 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {1546#true} {1603#(<= ~counter~0 1)} [105] __VERIFIER_assertEXIT-->L35-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= (+ (* v_main_~r~0_10 4) (* v_main_~A~0_11 4)) (+ (* v_main_~u~0_7 v_main_~u~0_7) (* (- 1) (* v_main_~v~0_7 v_main_~v~0_7)) (* (- 2) v_main_~u~0_7) (* v_main_~v~0_7 2))) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~v~0=v_main_~v~0_7, main_~A~0=v_main_~A~0_11, main_~u~0=v_main_~u~0_7, main_~r~0=v_main_~r~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~v~0, main_~A~0, main_~u~0, main_~r~0] {1603#(<= ~counter~0 1)} is VALID [2022-04-15 03:09:37,697 INFO L290 TraceCheckUtils]: 22: Hoare triple {1546#true} [98] L12-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1546#true} is VALID [2022-04-15 03:09:37,698 INFO L290 TraceCheckUtils]: 21: Hoare triple {1546#true} [93] L12-->L12-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[] {1546#true} is VALID [2022-04-15 03:09:37,698 INFO L290 TraceCheckUtils]: 20: Hoare triple {1546#true} [89] __VERIFIER_assertENTRY-->L12: 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] {1546#true} is VALID [2022-04-15 03:09:37,698 INFO L272 TraceCheckUtils]: 19: Hoare triple {1603#(<= ~counter~0 1)} [90] L35-->__VERIFIER_assertENTRY: Formula: (= (ite (= (+ (* v_main_~r~0_10 4) (* v_main_~A~0_11 4)) (+ (* v_main_~u~0_7 v_main_~u~0_7) (* (- 1) (* v_main_~v~0_7 v_main_~v~0_7)) (* (- 2) v_main_~u~0_7) (* v_main_~v~0_7 2))) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~v~0=v_main_~v~0_7, main_~A~0=v_main_~A~0_11, main_~u~0=v_main_~u~0_7, main_~r~0=v_main_~r~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~v~0, main_~A~0, main_~u~0, main_~r~0] {1546#true} is VALID [2022-04-15 03:09:37,698 INFO L290 TraceCheckUtils]: 18: Hoare triple {1603#(<= ~counter~0 1)} [87] L34-1-->L35: Formula: (< |v_main_#t~post6_5| 5) InVars {main_#t~post6=|v_main_#t~post6_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post6] {1603#(<= ~counter~0 1)} is VALID [2022-04-15 03:09:37,699 INFO L290 TraceCheckUtils]: 17: Hoare triple {1554#(<= ~counter~0 0)} [83] L38-2-->L34-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] {1603#(<= ~counter~0 1)} is VALID [2022-04-15 03:09:37,699 INFO L290 TraceCheckUtils]: 16: Hoare triple {1554#(<= ~counter~0 0)} [79] L28-->L38-2: Formula: (and (= v_main_~u~0_5 (+ (* v_main_~R~0_5 2) 1)) (= v_main_~v~0_5 1) (= v_main_~r~0_6 (+ (* v_main_~R~0_5 v_main_~R~0_5) (* (- 1) v_main_~A~0_7)))) InVars {main_~A~0=v_main_~A~0_7, main_~R~0=v_main_~R~0_5} OutVars{main_~v~0=v_main_~v~0_5, main_~A~0=v_main_~A~0_7, main_~R~0=v_main_~R~0_5, main_~u~0=v_main_~u~0_5, main_~r~0=v_main_~r~0_6} AuxVars[] AssignedVars[main_~v~0, main_~u~0, main_~r~0] {1554#(<= ~counter~0 0)} is VALID [2022-04-15 03:09:37,700 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {1546#true} {1554#(<= ~counter~0 0)} [103] assume_abort_if_notEXIT-->L28: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (= (let ((.cse0 (mod v_main_~A~0_10 2))) (ite (and (not (= .cse0 0)) (< v_main_~A~0_10 0)) (+ (- 2) .cse0) .cse0)) 1) 1 0)) InVars {main_~A~0=v_main_~A~0_10} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_2|} AuxVars[] AssignedVars[main_~A~0, assume_abort_if_not_#in~cond] {1554#(<= ~counter~0 0)} is VALID [2022-04-15 03:09:37,700 INFO L290 TraceCheckUtils]: 14: Hoare triple {1546#true} [84] L9-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1546#true} is VALID [2022-04-15 03:09:37,700 INFO L290 TraceCheckUtils]: 13: Hoare triple {1546#true} [81] L9-->L9-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[] {1546#true} is VALID [2022-04-15 03:09:37,700 INFO L290 TraceCheckUtils]: 12: Hoare triple {1546#true} [78] assume_abort_if_notENTRY-->L9: 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] {1546#true} is VALID [2022-04-15 03:09:37,700 INFO L272 TraceCheckUtils]: 11: Hoare triple {1554#(<= ~counter~0 0)} [77] L26-1-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (= (let ((.cse0 (mod v_main_~A~0_10 2))) (ite (and (not (= .cse0 0)) (< v_main_~A~0_10 0)) (+ (- 2) .cse0) .cse0)) 1) 1 0)) InVars {main_~A~0=v_main_~A~0_10} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_2|} AuxVars[] AssignedVars[main_~A~0, assume_abort_if_not_#in~cond] {1546#true} is VALID [2022-04-15 03:09:37,701 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1546#true} {1554#(<= ~counter~0 0)} [102] assume_abort_if_notEXIT-->L26-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (< (+ (* v_main_~R~0_6 v_main_~R~0_6) 1) (+ (* v_main_~R~0_6 2) v_main_~A~0_9)) 1 0)) InVars {main_~A~0=v_main_~A~0_9, main_~R~0=v_main_~R~0_6} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~A~0, assume_abort_if_not_#in~cond, main_~R~0] {1554#(<= ~counter~0 0)} is VALID [2022-04-15 03:09:37,701 INFO L290 TraceCheckUtils]: 9: Hoare triple {1546#true} [84] L9-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1546#true} is VALID [2022-04-15 03:09:37,701 INFO L290 TraceCheckUtils]: 8: Hoare triple {1546#true} [81] L9-->L9-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[] {1546#true} is VALID [2022-04-15 03:09:37,701 INFO L290 TraceCheckUtils]: 7: Hoare triple {1546#true} [78] assume_abort_if_notENTRY-->L9: 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] {1546#true} is VALID [2022-04-15 03:09:37,701 INFO L272 TraceCheckUtils]: 6: Hoare triple {1554#(<= ~counter~0 0)} [76] L26-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (< (+ (* v_main_~R~0_6 v_main_~R~0_6) 1) (+ (* v_main_~R~0_6 2) v_main_~A~0_9)) 1 0)) InVars {main_~A~0=v_main_~A~0_9, main_~R~0=v_main_~R~0_6} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~A~0, assume_abort_if_not_#in~cond, main_~R~0] {1546#true} is VALID [2022-04-15 03:09:37,702 INFO L290 TraceCheckUtils]: 5: Hoare triple {1554#(<= ~counter~0 0)} [74] mainENTRY-->L26: Formula: (and (<= |v_main_#t~nondet5_2| 2147483647) (= v_main_~R~0_1 |v_main_#t~nondet5_2|) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= |v_main_#t~nondet4_2| 2147483647) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648)) (= v_main_~A~0_2 |v_main_#t~nondet4_2|)) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|, main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~v~0=v_main_~v~0_4, main_~A~0=v_main_~A~0_2, main_~R~0=v_main_~R~0_1, main_~u~0=v_main_~u~0_4, main_~r~0=v_main_~r~0_5} AuxVars[] AssignedVars[main_#t~nondet5, main_#t~nondet4, main_~v~0, main_~A~0, main_~R~0, main_~u~0, main_~r~0] {1554#(<= ~counter~0 0)} is VALID [2022-04-15 03:09:37,702 INFO L272 TraceCheckUtils]: 4: Hoare triple {1554#(<= ~counter~0 0)} [71] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1554#(<= ~counter~0 0)} is VALID [2022-04-15 03:09:37,703 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1554#(<= ~counter~0 0)} {1546#true} [101] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1554#(<= ~counter~0 0)} is VALID [2022-04-15 03:09:37,703 INFO L290 TraceCheckUtils]: 2: Hoare triple {1554#(<= ~counter~0 0)} [75] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1554#(<= ~counter~0 0)} is VALID [2022-04-15 03:09:37,704 INFO L290 TraceCheckUtils]: 1: Hoare triple {1546#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) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#length_1| 2) 13) (= (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] {1554#(<= ~counter~0 0)} is VALID [2022-04-15 03:09:37,704 INFO L272 TraceCheckUtils]: 0: Hoare triple {1546#true} [70] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1546#true} is VALID [2022-04-15 03:09:37,704 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-15 03:09:37,705 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 03:09:37,705 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2131221816] [2022-04-15 03:09:37,705 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 03:09:37,705 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [314722515] [2022-04-15 03:09:37,705 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [314722515] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 03:09:37,705 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-15 03:09:37,705 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 8 [2022-04-15 03:09:37,705 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [293738297] [2022-04-15 03:09:37,705 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-15 03:09:37,706 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.75) internal successors, (46), 8 states have internal predecessors, (46), 7 states have call successors, (15), 7 states have call predecessors, (15), 6 states have return successors, (13), 5 states have call predecessors, (13), 6 states have call successors, (13) Word has length 59 [2022-04-15 03:09:37,709 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 03:09:37,710 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 8 states, 8 states have (on average 5.75) internal successors, (46), 8 states have internal predecessors, (46), 7 states have call successors, (15), 7 states have call predecessors, (15), 6 states have return successors, (13), 5 states have call predecessors, (13), 6 states have call successors, (13) [2022-04-15 03:09:37,775 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 74 edges. 74 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 03:09:37,776 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-15 03:09:37,776 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-15 03:09:37,776 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-15 03:09:37,776 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2022-04-15 03:09:37,777 INFO L87 Difference]: Start difference. First operand 56 states and 61 transitions. Second operand has 8 states, 8 states have (on average 5.75) internal successors, (46), 8 states have internal predecessors, (46), 7 states have call successors, (15), 7 states have call predecessors, (15), 6 states have return successors, (13), 5 states have call predecessors, (13), 6 states have call successors, (13) [2022-04-15 03:09:37,972 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 03:09:37,972 INFO L93 Difference]: Finished difference Result 70 states and 76 transitions. [2022-04-15 03:09:37,972 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-04-15 03:09:37,973 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.75) internal successors, (46), 8 states have internal predecessors, (46), 7 states have call successors, (15), 7 states have call predecessors, (15), 6 states have return successors, (13), 5 states have call predecessors, (13), 6 states have call successors, (13) Word has length 59 [2022-04-15 03:09:37,973 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 03:09:37,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 5.75) internal successors, (46), 8 states have internal predecessors, (46), 7 states have call successors, (15), 7 states have call predecessors, (15), 6 states have return successors, (13), 5 states have call predecessors, (13), 6 states have call successors, (13) [2022-04-15 03:09:37,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 75 transitions. [2022-04-15 03:09:37,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 5.75) internal successors, (46), 8 states have internal predecessors, (46), 7 states have call successors, (15), 7 states have call predecessors, (15), 6 states have return successors, (13), 5 states have call predecessors, (13), 6 states have call successors, (13) [2022-04-15 03:09:37,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 75 transitions. [2022-04-15 03:09:37,979 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 12 states and 75 transitions. [2022-04-15 03:09:38,040 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 75 edges. 75 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 03:09:38,042 INFO L225 Difference]: With dead ends: 70 [2022-04-15 03:09:38,042 INFO L226 Difference]: Without dead ends: 65 [2022-04-15 03:09:38,043 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 110 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=81, Unknown=0, NotChecked=0, Total=132 [2022-04-15 03:09:38,043 INFO L913 BasicCegarLoop]: 30 mSDtfsCounter, 10 mSDsluCounter, 84 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 114 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 03:09:38,044 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [10 Valid, 114 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 03:09:38,044 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2022-04-15 03:09:38,065 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2022-04-15 03:09:38,065 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 03:09:38,066 INFO L82 GeneralOperation]: Start isEquivalent. First operand 65 states. Second operand has 65 states, 47 states have (on average 1.127659574468085) internal successors, (53), 47 states have internal predecessors, (53), 10 states have call successors, (10), 9 states have call predecessors, (10), 7 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-15 03:09:38,066 INFO L74 IsIncluded]: Start isIncluded. First operand 65 states. Second operand has 65 states, 47 states have (on average 1.127659574468085) internal successors, (53), 47 states have internal predecessors, (53), 10 states have call successors, (10), 9 states have call predecessors, (10), 7 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-15 03:09:38,067 INFO L87 Difference]: Start difference. First operand 65 states. Second operand has 65 states, 47 states have (on average 1.127659574468085) internal successors, (53), 47 states have internal predecessors, (53), 10 states have call successors, (10), 9 states have call predecessors, (10), 7 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-15 03:09:38,069 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 03:09:38,069 INFO L93 Difference]: Finished difference Result 65 states and 71 transitions. [2022-04-15 03:09:38,069 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 71 transitions. [2022-04-15 03:09:38,069 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 03:09:38,070 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 03:09:38,070 INFO L74 IsIncluded]: Start isIncluded. First operand has 65 states, 47 states have (on average 1.127659574468085) internal successors, (53), 47 states have internal predecessors, (53), 10 states have call successors, (10), 9 states have call predecessors, (10), 7 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Second operand 65 states. [2022-04-15 03:09:38,070 INFO L87 Difference]: Start difference. First operand has 65 states, 47 states have (on average 1.127659574468085) internal successors, (53), 47 states have internal predecessors, (53), 10 states have call successors, (10), 9 states have call predecessors, (10), 7 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Second operand 65 states. [2022-04-15 03:09:38,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 03:09:38,073 INFO L93 Difference]: Finished difference Result 65 states and 71 transitions. [2022-04-15 03:09:38,073 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 71 transitions. [2022-04-15 03:09:38,073 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 03:09:38,073 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 03:09:38,073 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 03:09:38,073 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 03:09:38,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 47 states have (on average 1.127659574468085) internal successors, (53), 47 states have internal predecessors, (53), 10 states have call successors, (10), 9 states have call predecessors, (10), 7 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-15 03:09:38,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 71 transitions. [2022-04-15 03:09:38,076 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 71 transitions. Word has length 59 [2022-04-15 03:09:38,076 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 03:09:38,076 INFO L478 AbstractCegarLoop]: Abstraction has 65 states and 71 transitions. [2022-04-15 03:09:38,077 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.75) internal successors, (46), 8 states have internal predecessors, (46), 7 states have call successors, (15), 7 states have call predecessors, (15), 6 states have return successors, (13), 5 states have call predecessors, (13), 6 states have call successors, (13) [2022-04-15 03:09:38,077 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 71 transitions. [2022-04-15 03:09:38,077 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2022-04-15 03:09:38,077 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 03:09:38,078 INFO L499 BasicCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 5, 5, 5, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 03:09:38,107 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-04-15 03:09:38,291 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 03:09:38,291 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 03:09:38,292 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 03:09:38,292 INFO L85 PathProgramCache]: Analyzing trace with hash 1572135395, now seen corresponding path program 3 times [2022-04-15 03:09:38,292 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 03:09:38,292 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1848031466] [2022-04-15 03:09:38,292 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 03:09:38,292 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 03:09:38,309 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 03:09:38,309 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1546788844] [2022-04-15 03:09:38,309 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-04-15 03:09:38,309 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 03:09:38,309 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 03:09:38,311 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 03:09:38,336 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-04-15 03:09:39,510 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2022-04-15 03:09:39,511 INFO L229 tOrderPrioritization]: Conjunction of SSA is sat [2022-04-15 03:09:39,511 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-04-15 03:09:39,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 03:09:39,713 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-04-15 03:09:39,714 INFO L618 BasicCegarLoop]: Counterexample is feasible [2022-04-15 03:09:39,715 INFO L788 garLoopResultBuilder]: Registering result UNSAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-04-15 03:09:39,731 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-04-15 03:09:39,924 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 03:09:39,928 INFO L719 BasicCegarLoop]: Path program histogram: [3, 1, 1, 1, 1] [2022-04-15 03:09:39,931 INFO L177 ceAbstractionStarter]: Computing trace abstraction results [2022-04-15 03:09:40,004 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2022-04-15 03:09:40,004 WARN L170 areAnnotationChecker]: ULTIMATE.initENTRY has no Hoare annotation [2022-04-15 03:09:40,004 WARN L170 areAnnotationChecker]: mainENTRY has no Hoare annotation [2022-04-15 03:09:40,004 WARN L170 areAnnotationChecker]: assume_abort_if_notENTRY has no Hoare annotation [2022-04-15 03:09:40,004 WARN L170 areAnnotationChecker]: __VERIFIER_assertENTRY has no Hoare annotation [2022-04-15 03:09:40,004 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2022-04-15 03:09:40,004 WARN L170 areAnnotationChecker]: L26 has no Hoare annotation [2022-04-15 03:09:40,004 WARN L170 areAnnotationChecker]: L9 has no Hoare annotation [2022-04-15 03:09:40,004 WARN L170 areAnnotationChecker]: L9 has no Hoare annotation [2022-04-15 03:09:40,004 WARN L170 areAnnotationChecker]: L12 has no Hoare annotation [2022-04-15 03:09:40,004 WARN L170 areAnnotationChecker]: L12 has no Hoare annotation [2022-04-15 03:09:40,004 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2022-04-15 03:09:40,004 WARN L170 areAnnotationChecker]: L9-2 has no Hoare annotation [2022-04-15 03:09:40,004 WARN L170 areAnnotationChecker]: L13 has no Hoare annotation [2022-04-15 03:09:40,005 WARN L170 areAnnotationChecker]: L13 has no Hoare annotation [2022-04-15 03:09:40,005 WARN L170 areAnnotationChecker]: L12-2 has no Hoare annotation [2022-04-15 03:09:40,005 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2022-04-15 03:09:40,005 WARN L170 areAnnotationChecker]: assume_abort_if_notEXIT has no Hoare annotation [2022-04-15 03:09:40,005 WARN L170 areAnnotationChecker]: assume_abort_if_notEXIT has no Hoare annotation [2022-04-15 03:09:40,005 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-15 03:09:40,005 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-15 03:09:40,005 WARN L170 areAnnotationChecker]: L26-1 has no Hoare annotation [2022-04-15 03:09:40,005 WARN L170 areAnnotationChecker]: L28 has no Hoare annotation [2022-04-15 03:09:40,005 WARN L170 areAnnotationChecker]: L35-1 has no Hoare annotation [2022-04-15 03:09:40,005 WARN L170 areAnnotationChecker]: L35-1 has no Hoare annotation [2022-04-15 03:09:40,005 WARN L170 areAnnotationChecker]: L48 has no Hoare annotation [2022-04-15 03:09:40,005 WARN L170 areAnnotationChecker]: L38-2 has no Hoare annotation [2022-04-15 03:09:40,005 WARN L170 areAnnotationChecker]: L38-2 has no Hoare annotation [2022-04-15 03:09:40,005 WARN L170 areAnnotationChecker]: L34-3 has no Hoare annotation [2022-04-15 03:09:40,005 WARN L170 areAnnotationChecker]: L38 has no Hoare annotation [2022-04-15 03:09:40,005 WARN L170 areAnnotationChecker]: L38 has no Hoare annotation [2022-04-15 03:09:40,005 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2022-04-15 03:09:40,005 WARN L170 areAnnotationChecker]: L34-1 has no Hoare annotation [2022-04-15 03:09:40,005 WARN L170 areAnnotationChecker]: L34-1 has no Hoare annotation [2022-04-15 03:09:40,005 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2022-04-15 03:09:40,006 WARN L170 areAnnotationChecker]: L35 has no Hoare annotation [2022-04-15 03:09:40,006 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2022-04-15 03:09:40,006 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-15 03:09:40,006 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.04 03:09:40 BasicIcfg [2022-04-15 03:09:40,006 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-04-15 03:09:40,007 INFO L158 Benchmark]: Toolchain (without parser) took 19670.29ms. Allocated memory was 179.3MB in the beginning and 247.5MB in the end (delta: 68.2MB). Free memory was 154.9MB in the beginning and 169.5MB in the end (delta: -14.6MB). Peak memory consumption was 53.5MB. Max. memory is 8.0GB. [2022-04-15 03:09:40,008 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 179.3MB. Free memory is still 144.7MB. There was no memory consumed. Max. memory is 8.0GB. [2022-04-15 03:09:40,008 INFO L158 Benchmark]: CACSL2BoogieTranslator took 273.89ms. Allocated memory was 179.3MB in the beginning and 247.5MB in the end (delta: 68.2MB). Free memory was 154.6MB in the beginning and 223.5MB in the end (delta: -68.8MB). Peak memory consumption was 8.4MB. Max. memory is 8.0GB. [2022-04-15 03:09:40,008 INFO L158 Benchmark]: Boogie Preprocessor took 32.43ms. Allocated memory is still 247.5MB. Free memory was 223.5MB in the beginning and 222.1MB in the end (delta: 1.4MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-04-15 03:09:40,008 INFO L158 Benchmark]: RCFGBuilder took 336.66ms. Allocated memory is still 247.5MB. Free memory was 222.1MB in the beginning and 210.2MB in the end (delta: 11.9MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2022-04-15 03:09:40,008 INFO L158 Benchmark]: IcfgTransformer took 64.44ms. Allocated memory is still 247.5MB. Free memory was 210.2MB in the beginning and 208.5MB in the end (delta: 1.7MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-04-15 03:09:40,009 INFO L158 Benchmark]: TraceAbstraction took 18936.34ms. Allocated memory is still 247.5MB. Free memory was 208.1MB in the beginning and 169.5MB in the end (delta: 38.6MB). Peak memory consumption was 39.5MB. Max. memory is 8.0GB. [2022-04-15 03:09:40,010 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 179.3MB. Free memory is still 144.7MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 273.89ms. Allocated memory was 179.3MB in the beginning and 247.5MB in the end (delta: 68.2MB). Free memory was 154.6MB in the beginning and 223.5MB in the end (delta: -68.8MB). Peak memory consumption was 8.4MB. Max. memory is 8.0GB. * Boogie Preprocessor took 32.43ms. Allocated memory is still 247.5MB. Free memory was 223.5MB in the beginning and 222.1MB in the end (delta: 1.4MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 336.66ms. Allocated memory is still 247.5MB. Free memory was 222.1MB in the beginning and 210.2MB in the end (delta: 11.9MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * IcfgTransformer took 64.44ms. Allocated memory is still 247.5MB. Free memory was 210.2MB in the beginning and 208.5MB in the end (delta: 1.7MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * TraceAbstraction took 18936.34ms. Allocated memory is still 247.5MB. Free memory was 208.1MB in the beginning and 169.5MB in the end (delta: 38.6MB). Peak memory consumption was 39.5MB. 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: 14]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L19] int counter = 0; VAL [\old(counter)=8, counter=0] [L21] int A, R; [L22] long long u, v, r; [L23] A = __VERIFIER_nondet_int() [L24] R = __VERIFIER_nondet_int() [L26] CALL assume_abort_if_not(((long long) R - 1) * ((long long) R - 1) < A) VAL [\old(cond)=1, \old(counter)=0, counter=0] [L9] COND FALSE !(!cond) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=0] [L26] RET assume_abort_if_not(((long long) R - 1) * ((long long) R - 1) < A) VAL [\old(counter)=0, A=1851, counter=0, R=44] [L28] CALL assume_abort_if_not(A % 2 == 1) VAL [\old(cond)=1, \old(counter)=0, counter=0] [L9] COND FALSE !(!cond) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=0] [L28] RET assume_abort_if_not(A % 2 == 1) VAL [\old(counter)=0, A=1851, counter=0, R=44] [L30] u = ((long long) 2 * R) + 1 [L31] v = 1 [L32] r = ((long long) R * R) - A VAL [\old(counter)=0, A=1851, counter=0, R=44, r=85, u=89, v=1] [L34] EXPR counter++ VAL [\old(counter)=0, A=1851, counter=1, counter++=0, r=85, R=44, u=89, v=1] [L34] COND TRUE counter++<5 [L35] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, \old(counter)=0, counter=1] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=1] [L35] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(counter)=0, A=1851, counter=1, r=85, R=44, u=89, v=1] [L36] COND FALSE !(!(r != 0)) VAL [\old(counter)=0, A=1851, counter=1, R=44, r=85, u=89, v=1] [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [\old(counter)=0, A=1851, counter=1, r=84, R=44, u=89, v=3] [L34] EXPR counter++ VAL [\old(counter)=0, A=1851, counter=2, counter++=1, r=84, R=44, u=89, v=3] [L34] COND TRUE counter++<5 [L35] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, \old(counter)=0, counter=2] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=2] [L35] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(counter)=0, A=1851, counter=2, r=84, R=44, u=89, v=3] [L36] COND FALSE !(!(r != 0)) VAL [\old(counter)=0, A=1851, counter=2, r=84, R=44, u=89, v=3] [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [\old(counter)=0, A=1851, counter=2, R=44, r=81, u=89, v=5] [L34] EXPR counter++ VAL [\old(counter)=0, A=1851, counter=3, counter++=2, R=44, r=81, u=89, v=5] [L34] COND TRUE counter++<5 [L35] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, \old(counter)=0, counter=3] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=3] [L35] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(counter)=0, A=1851, counter=3, R=44, r=81, u=89, v=5] [L36] COND FALSE !(!(r != 0)) VAL [\old(counter)=0, A=1851, counter=3, r=81, R=44, u=89, v=5] [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [\old(counter)=0, A=1851, counter=3, r=76, R=44, u=89, v=7] [L34] EXPR counter++ VAL [\old(counter)=0, A=1851, counter=4, counter++=3, R=44, r=76, u=89, v=7] [L34] COND TRUE counter++<5 [L35] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, \old(counter)=0, counter=4] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=4] [L35] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(counter)=0, A=1851, counter=4, R=44, r=76, u=89, v=7] [L36] COND FALSE !(!(r != 0)) VAL [\old(counter)=0, A=1851, counter=4, R=44, r=76, u=89, v=7] [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [\old(counter)=0, A=1851, counter=4, R=44, r=69, u=89, v=9] [L34] EXPR counter++ VAL [\old(counter)=0, A=1851, counter=5, counter++=4, R=44, r=69, u=89, v=9] [L34] COND TRUE counter++<5 [L35] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, \old(counter)=0, counter=5] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=5] [L35] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(counter)=0, A=1851, counter=5, R=44, r=69, u=89, v=9] [L36] COND FALSE !(!(r != 0)) VAL [\old(counter)=0, A=1851, counter=5, R=44, r=69, u=89, v=9] [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [\old(counter)=0, A=1851, counter=5, R=44, r=60, u=89, v=11] [L34] EXPR counter++ VAL [\old(counter)=0, A=1851, counter=6, counter++=5, r=60, R=44, u=89, v=11] [L34] COND FALSE !(counter++<5) [L48] CALL __VERIFIER_assert(((long long) 4*A) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=0, \old(counter)=0, counter=6] [L12] COND TRUE !(cond) VAL [\old(cond)=0, \old(counter)=0, cond=0, counter=6] [L14] reach_error() VAL [\old(cond)=0, \old(counter)=0, cond=0, counter=6] - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 30 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 18.8s, OverallIterations: 7, TraceHistogramMax: 6, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 5.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 1 mSolverCounterUnknown, 73 SdHoareTripleChecker+Valid, 3.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 72 mSDsluCounter, 540 SdHoareTripleChecker+Invalid, 3.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 376 mSDsCounter, 33 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 157 IncrementalHoareTripleChecker+Invalid, 191 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 33 mSolverCounterUnsat, 164 mSDtfsCounter, 157 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 313 GetRequests, 275 SyntacticMatches, 2 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=65occurred in iteration=6, InterpolantAutomatonStates: 41, 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, 8 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 1.4s SatisfiabilityAnalysisTime, 6.3s InterpolantComputationTime, 256 NumberOfCodeBlocks, 256 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 299 ConstructedInterpolants, 0 QuantifiedInterpolants, 779 SizeOfPredicates, 17 NumberOfNonLiveVariables, 665 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-15 03:09:40,027 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...