/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-invgen/down.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-fb4f59a-m [2022-04-27 16:15:45,115 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-27 16:15:45,117 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-27 16:15:45,154 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-27 16:15:45,155 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-27 16:15:45,156 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-27 16:15:45,159 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-27 16:15:45,164 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-27 16:15:45,165 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-27 16:15:45,169 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-27 16:15:45,170 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-27 16:15:45,172 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-27 16:15:45,172 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-27 16:15:45,174 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-27 16:15:45,175 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-27 16:15:45,177 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-27 16:15:45,178 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-27 16:15:45,179 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-27 16:15:45,181 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-27 16:15:45,187 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-27 16:15:45,188 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-27 16:15:45,189 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-27 16:15:45,190 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-27 16:15:45,191 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-27 16:15:45,192 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-27 16:15:45,198 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-27 16:15:45,199 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-27 16:15:45,199 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-27 16:15:45,200 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-27 16:15:45,200 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-27 16:15:45,201 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-27 16:15:45,201 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-27 16:15:45,202 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-27 16:15:45,202 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-27 16:15:45,203 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-27 16:15:45,203 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-27 16:15:45,203 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-27 16:15:45,204 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-27 16:15:45,204 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-27 16:15:45,204 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-27 16:15:45,205 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-27 16:15:45,209 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-27 16:15:45,210 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/LoopAccelerationJordanC.epf [2022-04-27 16:15:45,224 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-27 16:15:45,224 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-27 16:15:45,225 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-27 16:15:45,225 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-27 16:15:45,225 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-27 16:15:45,226 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-27 16:15:45,226 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-27 16:15:45,226 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-27 16:15:45,226 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-27 16:15:45,227 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-27 16:15:45,227 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-27 16:15:45,227 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-27 16:15:45,227 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-27 16:15:45,227 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-27 16:15:45,227 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-27 16:15:45,228 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-27 16:15:45,228 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-27 16:15:45,228 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-27 16:15:45,228 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-27 16:15:45,228 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-27 16:15:45,228 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-04-27 16:15:45,229 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-04-27 16:15:45,229 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:15:45,491 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-27 16:15:45,516 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-27 16:15:45,518 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-27 16:15:45,519 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-27 16:15:45,520 INFO L275 PluginConnector]: CDTParser initialized [2022-04-27 16:15:45,521 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-invgen/down.i [2022-04-27 16:15:45,583 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cafc6208b/f14afbd1f1524c64a6ff87f19a7dabb8/FLAG16a999b80 [2022-04-27 16:15:45,994 INFO L306 CDTParser]: Found 1 translation units. [2022-04-27 16:15:45,995 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/down.i [2022-04-27 16:15:46,000 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cafc6208b/f14afbd1f1524c64a6ff87f19a7dabb8/FLAG16a999b80 [2022-04-27 16:15:46,397 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cafc6208b/f14afbd1f1524c64a6ff87f19a7dabb8 [2022-04-27 16:15:46,399 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-27 16:15:46,400 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-04-27 16:15:46,403 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-27 16:15:46,404 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-27 16:15:46,406 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-27 16:15:46,407 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.04 04:15:46" (1/1) ... [2022-04-27 16:15:46,408 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@56f402d5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 04:15:46, skipping insertion in model container [2022-04-27 16:15:46,408 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.04 04:15:46" (1/1) ... [2022-04-27 16:15:46,413 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-27 16:15:46,423 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-27 16:15:46,639 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-invgen/down.i[893,906] [2022-04-27 16:15:46,649 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-27 16:15:46,656 INFO L203 MainTranslator]: Completed pre-run [2022-04-27 16:15:46,668 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-invgen/down.i[893,906] [2022-04-27 16:15:46,675 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-27 16:15:46,687 INFO L208 MainTranslator]: Completed translation [2022-04-27 16:15:46,688 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 04:15:46 WrapperNode [2022-04-27 16:15:46,688 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-27 16:15:46,689 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-27 16:15:46,689 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-27 16:15:46,690 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-27 16:15:46,699 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 04:15:46" (1/1) ... [2022-04-27 16:15:46,699 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 04:15:46" (1/1) ... [2022-04-27 16:15:46,705 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 04:15:46" (1/1) ... [2022-04-27 16:15:46,705 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 04:15:46" (1/1) ... [2022-04-27 16:15:46,718 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 04:15:46" (1/1) ... [2022-04-27 16:15:46,725 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 04:15:46" (1/1) ... [2022-04-27 16:15:46,730 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 04:15:46" (1/1) ... [2022-04-27 16:15:46,734 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-27 16:15:46,736 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-27 16:15:46,736 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-27 16:15:46,736 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-27 16:15:46,737 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 04:15:46" (1/1) ... [2022-04-27 16:15:46,744 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-27 16:15:46,752 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 16:15:46,765 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:15:46,783 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:15:46,815 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-27 16:15:46,815 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-27 16:15:46,816 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-27 16:15:46,816 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-27 16:15:46,816 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-27 16:15:46,816 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-27 16:15:46,817 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-27 16:15:46,817 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-27 16:15:46,817 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_perror_fail [2022-04-27 16:15:46,817 INFO L130 BoogieDeclarations]: Found specification of procedure __assert [2022-04-27 16:15:46,817 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-27 16:15:46,817 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-27 16:15:46,817 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-27 16:15:46,818 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-27 16:15:46,818 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-04-27 16:15:46,819 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-27 16:15:46,819 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-27 16:15:46,819 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-27 16:15:46,819 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-27 16:15:46,819 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-27 16:15:46,819 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-27 16:15:46,819 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-27 16:15:46,897 INFO L234 CfgBuilder]: Building ICFG [2022-04-27 16:15:46,898 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-27 16:15:47,073 INFO L275 CfgBuilder]: Performing block encoding [2022-04-27 16:15:47,078 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-27 16:15:47,078 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-04-27 16:15:47,080 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.04 04:15:47 BoogieIcfgContainer [2022-04-27 16:15:47,080 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-27 16:15:47,081 INFO L113 PluginConnector]: ------------------------IcfgTransformer---------------------------- [2022-04-27 16:15:47,081 INFO L271 PluginConnector]: Initializing IcfgTransformer... [2022-04-27 16:15:47,082 INFO L275 PluginConnector]: IcfgTransformer initialized [2022-04-27 16:15:47,084 INFO L185 PluginConnector]: Executing the observer IcfgTransformationObserver from plugin IcfgTransformer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.04 04:15:47" (1/1) ... [2022-04-27 16:15:47,086 INFO L168 ansformationObserver]: Applying ICFG transformation LOOP_ACCELERATION_JORDAN [2022-04-27 16:15:51,443 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-27 16:15:51,577 INFO L89 elerationTransformer]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-27 16:15:51,578 INFO L91 elerationTransformer]: Accelerated Formula: (and (= v_main_~k~0_4 (+ v_main_~k~0_5 1)) (< v_main_~i~0_3 v_main_~n~0_2) (= v_main_~i~0_2 (+ v_main_~i~0_3 1))) InVars {main_~k~0=v_main_~k~0_5, main_~i~0=v_main_~i~0_3, main_~n~0=v_main_~n~0_2} OutVars{main_~k~0=v_main_~k~0_4, main_~i~0=v_main_~i~0_2, main_#t~post2=|v_main_#t~post2_1|, main_#t~post3=|v_main_#t~post3_1|, main_~n~0=v_main_~n~0_2} AuxVars[] AssignedVars[main_~k~0, main_~i~0, main_#t~post2, main_#t~post3] to Formula: (or (and (= |v_main_#t~post3_3| |v_main_#t~post3_1|) (not (< v_main_~i~0_3 v_main_~n~0_2)) (= |v_main_#t~post2_3| |v_main_#t~post2_1|) (= v_main_~k~0_5 v_main_~k~0_4) (= v_main_~i~0_3 v_main_~i~0_2)) (and (= (+ v_main_~i~0_3 v_main_~k~0_4) (+ v_main_~i~0_2 v_main_~k~0_5)) (< v_main_~i~0_3 v_main_~i~0_2) (< v_main_~i~0_2 (+ v_main_~n~0_2 1)))) InVars {main_~i~0=v_main_~i~0_3, main_#t~post2=|v_main_#t~post2_3|, main_~n~0=v_main_~n~0_2, main_#t~post3=|v_main_#t~post3_3|, main_~k~0=v_main_~k~0_5} OutVars{main_~i~0=v_main_~i~0_2, main_#t~post2=|v_main_#t~post2_1|, main_#t~post3=|v_main_#t~post3_1|, main_~n~0=v_main_~n~0_2, main_~k~0=v_main_~k~0_4} AuxVars[] AssignedVars[main_~k~0, main_~i~0, main_#t~post2, main_#t~post3] [2022-04-27 16:15:51,592 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 27.04 04:15:51 BasicIcfg [2022-04-27 16:15:51,592 INFO L132 PluginConnector]: ------------------------ END IcfgTransformer---------------------------- [2022-04-27 16:15:51,594 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-27 16:15:51,594 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-27 16:15:51,597 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-27 16:15:51,597 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.04 04:15:46" (1/4) ... [2022-04-27 16:15:51,598 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@371a2bb8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.04 04:15:51, skipping insertion in model container [2022-04-27 16:15:51,598 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 04:15:46" (2/4) ... [2022-04-27 16:15:51,599 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@371a2bb8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.04 04:15:51, skipping insertion in model container [2022-04-27 16:15:51,599 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.04 04:15:47" (3/4) ... [2022-04-27 16:15:51,601 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@371a2bb8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.04 04:15:51, skipping insertion in model container [2022-04-27 16:15:51,601 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 27.04 04:15:51" (4/4) ... [2022-04-27 16:15:51,604 INFO L111 eAbstractionObserver]: Analyzing ICFG down.iJordan [2022-04-27 16:15:51,615 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION [2022-04-27 16:15:51,615 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-27 16:15:51,650 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-27 16:15:51,656 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@c6269b4, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@30e7a5d0 [2022-04-27 16:15:51,657 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-27 16:15:51,666 INFO L276 IsEmpty]: Start isEmpty. Operand has 22 states, 14 states have (on average 1.4285714285714286) internal successors, (20), 15 states have internal predecessors, (20), 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:15:51,672 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-04-27 16:15:51,672 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 16:15:51,673 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 16:15:51,673 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 16:15:51,678 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 16:15:51,679 INFO L85 PathProgramCache]: Analyzing trace with hash -257583399, now seen corresponding path program 1 times [2022-04-27 16:15:51,686 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 16:15:51,688 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1078530411] [2022-04-27 16:15:51,688 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 16:15:51,689 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 16:15:51,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 16:15:51,809 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 16:15:51,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 16:15:51,823 INFO L290 TraceCheckUtils]: 0: Hoare triple {30#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [69] 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] {25#true} is VALID [2022-04-27 16:15:51,823 INFO L290 TraceCheckUtils]: 1: Hoare triple {25#true} [72] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {25#true} is VALID [2022-04-27 16:15:51,824 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {25#true} {25#true} [90] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {25#true} is VALID [2022-04-27 16:15:51,825 INFO L272 TraceCheckUtils]: 0: Hoare triple {25#true} [67] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {30#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 16:15:51,826 INFO L290 TraceCheckUtils]: 1: Hoare triple {30#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [69] 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] {25#true} is VALID [2022-04-27 16:15:51,826 INFO L290 TraceCheckUtils]: 2: Hoare triple {25#true} [72] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {25#true} is VALID [2022-04-27 16:15:51,826 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {25#true} {25#true} [90] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {25#true} is VALID [2022-04-27 16:15:51,827 INFO L272 TraceCheckUtils]: 4: Hoare triple {25#true} [68] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {25#true} is VALID [2022-04-27 16:15:51,829 INFO L290 TraceCheckUtils]: 5: Hoare triple {25#true} [71] mainENTRY-->L29-2: Formula: (and (= v_main_~k~0_6 0) (<= |v_main_#t~nondet1_2| 2147483647) (= v_main_~n~0_4 |v_main_#t~nondet1_2|) (<= 0 (+ |v_main_#t~nondet1_2| 2147483648)) (= v_main_~i~0_4 0)) InVars {main_#t~nondet1=|v_main_#t~nondet1_2|} OutVars{main_~i~0=v_main_~i~0_4, main_~n~0=v_main_~n~0_4, main_~k~0=v_main_~k~0_6} AuxVars[] AssignedVars[main_#t~nondet1, main_~k~0, main_~i~0, main_~n~0] {25#true} is VALID [2022-04-27 16:15:51,830 INFO L290 TraceCheckUtils]: 6: Hoare triple {25#true} [73] L29-2-->L29-3: Formula: false InVars {} OutVars{} AuxVars[] AssignedVars[] {26#false} is VALID [2022-04-27 16:15:51,831 INFO L290 TraceCheckUtils]: 7: Hoare triple {26#false} [76] L29-3-->L34-2: Formula: (= v_main_~j~0_5 v_main_~n~0_3) InVars {main_~n~0=v_main_~n~0_3} OutVars{main_~j~0=v_main_~j~0_5, main_~n~0=v_main_~n~0_3} AuxVars[] AssignedVars[main_~j~0] {26#false} is VALID [2022-04-27 16:15:51,831 INFO L290 TraceCheckUtils]: 8: Hoare triple {26#false} [79] L34-2-->L35: Formula: (< 0 v_main_~j~0_2) InVars {main_~j~0=v_main_~j~0_2} OutVars{main_~j~0=v_main_~j~0_2} AuxVars[] AssignedVars[] {26#false} is VALID [2022-04-27 16:15:51,831 INFO L272 TraceCheckUtils]: 9: Hoare triple {26#false} [81] L35-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (< 0 v_main_~k~0_7) 1 0)) InVars {main_~k~0=v_main_~k~0_7} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~k~0] {26#false} is VALID [2022-04-27 16:15:51,831 INFO L290 TraceCheckUtils]: 10: Hoare triple {26#false} [84] __VERIFIER_assertENTRY-->L18: Formula: (= v___VERIFIER_assert_~cond_1 |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_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {26#false} is VALID [2022-04-27 16:15:51,831 INFO L290 TraceCheckUtils]: 11: Hoare triple {26#false} [85] L18-->L19: Formula: (= v___VERIFIER_assert_~cond_2 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {26#false} is VALID [2022-04-27 16:15:51,832 INFO L290 TraceCheckUtils]: 12: Hoare triple {26#false} [87] L19-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {26#false} is VALID [2022-04-27 16:15:51,832 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:15:51,832 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 16:15:51,833 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1078530411] [2022-04-27 16:15:51,833 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1078530411] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 16:15:51,833 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 16:15:51,834 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-27 16:15:51,835 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1941146815] [2022-04-27 16:15:51,835 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 16:15:51,840 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:15:51,841 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 16:15:51,844 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:15:51,857 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:15:51,858 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-27 16:15:51,858 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 16:15:51,879 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-27 16:15:51,880 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-27 16:15:51,882 INFO L87 Difference]: Start difference. First operand has 22 states, 14 states have (on average 1.4285714285714286) internal successors, (20), 15 states have internal predecessors, (20), 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:15:51,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 16:15:51,967 INFO L93 Difference]: Finished difference Result 22 states and 23 transitions. [2022-04-27 16:15:51,967 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-27 16:15:51,967 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:15:51,968 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 16:15:51,969 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:15:51,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 26 transitions. [2022-04-27 16:15:51,980 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:15:51,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 26 transitions. [2022-04-27 16:15:51,984 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 26 transitions. [2022-04-27 16:15:52,016 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:15:52,022 INFO L225 Difference]: With dead ends: 22 [2022-04-27 16:15:52,023 INFO L226 Difference]: Without dead ends: 17 [2022-04-27 16:15:52,024 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:15:52,026 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:15:52,027 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:15:52,041 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2022-04-27 16:15:52,051 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2022-04-27 16:15:52,051 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 16:15:52,052 INFO L82 GeneralOperation]: Start isEquivalent. First operand 17 states. Second operand has 17 states, 11 states have (on average 1.1818181818181819) internal successors, (13), 11 states have internal predecessors, (13), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-27 16:15:52,052 INFO L74 IsIncluded]: Start isIncluded. First operand 17 states. Second operand has 17 states, 11 states have (on average 1.1818181818181819) internal successors, (13), 11 states have internal predecessors, (13), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-27 16:15:52,053 INFO L87 Difference]: Start difference. First operand 17 states. Second operand has 17 states, 11 states have (on average 1.1818181818181819) internal successors, (13), 11 states have internal predecessors, (13), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-27 16:15:52,060 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 16:15:52,060 INFO L93 Difference]: Finished difference Result 17 states and 18 transitions. [2022-04-27 16:15:52,061 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 18 transitions. [2022-04-27 16:15:52,061 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 16:15:52,061 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 16:15:52,061 INFO L74 IsIncluded]: Start isIncluded. First operand has 17 states, 11 states have (on average 1.1818181818181819) internal successors, (13), 11 states have internal predecessors, (13), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 17 states. [2022-04-27 16:15:52,062 INFO L87 Difference]: Start difference. First operand has 17 states, 11 states have (on average 1.1818181818181819) internal successors, (13), 11 states have internal predecessors, (13), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 17 states. [2022-04-27 16:15:52,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 16:15:52,065 INFO L93 Difference]: Finished difference Result 17 states and 18 transitions. [2022-04-27 16:15:52,065 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 18 transitions. [2022-04-27 16:15:52,065 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 16:15:52,065 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 16:15:52,065 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 16:15:52,065 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 16:15:52,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 11 states have (on average 1.1818181818181819) internal successors, (13), 11 states have internal predecessors, (13), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-27 16:15:52,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 18 transitions. [2022-04-27 16:15:52,071 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 18 transitions. Word has length 13 [2022-04-27 16:15:52,073 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 16:15:52,074 INFO L495 AbstractCegarLoop]: Abstraction has 17 states and 18 transitions. [2022-04-27 16:15:52,079 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:15:52,079 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 18 transitions. [2022-04-27 16:15:52,080 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-04-27 16:15:52,080 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 16:15:52,080 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 16:15:52,080 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-27 16:15:52,080 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 16:15:52,081 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 16:15:52,081 INFO L85 PathProgramCache]: Analyzing trace with hash 629920282, now seen corresponding path program 1 times [2022-04-27 16:15:52,082 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 16:15:52,082 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [927661348] [2022-04-27 16:15:52,082 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 16:15:52,082 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 16:15:52,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 16:15:52,149 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 16:15:52,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 16:15:52,170 INFO L290 TraceCheckUtils]: 0: Hoare triple {114#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [69] 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] {106#true} is VALID [2022-04-27 16:15:52,170 INFO L290 TraceCheckUtils]: 1: Hoare triple {106#true} [72] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {106#true} is VALID [2022-04-27 16:15:52,171 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {106#true} {106#true} [90] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {106#true} is VALID [2022-04-27 16:15:52,171 INFO L272 TraceCheckUtils]: 0: Hoare triple {106#true} [67] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {114#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 16:15:52,172 INFO L290 TraceCheckUtils]: 1: Hoare triple {114#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [69] 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] {106#true} is VALID [2022-04-27 16:15:52,172 INFO L290 TraceCheckUtils]: 2: Hoare triple {106#true} [72] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {106#true} is VALID [2022-04-27 16:15:52,172 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {106#true} {106#true} [90] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {106#true} is VALID [2022-04-27 16:15:52,172 INFO L272 TraceCheckUtils]: 4: Hoare triple {106#true} [68] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {106#true} is VALID [2022-04-27 16:15:52,173 INFO L290 TraceCheckUtils]: 5: Hoare triple {106#true} [71] mainENTRY-->L29-2: Formula: (and (= v_main_~k~0_6 0) (<= |v_main_#t~nondet1_2| 2147483647) (= v_main_~n~0_4 |v_main_#t~nondet1_2|) (<= 0 (+ |v_main_#t~nondet1_2| 2147483648)) (= v_main_~i~0_4 0)) InVars {main_#t~nondet1=|v_main_#t~nondet1_2|} OutVars{main_~i~0=v_main_~i~0_4, main_~n~0=v_main_~n~0_4, main_~k~0=v_main_~k~0_6} AuxVars[] AssignedVars[main_#t~nondet1, main_~k~0, main_~i~0, main_~n~0] {111#(= main_~i~0 0)} is VALID [2022-04-27 16:15:52,173 INFO L290 TraceCheckUtils]: 6: Hoare triple {111#(= main_~i~0 0)} [74] L29-2-->L29-3: Formula: (not (< v_main_~i~0_1 v_main_~n~0_1)) InVars {main_~i~0=v_main_~i~0_1, main_~n~0=v_main_~n~0_1} OutVars{main_~i~0=v_main_~i~0_1, main_~n~0=v_main_~n~0_1} AuxVars[] AssignedVars[] {112#(<= main_~n~0 0)} is VALID [2022-04-27 16:15:52,174 INFO L290 TraceCheckUtils]: 7: Hoare triple {112#(<= main_~n~0 0)} [76] L29-3-->L34-2: Formula: (= v_main_~j~0_5 v_main_~n~0_3) InVars {main_~n~0=v_main_~n~0_3} OutVars{main_~j~0=v_main_~j~0_5, main_~n~0=v_main_~n~0_3} AuxVars[] AssignedVars[main_~j~0] {113#(<= main_~j~0 0)} is VALID [2022-04-27 16:15:52,174 INFO L290 TraceCheckUtils]: 8: Hoare triple {113#(<= main_~j~0 0)} [79] L34-2-->L35: Formula: (< 0 v_main_~j~0_2) InVars {main_~j~0=v_main_~j~0_2} OutVars{main_~j~0=v_main_~j~0_2} AuxVars[] AssignedVars[] {107#false} is VALID [2022-04-27 16:15:52,175 INFO L272 TraceCheckUtils]: 9: Hoare triple {107#false} [81] L35-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (< 0 v_main_~k~0_7) 1 0)) InVars {main_~k~0=v_main_~k~0_7} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~k~0] {107#false} is VALID [2022-04-27 16:15:52,175 INFO L290 TraceCheckUtils]: 10: Hoare triple {107#false} [84] __VERIFIER_assertENTRY-->L18: Formula: (= v___VERIFIER_assert_~cond_1 |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_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {107#false} is VALID [2022-04-27 16:15:52,175 INFO L290 TraceCheckUtils]: 11: Hoare triple {107#false} [85] L18-->L19: Formula: (= v___VERIFIER_assert_~cond_2 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {107#false} is VALID [2022-04-27 16:15:52,175 INFO L290 TraceCheckUtils]: 12: Hoare triple {107#false} [87] L19-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {107#false} is VALID [2022-04-27 16:15:52,176 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:15:52,176 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 16:15:52,176 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [927661348] [2022-04-27 16:15:52,176 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [927661348] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 16:15:52,176 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 16:15:52,176 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-27 16:15:52,176 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1829631960] [2022-04-27 16:15:52,177 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 16:15:52,178 INFO L78 Accepts]: Start accepts. Automaton has has 6 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:15:52,178 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 16:15:52,178 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 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:15:52,191 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:15:52,192 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-27 16:15:52,192 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 16:15:52,192 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-27 16:15:52,193 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-04-27 16:15:52,193 INFO L87 Difference]: Start difference. First operand 17 states and 18 transitions. Second operand has 6 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:15:52,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 16:15:52,363 INFO L93 Difference]: Finished difference Result 20 states and 21 transitions. [2022-04-27 16:15:52,363 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-27 16:15:52,363 INFO L78 Accepts]: Start accepts. Automaton has has 6 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:15:52,363 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 16:15:52,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 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:15:52,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 22 transitions. [2022-04-27 16:15:52,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 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:15:52,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 22 transitions. [2022-04-27 16:15:52,374 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 22 transitions. [2022-04-27 16:15:52,396 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 22 edges. 22 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 16:15:52,398 INFO L225 Difference]: With dead ends: 20 [2022-04-27 16:15:52,398 INFO L226 Difference]: Without dead ends: 18 [2022-04-27 16:15:52,400 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2022-04-27 16:15:52,402 INFO L413 NwaCegarLoop]: 14 mSDtfsCounter, 16 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 31 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-27 16:15:52,402 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 31 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-27 16:15:52,404 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2022-04-27 16:15:52,406 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2022-04-27 16:15:52,406 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 16:15:52,407 INFO L82 GeneralOperation]: Start isEquivalent. First operand 18 states. Second operand has 18 states, 12 states have (on average 1.1666666666666667) internal successors, (14), 12 states have internal predecessors, (14), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-27 16:15:52,408 INFO L74 IsIncluded]: Start isIncluded. First operand 18 states. Second operand has 18 states, 12 states have (on average 1.1666666666666667) internal successors, (14), 12 states have internal predecessors, (14), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-27 16:15:52,409 INFO L87 Difference]: Start difference. First operand 18 states. Second operand has 18 states, 12 states have (on average 1.1666666666666667) internal successors, (14), 12 states have internal predecessors, (14), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-27 16:15:52,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 16:15:52,411 INFO L93 Difference]: Finished difference Result 18 states and 19 transitions. [2022-04-27 16:15:52,411 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 19 transitions. [2022-04-27 16:15:52,412 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 16:15:52,412 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 16:15:52,412 INFO L74 IsIncluded]: Start isIncluded. First operand has 18 states, 12 states have (on average 1.1666666666666667) internal successors, (14), 12 states have internal predecessors, (14), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 18 states. [2022-04-27 16:15:52,413 INFO L87 Difference]: Start difference. First operand has 18 states, 12 states have (on average 1.1666666666666667) internal successors, (14), 12 states have internal predecessors, (14), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 18 states. [2022-04-27 16:15:52,414 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 16:15:52,414 INFO L93 Difference]: Finished difference Result 18 states and 19 transitions. [2022-04-27 16:15:52,414 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 19 transitions. [2022-04-27 16:15:52,415 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 16:15:52,415 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 16:15:52,415 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 16:15:52,415 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 16:15:52,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 12 states have (on average 1.1666666666666667) internal successors, (14), 12 states have internal predecessors, (14), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-27 16:15:52,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 19 transitions. [2022-04-27 16:15:52,417 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 19 transitions. Word has length 13 [2022-04-27 16:15:52,417 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 16:15:52,417 INFO L495 AbstractCegarLoop]: Abstraction has 18 states and 19 transitions. [2022-04-27 16:15:52,419 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 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:15:52,419 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 19 transitions. [2022-04-27 16:15:52,419 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-04-27 16:15:52,419 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 16:15:52,419 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 16:15:52,419 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-27 16:15:52,420 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 16:15:52,420 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 16:15:52,420 INFO L85 PathProgramCache]: Analyzing trace with hash -2067329569, now seen corresponding path program 1 times [2022-04-27 16:15:52,420 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 16:15:52,421 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1701874095] [2022-04-27 16:15:52,421 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 16:15:52,421 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 16:15:52,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 16:15:52,571 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 16:15:52,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 16:15:52,578 INFO L290 TraceCheckUtils]: 0: Hoare triple {209#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [69] 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] {197#true} is VALID [2022-04-27 16:15:52,578 INFO L290 TraceCheckUtils]: 1: Hoare triple {197#true} [72] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {197#true} is VALID [2022-04-27 16:15:52,579 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {197#true} {197#true} [90] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {197#true} is VALID [2022-04-27 16:15:52,579 INFO L272 TraceCheckUtils]: 0: Hoare triple {197#true} [67] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {209#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 16:15:52,580 INFO L290 TraceCheckUtils]: 1: Hoare triple {209#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [69] 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] {197#true} is VALID [2022-04-27 16:15:52,580 INFO L290 TraceCheckUtils]: 2: Hoare triple {197#true} [72] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {197#true} is VALID [2022-04-27 16:15:52,580 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {197#true} {197#true} [90] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {197#true} is VALID [2022-04-27 16:15:52,580 INFO L272 TraceCheckUtils]: 4: Hoare triple {197#true} [68] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {197#true} is VALID [2022-04-27 16:15:52,581 INFO L290 TraceCheckUtils]: 5: Hoare triple {197#true} [71] mainENTRY-->L29-2: Formula: (and (= v_main_~k~0_6 0) (<= |v_main_#t~nondet1_2| 2147483647) (= v_main_~n~0_4 |v_main_#t~nondet1_2|) (<= 0 (+ |v_main_#t~nondet1_2| 2147483648)) (= v_main_~i~0_4 0)) InVars {main_#t~nondet1=|v_main_#t~nondet1_2|} OutVars{main_~i~0=v_main_~i~0_4, main_~n~0=v_main_~n~0_4, main_~k~0=v_main_~k~0_6} AuxVars[] AssignedVars[main_#t~nondet1, main_~k~0, main_~i~0, main_~n~0] {202#(and (= main_~k~0 0) (= main_~i~0 0))} is VALID [2022-04-27 16:15:52,582 INFO L290 TraceCheckUtils]: 6: Hoare triple {202#(and (= main_~k~0 0) (= main_~i~0 0))} [75] L29-2-->L29-2: Formula: (or (and (= |v_main_#t~post3_3| |v_main_#t~post3_1|) (not (< v_main_~i~0_3 v_main_~n~0_2)) (= |v_main_#t~post2_3| |v_main_#t~post2_1|) (= v_main_~k~0_5 v_main_~k~0_4) (= v_main_~i~0_3 v_main_~i~0_2)) (and (= (+ v_main_~i~0_3 v_main_~k~0_4) (+ v_main_~i~0_2 v_main_~k~0_5)) (< v_main_~i~0_3 v_main_~i~0_2) (< v_main_~i~0_2 (+ v_main_~n~0_2 1)))) InVars {main_~i~0=v_main_~i~0_3, main_#t~post2=|v_main_#t~post2_3|, main_~n~0=v_main_~n~0_2, main_#t~post3=|v_main_#t~post3_3|, main_~k~0=v_main_~k~0_5} OutVars{main_~i~0=v_main_~i~0_2, main_#t~post2=|v_main_#t~post2_1|, main_#t~post3=|v_main_#t~post3_1|, main_~n~0=v_main_~n~0_2, main_~k~0=v_main_~k~0_4} AuxVars[] AssignedVars[main_~k~0, main_~i~0, main_#t~post2, main_#t~post3] {203#(or (<= main_~i~0 main_~k~0) (<= main_~n~0 0))} is VALID [2022-04-27 16:15:52,583 INFO L290 TraceCheckUtils]: 7: Hoare triple {203#(or (<= main_~i~0 main_~k~0) (<= main_~n~0 0))} [74] L29-2-->L29-3: Formula: (not (< v_main_~i~0_1 v_main_~n~0_1)) InVars {main_~i~0=v_main_~i~0_1, main_~n~0=v_main_~n~0_1} OutVars{main_~i~0=v_main_~i~0_1, main_~n~0=v_main_~n~0_1} AuxVars[] AssignedVars[] {204#(or (<= main_~n~0 0) (<= main_~n~0 main_~k~0))} is VALID [2022-04-27 16:15:52,583 INFO L290 TraceCheckUtils]: 8: Hoare triple {204#(or (<= main_~n~0 0) (<= main_~n~0 main_~k~0))} [76] L29-3-->L34-2: Formula: (= v_main_~j~0_5 v_main_~n~0_3) InVars {main_~n~0=v_main_~n~0_3} OutVars{main_~j~0=v_main_~j~0_5, main_~n~0=v_main_~n~0_3} AuxVars[] AssignedVars[main_~j~0] {205#(or (<= main_~j~0 main_~k~0) (<= main_~j~0 0))} is VALID [2022-04-27 16:15:52,584 INFO L290 TraceCheckUtils]: 9: Hoare triple {205#(or (<= main_~j~0 main_~k~0) (<= main_~j~0 0))} [79] L34-2-->L35: Formula: (< 0 v_main_~j~0_2) InVars {main_~j~0=v_main_~j~0_2} OutVars{main_~j~0=v_main_~j~0_2} AuxVars[] AssignedVars[] {206#(<= 1 main_~k~0)} is VALID [2022-04-27 16:15:52,585 INFO L272 TraceCheckUtils]: 10: Hoare triple {206#(<= 1 main_~k~0)} [81] L35-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (< 0 v_main_~k~0_7) 1 0)) InVars {main_~k~0=v_main_~k~0_7} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~k~0] {207#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 16:15:52,585 INFO L290 TraceCheckUtils]: 11: Hoare triple {207#(not (= |__VERIFIER_assert_#in~cond| 0))} [84] __VERIFIER_assertENTRY-->L18: Formula: (= v___VERIFIER_assert_~cond_1 |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_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {208#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-27 16:15:52,586 INFO L290 TraceCheckUtils]: 12: Hoare triple {208#(not (= __VERIFIER_assert_~cond 0))} [85] L18-->L19: Formula: (= v___VERIFIER_assert_~cond_2 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {198#false} is VALID [2022-04-27 16:15:52,586 INFO L290 TraceCheckUtils]: 13: Hoare triple {198#false} [87] L19-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {198#false} is VALID [2022-04-27 16:15:52,586 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:15:52,587 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 16:15:52,587 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1701874095] [2022-04-27 16:15:52,587 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1701874095] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 16:15:52,587 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1523532307] [2022-04-27 16:15:52,587 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 16:15:52,587 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 16:15:52,588 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 16:15:52,591 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:15:52,593 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:15:52,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 16:15:52,642 INFO L263 TraceCheckSpWp]: Trace formula consists of 57 conjuncts, 9 conjunts are in the unsatisfiable core [2022-04-27 16:15:52,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 16:15:52,658 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 16:15:53,316 INFO L272 TraceCheckUtils]: 0: Hoare triple {197#true} [67] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {197#true} is VALID [2022-04-27 16:15:53,317 INFO L290 TraceCheckUtils]: 1: Hoare triple {197#true} [69] 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] {197#true} is VALID [2022-04-27 16:15:53,318 INFO L290 TraceCheckUtils]: 2: Hoare triple {197#true} [72] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {197#true} is VALID [2022-04-27 16:15:53,318 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {197#true} {197#true} [90] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {197#true} is VALID [2022-04-27 16:15:53,318 INFO L272 TraceCheckUtils]: 4: Hoare triple {197#true} [68] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {197#true} is VALID [2022-04-27 16:15:53,319 INFO L290 TraceCheckUtils]: 5: Hoare triple {197#true} [71] mainENTRY-->L29-2: Formula: (and (= v_main_~k~0_6 0) (<= |v_main_#t~nondet1_2| 2147483647) (= v_main_~n~0_4 |v_main_#t~nondet1_2|) (<= 0 (+ |v_main_#t~nondet1_2| 2147483648)) (= v_main_~i~0_4 0)) InVars {main_#t~nondet1=|v_main_#t~nondet1_2|} OutVars{main_~i~0=v_main_~i~0_4, main_~n~0=v_main_~n~0_4, main_~k~0=v_main_~k~0_6} AuxVars[] AssignedVars[main_#t~nondet1, main_~k~0, main_~i~0, main_~n~0] {228#(and (<= 0 main_~k~0) (<= main_~i~0 0))} is VALID [2022-04-27 16:15:53,322 INFO L290 TraceCheckUtils]: 6: Hoare triple {228#(and (<= 0 main_~k~0) (<= main_~i~0 0))} [75] L29-2-->L29-2: Formula: (or (and (= |v_main_#t~post3_3| |v_main_#t~post3_1|) (not (< v_main_~i~0_3 v_main_~n~0_2)) (= |v_main_#t~post2_3| |v_main_#t~post2_1|) (= v_main_~k~0_5 v_main_~k~0_4) (= v_main_~i~0_3 v_main_~i~0_2)) (and (= (+ v_main_~i~0_3 v_main_~k~0_4) (+ v_main_~i~0_2 v_main_~k~0_5)) (< v_main_~i~0_3 v_main_~i~0_2) (< v_main_~i~0_2 (+ v_main_~n~0_2 1)))) InVars {main_~i~0=v_main_~i~0_3, main_#t~post2=|v_main_#t~post2_3|, main_~n~0=v_main_~n~0_2, main_#t~post3=|v_main_#t~post3_3|, main_~k~0=v_main_~k~0_5} OutVars{main_~i~0=v_main_~i~0_2, main_#t~post2=|v_main_#t~post2_1|, main_#t~post3=|v_main_#t~post3_1|, main_~n~0=v_main_~n~0_2, main_~k~0=v_main_~k~0_4} AuxVars[] AssignedVars[main_~k~0, main_~i~0, main_#t~post2, main_#t~post3] {232#(or (and (<= 0 main_~k~0) (<= main_~i~0 0) (<= main_~n~0 main_~i~0)) (and (<= main_~i~0 main_~k~0) (< 0 main_~k~0) (< main_~i~0 (+ main_~n~0 1))))} is VALID [2022-04-27 16:15:53,323 INFO L290 TraceCheckUtils]: 7: Hoare triple {232#(or (and (<= 0 main_~k~0) (<= main_~i~0 0) (<= main_~n~0 main_~i~0)) (and (<= main_~i~0 main_~k~0) (< 0 main_~k~0) (< main_~i~0 (+ main_~n~0 1))))} [74] L29-2-->L29-3: Formula: (not (< v_main_~i~0_1 v_main_~n~0_1)) InVars {main_~i~0=v_main_~i~0_1, main_~n~0=v_main_~n~0_1} OutVars{main_~i~0=v_main_~i~0_1, main_~n~0=v_main_~n~0_1} AuxVars[] AssignedVars[] {236#(or (and (< 0 main_~k~0) (<= main_~n~0 main_~k~0)) (and (<= 0 main_~k~0) (<= main_~n~0 0)))} is VALID [2022-04-27 16:15:53,324 INFO L290 TraceCheckUtils]: 8: Hoare triple {236#(or (and (< 0 main_~k~0) (<= main_~n~0 main_~k~0)) (and (<= 0 main_~k~0) (<= main_~n~0 0)))} [76] L29-3-->L34-2: Formula: (= v_main_~j~0_5 v_main_~n~0_3) InVars {main_~n~0=v_main_~n~0_3} OutVars{main_~j~0=v_main_~j~0_5, main_~n~0=v_main_~n~0_3} AuxVars[] AssignedVars[main_~j~0] {240#(or (and (<= main_~j~0 main_~k~0) (< 0 main_~k~0)) (and (<= 0 main_~k~0) (<= main_~j~0 0)))} is VALID [2022-04-27 16:15:53,325 INFO L290 TraceCheckUtils]: 9: Hoare triple {240#(or (and (<= main_~j~0 main_~k~0) (< 0 main_~k~0)) (and (<= 0 main_~k~0) (<= main_~j~0 0)))} [79] L34-2-->L35: Formula: (< 0 v_main_~j~0_2) InVars {main_~j~0=v_main_~j~0_2} OutVars{main_~j~0=v_main_~j~0_2} AuxVars[] AssignedVars[] {206#(<= 1 main_~k~0)} is VALID [2022-04-27 16:15:53,326 INFO L272 TraceCheckUtils]: 10: Hoare triple {206#(<= 1 main_~k~0)} [81] L35-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (< 0 v_main_~k~0_7) 1 0)) InVars {main_~k~0=v_main_~k~0_7} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~k~0] {247#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 16:15:53,327 INFO L290 TraceCheckUtils]: 11: Hoare triple {247#(<= 1 |__VERIFIER_assert_#in~cond|)} [84] __VERIFIER_assertENTRY-->L18: Formula: (= v___VERIFIER_assert_~cond_1 |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_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {251#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 16:15:53,328 INFO L290 TraceCheckUtils]: 12: Hoare triple {251#(<= 1 __VERIFIER_assert_~cond)} [85] L18-->L19: Formula: (= v___VERIFIER_assert_~cond_2 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {198#false} is VALID [2022-04-27 16:15:53,328 INFO L290 TraceCheckUtils]: 13: Hoare triple {198#false} [87] L19-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {198#false} is VALID [2022-04-27 16:15:53,328 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:15:53,328 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 16:15:53,996 INFO L290 TraceCheckUtils]: 13: Hoare triple {198#false} [87] L19-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {198#false} is VALID [2022-04-27 16:15:53,997 INFO L290 TraceCheckUtils]: 12: Hoare triple {251#(<= 1 __VERIFIER_assert_~cond)} [85] L18-->L19: Formula: (= v___VERIFIER_assert_~cond_2 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {198#false} is VALID [2022-04-27 16:15:53,998 INFO L290 TraceCheckUtils]: 11: Hoare triple {247#(<= 1 |__VERIFIER_assert_#in~cond|)} [84] __VERIFIER_assertENTRY-->L18: Formula: (= v___VERIFIER_assert_~cond_1 |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_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {251#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 16:15:53,999 INFO L272 TraceCheckUtils]: 10: Hoare triple {206#(<= 1 main_~k~0)} [81] L35-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (< 0 v_main_~k~0_7) 1 0)) InVars {main_~k~0=v_main_~k~0_7} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~k~0] {247#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 16:15:53,999 INFO L290 TraceCheckUtils]: 9: Hoare triple {270#(or (<= 1 main_~k~0) (not (< 0 main_~j~0)))} [79] L34-2-->L35: Formula: (< 0 v_main_~j~0_2) InVars {main_~j~0=v_main_~j~0_2} OutVars{main_~j~0=v_main_~j~0_2} AuxVars[] AssignedVars[] {206#(<= 1 main_~k~0)} is VALID [2022-04-27 16:15:54,000 INFO L290 TraceCheckUtils]: 8: Hoare triple {274#(or (<= 1 main_~k~0) (<= main_~n~0 0))} [76] L29-3-->L34-2: Formula: (= v_main_~j~0_5 v_main_~n~0_3) InVars {main_~n~0=v_main_~n~0_3} OutVars{main_~j~0=v_main_~j~0_5, main_~n~0=v_main_~n~0_3} AuxVars[] AssignedVars[main_~j~0] {270#(or (<= 1 main_~k~0) (not (< 0 main_~j~0)))} is VALID [2022-04-27 16:15:54,001 INFO L290 TraceCheckUtils]: 7: Hoare triple {278#(or (< main_~i~0 main_~n~0) (<= 1 main_~k~0) (<= main_~n~0 0))} [74] L29-2-->L29-3: Formula: (not (< v_main_~i~0_1 v_main_~n~0_1)) InVars {main_~i~0=v_main_~i~0_1, main_~n~0=v_main_~n~0_1} OutVars{main_~i~0=v_main_~i~0_1, main_~n~0=v_main_~n~0_1} AuxVars[] AssignedVars[] {274#(or (<= 1 main_~k~0) (<= main_~n~0 0))} is VALID [2022-04-27 16:15:54,002 INFO L290 TraceCheckUtils]: 6: Hoare triple {282#(and (or (<= 0 main_~k~0) (<= main_~i~0 main_~k~0)) (or (<= 1 main_~k~0) (<= main_~i~0 0)))} [75] L29-2-->L29-2: Formula: (or (and (= |v_main_#t~post3_3| |v_main_#t~post3_1|) (not (< v_main_~i~0_3 v_main_~n~0_2)) (= |v_main_#t~post2_3| |v_main_#t~post2_1|) (= v_main_~k~0_5 v_main_~k~0_4) (= v_main_~i~0_3 v_main_~i~0_2)) (and (= (+ v_main_~i~0_3 v_main_~k~0_4) (+ v_main_~i~0_2 v_main_~k~0_5)) (< v_main_~i~0_3 v_main_~i~0_2) (< v_main_~i~0_2 (+ v_main_~n~0_2 1)))) InVars {main_~i~0=v_main_~i~0_3, main_#t~post2=|v_main_#t~post2_3|, main_~n~0=v_main_~n~0_2, main_#t~post3=|v_main_#t~post3_3|, main_~k~0=v_main_~k~0_5} OutVars{main_~i~0=v_main_~i~0_2, main_#t~post2=|v_main_#t~post2_1|, main_#t~post3=|v_main_#t~post3_1|, main_~n~0=v_main_~n~0_2, main_~k~0=v_main_~k~0_4} AuxVars[] AssignedVars[main_~k~0, main_~i~0, main_#t~post2, main_#t~post3] {278#(or (< main_~i~0 main_~n~0) (<= 1 main_~k~0) (<= main_~n~0 0))} is VALID [2022-04-27 16:15:54,003 INFO L290 TraceCheckUtils]: 5: Hoare triple {197#true} [71] mainENTRY-->L29-2: Formula: (and (= v_main_~k~0_6 0) (<= |v_main_#t~nondet1_2| 2147483647) (= v_main_~n~0_4 |v_main_#t~nondet1_2|) (<= 0 (+ |v_main_#t~nondet1_2| 2147483648)) (= v_main_~i~0_4 0)) InVars {main_#t~nondet1=|v_main_#t~nondet1_2|} OutVars{main_~i~0=v_main_~i~0_4, main_~n~0=v_main_~n~0_4, main_~k~0=v_main_~k~0_6} AuxVars[] AssignedVars[main_#t~nondet1, main_~k~0, main_~i~0, main_~n~0] {282#(and (or (<= 0 main_~k~0) (<= main_~i~0 main_~k~0)) (or (<= 1 main_~k~0) (<= main_~i~0 0)))} is VALID [2022-04-27 16:15:54,003 INFO L272 TraceCheckUtils]: 4: Hoare triple {197#true} [68] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {197#true} is VALID [2022-04-27 16:15:54,003 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {197#true} {197#true} [90] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {197#true} is VALID [2022-04-27 16:15:54,004 INFO L290 TraceCheckUtils]: 2: Hoare triple {197#true} [72] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {197#true} is VALID [2022-04-27 16:15:54,004 INFO L290 TraceCheckUtils]: 1: Hoare triple {197#true} [69] 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] {197#true} is VALID [2022-04-27 16:15:54,004 INFO L272 TraceCheckUtils]: 0: Hoare triple {197#true} [67] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {197#true} is VALID [2022-04-27 16:15:54,004 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:15:54,005 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1523532307] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 16:15:54,005 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-27 16:15:54,005 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 9] total 20 [2022-04-27 16:15:54,005 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [951090476] [2022-04-27 16:15:54,005 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-27 16:15:54,006 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 19 states have (on average 1.2105263157894737) internal successors, (23), 17 states have internal predecessors, (23), 2 states have call successors, (5), 4 states have call predecessors, (5), 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:15:54,006 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 16:15:54,007 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 20 states, 19 states have (on average 1.2105263157894737) internal successors, (23), 17 states have internal predecessors, (23), 2 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 16:15:54,029 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 29 edges. 29 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 16:15:54,029 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-04-27 16:15:54,029 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 16:15:54,030 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-04-27 16:15:54,030 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=315, Unknown=0, NotChecked=0, Total=380 [2022-04-27 16:15:54,030 INFO L87 Difference]: Start difference. First operand 18 states and 19 transitions. Second operand has 20 states, 19 states have (on average 1.2105263157894737) internal successors, (23), 17 states have internal predecessors, (23), 2 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 16:15:54,688 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 16:15:54,689 INFO L93 Difference]: Finished difference Result 19 states and 21 transitions. [2022-04-27 16:15:54,689 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-04-27 16:15:54,689 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 19 states have (on average 1.2105263157894737) internal successors, (23), 17 states have internal predecessors, (23), 2 states have call successors, (5), 4 states have call predecessors, (5), 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:15:54,689 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 16:15:54,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 19 states have (on average 1.2105263157894737) internal successors, (23), 17 states have internal predecessors, (23), 2 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 16:15:54,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 22 transitions. [2022-04-27 16:15:54,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 19 states have (on average 1.2105263157894737) internal successors, (23), 17 states have internal predecessors, (23), 2 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 16:15:54,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 22 transitions. [2022-04-27 16:15:54,692 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 12 states and 22 transitions. [2022-04-27 16:15:54,715 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 22 edges. 22 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 16:15:54,715 INFO L225 Difference]: With dead ends: 19 [2022-04-27 16:15:54,715 INFO L226 Difference]: Without dead ends: 0 [2022-04-27 16:15:54,716 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 17 SyntacticMatches, 3 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 153 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=157, Invalid=655, Unknown=0, NotChecked=0, Total=812 [2022-04-27 16:15:54,717 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 33 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 91 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 45 SdHoareTripleChecker+Invalid, 130 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 91 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-27 16:15:54,717 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 45 Invalid, 130 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 91 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-27 16:15:54,718 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-04-27 16:15:54,718 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-04-27 16:15:54,718 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 16:15:54,718 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:15:54,718 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:15:54,718 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:15:54,718 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 16:15:54,719 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-27 16:15:54,719 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-27 16:15:54,719 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 16:15:54,719 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 16:15:54,719 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:15:54,719 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:15:54,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 16:15:54,719 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-27 16:15:54,719 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-27 16:15:54,720 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 16:15:54,720 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 16:15:54,720 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 16:15:54,720 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 16:15:54,720 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:15:54,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-04-27 16:15:54,720 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 14 [2022-04-27 16:15:54,720 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 16:15:54,720 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-04-27 16:15:54,721 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 19 states have (on average 1.2105263157894737) internal successors, (23), 17 states have internal predecessors, (23), 2 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 16:15:54,721 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-27 16:15:54,721 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 16:15:54,723 INFO L805 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-04-27 16:15:54,745 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-04-27 16:15:54,939 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:15:54,941 INFO L356 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2022-04-27 16:15:54,943 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-04-27 16:15:54,945 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.04 04:15:54 BasicIcfg [2022-04-27 16:15:54,945 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-04-27 16:15:54,946 INFO L158 Benchmark]: Toolchain (without parser) took 8545.74ms. Allocated memory was 176.2MB in the beginning and 217.1MB in the end (delta: 40.9MB). Free memory was 124.7MB in the beginning and 97.0MB in the end (delta: 27.7MB). Peak memory consumption was 68.9MB. Max. memory is 8.0GB. [2022-04-27 16:15:54,946 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 176.2MB. Free memory was 141.4MB in the beginning and 141.3MB in the end (delta: 72.6kB). There was no memory consumed. Max. memory is 8.0GB. [2022-04-27 16:15:54,947 INFO L158 Benchmark]: CACSL2BoogieTranslator took 285.23ms. Allocated memory is still 176.2MB. Free memory was 124.6MB in the beginning and 151.5MB in the end (delta: -26.9MB). Peak memory consumption was 13.6MB. Max. memory is 8.0GB. [2022-04-27 16:15:54,947 INFO L158 Benchmark]: Boogie Preprocessor took 45.31ms. Allocated memory is still 176.2MB. Free memory was 151.5MB in the beginning and 150.0MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-04-27 16:15:54,947 INFO L158 Benchmark]: RCFGBuilder took 344.40ms. Allocated memory is still 176.2MB. Free memory was 149.9MB in the beginning and 138.7MB in the end (delta: 11.2MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2022-04-27 16:15:54,948 INFO L158 Benchmark]: IcfgTransformer took 4511.82ms. Allocated memory is still 176.2MB. Free memory was 138.6MB in the beginning and 120.4MB in the end (delta: 18.3MB). Peak memory consumption was 17.8MB. Max. memory is 8.0GB. [2022-04-27 16:15:54,948 INFO L158 Benchmark]: TraceAbstraction took 3351.27ms. Allocated memory was 176.2MB in the beginning and 217.1MB in the end (delta: 40.9MB). Free memory was 119.9MB in the beginning and 97.0MB in the end (delta: 22.8MB). Peak memory consumption was 64.4MB. Max. memory is 8.0GB. [2022-04-27 16:15:54,950 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from IcfgTransformer: - StatisticsResult: Jordan loop acceleration statistics 2 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.14ms. Allocated memory is still 176.2MB. Free memory was 141.4MB in the beginning and 141.3MB in the end (delta: 72.6kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 285.23ms. Allocated memory is still 176.2MB. Free memory was 124.6MB in the beginning and 151.5MB in the end (delta: -26.9MB). Peak memory consumption was 13.6MB. Max. memory is 8.0GB. * Boogie Preprocessor took 45.31ms. Allocated memory is still 176.2MB. Free memory was 151.5MB in the beginning and 150.0MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 344.40ms. Allocated memory is still 176.2MB. Free memory was 149.9MB in the beginning and 138.7MB in the end (delta: 11.2MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * IcfgTransformer took 4511.82ms. Allocated memory is still 176.2MB. Free memory was 138.6MB in the beginning and 120.4MB in the end (delta: 18.3MB). Peak memory consumption was 17.8MB. Max. memory is 8.0GB. * TraceAbstraction took 3351.27ms. Allocated memory was 176.2MB in the beginning and 217.1MB in the end (delta: 40.9MB). Free memory was 119.9MB in the beginning and 97.0MB in the end (delta: 22.8MB). Peak memory consumption was 64.4MB. 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, 22 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 3.3s, OverallIterations: 3, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 65 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 63 mSDsluCounter, 101 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 57 mSDsCounter, 44 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 137 IncrementalHoareTripleChecker+Invalid, 181 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 44 mSolverCounterUnsat, 44 mSDtfsCounter, 137 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 61 GetRequests, 23 SyntacticMatches, 3 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 153 ImplicationChecksByTransitivity, 0.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=22occurred in iteration=0, InterpolantAutomatonStates: 21, 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.6s InterpolantComputationTime, 54 NumberOfCodeBlocks, 54 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 63 ConstructedInterpolants, 0 QuantifiedInterpolants, 223 SizeOfPredicates, 9 NumberOfNonLiveVariables, 57 ConjunctsInSsa, 9 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:15:54,978 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...