/usr/bin/java -ea -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data --core.log.level.for.class de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN -tc ../../../trunk/examples/toolchains/AutomizerCTransformed.xml -s ../../../trunk/examples/settings/automizer/LoopAccelerationJordanC.epf -i ../../../trunk/examples/svcomp/loop-lit/cggmp2005b.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-fb4f59a-m [2022-04-27 16:17:35,581 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-27 16:17:35,593 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-27 16:17:35,628 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-27 16:17:35,628 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-27 16:17:35,629 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-27 16:17:35,630 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-27 16:17:35,633 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-27 16:17:35,634 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-27 16:17:35,634 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-27 16:17:35,635 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-27 16:17:35,636 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-27 16:17:35,636 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-27 16:17:35,636 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-27 16:17:35,637 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-27 16:17:35,638 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-27 16:17:35,638 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-27 16:17:35,639 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-27 16:17:35,640 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-27 16:17:35,641 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-27 16:17:35,642 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-27 16:17:35,647 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-27 16:17:35,651 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-27 16:17:35,653 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-27 16:17:35,655 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-27 16:17:35,658 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-27 16:17:35,658 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-27 16:17:35,658 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-27 16:17:35,659 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-27 16:17:35,659 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-27 16:17:35,660 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-27 16:17:35,660 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-27 16:17:35,660 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-27 16:17:35,661 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-27 16:17:35,661 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-27 16:17:35,662 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-27 16:17:35,662 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-27 16:17:35,662 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-27 16:17:35,662 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-27 16:17:35,663 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-27 16:17:35,667 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-27 16:17:35,669 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-27 16:17:35,669 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/LoopAccelerationJordanC.epf [2022-04-27 16:17:35,677 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-27 16:17:35,678 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-27 16:17:35,678 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-27 16:17:35,679 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-27 16:17:35,679 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-27 16:17:35,679 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-27 16:17:35,679 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-27 16:17:35,679 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-27 16:17:35,679 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-27 16:17:35,679 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-27 16:17:35,680 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-27 16:17:35,680 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-27 16:17:35,680 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-27 16:17:35,680 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-27 16:17:35,680 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-27 16:17:35,680 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-27 16:17:35,680 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-27 16:17:35,680 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-27 16:17:35,680 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-27 16:17:35,680 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-27 16:17:35,680 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-04-27 16:17:35,681 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-04-27 16:17:35,681 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:17:35,871 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-27 16:17:35,890 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-27 16:17:35,892 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-27 16:17:35,892 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-27 16:17:35,893 INFO L275 PluginConnector]: CDTParser initialized [2022-04-27 16:17:35,893 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-lit/cggmp2005b.i [2022-04-27 16:17:35,935 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e1620050b/9e3f21ff70c94515aaa9ab8e25e9fe5e/FLAGcef78cabe [2022-04-27 16:17:36,283 INFO L306 CDTParser]: Found 1 translation units. [2022-04-27 16:17:36,284 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-lit/cggmp2005b.i [2022-04-27 16:17:36,287 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e1620050b/9e3f21ff70c94515aaa9ab8e25e9fe5e/FLAGcef78cabe [2022-04-27 16:17:36,296 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e1620050b/9e3f21ff70c94515aaa9ab8e25e9fe5e [2022-04-27 16:17:36,297 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-27 16:17:36,298 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-04-27 16:17:36,299 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-27 16:17:36,299 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-27 16:17:36,301 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-27 16:17:36,302 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.04 04:17:36" (1/1) ... [2022-04-27 16:17:36,302 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2a46466d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 04:17:36, skipping insertion in model container [2022-04-27 16:17:36,302 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.04 04:17:36" (1/1) ... [2022-04-27 16:17:36,306 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-27 16:17:36,316 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-27 16:17:36,423 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-lit/cggmp2005b.i[895,908] [2022-04-27 16:17:36,429 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-27 16:17:36,434 INFO L203 MainTranslator]: Completed pre-run [2022-04-27 16:17:36,445 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-lit/cggmp2005b.i[895,908] [2022-04-27 16:17:36,458 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-27 16:17:36,467 INFO L208 MainTranslator]: Completed translation [2022-04-27 16:17:36,467 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 04:17:36 WrapperNode [2022-04-27 16:17:36,467 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-27 16:17:36,468 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-27 16:17:36,468 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-27 16:17:36,468 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-27 16:17:36,474 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 04:17:36" (1/1) ... [2022-04-27 16:17:36,474 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 04:17:36" (1/1) ... [2022-04-27 16:17:36,478 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 04:17:36" (1/1) ... [2022-04-27 16:17:36,478 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 04:17:36" (1/1) ... [2022-04-27 16:17:36,481 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 04:17:36" (1/1) ... [2022-04-27 16:17:36,484 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 04:17:36" (1/1) ... [2022-04-27 16:17:36,484 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 04:17:36" (1/1) ... [2022-04-27 16:17:36,485 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-27 16:17:36,486 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-27 16:17:36,486 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-27 16:17:36,486 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-27 16:17:36,486 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 04:17:36" (1/1) ... [2022-04-27 16:17:36,491 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-27 16:17:36,497 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 16:17:36,505 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:17:36,512 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:17:36,528 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-27 16:17:36,528 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-27 16:17:36,528 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-27 16:17:36,528 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-27 16:17:36,528 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-27 16:17:36,528 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-27 16:17:36,528 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-27 16:17:36,528 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-27 16:17:36,529 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_perror_fail [2022-04-27 16:17:36,529 INFO L130 BoogieDeclarations]: Found specification of procedure __assert [2022-04-27 16:17:36,529 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-27 16:17:36,529 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-27 16:17:36,529 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-27 16:17:36,529 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-27 16:17:36,529 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-04-27 16:17:36,530 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-27 16:17:36,530 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-27 16:17:36,530 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-27 16:17:36,530 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-27 16:17:36,530 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-27 16:17:36,530 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-27 16:17:36,530 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-27 16:17:36,573 INFO L234 CfgBuilder]: Building ICFG [2022-04-27 16:17:36,575 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-27 16:17:36,756 INFO L275 CfgBuilder]: Performing block encoding [2022-04-27 16:17:36,760 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-27 16:17:36,761 INFO L299 CfgBuilder]: Removed 3 assume(true) statements. [2022-04-27 16:17:36,762 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.04 04:17:36 BoogieIcfgContainer [2022-04-27 16:17:36,762 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-27 16:17:36,762 INFO L113 PluginConnector]: ------------------------IcfgTransformer---------------------------- [2022-04-27 16:17:36,763 INFO L271 PluginConnector]: Initializing IcfgTransformer... [2022-04-27 16:17:36,768 INFO L275 PluginConnector]: IcfgTransformer initialized [2022-04-27 16:17:36,789 INFO L185 PluginConnector]: Executing the observer IcfgTransformationObserver from plugin IcfgTransformer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.04 04:17:36" (1/1) ... [2022-04-27 16:17:36,790 INFO L168 ansformationObserver]: Applying ICFG transformation LOOP_ACCELERATION_JORDAN [2022-04-27 16:17:45,621 WARN L828 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2022-04-27 16:17:49,915 WARN L970 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-27 16:17:56,724 WARN L828 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2022-04-27 16:17:56,940 INFO L89 elerationTransformer]: Jordan loop acceleration statistics: 0 HavocedVariables, 1 AssignedVariables, 1 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-27 16:17:56,941 INFO L91 elerationTransformer]: Accelerated Formula: (and (< v_main_~j~0_2 20) (= v_main_~j~0_1 (+ v_main_~i~0_1 v_main_~j~0_2))) InVars {main_~j~0=v_main_~j~0_2, main_~i~0=v_main_~i~0_1} OutVars{main_~j~0=v_main_~j~0_1, main_~i~0=v_main_~i~0_1} AuxVars[] AssignedVars[main_~j~0] to Formula: (let ((.cse1 (= v_main_~j~0_2 v_main_~j~0_1))) (or (and (< v_main_~j~0_2 20) (let ((.cse0 (= v_main_~i~0_1 0))) (or (and .cse0 .cse1) (let ((.cse2 (+ v_main_~j~0_1 (* (- 1) v_main_~j~0_2)))) (and (= (mod .cse2 v_main_~i~0_1) 0) (not .cse0) (< 0 (div .cse2 v_main_~i~0_1)) (forall ((v_it_1 Int)) (or (not (<= 1 v_it_1)) (not (<= (+ v_it_1 1) (div (+ v_main_~j~0_1 (* (- 1) v_main_~j~0_2)) v_main_~i~0_1))) (< (+ v_main_~j~0_2 (* v_main_~i~0_1 v_it_1)) 20)))))))) (and .cse1 (<= 20 v_main_~j~0_2)))) InVars {main_~i~0=v_main_~i~0_1, main_~j~0=v_main_~j~0_2} OutVars{main_~i~0=v_main_~i~0_1, main_~j~0=v_main_~j~0_1} AuxVars[] AssignedVars[main_~j~0] [2022-04-27 16:17:59,934 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-27 16:18:00,004 INFO L89 elerationTransformer]: Jordan loop acceleration statistics: 0 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-27 16:18:00,004 INFO L91 elerationTransformer]: Accelerated Formula: (and (<= v_main_~k~0_4 3) (= v_main_~k~0_3 (+ v_main_~k~0_4 1))) InVars {main_~k~0=v_main_~k~0_4} OutVars{main_~k~0=v_main_~k~0_3} AuxVars[] AssignedVars[main_~k~0] to Formula: (or (and (= v_main_~k~0_4 v_main_~k~0_3) (not (<= v_main_~k~0_4 3))) (and (<= v_main_~k~0_3 4) (< v_main_~k~0_4 v_main_~k~0_3))) InVars {main_~k~0=v_main_~k~0_4} OutVars{main_~k~0=v_main_~k~0_3} AuxVars[] AssignedVars[main_~k~0] [2022-04-27 16:18:00,007 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 27.04 04:18:00 BasicIcfg [2022-04-27 16:18:00,007 INFO L132 PluginConnector]: ------------------------ END IcfgTransformer---------------------------- [2022-04-27 16:18:00,008 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-27 16:18:00,008 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-27 16:18:00,010 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-27 16:18:00,011 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.04 04:17:36" (1/4) ... [2022-04-27 16:18:00,011 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2879ee2e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.04 04:18:00, skipping insertion in model container [2022-04-27 16:18:00,012 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 04:17:36" (2/4) ... [2022-04-27 16:18:00,013 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2879ee2e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.04 04:18:00, skipping insertion in model container [2022-04-27 16:18:00,014 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.04 04:17:36" (3/4) ... [2022-04-27 16:18:00,014 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2879ee2e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.04 04:18:00, skipping insertion in model container [2022-04-27 16:18:00,014 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 27.04 04:18:00" (4/4) ... [2022-04-27 16:18:00,015 INFO L111 eAbstractionObserver]: Analyzing ICFG cggmp2005b.iJordan [2022-04-27 16:18:00,025 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION [2022-04-27 16:18:00,025 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-27 16:18:00,057 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-27 16:18:00,062 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@2d1ac76d, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@6e99a432 [2022-04-27 16:18:00,063 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-27 16:18:00,068 INFO L276 IsEmpty]: Start isEmpty. Operand has 22 states, 14 states have (on average 1.5714285714285714) internal successors, (22), 15 states have internal predecessors, (22), 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:18:00,072 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-04-27 16:18:00,072 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 16:18:00,073 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 16:18:00,073 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 16:18:00,078 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 16:18:00,078 INFO L85 PathProgramCache]: Analyzing trace with hash 2111755460, now seen corresponding path program 1 times [2022-04-27 16:18:00,085 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 16:18:00,085 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [699985666] [2022-04-27 16:18:00,085 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 16:18:00,086 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 16:18:00,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 16:18:00,184 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 16:18:00,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 16:18:00,207 INFO L290 TraceCheckUtils]: 0: Hoare triple {30#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [80] 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:18:00,207 INFO L290 TraceCheckUtils]: 1: Hoare triple {25#true} [83] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {25#true} is VALID [2022-04-27 16:18:00,208 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {25#true} {25#true} [103] 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:18:00,210 INFO L272 TraceCheckUtils]: 0: Hoare triple {25#true} [78] 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:18:00,211 INFO L290 TraceCheckUtils]: 1: Hoare triple {30#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [80] 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:18:00,211 INFO L290 TraceCheckUtils]: 2: Hoare triple {25#true} [83] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {25#true} is VALID [2022-04-27 16:18:00,211 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {25#true} {25#true} [103] 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:18:00,212 INFO L272 TraceCheckUtils]: 4: Hoare triple {25#true} [79] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {25#true} is VALID [2022-04-27 16:18:00,212 INFO L290 TraceCheckUtils]: 5: Hoare triple {25#true} [82] mainENTRY-->L35-3: Formula: (and (= v_main_~i~0_2 0) (= v_main_~j~0_3 (- 100)) (= v_main_~k~0_5 9)) InVars {} OutVars{main_~i~0=v_main_~i~0_2, main_~k~0=v_main_~k~0_5, main_~j~0=v_main_~j~0_3} AuxVars[] AssignedVars[main_~k~0, main_~j~0, main_~i~0] {25#true} is VALID [2022-04-27 16:18:00,212 INFO L290 TraceCheckUtils]: 6: Hoare triple {25#true} [84] L35-3-->L29-2: Formula: false InVars {} OutVars{} AuxVars[] AssignedVars[] {26#false} is VALID [2022-04-27 16:18:00,212 INFO L272 TraceCheckUtils]: 7: Hoare triple {26#false} [87] L29-2-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= v_main_~k~0_9 4) 1 0)) InVars {main_~k~0=v_main_~k~0_9} 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:18:00,213 INFO L290 TraceCheckUtils]: 8: Hoare triple {26#false} [92] __VERIFIER_assertENTRY-->L18: Formula: (= v___VERIFIER_assert_~cond_3 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {26#false} is VALID [2022-04-27 16:18:00,213 INFO L290 TraceCheckUtils]: 9: Hoare triple {26#false} [95] L18-->L19: Formula: (= v___VERIFIER_assert_~cond_1 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[] {26#false} is VALID [2022-04-27 16:18:00,213 INFO L290 TraceCheckUtils]: 10: Hoare triple {26#false} [100] L19-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {26#false} is VALID [2022-04-27 16:18:00,214 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:18:00,214 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 16:18:00,214 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [699985666] [2022-04-27 16:18:00,215 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [699985666] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 16:18:00,215 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 16:18:00,215 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-27 16:18:00,217 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [420462343] [2022-04-27 16:18:00,217 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 16:18:00,221 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 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 11 [2022-04-27 16:18:00,223 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 16:18:00,225 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 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:18:00,238 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 11 edges. 11 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 16:18:00,239 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-27 16:18:00,239 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 16:18:00,262 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-27 16:18:00,262 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-27 16:18:00,264 INFO L87 Difference]: Start difference. First operand has 22 states, 14 states have (on average 1.5714285714285714) internal successors, (22), 15 states have internal predecessors, (22), 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 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 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:18:00,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 16:18:00,330 INFO L93 Difference]: Finished difference Result 22 states and 24 transitions. [2022-04-27 16:18:00,330 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-27 16:18:00,331 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 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 11 [2022-04-27 16:18:00,331 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 16:18:00,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 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:18:00,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 28 transitions. [2022-04-27 16:18:00,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 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:18:00,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 28 transitions. [2022-04-27 16:18:00,344 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 28 transitions. [2022-04-27 16:18:00,373 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 28 edges. 28 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 16:18:00,379 INFO L225 Difference]: With dead ends: 22 [2022-04-27 16:18:00,379 INFO L226 Difference]: Without dead ends: 15 [2022-04-27 16:18:00,381 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:18:00,385 INFO L413 NwaCegarLoop]: 23 mSDtfsCounter, 15 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 26 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:18:00,386 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 26 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 16:18:00,397 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2022-04-27 16:18:00,405 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2022-04-27 16:18:00,405 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 16:18:00,406 INFO L82 GeneralOperation]: Start isEquivalent. First operand 15 states. Second operand has 15 states, 10 states have (on average 1.3) internal successors, (13), 10 states have internal predecessors, (13), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 16:18:00,406 INFO L74 IsIncluded]: Start isIncluded. First operand 15 states. Second operand has 15 states, 10 states have (on average 1.3) internal successors, (13), 10 states have internal predecessors, (13), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 16:18:00,406 INFO L87 Difference]: Start difference. First operand 15 states. Second operand has 15 states, 10 states have (on average 1.3) internal successors, (13), 10 states have internal predecessors, (13), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 16:18:00,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 16:18:00,412 INFO L93 Difference]: Finished difference Result 15 states and 17 transitions. [2022-04-27 16:18:00,412 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 17 transitions. [2022-04-27 16:18:00,412 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 16:18:00,412 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 16:18:00,413 INFO L74 IsIncluded]: Start isIncluded. First operand has 15 states, 10 states have (on average 1.3) internal successors, (13), 10 states have internal predecessors, (13), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 15 states. [2022-04-27 16:18:00,413 INFO L87 Difference]: Start difference. First operand has 15 states, 10 states have (on average 1.3) internal successors, (13), 10 states have internal predecessors, (13), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 15 states. [2022-04-27 16:18:00,415 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 16:18:00,415 INFO L93 Difference]: Finished difference Result 15 states and 17 transitions. [2022-04-27 16:18:00,415 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 17 transitions. [2022-04-27 16:18:00,415 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 16:18:00,416 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 16:18:00,416 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 16:18:00,416 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 16:18:00,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 10 states have (on average 1.3) internal successors, (13), 10 states have internal predecessors, (13), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 16:18:00,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 17 transitions. [2022-04-27 16:18:00,424 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 17 transitions. Word has length 11 [2022-04-27 16:18:00,425 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 16:18:00,425 INFO L495 AbstractCegarLoop]: Abstraction has 15 states and 17 transitions. [2022-04-27 16:18:00,425 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 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:18:00,425 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 17 transitions. [2022-04-27 16:18:00,426 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-04-27 16:18:00,426 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 16:18:00,426 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 16:18:00,426 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-27 16:18:00,427 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 16:18:00,427 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 16:18:00,427 INFO L85 PathProgramCache]: Analyzing trace with hash 2112678981, now seen corresponding path program 1 times [2022-04-27 16:18:00,427 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 16:18:00,428 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1759244289] [2022-04-27 16:18:00,428 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 16:18:00,428 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 16:18:00,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 16:18:00,470 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 16:18:00,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 16:18:00,476 INFO L290 TraceCheckUtils]: 0: Hoare triple {106#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [80] 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] {100#true} is VALID [2022-04-27 16:18:00,476 INFO L290 TraceCheckUtils]: 1: Hoare triple {100#true} [83] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {100#true} is VALID [2022-04-27 16:18:00,477 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {100#true} {100#true} [103] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {100#true} is VALID [2022-04-27 16:18:00,477 INFO L272 TraceCheckUtils]: 0: Hoare triple {100#true} [78] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {106#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 16:18:00,477 INFO L290 TraceCheckUtils]: 1: Hoare triple {106#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [80] 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] {100#true} is VALID [2022-04-27 16:18:00,478 INFO L290 TraceCheckUtils]: 2: Hoare triple {100#true} [83] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {100#true} is VALID [2022-04-27 16:18:00,478 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {100#true} {100#true} [103] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {100#true} is VALID [2022-04-27 16:18:00,478 INFO L272 TraceCheckUtils]: 4: Hoare triple {100#true} [79] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {100#true} is VALID [2022-04-27 16:18:00,478 INFO L290 TraceCheckUtils]: 5: Hoare triple {100#true} [82] mainENTRY-->L35-3: Formula: (and (= v_main_~i~0_2 0) (= v_main_~j~0_3 (- 100)) (= v_main_~k~0_5 9)) InVars {} OutVars{main_~i~0=v_main_~i~0_2, main_~k~0=v_main_~k~0_5, main_~j~0=v_main_~j~0_3} AuxVars[] AssignedVars[main_~k~0, main_~j~0, main_~i~0] {105#(= main_~i~0 0)} is VALID [2022-04-27 16:18:00,479 INFO L290 TraceCheckUtils]: 6: Hoare triple {105#(= main_~i~0 0)} [85] L35-3-->L29-2: Formula: (not (<= v_main_~i~0_5 100)) InVars {main_~i~0=v_main_~i~0_5} OutVars{main_~i~0=v_main_~i~0_5} AuxVars[] AssignedVars[] {101#false} is VALID [2022-04-27 16:18:00,479 INFO L272 TraceCheckUtils]: 7: Hoare triple {101#false} [87] L29-2-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= v_main_~k~0_9 4) 1 0)) InVars {main_~k~0=v_main_~k~0_9} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~k~0] {101#false} is VALID [2022-04-27 16:18:00,479 INFO L290 TraceCheckUtils]: 8: Hoare triple {101#false} [92] __VERIFIER_assertENTRY-->L18: Formula: (= v___VERIFIER_assert_~cond_3 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {101#false} is VALID [2022-04-27 16:18:00,479 INFO L290 TraceCheckUtils]: 9: Hoare triple {101#false} [95] L18-->L19: Formula: (= v___VERIFIER_assert_~cond_1 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[] {101#false} is VALID [2022-04-27 16:18:00,479 INFO L290 TraceCheckUtils]: 10: Hoare triple {101#false} [100] L19-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {101#false} is VALID [2022-04-27 16:18:00,480 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:18:00,480 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 16:18:00,480 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1759244289] [2022-04-27 16:18:00,480 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1759244289] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 16:18:00,480 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 16:18:00,480 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-27 16:18:00,480 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [921112999] [2022-04-27 16:18:00,480 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 16:18:00,481 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 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 11 [2022-04-27 16:18:00,482 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 16:18:00,482 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 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:18:00,490 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 11 edges. 11 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 16:18:00,490 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-27 16:18:00,490 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 16:18:00,490 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-27 16:18:00,491 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-27 16:18:00,491 INFO L87 Difference]: Start difference. First operand 15 states and 17 transitions. Second operand has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 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:18:00,532 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 16:18:00,532 INFO L93 Difference]: Finished difference Result 16 states and 18 transitions. [2022-04-27 16:18:00,532 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-27 16:18:00,532 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 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 11 [2022-04-27 16:18:00,532 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 16:18:00,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 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:18:00,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 19 transitions. [2022-04-27 16:18:00,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 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:18:00,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 19 transitions. [2022-04-27 16:18:00,535 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 19 transitions. [2022-04-27 16:18:00,550 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 19 edges. 19 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 16:18:00,551 INFO L225 Difference]: With dead ends: 16 [2022-04-27 16:18:00,551 INFO L226 Difference]: Without dead ends: 16 [2022-04-27 16:18:00,551 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-27 16:18:00,552 INFO L413 NwaCegarLoop]: 16 mSDtfsCounter, 11 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 23 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 16:18:00,552 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 23 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 12 Invalid, 0 Unknown, 1 Unchecked, 0.0s Time] [2022-04-27 16:18:00,553 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2022-04-27 16:18:00,554 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2022-04-27 16:18:00,554 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 16:18:00,554 INFO L82 GeneralOperation]: Start isEquivalent. First operand 16 states. Second operand has 16 states, 11 states have (on average 1.2727272727272727) internal successors, (14), 11 states have internal predecessors, (14), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 16:18:00,554 INFO L74 IsIncluded]: Start isIncluded. First operand 16 states. Second operand has 16 states, 11 states have (on average 1.2727272727272727) internal successors, (14), 11 states have internal predecessors, (14), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 16:18:00,555 INFO L87 Difference]: Start difference. First operand 16 states. Second operand has 16 states, 11 states have (on average 1.2727272727272727) internal successors, (14), 11 states have internal predecessors, (14), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 16:18:00,556 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 16:18:00,556 INFO L93 Difference]: Finished difference Result 16 states and 18 transitions. [2022-04-27 16:18:00,556 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 18 transitions. [2022-04-27 16:18:00,556 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 16:18:00,556 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 16:18:00,556 INFO L74 IsIncluded]: Start isIncluded. First operand has 16 states, 11 states have (on average 1.2727272727272727) internal successors, (14), 11 states have internal predecessors, (14), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 16 states. [2022-04-27 16:18:00,557 INFO L87 Difference]: Start difference. First operand has 16 states, 11 states have (on average 1.2727272727272727) internal successors, (14), 11 states have internal predecessors, (14), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 16 states. [2022-04-27 16:18:00,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 16:18:00,557 INFO L93 Difference]: Finished difference Result 16 states and 18 transitions. [2022-04-27 16:18:00,558 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 18 transitions. [2022-04-27 16:18:00,558 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 16:18:00,558 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 16:18:00,558 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 16:18:00,558 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 16:18:00,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 11 states have (on average 1.2727272727272727) internal successors, (14), 11 states have internal predecessors, (14), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 16:18:00,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 18 transitions. [2022-04-27 16:18:00,559 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 18 transitions. Word has length 11 [2022-04-27 16:18:00,559 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 16:18:00,559 INFO L495 AbstractCegarLoop]: Abstraction has 16 states and 18 transitions. [2022-04-27 16:18:00,559 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 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:18:00,559 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 18 transitions. [2022-04-27 16:18:00,560 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-04-27 16:18:00,560 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 16:18:00,560 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 16:18:00,560 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-27 16:18:00,560 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 16:18:00,560 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 16:18:00,561 INFO L85 PathProgramCache]: Analyzing trace with hash 1187274909, now seen corresponding path program 1 times [2022-04-27 16:18:00,561 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 16:18:00,561 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [526782529] [2022-04-27 16:18:00,561 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 16:18:00,561 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 16:18:00,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 16:18:00,592 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 16:18:00,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 16:18:00,597 INFO L290 TraceCheckUtils]: 0: Hoare triple {181#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [80] 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] {175#true} is VALID [2022-04-27 16:18:00,598 INFO L290 TraceCheckUtils]: 1: Hoare triple {175#true} [83] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {175#true} is VALID [2022-04-27 16:18:00,598 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {175#true} {175#true} [103] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {175#true} is VALID [2022-04-27 16:18:00,599 INFO L272 TraceCheckUtils]: 0: Hoare triple {175#true} [78] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {181#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 16:18:00,599 INFO L290 TraceCheckUtils]: 1: Hoare triple {181#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [80] 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] {175#true} is VALID [2022-04-27 16:18:00,599 INFO L290 TraceCheckUtils]: 2: Hoare triple {175#true} [83] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {175#true} is VALID [2022-04-27 16:18:00,599 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {175#true} {175#true} [103] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {175#true} is VALID [2022-04-27 16:18:00,599 INFO L272 TraceCheckUtils]: 4: Hoare triple {175#true} [79] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {175#true} is VALID [2022-04-27 16:18:00,600 INFO L290 TraceCheckUtils]: 5: Hoare triple {175#true} [82] mainENTRY-->L35-3: Formula: (and (= v_main_~i~0_2 0) (= v_main_~j~0_3 (- 100)) (= v_main_~k~0_5 9)) InVars {} OutVars{main_~i~0=v_main_~i~0_2, main_~k~0=v_main_~k~0_5, main_~j~0=v_main_~j~0_3} AuxVars[] AssignedVars[main_~k~0, main_~j~0, main_~i~0] {180#(<= (+ main_~j~0 100) 0)} is VALID [2022-04-27 16:18:00,600 INFO L290 TraceCheckUtils]: 6: Hoare triple {180#(<= (+ main_~j~0 100) 0)} [86] L35-3-->L31-2: Formula: (and (<= v_main_~i~0_7 100) (= v_main_~i~0_6 (+ v_main_~i~0_7 1))) InVars {main_~i~0=v_main_~i~0_7} OutVars{main_~i~0=v_main_~i~0_6} AuxVars[] AssignedVars[main_~i~0] {180#(<= (+ main_~j~0 100) 0)} is VALID [2022-04-27 16:18:00,601 INFO L290 TraceCheckUtils]: 7: Hoare triple {180#(<= (+ main_~j~0 100) 0)} [89] L31-2-->L31-3: Formula: (not (< v_main_~j~0_6 20)) InVars {main_~j~0=v_main_~j~0_6} OutVars{main_~j~0=v_main_~j~0_6} AuxVars[] AssignedVars[] {176#false} is VALID [2022-04-27 16:18:00,601 INFO L290 TraceCheckUtils]: 8: Hoare triple {176#false} [93] L31-3-->L35-2: Formula: (= v_main_~k~0_1 4) InVars {} OutVars{main_~k~0=v_main_~k~0_1} AuxVars[] AssignedVars[main_~k~0] {176#false} is VALID [2022-04-27 16:18:00,601 INFO L290 TraceCheckUtils]: 9: Hoare triple {176#false} [98] L35-2-->L35-3: Formula: (not (<= v_main_~k~0_2 3)) InVars {main_~k~0=v_main_~k~0_2} OutVars{main_~k~0=v_main_~k~0_2} AuxVars[] AssignedVars[] {176#false} is VALID [2022-04-27 16:18:00,601 INFO L290 TraceCheckUtils]: 10: Hoare triple {176#false} [85] L35-3-->L29-2: Formula: (not (<= v_main_~i~0_5 100)) InVars {main_~i~0=v_main_~i~0_5} OutVars{main_~i~0=v_main_~i~0_5} AuxVars[] AssignedVars[] {176#false} is VALID [2022-04-27 16:18:00,601 INFO L272 TraceCheckUtils]: 11: Hoare triple {176#false} [87] L29-2-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= v_main_~k~0_9 4) 1 0)) InVars {main_~k~0=v_main_~k~0_9} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~k~0] {176#false} is VALID [2022-04-27 16:18:00,602 INFO L290 TraceCheckUtils]: 12: Hoare triple {176#false} [92] __VERIFIER_assertENTRY-->L18: Formula: (= v___VERIFIER_assert_~cond_3 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {176#false} is VALID [2022-04-27 16:18:00,602 INFO L290 TraceCheckUtils]: 13: Hoare triple {176#false} [95] L18-->L19: Formula: (= v___VERIFIER_assert_~cond_1 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[] {176#false} is VALID [2022-04-27 16:18:00,602 INFO L290 TraceCheckUtils]: 14: Hoare triple {176#false} [100] L19-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {176#false} is VALID [2022-04-27 16:18:00,602 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 16:18:00,603 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 16:18:00,603 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [526782529] [2022-04-27 16:18:00,603 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [526782529] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 16:18:00,603 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 16:18:00,603 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-27 16:18:00,603 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [876673701] [2022-04-27 16:18:00,604 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 16:18:00,604 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 states have internal predecessors, (11), 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 15 [2022-04-27 16:18:00,604 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 16:18:00,605 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 states have internal predecessors, (11), 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:18:00,617 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 15 edges. 15 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 16:18:00,618 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-27 16:18:00,618 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 16:18:00,618 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-27 16:18:00,618 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-27 16:18:00,619 INFO L87 Difference]: Start difference. First operand 16 states and 18 transitions. Second operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 states have internal predecessors, (11), 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:18:00,675 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 16:18:00,675 INFO L93 Difference]: Finished difference Result 18 states and 21 transitions. [2022-04-27 16:18:00,675 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-27 16:18:00,676 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 states have internal predecessors, (11), 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 15 [2022-04-27 16:18:00,676 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 16:18:00,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 states have internal predecessors, (11), 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:18:00,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 22 transitions. [2022-04-27 16:18:00,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 states have internal predecessors, (11), 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:18:00,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 22 transitions. [2022-04-27 16:18:00,678 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 22 transitions. [2022-04-27 16:18:00,704 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:18:00,705 INFO L225 Difference]: With dead ends: 18 [2022-04-27 16:18:00,705 INFO L226 Difference]: Without dead ends: 18 [2022-04-27 16:18:00,705 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-27 16:18:00,709 INFO L413 NwaCegarLoop]: 17 mSDtfsCounter, 10 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 24 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 16:18:00,710 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 24 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 12 Invalid, 0 Unknown, 1 Unchecked, 0.0s Time] [2022-04-27 16:18:00,710 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2022-04-27 16:18:00,712 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 17. [2022-04-27 16:18:00,712 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 16:18:00,713 INFO L82 GeneralOperation]: Start isEquivalent. First operand 18 states. Second operand has 17 states, 12 states have (on average 1.25) internal successors, (15), 12 states have internal predecessors, (15), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 16:18:00,713 INFO L74 IsIncluded]: Start isIncluded. First operand 18 states. Second operand has 17 states, 12 states have (on average 1.25) internal successors, (15), 12 states have internal predecessors, (15), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 16:18:00,714 INFO L87 Difference]: Start difference. First operand 18 states. Second operand has 17 states, 12 states have (on average 1.25) internal successors, (15), 12 states have internal predecessors, (15), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 16:18:00,716 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 16:18:00,716 INFO L93 Difference]: Finished difference Result 18 states and 21 transitions. [2022-04-27 16:18:00,716 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 21 transitions. [2022-04-27 16:18:00,717 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 16:18:00,717 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 16:18:00,718 INFO L74 IsIncluded]: Start isIncluded. First operand has 17 states, 12 states have (on average 1.25) internal successors, (15), 12 states have internal predecessors, (15), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 18 states. [2022-04-27 16:18:00,718 INFO L87 Difference]: Start difference. First operand has 17 states, 12 states have (on average 1.25) internal successors, (15), 12 states have internal predecessors, (15), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 18 states. [2022-04-27 16:18:00,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 16:18:00,720 INFO L93 Difference]: Finished difference Result 18 states and 21 transitions. [2022-04-27 16:18:00,720 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 21 transitions. [2022-04-27 16:18:00,720 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 16:18:00,720 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 16:18:00,720 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 16:18:00,720 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 16:18:00,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 12 states have (on average 1.25) internal successors, (15), 12 states have internal predecessors, (15), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 16:18:00,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 19 transitions. [2022-04-27 16:18:00,722 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 19 transitions. Word has length 15 [2022-04-27 16:18:00,722 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 16:18:00,722 INFO L495 AbstractCegarLoop]: Abstraction has 17 states and 19 transitions. [2022-04-27 16:18:00,722 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 states have internal predecessors, (11), 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:18:00,722 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 19 transitions. [2022-04-27 16:18:00,723 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-04-27 16:18:00,723 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 16:18:00,723 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 16:18:00,723 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-04-27 16:18:00,723 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 16:18:00,724 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 16:18:00,724 INFO L85 PathProgramCache]: Analyzing trace with hash -1810315777, now seen corresponding path program 1 times [2022-04-27 16:18:00,724 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 16:18:00,724 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [521397625] [2022-04-27 16:18:00,724 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 16:18:00,724 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 16:18:00,740 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 16:18:00,740 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [522505635] [2022-04-27 16:18:00,740 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 16:18:00,740 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 16:18:00,740 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 16:18:00,742 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:18:00,763 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:18:00,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 16:18:00,791 INFO L263 TraceCheckSpWp]: Trace formula consists of 59 conjuncts, 3 conjunts are in the unsatisfiable core [2022-04-27 16:18:00,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 16:18:00,811 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 16:18:00,869 INFO L272 TraceCheckUtils]: 0: Hoare triple {257#true} [78] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {257#true} is VALID [2022-04-27 16:18:00,869 INFO L290 TraceCheckUtils]: 1: Hoare triple {257#true} [80] 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] {257#true} is VALID [2022-04-27 16:18:00,869 INFO L290 TraceCheckUtils]: 2: Hoare triple {257#true} [83] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {257#true} is VALID [2022-04-27 16:18:00,870 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {257#true} {257#true} [103] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {257#true} is VALID [2022-04-27 16:18:00,870 INFO L272 TraceCheckUtils]: 4: Hoare triple {257#true} [79] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {257#true} is VALID [2022-04-27 16:18:00,870 INFO L290 TraceCheckUtils]: 5: Hoare triple {257#true} [82] mainENTRY-->L35-3: Formula: (and (= v_main_~i~0_2 0) (= v_main_~j~0_3 (- 100)) (= v_main_~k~0_5 9)) InVars {} OutVars{main_~i~0=v_main_~i~0_2, main_~k~0=v_main_~k~0_5, main_~j~0=v_main_~j~0_3} AuxVars[] AssignedVars[main_~k~0, main_~j~0, main_~i~0] {277#(<= main_~i~0 0)} is VALID [2022-04-27 16:18:00,871 INFO L290 TraceCheckUtils]: 6: Hoare triple {277#(<= main_~i~0 0)} [86] L35-3-->L31-2: Formula: (and (<= v_main_~i~0_7 100) (= v_main_~i~0_6 (+ v_main_~i~0_7 1))) InVars {main_~i~0=v_main_~i~0_7} OutVars{main_~i~0=v_main_~i~0_6} AuxVars[] AssignedVars[main_~i~0] {281#(<= main_~i~0 1)} is VALID [2022-04-27 16:18:00,871 INFO L290 TraceCheckUtils]: 7: Hoare triple {281#(<= main_~i~0 1)} [90] L31-2-->L31-2: Formula: (let ((.cse1 (= v_main_~j~0_2 v_main_~j~0_1))) (or (and (< v_main_~j~0_2 20) (let ((.cse0 (= v_main_~i~0_1 0))) (or (and .cse0 .cse1) (let ((.cse2 (+ v_main_~j~0_1 (* (- 1) v_main_~j~0_2)))) (and (= (mod .cse2 v_main_~i~0_1) 0) (not .cse0) (< 0 (div .cse2 v_main_~i~0_1)) (forall ((v_it_1 Int)) (or (not (<= 1 v_it_1)) (not (<= (+ v_it_1 1) (div (+ v_main_~j~0_1 (* (- 1) v_main_~j~0_2)) v_main_~i~0_1))) (< (+ v_main_~j~0_2 (* v_main_~i~0_1 v_it_1)) 20)))))))) (and .cse1 (<= 20 v_main_~j~0_2)))) InVars {main_~i~0=v_main_~i~0_1, main_~j~0=v_main_~j~0_2} OutVars{main_~i~0=v_main_~i~0_1, main_~j~0=v_main_~j~0_1} AuxVars[] AssignedVars[main_~j~0] {281#(<= main_~i~0 1)} is VALID [2022-04-27 16:18:00,881 INFO L290 TraceCheckUtils]: 8: Hoare triple {281#(<= main_~i~0 1)} [89] L31-2-->L31-3: Formula: (not (< v_main_~j~0_6 20)) InVars {main_~j~0=v_main_~j~0_6} OutVars{main_~j~0=v_main_~j~0_6} AuxVars[] AssignedVars[] {281#(<= main_~i~0 1)} is VALID [2022-04-27 16:18:00,881 INFO L290 TraceCheckUtils]: 9: Hoare triple {281#(<= main_~i~0 1)} [93] L31-3-->L35-2: Formula: (= v_main_~k~0_1 4) InVars {} OutVars{main_~k~0=v_main_~k~0_1} AuxVars[] AssignedVars[main_~k~0] {281#(<= main_~i~0 1)} is VALID [2022-04-27 16:18:00,882 INFO L290 TraceCheckUtils]: 10: Hoare triple {281#(<= main_~i~0 1)} [98] L35-2-->L35-3: Formula: (not (<= v_main_~k~0_2 3)) InVars {main_~k~0=v_main_~k~0_2} OutVars{main_~k~0=v_main_~k~0_2} AuxVars[] AssignedVars[] {281#(<= main_~i~0 1)} is VALID [2022-04-27 16:18:00,882 INFO L290 TraceCheckUtils]: 11: Hoare triple {281#(<= main_~i~0 1)} [85] L35-3-->L29-2: Formula: (not (<= v_main_~i~0_5 100)) InVars {main_~i~0=v_main_~i~0_5} OutVars{main_~i~0=v_main_~i~0_5} AuxVars[] AssignedVars[] {258#false} is VALID [2022-04-27 16:18:00,882 INFO L272 TraceCheckUtils]: 12: Hoare triple {258#false} [87] L29-2-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= v_main_~k~0_9 4) 1 0)) InVars {main_~k~0=v_main_~k~0_9} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~k~0] {258#false} is VALID [2022-04-27 16:18:00,882 INFO L290 TraceCheckUtils]: 13: Hoare triple {258#false} [92] __VERIFIER_assertENTRY-->L18: Formula: (= v___VERIFIER_assert_~cond_3 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {258#false} is VALID [2022-04-27 16:18:00,883 INFO L290 TraceCheckUtils]: 14: Hoare triple {258#false} [95] L18-->L19: Formula: (= v___VERIFIER_assert_~cond_1 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[] {258#false} is VALID [2022-04-27 16:18:00,883 INFO L290 TraceCheckUtils]: 15: Hoare triple {258#false} [100] L19-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {258#false} is VALID [2022-04-27 16:18:00,883 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-27 16:18:00,883 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 16:18:00,955 INFO L290 TraceCheckUtils]: 15: Hoare triple {258#false} [100] L19-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {258#false} is VALID [2022-04-27 16:18:00,956 INFO L290 TraceCheckUtils]: 14: Hoare triple {258#false} [95] L18-->L19: Formula: (= v___VERIFIER_assert_~cond_1 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[] {258#false} is VALID [2022-04-27 16:18:00,956 INFO L290 TraceCheckUtils]: 13: Hoare triple {258#false} [92] __VERIFIER_assertENTRY-->L18: Formula: (= v___VERIFIER_assert_~cond_3 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {258#false} is VALID [2022-04-27 16:18:00,956 INFO L272 TraceCheckUtils]: 12: Hoare triple {258#false} [87] L29-2-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= v_main_~k~0_9 4) 1 0)) InVars {main_~k~0=v_main_~k~0_9} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~k~0] {258#false} is VALID [2022-04-27 16:18:00,956 INFO L290 TraceCheckUtils]: 11: Hoare triple {321#(<= main_~i~0 100)} [85] L35-3-->L29-2: Formula: (not (<= v_main_~i~0_5 100)) InVars {main_~i~0=v_main_~i~0_5} OutVars{main_~i~0=v_main_~i~0_5} AuxVars[] AssignedVars[] {258#false} is VALID [2022-04-27 16:18:00,957 INFO L290 TraceCheckUtils]: 10: Hoare triple {321#(<= main_~i~0 100)} [98] L35-2-->L35-3: Formula: (not (<= v_main_~k~0_2 3)) InVars {main_~k~0=v_main_~k~0_2} OutVars{main_~k~0=v_main_~k~0_2} AuxVars[] AssignedVars[] {321#(<= main_~i~0 100)} is VALID [2022-04-27 16:18:00,957 INFO L290 TraceCheckUtils]: 9: Hoare triple {321#(<= main_~i~0 100)} [93] L31-3-->L35-2: Formula: (= v_main_~k~0_1 4) InVars {} OutVars{main_~k~0=v_main_~k~0_1} AuxVars[] AssignedVars[main_~k~0] {321#(<= main_~i~0 100)} is VALID [2022-04-27 16:18:00,958 INFO L290 TraceCheckUtils]: 8: Hoare triple {321#(<= main_~i~0 100)} [89] L31-2-->L31-3: Formula: (not (< v_main_~j~0_6 20)) InVars {main_~j~0=v_main_~j~0_6} OutVars{main_~j~0=v_main_~j~0_6} AuxVars[] AssignedVars[] {321#(<= main_~i~0 100)} is VALID [2022-04-27 16:18:00,958 INFO L290 TraceCheckUtils]: 7: Hoare triple {321#(<= main_~i~0 100)} [90] L31-2-->L31-2: Formula: (let ((.cse1 (= v_main_~j~0_2 v_main_~j~0_1))) (or (and (< v_main_~j~0_2 20) (let ((.cse0 (= v_main_~i~0_1 0))) (or (and .cse0 .cse1) (let ((.cse2 (+ v_main_~j~0_1 (* (- 1) v_main_~j~0_2)))) (and (= (mod .cse2 v_main_~i~0_1) 0) (not .cse0) (< 0 (div .cse2 v_main_~i~0_1)) (forall ((v_it_1 Int)) (or (not (<= 1 v_it_1)) (not (<= (+ v_it_1 1) (div (+ v_main_~j~0_1 (* (- 1) v_main_~j~0_2)) v_main_~i~0_1))) (< (+ v_main_~j~0_2 (* v_main_~i~0_1 v_it_1)) 20)))))))) (and .cse1 (<= 20 v_main_~j~0_2)))) InVars {main_~i~0=v_main_~i~0_1, main_~j~0=v_main_~j~0_2} OutVars{main_~i~0=v_main_~i~0_1, main_~j~0=v_main_~j~0_1} AuxVars[] AssignedVars[main_~j~0] {321#(<= main_~i~0 100)} is VALID [2022-04-27 16:18:00,959 INFO L290 TraceCheckUtils]: 6: Hoare triple {337#(<= main_~i~0 99)} [86] L35-3-->L31-2: Formula: (and (<= v_main_~i~0_7 100) (= v_main_~i~0_6 (+ v_main_~i~0_7 1))) InVars {main_~i~0=v_main_~i~0_7} OutVars{main_~i~0=v_main_~i~0_6} AuxVars[] AssignedVars[main_~i~0] {321#(<= main_~i~0 100)} is VALID [2022-04-27 16:18:00,960 INFO L290 TraceCheckUtils]: 5: Hoare triple {257#true} [82] mainENTRY-->L35-3: Formula: (and (= v_main_~i~0_2 0) (= v_main_~j~0_3 (- 100)) (= v_main_~k~0_5 9)) InVars {} OutVars{main_~i~0=v_main_~i~0_2, main_~k~0=v_main_~k~0_5, main_~j~0=v_main_~j~0_3} AuxVars[] AssignedVars[main_~k~0, main_~j~0, main_~i~0] {337#(<= main_~i~0 99)} is VALID [2022-04-27 16:18:00,960 INFO L272 TraceCheckUtils]: 4: Hoare triple {257#true} [79] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {257#true} is VALID [2022-04-27 16:18:00,962 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {257#true} {257#true} [103] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {257#true} is VALID [2022-04-27 16:18:00,962 INFO L290 TraceCheckUtils]: 2: Hoare triple {257#true} [83] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {257#true} is VALID [2022-04-27 16:18:00,962 INFO L290 TraceCheckUtils]: 1: Hoare triple {257#true} [80] 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] {257#true} is VALID [2022-04-27 16:18:00,962 INFO L272 TraceCheckUtils]: 0: Hoare triple {257#true} [78] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {257#true} is VALID [2022-04-27 16:18:00,963 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-27 16:18:00,963 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 16:18:00,963 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [521397625] [2022-04-27 16:18:00,963 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 16:18:00,963 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [522505635] [2022-04-27 16:18:00,964 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [522505635] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 16:18:00,964 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-27 16:18:00,964 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2022-04-27 16:18:00,964 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1863612514] [2022-04-27 16:18:00,964 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-27 16:18:00,965 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 states have internal predecessors, (19), 2 states have call successors, (3), 2 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 16 [2022-04-27 16:18:00,965 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 16:18:00,965 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 states have internal predecessors, (19), 2 states have call successors, (3), 2 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:18:00,982 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 23 edges. 23 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 16:18:00,982 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-27 16:18:00,982 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 16:18:00,983 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-27 16:18:00,984 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-04-27 16:18:00,984 INFO L87 Difference]: Start difference. First operand 17 states and 19 transitions. Second operand has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 states have internal predecessors, (19), 2 states have call successors, (3), 2 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:18:01,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 16:18:01,030 INFO L93 Difference]: Finished difference Result 29 states and 37 transitions. [2022-04-27 16:18:01,030 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-27 16:18:01,030 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 states have internal predecessors, (19), 2 states have call successors, (3), 2 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 16 [2022-04-27 16:18:01,030 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 16:18:01,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 states have internal predecessors, (19), 2 states have call successors, (3), 2 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:18:01,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 39 transitions. [2022-04-27 16:18:01,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 states have internal predecessors, (19), 2 states have call successors, (3), 2 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:18:01,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 39 transitions. [2022-04-27 16:18:01,033 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 39 transitions. [2022-04-27 16:18:01,068 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 39 edges. 39 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 16:18:01,069 INFO L225 Difference]: With dead ends: 29 [2022-04-27 16:18:01,069 INFO L226 Difference]: Without dead ends: 29 [2022-04-27 16:18:01,070 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-04-27 16:18:01,070 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 9 mSDsluCounter, 43 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 58 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 16:18:01,070 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 58 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 8 Invalid, 0 Unknown, 1 Unchecked, 0.0s Time] [2022-04-27 16:18:01,071 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2022-04-27 16:18:01,072 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2022-04-27 16:18:01,072 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 16:18:01,072 INFO L82 GeneralOperation]: Start isEquivalent. First operand 29 states. Second operand has 29 states, 24 states have (on average 1.375) internal successors, (33), 24 states have internal predecessors, (33), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 16:18:01,073 INFO L74 IsIncluded]: Start isIncluded. First operand 29 states. Second operand has 29 states, 24 states have (on average 1.375) internal successors, (33), 24 states have internal predecessors, (33), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 16:18:01,073 INFO L87 Difference]: Start difference. First operand 29 states. Second operand has 29 states, 24 states have (on average 1.375) internal successors, (33), 24 states have internal predecessors, (33), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 16:18:01,074 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 16:18:01,074 INFO L93 Difference]: Finished difference Result 29 states and 37 transitions. [2022-04-27 16:18:01,074 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 37 transitions. [2022-04-27 16:18:01,074 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 16:18:01,074 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 16:18:01,074 INFO L74 IsIncluded]: Start isIncluded. First operand has 29 states, 24 states have (on average 1.375) internal successors, (33), 24 states have internal predecessors, (33), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 29 states. [2022-04-27 16:18:01,074 INFO L87 Difference]: Start difference. First operand has 29 states, 24 states have (on average 1.375) internal successors, (33), 24 states have internal predecessors, (33), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 29 states. [2022-04-27 16:18:01,075 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 16:18:01,075 INFO L93 Difference]: Finished difference Result 29 states and 37 transitions. [2022-04-27 16:18:01,075 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 37 transitions. [2022-04-27 16:18:01,076 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 16:18:01,076 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 16:18:01,076 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 16:18:01,076 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 16:18:01,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 24 states have (on average 1.375) internal successors, (33), 24 states have internal predecessors, (33), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 16:18:01,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 37 transitions. [2022-04-27 16:18:01,077 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 37 transitions. Word has length 16 [2022-04-27 16:18:01,077 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 16:18:01,077 INFO L495 AbstractCegarLoop]: Abstraction has 29 states and 37 transitions. [2022-04-27 16:18:01,077 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 states have internal predecessors, (19), 2 states have call successors, (3), 2 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:18:01,077 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 37 transitions. [2022-04-27 16:18:01,078 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-04-27 16:18:01,078 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 16:18:01,078 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 16:18:01,098 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-04-27 16:18:01,291 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 16:18:01,292 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 16:18:01,292 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 16:18:01,292 INFO L85 PathProgramCache]: Analyzing trace with hash -1274198819, now seen corresponding path program 2 times [2022-04-27 16:18:01,292 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 16:18:01,292 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2602731] [2022-04-27 16:18:01,292 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 16:18:01,292 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 16:18:01,312 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 16:18:01,313 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [600701774] [2022-04-27 16:18:01,313 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-27 16:18:01,313 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 16:18:01,313 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 16:18:01,315 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-27 16:18:01,316 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-04-27 16:18:01,361 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-27 16:18:01,361 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-27 16:18:01,362 INFO L263 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 5 conjunts are in the unsatisfiable core [2022-04-27 16:18:01,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 16:18:01,369 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 16:18:01,460 INFO L272 TraceCheckUtils]: 0: Hoare triple {474#true} [78] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {474#true} is VALID [2022-04-27 16:18:01,461 INFO L290 TraceCheckUtils]: 1: Hoare triple {474#true} [80] 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] {474#true} is VALID [2022-04-27 16:18:01,461 INFO L290 TraceCheckUtils]: 2: Hoare triple {474#true} [83] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {474#true} is VALID [2022-04-27 16:18:01,461 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {474#true} {474#true} [103] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {474#true} is VALID [2022-04-27 16:18:01,461 INFO L272 TraceCheckUtils]: 4: Hoare triple {474#true} [79] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {474#true} is VALID [2022-04-27 16:18:01,461 INFO L290 TraceCheckUtils]: 5: Hoare triple {474#true} [82] mainENTRY-->L35-3: Formula: (and (= v_main_~i~0_2 0) (= v_main_~j~0_3 (- 100)) (= v_main_~k~0_5 9)) InVars {} OutVars{main_~i~0=v_main_~i~0_2, main_~k~0=v_main_~k~0_5, main_~j~0=v_main_~j~0_3} AuxVars[] AssignedVars[main_~k~0, main_~j~0, main_~i~0] {474#true} is VALID [2022-04-27 16:18:01,461 INFO L290 TraceCheckUtils]: 6: Hoare triple {474#true} [86] L35-3-->L31-2: Formula: (and (<= v_main_~i~0_7 100) (= v_main_~i~0_6 (+ v_main_~i~0_7 1))) InVars {main_~i~0=v_main_~i~0_7} OutVars{main_~i~0=v_main_~i~0_6} AuxVars[] AssignedVars[main_~i~0] {474#true} is VALID [2022-04-27 16:18:01,461 INFO L290 TraceCheckUtils]: 7: Hoare triple {474#true} [90] L31-2-->L31-2: Formula: (let ((.cse1 (= v_main_~j~0_2 v_main_~j~0_1))) (or (and (< v_main_~j~0_2 20) (let ((.cse0 (= v_main_~i~0_1 0))) (or (and .cse0 .cse1) (let ((.cse2 (+ v_main_~j~0_1 (* (- 1) v_main_~j~0_2)))) (and (= (mod .cse2 v_main_~i~0_1) 0) (not .cse0) (< 0 (div .cse2 v_main_~i~0_1)) (forall ((v_it_1 Int)) (or (not (<= 1 v_it_1)) (not (<= (+ v_it_1 1) (div (+ v_main_~j~0_1 (* (- 1) v_main_~j~0_2)) v_main_~i~0_1))) (< (+ v_main_~j~0_2 (* v_main_~i~0_1 v_it_1)) 20)))))))) (and .cse1 (<= 20 v_main_~j~0_2)))) InVars {main_~i~0=v_main_~i~0_1, main_~j~0=v_main_~j~0_2} OutVars{main_~i~0=v_main_~i~0_1, main_~j~0=v_main_~j~0_1} AuxVars[] AssignedVars[main_~j~0] {474#true} is VALID [2022-04-27 16:18:01,462 INFO L290 TraceCheckUtils]: 8: Hoare triple {474#true} [89] L31-2-->L31-3: Formula: (not (< v_main_~j~0_6 20)) InVars {main_~j~0=v_main_~j~0_6} OutVars{main_~j~0=v_main_~j~0_6} AuxVars[] AssignedVars[] {474#true} is VALID [2022-04-27 16:18:01,462 INFO L290 TraceCheckUtils]: 9: Hoare triple {474#true} [93] L31-3-->L35-2: Formula: (= v_main_~k~0_1 4) InVars {} OutVars{main_~k~0=v_main_~k~0_1} AuxVars[] AssignedVars[main_~k~0] {474#true} is VALID [2022-04-27 16:18:01,462 INFO L290 TraceCheckUtils]: 10: Hoare triple {474#true} [98] L35-2-->L35-3: Formula: (not (<= v_main_~k~0_2 3)) InVars {main_~k~0=v_main_~k~0_2} OutVars{main_~k~0=v_main_~k~0_2} AuxVars[] AssignedVars[] {474#true} is VALID [2022-04-27 16:18:01,462 INFO L290 TraceCheckUtils]: 11: Hoare triple {474#true} [86] L35-3-->L31-2: Formula: (and (<= v_main_~i~0_7 100) (= v_main_~i~0_6 (+ v_main_~i~0_7 1))) InVars {main_~i~0=v_main_~i~0_7} OutVars{main_~i~0=v_main_~i~0_6} AuxVars[] AssignedVars[main_~i~0] {474#true} is VALID [2022-04-27 16:18:01,462 INFO L290 TraceCheckUtils]: 12: Hoare triple {474#true} [90] L31-2-->L31-2: Formula: (let ((.cse1 (= v_main_~j~0_2 v_main_~j~0_1))) (or (and (< v_main_~j~0_2 20) (let ((.cse0 (= v_main_~i~0_1 0))) (or (and .cse0 .cse1) (let ((.cse2 (+ v_main_~j~0_1 (* (- 1) v_main_~j~0_2)))) (and (= (mod .cse2 v_main_~i~0_1) 0) (not .cse0) (< 0 (div .cse2 v_main_~i~0_1)) (forall ((v_it_1 Int)) (or (not (<= 1 v_it_1)) (not (<= (+ v_it_1 1) (div (+ v_main_~j~0_1 (* (- 1) v_main_~j~0_2)) v_main_~i~0_1))) (< (+ v_main_~j~0_2 (* v_main_~i~0_1 v_it_1)) 20)))))))) (and .cse1 (<= 20 v_main_~j~0_2)))) InVars {main_~i~0=v_main_~i~0_1, main_~j~0=v_main_~j~0_2} OutVars{main_~i~0=v_main_~i~0_1, main_~j~0=v_main_~j~0_1} AuxVars[] AssignedVars[main_~j~0] {474#true} is VALID [2022-04-27 16:18:01,462 INFO L290 TraceCheckUtils]: 13: Hoare triple {474#true} [89] L31-2-->L31-3: Formula: (not (< v_main_~j~0_6 20)) InVars {main_~j~0=v_main_~j~0_6} OutVars{main_~j~0=v_main_~j~0_6} AuxVars[] AssignedVars[] {474#true} is VALID [2022-04-27 16:18:01,462 INFO L290 TraceCheckUtils]: 14: Hoare triple {474#true} [93] L31-3-->L35-2: Formula: (= v_main_~k~0_1 4) InVars {} OutVars{main_~k~0=v_main_~k~0_1} AuxVars[] AssignedVars[main_~k~0] {474#true} is VALID [2022-04-27 16:18:01,462 INFO L290 TraceCheckUtils]: 15: Hoare triple {474#true} [98] L35-2-->L35-3: Formula: (not (<= v_main_~k~0_2 3)) InVars {main_~k~0=v_main_~k~0_2} OutVars{main_~k~0=v_main_~k~0_2} AuxVars[] AssignedVars[] {474#true} is VALID [2022-04-27 16:18:01,463 INFO L290 TraceCheckUtils]: 16: Hoare triple {474#true} [86] L35-3-->L31-2: Formula: (and (<= v_main_~i~0_7 100) (= v_main_~i~0_6 (+ v_main_~i~0_7 1))) InVars {main_~i~0=v_main_~i~0_7} OutVars{main_~i~0=v_main_~i~0_6} AuxVars[] AssignedVars[main_~i~0] {474#true} is VALID [2022-04-27 16:18:01,463 INFO L290 TraceCheckUtils]: 17: Hoare triple {474#true} [89] L31-2-->L31-3: Formula: (not (< v_main_~j~0_6 20)) InVars {main_~j~0=v_main_~j~0_6} OutVars{main_~j~0=v_main_~j~0_6} AuxVars[] AssignedVars[] {474#true} is VALID [2022-04-27 16:18:01,463 INFO L290 TraceCheckUtils]: 18: Hoare triple {474#true} [93] L31-3-->L35-2: Formula: (= v_main_~k~0_1 4) InVars {} OutVars{main_~k~0=v_main_~k~0_1} AuxVars[] AssignedVars[main_~k~0] {533#(= main_~k~0 4)} is VALID [2022-04-27 16:18:01,464 INFO L290 TraceCheckUtils]: 19: Hoare triple {533#(= main_~k~0 4)} [98] L35-2-->L35-3: Formula: (not (<= v_main_~k~0_2 3)) InVars {main_~k~0=v_main_~k~0_2} OutVars{main_~k~0=v_main_~k~0_2} AuxVars[] AssignedVars[] {533#(= main_~k~0 4)} is VALID [2022-04-27 16:18:01,464 INFO L290 TraceCheckUtils]: 20: Hoare triple {533#(= main_~k~0 4)} [85] L35-3-->L29-2: Formula: (not (<= v_main_~i~0_5 100)) InVars {main_~i~0=v_main_~i~0_5} OutVars{main_~i~0=v_main_~i~0_5} AuxVars[] AssignedVars[] {533#(= main_~k~0 4)} is VALID [2022-04-27 16:18:01,465 INFO L272 TraceCheckUtils]: 21: Hoare triple {533#(= main_~k~0 4)} [87] L29-2-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= v_main_~k~0_9 4) 1 0)) InVars {main_~k~0=v_main_~k~0_9} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~k~0] {543#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 16:18:01,465 INFO L290 TraceCheckUtils]: 22: Hoare triple {543#(<= 1 |__VERIFIER_assert_#in~cond|)} [92] __VERIFIER_assertENTRY-->L18: Formula: (= v___VERIFIER_assert_~cond_3 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {547#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 16:18:01,465 INFO L290 TraceCheckUtils]: 23: Hoare triple {547#(<= 1 __VERIFIER_assert_~cond)} [95] L18-->L19: Formula: (= v___VERIFIER_assert_~cond_1 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[] {475#false} is VALID [2022-04-27 16:18:01,466 INFO L290 TraceCheckUtils]: 24: Hoare triple {475#false} [100] L19-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {475#false} is VALID [2022-04-27 16:18:01,466 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2022-04-27 16:18:01,466 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-27 16:18:01,466 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 16:18:01,466 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2602731] [2022-04-27 16:18:01,466 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 16:18:01,466 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [600701774] [2022-04-27 16:18:01,466 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [600701774] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 16:18:01,466 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 16:18:01,466 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-27 16:18:01,467 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2092991859] [2022-04-27 16:18:01,467 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 16:18:01,467 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (3), 2 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 25 [2022-04-27 16:18:01,467 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 16:18:01,467 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (3), 2 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:18:01,481 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 18 edges. 18 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 16:18:01,482 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-27 16:18:01,482 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 16:18:01,482 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-27 16:18:01,482 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-27 16:18:01,482 INFO L87 Difference]: Start difference. First operand 29 states and 37 transitions. Second operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (3), 2 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:18:01,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 16:18:01,547 INFO L93 Difference]: Finished difference Result 27 states and 35 transitions. [2022-04-27 16:18:01,547 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-27 16:18:01,547 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (3), 2 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 25 [2022-04-27 16:18:01,548 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 16:18:01,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (3), 2 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:18:01,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 20 transitions. [2022-04-27 16:18:01,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (3), 2 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:18:01,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 20 transitions. [2022-04-27 16:18:01,552 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 20 transitions. [2022-04-27 16:18:01,566 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 20 edges. 20 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 16:18:01,566 INFO L225 Difference]: With dead ends: 27 [2022-04-27 16:18:01,566 INFO L226 Difference]: Without dead ends: 0 [2022-04-27 16:18:01,566 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-27 16:18:01,567 INFO L413 NwaCegarLoop]: 16 mSDtfsCounter, 4 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 54 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 16:18:01,567 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 54 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 16:18:01,568 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-04-27 16:18:01,568 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-04-27 16:18:01,568 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 16:18:01,568 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:18:01,568 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:18:01,568 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:18:01,568 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 16:18:01,568 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-27 16:18:01,568 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-27 16:18:01,568 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 16:18:01,568 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 16:18:01,568 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:18:01,568 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:18:01,568 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 16:18:01,568 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-27 16:18:01,568 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-27 16:18:01,569 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 16:18:01,569 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 16:18:01,569 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 16:18:01,569 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 16:18:01,569 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:18:01,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-04-27 16:18:01,569 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 25 [2022-04-27 16:18:01,569 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 16:18:01,569 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-04-27 16:18:01,569 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (3), 2 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:18:01,569 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-27 16:18:01,569 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 16:18:01,571 INFO L805 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-04-27 16:18:01,593 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-04-27 16:18:01,790 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 16:18:01,792 INFO L356 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1] [2022-04-27 16:18:01,794 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-04-27 16:18:01,795 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.04 04:18:01 BasicIcfg [2022-04-27 16:18:01,795 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-04-27 16:18:01,796 INFO L158 Benchmark]: Toolchain (without parser) took 25497.80ms. Allocated memory was 203.4MB in the beginning and 264.2MB in the end (delta: 60.8MB). Free memory was 155.8MB in the beginning and 120.7MB in the end (delta: 35.1MB). Peak memory consumption was 97.1MB. Max. memory is 8.0GB. [2022-04-27 16:18:01,796 INFO L158 Benchmark]: CDTParser took 0.10ms. Allocated memory is still 203.4MB. Free memory was 171.7MB in the beginning and 171.6MB in the end (delta: 151.9kB). There was no memory consumed. Max. memory is 8.0GB. [2022-04-27 16:18:01,796 INFO L158 Benchmark]: CACSL2BoogieTranslator took 168.48ms. Allocated memory is still 203.4MB. Free memory was 155.5MB in the beginning and 180.0MB in the end (delta: -24.5MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2022-04-27 16:18:01,797 INFO L158 Benchmark]: Boogie Preprocessor took 17.35ms. Allocated memory is still 203.4MB. Free memory was 180.0MB in the beginning and 178.6MB in the end (delta: 1.4MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-04-27 16:18:01,797 INFO L158 Benchmark]: RCFGBuilder took 276.38ms. Allocated memory is still 203.4MB. Free memory was 178.6MB in the beginning and 168.1MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. [2022-04-27 16:18:01,797 INFO L158 Benchmark]: IcfgTransformer took 23244.84ms. Allocated memory was 203.4MB in the beginning and 264.2MB in the end (delta: 60.8MB). Free memory was 168.1MB in the beginning and 231.3MB in the end (delta: -63.3MB). Peak memory consumption was 45.2MB. Max. memory is 8.0GB. [2022-04-27 16:18:01,797 INFO L158 Benchmark]: TraceAbstraction took 1786.96ms. Allocated memory is still 264.2MB. Free memory was 230.8MB in the beginning and 120.7MB in the end (delta: 110.1MB). Peak memory consumption was 110.1MB. Max. memory is 8.0GB. [2022-04-27 16:18:01,798 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from IcfgTransformer: - StatisticsResult: Jordan loop acceleration statistics 0 HavocedVariables, 1 AssignedVariables, 1 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult - StatisticsResult: Jordan loop acceleration statistics 0 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {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.10ms. Allocated memory is still 203.4MB. Free memory was 171.7MB in the beginning and 171.6MB in the end (delta: 151.9kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 168.48ms. Allocated memory is still 203.4MB. Free memory was 155.5MB in the beginning and 180.0MB in the end (delta: -24.5MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * Boogie Preprocessor took 17.35ms. Allocated memory is still 203.4MB. Free memory was 180.0MB in the beginning and 178.6MB in the end (delta: 1.4MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 276.38ms. Allocated memory is still 203.4MB. Free memory was 178.6MB in the beginning and 168.1MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. * IcfgTransformer took 23244.84ms. Allocated memory was 203.4MB in the beginning and 264.2MB in the end (delta: 60.8MB). Free memory was 168.1MB in the beginning and 231.3MB in the end (delta: -63.3MB). Peak memory consumption was 45.2MB. Max. memory is 8.0GB. * TraceAbstraction took 1786.96ms. Allocated memory is still 264.2MB. Free memory was 230.8MB in the beginning and 120.7MB in the end (delta: 110.1MB). Peak memory consumption was 110.1MB. 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: 1.7s, OverallIterations: 5, TraceHistogramMax: 3, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 0.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 50 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 49 mSDsluCounter, 185 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 3 IncrementalHoareTripleChecker+Unchecked, 98 mSDsCounter, 12 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 46 IncrementalHoareTripleChecker+Invalid, 61 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 12 mSolverCounterUnsat, 87 mSDtfsCounter, 46 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 72 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=29occurred in iteration=4, InterpolantAutomatonStates: 22, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 5 MinimizatonAttempts, 1 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.4s InterpolantComputationTime, 78 NumberOfCodeBlocks, 78 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 88 ConstructedInterpolants, 0 QuantifiedInterpolants, 150 SizeOfPredicates, 1 NumberOfNonLiveVariables, 133 ConjunctsInSsa, 8 ConjunctsInUnsatCore, 6 InterpolantComputations, 4 PerfectInterpolantSequences, 25/27 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:18:01,817 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...