/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/automizer/LoopAccelerationJordanC.epf -i ../../../trunk/examples/svcomp/loop-lit/hhk2008.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-fb4f59a-m [2022-04-27 16:21:29,024 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-27 16:21:29,026 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-27 16:21:29,049 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-27 16:21:29,049 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-27 16:21:29,050 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-27 16:21:29,051 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-27 16:21:29,053 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-27 16:21:29,055 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-27 16:21:29,055 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-27 16:21:29,056 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-27 16:21:29,057 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-27 16:21:29,058 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-27 16:21:29,058 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-27 16:21:29,059 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-27 16:21:29,061 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-27 16:21:29,061 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-27 16:21:29,062 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-27 16:21:29,064 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-27 16:21:29,065 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-27 16:21:29,067 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-27 16:21:29,067 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-27 16:21:29,068 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-27 16:21:29,069 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-27 16:21:29,070 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-27 16:21:29,073 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-27 16:21:29,073 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-27 16:21:29,073 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-27 16:21:29,074 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-27 16:21:29,074 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-27 16:21:29,075 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-27 16:21:29,075 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-27 16:21:29,076 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-27 16:21:29,077 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-27 16:21:29,077 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-27 16:21:29,078 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-27 16:21:29,078 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-27 16:21:29,079 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-27 16:21:29,079 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-27 16:21:29,079 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-27 16:21:29,080 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-27 16:21:29,080 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-27 16:21:29,081 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/LoopAccelerationJordanC.epf [2022-04-27 16:21:29,088 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-27 16:21:29,089 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-27 16:21:29,090 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-27 16:21:29,090 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-27 16:21:29,090 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-27 16:21:29,090 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-27 16:21:29,091 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-27 16:21:29,091 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-27 16:21:29,091 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-27 16:21:29,091 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-27 16:21:29,091 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-27 16:21:29,091 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-27 16:21:29,092 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-27 16:21:29,092 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-27 16:21:29,092 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-27 16:21:29,092 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-27 16:21:29,092 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-27 16:21:29,093 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-27 16:21:29,093 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-27 16:21:29,093 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-27 16:21:29,093 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-04-27 16:21:29,094 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-04-27 16:21:29,094 INFO L138 SettingsManager]: * TransformationType=LOOP_ACCELERATION_JORDAN 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-27 16:21:29,323 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-27 16:21:29,344 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-27 16:21:29,347 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-27 16:21:29,348 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-27 16:21:29,349 INFO L275 PluginConnector]: CDTParser initialized [2022-04-27 16:21:29,351 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-lit/hhk2008.i [2022-04-27 16:21:29,430 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7418e003b/f938b941377b4bc0810a56dc2716aca8/FLAG2b540fe5d [2022-04-27 16:21:29,789 INFO L306 CDTParser]: Found 1 translation units. [2022-04-27 16:21:29,789 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-lit/hhk2008.i [2022-04-27 16:21:29,794 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7418e003b/f938b941377b4bc0810a56dc2716aca8/FLAG2b540fe5d [2022-04-27 16:21:30,210 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7418e003b/f938b941377b4bc0810a56dc2716aca8 [2022-04-27 16:21:30,212 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-27 16:21:30,213 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-04-27 16:21:30,214 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-27 16:21:30,215 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-27 16:21:30,224 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-27 16:21:30,225 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.04 04:21:30" (1/1) ... [2022-04-27 16:21:30,226 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@187fb079 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 04:21:30, skipping insertion in model container [2022-04-27 16:21:30,226 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.04 04:21:30" (1/1) ... [2022-04-27 16:21:30,233 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-27 16:21:30,248 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-27 16:21:30,388 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-lit/hhk2008.i[895,908] [2022-04-27 16:21:30,398 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-27 16:21:30,405 INFO L203 MainTranslator]: Completed pre-run [2022-04-27 16:21:30,416 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-lit/hhk2008.i[895,908] [2022-04-27 16:21:30,420 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-27 16:21:30,434 INFO L208 MainTranslator]: Completed translation [2022-04-27 16:21:30,435 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 04:21:30 WrapperNode [2022-04-27 16:21:30,435 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-27 16:21:30,436 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-27 16:21:30,436 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-27 16:21:30,436 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-27 16:21:30,446 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 04:21:30" (1/1) ... [2022-04-27 16:21:30,446 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 04:21:30" (1/1) ... [2022-04-27 16:21:30,453 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 04:21:30" (1/1) ... [2022-04-27 16:21:30,453 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 04:21:30" (1/1) ... [2022-04-27 16:21:30,468 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 04:21:30" (1/1) ... [2022-04-27 16:21:30,476 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 04:21:30" (1/1) ... [2022-04-27 16:21:30,477 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 04:21:30" (1/1) ... [2022-04-27 16:21:30,478 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-27 16:21:30,479 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-27 16:21:30,479 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-27 16:21:30,479 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-27 16:21:30,482 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 04:21:30" (1/1) ... [2022-04-27 16:21:30,495 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-27 16:21:30,505 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 16:21:30,516 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-27 16:21:30,527 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-27 16:21:30,548 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-27 16:21:30,548 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-27 16:21:30,548 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-27 16:21:30,548 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-27 16:21:30,549 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-27 16:21:30,549 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-27 16:21:30,549 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-27 16:21:30,549 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-27 16:21:30,549 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_perror_fail [2022-04-27 16:21:30,549 INFO L130 BoogieDeclarations]: Found specification of procedure __assert [2022-04-27 16:21:30,549 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-27 16:21:30,549 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-27 16:21:30,550 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-27 16:21:30,550 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-27 16:21:30,550 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-04-27 16:21:30,550 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-27 16:21:30,550 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-27 16:21:30,550 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-27 16:21:30,550 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-27 16:21:30,550 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-27 16:21:30,550 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-27 16:21:30,551 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-27 16:21:30,599 INFO L234 CfgBuilder]: Building ICFG [2022-04-27 16:21:30,601 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-27 16:21:30,716 INFO L275 CfgBuilder]: Performing block encoding [2022-04-27 16:21:30,722 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-27 16:21:30,722 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-27 16:21:30,723 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.04 04:21:30 BoogieIcfgContainer [2022-04-27 16:21:30,724 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-27 16:21:30,724 INFO L113 PluginConnector]: ------------------------IcfgTransformer---------------------------- [2022-04-27 16:21:30,724 INFO L271 PluginConnector]: Initializing IcfgTransformer... [2022-04-27 16:21:30,725 INFO L275 PluginConnector]: IcfgTransformer initialized [2022-04-27 16:21:30,728 INFO L185 PluginConnector]: Executing the observer IcfgTransformationObserver from plugin IcfgTransformer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.04 04:21:30" (1/1) ... [2022-04-27 16:21:30,729 INFO L168 ansformationObserver]: Applying ICFG transformation LOOP_ACCELERATION_JORDAN [2022-04-27 16:21:31,198 INFO L89 elerationTransformer]: Jordan loop acceleration statistics: 0 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-27 16:21:31,198 INFO L91 elerationTransformer]: Accelerated Formula: (and (= v_main_~cnt~0_1 (+ (- 1) v_main_~cnt~0_2)) (< 0 v_main_~cnt~0_2) (= (+ v_main_~res~0_2 1) v_main_~res~0_1)) InVars {main_~res~0=v_main_~res~0_2, main_~cnt~0=v_main_~cnt~0_2} OutVars{main_~res~0=v_main_~res~0_1, main_~cnt~0=v_main_~cnt~0_1} AuxVars[] AssignedVars[main_~res~0, main_~cnt~0] to Formula: (or (and (< v_main_~res~0_2 v_main_~res~0_1) (= (+ v_main_~cnt~0_1 v_main_~res~0_1) (+ v_main_~cnt~0_2 v_main_~res~0_2)) (< v_main_~res~0_1 (+ v_main_~cnt~0_2 v_main_~res~0_2 1))) (and (<= v_main_~cnt~0_2 0) (= v_main_~res~0_2 v_main_~res~0_1) (= v_main_~cnt~0_2 v_main_~cnt~0_1))) InVars {main_~res~0=v_main_~res~0_2, main_~cnt~0=v_main_~cnt~0_2} OutVars{main_~res~0=v_main_~res~0_1, main_~cnt~0=v_main_~cnt~0_1} AuxVars[] AssignedVars[main_~res~0, main_~cnt~0] [2022-04-27 16:21:31,204 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 27.04 04:21:31 BasicIcfg [2022-04-27 16:21:31,204 INFO L132 PluginConnector]: ------------------------ END IcfgTransformer---------------------------- [2022-04-27 16:21:31,205 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-27 16:21:31,205 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-27 16:21:31,213 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-27 16:21:31,214 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.04 04:21:30" (1/4) ... [2022-04-27 16:21:31,214 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1221b16c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.04 04:21:31, skipping insertion in model container [2022-04-27 16:21:31,214 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 04:21:30" (2/4) ... [2022-04-27 16:21:31,215 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1221b16c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.04 04:21:31, skipping insertion in model container [2022-04-27 16:21:31,215 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.04 04:21:30" (3/4) ... [2022-04-27 16:21:31,217 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1221b16c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.04 04:21:31, skipping insertion in model container [2022-04-27 16:21:31,217 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 27.04 04:21:31" (4/4) ... [2022-04-27 16:21:31,218 INFO L111 eAbstractionObserver]: Analyzing ICFG hhk2008.iJordan [2022-04-27 16:21:31,231 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION [2022-04-27 16:21:31,231 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-27 16:21:31,261 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-27 16:21:31,267 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=ForwardPredicates, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=false, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@11cd4d4a, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@52b75b52 [2022-04-27 16:21:31,267 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-27 16:21:31,279 INFO L276 IsEmpty]: Start isEmpty. Operand has 21 states, 13 states have (on average 1.4615384615384615) internal successors, (19), 14 states have internal predecessors, (19), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-27 16:21:31,284 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-04-27 16:21:31,285 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 16:21:31,286 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 16:21:31,287 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 16:21:31,291 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 16:21:31,291 INFO L85 PathProgramCache]: Analyzing trace with hash 96256690, now seen corresponding path program 1 times [2022-04-27 16:21:31,298 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 16:21:31,298 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1793011721] [2022-04-27 16:21:31,299 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 16:21:31,299 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 16:21:31,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 16:21:31,411 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 16:21:31,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 16:21:31,425 INFO L290 TraceCheckUtils]: 0: Hoare triple {29#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [63] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= (select |v_#length_1| 2) 9) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {24#true} is VALID [2022-04-27 16:21:31,426 INFO L290 TraceCheckUtils]: 1: Hoare triple {24#true} [66] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {24#true} is VALID [2022-04-27 16:21:31,426 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {24#true} {24#true} [83] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {24#true} is VALID [2022-04-27 16:21:31,428 INFO L272 TraceCheckUtils]: 0: Hoare triple {24#true} [61] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {29#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 16:21:31,428 INFO L290 TraceCheckUtils]: 1: Hoare triple {29#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [63] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= (select |v_#length_1| 2) 9) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {24#true} is VALID [2022-04-27 16:21:31,428 INFO L290 TraceCheckUtils]: 2: Hoare triple {24#true} [66] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {24#true} is VALID [2022-04-27 16:21:31,429 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {24#true} {24#true} [83] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {24#true} is VALID [2022-04-27 16:21:31,429 INFO L272 TraceCheckUtils]: 4: Hoare triple {24#true} [62] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {24#true} is VALID [2022-04-27 16:21:31,429 INFO L290 TraceCheckUtils]: 5: Hoare triple {24#true} [65] mainENTRY-->L28: Formula: (and (<= |v_main_#t~nondet1_2| 2147483647) (= v_main_~b~0_4 |v_main_#t~nondet2_2|) (= v_main_~a~0_5 |v_main_#t~nondet1_2|) (<= 0 (+ |v_main_#t~nondet2_2| 2147483648)) (<= |v_main_#t~nondet2_2| 2147483647) (<= 0 (+ |v_main_#t~nondet1_2| 2147483648))) InVars {main_#t~nondet1=|v_main_#t~nondet1_2|, main_#t~nondet2=|v_main_#t~nondet2_2|} OutVars{main_~res~0=v_main_~res~0_5, main_~cnt~0=v_main_~cnt~0_5, main_~b~0=v_main_~b~0_4, main_~a~0=v_main_~a~0_5} AuxVars[] AssignedVars[main_~res~0, main_~cnt~0, main_#t~nondet1, main_#t~nondet2, main_~b~0, main_~a~0] {24#true} is VALID [2022-04-27 16:21:31,429 INFO L290 TraceCheckUtils]: 6: Hoare triple {24#true} [68] L28-->L29: Formula: (<= v_main_~a~0_2 1000000) InVars {main_~a~0=v_main_~a~0_2} OutVars{main_~a~0=v_main_~a~0_2} AuxVars[] AssignedVars[] {24#true} is VALID [2022-04-27 16:21:31,430 INFO L290 TraceCheckUtils]: 7: Hoare triple {24#true} [71] L29-->L32-2: Formula: (and (<= v_main_~b~0_3 1000000) (= v_main_~b~0_3 v_main_~cnt~0_3) (<= 0 v_main_~b~0_3) (= v_main_~a~0_4 v_main_~res~0_4)) InVars {main_~b~0=v_main_~b~0_3, main_~a~0=v_main_~a~0_4} OutVars{main_~res~0=v_main_~res~0_4, main_~cnt~0=v_main_~cnt~0_3, main_~b~0=v_main_~b~0_3, main_~a~0=v_main_~a~0_4} AuxVars[] AssignedVars[main_~res~0, main_~cnt~0] {24#true} is VALID [2022-04-27 16:21:31,430 INFO L290 TraceCheckUtils]: 8: Hoare triple {24#true} [72] L32-2-->L32-3: Formula: false InVars {} OutVars{} AuxVars[] AssignedVars[] {25#false} is VALID [2022-04-27 16:21:31,431 INFO L272 TraceCheckUtils]: 9: Hoare triple {25#false} [75] L32-3-->__VERIFIER_assertENTRY: Formula: (= (ite (= (+ v_main_~a~0_6 v_main_~b~0_5) v_main_~res~0_6) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~res~0=v_main_~res~0_6, main_~b~0=v_main_~b~0_5, main_~a~0=v_main_~a~0_6} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_~res~0, __VERIFIER_assert_#in~cond, main_~b~0, main_~a~0] {25#false} is VALID [2022-04-27 16:21:31,431 INFO L290 TraceCheckUtils]: 10: Hoare triple {25#false} [77] __VERIFIER_assertENTRY-->L18: 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] {25#false} is VALID [2022-04-27 16:21:31,431 INFO L290 TraceCheckUtils]: 11: Hoare triple {25#false} [78] L18-->L19: 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[] {25#false} is VALID [2022-04-27 16:21:31,431 INFO L290 TraceCheckUtils]: 12: Hoare triple {25#false} [80] L19-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {25#false} is VALID [2022-04-27 16:21:31,432 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 16:21:31,432 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 16:21:31,432 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1793011721] [2022-04-27 16:21:31,433 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1793011721] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 16:21:31,433 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 16:21:31,433 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-27 16:21:31,435 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [829176063] [2022-04-27 16:21:31,435 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 16:21:31,440 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.0) internal successors, (9), 2 states have internal predecessors, (9), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 13 [2022-04-27 16:21:31,441 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 16:21:31,444 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 3.0) internal successors, (9), 2 states have internal predecessors, (9), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 16:21:31,459 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 13 edges. 13 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 16:21:31,460 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-27 16:21:31,460 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 16:21:31,481 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-27 16:21:31,482 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-27 16:21:31,485 INFO L87 Difference]: Start difference. First operand has 21 states, 13 states have (on average 1.4615384615384615) internal successors, (19), 14 states have internal predecessors, (19), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 2 states have internal predecessors, (9), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 16:21:31,554 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 16:21:31,555 INFO L93 Difference]: Finished difference Result 21 states and 23 transitions. [2022-04-27 16:21:31,555 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-27 16:21:31,556 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.0) internal successors, (9), 2 states have internal predecessors, (9), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 13 [2022-04-27 16:21:31,556 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 16:21:31,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 2 states have internal predecessors, (9), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 16:21:31,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 25 transitions. [2022-04-27 16:21:31,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 2 states have internal predecessors, (9), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 16:21:31,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 25 transitions. [2022-04-27 16:21:31,574 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 25 transitions. [2022-04-27 16:21:31,639 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 25 edges. 25 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 16:21:31,645 INFO L225 Difference]: With dead ends: 21 [2022-04-27 16:21:31,645 INFO L226 Difference]: Without dead ends: 14 [2022-04-27 16:21:31,659 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-27 16:21:31,670 INFO L413 NwaCegarLoop]: 22 mSDtfsCounter, 14 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 25 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 16:21:31,671 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 25 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 16:21:31,683 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2022-04-27 16:21:31,690 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2022-04-27 16:21:31,690 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 16:21:31,691 INFO L82 GeneralOperation]: Start isEquivalent. First operand 14 states. Second operand has 14 states, 9 states have (on average 1.1111111111111112) internal successors, (10), 9 states have internal predecessors, (10), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 16:21:31,691 INFO L74 IsIncluded]: Start isIncluded. First operand 14 states. Second operand has 14 states, 9 states have (on average 1.1111111111111112) internal successors, (10), 9 states have internal predecessors, (10), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 16:21:31,691 INFO L87 Difference]: Start difference. First operand 14 states. Second operand has 14 states, 9 states have (on average 1.1111111111111112) internal successors, (10), 9 states have internal predecessors, (10), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 16:21:31,694 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 16:21:31,694 INFO L93 Difference]: Finished difference Result 14 states and 14 transitions. [2022-04-27 16:21:31,694 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 14 transitions. [2022-04-27 16:21:31,694 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 16:21:31,694 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 16:21:31,695 INFO L74 IsIncluded]: Start isIncluded. First operand has 14 states, 9 states have (on average 1.1111111111111112) internal successors, (10), 9 states have internal predecessors, (10), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 14 states. [2022-04-27 16:21:31,695 INFO L87 Difference]: Start difference. First operand has 14 states, 9 states have (on average 1.1111111111111112) internal successors, (10), 9 states have internal predecessors, (10), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 14 states. [2022-04-27 16:21:31,697 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 16:21:31,697 INFO L93 Difference]: Finished difference Result 14 states and 14 transitions. [2022-04-27 16:21:31,697 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 14 transitions. [2022-04-27 16:21:31,698 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 16:21:31,698 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 16:21:31,698 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 16:21:31,698 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 16:21:31,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 9 states have (on average 1.1111111111111112) internal successors, (10), 9 states have internal predecessors, (10), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 16:21:31,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 14 transitions. [2022-04-27 16:21:31,700 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 14 transitions. Word has length 13 [2022-04-27 16:21:31,701 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 16:21:31,701 INFO L495 AbstractCegarLoop]: Abstraction has 14 states and 14 transitions. [2022-04-27 16:21:31,701 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.0) internal successors, (9), 2 states have internal predecessors, (9), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 16:21:31,701 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 14 transitions. [2022-04-27 16:21:31,702 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-04-27 16:21:31,702 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 16:21:31,702 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 16:21:31,702 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-27 16:21:31,702 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 16:21:31,703 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 16:21:31,703 INFO L85 PathProgramCache]: Analyzing trace with hash 97180211, now seen corresponding path program 1 times [2022-04-27 16:21:31,703 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 16:21:31,703 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1942753753] [2022-04-27 16:21:31,704 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 16:21:31,704 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 16:21:31,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 16:21:31,813 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 16:21:31,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 16:21:31,837 INFO L290 TraceCheckUtils]: 0: Hoare triple {104#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [63] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= (select |v_#length_1| 2) 9) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {95#true} is VALID [2022-04-27 16:21:31,838 INFO L290 TraceCheckUtils]: 1: Hoare triple {95#true} [66] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {95#true} is VALID [2022-04-27 16:21:31,838 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {95#true} {95#true} [83] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {95#true} is VALID [2022-04-27 16:21:31,840 INFO L272 TraceCheckUtils]: 0: Hoare triple {95#true} [61] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {104#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 16:21:31,840 INFO L290 TraceCheckUtils]: 1: Hoare triple {104#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [63] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= (select |v_#length_1| 2) 9) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {95#true} is VALID [2022-04-27 16:21:31,840 INFO L290 TraceCheckUtils]: 2: Hoare triple {95#true} [66] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {95#true} is VALID [2022-04-27 16:21:31,840 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {95#true} {95#true} [83] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {95#true} is VALID [2022-04-27 16:21:31,840 INFO L272 TraceCheckUtils]: 4: Hoare triple {95#true} [62] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {95#true} is VALID [2022-04-27 16:21:31,841 INFO L290 TraceCheckUtils]: 5: Hoare triple {95#true} [65] mainENTRY-->L28: Formula: (and (<= |v_main_#t~nondet1_2| 2147483647) (= v_main_~b~0_4 |v_main_#t~nondet2_2|) (= v_main_~a~0_5 |v_main_#t~nondet1_2|) (<= 0 (+ |v_main_#t~nondet2_2| 2147483648)) (<= |v_main_#t~nondet2_2| 2147483647) (<= 0 (+ |v_main_#t~nondet1_2| 2147483648))) InVars {main_#t~nondet1=|v_main_#t~nondet1_2|, main_#t~nondet2=|v_main_#t~nondet2_2|} OutVars{main_~res~0=v_main_~res~0_5, main_~cnt~0=v_main_~cnt~0_5, main_~b~0=v_main_~b~0_4, main_~a~0=v_main_~a~0_5} AuxVars[] AssignedVars[main_~res~0, main_~cnt~0, main_#t~nondet1, main_#t~nondet2, main_~b~0, main_~a~0] {95#true} is VALID [2022-04-27 16:21:31,841 INFO L290 TraceCheckUtils]: 6: Hoare triple {95#true} [68] L28-->L29: Formula: (<= v_main_~a~0_2 1000000) InVars {main_~a~0=v_main_~a~0_2} OutVars{main_~a~0=v_main_~a~0_2} AuxVars[] AssignedVars[] {95#true} is VALID [2022-04-27 16:21:31,842 INFO L290 TraceCheckUtils]: 7: Hoare triple {95#true} [71] L29-->L32-2: Formula: (and (<= v_main_~b~0_3 1000000) (= v_main_~b~0_3 v_main_~cnt~0_3) (<= 0 v_main_~b~0_3) (= v_main_~a~0_4 v_main_~res~0_4)) InVars {main_~b~0=v_main_~b~0_3, main_~a~0=v_main_~a~0_4} OutVars{main_~res~0=v_main_~res~0_4, main_~cnt~0=v_main_~cnt~0_3, main_~b~0=v_main_~b~0_3, main_~a~0=v_main_~a~0_4} AuxVars[] AssignedVars[main_~res~0, main_~cnt~0] {100#(and (< main_~res~0 (+ main_~b~0 main_~a~0 1)) (or (<= (+ main_~b~0 main_~a~0) main_~res~0) (<= (+ main_~b~0 main_~a~0) (+ main_~cnt~0 main_~res~0))))} is VALID [2022-04-27 16:21:31,843 INFO L290 TraceCheckUtils]: 8: Hoare triple {100#(and (< main_~res~0 (+ main_~b~0 main_~a~0 1)) (or (<= (+ main_~b~0 main_~a~0) main_~res~0) (<= (+ main_~b~0 main_~a~0) (+ main_~cnt~0 main_~res~0))))} [73] L32-2-->L32-3: Formula: (not (< 0 v_main_~cnt~0_4)) InVars {main_~cnt~0=v_main_~cnt~0_4} OutVars{main_~cnt~0=v_main_~cnt~0_4} AuxVars[] AssignedVars[] {101#(and (< main_~res~0 (+ main_~b~0 main_~a~0 1)) (<= (+ main_~b~0 main_~a~0) main_~res~0))} is VALID [2022-04-27 16:21:31,846 INFO L272 TraceCheckUtils]: 9: Hoare triple {101#(and (< main_~res~0 (+ main_~b~0 main_~a~0 1)) (<= (+ main_~b~0 main_~a~0) main_~res~0))} [75] L32-3-->__VERIFIER_assertENTRY: Formula: (= (ite (= (+ v_main_~a~0_6 v_main_~b~0_5) v_main_~res~0_6) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~res~0=v_main_~res~0_6, main_~b~0=v_main_~b~0_5, main_~a~0=v_main_~a~0_6} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_~res~0, __VERIFIER_assert_#in~cond, main_~b~0, main_~a~0] {102#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 16:21:31,846 INFO L290 TraceCheckUtils]: 10: Hoare triple {102#(not (= |__VERIFIER_assert_#in~cond| 0))} [77] __VERIFIER_assertENTRY-->L18: 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] {103#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-27 16:21:31,847 INFO L290 TraceCheckUtils]: 11: Hoare triple {103#(not (= __VERIFIER_assert_~cond 0))} [78] L18-->L19: 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[] {96#false} is VALID [2022-04-27 16:21:31,847 INFO L290 TraceCheckUtils]: 12: Hoare triple {96#false} [80] L19-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {96#false} is VALID [2022-04-27 16:21:31,847 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 16:21:31,848 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 16:21:31,848 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1942753753] [2022-04-27 16:21:31,848 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1942753753] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 16:21:31,848 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 16:21:31,848 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-27 16:21:31,848 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [161667916] [2022-04-27 16:21:31,848 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 16:21:31,850 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 1.5) internal successors, (9), 5 states have internal predecessors, (9), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 13 [2022-04-27 16:21:31,850 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 16:21:31,850 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 7 states, 6 states have (on average 1.5) internal successors, (9), 5 states have internal predecessors, (9), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 16:21:31,865 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 13 edges. 13 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 16:21:31,865 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-27 16:21:31,865 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 16:21:31,866 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-27 16:21:31,869 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-04-27 16:21:31,869 INFO L87 Difference]: Start difference. First operand 14 states and 14 transitions. Second operand has 7 states, 6 states have (on average 1.5) internal successors, (9), 5 states have internal predecessors, (9), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 16:21:32,053 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 16:21:32,053 INFO L93 Difference]: Finished difference Result 18 states and 18 transitions. [2022-04-27 16:21:32,053 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-27 16:21:32,053 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 1.5) internal successors, (9), 5 states have internal predecessors, (9), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 13 [2022-04-27 16:21:32,054 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 16:21:32,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 6 states have (on average 1.5) internal successors, (9), 5 states have internal predecessors, (9), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 16:21:32,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 19 transitions. [2022-04-27 16:21:32,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 6 states have (on average 1.5) internal successors, (9), 5 states have internal predecessors, (9), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 16:21:32,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 19 transitions. [2022-04-27 16:21:32,060 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 19 transitions. [2022-04-27 16:21:32,077 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 19 edges. 19 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 16:21:32,079 INFO L225 Difference]: With dead ends: 18 [2022-04-27 16:21:32,079 INFO L226 Difference]: Without dead ends: 15 [2022-04-27 16:21:32,081 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2022-04-27 16:21:32,083 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 12 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 33 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-27 16:21:32,084 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 33 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-27 16:21:32,087 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2022-04-27 16:21:32,089 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2022-04-27 16:21:32,089 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 16:21:32,090 INFO L82 GeneralOperation]: Start isEquivalent. First operand 15 states. Second operand has 15 states, 10 states have (on average 1.1) internal successors, (11), 10 states have internal predecessors, (11), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 16:21:32,090 INFO L74 IsIncluded]: Start isIncluded. First operand 15 states. Second operand has 15 states, 10 states have (on average 1.1) internal successors, (11), 10 states have internal predecessors, (11), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 16:21:32,091 INFO L87 Difference]: Start difference. First operand 15 states. Second operand has 15 states, 10 states have (on average 1.1) internal successors, (11), 10 states have internal predecessors, (11), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 16:21:32,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 16:21:32,097 INFO L93 Difference]: Finished difference Result 15 states and 15 transitions. [2022-04-27 16:21:32,097 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions. [2022-04-27 16:21:32,097 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 16:21:32,097 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 16:21:32,098 INFO L74 IsIncluded]: Start isIncluded. First operand has 15 states, 10 states have (on average 1.1) internal successors, (11), 10 states have internal predecessors, (11), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 15 states. [2022-04-27 16:21:32,098 INFO L87 Difference]: Start difference. First operand has 15 states, 10 states have (on average 1.1) internal successors, (11), 10 states have internal predecessors, (11), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 15 states. [2022-04-27 16:21:32,100 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 16:21:32,101 INFO L93 Difference]: Finished difference Result 15 states and 15 transitions. [2022-04-27 16:21:32,101 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions. [2022-04-27 16:21:32,102 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 16:21:32,102 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 16:21:32,102 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 16:21:32,102 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 16:21:32,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 10 states have (on average 1.1) internal successors, (11), 10 states have internal predecessors, (11), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 16:21:32,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 15 transitions. [2022-04-27 16:21:32,105 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 15 transitions. Word has length 13 [2022-04-27 16:21:32,105 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 16:21:32,105 INFO L495 AbstractCegarLoop]: Abstraction has 15 states and 15 transitions. [2022-04-27 16:21:32,105 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 1.5) internal successors, (9), 5 states have internal predecessors, (9), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 16:21:32,106 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions. [2022-04-27 16:21:32,106 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-04-27 16:21:32,106 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 16:21:32,106 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 16:21:32,106 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-27 16:21:32,107 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 16:21:32,107 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 16:21:32,108 INFO L85 PathProgramCache]: Analyzing trace with hash -1255659171, now seen corresponding path program 1 times [2022-04-27 16:21:32,108 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 16:21:32,108 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [347097978] [2022-04-27 16:21:32,108 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 16:21:32,108 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 16:21:32,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 16:21:32,303 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 16:21:32,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 16:21:32,311 INFO L290 TraceCheckUtils]: 0: Hoare triple {188#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [63] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= (select |v_#length_1| 2) 9) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {178#true} is VALID [2022-04-27 16:21:32,312 INFO L290 TraceCheckUtils]: 1: Hoare triple {178#true} [66] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {178#true} is VALID [2022-04-27 16:21:32,312 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {178#true} {178#true} [83] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {178#true} is VALID [2022-04-27 16:21:32,313 INFO L272 TraceCheckUtils]: 0: Hoare triple {178#true} [61] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {188#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 16:21:32,313 INFO L290 TraceCheckUtils]: 1: Hoare triple {188#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [63] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= (select |v_#length_1| 2) 9) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {178#true} is VALID [2022-04-27 16:21:32,313 INFO L290 TraceCheckUtils]: 2: Hoare triple {178#true} [66] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {178#true} is VALID [2022-04-27 16:21:32,313 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {178#true} {178#true} [83] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {178#true} is VALID [2022-04-27 16:21:32,314 INFO L272 TraceCheckUtils]: 4: Hoare triple {178#true} [62] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {178#true} is VALID [2022-04-27 16:21:32,314 INFO L290 TraceCheckUtils]: 5: Hoare triple {178#true} [65] mainENTRY-->L28: Formula: (and (<= |v_main_#t~nondet1_2| 2147483647) (= v_main_~b~0_4 |v_main_#t~nondet2_2|) (= v_main_~a~0_5 |v_main_#t~nondet1_2|) (<= 0 (+ |v_main_#t~nondet2_2| 2147483648)) (<= |v_main_#t~nondet2_2| 2147483647) (<= 0 (+ |v_main_#t~nondet1_2| 2147483648))) InVars {main_#t~nondet1=|v_main_#t~nondet1_2|, main_#t~nondet2=|v_main_#t~nondet2_2|} OutVars{main_~res~0=v_main_~res~0_5, main_~cnt~0=v_main_~cnt~0_5, main_~b~0=v_main_~b~0_4, main_~a~0=v_main_~a~0_5} AuxVars[] AssignedVars[main_~res~0, main_~cnt~0, main_#t~nondet1, main_#t~nondet2, main_~b~0, main_~a~0] {178#true} is VALID [2022-04-27 16:21:32,314 INFO L290 TraceCheckUtils]: 6: Hoare triple {178#true} [68] L28-->L29: Formula: (<= v_main_~a~0_2 1000000) InVars {main_~a~0=v_main_~a~0_2} OutVars{main_~a~0=v_main_~a~0_2} AuxVars[] AssignedVars[] {178#true} is VALID [2022-04-27 16:21:32,315 INFO L290 TraceCheckUtils]: 7: Hoare triple {178#true} [71] L29-->L32-2: Formula: (and (<= v_main_~b~0_3 1000000) (= v_main_~b~0_3 v_main_~cnt~0_3) (<= 0 v_main_~b~0_3) (= v_main_~a~0_4 v_main_~res~0_4)) InVars {main_~b~0=v_main_~b~0_3, main_~a~0=v_main_~a~0_4} OutVars{main_~res~0=v_main_~res~0_4, main_~cnt~0=v_main_~cnt~0_3, main_~b~0=v_main_~b~0_3, main_~a~0=v_main_~a~0_4} AuxVars[] AssignedVars[main_~res~0, main_~cnt~0] {183#(and (<= main_~res~0 (+ main_~b~0 main_~a~0)) (<= (+ main_~b~0 main_~a~0) (+ main_~cnt~0 main_~res~0)) (<= (+ main_~cnt~0 main_~res~0) (+ main_~b~0 main_~a~0)))} is VALID [2022-04-27 16:21:32,323 INFO L290 TraceCheckUtils]: 8: Hoare triple {183#(and (<= main_~res~0 (+ main_~b~0 main_~a~0)) (<= (+ main_~b~0 main_~a~0) (+ main_~cnt~0 main_~res~0)) (<= (+ main_~cnt~0 main_~res~0) (+ main_~b~0 main_~a~0)))} [74] L32-2-->L32-2: Formula: (or (and (< v_main_~res~0_2 v_main_~res~0_1) (= (+ v_main_~cnt~0_1 v_main_~res~0_1) (+ v_main_~cnt~0_2 v_main_~res~0_2)) (< v_main_~res~0_1 (+ v_main_~cnt~0_2 v_main_~res~0_2 1))) (and (<= v_main_~cnt~0_2 0) (= v_main_~res~0_2 v_main_~res~0_1) (= v_main_~cnt~0_2 v_main_~cnt~0_1))) InVars {main_~res~0=v_main_~res~0_2, main_~cnt~0=v_main_~cnt~0_2} OutVars{main_~res~0=v_main_~res~0_1, main_~cnt~0=v_main_~cnt~0_1} AuxVars[] AssignedVars[main_~res~0, main_~cnt~0] {184#(and (< main_~res~0 (+ main_~b~0 main_~a~0 1)) (or (<= (+ main_~b~0 main_~a~0) main_~res~0) (<= (+ main_~b~0 main_~a~0) (+ main_~cnt~0 main_~res~0))))} is VALID [2022-04-27 16:21:32,324 INFO L290 TraceCheckUtils]: 9: Hoare triple {184#(and (< main_~res~0 (+ main_~b~0 main_~a~0 1)) (or (<= (+ main_~b~0 main_~a~0) main_~res~0) (<= (+ main_~b~0 main_~a~0) (+ main_~cnt~0 main_~res~0))))} [73] L32-2-->L32-3: Formula: (not (< 0 v_main_~cnt~0_4)) InVars {main_~cnt~0=v_main_~cnt~0_4} OutVars{main_~cnt~0=v_main_~cnt~0_4} AuxVars[] AssignedVars[] {185#(and (< main_~res~0 (+ main_~b~0 main_~a~0 1)) (<= (+ main_~b~0 main_~a~0) main_~res~0))} is VALID [2022-04-27 16:21:32,325 INFO L272 TraceCheckUtils]: 10: Hoare triple {185#(and (< main_~res~0 (+ main_~b~0 main_~a~0 1)) (<= (+ main_~b~0 main_~a~0) main_~res~0))} [75] L32-3-->__VERIFIER_assertENTRY: Formula: (= (ite (= (+ v_main_~a~0_6 v_main_~b~0_5) v_main_~res~0_6) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~res~0=v_main_~res~0_6, main_~b~0=v_main_~b~0_5, main_~a~0=v_main_~a~0_6} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_~res~0, __VERIFIER_assert_#in~cond, main_~b~0, main_~a~0] {186#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 16:21:32,326 INFO L290 TraceCheckUtils]: 11: Hoare triple {186#(not (= |__VERIFIER_assert_#in~cond| 0))} [77] __VERIFIER_assertENTRY-->L18: 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] {187#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-27 16:21:32,326 INFO L290 TraceCheckUtils]: 12: Hoare triple {187#(not (= __VERIFIER_assert_~cond 0))} [78] L18-->L19: 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[] {179#false} is VALID [2022-04-27 16:21:32,327 INFO L290 TraceCheckUtils]: 13: Hoare triple {179#false} [80] L19-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {179#false} is VALID [2022-04-27 16:21:32,327 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 16:21:32,327 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 16:21:32,327 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [347097978] [2022-04-27 16:21:32,327 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [347097978] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 16:21:32,328 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2089905193] [2022-04-27 16:21:32,328 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 16:21:32,328 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 16:21:32,328 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 16:21:32,330 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-27 16:21:32,334 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-27 16:21:32,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 16:21:32,375 INFO L263 TraceCheckSpWp]: Trace formula consists of 61 conjuncts, 10 conjunts are in the unsatisfiable core [2022-04-27 16:21:32,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 16:21:32,413 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 16:21:33,088 INFO L272 TraceCheckUtils]: 0: Hoare triple {178#true} [61] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {178#true} is VALID [2022-04-27 16:21:33,088 INFO L290 TraceCheckUtils]: 1: Hoare triple {178#true} [63] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= (select |v_#length_1| 2) 9) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {178#true} is VALID [2022-04-27 16:21:33,089 INFO L290 TraceCheckUtils]: 2: Hoare triple {178#true} [66] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {178#true} is VALID [2022-04-27 16:21:33,089 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {178#true} {178#true} [83] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {178#true} is VALID [2022-04-27 16:21:33,089 INFO L272 TraceCheckUtils]: 4: Hoare triple {178#true} [62] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {178#true} is VALID [2022-04-27 16:21:33,089 INFO L290 TraceCheckUtils]: 5: Hoare triple {178#true} [65] mainENTRY-->L28: Formula: (and (<= |v_main_#t~nondet1_2| 2147483647) (= v_main_~b~0_4 |v_main_#t~nondet2_2|) (= v_main_~a~0_5 |v_main_#t~nondet1_2|) (<= 0 (+ |v_main_#t~nondet2_2| 2147483648)) (<= |v_main_#t~nondet2_2| 2147483647) (<= 0 (+ |v_main_#t~nondet1_2| 2147483648))) InVars {main_#t~nondet1=|v_main_#t~nondet1_2|, main_#t~nondet2=|v_main_#t~nondet2_2|} OutVars{main_~res~0=v_main_~res~0_5, main_~cnt~0=v_main_~cnt~0_5, main_~b~0=v_main_~b~0_4, main_~a~0=v_main_~a~0_5} AuxVars[] AssignedVars[main_~res~0, main_~cnt~0, main_#t~nondet1, main_#t~nondet2, main_~b~0, main_~a~0] {178#true} is VALID [2022-04-27 16:21:33,089 INFO L290 TraceCheckUtils]: 6: Hoare triple {178#true} [68] L28-->L29: Formula: (<= v_main_~a~0_2 1000000) InVars {main_~a~0=v_main_~a~0_2} OutVars{main_~a~0=v_main_~a~0_2} AuxVars[] AssignedVars[] {178#true} is VALID [2022-04-27 16:21:33,096 INFO L290 TraceCheckUtils]: 7: Hoare triple {178#true} [71] L29-->L32-2: Formula: (and (<= v_main_~b~0_3 1000000) (= v_main_~b~0_3 v_main_~cnt~0_3) (<= 0 v_main_~b~0_3) (= v_main_~a~0_4 v_main_~res~0_4)) InVars {main_~b~0=v_main_~b~0_3, main_~a~0=v_main_~a~0_4} OutVars{main_~res~0=v_main_~res~0_4, main_~cnt~0=v_main_~cnt~0_3, main_~b~0=v_main_~b~0_3, main_~a~0=v_main_~a~0_4} AuxVars[] AssignedVars[main_~res~0, main_~cnt~0] {213#(and (= main_~cnt~0 main_~b~0) (<= 0 main_~b~0) (= main_~res~0 main_~a~0))} is VALID [2022-04-27 16:21:33,097 INFO L290 TraceCheckUtils]: 8: Hoare triple {213#(and (= main_~cnt~0 main_~b~0) (<= 0 main_~b~0) (= main_~res~0 main_~a~0))} [74] L32-2-->L32-2: Formula: (or (and (< v_main_~res~0_2 v_main_~res~0_1) (= (+ v_main_~cnt~0_1 v_main_~res~0_1) (+ v_main_~cnt~0_2 v_main_~res~0_2)) (< v_main_~res~0_1 (+ v_main_~cnt~0_2 v_main_~res~0_2 1))) (and (<= v_main_~cnt~0_2 0) (= v_main_~res~0_2 v_main_~res~0_1) (= v_main_~cnt~0_2 v_main_~cnt~0_1))) InVars {main_~res~0=v_main_~res~0_2, main_~cnt~0=v_main_~cnt~0_2} OutVars{main_~res~0=v_main_~res~0_1, main_~cnt~0=v_main_~cnt~0_1} AuxVars[] AssignedVars[main_~res~0, main_~cnt~0] {217#(and (or (and (< main_~res~0 (+ main_~b~0 main_~a~0 1)) (= (+ main_~cnt~0 main_~res~0) (+ main_~b~0 main_~a~0)) (< main_~a~0 main_~res~0)) (and (= main_~cnt~0 main_~b~0) (<= main_~b~0 0) (= main_~res~0 main_~a~0))) (<= 0 main_~b~0))} is VALID [2022-04-27 16:21:33,099 INFO L290 TraceCheckUtils]: 9: Hoare triple {217#(and (or (and (< main_~res~0 (+ main_~b~0 main_~a~0 1)) (= (+ main_~cnt~0 main_~res~0) (+ main_~b~0 main_~a~0)) (< main_~a~0 main_~res~0)) (and (= main_~cnt~0 main_~b~0) (<= main_~b~0 0) (= main_~res~0 main_~a~0))) (<= 0 main_~b~0))} [73] L32-2-->L32-3: Formula: (not (< 0 v_main_~cnt~0_4)) InVars {main_~cnt~0=v_main_~cnt~0_4} OutVars{main_~cnt~0=v_main_~cnt~0_4} AuxVars[] AssignedVars[] {221#(and (< main_~res~0 (+ main_~b~0 main_~a~0 1)) (<= 0 main_~b~0) (not (< main_~res~0 (+ main_~b~0 main_~a~0))))} is VALID [2022-04-27 16:21:33,101 INFO L272 TraceCheckUtils]: 10: Hoare triple {221#(and (< main_~res~0 (+ main_~b~0 main_~a~0 1)) (<= 0 main_~b~0) (not (< main_~res~0 (+ main_~b~0 main_~a~0))))} [75] L32-3-->__VERIFIER_assertENTRY: Formula: (= (ite (= (+ v_main_~a~0_6 v_main_~b~0_5) v_main_~res~0_6) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~res~0=v_main_~res~0_6, main_~b~0=v_main_~b~0_5, main_~a~0=v_main_~a~0_6} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_~res~0, __VERIFIER_assert_#in~cond, main_~b~0, main_~a~0] {225#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 16:21:33,101 INFO L290 TraceCheckUtils]: 11: Hoare triple {225#(<= 1 |__VERIFIER_assert_#in~cond|)} [77] __VERIFIER_assertENTRY-->L18: 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] {229#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 16:21:33,102 INFO L290 TraceCheckUtils]: 12: Hoare triple {229#(<= 1 __VERIFIER_assert_~cond)} [78] L18-->L19: 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[] {179#false} is VALID [2022-04-27 16:21:33,102 INFO L290 TraceCheckUtils]: 13: Hoare triple {179#false} [80] L19-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {179#false} is VALID [2022-04-27 16:21:33,102 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 16:21:33,102 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 16:21:33,480 INFO L290 TraceCheckUtils]: 13: Hoare triple {179#false} [80] L19-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {179#false} is VALID [2022-04-27 16:21:33,481 INFO L290 TraceCheckUtils]: 12: Hoare triple {229#(<= 1 __VERIFIER_assert_~cond)} [78] L18-->L19: 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[] {179#false} is VALID [2022-04-27 16:21:33,481 INFO L290 TraceCheckUtils]: 11: Hoare triple {225#(<= 1 |__VERIFIER_assert_#in~cond|)} [77] __VERIFIER_assertENTRY-->L18: 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] {229#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 16:21:33,482 INFO L272 TraceCheckUtils]: 10: Hoare triple {185#(and (< main_~res~0 (+ main_~b~0 main_~a~0 1)) (<= (+ main_~b~0 main_~a~0) main_~res~0))} [75] L32-3-->__VERIFIER_assertENTRY: Formula: (= (ite (= (+ v_main_~a~0_6 v_main_~b~0_5) v_main_~res~0_6) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~res~0=v_main_~res~0_6, main_~b~0=v_main_~b~0_5, main_~a~0=v_main_~a~0_6} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_~res~0, __VERIFIER_assert_#in~cond, main_~b~0, main_~a~0] {225#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 16:21:33,483 INFO L290 TraceCheckUtils]: 9: Hoare triple {248#(or (and (< main_~res~0 (+ main_~b~0 main_~a~0 1)) (<= (+ main_~b~0 main_~a~0) main_~res~0)) (< 0 main_~cnt~0))} [73] L32-2-->L32-3: Formula: (not (< 0 v_main_~cnt~0_4)) InVars {main_~cnt~0=v_main_~cnt~0_4} OutVars{main_~cnt~0=v_main_~cnt~0_4} AuxVars[] AssignedVars[] {185#(and (< main_~res~0 (+ main_~b~0 main_~a~0 1)) (<= (+ main_~b~0 main_~a~0) main_~res~0))} is VALID [2022-04-27 16:21:33,484 INFO L290 TraceCheckUtils]: 8: Hoare triple {252#(and (or (<= (+ main_~b~0 main_~a~0) (+ main_~res~0 1)) (<= (+ main_~b~0 main_~a~0) (+ main_~cnt~0 main_~res~0))) (or (and (< main_~res~0 (+ main_~b~0 main_~a~0 1)) (<= (+ main_~b~0 main_~a~0) main_~res~0)) (not (<= main_~cnt~0 0))) (<= (+ main_~cnt~0 main_~res~0) (+ main_~b~0 main_~a~0)))} [74] L32-2-->L32-2: Formula: (or (and (< v_main_~res~0_2 v_main_~res~0_1) (= (+ v_main_~cnt~0_1 v_main_~res~0_1) (+ v_main_~cnt~0_2 v_main_~res~0_2)) (< v_main_~res~0_1 (+ v_main_~cnt~0_2 v_main_~res~0_2 1))) (and (<= v_main_~cnt~0_2 0) (= v_main_~res~0_2 v_main_~res~0_1) (= v_main_~cnt~0_2 v_main_~cnt~0_1))) InVars {main_~res~0=v_main_~res~0_2, main_~cnt~0=v_main_~cnt~0_2} OutVars{main_~res~0=v_main_~res~0_1, main_~cnt~0=v_main_~cnt~0_1} AuxVars[] AssignedVars[main_~res~0, main_~cnt~0] {248#(or (and (< main_~res~0 (+ main_~b~0 main_~a~0 1)) (<= (+ main_~b~0 main_~a~0) main_~res~0)) (< 0 main_~cnt~0))} is VALID [2022-04-27 16:21:33,485 INFO L290 TraceCheckUtils]: 7: Hoare triple {178#true} [71] L29-->L32-2: Formula: (and (<= v_main_~b~0_3 1000000) (= v_main_~b~0_3 v_main_~cnt~0_3) (<= 0 v_main_~b~0_3) (= v_main_~a~0_4 v_main_~res~0_4)) InVars {main_~b~0=v_main_~b~0_3, main_~a~0=v_main_~a~0_4} OutVars{main_~res~0=v_main_~res~0_4, main_~cnt~0=v_main_~cnt~0_3, main_~b~0=v_main_~b~0_3, main_~a~0=v_main_~a~0_4} AuxVars[] AssignedVars[main_~res~0, main_~cnt~0] {252#(and (or (<= (+ main_~b~0 main_~a~0) (+ main_~res~0 1)) (<= (+ main_~b~0 main_~a~0) (+ main_~cnt~0 main_~res~0))) (or (and (< main_~res~0 (+ main_~b~0 main_~a~0 1)) (<= (+ main_~b~0 main_~a~0) main_~res~0)) (not (<= main_~cnt~0 0))) (<= (+ main_~cnt~0 main_~res~0) (+ main_~b~0 main_~a~0)))} is VALID [2022-04-27 16:21:33,485 INFO L290 TraceCheckUtils]: 6: Hoare triple {178#true} [68] L28-->L29: Formula: (<= v_main_~a~0_2 1000000) InVars {main_~a~0=v_main_~a~0_2} OutVars{main_~a~0=v_main_~a~0_2} AuxVars[] AssignedVars[] {178#true} is VALID [2022-04-27 16:21:33,486 INFO L290 TraceCheckUtils]: 5: Hoare triple {178#true} [65] mainENTRY-->L28: Formula: (and (<= |v_main_#t~nondet1_2| 2147483647) (= v_main_~b~0_4 |v_main_#t~nondet2_2|) (= v_main_~a~0_5 |v_main_#t~nondet1_2|) (<= 0 (+ |v_main_#t~nondet2_2| 2147483648)) (<= |v_main_#t~nondet2_2| 2147483647) (<= 0 (+ |v_main_#t~nondet1_2| 2147483648))) InVars {main_#t~nondet1=|v_main_#t~nondet1_2|, main_#t~nondet2=|v_main_#t~nondet2_2|} OutVars{main_~res~0=v_main_~res~0_5, main_~cnt~0=v_main_~cnt~0_5, main_~b~0=v_main_~b~0_4, main_~a~0=v_main_~a~0_5} AuxVars[] AssignedVars[main_~res~0, main_~cnt~0, main_#t~nondet1, main_#t~nondet2, main_~b~0, main_~a~0] {178#true} is VALID [2022-04-27 16:21:33,486 INFO L272 TraceCheckUtils]: 4: Hoare triple {178#true} [62] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {178#true} is VALID [2022-04-27 16:21:33,486 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {178#true} {178#true} [83] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {178#true} is VALID [2022-04-27 16:21:33,486 INFO L290 TraceCheckUtils]: 2: Hoare triple {178#true} [66] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {178#true} is VALID [2022-04-27 16:21:33,486 INFO L290 TraceCheckUtils]: 1: Hoare triple {178#true} [63] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= (select |v_#length_1| 2) 9) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {178#true} is VALID [2022-04-27 16:21:33,487 INFO L272 TraceCheckUtils]: 0: Hoare triple {178#true} [61] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {178#true} is VALID [2022-04-27 16:21:33,487 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 16:21:33,487 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2089905193] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 16:21:33,487 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-27 16:21:33,487 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 15 [2022-04-27 16:21:33,488 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1173887890] [2022-04-27 16:21:33,488 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-27 16:21:33,488 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 13 states have (on average 1.4615384615384615) internal successors, (19), 12 states have internal predecessors, (19), 3 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 14 [2022-04-27 16:21:33,489 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 16:21:33,489 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 15 states, 13 states have (on average 1.4615384615384615) internal successors, (19), 12 states have internal predecessors, (19), 3 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 16:21:33,511 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 26 edges. 26 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 16:21:33,511 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-04-27 16:21:33,511 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 16:21:33,512 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-04-27 16:21:33,512 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=162, Unknown=0, NotChecked=0, Total=210 [2022-04-27 16:21:33,513 INFO L87 Difference]: Start difference. First operand 15 states and 15 transitions. Second operand has 15 states, 13 states have (on average 1.4615384615384615) internal successors, (19), 12 states have internal predecessors, (19), 3 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 16:21:33,747 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 16:21:33,747 INFO L93 Difference]: Finished difference Result 13 states and 13 transitions. [2022-04-27 16:21:33,747 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-27 16:21:33,747 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 13 states have (on average 1.4615384615384615) internal successors, (19), 12 states have internal predecessors, (19), 3 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 14 [2022-04-27 16:21:33,748 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 16:21:33,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 13 states have (on average 1.4615384615384615) internal successors, (19), 12 states have internal predecessors, (19), 3 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 16:21:33,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 14 transitions. [2022-04-27 16:21:33,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 13 states have (on average 1.4615384615384615) internal successors, (19), 12 states have internal predecessors, (19), 3 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 16:21:33,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 14 transitions. [2022-04-27 16:21:33,753 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 14 transitions. [2022-04-27 16:21:33,771 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 14 edges. 14 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 16:21:33,771 INFO L225 Difference]: With dead ends: 13 [2022-04-27 16:21:33,772 INFO L226 Difference]: Without dead ends: 0 [2022-04-27 16:21:33,772 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 21 SyntacticMatches, 2 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 81 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=88, Invalid=292, Unknown=0, NotChecked=0, Total=380 [2022-04-27 16:21:33,775 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 10 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 31 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-27 16:21:33,776 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 31 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-27 16:21:33,777 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-04-27 16:21:33,778 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-04-27 16:21:33,778 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 16:21:33,778 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-27 16:21:33,778 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-27 16:21:33,778 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-27 16:21:33,778 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 16:21:33,778 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-27 16:21:33,779 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-27 16:21:33,779 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 16:21:33,779 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 16:21:33,779 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-27 16:21:33,779 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-27 16:21:33,779 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 16:21:33,779 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-27 16:21:33,779 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-27 16:21:33,780 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 16:21:33,780 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 16:21:33,780 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 16:21:33,780 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 16:21:33,780 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-27 16:21:33,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-04-27 16:21:33,780 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 14 [2022-04-27 16:21:33,780 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 16:21:33,780 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-04-27 16:21:33,781 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 13 states have (on average 1.4615384615384615) internal successors, (19), 12 states have internal predecessors, (19), 3 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 16:21:33,782 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-27 16:21:33,782 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 16:21:33,784 INFO L805 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-04-27 16:21:33,812 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-27 16:21:34,003 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 16:21:34,006 INFO L356 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2022-04-27 16:21:34,007 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-04-27 16:21:34,010 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.04 04:21:34 BasicIcfg [2022-04-27 16:21:34,010 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-04-27 16:21:34,011 INFO L158 Benchmark]: Toolchain (without parser) took 3797.60ms. Allocated memory was 197.1MB in the beginning and 243.3MB in the end (delta: 46.1MB). Free memory was 149.1MB in the beginning and 182.3MB in the end (delta: -33.2MB). Peak memory consumption was 14.0MB. Max. memory is 8.0GB. [2022-04-27 16:21:34,011 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 197.1MB. Free memory is still 165.5MB. There was no memory consumed. Max. memory is 8.0GB. [2022-04-27 16:21:34,012 INFO L158 Benchmark]: CACSL2BoogieTranslator took 220.75ms. Allocated memory is still 197.1MB. Free memory was 148.8MB in the beginning and 175.7MB in the end (delta: -27.0MB). Peak memory consumption was 13.9MB. Max. memory is 8.0GB. [2022-04-27 16:21:34,012 INFO L158 Benchmark]: Boogie Preprocessor took 42.77ms. Allocated memory is still 197.1MB. Free memory was 175.7MB in the beginning and 174.3MB in the end (delta: 1.4MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-04-27 16:21:34,012 INFO L158 Benchmark]: RCFGBuilder took 244.36ms. Allocated memory is still 197.1MB. Free memory was 174.3MB in the beginning and 163.4MB in the end (delta: 10.9MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. [2022-04-27 16:21:34,012 INFO L158 Benchmark]: IcfgTransformer took 479.82ms. Allocated memory is still 197.1MB. Free memory was 163.4MB in the beginning and 147.4MB in the end (delta: 16.0MB). Peak memory consumption was 15.7MB. Max. memory is 8.0GB. [2022-04-27 16:21:34,013 INFO L158 Benchmark]: TraceAbstraction took 2804.63ms. Allocated memory was 197.1MB in the beginning and 243.3MB in the end (delta: 46.1MB). Free memory was 147.0MB in the beginning and 182.8MB in the end (delta: -35.7MB). Peak memory consumption was 11.6MB. Max. memory is 8.0GB. [2022-04-27 16:21:34,014 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from IcfgTransformer: - StatisticsResult: Jordan loop acceleration statistics 0 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult * Results from de.uni_freiburg.informatik.ultimate.core: - AssertionsEnabledResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.15ms. Allocated memory is still 197.1MB. Free memory is still 165.5MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 220.75ms. Allocated memory is still 197.1MB. Free memory was 148.8MB in the beginning and 175.7MB in the end (delta: -27.0MB). Peak memory consumption was 13.9MB. Max. memory is 8.0GB. * Boogie Preprocessor took 42.77ms. Allocated memory is still 197.1MB. Free memory was 175.7MB in the beginning and 174.3MB in the end (delta: 1.4MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 244.36ms. Allocated memory is still 197.1MB. Free memory was 174.3MB in the beginning and 163.4MB in the end (delta: 10.9MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. * IcfgTransformer took 479.82ms. Allocated memory is still 197.1MB. Free memory was 163.4MB in the beginning and 147.4MB in the end (delta: 16.0MB). Peak memory consumption was 15.7MB. Max. memory is 8.0GB. * TraceAbstraction took 2804.63ms. Allocated memory was 197.1MB in the beginning and 243.3MB in the end (delta: 46.1MB). Free memory was 147.0MB in the beginning and 182.8MB in the end (delta: -35.7MB). Peak memory consumption was 11.6MB. 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: 19]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 21 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 2.8s, OverallIterations: 3, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 37 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 36 mSDsluCounter, 89 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 47 mSDsCounter, 16 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 78 IncrementalHoareTripleChecker+Invalid, 94 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 16 mSolverCounterUnsat, 42 mSDtfsCounter, 78 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 57 GetRequests, 27 SyntacticMatches, 2 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 90 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=21occurred in iteration=0, 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.0s AutomataMinimizationTime, 3 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.5s InterpolantComputationTime, 54 NumberOfCodeBlocks, 54 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 63 ConstructedInterpolants, 0 QuantifiedInterpolants, 300 SizeOfPredicates, 2 NumberOfNonLiveVariables, 61 ConjunctsInSsa, 10 ConjunctsInUnsatCore, 5 InterpolantComputations, 2 PerfectInterpolantSequences, 0/3 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 RESULT: Ultimate proved your program to be correct! [2022-04-27 16:21:34,044 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...