/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/jm2006.c.i.v+cfa-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-fb4f59a-m [2022-04-27 16:21:37,101 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-27 16:21:37,103 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-27 16:21:37,132 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-27 16:21:37,132 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-27 16:21:37,133 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-27 16:21:37,135 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-27 16:21:37,136 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-27 16:21:37,138 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-27 16:21:37,139 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-27 16:21:37,140 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-27 16:21:37,141 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-27 16:21:37,141 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-27 16:21:37,142 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-27 16:21:37,143 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-27 16:21:37,144 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-27 16:21:37,144 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-27 16:21:37,145 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-27 16:21:37,146 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-27 16:21:37,148 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-27 16:21:37,149 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-27 16:21:37,150 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-27 16:21:37,151 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-27 16:21:37,152 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-27 16:21:37,152 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-27 16:21:37,155 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-27 16:21:37,155 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-27 16:21:37,155 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-27 16:21:37,156 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-27 16:21:37,157 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-27 16:21:37,157 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-27 16:21:37,158 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-27 16:21:37,158 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-27 16:21:37,159 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-27 16:21:37,159 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-27 16:21:37,160 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-27 16:21:37,161 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-27 16:21:37,161 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-27 16:21:37,161 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-27 16:21:37,162 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-27 16:21:37,162 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-27 16:21:37,163 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-27 16:21:37,164 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/LoopAccelerationJordanC.epf [2022-04-27 16:21:37,172 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-27 16:21:37,172 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-27 16:21:37,173 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-27 16:21:37,174 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-27 16:21:37,174 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-27 16:21:37,174 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-27 16:21:37,174 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-27 16:21:37,175 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-27 16:21:37,175 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-27 16:21:37,184 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-27 16:21:37,184 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-27 16:21:37,184 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-27 16:21:37,184 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-27 16:21:37,184 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-27 16:21:37,185 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-27 16:21:37,185 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-27 16:21:37,185 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-27 16:21:37,185 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-27 16:21:37,185 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-27 16:21:37,185 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-27 16:21:37,185 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-04-27 16:21:37,186 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-04-27 16:21:37,186 INFO L138 SettingsManager]: * TransformationType=LOOP_ACCELERATION_JORDAN WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.core: Log level for class -> de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN; [2022-04-27 16:21:37,404 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-27 16:21:37,420 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-27 16:21:37,422 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-27 16:21:37,423 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-27 16:21:37,423 INFO L275 PluginConnector]: CDTParser initialized [2022-04-27 16:21:37,424 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-lit/jm2006.c.i.v+cfa-reducer.c [2022-04-27 16:21:37,480 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a5925acb7/b1f9d26154fb4d7c81de660d23173330/FLAG8fef21d6d [2022-04-27 16:21:37,799 INFO L306 CDTParser]: Found 1 translation units. [2022-04-27 16:21:37,800 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-lit/jm2006.c.i.v+cfa-reducer.c [2022-04-27 16:21:37,805 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a5925acb7/b1f9d26154fb4d7c81de660d23173330/FLAG8fef21d6d [2022-04-27 16:21:38,247 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a5925acb7/b1f9d26154fb4d7c81de660d23173330 [2022-04-27 16:21:38,250 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-27 16:21:38,251 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-04-27 16:21:38,253 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-27 16:21:38,253 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-27 16:21:38,258 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-27 16:21:38,259 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.04 04:21:38" (1/1) ... [2022-04-27 16:21:38,260 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@548bae8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 04:21:38, skipping insertion in model container [2022-04-27 16:21:38,260 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.04 04:21:38" (1/1) ... [2022-04-27 16:21:38,266 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-27 16:21:38,283 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-27 16:21:38,440 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/jm2006.c.i.v+cfa-reducer.c[1110,1123] [2022-04-27 16:21:38,453 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-27 16:21:38,461 INFO L203 MainTranslator]: Completed pre-run [2022-04-27 16:21:38,477 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/jm2006.c.i.v+cfa-reducer.c[1110,1123] [2022-04-27 16:21:38,478 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-27 16:21:38,491 INFO L208 MainTranslator]: Completed translation [2022-04-27 16:21:38,492 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 04:21:38 WrapperNode [2022-04-27 16:21:38,492 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-27 16:21:38,494 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-27 16:21:38,494 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-27 16:21:38,494 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-27 16:21:38,503 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 04:21:38" (1/1) ... [2022-04-27 16:21:38,504 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 04:21:38" (1/1) ... [2022-04-27 16:21:38,510 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 04:21:38" (1/1) ... [2022-04-27 16:21:38,510 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 04:21:38" (1/1) ... [2022-04-27 16:21:38,528 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 04:21:38" (1/1) ... [2022-04-27 16:21:38,531 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 04:21:38" (1/1) ... [2022-04-27 16:21:38,532 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 04:21:38" (1/1) ... [2022-04-27 16:21:38,538 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-27 16:21:38,538 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-27 16:21:38,539 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-27 16:21:38,539 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-27 16:21:38,540 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 04:21:38" (1/1) ... [2022-04-27 16:21:38,547 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-27 16:21:38,558 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 16:21:38,571 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-04-27 16:21:38,575 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-04-27 16:21:38,598 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-27 16:21:38,599 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-27 16:21:38,599 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-27 16:21:38,599 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-27 16:21:38,599 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-27 16:21:38,599 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-27 16:21:38,599 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-27 16:21:38,599 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-27 16:21:38,599 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-27 16:21:38,600 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-27 16:21:38,600 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-27 16:21:38,600 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-04-27 16:21:38,600 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-27 16:21:38,600 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-27 16:21:38,600 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-27 16:21:38,601 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-27 16:21:38,601 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-27 16:21:38,601 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-27 16:21:38,601 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-27 16:21:38,649 INFO L234 CfgBuilder]: Building ICFG [2022-04-27 16:21:38,650 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-27 16:21:38,773 INFO L275 CfgBuilder]: Performing block encoding [2022-04-27 16:21:38,778 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-27 16:21:38,778 INFO L299 CfgBuilder]: Removed 0 assume(true) statements. [2022-04-27 16:21:38,780 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.04 04:21:38 BoogieIcfgContainer [2022-04-27 16:21:38,780 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-27 16:21:38,781 INFO L113 PluginConnector]: ------------------------IcfgTransformer---------------------------- [2022-04-27 16:21:38,781 INFO L271 PluginConnector]: Initializing IcfgTransformer... [2022-04-27 16:21:38,782 INFO L275 PluginConnector]: IcfgTransformer initialized [2022-04-27 16:21:38,784 INFO L185 PluginConnector]: Executing the observer IcfgTransformationObserver from plugin IcfgTransformer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.04 04:21:38" (1/1) ... [2022-04-27 16:21:38,786 INFO L168 ansformationObserver]: Applying ICFG transformation LOOP_ACCELERATION_JORDAN [2022-04-27 16:21:39,309 INFO L89 elerationTransformer]: Jordan loop acceleration statistics: 0 HavocedVariables, 4 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=2}, 1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-27 16:21:39,310 INFO L91 elerationTransformer]: Accelerated Formula: (and (= v_main_~main__x~0_2 (+ (- 1) v_main_~main__x~0_3)) (= (+ (- 1) v_main_~main__y~0_3) v_main_~main__y~0_2) (= v_main_~main____CPAchecker_TMP_1~0_1 v_main_~main__y~0_3) (= v_main_~main____CPAchecker_TMP_0~0_1 v_main_~main__x~0_3) (not (= 0 v_main_~main__x~0_3))) InVars {main_~main__x~0=v_main_~main__x~0_3, main_~main__y~0=v_main_~main__y~0_3} OutVars{main_~main____CPAchecker_TMP_0~0=v_main_~main____CPAchecker_TMP_0~0_1, main_~main____CPAchecker_TMP_1~0=v_main_~main____CPAchecker_TMP_1~0_1, main_~main__x~0=v_main_~main__x~0_2, main_~main__y~0=v_main_~main__y~0_2} AuxVars[] AssignedVars[main_~main____CPAchecker_TMP_0~0, main_~main____CPAchecker_TMP_1~0, main_~main__x~0, main_~main__y~0] to Formula: (let ((.cse0 (= 0 v_main_~main__x~0_3))) (or (and .cse0 (= v_main_~main__x~0_3 v_main_~main__x~0_2) (= v_main_~main____CPAchecker_TMP_1~0_2 v_main_~main____CPAchecker_TMP_1~0_1) (= v_main_~main__y~0_3 v_main_~main__y~0_2) (= v_main_~main____CPAchecker_TMP_0~0_2 v_main_~main____CPAchecker_TMP_0~0_1)) (let ((.cse1 (+ v_main_~main__x~0_2 1)) (.cse2 (* (- 1) v_main_~main__x~0_3))) (and (= v_main_~main____CPAchecker_TMP_0~0_1 .cse1) (or (not (<= 1 v_main_~main__x~0_3)) (not (<= .cse1 0))) (< v_main_~main__x~0_2 v_main_~main__x~0_3) (= v_main_~main____CPAchecker_TMP_1~0_1 (+ .cse2 v_main_~main__x~0_2 v_main_~main__y~0_3 1)) (= (+ .cse2 v_main_~main__x~0_2 v_main_~main__y~0_3) v_main_~main__y~0_2) (not .cse0))))) InVars {main_~main____CPAchecker_TMP_0~0=v_main_~main____CPAchecker_TMP_0~0_2, main_~main____CPAchecker_TMP_1~0=v_main_~main____CPAchecker_TMP_1~0_2, main_~main__x~0=v_main_~main__x~0_3, main_~main__y~0=v_main_~main__y~0_3} OutVars{main_~main____CPAchecker_TMP_0~0=v_main_~main____CPAchecker_TMP_0~0_1, main_~main____CPAchecker_TMP_1~0=v_main_~main____CPAchecker_TMP_1~0_1, main_~main__x~0=v_main_~main__x~0_2, main_~main__y~0=v_main_~main__y~0_2} AuxVars[] AssignedVars[main_~main____CPAchecker_TMP_0~0, main_~main____CPAchecker_TMP_1~0, main_~main__x~0, main_~main__y~0] [2022-04-27 16:21:39,315 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 27.04 04:21:39 BasicIcfg [2022-04-27 16:21:39,315 INFO L132 PluginConnector]: ------------------------ END IcfgTransformer---------------------------- [2022-04-27 16:21:39,317 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-27 16:21:39,317 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-27 16:21:39,323 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-27 16:21:39,324 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.04 04:21:38" (1/4) ... [2022-04-27 16:21:39,324 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6f956146 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.04 04:21:39, skipping insertion in model container [2022-04-27 16:21:39,324 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 04:21:38" (2/4) ... [2022-04-27 16:21:39,325 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6f956146 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.04 04:21:39, skipping insertion in model container [2022-04-27 16:21:39,325 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.04 04:21:38" (3/4) ... [2022-04-27 16:21:39,325 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6f956146 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.04 04:21:39, skipping insertion in model container [2022-04-27 16:21:39,325 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 27.04 04:21:39" (4/4) ... [2022-04-27 16:21:39,326 INFO L111 eAbstractionObserver]: Analyzing ICFG jm2006.c.i.v+cfa-reducer.cJordan [2022-04-27 16:21:39,336 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION [2022-04-27 16:21:39,336 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-27 16:21:39,366 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-27 16:21:39,372 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@67fd2352, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@20640144 [2022-04-27 16:21:39,372 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-27 16:21:39,379 INFO L276 IsEmpty]: Start isEmpty. Operand has 17 states, 11 states have (on average 1.5454545454545454) internal successors, (17), 12 states have internal predecessors, (17), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-27 16:21:39,384 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-04-27 16:21:39,384 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 16:21:39,384 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 16:21:39,385 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 16:21:39,389 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 16:21:39,389 INFO L85 PathProgramCache]: Analyzing trace with hash -1936523046, now seen corresponding path program 1 times [2022-04-27 16:21:39,397 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 16:21:39,398 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1378476687] [2022-04-27 16:21:39,398 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 16:21:39,399 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 16:21:39,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 16:21:39,709 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 16:21:39,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 16:21:39,729 INFO L290 TraceCheckUtils]: 0: Hoare triple {28#(and (= ~__return_main~0 |old(~__return_main~0)|) (= |old(~__return_72~0)| ~__return_72~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [47] 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_~__return_72~0_2 0) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 2) 27) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0) (= 0 v_~__return_main~0_5))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{~__return_main~0=v_~__return_main~0_5, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, ~__return_72~0=v_~__return_72~0_2, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[~__return_main~0, #NULL.offset, ~__return_72~0, #NULL.base] {20#true} is VALID [2022-04-27 16:21:39,730 INFO L290 TraceCheckUtils]: 1: Hoare triple {20#true} [50] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {20#true} is VALID [2022-04-27 16:21:39,730 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {20#true} {20#true} [64] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {20#true} is VALID [2022-04-27 16:21:39,734 INFO L272 TraceCheckUtils]: 0: Hoare triple {20#true} [45] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {28#(and (= ~__return_main~0 |old(~__return_main~0)|) (= |old(~__return_72~0)| ~__return_72~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 16:21:39,735 INFO L290 TraceCheckUtils]: 1: Hoare triple {28#(and (= ~__return_main~0 |old(~__return_main~0)|) (= |old(~__return_72~0)| ~__return_72~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [47] 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_~__return_72~0_2 0) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 2) 27) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0) (= 0 v_~__return_main~0_5))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{~__return_main~0=v_~__return_main~0_5, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, ~__return_72~0=v_~__return_72~0_2, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[~__return_main~0, #NULL.offset, ~__return_72~0, #NULL.base] {20#true} is VALID [2022-04-27 16:21:39,735 INFO L290 TraceCheckUtils]: 2: Hoare triple {20#true} [50] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {20#true} is VALID [2022-04-27 16:21:39,735 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {20#true} {20#true} [64] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {20#true} is VALID [2022-04-27 16:21:39,736 INFO L272 TraceCheckUtils]: 4: Hoare triple {20#true} [46] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {20#true} is VALID [2022-04-27 16:21:39,736 INFO L290 TraceCheckUtils]: 5: Hoare triple {20#true} [49] mainENTRY-->L19: Formula: (and (<= |v_main_#t~nondet5_2| 2147483647) (= |v_main_#t~nondet5_2| v_main_~main__j~0_2) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (= |v_main_#t~nondet4_2| v_main_~main__i~0_2) (<= |v_main_#t~nondet4_2| 2147483647) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648))) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|, main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~main__j~0=v_main_~main__j~0_2, main_~main__i~0=v_main_~main__i~0_2} AuxVars[] AssignedVars[main_#t~nondet5, main_#t~nondet4, main_~main__j~0, main_~main__i~0] {20#true} is VALID [2022-04-27 16:21:39,736 INFO L290 TraceCheckUtils]: 6: Hoare triple {20#true} [52] L19-->L25: Formula: (<= 0 v_main_~main__i~0_6) InVars {main_~main__i~0=v_main_~main__i~0_6} OutVars{main_~main__i~0=v_main_~main__i~0_6} AuxVars[] AssignedVars[] {20#true} is VALID [2022-04-27 16:21:39,738 INFO L290 TraceCheckUtils]: 7: Hoare triple {20#true} [55] L25-->L40: Formula: (and (= v_main_~main__i~0_7 v_main_~main__x~0_1) (= v_main_~main__j~0_6 v_main_~main__y~0_1) (<= 0 v_main_~main__j~0_6)) InVars {main_~main__j~0=v_main_~main__j~0_6, main_~main__i~0=v_main_~main__i~0_7} OutVars{main_~main__x~0=v_main_~main__x~0_1, main_~main__y~0=v_main_~main__y~0_1, main_~main__j~0=v_main_~main__j~0_6, main_~main__i~0=v_main_~main__i~0_7} AuxVars[] AssignedVars[main_~main__x~0, main_~main__y~0] {25#(and (or (< 0 (+ main_~main__y~0 1)) (<= (+ main_~main__j~0 main_~main__x~0) (+ main_~main__i~0 main_~main__y~0))) (or (<= (+ main_~main__i~0 main_~main__y~0) (+ main_~main__j~0 main_~main__x~0)) (<= main_~main__y~0 0)))} is VALID [2022-04-27 16:21:39,739 INFO L290 TraceCheckUtils]: 8: Hoare triple {25#(and (or (< 0 (+ main_~main__y~0 1)) (<= (+ main_~main__j~0 main_~main__x~0) (+ main_~main__i~0 main_~main__y~0))) (or (<= (+ main_~main__i~0 main_~main__y~0) (+ main_~main__j~0 main_~main__x~0)) (<= main_~main__y~0 0)))} [57] L40-->L44: Formula: (= 0 v_main_~main__x~0_4) InVars {main_~main__x~0=v_main_~main__x~0_4} OutVars{main_~main__x~0=v_main_~main__x~0_4} AuxVars[] AssignedVars[] {26#(and (or (< 0 (+ main_~main__y~0 1)) (<= main_~main__j~0 (+ main_~main__i~0 main_~main__y~0))) (or (<= (+ main_~main__i~0 main_~main__y~0) main_~main__j~0) (<= main_~main__y~0 0)))} is VALID [2022-04-27 16:21:39,740 INFO L290 TraceCheckUtils]: 9: Hoare triple {26#(and (or (< 0 (+ main_~main__y~0 1)) (<= main_~main__j~0 (+ main_~main__i~0 main_~main__y~0))) (or (<= (+ main_~main__i~0 main_~main__y~0) main_~main__j~0) (<= main_~main__y~0 0)))} [58] L44-->L51: Formula: (and (= v_main_~main__i~0_8 v_main_~main__j~0_7) (= v_main_~__tmp_1~0_1 v_main_~__VERIFIER_assert__cond~0_2) (= v_main_~__tmp_1~0_1 (ite (= 0 v_main_~main__y~0_4) 1 0))) InVars {main_~main__y~0=v_main_~main__y~0_4, main_~main__j~0=v_main_~main__j~0_7, main_~main__i~0=v_main_~main__i~0_8} OutVars{main_~__VERIFIER_assert__cond~0=v_main_~__VERIFIER_assert__cond~0_2, main_~main__y~0=v_main_~main__y~0_4, main_~main__j~0=v_main_~main__j~0_7, main_~__tmp_1~0=v_main_~__tmp_1~0_1, main_~main__i~0=v_main_~main__i~0_8} AuxVars[] AssignedVars[main_~__VERIFIER_assert__cond~0, main_~__tmp_1~0] {27#(not (= main_~__VERIFIER_assert__cond~0 0))} is VALID [2022-04-27 16:21:39,741 INFO L290 TraceCheckUtils]: 10: Hoare triple {27#(not (= main_~__VERIFIER_assert__cond~0 0))} [60] L51-->L53: Formula: (= v_main_~__VERIFIER_assert__cond~0_4 0) InVars {main_~__VERIFIER_assert__cond~0=v_main_~__VERIFIER_assert__cond~0_4} OutVars{main_~__VERIFIER_assert__cond~0=v_main_~__VERIFIER_assert__cond~0_4} AuxVars[] AssignedVars[] {21#false} is VALID [2022-04-27 16:21:39,742 INFO L290 TraceCheckUtils]: 11: Hoare triple {21#false} [62] L53-->mainErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {21#false} is VALID [2022-04-27 16:21:39,742 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 16:21:39,743 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 16:21:39,743 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1378476687] [2022-04-27 16:21:39,744 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1378476687] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 16:21:39,744 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 16:21:39,744 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-27 16:21:39,747 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1245928922] [2022-04-27 16:21:39,747 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 16:21:39,752 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.5) internal successors, (9), 5 states have internal predecessors, (9), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2022-04-27 16:21:39,754 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 16:21:39,757 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 1.5) internal successors, (9), 5 states have internal predecessors, (9), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 16:21:39,775 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 12 edges. 12 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 16:21:39,775 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-27 16:21:39,776 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 16:21:39,794 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-27 16:21:39,795 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-04-27 16:21:39,797 INFO L87 Difference]: Start difference. First operand has 17 states, 11 states have (on average 1.5454545454545454) internal successors, (17), 12 states have internal predecessors, (17), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 6 states, 6 states have (on average 1.5) internal successors, (9), 5 states have internal predecessors, (9), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 16:21:40,180 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 16:21:40,181 INFO L93 Difference]: Finished difference Result 26 states and 31 transitions. [2022-04-27 16:21:40,181 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-27 16:21:40,181 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.5) internal successors, (9), 5 states have internal predecessors, (9), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2022-04-27 16:21:40,182 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 16:21:40,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 1.5) internal successors, (9), 5 states have internal predecessors, (9), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 16:21:40,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 33 transitions. [2022-04-27 16:21:40,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 1.5) internal successors, (9), 5 states have internal predecessors, (9), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 16:21:40,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 33 transitions. [2022-04-27 16:21:40,198 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 33 transitions. [2022-04-27 16:21:40,244 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 33 edges. 33 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 16:21:40,250 INFO L225 Difference]: With dead ends: 26 [2022-04-27 16:21:40,250 INFO L226 Difference]: Without dead ends: 14 [2022-04-27 16:21:40,252 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-04-27 16:21:40,254 INFO L413 NwaCegarLoop]: 17 mSDtfsCounter, 26 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 44 SdHoareTripleChecker+Invalid, 62 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-27 16:21:40,255 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 44 Invalid, 62 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-27 16:21:40,269 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2022-04-27 16:21:40,277 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2022-04-27 16:21:40,277 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 16:21:40,278 INFO L82 GeneralOperation]: Start isEquivalent. First operand 14 states. Second operand has 14 states, 10 states have (on average 1.1) internal successors, (11), 10 states have internal predecessors, (11), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 16:21:40,278 INFO L74 IsIncluded]: Start isIncluded. First operand 14 states. Second operand has 14 states, 10 states have (on average 1.1) internal successors, (11), 10 states have internal predecessors, (11), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 16:21:40,279 INFO L87 Difference]: Start difference. First operand 14 states. Second operand has 14 states, 10 states have (on average 1.1) internal successors, (11), 10 states have internal predecessors, (11), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 16:21:40,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 16:21:40,281 INFO L93 Difference]: Finished difference Result 14 states and 14 transitions. [2022-04-27 16:21:40,281 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 14 transitions. [2022-04-27 16:21:40,281 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 16:21:40,282 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 16:21:40,282 INFO L74 IsIncluded]: Start isIncluded. First operand has 14 states, 10 states have (on average 1.1) internal successors, (11), 10 states have internal predecessors, (11), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 14 states. [2022-04-27 16:21:40,282 INFO L87 Difference]: Start difference. First operand has 14 states, 10 states have (on average 1.1) internal successors, (11), 10 states have internal predecessors, (11), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 14 states. [2022-04-27 16:21:40,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 16:21:40,284 INFO L93 Difference]: Finished difference Result 14 states and 14 transitions. [2022-04-27 16:21:40,284 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 14 transitions. [2022-04-27 16:21:40,285 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 16:21:40,285 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 16:21:40,285 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 16:21:40,285 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 16:21:40,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 10 states have (on average 1.1) internal successors, (11), 10 states have internal predecessors, (11), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 16:21:40,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 14 transitions. [2022-04-27 16:21:40,288 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 14 transitions. Word has length 12 [2022-04-27 16:21:40,288 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 16:21:40,288 INFO L495 AbstractCegarLoop]: Abstraction has 14 states and 14 transitions. [2022-04-27 16:21:40,288 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 1.5) internal successors, (9), 5 states have internal predecessors, (9), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 16:21:40,289 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 14 transitions. [2022-04-27 16:21:40,289 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-04-27 16:21:40,289 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 16:21:40,289 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 16:21:40,289 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-27 16:21:40,290 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 16:21:40,290 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 16:21:40,290 INFO L85 PathProgramCache]: Analyzing trace with hash 96372484, now seen corresponding path program 1 times [2022-04-27 16:21:40,291 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 16:21:40,291 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [285645106] [2022-04-27 16:21:40,291 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 16:21:40,291 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 16:21:40,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 16:21:40,456 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 16:21:40,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 16:21:40,464 INFO L290 TraceCheckUtils]: 0: Hoare triple {116#(and (= ~__return_main~0 |old(~__return_main~0)|) (= |old(~__return_72~0)| ~__return_72~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [47] 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_~__return_72~0_2 0) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 2) 27) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0) (= 0 v_~__return_main~0_5))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{~__return_main~0=v_~__return_main~0_5, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, ~__return_72~0=v_~__return_72~0_2, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[~__return_main~0, #NULL.offset, ~__return_72~0, #NULL.base] {107#true} is VALID [2022-04-27 16:21:40,464 INFO L290 TraceCheckUtils]: 1: Hoare triple {107#true} [50] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {107#true} is VALID [2022-04-27 16:21:40,465 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {107#true} {107#true} [64] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {107#true} is VALID [2022-04-27 16:21:40,466 INFO L272 TraceCheckUtils]: 0: Hoare triple {107#true} [45] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {116#(and (= ~__return_main~0 |old(~__return_main~0)|) (= |old(~__return_72~0)| ~__return_72~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 16:21:40,467 INFO L290 TraceCheckUtils]: 1: Hoare triple {116#(and (= ~__return_main~0 |old(~__return_main~0)|) (= |old(~__return_72~0)| ~__return_72~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [47] 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_~__return_72~0_2 0) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 2) 27) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0) (= 0 v_~__return_main~0_5))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{~__return_main~0=v_~__return_main~0_5, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, ~__return_72~0=v_~__return_72~0_2, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[~__return_main~0, #NULL.offset, ~__return_72~0, #NULL.base] {107#true} is VALID [2022-04-27 16:21:40,467 INFO L290 TraceCheckUtils]: 2: Hoare triple {107#true} [50] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {107#true} is VALID [2022-04-27 16:21:40,467 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {107#true} {107#true} [64] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {107#true} is VALID [2022-04-27 16:21:40,467 INFO L272 TraceCheckUtils]: 4: Hoare triple {107#true} [46] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {107#true} is VALID [2022-04-27 16:21:40,468 INFO L290 TraceCheckUtils]: 5: Hoare triple {107#true} [49] mainENTRY-->L19: Formula: (and (<= |v_main_#t~nondet5_2| 2147483647) (= |v_main_#t~nondet5_2| v_main_~main__j~0_2) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (= |v_main_#t~nondet4_2| v_main_~main__i~0_2) (<= |v_main_#t~nondet4_2| 2147483647) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648))) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|, main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~main__j~0=v_main_~main__j~0_2, main_~main__i~0=v_main_~main__i~0_2} AuxVars[] AssignedVars[main_#t~nondet5, main_#t~nondet4, main_~main__j~0, main_~main__i~0] {107#true} is VALID [2022-04-27 16:21:40,468 INFO L290 TraceCheckUtils]: 6: Hoare triple {107#true} [52] L19-->L25: Formula: (<= 0 v_main_~main__i~0_6) InVars {main_~main__i~0=v_main_~main__i~0_6} OutVars{main_~main__i~0=v_main_~main__i~0_6} AuxVars[] AssignedVars[] {107#true} is VALID [2022-04-27 16:21:40,469 INFO L290 TraceCheckUtils]: 7: Hoare triple {107#true} [55] L25-->L40: Formula: (and (= v_main_~main__i~0_7 v_main_~main__x~0_1) (= v_main_~main__j~0_6 v_main_~main__y~0_1) (<= 0 v_main_~main__j~0_6)) InVars {main_~main__j~0=v_main_~main__j~0_6, main_~main__i~0=v_main_~main__i~0_7} OutVars{main_~main__x~0=v_main_~main__x~0_1, main_~main__y~0=v_main_~main__y~0_1, main_~main__j~0=v_main_~main__j~0_6, main_~main__i~0=v_main_~main__i~0_7} AuxVars[] AssignedVars[main_~main__x~0, main_~main__y~0] {112#(and (<= (+ main_~main__i~0 main_~main__y~0) (+ main_~main__j~0 main_~main__x~0)) (<= (+ main_~main__j~0 main_~main__x~0) (+ main_~main__i~0 main_~main__y~0)))} is VALID [2022-04-27 16:21:40,470 INFO L290 TraceCheckUtils]: 8: Hoare triple {112#(and (<= (+ main_~main__i~0 main_~main__y~0) (+ main_~main__j~0 main_~main__x~0)) (<= (+ main_~main__j~0 main_~main__x~0) (+ main_~main__i~0 main_~main__y~0)))} [56] L40-->L40: Formula: (let ((.cse0 (= 0 v_main_~main__x~0_3))) (or (and .cse0 (= v_main_~main__x~0_3 v_main_~main__x~0_2) (= v_main_~main____CPAchecker_TMP_1~0_2 v_main_~main____CPAchecker_TMP_1~0_1) (= v_main_~main__y~0_3 v_main_~main__y~0_2) (= v_main_~main____CPAchecker_TMP_0~0_2 v_main_~main____CPAchecker_TMP_0~0_1)) (let ((.cse1 (+ v_main_~main__x~0_2 1)) (.cse2 (* (- 1) v_main_~main__x~0_3))) (and (= v_main_~main____CPAchecker_TMP_0~0_1 .cse1) (or (not (<= 1 v_main_~main__x~0_3)) (not (<= .cse1 0))) (< v_main_~main__x~0_2 v_main_~main__x~0_3) (= v_main_~main____CPAchecker_TMP_1~0_1 (+ .cse2 v_main_~main__x~0_2 v_main_~main__y~0_3 1)) (= (+ .cse2 v_main_~main__x~0_2 v_main_~main__y~0_3) v_main_~main__y~0_2) (not .cse0))))) InVars {main_~main____CPAchecker_TMP_0~0=v_main_~main____CPAchecker_TMP_0~0_2, main_~main____CPAchecker_TMP_1~0=v_main_~main____CPAchecker_TMP_1~0_2, main_~main__x~0=v_main_~main__x~0_3, main_~main__y~0=v_main_~main__y~0_3} OutVars{main_~main____CPAchecker_TMP_0~0=v_main_~main____CPAchecker_TMP_0~0_1, main_~main____CPAchecker_TMP_1~0=v_main_~main____CPAchecker_TMP_1~0_1, main_~main__x~0=v_main_~main__x~0_2, main_~main__y~0=v_main_~main__y~0_2} AuxVars[] AssignedVars[main_~main____CPAchecker_TMP_0~0, main_~main____CPAchecker_TMP_1~0, main_~main__x~0, main_~main__y~0] {113#(or (and (or (not (<= (+ main_~main__y~0 1) 0)) (<= main_~main__j~0 (+ main_~main__i~0 main_~main__y~0))) (or (<= (+ main_~main__i~0 main_~main__y~0) main_~main__j~0) (<= main_~main__y~0 0))) (and (or (not (<= (+ main_~main__y~0 1) 0)) (<= (+ main_~main__j~0 main_~main__x~0) (+ main_~main__i~0 main_~main__y~0))) (or (<= (+ main_~main__i~0 main_~main__y~0) (+ main_~main__j~0 main_~main__x~0)) (<= main_~main__y~0 0))))} is VALID [2022-04-27 16:21:40,471 INFO L290 TraceCheckUtils]: 9: Hoare triple {113#(or (and (or (not (<= (+ main_~main__y~0 1) 0)) (<= main_~main__j~0 (+ main_~main__i~0 main_~main__y~0))) (or (<= (+ main_~main__i~0 main_~main__y~0) main_~main__j~0) (<= main_~main__y~0 0))) (and (or (not (<= (+ main_~main__y~0 1) 0)) (<= (+ main_~main__j~0 main_~main__x~0) (+ main_~main__i~0 main_~main__y~0))) (or (<= (+ main_~main__i~0 main_~main__y~0) (+ main_~main__j~0 main_~main__x~0)) (<= main_~main__y~0 0))))} [57] L40-->L44: Formula: (= 0 v_main_~main__x~0_4) InVars {main_~main__x~0=v_main_~main__x~0_4} OutVars{main_~main__x~0=v_main_~main__x~0_4} AuxVars[] AssignedVars[] {114#(and (or (not (<= (+ main_~main__y~0 1) 0)) (<= main_~main__j~0 (+ main_~main__i~0 main_~main__y~0))) (or (<= (+ main_~main__i~0 main_~main__y~0) main_~main__j~0) (<= main_~main__y~0 0)))} is VALID [2022-04-27 16:21:40,472 INFO L290 TraceCheckUtils]: 10: Hoare triple {114#(and (or (not (<= (+ main_~main__y~0 1) 0)) (<= main_~main__j~0 (+ main_~main__i~0 main_~main__y~0))) (or (<= (+ main_~main__i~0 main_~main__y~0) main_~main__j~0) (<= main_~main__y~0 0)))} [58] L44-->L51: Formula: (and (= v_main_~main__i~0_8 v_main_~main__j~0_7) (= v_main_~__tmp_1~0_1 v_main_~__VERIFIER_assert__cond~0_2) (= v_main_~__tmp_1~0_1 (ite (= 0 v_main_~main__y~0_4) 1 0))) InVars {main_~main__y~0=v_main_~main__y~0_4, main_~main__j~0=v_main_~main__j~0_7, main_~main__i~0=v_main_~main__i~0_8} OutVars{main_~__VERIFIER_assert__cond~0=v_main_~__VERIFIER_assert__cond~0_2, main_~main__y~0=v_main_~main__y~0_4, main_~main__j~0=v_main_~main__j~0_7, main_~__tmp_1~0=v_main_~__tmp_1~0_1, main_~main__i~0=v_main_~main__i~0_8} AuxVars[] AssignedVars[main_~__VERIFIER_assert__cond~0, main_~__tmp_1~0] {115#(not (= main_~__VERIFIER_assert__cond~0 0))} is VALID [2022-04-27 16:21:40,472 INFO L290 TraceCheckUtils]: 11: Hoare triple {115#(not (= main_~__VERIFIER_assert__cond~0 0))} [60] L51-->L53: Formula: (= v_main_~__VERIFIER_assert__cond~0_4 0) InVars {main_~__VERIFIER_assert__cond~0=v_main_~__VERIFIER_assert__cond~0_4} OutVars{main_~__VERIFIER_assert__cond~0=v_main_~__VERIFIER_assert__cond~0_4} AuxVars[] AssignedVars[] {108#false} is VALID [2022-04-27 16:21:40,473 INFO L290 TraceCheckUtils]: 12: Hoare triple {108#false} [62] L53-->mainErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {108#false} is VALID [2022-04-27 16:21:40,473 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 16:21:40,473 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 16:21:40,473 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [285645106] [2022-04-27 16:21:40,473 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [285645106] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 16:21:40,474 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1535576918] [2022-04-27 16:21:40,474 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 16:21:40,474 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 16:21:40,474 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 16:21:40,479 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-27 16:21:40,493 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-04-27 16:21:40,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 16:21:40,535 INFO L263 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 12 conjunts are in the unsatisfiable core [2022-04-27 16:21:40,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 16:21:40,561 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 16:21:40,868 INFO L272 TraceCheckUtils]: 0: Hoare triple {107#true} [45] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {107#true} is VALID [2022-04-27 16:21:40,869 INFO L290 TraceCheckUtils]: 1: Hoare triple {107#true} [47] 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_~__return_72~0_2 0) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 2) 27) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0) (= 0 v_~__return_main~0_5))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{~__return_main~0=v_~__return_main~0_5, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, ~__return_72~0=v_~__return_72~0_2, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[~__return_main~0, #NULL.offset, ~__return_72~0, #NULL.base] {107#true} is VALID [2022-04-27 16:21:40,869 INFO L290 TraceCheckUtils]: 2: Hoare triple {107#true} [50] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {107#true} is VALID [2022-04-27 16:21:40,870 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {107#true} {107#true} [64] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {107#true} is VALID [2022-04-27 16:21:40,870 INFO L272 TraceCheckUtils]: 4: Hoare triple {107#true} [46] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {107#true} is VALID [2022-04-27 16:21:40,871 INFO L290 TraceCheckUtils]: 5: Hoare triple {107#true} [49] mainENTRY-->L19: Formula: (and (<= |v_main_#t~nondet5_2| 2147483647) (= |v_main_#t~nondet5_2| v_main_~main__j~0_2) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (= |v_main_#t~nondet4_2| v_main_~main__i~0_2) (<= |v_main_#t~nondet4_2| 2147483647) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648))) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|, main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~main__j~0=v_main_~main__j~0_2, main_~main__i~0=v_main_~main__i~0_2} AuxVars[] AssignedVars[main_#t~nondet5, main_#t~nondet4, main_~main__j~0, main_~main__i~0] {107#true} is VALID [2022-04-27 16:21:40,871 INFO L290 TraceCheckUtils]: 6: Hoare triple {107#true} [52] L19-->L25: Formula: (<= 0 v_main_~main__i~0_6) InVars {main_~main__i~0=v_main_~main__i~0_6} OutVars{main_~main__i~0=v_main_~main__i~0_6} AuxVars[] AssignedVars[] {107#true} is VALID [2022-04-27 16:21:40,872 INFO L290 TraceCheckUtils]: 7: Hoare triple {107#true} [55] L25-->L40: Formula: (and (= v_main_~main__i~0_7 v_main_~main__x~0_1) (= v_main_~main__j~0_6 v_main_~main__y~0_1) (<= 0 v_main_~main__j~0_6)) InVars {main_~main__j~0=v_main_~main__j~0_6, main_~main__i~0=v_main_~main__i~0_7} OutVars{main_~main__x~0=v_main_~main__x~0_1, main_~main__y~0=v_main_~main__y~0_1, main_~main__j~0=v_main_~main__j~0_6, main_~main__i~0=v_main_~main__i~0_7} AuxVars[] AssignedVars[main_~main__x~0, main_~main__y~0] {141#(and (= main_~main__i~0 main_~main__x~0) (= main_~main__j~0 main_~main__y~0))} is VALID [2022-04-27 16:21:40,873 INFO L290 TraceCheckUtils]: 8: Hoare triple {141#(and (= main_~main__i~0 main_~main__x~0) (= main_~main__j~0 main_~main__y~0))} [56] L40-->L40: Formula: (let ((.cse0 (= 0 v_main_~main__x~0_3))) (or (and .cse0 (= v_main_~main__x~0_3 v_main_~main__x~0_2) (= v_main_~main____CPAchecker_TMP_1~0_2 v_main_~main____CPAchecker_TMP_1~0_1) (= v_main_~main__y~0_3 v_main_~main__y~0_2) (= v_main_~main____CPAchecker_TMP_0~0_2 v_main_~main____CPAchecker_TMP_0~0_1)) (let ((.cse1 (+ v_main_~main__x~0_2 1)) (.cse2 (* (- 1) v_main_~main__x~0_3))) (and (= v_main_~main____CPAchecker_TMP_0~0_1 .cse1) (or (not (<= 1 v_main_~main__x~0_3)) (not (<= .cse1 0))) (< v_main_~main__x~0_2 v_main_~main__x~0_3) (= v_main_~main____CPAchecker_TMP_1~0_1 (+ .cse2 v_main_~main__x~0_2 v_main_~main__y~0_3 1)) (= (+ .cse2 v_main_~main__x~0_2 v_main_~main__y~0_3) v_main_~main__y~0_2) (not .cse0))))) InVars {main_~main____CPAchecker_TMP_0~0=v_main_~main____CPAchecker_TMP_0~0_2, main_~main____CPAchecker_TMP_1~0=v_main_~main____CPAchecker_TMP_1~0_2, main_~main__x~0=v_main_~main__x~0_3, main_~main__y~0=v_main_~main__y~0_3} OutVars{main_~main____CPAchecker_TMP_0~0=v_main_~main____CPAchecker_TMP_0~0_1, main_~main____CPAchecker_TMP_1~0=v_main_~main____CPAchecker_TMP_1~0_1, main_~main__x~0=v_main_~main__x~0_2, main_~main__y~0=v_main_~main__y~0_2} AuxVars[] AssignedVars[main_~main____CPAchecker_TMP_0~0, main_~main____CPAchecker_TMP_1~0, main_~main__x~0, main_~main__y~0] {145#(or (and (= main_~main__i~0 main_~main__x~0) (= main_~main__i~0 0) (= main_~main__j~0 main_~main__y~0)) (and (not (= main_~main__i~0 0)) (< main_~main__x~0 main_~main__i~0) (or (not (<= (+ main_~main__x~0 1) 0)) (not (<= 1 main_~main__i~0))) (= (+ main_~main__j~0 main_~main__x~0) (+ main_~main__i~0 main_~main__y~0))))} is VALID [2022-04-27 16:21:40,874 INFO L290 TraceCheckUtils]: 9: Hoare triple {145#(or (and (= main_~main__i~0 main_~main__x~0) (= main_~main__i~0 0) (= main_~main__j~0 main_~main__y~0)) (and (not (= main_~main__i~0 0)) (< main_~main__x~0 main_~main__i~0) (or (not (<= (+ main_~main__x~0 1) 0)) (not (<= 1 main_~main__i~0))) (= (+ main_~main__j~0 main_~main__x~0) (+ main_~main__i~0 main_~main__y~0))))} [57] L40-->L44: Formula: (= 0 v_main_~main__x~0_4) InVars {main_~main__x~0=v_main_~main__x~0_4} OutVars{main_~main__x~0=v_main_~main__x~0_4} AuxVars[] AssignedVars[] {149#(or (and (= main_~main__i~0 0) (= main_~main__j~0 main_~main__y~0)) (and (= (+ main_~main__i~0 main_~main__y~0) main_~main__j~0) (< 0 main_~main__i~0)))} is VALID [2022-04-27 16:21:40,876 INFO L290 TraceCheckUtils]: 10: Hoare triple {149#(or (and (= main_~main__i~0 0) (= main_~main__j~0 main_~main__y~0)) (and (= (+ main_~main__i~0 main_~main__y~0) main_~main__j~0) (< 0 main_~main__i~0)))} [58] L44-->L51: Formula: (and (= v_main_~main__i~0_8 v_main_~main__j~0_7) (= v_main_~__tmp_1~0_1 v_main_~__VERIFIER_assert__cond~0_2) (= v_main_~__tmp_1~0_1 (ite (= 0 v_main_~main__y~0_4) 1 0))) InVars {main_~main__y~0=v_main_~main__y~0_4, main_~main__j~0=v_main_~main__j~0_7, main_~main__i~0=v_main_~main__i~0_8} OutVars{main_~__VERIFIER_assert__cond~0=v_main_~__VERIFIER_assert__cond~0_2, main_~main__y~0=v_main_~main__y~0_4, main_~main__j~0=v_main_~main__j~0_7, main_~__tmp_1~0=v_main_~__tmp_1~0_1, main_~main__i~0=v_main_~main__i~0_8} AuxVars[] AssignedVars[main_~__VERIFIER_assert__cond~0, main_~__tmp_1~0] {153#(<= 1 main_~__VERIFIER_assert__cond~0)} is VALID [2022-04-27 16:21:40,876 INFO L290 TraceCheckUtils]: 11: Hoare triple {153#(<= 1 main_~__VERIFIER_assert__cond~0)} [60] L51-->L53: Formula: (= v_main_~__VERIFIER_assert__cond~0_4 0) InVars {main_~__VERIFIER_assert__cond~0=v_main_~__VERIFIER_assert__cond~0_4} OutVars{main_~__VERIFIER_assert__cond~0=v_main_~__VERIFIER_assert__cond~0_4} AuxVars[] AssignedVars[] {108#false} is VALID [2022-04-27 16:21:40,877 INFO L290 TraceCheckUtils]: 12: Hoare triple {108#false} [62] L53-->mainErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {108#false} is VALID [2022-04-27 16:21:40,878 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 16:21:40,878 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 16:21:41,128 INFO L290 TraceCheckUtils]: 12: Hoare triple {108#false} [62] L53-->mainErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {108#false} is VALID [2022-04-27 16:21:41,129 INFO L290 TraceCheckUtils]: 11: Hoare triple {153#(<= 1 main_~__VERIFIER_assert__cond~0)} [60] L51-->L53: Formula: (= v_main_~__VERIFIER_assert__cond~0_4 0) InVars {main_~__VERIFIER_assert__cond~0=v_main_~__VERIFIER_assert__cond~0_4} OutVars{main_~__VERIFIER_assert__cond~0=v_main_~__VERIFIER_assert__cond~0_4} AuxVars[] AssignedVars[] {108#false} is VALID [2022-04-27 16:21:41,130 INFO L290 TraceCheckUtils]: 10: Hoare triple {166#(or (not (= main_~main__j~0 main_~main__i~0)) (= main_~main__y~0 0))} [58] L44-->L51: Formula: (and (= v_main_~main__i~0_8 v_main_~main__j~0_7) (= v_main_~__tmp_1~0_1 v_main_~__VERIFIER_assert__cond~0_2) (= v_main_~__tmp_1~0_1 (ite (= 0 v_main_~main__y~0_4) 1 0))) InVars {main_~main__y~0=v_main_~main__y~0_4, main_~main__j~0=v_main_~main__j~0_7, main_~main__i~0=v_main_~main__i~0_8} OutVars{main_~__VERIFIER_assert__cond~0=v_main_~__VERIFIER_assert__cond~0_2, main_~main__y~0=v_main_~main__y~0_4, main_~main__j~0=v_main_~main__j~0_7, main_~__tmp_1~0=v_main_~__tmp_1~0_1, main_~main__i~0=v_main_~main__i~0_8} AuxVars[] AssignedVars[main_~__VERIFIER_assert__cond~0, main_~__tmp_1~0] {153#(<= 1 main_~__VERIFIER_assert__cond~0)} is VALID [2022-04-27 16:21:41,130 INFO L290 TraceCheckUtils]: 9: Hoare triple {170#(or (not (= main_~main__j~0 main_~main__i~0)) (not (= main_~main__x~0 0)) (= main_~main__y~0 0))} [57] L40-->L44: Formula: (= 0 v_main_~main__x~0_4) InVars {main_~main__x~0=v_main_~main__x~0_4} OutVars{main_~main__x~0=v_main_~main__x~0_4} AuxVars[] AssignedVars[] {166#(or (not (= main_~main__j~0 main_~main__i~0)) (= main_~main__y~0 0))} is VALID [2022-04-27 16:21:41,132 INFO L290 TraceCheckUtils]: 8: Hoare triple {174#(or (and (or (not (= main_~main__x~0 0)) (= main_~main__y~0 0)) (or (<= main_~main__x~0 0) (= (+ (* (- 1) main_~main__x~0) main_~main__y~0) 0))) (not (= main_~main__j~0 main_~main__i~0)))} [56] L40-->L40: Formula: (let ((.cse0 (= 0 v_main_~main__x~0_3))) (or (and .cse0 (= v_main_~main__x~0_3 v_main_~main__x~0_2) (= v_main_~main____CPAchecker_TMP_1~0_2 v_main_~main____CPAchecker_TMP_1~0_1) (= v_main_~main__y~0_3 v_main_~main__y~0_2) (= v_main_~main____CPAchecker_TMP_0~0_2 v_main_~main____CPAchecker_TMP_0~0_1)) (let ((.cse1 (+ v_main_~main__x~0_2 1)) (.cse2 (* (- 1) v_main_~main__x~0_3))) (and (= v_main_~main____CPAchecker_TMP_0~0_1 .cse1) (or (not (<= 1 v_main_~main__x~0_3)) (not (<= .cse1 0))) (< v_main_~main__x~0_2 v_main_~main__x~0_3) (= v_main_~main____CPAchecker_TMP_1~0_1 (+ .cse2 v_main_~main__x~0_2 v_main_~main__y~0_3 1)) (= (+ .cse2 v_main_~main__x~0_2 v_main_~main__y~0_3) v_main_~main__y~0_2) (not .cse0))))) InVars {main_~main____CPAchecker_TMP_0~0=v_main_~main____CPAchecker_TMP_0~0_2, main_~main____CPAchecker_TMP_1~0=v_main_~main____CPAchecker_TMP_1~0_2, main_~main__x~0=v_main_~main__x~0_3, main_~main__y~0=v_main_~main__y~0_3} OutVars{main_~main____CPAchecker_TMP_0~0=v_main_~main____CPAchecker_TMP_0~0_1, main_~main____CPAchecker_TMP_1~0=v_main_~main____CPAchecker_TMP_1~0_1, main_~main__x~0=v_main_~main__x~0_2, main_~main__y~0=v_main_~main__y~0_2} AuxVars[] AssignedVars[main_~main____CPAchecker_TMP_0~0, main_~main____CPAchecker_TMP_1~0, main_~main__x~0, main_~main__y~0] {170#(or (not (= main_~main__j~0 main_~main__i~0)) (not (= main_~main__x~0 0)) (= main_~main__y~0 0))} is VALID [2022-04-27 16:21:41,135 INFO L290 TraceCheckUtils]: 7: Hoare triple {107#true} [55] L25-->L40: Formula: (and (= v_main_~main__i~0_7 v_main_~main__x~0_1) (= v_main_~main__j~0_6 v_main_~main__y~0_1) (<= 0 v_main_~main__j~0_6)) InVars {main_~main__j~0=v_main_~main__j~0_6, main_~main__i~0=v_main_~main__i~0_7} OutVars{main_~main__x~0=v_main_~main__x~0_1, main_~main__y~0=v_main_~main__y~0_1, main_~main__j~0=v_main_~main__j~0_6, main_~main__i~0=v_main_~main__i~0_7} AuxVars[] AssignedVars[main_~main__x~0, main_~main__y~0] {174#(or (and (or (not (= main_~main__x~0 0)) (= main_~main__y~0 0)) (or (<= main_~main__x~0 0) (= (+ (* (- 1) main_~main__x~0) main_~main__y~0) 0))) (not (= main_~main__j~0 main_~main__i~0)))} is VALID [2022-04-27 16:21:41,135 INFO L290 TraceCheckUtils]: 6: Hoare triple {107#true} [52] L19-->L25: Formula: (<= 0 v_main_~main__i~0_6) InVars {main_~main__i~0=v_main_~main__i~0_6} OutVars{main_~main__i~0=v_main_~main__i~0_6} AuxVars[] AssignedVars[] {107#true} is VALID [2022-04-27 16:21:41,135 INFO L290 TraceCheckUtils]: 5: Hoare triple {107#true} [49] mainENTRY-->L19: Formula: (and (<= |v_main_#t~nondet5_2| 2147483647) (= |v_main_#t~nondet5_2| v_main_~main__j~0_2) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (= |v_main_#t~nondet4_2| v_main_~main__i~0_2) (<= |v_main_#t~nondet4_2| 2147483647) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648))) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|, main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~main__j~0=v_main_~main__j~0_2, main_~main__i~0=v_main_~main__i~0_2} AuxVars[] AssignedVars[main_#t~nondet5, main_#t~nondet4, main_~main__j~0, main_~main__i~0] {107#true} is VALID [2022-04-27 16:21:41,135 INFO L272 TraceCheckUtils]: 4: Hoare triple {107#true} [46] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {107#true} is VALID [2022-04-27 16:21:41,136 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {107#true} {107#true} [64] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {107#true} is VALID [2022-04-27 16:21:41,136 INFO L290 TraceCheckUtils]: 2: Hoare triple {107#true} [50] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {107#true} is VALID [2022-04-27 16:21:41,136 INFO L290 TraceCheckUtils]: 1: Hoare triple {107#true} [47] 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_~__return_72~0_2 0) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 2) 27) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0) (= 0 v_~__return_main~0_5))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{~__return_main~0=v_~__return_main~0_5, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, ~__return_72~0=v_~__return_72~0_2, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[~__return_main~0, #NULL.offset, ~__return_72~0, #NULL.base] {107#true} is VALID [2022-04-27 16:21:41,136 INFO L272 TraceCheckUtils]: 0: Hoare triple {107#true} [45] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {107#true} is VALID [2022-04-27 16:21:41,137 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 16:21:41,137 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1535576918] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 16:21:41,137 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-27 16:21:41,137 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 14 [2022-04-27 16:21:41,138 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1409586740] [2022-04-27 16:21:41,138 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-27 16:21:41,139 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 1.4285714285714286) internal successors, (20), 13 states have internal predecessors, (20), 1 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 13 [2022-04-27 16:21:41,139 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 16:21:41,140 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 14 states, 14 states have (on average 1.4285714285714286) internal successors, (20), 13 states have internal predecessors, (20), 1 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:21:41,158 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 24 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 16:21:41,159 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-04-27 16:21:41,159 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 16:21:41,159 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-04-27 16:21:41,160 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=135, Unknown=0, NotChecked=0, Total=182 [2022-04-27 16:21:41,160 INFO L87 Difference]: Start difference. First operand 14 states and 14 transitions. Second operand has 14 states, 14 states have (on average 1.4285714285714286) internal successors, (20), 13 states have internal predecessors, (20), 1 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:21:41,461 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 16:21:41,462 INFO L93 Difference]: Finished difference Result 12 states and 12 transitions. [2022-04-27 16:21:41,462 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-27 16:21:41,462 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 1.4285714285714286) internal successors, (20), 13 states have internal predecessors, (20), 1 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 13 [2022-04-27 16:21:41,463 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 16:21:41,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 1.4285714285714286) internal successors, (20), 13 states have internal predecessors, (20), 1 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:21:41,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 13 transitions. [2022-04-27 16:21:41,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 1.4285714285714286) internal successors, (20), 13 states have internal predecessors, (20), 1 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:21:41,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 13 transitions. [2022-04-27 16:21:41,466 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 13 transitions. [2022-04-27 16:21:41,482 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 13 edges. 13 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 16:21:41,482 INFO L225 Difference]: With dead ends: 12 [2022-04-27 16:21:41,482 INFO L226 Difference]: Without dead ends: 0 [2022-04-27 16:21:41,483 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 20 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=90, Invalid=216, Unknown=0, NotChecked=0, Total=306 [2022-04-27 16:21:41,484 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 13 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 25 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-27 16:21:41,485 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 25 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-27 16:21:41,485 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-04-27 16:21:41,486 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-04-27 16:21:41,486 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 16:21:41,486 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-27 16:21:41,486 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-27 16:21:41,486 INFO L87 Difference]: Start difference. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-27 16:21:41,486 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 16:21:41,487 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-27 16:21:41,487 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-27 16:21:41,487 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 16:21:41,487 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 16:21:41,487 INFO L74 IsIncluded]: Start isIncluded. First operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 0 states. [2022-04-27 16:21:41,487 INFO L87 Difference]: Start difference. First operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 0 states. [2022-04-27 16:21:41,488 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 16:21:41,488 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-27 16:21:41,488 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-27 16:21:41,488 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 16:21:41,488 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 16:21:41,488 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 16:21:41,488 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 16:21:41,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-27 16:21:41,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-04-27 16:21:41,489 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 13 [2022-04-27 16:21:41,489 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 16:21:41,489 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-04-27 16:21:41,489 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 1.4285714285714286) internal successors, (20), 13 states have internal predecessors, (20), 1 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:21:41,490 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-27 16:21:41,490 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 16:21:41,492 INFO L805 garLoopResultBuilder]: Registering result SAFE for location mainErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-04-27 16:21:41,524 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-04-27 16:21:41,703 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 16:21:41,705 INFO L356 BasicCegarLoop]: Path program histogram: [1, 1] [2022-04-27 16:21:41,707 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-04-27 16:21:41,710 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.04 04:21:41 BasicIcfg [2022-04-27 16:21:41,711 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-04-27 16:21:41,712 INFO L158 Benchmark]: Toolchain (without parser) took 3461.07ms. Allocated memory was 192.9MB in the beginning and 310.4MB in the end (delta: 117.4MB). Free memory was 135.3MB in the beginning and 179.9MB in the end (delta: -44.6MB). Peak memory consumption was 72.4MB. Max. memory is 8.0GB. [2022-04-27 16:21:41,712 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 192.9MB. Free memory is still 151.4MB. There was no memory consumed. Max. memory is 8.0GB. [2022-04-27 16:21:41,713 INFO L158 Benchmark]: CACSL2BoogieTranslator took 240.08ms. Allocated memory was 192.9MB in the beginning and 310.4MB in the end (delta: 117.4MB). Free memory was 135.1MB in the beginning and 281.4MB in the end (delta: -146.3MB). Peak memory consumption was 8.5MB. Max. memory is 8.0GB. [2022-04-27 16:21:41,713 INFO L158 Benchmark]: Boogie Preprocessor took 44.29ms. Allocated memory is still 310.4MB. Free memory was 281.4MB in the beginning and 279.8MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-04-27 16:21:41,714 INFO L158 Benchmark]: RCFGBuilder took 241.79ms. Allocated memory is still 310.4MB. Free memory was 279.8MB in the beginning and 268.8MB in the end (delta: 11.0MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. [2022-04-27 16:21:41,714 INFO L158 Benchmark]: IcfgTransformer took 534.48ms. Allocated memory is still 310.4MB. Free memory was 268.8MB in the beginning and 248.4MB in the end (delta: 20.4MB). Peak memory consumption was 21.0MB. Max. memory is 8.0GB. [2022-04-27 16:21:41,714 INFO L158 Benchmark]: TraceAbstraction took 2394.12ms. Allocated memory is still 310.4MB. Free memory was 247.9MB in the beginning and 179.9MB in the end (delta: 68.0MB). Peak memory consumption was 69.6MB. Max. memory is 8.0GB. [2022-04-27 16:21:41,716 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from IcfgTransformer: - StatisticsResult: Jordan loop acceleration statistics 0 HavocedVariables, 4 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=2}, 1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult * Results from de.uni_freiburg.informatik.ultimate.core: - AssertionsEnabledResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.12ms. Allocated memory is still 192.9MB. Free memory is still 151.4MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 240.08ms. Allocated memory was 192.9MB in the beginning and 310.4MB in the end (delta: 117.4MB). Free memory was 135.1MB in the beginning and 281.4MB in the end (delta: -146.3MB). Peak memory consumption was 8.5MB. Max. memory is 8.0GB. * Boogie Preprocessor took 44.29ms. Allocated memory is still 310.4MB. Free memory was 281.4MB in the beginning and 279.8MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 241.79ms. Allocated memory is still 310.4MB. Free memory was 279.8MB in the beginning and 268.8MB in the end (delta: 11.0MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. * IcfgTransformer took 534.48ms. Allocated memory is still 310.4MB. Free memory was 268.8MB in the beginning and 248.4MB in the end (delta: 20.4MB). Peak memory consumption was 21.0MB. Max. memory is 8.0GB. * TraceAbstraction took 2394.12ms. Allocated memory is still 310.4MB. Free memory was 247.9MB in the beginning and 179.9MB in the end (delta: 68.0MB). Peak memory consumption was 69.6MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 53]: 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 3 procedures, 17 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 2.4s, OverallIterations: 2, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 39 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 39 mSDsluCounter, 69 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 44 mSDsCounter, 13 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 82 IncrementalHoareTripleChecker+Invalid, 95 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 13 mSolverCounterUnsat, 25 mSDtfsCounter, 82 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 48 GetRequests, 23 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=17occurred in iteration=0, InterpolantAutomatonStates: 15, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 2 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.0s InterpolantComputationTime, 38 NumberOfCodeBlocks, 38 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 47 ConstructedInterpolants, 0 QuantifiedInterpolants, 308 SizeOfPredicates, 9 NumberOfNonLiveVariables, 79 ConjunctsInSsa, 12 ConjunctsInUnsatCore, 4 InterpolantComputations, 1 PerfectInterpolantSequences, 0/3 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2022-04-27 16:21:41,751 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...