/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/loops/nec20.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-fb4f59a-m [2022-04-27 15:56:38,084 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-27 15:56:38,106 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-27 15:56:38,137 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-27 15:56:38,138 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-27 15:56:38,139 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-27 15:56:38,140 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-27 15:56:38,141 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-27 15:56:38,142 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-27 15:56:38,143 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-27 15:56:38,144 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-27 15:56:38,145 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-27 15:56:38,145 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-27 15:56:38,146 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-27 15:56:38,146 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-27 15:56:38,147 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-27 15:56:38,148 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-27 15:56:38,148 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-27 15:56:38,150 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-27 15:56:38,154 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-27 15:56:38,155 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-27 15:56:38,156 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-27 15:56:38,157 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-27 15:56:38,158 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-27 15:56:38,158 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-27 15:56:38,161 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-27 15:56:38,161 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-27 15:56:38,161 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-27 15:56:38,162 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-27 15:56:38,162 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-27 15:56:38,163 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-27 15:56:38,163 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-27 15:56:38,163 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-27 15:56:38,164 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-27 15:56:38,164 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-27 15:56:38,165 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-27 15:56:38,165 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-27 15:56:38,166 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-27 15:56:38,166 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-27 15:56:38,166 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-27 15:56:38,167 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-27 15:56:38,167 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-27 15:56:38,168 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/LoopAccelerationJordanC.epf [2022-04-27 15:56:38,176 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-27 15:56:38,176 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-27 15:56:38,177 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-27 15:56:38,177 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-27 15:56:38,178 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-27 15:56:38,178 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-27 15:56:38,178 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-27 15:56:38,178 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-27 15:56:38,178 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-27 15:56:38,178 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-27 15:56:38,179 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-27 15:56:38,179 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-27 15:56:38,179 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-27 15:56:38,179 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-27 15:56:38,179 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-27 15:56:38,180 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-27 15:56:38,180 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-27 15:56:38,180 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-27 15:56:38,180 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-27 15:56:38,180 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-27 15:56:38,181 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-04-27 15:56:38,181 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-04-27 15:56:38,181 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 15:56:38,378 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-27 15:56:38,401 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-27 15:56:38,403 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-27 15:56:38,403 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-27 15:56:38,404 INFO L275 PluginConnector]: CDTParser initialized [2022-04-27 15:56:38,405 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loops/nec20.c [2022-04-27 15:56:38,467 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c8b1dc61b/43e43a754641434a990a5a85734e2ec3/FLAG1ebd004d1 [2022-04-27 15:56:38,839 INFO L306 CDTParser]: Found 1 translation units. [2022-04-27 15:56:38,840 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loops/nec20.c [2022-04-27 15:56:38,844 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c8b1dc61b/43e43a754641434a990a5a85734e2ec3/FLAG1ebd004d1 [2022-04-27 15:56:39,258 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c8b1dc61b/43e43a754641434a990a5a85734e2ec3 [2022-04-27 15:56:39,260 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-27 15:56:39,263 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-04-27 15:56:39,264 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-27 15:56:39,264 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-27 15:56:39,267 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-27 15:56:39,268 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.04 03:56:39" (1/1) ... [2022-04-27 15:56:39,268 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@236f7b20 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 03:56:39, skipping insertion in model container [2022-04-27 15:56:39,269 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.04 03:56:39" (1/1) ... [2022-04-27 15:56:39,273 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-27 15:56:39,288 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-27 15:56:39,400 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loops/nec20.c[356,369] [2022-04-27 15:56:39,421 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-27 15:56:39,428 INFO L203 MainTranslator]: Completed pre-run [2022-04-27 15:56:39,449 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loops/nec20.c[356,369] [2022-04-27 15:56:39,474 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-27 15:56:39,485 INFO L208 MainTranslator]: Completed translation [2022-04-27 15:56:39,485 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 03:56:39 WrapperNode [2022-04-27 15:56:39,486 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-27 15:56:39,486 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-27 15:56:39,487 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-27 15:56:39,487 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-27 15:56:39,497 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 03:56:39" (1/1) ... [2022-04-27 15:56:39,497 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 03:56:39" (1/1) ... [2022-04-27 15:56:39,505 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 03:56:39" (1/1) ... [2022-04-27 15:56:39,505 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 03:56:39" (1/1) ... [2022-04-27 15:56:39,510 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 03:56:39" (1/1) ... [2022-04-27 15:56:39,514 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 03:56:39" (1/1) ... [2022-04-27 15:56:39,515 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 03:56:39" (1/1) ... [2022-04-27 15:56:39,516 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-27 15:56:39,517 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-27 15:56:39,517 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-27 15:56:39,517 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-27 15:56:39,518 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 03:56:39" (1/1) ... [2022-04-27 15:56:39,530 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-27 15:56:39,538 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 15:56:39,551 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 15:56:39,555 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 15:56:39,584 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-27 15:56:39,584 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-27 15:56:39,584 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-27 15:56:39,585 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-27 15:56:39,585 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-27 15:56:39,585 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-27 15:56:39,585 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-27 15:56:39,585 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-27 15:56:39,586 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-27 15:56:39,586 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uint [2022-04-27 15:56:39,586 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-27 15:56:39,587 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_bool [2022-04-27 15:56:39,587 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-27 15:56:39,587 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-27 15:56:39,588 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-27 15:56:39,590 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-27 15:56:39,590 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-27 15:56:39,590 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-27 15:56:39,590 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-27 15:56:39,643 INFO L234 CfgBuilder]: Building ICFG [2022-04-27 15:56:39,644 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-27 15:56:39,758 INFO L275 CfgBuilder]: Performing block encoding [2022-04-27 15:56:39,764 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-27 15:56:39,764 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-27 15:56:39,766 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.04 03:56:39 BoogieIcfgContainer [2022-04-27 15:56:39,766 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-27 15:56:39,767 INFO L113 PluginConnector]: ------------------------IcfgTransformer---------------------------- [2022-04-27 15:56:39,767 INFO L271 PluginConnector]: Initializing IcfgTransformer... [2022-04-27 15:56:39,768 INFO L275 PluginConnector]: IcfgTransformer initialized [2022-04-27 15:56:39,770 INFO L185 PluginConnector]: Executing the observer IcfgTransformationObserver from plugin IcfgTransformer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.04 03:56:39" (1/1) ... [2022-04-27 15:56:39,772 INFO L168 ansformationObserver]: Applying ICFG transformation LOOP_ACCELERATION_JORDAN [2022-04-27 15:56:42,798 WARN L970 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-27 15:56:46,841 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-27 15:56:47,366 INFO L89 elerationTransformer]: Jordan loop acceleration statistics: 1 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-27 15:56:47,367 INFO L91 elerationTransformer]: Accelerated Formula: (and (<= (mod v_main_~i~0_5 4294967296) (mod v_main_~n~0_5 4294967296)) (= (+ v_main_~j~0_6 2) v_main_~j~0_5) (= v_main_~i~0_4 (+ v_main_~i~0_5 1))) InVars {main_~j~0=v_main_~j~0_6, main_~i~0=v_main_~i~0_5, main_~n~0=v_main_~n~0_5} OutVars{main_~j~0=v_main_~j~0_5, main_~i~0=v_main_~i~0_4, main_~n~0=v_main_~n~0_5, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[main_~j~0, main_~i~0, main_#t~post6] to Formula: (let ((.cse1 (mod v_main_~i~0_5 4294967296)) (.cse0 (mod v_main_~n~0_5 4294967296))) (or (and (= |v_main_#t~post6_3| |v_main_#t~post6_1|) (< .cse0 .cse1) (= v_main_~i~0_4 v_main_~i~0_5) (= v_main_~j~0_6 v_main_~j~0_5)) (and (<= .cse1 .cse0) (or (<= 4294967295 .cse0) (<= (div (+ .cse0 (* (- 1) v_main_~i~0_4) 1) (- 4294967296)) (+ (div (+ v_main_~i~0_5 (- 4294967295)) 4294967296) 1))) (< v_main_~i~0_5 v_main_~i~0_4) (= (+ v_main_~j~0_5 (* v_main_~i~0_5 2)) (+ v_main_~j~0_6 (* v_main_~i~0_4 2)))))) InVars {main_~i~0=v_main_~i~0_5, main_~n~0=v_main_~n~0_5, main_#t~post6=|v_main_#t~post6_3|, main_~j~0=v_main_~j~0_6} OutVars{main_~i~0=v_main_~i~0_4, main_~n~0=v_main_~n~0_5, main_#t~post6=|v_main_#t~post6_1|, main_~j~0=v_main_~j~0_5} AuxVars[] AssignedVars[main_~j~0, main_~i~0, main_#t~post6] [2022-04-27 15:56:47,380 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 27.04 03:56:47 BasicIcfg [2022-04-27 15:56:47,380 INFO L132 PluginConnector]: ------------------------ END IcfgTransformer---------------------------- [2022-04-27 15:56:47,383 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-27 15:56:47,383 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-27 15:56:47,386 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-27 15:56:47,386 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.04 03:56:39" (1/4) ... [2022-04-27 15:56:47,387 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4049221 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.04 03:56:47, skipping insertion in model container [2022-04-27 15:56:47,387 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 03:56:39" (2/4) ... [2022-04-27 15:56:47,387 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4049221 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.04 03:56:47, skipping insertion in model container [2022-04-27 15:56:47,387 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.04 03:56:39" (3/4) ... [2022-04-27 15:56:47,390 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4049221 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.04 03:56:47, skipping insertion in model container [2022-04-27 15:56:47,390 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 27.04 03:56:47" (4/4) ... [2022-04-27 15:56:47,391 INFO L111 eAbstractionObserver]: Analyzing ICFG nec20.cJordan [2022-04-27 15:56:47,412 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION [2022-04-27 15:56:47,412 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-27 15:56:47,486 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-27 15:56:47,492 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@19a344e, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@5aa857f6 [2022-04-27 15:56:47,492 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-27 15:56:47,506 INFO L276 IsEmpty]: Start isEmpty. Operand has 25 states, 17 states have (on average 1.411764705882353) internal successors, (24), 18 states have internal predecessors, (24), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-27 15:56:47,511 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-04-27 15:56:47,512 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 15:56:47,512 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 15:56:47,514 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 15:56:47,519 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 15:56:47,520 INFO L85 PathProgramCache]: Analyzing trace with hash 936597551, now seen corresponding path program 1 times [2022-04-27 15:56:47,548 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 15:56:47,549 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [8479000] [2022-04-27 15:56:47,549 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 15:56:47,550 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 15:56:47,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:56:47,791 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 15:56:47,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:56:47,839 INFO L290 TraceCheckUtils]: 0: Hoare triple {33#(and (= ~b~0 |old(~b~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [61] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#length_1| 2) 8) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (= v_~b~0_4 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (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))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, ~b~0=v_~b~0_4, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[~b~0, #NULL.offset, #NULL.base] {28#true} is VALID [2022-04-27 15:56:47,839 INFO L290 TraceCheckUtils]: 1: Hoare triple {28#true} [64] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {28#true} is VALID [2022-04-27 15:56:47,840 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {28#true} {28#true} [86] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {28#true} is VALID [2022-04-27 15:56:47,843 INFO L272 TraceCheckUtils]: 0: Hoare triple {28#true} [59] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {33#(and (= ~b~0 |old(~b~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 15:56:47,843 INFO L290 TraceCheckUtils]: 1: Hoare triple {33#(and (= ~b~0 |old(~b~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [61] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#length_1| 2) 8) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (= v_~b~0_4 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (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))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, ~b~0=v_~b~0_4, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[~b~0, #NULL.offset, #NULL.base] {28#true} is VALID [2022-04-27 15:56:47,844 INFO L290 TraceCheckUtils]: 2: Hoare triple {28#true} [64] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {28#true} is VALID [2022-04-27 15:56:47,844 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {28#true} {28#true} [86] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {28#true} is VALID [2022-04-27 15:56:47,845 INFO L272 TraceCheckUtils]: 4: Hoare triple {28#true} [60] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {28#true} is VALID [2022-04-27 15:56:47,845 INFO L290 TraceCheckUtils]: 5: Hoare triple {28#true} [63] mainENTRY-->L19: Formula: (= v_main_~k~0_1 |v_main_#t~nondet4_2|) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~i~0=v_main_~i~0_1, main_~n~0=v_main_~n~0_1, main_~k~0=v_main_~k~0_1, main_~j~0=v_main_~j~0_1, main_~a~0=v_main_~a~0_3} AuxVars[] AssignedVars[main_#t~nondet4, main_~k~0, main_~j~0, main_~i~0, main_~n~0, main_~a~0] {28#true} is VALID [2022-04-27 15:56:47,845 INFO L290 TraceCheckUtils]: 6: Hoare triple {28#true} [65] L19-->L19-2: Formula: (and (not (= (mod v_main_~k~0_2 256) 0)) (= v_main_~n~0_2 0)) InVars {main_~k~0=v_main_~k~0_2} OutVars{main_~k~0=v_main_~k~0_2, main_~n~0=v_main_~n~0_2} AuxVars[] AssignedVars[main_~n~0] {28#true} is VALID [2022-04-27 15:56:47,845 INFO L290 TraceCheckUtils]: 7: Hoare triple {28#true} [67] L19-2-->L27: Formula: (and (= v_main_~i~0_2 0) (= v_main_~j~0_2 |v_main_#t~nondet5_2|)) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|} OutVars{main_~i~0=v_main_~i~0_2, main_~j~0=v_main_~j~0_2} AuxVars[] AssignedVars[main_#t~nondet5, main_~j~0, main_~i~0] {28#true} is VALID [2022-04-27 15:56:47,859 INFO L290 TraceCheckUtils]: 8: Hoare triple {28#true} [69] L27-->L30-2: Formula: (not (< 10000 (mod v_main_~j~0_4 4294967296))) InVars {main_~j~0=v_main_~j~0_4} OutVars{main_~j~0=v_main_~j~0_4} AuxVars[] AssignedVars[] {28#true} is VALID [2022-04-27 15:56:47,860 INFO L290 TraceCheckUtils]: 9: Hoare triple {28#true} [71] L30-2-->L30-3: Formula: false InVars {} OutVars{} AuxVars[] AssignedVars[] {29#false} is VALID [2022-04-27 15:56:47,860 INFO L290 TraceCheckUtils]: 10: Hoare triple {29#false} [74] L30-3-->L36: Formula: (= v_main_~a~0_4 (store v_main_~a~0_5 (let ((.cse0 (mod v_main_~i~0_6 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) 0)) InVars {main_~i~0=v_main_~i~0_6, main_~a~0=v_main_~a~0_5} OutVars{main_~i~0=v_main_~i~0_6, main_~a~0=v_main_~a~0_4} AuxVars[] AssignedVars[main_~a~0] {29#false} is VALID [2022-04-27 15:56:47,861 INFO L272 TraceCheckUtils]: 11: Hoare triple {29#false} [75] L36-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (< (mod v_main_~j~0_9 4294967296) 1025) 1 0)) InVars {main_~j~0=v_main_~j~0_9} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~j~0] {29#false} is VALID [2022-04-27 15:56:47,861 INFO L290 TraceCheckUtils]: 12: Hoare triple {29#false} [77] __VERIFIER_assertENTRY-->L7: Formula: (= v___VERIFIER_assert_~cond_2 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {29#false} is VALID [2022-04-27 15:56:47,861 INFO L290 TraceCheckUtils]: 13: Hoare triple {29#false} [80] L7-->L8: Formula: (= v___VERIFIER_assert_~cond_3 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {29#false} is VALID [2022-04-27 15:56:47,861 INFO L290 TraceCheckUtils]: 14: Hoare triple {29#false} [83] L8-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {29#false} is VALID [2022-04-27 15:56:47,862 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 15:56:47,862 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 15:56:47,862 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [8479000] [2022-04-27 15:56:47,863 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [8479000] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 15:56:47,863 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 15:56:47,863 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-27 15:56:47,868 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [58288978] [2022-04-27 15:56:47,869 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 15:56:47,873 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 15 [2022-04-27 15:56:47,876 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 15:56:47,882 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:56:47,909 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 15 edges. 15 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 15:56:47,909 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-27 15:56:47,910 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 15:56:47,952 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-27 15:56:47,952 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-27 15:56:47,968 INFO L87 Difference]: Start difference. First operand has 25 states, 17 states have (on average 1.411764705882353) internal successors, (24), 18 states have internal predecessors, (24), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:56:48,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:56:48,068 INFO L93 Difference]: Finished difference Result 25 states and 28 transitions. [2022-04-27 15:56:48,068 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-27 15:56:48,068 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 15 [2022-04-27 15:56:48,069 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 15:56:48,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:56:48,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 30 transitions. [2022-04-27 15:56:48,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:56:48,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 30 transitions. [2022-04-27 15:56:48,103 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 30 transitions. [2022-04-27 15:56:48,153 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 30 edges. 30 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 15:56:48,160 INFO L225 Difference]: With dead ends: 25 [2022-04-27 15:56:48,160 INFO L226 Difference]: Without dead ends: 16 [2022-04-27 15:56:48,162 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-27 15:56:48,165 INFO L413 NwaCegarLoop]: 24 mSDtfsCounter, 19 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 27 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 15:56:48,169 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 27 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 15:56:48,201 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2022-04-27 15:56:48,220 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2022-04-27 15:56:48,220 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 15:56:48,221 INFO L82 GeneralOperation]: Start isEquivalent. First operand 16 states. Second operand has 16 states, 11 states have (on average 1.1818181818181819) internal successors, (13), 11 states have internal predecessors, (13), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:56:48,222 INFO L74 IsIncluded]: Start isIncluded. First operand 16 states. Second operand has 16 states, 11 states have (on average 1.1818181818181819) internal successors, (13), 11 states have internal predecessors, (13), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:56:48,222 INFO L87 Difference]: Start difference. First operand 16 states. Second operand has 16 states, 11 states have (on average 1.1818181818181819) internal successors, (13), 11 states have internal predecessors, (13), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:56:48,228 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:56:48,228 INFO L93 Difference]: Finished difference Result 16 states and 17 transitions. [2022-04-27 15:56:48,228 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 17 transitions. [2022-04-27 15:56:48,229 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:56:48,229 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:56:48,229 INFO L74 IsIncluded]: Start isIncluded. First operand has 16 states, 11 states have (on average 1.1818181818181819) internal successors, (13), 11 states have internal predecessors, (13), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 16 states. [2022-04-27 15:56:48,229 INFO L87 Difference]: Start difference. First operand has 16 states, 11 states have (on average 1.1818181818181819) internal successors, (13), 11 states have internal predecessors, (13), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 16 states. [2022-04-27 15:56:48,232 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:56:48,232 INFO L93 Difference]: Finished difference Result 16 states and 17 transitions. [2022-04-27 15:56:48,232 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 17 transitions. [2022-04-27 15:56:48,232 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:56:48,232 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:56:48,232 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 15:56:48,233 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 15:56:48,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 11 states have (on average 1.1818181818181819) internal successors, (13), 11 states have internal predecessors, (13), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:56:48,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 17 transitions. [2022-04-27 15:56:48,250 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 17 transitions. Word has length 15 [2022-04-27 15:56:48,253 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 15:56:48,253 INFO L495 AbstractCegarLoop]: Abstraction has 16 states and 17 transitions. [2022-04-27 15:56:48,258 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:56:48,258 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 17 transitions. [2022-04-27 15:56:48,259 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-04-27 15:56:48,259 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 15:56:48,259 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 15:56:48,259 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-27 15:56:48,259 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 15:56:48,260 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 15:56:48,260 INFO L85 PathProgramCache]: Analyzing trace with hash 965226702, now seen corresponding path program 1 times [2022-04-27 15:56:48,260 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 15:56:48,260 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [123136951] [2022-04-27 15:56:48,260 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 15:56:48,261 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 15:56:48,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:56:48,430 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 15:56:48,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:56:48,452 INFO L290 TraceCheckUtils]: 0: Hoare triple {116#(and (= ~b~0 |old(~b~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [61] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#length_1| 2) 8) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (= v_~b~0_4 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (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))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, ~b~0=v_~b~0_4, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[~b~0, #NULL.offset, #NULL.base] {109#true} is VALID [2022-04-27 15:56:48,453 INFO L290 TraceCheckUtils]: 1: Hoare triple {109#true} [64] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {109#true} is VALID [2022-04-27 15:56:48,453 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {109#true} {109#true} [86] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {109#true} is VALID [2022-04-27 15:56:48,455 INFO L272 TraceCheckUtils]: 0: Hoare triple {109#true} [59] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {116#(and (= ~b~0 |old(~b~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 15:56:48,455 INFO L290 TraceCheckUtils]: 1: Hoare triple {116#(and (= ~b~0 |old(~b~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [61] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#length_1| 2) 8) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (= v_~b~0_4 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (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))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, ~b~0=v_~b~0_4, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[~b~0, #NULL.offset, #NULL.base] {109#true} is VALID [2022-04-27 15:56:48,455 INFO L290 TraceCheckUtils]: 2: Hoare triple {109#true} [64] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {109#true} is VALID [2022-04-27 15:56:48,455 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {109#true} {109#true} [86] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {109#true} is VALID [2022-04-27 15:56:48,456 INFO L272 TraceCheckUtils]: 4: Hoare triple {109#true} [60] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {109#true} is VALID [2022-04-27 15:56:48,456 INFO L290 TraceCheckUtils]: 5: Hoare triple {109#true} [63] mainENTRY-->L19: Formula: (= v_main_~k~0_1 |v_main_#t~nondet4_2|) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~i~0=v_main_~i~0_1, main_~n~0=v_main_~n~0_1, main_~k~0=v_main_~k~0_1, main_~j~0=v_main_~j~0_1, main_~a~0=v_main_~a~0_3} AuxVars[] AssignedVars[main_#t~nondet4, main_~k~0, main_~j~0, main_~i~0, main_~n~0, main_~a~0] {109#true} is VALID [2022-04-27 15:56:48,457 INFO L290 TraceCheckUtils]: 6: Hoare triple {109#true} [65] L19-->L19-2: Formula: (and (not (= (mod v_main_~k~0_2 256) 0)) (= v_main_~n~0_2 0)) InVars {main_~k~0=v_main_~k~0_2} OutVars{main_~k~0=v_main_~k~0_2, main_~n~0=v_main_~n~0_2} AuxVars[] AssignedVars[main_~n~0] {114#(= main_~n~0 0)} is VALID [2022-04-27 15:56:48,457 INFO L290 TraceCheckUtils]: 7: Hoare triple {114#(= main_~n~0 0)} [67] L19-2-->L27: Formula: (and (= v_main_~i~0_2 0) (= v_main_~j~0_2 |v_main_#t~nondet5_2|)) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|} OutVars{main_~i~0=v_main_~i~0_2, main_~j~0=v_main_~j~0_2} AuxVars[] AssignedVars[main_#t~nondet5, main_~j~0, main_~i~0] {115#(and (= main_~n~0 0) (= main_~i~0 0))} is VALID [2022-04-27 15:56:48,458 INFO L290 TraceCheckUtils]: 8: Hoare triple {115#(and (= main_~n~0 0) (= main_~i~0 0))} [69] L27-->L30-2: Formula: (not (< 10000 (mod v_main_~j~0_4 4294967296))) InVars {main_~j~0=v_main_~j~0_4} OutVars{main_~j~0=v_main_~j~0_4} AuxVars[] AssignedVars[] {115#(and (= main_~n~0 0) (= main_~i~0 0))} is VALID [2022-04-27 15:56:48,458 INFO L290 TraceCheckUtils]: 9: Hoare triple {115#(and (= main_~n~0 0) (= main_~i~0 0))} [72] L30-2-->L30-3: Formula: (not (<= (mod v_main_~i~0_3 4294967296) (mod v_main_~n~0_4 4294967296))) InVars {main_~i~0=v_main_~i~0_3, main_~n~0=v_main_~n~0_4} OutVars{main_~i~0=v_main_~i~0_3, main_~n~0=v_main_~n~0_4} AuxVars[] AssignedVars[] {110#false} is VALID [2022-04-27 15:56:48,459 INFO L290 TraceCheckUtils]: 10: Hoare triple {110#false} [74] L30-3-->L36: Formula: (= v_main_~a~0_4 (store v_main_~a~0_5 (let ((.cse0 (mod v_main_~i~0_6 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) 0)) InVars {main_~i~0=v_main_~i~0_6, main_~a~0=v_main_~a~0_5} OutVars{main_~i~0=v_main_~i~0_6, main_~a~0=v_main_~a~0_4} AuxVars[] AssignedVars[main_~a~0] {110#false} is VALID [2022-04-27 15:56:48,459 INFO L272 TraceCheckUtils]: 11: Hoare triple {110#false} [75] L36-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (< (mod v_main_~j~0_9 4294967296) 1025) 1 0)) InVars {main_~j~0=v_main_~j~0_9} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~j~0] {110#false} is VALID [2022-04-27 15:56:48,459 INFO L290 TraceCheckUtils]: 12: Hoare triple {110#false} [77] __VERIFIER_assertENTRY-->L7: Formula: (= v___VERIFIER_assert_~cond_2 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {110#false} is VALID [2022-04-27 15:56:48,459 INFO L290 TraceCheckUtils]: 13: Hoare triple {110#false} [80] L7-->L8: Formula: (= v___VERIFIER_assert_~cond_3 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {110#false} is VALID [2022-04-27 15:56:48,460 INFO L290 TraceCheckUtils]: 14: Hoare triple {110#false} [83] L8-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {110#false} is VALID [2022-04-27 15:56:48,460 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 15:56:48,460 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 15:56:48,460 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [123136951] [2022-04-27 15:56:48,460 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [123136951] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 15:56:48,469 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 15:56:48,470 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-27 15:56:48,470 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2028261093] [2022-04-27 15:56:48,470 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 15:56:48,471 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 15 [2022-04-27 15:56:48,472 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 15:56:48,472 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:56:48,486 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 15 edges. 15 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 15:56:48,486 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-27 15:56:48,486 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 15:56:48,487 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-27 15:56:48,504 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-04-27 15:56:48,504 INFO L87 Difference]: Start difference. First operand 16 states and 17 transitions. Second operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:56:48,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:56:48,674 INFO L93 Difference]: Finished difference Result 22 states and 24 transitions. [2022-04-27 15:56:48,674 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-27 15:56:48,675 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 15 [2022-04-27 15:56:48,675 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 15:56:48,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:56:48,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 25 transitions. [2022-04-27 15:56:48,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:56:48,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 25 transitions. [2022-04-27 15:56:48,680 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 25 transitions. [2022-04-27 15:56:48,719 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 25 edges. 25 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 15:56:48,721 INFO L225 Difference]: With dead ends: 22 [2022-04-27 15:56:48,721 INFO L226 Difference]: Without dead ends: 22 [2022-04-27 15:56:48,722 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2022-04-27 15:56:48,723 INFO L413 NwaCegarLoop]: 18 mSDtfsCounter, 18 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 30 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 15:56:48,724 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 30 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 15:56:48,725 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2022-04-27 15:56:48,728 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 19. [2022-04-27 15:56:48,728 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 15:56:48,728 INFO L82 GeneralOperation]: Start isEquivalent. First operand 22 states. Second operand has 19 states, 14 states have (on average 1.1428571428571428) internal successors, (16), 14 states have internal predecessors, (16), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:56:48,729 INFO L74 IsIncluded]: Start isIncluded. First operand 22 states. Second operand has 19 states, 14 states have (on average 1.1428571428571428) internal successors, (16), 14 states have internal predecessors, (16), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:56:48,729 INFO L87 Difference]: Start difference. First operand 22 states. Second operand has 19 states, 14 states have (on average 1.1428571428571428) internal successors, (16), 14 states have internal predecessors, (16), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:56:48,732 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:56:48,732 INFO L93 Difference]: Finished difference Result 22 states and 24 transitions. [2022-04-27 15:56:48,732 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 24 transitions. [2022-04-27 15:56:48,732 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:56:48,732 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:56:48,733 INFO L74 IsIncluded]: Start isIncluded. First operand has 19 states, 14 states have (on average 1.1428571428571428) internal successors, (16), 14 states have internal predecessors, (16), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 22 states. [2022-04-27 15:56:48,733 INFO L87 Difference]: Start difference. First operand has 19 states, 14 states have (on average 1.1428571428571428) internal successors, (16), 14 states have internal predecessors, (16), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 22 states. [2022-04-27 15:56:48,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:56:48,734 INFO L93 Difference]: Finished difference Result 22 states and 24 transitions. [2022-04-27 15:56:48,734 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 24 transitions. [2022-04-27 15:56:48,735 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:56:48,735 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:56:48,735 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 15:56:48,735 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 15:56:48,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 14 states have (on average 1.1428571428571428) internal successors, (16), 14 states have internal predecessors, (16), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:56:48,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 20 transitions. [2022-04-27 15:56:48,737 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 20 transitions. Word has length 15 [2022-04-27 15:56:48,737 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 15:56:48,737 INFO L495 AbstractCegarLoop]: Abstraction has 19 states and 20 transitions. [2022-04-27 15:56:48,737 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:56:48,738 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 20 transitions. [2022-04-27 15:56:48,748 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-04-27 15:56:48,748 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 15:56:48,749 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 15:56:48,749 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-27 15:56:48,749 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 15:56:48,749 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 15:56:48,750 INFO L85 PathProgramCache]: Analyzing trace with hash -842227761, now seen corresponding path program 1 times [2022-04-27 15:56:48,750 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 15:56:48,750 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [376195599] [2022-04-27 15:56:48,750 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 15:56:48,750 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 15:56:48,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:56:48,984 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 15:56:48,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:56:49,012 INFO L290 TraceCheckUtils]: 0: Hoare triple {215#(and (= ~b~0 |old(~b~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [61] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#length_1| 2) 8) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (= v_~b~0_4 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (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))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, ~b~0=v_~b~0_4, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[~b~0, #NULL.offset, #NULL.base] {208#true} is VALID [2022-04-27 15:56:49,013 INFO L290 TraceCheckUtils]: 1: Hoare triple {208#true} [64] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {208#true} is VALID [2022-04-27 15:56:49,013 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {208#true} {208#true} [86] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {208#true} is VALID [2022-04-27 15:56:49,014 INFO L272 TraceCheckUtils]: 0: Hoare triple {208#true} [59] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {215#(and (= ~b~0 |old(~b~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 15:56:49,014 INFO L290 TraceCheckUtils]: 1: Hoare triple {215#(and (= ~b~0 |old(~b~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [61] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#length_1| 2) 8) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (= v_~b~0_4 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (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))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, ~b~0=v_~b~0_4, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[~b~0, #NULL.offset, #NULL.base] {208#true} is VALID [2022-04-27 15:56:49,015 INFO L290 TraceCheckUtils]: 2: Hoare triple {208#true} [64] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {208#true} is VALID [2022-04-27 15:56:49,015 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {208#true} {208#true} [86] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {208#true} is VALID [2022-04-27 15:56:49,015 INFO L272 TraceCheckUtils]: 4: Hoare triple {208#true} [60] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {208#true} is VALID [2022-04-27 15:56:49,016 INFO L290 TraceCheckUtils]: 5: Hoare triple {208#true} [63] mainENTRY-->L19: Formula: (= v_main_~k~0_1 |v_main_#t~nondet4_2|) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~i~0=v_main_~i~0_1, main_~n~0=v_main_~n~0_1, main_~k~0=v_main_~k~0_1, main_~j~0=v_main_~j~0_1, main_~a~0=v_main_~a~0_3} AuxVars[] AssignedVars[main_#t~nondet4, main_~k~0, main_~j~0, main_~i~0, main_~n~0, main_~a~0] {208#true} is VALID [2022-04-27 15:56:49,016 INFO L290 TraceCheckUtils]: 6: Hoare triple {208#true} [66] L19-->L19-2: Formula: (and (= (mod v_main_~k~0_3 256) 0) (= 1023 v_main_~n~0_3)) InVars {main_~k~0=v_main_~k~0_3} OutVars{main_~k~0=v_main_~k~0_3, main_~n~0=v_main_~n~0_3} AuxVars[] AssignedVars[main_~n~0] {213#(and (<= main_~n~0 1023) (<= 1023 main_~n~0))} is VALID [2022-04-27 15:56:49,017 INFO L290 TraceCheckUtils]: 7: Hoare triple {213#(and (<= main_~n~0 1023) (<= 1023 main_~n~0))} [67] L19-2-->L27: Formula: (and (= v_main_~i~0_2 0) (= v_main_~j~0_2 |v_main_#t~nondet5_2|)) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|} OutVars{main_~i~0=v_main_~i~0_2, main_~j~0=v_main_~j~0_2} AuxVars[] AssignedVars[main_#t~nondet5, main_~j~0, main_~i~0] {214#(and (not (<= (+ (div main_~i~0 4294967296) 1) (div main_~n~0 4294967296))) (<= 1023 main_~n~0) (= main_~i~0 0))} is VALID [2022-04-27 15:56:49,018 INFO L290 TraceCheckUtils]: 8: Hoare triple {214#(and (not (<= (+ (div main_~i~0 4294967296) 1) (div main_~n~0 4294967296))) (<= 1023 main_~n~0) (= main_~i~0 0))} [69] L27-->L30-2: Formula: (not (< 10000 (mod v_main_~j~0_4 4294967296))) InVars {main_~j~0=v_main_~j~0_4} OutVars{main_~j~0=v_main_~j~0_4} AuxVars[] AssignedVars[] {214#(and (not (<= (+ (div main_~i~0 4294967296) 1) (div main_~n~0 4294967296))) (<= 1023 main_~n~0) (= main_~i~0 0))} is VALID [2022-04-27 15:56:49,021 INFO L290 TraceCheckUtils]: 9: Hoare triple {214#(and (not (<= (+ (div main_~i~0 4294967296) 1) (div main_~n~0 4294967296))) (<= 1023 main_~n~0) (= main_~i~0 0))} [72] L30-2-->L30-3: Formula: (not (<= (mod v_main_~i~0_3 4294967296) (mod v_main_~n~0_4 4294967296))) InVars {main_~i~0=v_main_~i~0_3, main_~n~0=v_main_~n~0_4} OutVars{main_~i~0=v_main_~i~0_3, main_~n~0=v_main_~n~0_4} AuxVars[] AssignedVars[] {209#false} is VALID [2022-04-27 15:56:49,021 INFO L290 TraceCheckUtils]: 10: Hoare triple {209#false} [74] L30-3-->L36: Formula: (= v_main_~a~0_4 (store v_main_~a~0_5 (let ((.cse0 (mod v_main_~i~0_6 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) 0)) InVars {main_~i~0=v_main_~i~0_6, main_~a~0=v_main_~a~0_5} OutVars{main_~i~0=v_main_~i~0_6, main_~a~0=v_main_~a~0_4} AuxVars[] AssignedVars[main_~a~0] {209#false} is VALID [2022-04-27 15:56:49,022 INFO L272 TraceCheckUtils]: 11: Hoare triple {209#false} [75] L36-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (< (mod v_main_~j~0_9 4294967296) 1025) 1 0)) InVars {main_~j~0=v_main_~j~0_9} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~j~0] {209#false} is VALID [2022-04-27 15:56:49,022 INFO L290 TraceCheckUtils]: 12: Hoare triple {209#false} [77] __VERIFIER_assertENTRY-->L7: Formula: (= v___VERIFIER_assert_~cond_2 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {209#false} is VALID [2022-04-27 15:56:49,023 INFO L290 TraceCheckUtils]: 13: Hoare triple {209#false} [80] L7-->L8: Formula: (= v___VERIFIER_assert_~cond_3 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {209#false} is VALID [2022-04-27 15:56:49,025 INFO L290 TraceCheckUtils]: 14: Hoare triple {209#false} [83] L8-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {209#false} is VALID [2022-04-27 15:56:49,026 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 15:56:49,027 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 15:56:49,028 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [376195599] [2022-04-27 15:56:49,028 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [376195599] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 15:56:49,028 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 15:56:49,028 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-27 15:56:49,028 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1050615846] [2022-04-27 15:56:49,028 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 15:56:49,029 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 15 [2022-04-27 15:56:49,029 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 15:56:49,030 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:56:49,056 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 15 edges. 15 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 15:56:49,056 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-27 15:56:49,057 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 15:56:49,058 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-27 15:56:49,058 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-27 15:56:49,058 INFO L87 Difference]: Start difference. First operand 19 states and 20 transitions. Second operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:56:49,256 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:56:49,256 INFO L93 Difference]: Finished difference Result 23 states and 25 transitions. [2022-04-27 15:56:49,257 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-27 15:56:49,258 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 15 [2022-04-27 15:56:49,258 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 15:56:49,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:56:49,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 25 transitions. [2022-04-27 15:56:49,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:56:49,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 25 transitions. [2022-04-27 15:56:49,262 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 25 transitions. [2022-04-27 15:56:49,314 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 25 edges. 25 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 15:56:49,316 INFO L225 Difference]: With dead ends: 23 [2022-04-27 15:56:49,316 INFO L226 Difference]: Without dead ends: 23 [2022-04-27 15:56:49,318 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-04-27 15:56:49,322 INFO L413 NwaCegarLoop]: 21 mSDtfsCounter, 16 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 33 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-27 15:56:49,323 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 33 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-27 15:56:49,324 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2022-04-27 15:56:49,326 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 17. [2022-04-27 15:56:49,326 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 15:56:49,326 INFO L82 GeneralOperation]: Start isEquivalent. First operand 23 states. Second operand has 17 states, 12 states have (on average 1.1666666666666667) internal successors, (14), 12 states have internal predecessors, (14), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:56:49,327 INFO L74 IsIncluded]: Start isIncluded. First operand 23 states. Second operand has 17 states, 12 states have (on average 1.1666666666666667) internal successors, (14), 12 states have internal predecessors, (14), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:56:49,327 INFO L87 Difference]: Start difference. First operand 23 states. Second operand has 17 states, 12 states have (on average 1.1666666666666667) internal successors, (14), 12 states have internal predecessors, (14), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:56:49,330 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:56:49,330 INFO L93 Difference]: Finished difference Result 23 states and 25 transitions. [2022-04-27 15:56:49,331 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 25 transitions. [2022-04-27 15:56:49,331 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:56:49,331 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:56:49,331 INFO L74 IsIncluded]: Start isIncluded. First operand has 17 states, 12 states have (on average 1.1666666666666667) internal successors, (14), 12 states have internal predecessors, (14), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 23 states. [2022-04-27 15:56:49,331 INFO L87 Difference]: Start difference. First operand has 17 states, 12 states have (on average 1.1666666666666667) internal successors, (14), 12 states have internal predecessors, (14), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 23 states. [2022-04-27 15:56:49,332 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:56:49,332 INFO L93 Difference]: Finished difference Result 23 states and 25 transitions. [2022-04-27 15:56:49,332 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 25 transitions. [2022-04-27 15:56:49,333 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:56:49,333 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:56:49,334 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 15:56:49,334 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 15:56:49,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 12 states have (on average 1.1666666666666667) internal successors, (14), 12 states have internal predecessors, (14), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:56:49,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 18 transitions. [2022-04-27 15:56:49,341 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 18 transitions. Word has length 15 [2022-04-27 15:56:49,341 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 15:56:49,341 INFO L495 AbstractCegarLoop]: Abstraction has 17 states and 18 transitions. [2022-04-27 15:56:49,341 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:56:49,342 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 18 transitions. [2022-04-27 15:56:49,343 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-04-27 15:56:49,343 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 15:56:49,343 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 15:56:49,343 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-04-27 15:56:49,343 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 15:56:49,344 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 15:56:49,344 INFO L85 PathProgramCache]: Analyzing trace with hash 686516073, now seen corresponding path program 1 times [2022-04-27 15:56:49,344 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 15:56:49,344 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [143847932] [2022-04-27 15:56:49,344 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 15:56:49,344 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 15:56:49,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-27 15:56:49,424 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-04-27 15:56:49,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-27 15:56:49,505 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-04-27 15:56:49,505 INFO L271 BasicCegarLoop]: Counterexample is feasible [2022-04-27 15:56:49,506 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-04-27 15:56:49,507 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-04-27 15:56:49,509 INFO L356 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2022-04-27 15:56:49,511 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-04-27 15:56:49,547 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.04 03:56:49 BasicIcfg [2022-04-27 15:56:49,547 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-04-27 15:56:49,548 INFO L158 Benchmark]: Toolchain (without parser) took 10285.57ms. Allocated memory was 198.2MB in the beginning and 243.3MB in the end (delta: 45.1MB). Free memory was 141.4MB in the beginning and 184.7MB in the end (delta: -43.3MB). Peak memory consumption was 3.2MB. Max. memory is 8.0GB. [2022-04-27 15:56:49,548 INFO L158 Benchmark]: CDTParser took 0.09ms. Allocated memory is still 198.2MB. Free memory is still 157.6MB. There was no memory consumed. Max. memory is 8.0GB. [2022-04-27 15:56:49,549 INFO L158 Benchmark]: CACSL2BoogieTranslator took 221.64ms. Allocated memory was 198.2MB in the beginning and 243.3MB in the end (delta: 45.1MB). Free memory was 141.3MB in the beginning and 216.7MB in the end (delta: -75.5MB). Peak memory consumption was 14.7MB. Max. memory is 8.0GB. [2022-04-27 15:56:49,549 INFO L158 Benchmark]: Boogie Preprocessor took 30.18ms. Allocated memory is still 243.3MB. Free memory was 216.7MB in the beginning and 215.3MB in the end (delta: 1.5MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-04-27 15:56:49,549 INFO L158 Benchmark]: RCFGBuilder took 248.96ms. Allocated memory is still 243.3MB. Free memory was 215.3MB in the beginning and 202.1MB in the end (delta: 13.1MB). Peak memory consumption was 13.6MB. Max. memory is 8.0GB. [2022-04-27 15:56:49,549 INFO L158 Benchmark]: IcfgTransformer took 7613.10ms. Allocated memory is still 243.3MB. Free memory was 202.1MB in the beginning and 170.2MB in the end (delta: 32.0MB). Peak memory consumption was 31.5MB. Max. memory is 8.0GB. [2022-04-27 15:56:49,549 INFO L158 Benchmark]: TraceAbstraction took 2164.03ms. Allocated memory is still 243.3MB. Free memory was 169.6MB in the beginning and 184.7MB in the end (delta: -15.1MB). There was no memory consumed. Max. memory is 8.0GB. [2022-04-27 15:56:49,564 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from IcfgTransformer: - StatisticsResult: Jordan loop acceleration statistics 1 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult * Results from de.uni_freiburg.informatik.ultimate.core: - AssertionsEnabledResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.09ms. Allocated memory is still 198.2MB. Free memory is still 157.6MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 221.64ms. Allocated memory was 198.2MB in the beginning and 243.3MB in the end (delta: 45.1MB). Free memory was 141.3MB in the beginning and 216.7MB in the end (delta: -75.5MB). Peak memory consumption was 14.7MB. Max. memory is 8.0GB. * Boogie Preprocessor took 30.18ms. Allocated memory is still 243.3MB. Free memory was 216.7MB in the beginning and 215.3MB in the end (delta: 1.5MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 248.96ms. Allocated memory is still 243.3MB. Free memory was 215.3MB in the beginning and 202.1MB in the end (delta: 13.1MB). Peak memory consumption was 13.6MB. Max. memory is 8.0GB. * IcfgTransformer took 7613.10ms. Allocated memory is still 243.3MB. Free memory was 202.1MB in the beginning and 170.2MB in the end (delta: 32.0MB). Peak memory consumption was 31.5MB. Max. memory is 8.0GB. * TraceAbstraction took 2164.03ms. Allocated memory is still 243.3MB. Free memory was 169.6MB in the beginning and 184.7MB in the end (delta: -15.1MB). There was no memory consumed. 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 - CounterExampleResult [Line: 8]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L12] int b; VAL [\old(b)=1029, b=0] [L15] _Bool k=__VERIFIER_nondet_bool(); [L16] unsigned int i,n,j; [L17] int a[1025]; VAL [b=0, k=1] [L19] COND TRUE \read(k) [L20] n=0 VAL [b=0, k=1, n=0] [L25] i=0 [L26] j=__VERIFIER_nondet_uint() [L27] COND FALSE !(j > 10000) VAL [b=0, i=0, j=1023, k=1, n=0] [L30] COND TRUE i <= n [L31] i++ [L32] j= j +2 VAL [b=0, i=1, i++=1027, j=1025, k=1, n=0] [L30] COND FALSE !(i <= n) VAL [b=0, i=1, i++=1027, j=1025, k=1, n=0] [L35] a[i]=0 VAL [b=0, i=1, i++=1027, j=1025, k=1, n=0] [L36] CALL __VERIFIER_assert(j<1025) VAL [\old(cond)=0, b=0] [L7] COND TRUE !(cond) VAL [\old(cond)=0, b=0, cond=0] [L8] reach_error() VAL [\old(cond)=0, b=0, cond=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 25 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 2.1s, OverallIterations: 4, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 54 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 53 mSDsluCounter, 90 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 27 mSDsCounter, 9 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 67 IncrementalHoareTripleChecker+Invalid, 76 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 9 mSolverCounterUnsat, 63 mSDtfsCounter, 67 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 22 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=25occurred in iteration=0, InterpolantAutomatonStates: 13, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 3 MinimizatonAttempts, 9 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.5s InterpolantComputationTime, 61 NumberOfCodeBlocks, 61 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 42 ConstructedInterpolants, 0 QuantifiedInterpolants, 121 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 3 InterpolantComputations, 3 PerfectInterpolantSequences, 0/0 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 RESULT: Ultimate proved your program to be incorrect! [2022-04-27 15:56:49,587 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...