/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/geo1-ll_unwindbound5.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-34549b5 [2022-04-08 01:07:19,294 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-08 01:07:19,295 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-08 01:07:19,328 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-08 01:07:19,328 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-08 01:07:19,329 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-08 01:07:19,330 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-08 01:07:19,332 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-08 01:07:19,334 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-08 01:07:19,334 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-08 01:07:19,335 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-08 01:07:19,336 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-08 01:07:19,336 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-08 01:07:19,337 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-08 01:07:19,338 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-08 01:07:19,339 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-08 01:07:19,340 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-08 01:07:19,340 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-08 01:07:19,342 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-08 01:07:19,343 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-08 01:07:19,344 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-08 01:07:19,345 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-08 01:07:19,346 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-08 01:07:19,347 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-08 01:07:19,348 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-08 01:07:19,350 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-08 01:07:19,351 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-08 01:07:19,351 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-08 01:07:19,352 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-08 01:07:19,352 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-08 01:07:19,353 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-08 01:07:19,353 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-08 01:07:19,354 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-08 01:07:19,354 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-08 01:07:19,355 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-08 01:07:19,356 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-08 01:07:19,356 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-08 01:07:19,356 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-08 01:07:19,357 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-08 01:07:19,357 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-08 01:07:19,358 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-08 01:07:19,358 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-08 01:07:19,359 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/loopacceleration/qvasr/qvasr_64.epf [2022-04-08 01:07:19,378 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-08 01:07:19,378 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-08 01:07:19,379 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-04-08 01:07:19,379 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-04-08 01:07:19,380 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-04-08 01:07:19,380 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-04-08 01:07:19,380 INFO L138 SettingsManager]: * Use SBE=true [2022-04-08 01:07:19,380 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-08 01:07:19,380 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-08 01:07:19,380 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-08 01:07:19,380 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-08 01:07:19,380 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-08 01:07:19,381 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-08 01:07:19,381 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-08 01:07:19,381 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-08 01:07:19,381 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-08 01:07:19,381 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-08 01:07:19,381 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-08 01:07:19,381 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-08 01:07:19,381 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-08 01:07:19,382 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-08 01:07:19,382 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-04-08 01:07:19,382 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-04-08 01:07:19,382 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-04-08 01:07:19,382 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-04-08 01:07:19,382 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-08 01:07:19,382 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-04-08 01:07:19,382 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-04-08 01:07:19,383 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-04-08 01:07:19,383 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-08 01:07:19,578 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-08 01:07:19,600 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-08 01:07:19,601 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-08 01:07:19,602 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-08 01:07:19,603 INFO L275 PluginConnector]: CDTParser initialized [2022-04-08 01:07:19,604 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/nla-digbench-scaling/geo1-ll_unwindbound5.c [2022-04-08 01:07:19,676 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f16279fc8/3fb8d0025dd6428e8a3193341a3d2c9e/FLAG6db4f23fb [2022-04-08 01:07:20,061 INFO L306 CDTParser]: Found 1 translation units. [2022-04-08 01:07:20,061 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/geo1-ll_unwindbound5.c [2022-04-08 01:07:20,066 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f16279fc8/3fb8d0025dd6428e8a3193341a3d2c9e/FLAG6db4f23fb [2022-04-08 01:07:20,468 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f16279fc8/3fb8d0025dd6428e8a3193341a3d2c9e [2022-04-08 01:07:20,471 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-08 01:07:20,472 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-04-08 01:07:20,475 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-08 01:07:20,475 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-08 01:07:20,479 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-08 01:07:20,480 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.04 01:07:20" (1/1) ... [2022-04-08 01:07:20,481 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@20ca5690 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 01:07:20, skipping insertion in model container [2022-04-08 01:07:20,481 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.04 01:07:20" (1/1) ... [2022-04-08 01:07:20,486 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-08 01:07:20,499 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-08 01:07:20,647 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/geo1-ll_unwindbound5.c[546,559] [2022-04-08 01:07:20,675 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-08 01:07:20,682 INFO L203 MainTranslator]: Completed pre-run [2022-04-08 01:07:20,695 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/geo1-ll_unwindbound5.c[546,559] [2022-04-08 01:07:20,700 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-08 01:07:20,716 INFO L208 MainTranslator]: Completed translation [2022-04-08 01:07:20,717 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 01:07:20 WrapperNode [2022-04-08 01:07:20,719 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-08 01:07:20,720 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-08 01:07:20,720 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-08 01:07:20,720 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-08 01:07:20,731 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 01:07:20" (1/1) ... [2022-04-08 01:07:20,731 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 01:07:20" (1/1) ... [2022-04-08 01:07:20,735 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 01:07:20" (1/1) ... [2022-04-08 01:07:20,735 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 01:07:20" (1/1) ... [2022-04-08 01:07:20,739 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 01:07:20" (1/1) ... [2022-04-08 01:07:20,742 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 01:07:20" (1/1) ... [2022-04-08 01:07:20,743 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 01:07:20" (1/1) ... [2022-04-08 01:07:20,744 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-08 01:07:20,745 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-08 01:07:20,745 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-08 01:07:20,745 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-08 01:07:20,749 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 01:07:20" (1/1) ... [2022-04-08 01:07:20,758 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-08 01:07:20,769 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 01:07:20,784 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-08 01:07:20,797 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-08 01:07:20,825 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-08 01:07:20,825 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-08 01:07:20,825 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-08 01:07:20,825 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-08 01:07:20,825 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-08 01:07:20,826 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-08 01:07:20,826 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-08 01:07:20,827 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-08 01:07:20,827 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-08 01:07:20,827 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-08 01:07:20,827 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-04-08 01:07:20,828 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-08 01:07:20,828 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-08 01:07:20,828 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-08 01:07:20,828 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-08 01:07:20,828 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-08 01:07:20,828 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-08 01:07:20,828 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-08 01:07:20,828 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-08 01:07:20,828 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-08 01:07:20,888 INFO L234 CfgBuilder]: Building ICFG [2022-04-08 01:07:20,890 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-08 01:07:21,059 INFO L275 CfgBuilder]: Performing block encoding [2022-04-08 01:07:21,065 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-08 01:07:21,065 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-08 01:07:21,067 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.04 01:07:21 BoogieIcfgContainer [2022-04-08 01:07:21,067 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-08 01:07:21,067 INFO L113 PluginConnector]: ------------------------IcfgTransformer---------------------------- [2022-04-08 01:07:21,068 INFO L271 PluginConnector]: Initializing IcfgTransformer... [2022-04-08 01:07:21,070 INFO L275 PluginConnector]: IcfgTransformer initialized [2022-04-08 01:07:21,073 INFO L185 PluginConnector]: Executing the observer IcfgTransformationObserver from plugin IcfgTransformer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.04 01:07:21" (1/1) ... [2022-04-08 01:07:21,075 INFO L168 ansformationObserver]: Applying ICFG transformation LOOP_ACCELERATION_QVASR [2022-04-08 01:07:21,100 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 08.04 01:07:21 BasicIcfg [2022-04-08 01:07:21,100 INFO L132 PluginConnector]: ------------------------ END IcfgTransformer---------------------------- [2022-04-08 01:07:21,102 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-08 01:07:21,102 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-08 01:07:21,104 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-08 01:07:21,105 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.04 01:07:20" (1/4) ... [2022-04-08 01:07:21,105 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4f5ea084 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.04 01:07:21, skipping insertion in model container [2022-04-08 01:07:21,105 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 01:07:20" (2/4) ... [2022-04-08 01:07:21,106 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4f5ea084 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.04 01:07:21, skipping insertion in model container [2022-04-08 01:07:21,106 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.04 01:07:21" (3/4) ... [2022-04-08 01:07:21,106 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4f5ea084 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.04 01:07:21, skipping insertion in model container [2022-04-08 01:07:21,106 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 08.04 01:07:21" (4/4) ... [2022-04-08 01:07:21,107 INFO L111 eAbstractionObserver]: Analyzing ICFG geo1-ll_unwindbound5.cqvasr [2022-04-08 01:07:21,111 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-04-08 01:07:21,111 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-08 01:07:21,151 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-08 01:07:21,157 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-08 01:07:21,157 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-08 01:07:21,174 INFO L276 IsEmpty]: Start isEmpty. Operand has 30 states, 18 states have (on average 1.3333333333333333) internal successors, (24), 19 states have internal predecessors, (24), 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-08 01:07:21,178 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-04-08 01:07:21,178 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 01:07:21,178 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-08 01:07:21,179 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 01:07:21,183 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 01:07:21,183 INFO L85 PathProgramCache]: Analyzing trace with hash -1175629711, now seen corresponding path program 1 times [2022-04-08 01:07:21,191 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 01:07:21,191 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1907671102] [2022-04-08 01:07:21,191 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 01:07:21,192 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 01:07:21,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 01:07:21,366 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 01:07:21,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 01:07:21,391 INFO L290 TraceCheckUtils]: 0: Hoare triple {46#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [67] 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) 10) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{~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-08 01:07:21,392 INFO L290 TraceCheckUtils]: 1: Hoare triple {33#true} [70] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {33#true} is VALID [2022-04-08 01:07:21,393 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {33#true} {33#true} [95] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {33#true} is VALID [2022-04-08 01:07:21,394 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-08 01:07:21,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 01:07:21,411 INFO L290 TraceCheckUtils]: 0: Hoare triple {33#true} [73] assume_abort_if_notENTRY-->L13: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {33#true} is VALID [2022-04-08 01:07:21,412 INFO L290 TraceCheckUtils]: 1: Hoare triple {33#true} [75] L13-->L13-2: Formula: false InVars {} OutVars{} AuxVars[] AssignedVars[] {34#false} is VALID [2022-04-08 01:07:21,412 INFO L290 TraceCheckUtils]: 2: Hoare triple {34#false} [79] L13-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {34#false} is VALID [2022-04-08 01:07:21,413 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {34#false} {33#true} [96] assume_abort_if_notEXIT-->L28-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (<= 1 v_main_~z~0_9) 1 0) |v_assume_abort_if_not_#in~condInParam_1|) InVars {main_~z~0=v_main_~z~0_9} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~z~0, assume_abort_if_not_#in~cond] {34#false} is VALID [2022-04-08 01:07:21,414 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-04-08 01:07:21,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 01:07:21,428 INFO L290 TraceCheckUtils]: 0: Hoare triple {33#true} [73] assume_abort_if_notENTRY-->L13: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {33#true} is VALID [2022-04-08 01:07:21,434 INFO L290 TraceCheckUtils]: 1: Hoare triple {33#true} [75] L13-->L13-2: Formula: false InVars {} OutVars{} AuxVars[] AssignedVars[] {34#false} is VALID [2022-04-08 01:07:21,435 INFO L290 TraceCheckUtils]: 2: Hoare triple {34#false} [79] L13-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {34#false} is VALID [2022-04-08 01:07:21,435 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {34#false} {34#false} [97] assume_abort_if_notEXIT-->L29: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (<= 1 v_main_~k~0_7) 1 0)) InVars {main_~k~0=v_main_~k~0_7} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_2|} AuxVars[] AssignedVars[main_~k~0, assume_abort_if_not_#in~cond] {34#false} is VALID [2022-04-08 01:07:21,436 INFO L272 TraceCheckUtils]: 0: Hoare triple {33#true} [65] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {46#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 01:07:21,436 INFO L290 TraceCheckUtils]: 1: Hoare triple {46#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [67] 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) 10) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{~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-08 01:07:21,437 INFO L290 TraceCheckUtils]: 2: Hoare triple {33#true} [70] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {33#true} is VALID [2022-04-08 01:07:21,437 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {33#true} {33#true} [95] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {33#true} is VALID [2022-04-08 01:07:21,437 INFO L272 TraceCheckUtils]: 4: Hoare triple {33#true} [66] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {33#true} is VALID [2022-04-08 01:07:21,438 INFO L290 TraceCheckUtils]: 5: Hoare triple {33#true} [69] mainENTRY-->L28: Formula: (and (<= |v_main_#t~nondet5_2| 2147483647) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= |v_main_#t~nondet4_2| 2147483647) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648)) (= v_main_~k~0_1 |v_main_#t~nondet5_2|) (= v_main_~z~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_~c~0=v_main_~c~0_1, main_~y~0=v_main_~y~0_2, main_~x~0=v_main_~x~0_4, main_~k~0=v_main_~k~0_1, main_~z~0=v_main_~z~0_2} AuxVars[] AssignedVars[main_#t~nondet5, main_#t~nondet4, main_~x~0, main_~k~0, main_~z~0, main_~c~0, main_~y~0] {33#true} is VALID [2022-04-08 01:07:21,438 INFO L272 TraceCheckUtils]: 6: Hoare triple {33#true} [71] L28-->assume_abort_if_notENTRY: Formula: (= (ite (<= 1 v_main_~z~0_9) 1 0) |v_assume_abort_if_not_#in~condInParam_1|) InVars {main_~z~0=v_main_~z~0_9} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~z~0, assume_abort_if_not_#in~cond] {33#true} is VALID [2022-04-08 01:07:21,438 INFO L290 TraceCheckUtils]: 7: Hoare triple {33#true} [73] assume_abort_if_notENTRY-->L13: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {33#true} is VALID [2022-04-08 01:07:21,439 INFO L290 TraceCheckUtils]: 8: Hoare triple {33#true} [75] L13-->L13-2: Formula: false InVars {} OutVars{} AuxVars[] AssignedVars[] {34#false} is VALID [2022-04-08 01:07:21,439 INFO L290 TraceCheckUtils]: 9: Hoare triple {34#false} [79] L13-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {34#false} is VALID [2022-04-08 01:07:21,439 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {34#false} {33#true} [96] assume_abort_if_notEXIT-->L28-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (<= 1 v_main_~z~0_9) 1 0) |v_assume_abort_if_not_#in~condInParam_1|) InVars {main_~z~0=v_main_~z~0_9} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~z~0, assume_abort_if_not_#in~cond] {34#false} is VALID [2022-04-08 01:07:21,440 INFO L272 TraceCheckUtils]: 11: Hoare triple {34#false} [72] L28-1-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (<= 1 v_main_~k~0_7) 1 0)) InVars {main_~k~0=v_main_~k~0_7} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_2|} AuxVars[] AssignedVars[main_~k~0, assume_abort_if_not_#in~cond] {33#true} is VALID [2022-04-08 01:07:21,440 INFO L290 TraceCheckUtils]: 12: Hoare triple {33#true} [73] assume_abort_if_notENTRY-->L13: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {33#true} is VALID [2022-04-08 01:07:21,440 INFO L290 TraceCheckUtils]: 13: Hoare triple {33#true} [75] L13-->L13-2: Formula: false InVars {} OutVars{} AuxVars[] AssignedVars[] {34#false} is VALID [2022-04-08 01:07:21,441 INFO L290 TraceCheckUtils]: 14: Hoare triple {34#false} [79] L13-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {34#false} is VALID [2022-04-08 01:07:21,441 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {34#false} {34#false} [97] assume_abort_if_notEXIT-->L29: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (<= 1 v_main_~k~0_7) 1 0)) InVars {main_~k~0=v_main_~k~0_7} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_2|} AuxVars[] AssignedVars[main_~k~0, assume_abort_if_not_#in~cond] {34#false} is VALID [2022-04-08 01:07:21,441 INFO L290 TraceCheckUtils]: 16: Hoare triple {34#false} [74] L29-->L35-3: Formula: (and (= v_main_~c~0_2 1) (= v_main_~y~0_3 v_main_~z~0_6) (= v_main_~x~0_5 1)) InVars {main_~z~0=v_main_~z~0_6} OutVars{main_~c~0=v_main_~c~0_2, main_~y~0=v_main_~y~0_3, main_~x~0=v_main_~x~0_5, main_~z~0=v_main_~z~0_6} AuxVars[] AssignedVars[main_~x~0, main_~c~0, main_~y~0] {34#false} is VALID [2022-04-08 01:07:21,442 INFO L290 TraceCheckUtils]: 17: Hoare triple {34#false} [77] L35-3-->L35-4: Formula: false InVars {} OutVars{} AuxVars[] AssignedVars[] {34#false} is VALID [2022-04-08 01:07:21,442 INFO L290 TraceCheckUtils]: 18: Hoare triple {34#false} [80] L35-4-->L49: Formula: (= v_main_~x~0_1 (* v_main_~x~0_2 (+ (- 1) v_main_~z~0_1))) InVars {main_~x~0=v_main_~x~0_2, main_~z~0=v_main_~z~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~z~0=v_main_~z~0_1} AuxVars[] AssignedVars[main_~x~0] {34#false} is VALID [2022-04-08 01:07:21,442 INFO L272 TraceCheckUtils]: 19: Hoare triple {34#false} [83] L49-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (= (+ (* (- 1) v_main_~y~0_8) v_main_~x~0_10 1) 0) 1 0)) InVars {main_~x~0=v_main_~x~0_10, main_~y~0=v_main_~y~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {34#false} is VALID [2022-04-08 01:07:21,442 INFO L290 TraceCheckUtils]: 20: Hoare triple {34#false} [86] __VERIFIER_assertENTRY-->L16: Formula: (= v___VERIFIER_assert_~cond_2 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {34#false} is VALID [2022-04-08 01:07:21,443 INFO L290 TraceCheckUtils]: 21: Hoare triple {34#false} [90] L16-->L17: Formula: (= v___VERIFIER_assert_~cond_3 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {34#false} is VALID [2022-04-08 01:07:21,443 INFO L290 TraceCheckUtils]: 22: Hoare triple {34#false} [92] L17-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {34#false} is VALID [2022-04-08 01:07:21,444 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-08 01:07:21,444 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 01:07:21,444 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1907671102] [2022-04-08 01:07:21,445 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1907671102] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 01:07:21,445 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 01:07:21,445 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-08 01:07:21,448 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [895864708] [2022-04-08 01:07:21,449 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 01:07:21,453 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 23 [2022-04-08 01:07:21,454 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 01:07:21,457 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-08 01:07:21,491 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-08 01:07:21,492 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-08 01:07:21,492 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-08 01:07:21,511 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-08 01:07:21,512 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-08 01:07:21,514 INFO L87 Difference]: Start difference. First operand has 30 states, 18 states have (on average 1.3333333333333333) internal successors, (24), 19 states have internal predecessors, (24), 6 states have call successors, (6), 4 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-08 01:07:21,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 01:07:21,661 INFO L93 Difference]: Finished difference Result 54 states and 70 transitions. [2022-04-08 01:07:21,661 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-08 01:07:21,661 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 23 [2022-04-08 01:07:21,662 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 01:07:21,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-08 01:07:21,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 70 transitions. [2022-04-08 01:07:21,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-08 01:07:21,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 70 transitions. [2022-04-08 01:07:21,675 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 70 transitions. [2022-04-08 01:07:21,742 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-08 01:07:21,749 INFO L225 Difference]: With dead ends: 54 [2022-04-08 01:07:21,749 INFO L226 Difference]: Without dead ends: 26 [2022-04-08 01:07:21,751 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-08 01:07:21,756 INFO L913 BasicCegarLoop]: 30 mSDtfsCounter, 10 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 34 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-08 01:07:21,759 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [12 Valid, 34 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-08 01:07:21,773 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2022-04-08 01:07:21,784 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 25. [2022-04-08 01:07:21,784 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 01:07:21,785 INFO L82 GeneralOperation]: Start isEquivalent. First operand 26 states. Second operand has 25 states, 15 states have (on average 1.2) internal successors, (18), 16 states have internal predecessors, (18), 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-08 01:07:21,786 INFO L74 IsIncluded]: Start isIncluded. First operand 26 states. Second operand has 25 states, 15 states have (on average 1.2) internal successors, (18), 16 states have internal predecessors, (18), 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-08 01:07:21,786 INFO L87 Difference]: Start difference. First operand 26 states. Second operand has 25 states, 15 states have (on average 1.2) internal successors, (18), 16 states have internal predecessors, (18), 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-08 01:07:21,789 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 01:07:21,790 INFO L93 Difference]: Finished difference Result 26 states and 29 transitions. [2022-04-08 01:07:21,790 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 29 transitions. [2022-04-08 01:07:21,790 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 01:07:21,790 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 01:07:21,791 INFO L74 IsIncluded]: Start isIncluded. First operand has 25 states, 15 states have (on average 1.2) internal successors, (18), 16 states have internal predecessors, (18), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand 26 states. [2022-04-08 01:07:21,791 INFO L87 Difference]: Start difference. First operand has 25 states, 15 states have (on average 1.2) internal successors, (18), 16 states have internal predecessors, (18), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand 26 states. [2022-04-08 01:07:21,794 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 01:07:21,794 INFO L93 Difference]: Finished difference Result 26 states and 29 transitions. [2022-04-08 01:07:21,794 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 29 transitions. [2022-04-08 01:07:21,795 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 01:07:21,795 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 01:07:21,795 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 01:07:21,795 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 01:07:21,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 15 states have (on average 1.2) internal successors, (18), 16 states have internal predecessors, (18), 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-08 01:07:21,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 28 transitions. [2022-04-08 01:07:21,799 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 28 transitions. Word has length 23 [2022-04-08 01:07:21,799 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 01:07:21,799 INFO L478 AbstractCegarLoop]: Abstraction has 25 states and 28 transitions. [2022-04-08 01:07:21,800 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-08 01:07:21,800 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 28 transitions. [2022-04-08 01:07:21,800 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-04-08 01:07:21,801 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 01:07:21,801 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-08 01:07:21,801 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-08 01:07:21,801 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 01:07:21,802 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 01:07:21,802 INFO L85 PathProgramCache]: Analyzing trace with hash 165914577, now seen corresponding path program 1 times [2022-04-08 01:07:21,803 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 01:07:21,803 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [139810629] [2022-04-08 01:07:21,803 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 01:07:21,803 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 01:07:21,825 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 01:07:21,825 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [150607343] [2022-04-08 01:07:21,826 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 01:07:21,826 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 01:07:21,826 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 01:07:21,827 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-08 01:07:21,841 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-08 01:07:21,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 01:07:21,899 INFO L263 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-08 01:07:21,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 01:07:21,935 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 01:07:22,124 INFO L272 TraceCheckUtils]: 0: Hoare triple {209#true} [65] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {209#true} is VALID [2022-04-08 01:07:22,125 INFO L290 TraceCheckUtils]: 1: Hoare triple {209#true} [67] 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) 10) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{~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] {209#true} is VALID [2022-04-08 01:07:22,125 INFO L290 TraceCheckUtils]: 2: Hoare triple {209#true} [70] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {209#true} is VALID [2022-04-08 01:07:22,125 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {209#true} {209#true} [95] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {209#true} is VALID [2022-04-08 01:07:22,125 INFO L272 TraceCheckUtils]: 4: Hoare triple {209#true} [66] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {209#true} is VALID [2022-04-08 01:07:22,125 INFO L290 TraceCheckUtils]: 5: Hoare triple {209#true} [69] mainENTRY-->L28: Formula: (and (<= |v_main_#t~nondet5_2| 2147483647) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= |v_main_#t~nondet4_2| 2147483647) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648)) (= v_main_~k~0_1 |v_main_#t~nondet5_2|) (= v_main_~z~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_~c~0=v_main_~c~0_1, main_~y~0=v_main_~y~0_2, main_~x~0=v_main_~x~0_4, main_~k~0=v_main_~k~0_1, main_~z~0=v_main_~z~0_2} AuxVars[] AssignedVars[main_#t~nondet5, main_#t~nondet4, main_~x~0, main_~k~0, main_~z~0, main_~c~0, main_~y~0] {209#true} is VALID [2022-04-08 01:07:22,126 INFO L272 TraceCheckUtils]: 6: Hoare triple {209#true} [71] L28-->assume_abort_if_notENTRY: Formula: (= (ite (<= 1 v_main_~z~0_9) 1 0) |v_assume_abort_if_not_#in~condInParam_1|) InVars {main_~z~0=v_main_~z~0_9} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~z~0, assume_abort_if_not_#in~cond] {209#true} is VALID [2022-04-08 01:07:22,127 INFO L290 TraceCheckUtils]: 7: Hoare triple {209#true} [73] assume_abort_if_notENTRY-->L13: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {209#true} is VALID [2022-04-08 01:07:22,127 INFO L290 TraceCheckUtils]: 8: Hoare triple {209#true} [76] L13-->L13-2: Formula: (not (= v_assume_abort_if_not_~cond_3 0)) InVars {assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} OutVars{assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} AuxVars[] AssignedVars[] {209#true} is VALID [2022-04-08 01:07:22,127 INFO L290 TraceCheckUtils]: 9: Hoare triple {209#true} [79] L13-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {209#true} is VALID [2022-04-08 01:07:22,127 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {209#true} {209#true} [96] assume_abort_if_notEXIT-->L28-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (<= 1 v_main_~z~0_9) 1 0) |v_assume_abort_if_not_#in~condInParam_1|) InVars {main_~z~0=v_main_~z~0_9} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~z~0, assume_abort_if_not_#in~cond] {209#true} is VALID [2022-04-08 01:07:22,127 INFO L272 TraceCheckUtils]: 11: Hoare triple {209#true} [72] L28-1-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (<= 1 v_main_~k~0_7) 1 0)) InVars {main_~k~0=v_main_~k~0_7} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_2|} AuxVars[] AssignedVars[main_~k~0, assume_abort_if_not_#in~cond] {209#true} is VALID [2022-04-08 01:07:22,128 INFO L290 TraceCheckUtils]: 12: Hoare triple {209#true} [73] assume_abort_if_notENTRY-->L13: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {209#true} is VALID [2022-04-08 01:07:22,128 INFO L290 TraceCheckUtils]: 13: Hoare triple {209#true} [76] L13-->L13-2: Formula: (not (= v_assume_abort_if_not_~cond_3 0)) InVars {assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} OutVars{assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} AuxVars[] AssignedVars[] {209#true} is VALID [2022-04-08 01:07:22,131 INFO L290 TraceCheckUtils]: 14: Hoare triple {209#true} [79] L13-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {209#true} is VALID [2022-04-08 01:07:22,131 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {209#true} {209#true} [97] assume_abort_if_notEXIT-->L29: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (<= 1 v_main_~k~0_7) 1 0)) InVars {main_~k~0=v_main_~k~0_7} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_2|} AuxVars[] AssignedVars[main_~k~0, assume_abort_if_not_#in~cond] {209#true} is VALID [2022-04-08 01:07:22,132 INFO L290 TraceCheckUtils]: 16: Hoare triple {209#true} [74] L29-->L35-3: Formula: (and (= v_main_~c~0_2 1) (= v_main_~y~0_3 v_main_~z~0_6) (= v_main_~x~0_5 1)) InVars {main_~z~0=v_main_~z~0_6} OutVars{main_~c~0=v_main_~c~0_2, main_~y~0=v_main_~y~0_3, main_~x~0=v_main_~x~0_5, main_~z~0=v_main_~z~0_6} AuxVars[] AssignedVars[main_~x~0, main_~c~0, main_~y~0] {262#(and (= main_~z~0 main_~y~0) (= main_~x~0 1))} is VALID [2022-04-08 01:07:22,133 INFO L290 TraceCheckUtils]: 17: Hoare triple {262#(and (= main_~z~0 main_~y~0) (= main_~x~0 1))} [78] L35-3-->L35-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] {262#(and (= main_~z~0 main_~y~0) (= main_~x~0 1))} is VALID [2022-04-08 01:07:22,134 INFO L290 TraceCheckUtils]: 18: Hoare triple {262#(and (= main_~z~0 main_~y~0) (= main_~x~0 1))} [82] L35-1-->L36: Formula: (< |v_main_#t~post6_5| 5) InVars {main_#t~post6=|v_main_#t~post6_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post6] {262#(and (= main_~z~0 main_~y~0) (= main_~x~0 1))} is VALID [2022-04-08 01:07:22,135 INFO L272 TraceCheckUtils]: 19: Hoare triple {262#(and (= main_~z~0 main_~y~0) (= main_~x~0 1))} [84] L36-->__VERIFIER_assertENTRY: Formula: (= (ite (= (+ (* v_main_~z~0_10 v_main_~x~0_9) (* (- 1) v_main_~x~0_9) (* (- 1) v_main_~y~0_7) 1) 0) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~y~0=v_main_~y~0_7, main_~x~0=v_main_~x~0_9, main_~z~0=v_main_~z~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~z~0, main_~y~0] {272#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 01:07:22,136 INFO L290 TraceCheckUtils]: 20: Hoare triple {272#(<= 1 |__VERIFIER_assert_#in~cond|)} [86] __VERIFIER_assertENTRY-->L16: Formula: (= v___VERIFIER_assert_~cond_2 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {276#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 01:07:22,137 INFO L290 TraceCheckUtils]: 21: Hoare triple {276#(<= 1 __VERIFIER_assert_~cond)} [90] L16-->L17: Formula: (= v___VERIFIER_assert_~cond_3 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {210#false} is VALID [2022-04-08 01:07:22,138 INFO L290 TraceCheckUtils]: 22: Hoare triple {210#false} [92] L17-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {210#false} is VALID [2022-04-08 01:07:22,138 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-08 01:07:22,138 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-08 01:07:22,138 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 01:07:22,139 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [139810629] [2022-04-08 01:07:22,139 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 01:07:22,139 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [150607343] [2022-04-08 01:07:22,139 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [150607343] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 01:07:22,140 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 01:07:22,140 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 01:07:22,141 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1580358524] [2022-04-08 01:07:22,141 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 01:07:22,141 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-08 01:07:22,142 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 01:07:22,142 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-08 01:07:22,162 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-08 01:07:22,162 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-08 01:07:22,162 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-08 01:07:22,163 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-08 01:07:22,163 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-08 01:07:22,164 INFO L87 Difference]: Start difference. First operand 25 states and 28 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-08 01:07:22,322 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 01:07:22,322 INFO L93 Difference]: Finished difference Result 36 states and 41 transitions. [2022-04-08 01:07:22,322 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-08 01:07:22,323 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-08 01:07:22,323 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 01:07:22,323 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-08 01:07:22,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 41 transitions. [2022-04-08 01:07:22,326 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-08 01:07:22,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 41 transitions. [2022-04-08 01:07:22,336 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 41 transitions. [2022-04-08 01:07:22,373 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 41 edges. 41 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 01:07:22,375 INFO L225 Difference]: With dead ends: 36 [2022-04-08 01:07:22,375 INFO L226 Difference]: Without dead ends: 34 [2022-04-08 01:07:22,375 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-08 01:07:22,379 INFO L913 BasicCegarLoop]: 24 mSDtfsCounter, 7 mSDsluCounter, 64 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 88 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-08 01:07:22,380 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [8 Valid, 88 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-08 01:07:22,382 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2022-04-08 01:07:22,391 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 32. [2022-04-08 01:07:22,391 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 01:07:22,392 INFO L82 GeneralOperation]: Start isEquivalent. First operand 34 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-08 01:07:22,392 INFO L74 IsIncluded]: Start isIncluded. First operand 34 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-08 01:07:22,393 INFO L87 Difference]: Start difference. First operand 34 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-08 01:07:22,398 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 01:07:22,398 INFO L93 Difference]: Finished difference Result 34 states and 39 transitions. [2022-04-08 01:07:22,399 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 39 transitions. [2022-04-08 01:07:22,400 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 01:07:22,400 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 01:07:22,402 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 34 states. [2022-04-08 01:07:22,402 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 34 states. [2022-04-08 01:07:22,405 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 01:07:22,405 INFO L93 Difference]: Finished difference Result 34 states and 39 transitions. [2022-04-08 01:07:22,406 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 39 transitions. [2022-04-08 01:07:22,407 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 01:07:22,408 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 01:07:22,411 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 01:07:22,411 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 01:07:22,411 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-08 01:07:22,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 36 transitions. [2022-04-08 01:07:22,419 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 36 transitions. Word has length 23 [2022-04-08 01:07:22,419 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 01:07:22,419 INFO L478 AbstractCegarLoop]: Abstraction has 32 states and 36 transitions. [2022-04-08 01:07:22,419 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-08 01:07:22,419 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 36 transitions. [2022-04-08 01:07:22,420 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-04-08 01:07:22,420 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 01:07:22,420 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, 1] [2022-04-08 01:07:22,446 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-04-08 01:07:22,620 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 01:07:22,621 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 01:07:22,621 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 01:07:22,622 INFO L85 PathProgramCache]: Analyzing trace with hash 815968169, now seen corresponding path program 1 times [2022-04-08 01:07:22,622 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 01:07:22,622 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [300784486] [2022-04-08 01:07:22,622 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 01:07:22,622 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 01:07:22,639 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 01:07:22,640 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1566865378] [2022-04-08 01:07:22,640 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 01:07:22,640 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 01:07:22,640 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 01:07:22,641 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-08 01:07:22,654 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-08 01:07:22,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 01:07:22,700 INFO L263 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 5 conjunts are in the unsatisfiable core [2022-04-08 01:07:22,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 01:07:22,714 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 01:07:22,864 INFO L272 TraceCheckUtils]: 0: Hoare triple {448#true} [65] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {448#true} is VALID [2022-04-08 01:07:22,865 INFO L290 TraceCheckUtils]: 1: Hoare triple {448#true} [67] 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) 10) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{~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] {456#(<= ~counter~0 0)} is VALID [2022-04-08 01:07:22,866 INFO L290 TraceCheckUtils]: 2: Hoare triple {456#(<= ~counter~0 0)} [70] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {456#(<= ~counter~0 0)} is VALID [2022-04-08 01:07:22,866 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {456#(<= ~counter~0 0)} {448#true} [95] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {456#(<= ~counter~0 0)} is VALID [2022-04-08 01:07:22,867 INFO L272 TraceCheckUtils]: 4: Hoare triple {456#(<= ~counter~0 0)} [66] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {456#(<= ~counter~0 0)} is VALID [2022-04-08 01:07:22,867 INFO L290 TraceCheckUtils]: 5: Hoare triple {456#(<= ~counter~0 0)} [69] mainENTRY-->L28: Formula: (and (<= |v_main_#t~nondet5_2| 2147483647) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= |v_main_#t~nondet4_2| 2147483647) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648)) (= v_main_~k~0_1 |v_main_#t~nondet5_2|) (= v_main_~z~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_~c~0=v_main_~c~0_1, main_~y~0=v_main_~y~0_2, main_~x~0=v_main_~x~0_4, main_~k~0=v_main_~k~0_1, main_~z~0=v_main_~z~0_2} AuxVars[] AssignedVars[main_#t~nondet5, main_#t~nondet4, main_~x~0, main_~k~0, main_~z~0, main_~c~0, main_~y~0] {456#(<= ~counter~0 0)} is VALID [2022-04-08 01:07:22,868 INFO L272 TraceCheckUtils]: 6: Hoare triple {456#(<= ~counter~0 0)} [71] L28-->assume_abort_if_notENTRY: Formula: (= (ite (<= 1 v_main_~z~0_9) 1 0) |v_assume_abort_if_not_#in~condInParam_1|) InVars {main_~z~0=v_main_~z~0_9} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~z~0, assume_abort_if_not_#in~cond] {456#(<= ~counter~0 0)} is VALID [2022-04-08 01:07:22,868 INFO L290 TraceCheckUtils]: 7: Hoare triple {456#(<= ~counter~0 0)} [73] assume_abort_if_notENTRY-->L13: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {456#(<= ~counter~0 0)} is VALID [2022-04-08 01:07:22,869 INFO L290 TraceCheckUtils]: 8: Hoare triple {456#(<= ~counter~0 0)} [76] L13-->L13-2: Formula: (not (= v_assume_abort_if_not_~cond_3 0)) InVars {assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} OutVars{assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} AuxVars[] AssignedVars[] {456#(<= ~counter~0 0)} is VALID [2022-04-08 01:07:22,869 INFO L290 TraceCheckUtils]: 9: Hoare triple {456#(<= ~counter~0 0)} [79] L13-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {456#(<= ~counter~0 0)} is VALID [2022-04-08 01:07:22,870 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {456#(<= ~counter~0 0)} {456#(<= ~counter~0 0)} [96] assume_abort_if_notEXIT-->L28-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (<= 1 v_main_~z~0_9) 1 0) |v_assume_abort_if_not_#in~condInParam_1|) InVars {main_~z~0=v_main_~z~0_9} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~z~0, assume_abort_if_not_#in~cond] {456#(<= ~counter~0 0)} is VALID [2022-04-08 01:07:22,871 INFO L272 TraceCheckUtils]: 11: Hoare triple {456#(<= ~counter~0 0)} [72] L28-1-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (<= 1 v_main_~k~0_7) 1 0)) InVars {main_~k~0=v_main_~k~0_7} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_2|} AuxVars[] AssignedVars[main_~k~0, assume_abort_if_not_#in~cond] {456#(<= ~counter~0 0)} is VALID [2022-04-08 01:07:22,871 INFO L290 TraceCheckUtils]: 12: Hoare triple {456#(<= ~counter~0 0)} [73] assume_abort_if_notENTRY-->L13: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {456#(<= ~counter~0 0)} is VALID [2022-04-08 01:07:22,872 INFO L290 TraceCheckUtils]: 13: Hoare triple {456#(<= ~counter~0 0)} [76] L13-->L13-2: Formula: (not (= v_assume_abort_if_not_~cond_3 0)) InVars {assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} OutVars{assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} AuxVars[] AssignedVars[] {456#(<= ~counter~0 0)} is VALID [2022-04-08 01:07:22,872 INFO L290 TraceCheckUtils]: 14: Hoare triple {456#(<= ~counter~0 0)} [79] L13-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {456#(<= ~counter~0 0)} is VALID [2022-04-08 01:07:22,873 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {456#(<= ~counter~0 0)} {456#(<= ~counter~0 0)} [97] assume_abort_if_notEXIT-->L29: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (<= 1 v_main_~k~0_7) 1 0)) InVars {main_~k~0=v_main_~k~0_7} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_2|} AuxVars[] AssignedVars[main_~k~0, assume_abort_if_not_#in~cond] {456#(<= ~counter~0 0)} is VALID [2022-04-08 01:07:22,873 INFO L290 TraceCheckUtils]: 16: Hoare triple {456#(<= ~counter~0 0)} [74] L29-->L35-3: Formula: (and (= v_main_~c~0_2 1) (= v_main_~y~0_3 v_main_~z~0_6) (= v_main_~x~0_5 1)) InVars {main_~z~0=v_main_~z~0_6} OutVars{main_~c~0=v_main_~c~0_2, main_~y~0=v_main_~y~0_3, main_~x~0=v_main_~x~0_5, main_~z~0=v_main_~z~0_6} AuxVars[] AssignedVars[main_~x~0, main_~c~0, main_~y~0] {456#(<= ~counter~0 0)} is VALID [2022-04-08 01:07:22,874 INFO L290 TraceCheckUtils]: 17: Hoare triple {456#(<= ~counter~0 0)} [78] L35-3-->L35-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] {505#(<= |main_#t~post6| 0)} is VALID [2022-04-08 01:07:22,874 INFO L290 TraceCheckUtils]: 18: Hoare triple {505#(<= |main_#t~post6| 0)} [81] L35-1-->L35-4: Formula: (not (< |v_main_#t~post6_3| 5)) InVars {main_#t~post6=|v_main_#t~post6_3|} OutVars{} AuxVars[] AssignedVars[main_#t~post6] {449#false} is VALID [2022-04-08 01:07:22,875 INFO L290 TraceCheckUtils]: 19: Hoare triple {449#false} [80] L35-4-->L49: Formula: (= v_main_~x~0_1 (* v_main_~x~0_2 (+ (- 1) v_main_~z~0_1))) InVars {main_~x~0=v_main_~x~0_2, main_~z~0=v_main_~z~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~z~0=v_main_~z~0_1} AuxVars[] AssignedVars[main_~x~0] {449#false} is VALID [2022-04-08 01:07:22,875 INFO L272 TraceCheckUtils]: 20: Hoare triple {449#false} [83] L49-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (= (+ (* (- 1) v_main_~y~0_8) v_main_~x~0_10 1) 0) 1 0)) InVars {main_~x~0=v_main_~x~0_10, main_~y~0=v_main_~y~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {449#false} is VALID [2022-04-08 01:07:22,875 INFO L290 TraceCheckUtils]: 21: Hoare triple {449#false} [86] __VERIFIER_assertENTRY-->L16: Formula: (= v___VERIFIER_assert_~cond_2 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {449#false} is VALID [2022-04-08 01:07:22,875 INFO L290 TraceCheckUtils]: 22: Hoare triple {449#false} [90] L16-->L17: Formula: (= v___VERIFIER_assert_~cond_3 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {449#false} is VALID [2022-04-08 01:07:22,875 INFO L290 TraceCheckUtils]: 23: Hoare triple {449#false} [92] L17-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {449#false} is VALID [2022-04-08 01:07:22,876 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-08 01:07:22,876 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-08 01:07:22,876 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 01:07:22,877 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [300784486] [2022-04-08 01:07:22,877 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 01:07:22,878 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1566865378] [2022-04-08 01:07:22,878 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1566865378] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 01:07:22,878 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 01:07:22,878 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 01:07:22,878 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1081460165] [2022-04-08 01:07:22,878 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 01:07:22,879 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 states have internal predecessors, (13), 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 24 [2022-04-08 01:07:22,879 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 01:07:22,879 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 states have internal predecessors, (13), 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-08 01:07:22,904 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-08 01:07:22,905 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-08 01:07:22,905 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-08 01:07:22,905 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-08 01:07:22,905 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-08 01:07:22,906 INFO L87 Difference]: Start difference. First operand 32 states and 36 transitions. Second operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 states have internal predecessors, (13), 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-08 01:07:22,971 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 01:07:22,971 INFO L93 Difference]: Finished difference Result 40 states and 43 transitions. [2022-04-08 01:07:22,971 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-08 01:07:22,972 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 states have internal predecessors, (13), 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 24 [2022-04-08 01:07:22,972 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 01:07:22,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 states have internal predecessors, (13), 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-08 01:07:22,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 38 transitions. [2022-04-08 01:07:22,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 states have internal predecessors, (13), 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-08 01:07:22,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 38 transitions. [2022-04-08 01:07:22,976 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 38 transitions. [2022-04-08 01:07:23,007 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-08 01:07:23,012 INFO L225 Difference]: With dead ends: 40 [2022-04-08 01:07:23,012 INFO L226 Difference]: Without dead ends: 32 [2022-04-08 01:07:23,013 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 21 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-08 01:07:23,014 INFO L913 BasicCegarLoop]: 26 mSDtfsCounter, 0 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 64 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-08 01:07:23,014 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 64 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-08 01:07:23,015 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2022-04-08 01:07:23,022 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2022-04-08 01:07:23,022 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 01:07:23,022 INFO L82 GeneralOperation]: Start isEquivalent. First operand 32 states. Second operand has 32 states, 20 states have (on average 1.15) internal successors, (23), 22 states have internal predecessors, (23), 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-08 01:07:23,023 INFO L74 IsIncluded]: Start isIncluded. First operand 32 states. Second operand has 32 states, 20 states have (on average 1.15) internal successors, (23), 22 states have internal predecessors, (23), 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-08 01:07:23,023 INFO L87 Difference]: Start difference. First operand 32 states. Second operand has 32 states, 20 states have (on average 1.15) internal successors, (23), 22 states have internal predecessors, (23), 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-08 01:07:23,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 01:07:23,025 INFO L93 Difference]: Finished difference Result 32 states and 35 transitions. [2022-04-08 01:07:23,025 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 35 transitions. [2022-04-08 01:07:23,025 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 01:07:23,025 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 01:07:23,026 INFO L74 IsIncluded]: Start isIncluded. First operand has 32 states, 20 states have (on average 1.15) internal successors, (23), 22 states have internal predecessors, (23), 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 32 states. [2022-04-08 01:07:23,026 INFO L87 Difference]: Start difference. First operand has 32 states, 20 states have (on average 1.15) internal successors, (23), 22 states have internal predecessors, (23), 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 32 states. [2022-04-08 01:07:23,027 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 01:07:23,028 INFO L93 Difference]: Finished difference Result 32 states and 35 transitions. [2022-04-08 01:07:23,028 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 35 transitions. [2022-04-08 01:07:23,028 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 01:07:23,028 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 01:07:23,028 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 01:07:23,028 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 01:07:23,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 20 states have (on average 1.15) internal successors, (23), 22 states have internal predecessors, (23), 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-08 01:07:23,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 35 transitions. [2022-04-08 01:07:23,030 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 35 transitions. Word has length 24 [2022-04-08 01:07:23,030 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 01:07:23,030 INFO L478 AbstractCegarLoop]: Abstraction has 32 states and 35 transitions. [2022-04-08 01:07:23,030 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 states have internal predecessors, (13), 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-08 01:07:23,031 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 35 transitions. [2022-04-08 01:07:23,031 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-04-08 01:07:23,031 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 01:07:23,031 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, 1] [2022-04-08 01:07:23,052 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-08 01:07:23,247 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2022-04-08 01:07:23,248 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 01:07:23,248 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 01:07:23,248 INFO L85 PathProgramCache]: Analyzing trace with hash -974402257, now seen corresponding path program 1 times [2022-04-08 01:07:23,248 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 01:07:23,248 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1049039671] [2022-04-08 01:07:23,249 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 01:07:23,249 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 01:07:23,274 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 01:07:23,275 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1312203350] [2022-04-08 01:07:23,275 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 01:07:23,277 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 01:07:23,277 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 01:07:23,278 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-08 01:07:23,284 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-08 01:07:23,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 01:07:23,325 INFO L263 TraceCheckSpWp]: Trace formula consists of 105 conjuncts, 10 conjunts are in the unsatisfiable core [2022-04-08 01:07:23,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 01:07:23,344 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 01:07:24,942 INFO L272 TraceCheckUtils]: 0: Hoare triple {689#true} [65] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {689#true} is VALID [2022-04-08 01:07:24,942 INFO L290 TraceCheckUtils]: 1: Hoare triple {689#true} [67] 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) 10) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{~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] {689#true} is VALID [2022-04-08 01:07:24,943 INFO L290 TraceCheckUtils]: 2: Hoare triple {689#true} [70] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {689#true} is VALID [2022-04-08 01:07:24,943 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {689#true} {689#true} [95] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {689#true} is VALID [2022-04-08 01:07:24,943 INFO L272 TraceCheckUtils]: 4: Hoare triple {689#true} [66] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {689#true} is VALID [2022-04-08 01:07:24,943 INFO L290 TraceCheckUtils]: 5: Hoare triple {689#true} [69] mainENTRY-->L28: Formula: (and (<= |v_main_#t~nondet5_2| 2147483647) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= |v_main_#t~nondet4_2| 2147483647) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648)) (= v_main_~k~0_1 |v_main_#t~nondet5_2|) (= v_main_~z~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_~c~0=v_main_~c~0_1, main_~y~0=v_main_~y~0_2, main_~x~0=v_main_~x~0_4, main_~k~0=v_main_~k~0_1, main_~z~0=v_main_~z~0_2} AuxVars[] AssignedVars[main_#t~nondet5, main_#t~nondet4, main_~x~0, main_~k~0, main_~z~0, main_~c~0, main_~y~0] {689#true} is VALID [2022-04-08 01:07:24,943 INFO L272 TraceCheckUtils]: 6: Hoare triple {689#true} [71] L28-->assume_abort_if_notENTRY: Formula: (= (ite (<= 1 v_main_~z~0_9) 1 0) |v_assume_abort_if_not_#in~condInParam_1|) InVars {main_~z~0=v_main_~z~0_9} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~z~0, assume_abort_if_not_#in~cond] {689#true} is VALID [2022-04-08 01:07:24,943 INFO L290 TraceCheckUtils]: 7: Hoare triple {689#true} [73] assume_abort_if_notENTRY-->L13: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {689#true} is VALID [2022-04-08 01:07:24,944 INFO L290 TraceCheckUtils]: 8: Hoare triple {689#true} [76] L13-->L13-2: Formula: (not (= v_assume_abort_if_not_~cond_3 0)) InVars {assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} OutVars{assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} AuxVars[] AssignedVars[] {689#true} is VALID [2022-04-08 01:07:24,944 INFO L290 TraceCheckUtils]: 9: Hoare triple {689#true} [79] L13-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {689#true} is VALID [2022-04-08 01:07:24,944 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {689#true} {689#true} [96] assume_abort_if_notEXIT-->L28-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (<= 1 v_main_~z~0_9) 1 0) |v_assume_abort_if_not_#in~condInParam_1|) InVars {main_~z~0=v_main_~z~0_9} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~z~0, assume_abort_if_not_#in~cond] {689#true} is VALID [2022-04-08 01:07:24,944 INFO L272 TraceCheckUtils]: 11: Hoare triple {689#true} [72] L28-1-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (<= 1 v_main_~k~0_7) 1 0)) InVars {main_~k~0=v_main_~k~0_7} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_2|} AuxVars[] AssignedVars[main_~k~0, assume_abort_if_not_#in~cond] {689#true} is VALID [2022-04-08 01:07:24,944 INFO L290 TraceCheckUtils]: 12: Hoare triple {689#true} [73] assume_abort_if_notENTRY-->L13: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {689#true} is VALID [2022-04-08 01:07:24,944 INFO L290 TraceCheckUtils]: 13: Hoare triple {689#true} [76] L13-->L13-2: Formula: (not (= v_assume_abort_if_not_~cond_3 0)) InVars {assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} OutVars{assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} AuxVars[] AssignedVars[] {689#true} is VALID [2022-04-08 01:07:24,945 INFO L290 TraceCheckUtils]: 14: Hoare triple {689#true} [79] L13-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {689#true} is VALID [2022-04-08 01:07:24,945 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {689#true} {689#true} [97] assume_abort_if_notEXIT-->L29: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (<= 1 v_main_~k~0_7) 1 0)) InVars {main_~k~0=v_main_~k~0_7} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_2|} AuxVars[] AssignedVars[main_~k~0, assume_abort_if_not_#in~cond] {689#true} is VALID [2022-04-08 01:07:24,945 INFO L290 TraceCheckUtils]: 16: Hoare triple {689#true} [74] L29-->L35-3: Formula: (and (= v_main_~c~0_2 1) (= v_main_~y~0_3 v_main_~z~0_6) (= v_main_~x~0_5 1)) InVars {main_~z~0=v_main_~z~0_6} OutVars{main_~c~0=v_main_~c~0_2, main_~y~0=v_main_~y~0_3, main_~x~0=v_main_~x~0_5, main_~z~0=v_main_~z~0_6} AuxVars[] AssignedVars[main_~x~0, main_~c~0, main_~y~0] {689#true} is VALID [2022-04-08 01:07:24,945 INFO L290 TraceCheckUtils]: 17: Hoare triple {689#true} [78] L35-3-->L35-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] {689#true} is VALID [2022-04-08 01:07:24,945 INFO L290 TraceCheckUtils]: 18: Hoare triple {689#true} [82] L35-1-->L36: Formula: (< |v_main_#t~post6_5| 5) InVars {main_#t~post6=|v_main_#t~post6_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post6] {689#true} is VALID [2022-04-08 01:07:24,946 INFO L272 TraceCheckUtils]: 19: Hoare triple {689#true} [84] L36-->__VERIFIER_assertENTRY: Formula: (= (ite (= (+ (* v_main_~z~0_10 v_main_~x~0_9) (* (- 1) v_main_~x~0_9) (* (- 1) v_main_~y~0_7) 1) 0) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~y~0=v_main_~y~0_7, main_~x~0=v_main_~x~0_9, main_~z~0=v_main_~z~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~z~0, main_~y~0] {689#true} is VALID [2022-04-08 01:07:24,946 INFO L290 TraceCheckUtils]: 20: Hoare triple {689#true} [86] __VERIFIER_assertENTRY-->L16: Formula: (= v___VERIFIER_assert_~cond_2 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {754#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-08 01:07:24,951 INFO L290 TraceCheckUtils]: 21: Hoare triple {754#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} [91] L16-->L16-2: Formula: (not (= 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[] {758#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 01:07:24,952 INFO L290 TraceCheckUtils]: 22: Hoare triple {758#(not (= |__VERIFIER_assert_#in~cond| 0))} [94] L16-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {758#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 01:07:24,953 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {758#(not (= |__VERIFIER_assert_#in~cond| 0))} {689#true} [99] __VERIFIER_assertEXIT-->L36-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= (+ (* v_main_~z~0_10 v_main_~x~0_9) (* (- 1) v_main_~x~0_9) (* (- 1) v_main_~y~0_7) 1) 0) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~y~0=v_main_~y~0_7, main_~x~0=v_main_~x~0_9, main_~z~0=v_main_~z~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~z~0, main_~y~0] {765#(= (+ (* main_~z~0 main_~x~0) 1) (+ main_~y~0 main_~x~0))} is VALID [2022-04-08 01:07:24,954 INFO L290 TraceCheckUtils]: 24: Hoare triple {765#(= (+ (* main_~z~0 main_~x~0) 1) (+ main_~y~0 main_~x~0))} [87] L36-1-->L35-4: Formula: (not (< v_main_~c~0_3 v_main_~k~0_5)) InVars {main_~c~0=v_main_~c~0_3, main_~k~0=v_main_~k~0_5} OutVars{main_~c~0=v_main_~c~0_3, main_~k~0=v_main_~k~0_5} AuxVars[] AssignedVars[] {765#(= (+ (* main_~z~0 main_~x~0) 1) (+ main_~y~0 main_~x~0))} is VALID [2022-04-08 01:07:24,955 INFO L290 TraceCheckUtils]: 25: Hoare triple {765#(= (+ (* main_~z~0 main_~x~0) 1) (+ main_~y~0 main_~x~0))} [80] L35-4-->L49: Formula: (= v_main_~x~0_1 (* v_main_~x~0_2 (+ (- 1) v_main_~z~0_1))) InVars {main_~x~0=v_main_~x~0_2, main_~z~0=v_main_~z~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~z~0=v_main_~z~0_1} AuxVars[] AssignedVars[main_~x~0] {772#(exists ((v_main_~x~0_11 Int) (main_~z~0 Int)) (and (= (+ (* v_main_~x~0_11 main_~z~0) 1) (+ v_main_~x~0_11 main_~y~0)) (= main_~x~0 (* v_main_~x~0_11 (+ (- 1) main_~z~0)))))} is VALID [2022-04-08 01:07:24,956 INFO L272 TraceCheckUtils]: 26: Hoare triple {772#(exists ((v_main_~x~0_11 Int) (main_~z~0 Int)) (and (= (+ (* v_main_~x~0_11 main_~z~0) 1) (+ v_main_~x~0_11 main_~y~0)) (= main_~x~0 (* v_main_~x~0_11 (+ (- 1) main_~z~0)))))} [83] L49-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (= (+ (* (- 1) v_main_~y~0_8) v_main_~x~0_10 1) 0) 1 0)) InVars {main_~x~0=v_main_~x~0_10, main_~y~0=v_main_~y~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {776#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 01:07:24,957 INFO L290 TraceCheckUtils]: 27: Hoare triple {776#(<= 1 |__VERIFIER_assert_#in~cond|)} [86] __VERIFIER_assertENTRY-->L16: Formula: (= v___VERIFIER_assert_~cond_2 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {780#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 01:07:24,957 INFO L290 TraceCheckUtils]: 28: Hoare triple {780#(<= 1 __VERIFIER_assert_~cond)} [90] L16-->L17: Formula: (= v___VERIFIER_assert_~cond_3 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {690#false} is VALID [2022-04-08 01:07:24,957 INFO L290 TraceCheckUtils]: 29: Hoare triple {690#false} [92] L17-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {690#false} is VALID [2022-04-08 01:07:24,958 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-08 01:07:24,958 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 01:07:25,267 INFO L290 TraceCheckUtils]: 29: Hoare triple {690#false} [92] L17-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {690#false} is VALID [2022-04-08 01:07:25,267 INFO L290 TraceCheckUtils]: 28: Hoare triple {780#(<= 1 __VERIFIER_assert_~cond)} [90] L16-->L17: Formula: (= v___VERIFIER_assert_~cond_3 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {690#false} is VALID [2022-04-08 01:07:25,268 INFO L290 TraceCheckUtils]: 27: Hoare triple {776#(<= 1 |__VERIFIER_assert_#in~cond|)} [86] __VERIFIER_assertENTRY-->L16: Formula: (= v___VERIFIER_assert_~cond_2 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {780#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 01:07:25,269 INFO L272 TraceCheckUtils]: 26: Hoare triple {796#(= (+ main_~x~0 1) main_~y~0)} [83] L49-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (= (+ (* (- 1) v_main_~y~0_8) v_main_~x~0_10 1) 0) 1 0)) InVars {main_~x~0=v_main_~x~0_10, main_~y~0=v_main_~y~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {776#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 01:07:25,270 INFO L290 TraceCheckUtils]: 25: Hoare triple {765#(= (+ (* main_~z~0 main_~x~0) 1) (+ main_~y~0 main_~x~0))} [80] L35-4-->L49: Formula: (= v_main_~x~0_1 (* v_main_~x~0_2 (+ (- 1) v_main_~z~0_1))) InVars {main_~x~0=v_main_~x~0_2, main_~z~0=v_main_~z~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~z~0=v_main_~z~0_1} AuxVars[] AssignedVars[main_~x~0] {796#(= (+ main_~x~0 1) main_~y~0)} is VALID [2022-04-08 01:07:25,270 INFO L290 TraceCheckUtils]: 24: Hoare triple {765#(= (+ (* main_~z~0 main_~x~0) 1) (+ main_~y~0 main_~x~0))} [87] L36-1-->L35-4: Formula: (not (< v_main_~c~0_3 v_main_~k~0_5)) InVars {main_~c~0=v_main_~c~0_3, main_~k~0=v_main_~k~0_5} OutVars{main_~c~0=v_main_~c~0_3, main_~k~0=v_main_~k~0_5} AuxVars[] AssignedVars[] {765#(= (+ (* main_~z~0 main_~x~0) 1) (+ main_~y~0 main_~x~0))} is VALID [2022-04-08 01:07:25,271 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {758#(not (= |__VERIFIER_assert_#in~cond| 0))} {689#true} [99] __VERIFIER_assertEXIT-->L36-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= (+ (* v_main_~z~0_10 v_main_~x~0_9) (* (- 1) v_main_~x~0_9) (* (- 1) v_main_~y~0_7) 1) 0) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~y~0=v_main_~y~0_7, main_~x~0=v_main_~x~0_9, main_~z~0=v_main_~z~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~z~0, main_~y~0] {765#(= (+ (* main_~z~0 main_~x~0) 1) (+ main_~y~0 main_~x~0))} is VALID [2022-04-08 01:07:25,272 INFO L290 TraceCheckUtils]: 22: Hoare triple {758#(not (= |__VERIFIER_assert_#in~cond| 0))} [94] L16-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {758#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 01:07:25,273 INFO L290 TraceCheckUtils]: 21: Hoare triple {815#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} [91] L16-->L16-2: Formula: (not (= 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[] {758#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 01:07:25,286 INFO L290 TraceCheckUtils]: 20: Hoare triple {689#true} [86] __VERIFIER_assertENTRY-->L16: Formula: (= v___VERIFIER_assert_~cond_2 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {815#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-08 01:07:25,286 INFO L272 TraceCheckUtils]: 19: Hoare triple {689#true} [84] L36-->__VERIFIER_assertENTRY: Formula: (= (ite (= (+ (* v_main_~z~0_10 v_main_~x~0_9) (* (- 1) v_main_~x~0_9) (* (- 1) v_main_~y~0_7) 1) 0) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~y~0=v_main_~y~0_7, main_~x~0=v_main_~x~0_9, main_~z~0=v_main_~z~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~z~0, main_~y~0] {689#true} is VALID [2022-04-08 01:07:25,286 INFO L290 TraceCheckUtils]: 18: Hoare triple {689#true} [82] L35-1-->L36: Formula: (< |v_main_#t~post6_5| 5) InVars {main_#t~post6=|v_main_#t~post6_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post6] {689#true} is VALID [2022-04-08 01:07:25,286 INFO L290 TraceCheckUtils]: 17: Hoare triple {689#true} [78] L35-3-->L35-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] {689#true} is VALID [2022-04-08 01:07:25,287 INFO L290 TraceCheckUtils]: 16: Hoare triple {689#true} [74] L29-->L35-3: Formula: (and (= v_main_~c~0_2 1) (= v_main_~y~0_3 v_main_~z~0_6) (= v_main_~x~0_5 1)) InVars {main_~z~0=v_main_~z~0_6} OutVars{main_~c~0=v_main_~c~0_2, main_~y~0=v_main_~y~0_3, main_~x~0=v_main_~x~0_5, main_~z~0=v_main_~z~0_6} AuxVars[] AssignedVars[main_~x~0, main_~c~0, main_~y~0] {689#true} is VALID [2022-04-08 01:07:25,287 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {689#true} {689#true} [97] assume_abort_if_notEXIT-->L29: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (<= 1 v_main_~k~0_7) 1 0)) InVars {main_~k~0=v_main_~k~0_7} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_2|} AuxVars[] AssignedVars[main_~k~0, assume_abort_if_not_#in~cond] {689#true} is VALID [2022-04-08 01:07:25,287 INFO L290 TraceCheckUtils]: 14: Hoare triple {689#true} [79] L13-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {689#true} is VALID [2022-04-08 01:07:25,287 INFO L290 TraceCheckUtils]: 13: Hoare triple {689#true} [76] L13-->L13-2: Formula: (not (= v_assume_abort_if_not_~cond_3 0)) InVars {assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} OutVars{assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} AuxVars[] AssignedVars[] {689#true} is VALID [2022-04-08 01:07:25,287 INFO L290 TraceCheckUtils]: 12: Hoare triple {689#true} [73] assume_abort_if_notENTRY-->L13: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {689#true} is VALID [2022-04-08 01:07:25,287 INFO L272 TraceCheckUtils]: 11: Hoare triple {689#true} [72] L28-1-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (<= 1 v_main_~k~0_7) 1 0)) InVars {main_~k~0=v_main_~k~0_7} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_2|} AuxVars[] AssignedVars[main_~k~0, assume_abort_if_not_#in~cond] {689#true} is VALID [2022-04-08 01:07:25,288 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {689#true} {689#true} [96] assume_abort_if_notEXIT-->L28-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (<= 1 v_main_~z~0_9) 1 0) |v_assume_abort_if_not_#in~condInParam_1|) InVars {main_~z~0=v_main_~z~0_9} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~z~0, assume_abort_if_not_#in~cond] {689#true} is VALID [2022-04-08 01:07:25,288 INFO L290 TraceCheckUtils]: 9: Hoare triple {689#true} [79] L13-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {689#true} is VALID [2022-04-08 01:07:25,288 INFO L290 TraceCheckUtils]: 8: Hoare triple {689#true} [76] L13-->L13-2: Formula: (not (= v_assume_abort_if_not_~cond_3 0)) InVars {assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} OutVars{assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} AuxVars[] AssignedVars[] {689#true} is VALID [2022-04-08 01:07:25,288 INFO L290 TraceCheckUtils]: 7: Hoare triple {689#true} [73] assume_abort_if_notENTRY-->L13: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {689#true} is VALID [2022-04-08 01:07:25,288 INFO L272 TraceCheckUtils]: 6: Hoare triple {689#true} [71] L28-->assume_abort_if_notENTRY: Formula: (= (ite (<= 1 v_main_~z~0_9) 1 0) |v_assume_abort_if_not_#in~condInParam_1|) InVars {main_~z~0=v_main_~z~0_9} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~z~0, assume_abort_if_not_#in~cond] {689#true} is VALID [2022-04-08 01:07:25,288 INFO L290 TraceCheckUtils]: 5: Hoare triple {689#true} [69] mainENTRY-->L28: Formula: (and (<= |v_main_#t~nondet5_2| 2147483647) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= |v_main_#t~nondet4_2| 2147483647) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648)) (= v_main_~k~0_1 |v_main_#t~nondet5_2|) (= v_main_~z~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_~c~0=v_main_~c~0_1, main_~y~0=v_main_~y~0_2, main_~x~0=v_main_~x~0_4, main_~k~0=v_main_~k~0_1, main_~z~0=v_main_~z~0_2} AuxVars[] AssignedVars[main_#t~nondet5, main_#t~nondet4, main_~x~0, main_~k~0, main_~z~0, main_~c~0, main_~y~0] {689#true} is VALID [2022-04-08 01:07:25,289 INFO L272 TraceCheckUtils]: 4: Hoare triple {689#true} [66] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {689#true} is VALID [2022-04-08 01:07:25,289 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {689#true} {689#true} [95] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {689#true} is VALID [2022-04-08 01:07:25,289 INFO L290 TraceCheckUtils]: 2: Hoare triple {689#true} [70] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {689#true} is VALID [2022-04-08 01:07:25,289 INFO L290 TraceCheckUtils]: 1: Hoare triple {689#true} [67] 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) 10) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{~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] {689#true} is VALID [2022-04-08 01:07:25,289 INFO L272 TraceCheckUtils]: 0: Hoare triple {689#true} [65] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {689#true} is VALID [2022-04-08 01:07:25,289 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-08 01:07:25,290 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 01:07:25,290 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1049039671] [2022-04-08 01:07:25,290 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 01:07:25,290 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1312203350] [2022-04-08 01:07:25,290 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1312203350] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 01:07:25,290 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-08 01:07:25,290 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 10 [2022-04-08 01:07:25,290 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1595879105] [2022-04-08 01:07:25,290 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-08 01:07:25,291 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 8 states have (on average 2.5) internal successors, (20), 9 states have internal predecessors, (20), 3 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) Word has length 30 [2022-04-08 01:07:25,291 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 01:07:25,291 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 10 states, 8 states have (on average 2.5) internal successors, (20), 9 states have internal predecessors, (20), 3 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2022-04-08 01:07:25,323 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 31 edges. 31 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 01:07:25,324 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-04-08 01:07:25,324 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-08 01:07:25,324 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-04-08 01:07:25,324 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2022-04-08 01:07:25,325 INFO L87 Difference]: Start difference. First operand 32 states and 35 transitions. Second operand has 10 states, 8 states have (on average 2.5) internal successors, (20), 9 states have internal predecessors, (20), 3 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2022-04-08 01:07:25,518 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 01:07:25,518 INFO L93 Difference]: Finished difference Result 32 states and 35 transitions. [2022-04-08 01:07:25,518 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-08 01:07:25,518 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 8 states have (on average 2.5) internal successors, (20), 9 states have internal predecessors, (20), 3 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) Word has length 30 [2022-04-08 01:07:25,519 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 01:07:25,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 8 states have (on average 2.5) internal successors, (20), 9 states have internal predecessors, (20), 3 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2022-04-08 01:07:25,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 28 transitions. [2022-04-08 01:07:25,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 8 states have (on average 2.5) internal successors, (20), 9 states have internal predecessors, (20), 3 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2022-04-08 01:07:25,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 28 transitions. [2022-04-08 01:07:25,521 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 28 transitions. [2022-04-08 01:07:25,567 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 28 edges. 28 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 01:07:25,567 INFO L225 Difference]: With dead ends: 32 [2022-04-08 01:07:25,567 INFO L226 Difference]: Without dead ends: 0 [2022-04-08 01:07:25,568 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 49 SyntacticMatches, 3 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 1 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2022-04-08 01:07:25,569 INFO L913 BasicCegarLoop]: 21 mSDtfsCounter, 11 mSDsluCounter, 83 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 104 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 8 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-08 01:07:25,569 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [11 Valid, 104 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 25 Invalid, 0 Unknown, 8 Unchecked, 0.0s Time] [2022-04-08 01:07:25,570 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-04-08 01:07:25,570 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-04-08 01:07:25,570 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 01:07:25,570 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-08 01:07:25,570 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-08 01:07:25,570 INFO L87 Difference]: Start difference. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-08 01:07:25,570 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 01:07:25,570 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-08 01:07:25,570 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-08 01:07:25,571 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 01:07:25,571 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 01:07:25,571 INFO L74 IsIncluded]: Start isIncluded. First operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 0 states. [2022-04-08 01:07:25,571 INFO L87 Difference]: Start difference. First operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 0 states. [2022-04-08 01:07:25,571 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 01:07:25,571 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-08 01:07:25,571 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-08 01:07:25,571 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 01:07:25,571 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 01:07:25,571 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 01:07:25,571 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 01:07:25,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-08 01:07:25,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-04-08 01:07:25,572 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 30 [2022-04-08 01:07:25,572 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 01:07:25,572 INFO L478 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-04-08 01:07:25,572 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 8 states have (on average 2.5) internal successors, (20), 9 states have internal predecessors, (20), 3 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2022-04-08 01:07:25,572 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-08 01:07:25,572 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 01:07:25,574 INFO L788 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-04-08 01:07:25,597 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-08 01:07:25,783 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 01:07:25,785 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-04-08 01:07:25,848 INFO L878 garLoopResultBuilder]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|)) [2022-04-08 01:07:25,849 INFO L882 garLoopResultBuilder]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2022-04-08 01:07:25,849 INFO L882 garLoopResultBuilder]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2022-04-08 01:07:25,849 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2022-04-08 01:07:25,849 INFO L878 garLoopResultBuilder]: At program point L-1(line -1) the Hoare annotation is: (<= ~counter~0 0) [2022-04-08 01:07:25,849 INFO L882 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2022-04-08 01:07:25,849 INFO L882 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-04-08 01:07:25,849 INFO L885 garLoopResultBuilder]: At program point assume_abort_if_notENTRY(lines 12 14) the Hoare annotation is: true [2022-04-08 01:07:25,849 INFO L882 garLoopResultBuilder]: For program point L13(line 13) no Hoare annotation was computed. [2022-04-08 01:07:25,849 INFO L882 garLoopResultBuilder]: For program point L13-2(lines 12 14) no Hoare annotation was computed. [2022-04-08 01:07:25,849 INFO L882 garLoopResultBuilder]: For program point assume_abort_if_notEXIT(lines 12 14) no Hoare annotation was computed. [2022-04-08 01:07:25,849 INFO L878 garLoopResultBuilder]: At program point mainENTRY(lines 23 51) the Hoare annotation is: (or (= ~counter~0 |old(~counter~0)|) (not (<= |old(~counter~0)| 0))) [2022-04-08 01:07:25,849 INFO L878 garLoopResultBuilder]: At program point L28(line 28) the Hoare annotation is: (or (= ~counter~0 |old(~counter~0)|) (not (<= |old(~counter~0)| 0))) [2022-04-08 01:07:25,849 INFO L878 garLoopResultBuilder]: At program point L28-1(line 28) the Hoare annotation is: (or (= ~counter~0 |old(~counter~0)|) (not (<= |old(~counter~0)| 0))) [2022-04-08 01:07:25,850 INFO L882 garLoopResultBuilder]: For program point L29(line 29) no Hoare annotation was computed. [2022-04-08 01:07:25,850 INFO L878 garLoopResultBuilder]: At program point L35-3(lines 35 45) the Hoare annotation is: (or (= (+ (* main_~z~0 main_~x~0) 1) (+ main_~y~0 main_~x~0)) (not (<= |old(~counter~0)| 0))) [2022-04-08 01:07:25,850 INFO L882 garLoopResultBuilder]: For program point L35-4(lines 35 45) no Hoare annotation was computed. [2022-04-08 01:07:25,850 INFO L882 garLoopResultBuilder]: For program point L35-1(lines 35 45) no Hoare annotation was computed. [2022-04-08 01:07:25,850 INFO L878 garLoopResultBuilder]: At program point L49(line 49) the Hoare annotation is: (or (= (+ main_~x~0 1) main_~y~0) (not (<= |old(~counter~0)| 0))) [2022-04-08 01:07:25,850 INFO L878 garLoopResultBuilder]: At program point L36(line 36) the Hoare annotation is: (or (= (+ (* main_~z~0 main_~x~0) 1) (+ main_~y~0 main_~x~0)) (not (<= |old(~counter~0)| 0))) [2022-04-08 01:07:25,850 INFO L882 garLoopResultBuilder]: For program point L49-1(line 49) no Hoare annotation was computed. [2022-04-08 01:07:25,850 INFO L882 garLoopResultBuilder]: For program point L36-1(lines 35 45) no Hoare annotation was computed. [2022-04-08 01:07:25,850 INFO L882 garLoopResultBuilder]: For program point mainFINAL(lines 23 51) no Hoare annotation was computed. [2022-04-08 01:07:25,850 INFO L882 garLoopResultBuilder]: For program point mainEXIT(lines 23 51) no Hoare annotation was computed. [2022-04-08 01:07:25,850 INFO L885 garLoopResultBuilder]: At program point __VERIFIER_assertENTRY(lines 15 21) the Hoare annotation is: true [2022-04-08 01:07:25,850 INFO L882 garLoopResultBuilder]: For program point L16(lines 16 19) no Hoare annotation was computed. [2022-04-08 01:07:25,850 INFO L882 garLoopResultBuilder]: For program point L17(lines 17 18) no Hoare annotation was computed. [2022-04-08 01:07:25,851 INFO L882 garLoopResultBuilder]: For program point L16-2(lines 15 21) no Hoare annotation was computed. [2022-04-08 01:07:25,851 INFO L882 garLoopResultBuilder]: For program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 18) no Hoare annotation was computed. [2022-04-08 01:07:25,851 INFO L882 garLoopResultBuilder]: For program point __VERIFIER_assertEXIT(lines 15 21) no Hoare annotation was computed. [2022-04-08 01:07:25,853 INFO L719 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2022-04-08 01:07:25,854 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-04-08 01:07:25,858 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2022-04-08 01:07:25,859 WARN L170 areAnnotationChecker]: L13 has no Hoare annotation [2022-04-08 01:07:25,859 WARN L170 areAnnotationChecker]: L16 has no Hoare annotation [2022-04-08 01:07:25,859 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2022-04-08 01:07:25,859 WARN L170 areAnnotationChecker]: L13 has no Hoare annotation [2022-04-08 01:07:25,859 WARN L170 areAnnotationChecker]: L13 has no Hoare annotation [2022-04-08 01:07:25,859 WARN L170 areAnnotationChecker]: L16 has no Hoare annotation [2022-04-08 01:07:25,859 WARN L170 areAnnotationChecker]: L16 has no Hoare annotation [2022-04-08 01:07:25,859 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2022-04-08 01:07:25,859 WARN L170 areAnnotationChecker]: L13-2 has no Hoare annotation [2022-04-08 01:07:25,859 WARN L170 areAnnotationChecker]: L17 has no Hoare annotation [2022-04-08 01:07:25,859 WARN L170 areAnnotationChecker]: L17 has no Hoare annotation [2022-04-08 01:07:25,859 WARN L170 areAnnotationChecker]: L16-2 has no Hoare annotation [2022-04-08 01:07:25,860 WARN L170 areAnnotationChecker]: assume_abort_if_notEXIT has no Hoare annotation [2022-04-08 01:07:25,860 WARN L170 areAnnotationChecker]: assume_abort_if_notEXIT has no Hoare annotation [2022-04-08 01:07:25,860 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-08 01:07:25,860 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-08 01:07:25,860 WARN L170 areAnnotationChecker]: L29 has no Hoare annotation [2022-04-08 01:07:25,860 WARN L170 areAnnotationChecker]: L36-1 has no Hoare annotation [2022-04-08 01:07:25,860 WARN L170 areAnnotationChecker]: L36-1 has no Hoare annotation [2022-04-08 01:07:25,860 WARN L170 areAnnotationChecker]: L49-1 has no Hoare annotation [2022-04-08 01:07:25,860 WARN L170 areAnnotationChecker]: L35-4 has no Hoare annotation [2022-04-08 01:07:25,860 WARN L170 areAnnotationChecker]: L35-1 has no Hoare annotation [2022-04-08 01:07:25,860 WARN L170 areAnnotationChecker]: L35-4 has no Hoare annotation [2022-04-08 01:07:25,860 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2022-04-08 01:07:25,860 WARN L170 areAnnotationChecker]: L35-1 has no Hoare annotation [2022-04-08 01:07:25,860 WARN L170 areAnnotationChecker]: L35-1 has no Hoare annotation [2022-04-08 01:07:25,860 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2022-04-08 01:07:25,860 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2022-04-08 01:07:25,860 INFO L163 areAnnotationChecker]: CFG has 7 edges. 7 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2022-04-08 01:07:25,869 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.04 01:07:25 BasicIcfg [2022-04-08 01:07:25,869 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-04-08 01:07:25,870 INFO L158 Benchmark]: Toolchain (without parser) took 5398.02ms. Allocated memory was 184.5MB in the beginning and 222.3MB in the end (delta: 37.7MB). Free memory was 132.0MB in the beginning and 84.0MB in the end (delta: 48.0MB). Peak memory consumption was 85.6MB. Max. memory is 8.0GB. [2022-04-08 01:07:25,870 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 184.5MB. Free memory was 148.2MB in the beginning and 148.1MB in the end (delta: 136.3kB). There was no memory consumed. Max. memory is 8.0GB. [2022-04-08 01:07:25,870 INFO L158 Benchmark]: CACSL2BoogieTranslator took 243.76ms. Allocated memory was 184.5MB in the beginning and 222.3MB in the end (delta: 37.7MB). Free memory was 131.7MB in the beginning and 199.4MB in the end (delta: -67.7MB). Peak memory consumption was 11.4MB. Max. memory is 8.0GB. [2022-04-08 01:07:25,871 INFO L158 Benchmark]: Boogie Preprocessor took 24.76ms. Allocated memory is still 222.3MB. Free memory was 199.4MB in the beginning and 197.8MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-04-08 01:07:25,871 INFO L158 Benchmark]: RCFGBuilder took 321.79ms. Allocated memory is still 222.3MB. Free memory was 197.8MB in the beginning and 186.3MB in the end (delta: 11.5MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. [2022-04-08 01:07:25,871 INFO L158 Benchmark]: IcfgTransformer took 32.66ms. Allocated memory is still 222.3MB. Free memory was 186.3MB in the beginning and 184.7MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-04-08 01:07:25,871 INFO L158 Benchmark]: TraceAbstraction took 4767.31ms. Allocated memory is still 222.3MB. Free memory was 184.2MB in the beginning and 84.0MB in the end (delta: 100.2MB). Peak memory consumption was 100.2MB. Max. memory is 8.0GB. [2022-04-08 01:07:25,873 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.11ms. Allocated memory is still 184.5MB. Free memory was 148.2MB in the beginning and 148.1MB in the end (delta: 136.3kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 243.76ms. Allocated memory was 184.5MB in the beginning and 222.3MB in the end (delta: 37.7MB). Free memory was 131.7MB in the beginning and 199.4MB in the end (delta: -67.7MB). Peak memory consumption was 11.4MB. Max. memory is 8.0GB. * Boogie Preprocessor took 24.76ms. Allocated memory is still 222.3MB. Free memory was 199.4MB in the beginning and 197.8MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 321.79ms. Allocated memory is still 222.3MB. Free memory was 197.8MB in the beginning and 186.3MB in the end (delta: 11.5MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. * IcfgTransformer took 32.66ms. Allocated memory is still 222.3MB. Free memory was 186.3MB in the beginning and 184.7MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * TraceAbstraction took 4767.31ms. Allocated memory is still 222.3MB. Free memory was 184.2MB in the beginning and 84.0MB in the end (delta: 100.2MB). Peak memory consumption was 100.2MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 18]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 30 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 4.7s, OverallIterations: 4, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.1s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 31 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 28 mSDsluCounter, 290 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 8 IncrementalHoareTripleChecker+Unchecked, 189 mSDsCounter, 10 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 72 IncrementalHoareTripleChecker+Invalid, 90 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 10 mSolverCounterUnsat, 101 mSDtfsCounter, 72 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 117 GetRequests, 98 SyntacticMatches, 3 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 1 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=32occurred in iteration=2, InterpolantAutomatonStates: 18, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 4 MinimizatonAttempts, 3 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 11 LocationsWithAnnotation, 18 PreInvPairs, 24 NumberOfFragments, 78 HoareAnnotationTreeSize, 18 FomulaSimplifications, 37 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 11 FomulaSimplificationsInter, 12 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 2.5s InterpolantComputationTime, 100 NumberOfCodeBlocks, 100 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 125 ConstructedInterpolants, 1 QuantifiedInterpolants, 272 SizeOfPredicates, 5 NumberOfNonLiveVariables, 293 ConjunctsInSsa, 22 ConjunctsInUnsatCore, 5 InterpolantComputations, 3 PerfectInterpolantSequences, 22/24 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 35]: Loop Invariant Derived loop invariant: z * x + 1 == y + x || !(\old(counter) <= 0) RESULT: Ultimate proved your program to be correct! [2022-04-08 01:07:25,886 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...