/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-crafted-1/loopv2.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-fb4f59a-m [2022-04-27 16:45:39,222 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-27 16:45:39,224 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-27 16:45:39,260 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-27 16:45:39,261 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-27 16:45:39,262 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-27 16:45:39,264 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-27 16:45:39,266 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-27 16:45:39,267 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-27 16:45:39,270 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-27 16:45:39,271 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-27 16:45:39,272 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-27 16:45:39,272 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-27 16:45:39,273 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-27 16:45:39,274 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-27 16:45:39,276 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-27 16:45:39,277 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-27 16:45:39,277 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-27 16:45:39,279 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-27 16:45:39,283 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-27 16:45:39,285 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-27 16:45:39,286 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-27 16:45:39,286 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-27 16:45:39,287 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-27 16:45:39,288 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-27 16:45:39,293 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-27 16:45:39,294 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-27 16:45:39,294 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-27 16:45:39,294 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-27 16:45:39,295 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-27 16:45:39,295 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-27 16:45:39,295 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-27 16:45:39,297 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-27 16:45:39,297 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-27 16:45:39,297 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-27 16:45:39,298 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-27 16:45:39,298 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-27 16:45:39,298 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-27 16:45:39,299 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-27 16:45:39,299 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-27 16:45:39,299 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-27 16:45:39,301 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-27 16:45:39,301 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/LoopAccelerationJordanC.epf [2022-04-27 16:45:39,312 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-27 16:45:39,312 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-27 16:45:39,313 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-27 16:45:39,313 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-27 16:45:39,313 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-27 16:45:39,314 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-27 16:45:39,314 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-27 16:45:39,314 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-27 16:45:39,314 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-27 16:45:39,315 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-27 16:45:39,315 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-27 16:45:39,315 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-27 16:45:39,315 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-27 16:45:39,315 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-27 16:45:39,315 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-27 16:45:39,315 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-27 16:45:39,315 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-27 16:45:39,315 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-27 16:45:39,316 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-27 16:45:39,316 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-27 16:45:39,316 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-04-27 16:45:39,316 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-04-27 16:45:39,316 INFO L138 SettingsManager]: * TransformationType=LOOP_ACCELERATION_JORDAN WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.core: Log level for class -> de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN; [2022-04-27 16:45:39,523 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-27 16:45:39,548 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-27 16:45:39,550 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-27 16:45:39,550 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-27 16:45:39,551 INFO L275 PluginConnector]: CDTParser initialized [2022-04-27 16:45:39,552 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loops-crafted-1/loopv2.c [2022-04-27 16:45:39,601 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fe8b88cd0/a1a4647daf164364a8b727b412380a97/FLAG8c493b8e3 [2022-04-27 16:45:39,963 INFO L306 CDTParser]: Found 1 translation units. [2022-04-27 16:45:39,963 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loops-crafted-1/loopv2.c [2022-04-27 16:45:39,969 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fe8b88cd0/a1a4647daf164364a8b727b412380a97/FLAG8c493b8e3 [2022-04-27 16:45:39,980 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fe8b88cd0/a1a4647daf164364a8b727b412380a97 [2022-04-27 16:45:39,982 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-27 16:45:39,993 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-04-27 16:45:39,996 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-27 16:45:39,996 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-27 16:45:39,998 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-27 16:45:39,999 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.04 04:45:39" (1/1) ... [2022-04-27 16:45:40,000 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2aca2614 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 04:45:40, skipping insertion in model container [2022-04-27 16:45:40,000 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.04 04:45:39" (1/1) ... [2022-04-27 16:45:40,005 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-27 16:45:40,015 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-27 16:45:40,136 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-crafted-1/loopv2.c[454,467] [2022-04-27 16:45:40,159 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-27 16:45:40,165 INFO L203 MainTranslator]: Completed pre-run [2022-04-27 16:45:40,174 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-crafted-1/loopv2.c[454,467] [2022-04-27 16:45:40,189 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-27 16:45:40,198 INFO L208 MainTranslator]: Completed translation [2022-04-27 16:45:40,198 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 04:45:40 WrapperNode [2022-04-27 16:45:40,198 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-27 16:45:40,199 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-27 16:45:40,199 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-27 16:45:40,199 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-27 16:45:40,206 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 04:45:40" (1/1) ... [2022-04-27 16:45:40,206 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 04:45:40" (1/1) ... [2022-04-27 16:45:40,210 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 04:45:40" (1/1) ... [2022-04-27 16:45:40,210 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 04:45:40" (1/1) ... [2022-04-27 16:45:40,220 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 04:45:40" (1/1) ... [2022-04-27 16:45:40,225 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 04:45:40" (1/1) ... [2022-04-27 16:45:40,226 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 04:45:40" (1/1) ... [2022-04-27 16:45:40,231 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-27 16:45:40,233 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-27 16:45:40,233 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-27 16:45:40,233 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-27 16:45:40,234 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 04:45:40" (1/1) ... [2022-04-27 16:45:40,238 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-27 16:45:40,244 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 16:45:40,254 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-04-27 16:45:40,298 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-04-27 16:45:40,313 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-27 16:45:40,313 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-27 16:45:40,314 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-27 16:45:40,314 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-27 16:45:40,314 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-27 16:45:40,314 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-27 16:45:40,314 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-04-27 16:45:40,314 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-27 16:45:40,315 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-27 16:45:40,315 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-27 16:45:40,315 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-27 16:45:40,315 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-27 16:45:40,315 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-27 16:45:40,315 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-27 16:45:40,316 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-27 16:45:40,316 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-27 16:45:40,316 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-27 16:45:40,316 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-27 16:45:40,317 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-27 16:45:40,317 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-27 16:45:40,363 INFO L234 CfgBuilder]: Building ICFG [2022-04-27 16:45:40,364 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-27 16:45:40,482 INFO L275 CfgBuilder]: Performing block encoding [2022-04-27 16:45:40,486 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-27 16:45:40,487 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-04-27 16:45:40,488 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.04 04:45:40 BoogieIcfgContainer [2022-04-27 16:45:40,488 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-27 16:45:40,488 INFO L113 PluginConnector]: ------------------------IcfgTransformer---------------------------- [2022-04-27 16:45:40,489 INFO L271 PluginConnector]: Initializing IcfgTransformer... [2022-04-27 16:45:40,489 INFO L275 PluginConnector]: IcfgTransformer initialized [2022-04-27 16:45:40,492 INFO L185 PluginConnector]: Executing the observer IcfgTransformationObserver from plugin IcfgTransformer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.04 04:45:40" (1/1) ... [2022-04-27 16:45:40,493 INFO L168 ansformationObserver]: Applying ICFG transformation LOOP_ACCELERATION_JORDAN [2022-04-27 16:45:40,797 INFO L89 elerationTransformer]: Jordan loop acceleration statistics: 0 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=1}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-27 16:45:40,797 INFO L91 elerationTransformer]: Accelerated Formula: (and (= v_main_~i~0_4 (+ v_main_~i~0_5 4)) (< v_main_~i~0_5 v_main_~n~0_7) (= (+ v_main_~i~0_4 2) v_main_~j~0_6)) InVars {main_~i~0=v_main_~i~0_5, main_~n~0=v_main_~n~0_7} OutVars{main_~j~0=v_main_~j~0_6, main_~i~0=v_main_~i~0_4, main_~n~0=v_main_~n~0_7} AuxVars[] AssignedVars[main_~j~0, main_~i~0] to Formula: (or (and (= v_main_~i~0_4 v_main_~i~0_5) (= v_main_~j~0_7 v_main_~j~0_6) (<= v_main_~n~0_7 v_main_~i~0_5)) (let ((.cse0 (div (+ v_main_~i~0_5 (* (- 1) v_main_~i~0_4)) (- 4)))) (and (= (mod (+ v_main_~i~0_5 (* v_main_~i~0_4 3)) 4) 0) (< .cse0 (+ 2 (div (+ (- 1) v_main_~n~0_7 (* (- 1) v_main_~i~0_5)) 4))) (< 0 .cse0) (= v_main_~j~0_6 (+ (* .cse0 4) v_main_~i~0_5 2))))) InVars {main_~i~0=v_main_~i~0_5, main_~n~0=v_main_~n~0_7, main_~j~0=v_main_~j~0_7} OutVars{main_~i~0=v_main_~i~0_4, main_~n~0=v_main_~n~0_7, main_~j~0=v_main_~j~0_6} AuxVars[] AssignedVars[main_~j~0, main_~i~0] [2022-04-27 16:45:40,942 INFO L89 elerationTransformer]: Jordan loop acceleration statistics: 0 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-27 16:45:40,942 INFO L91 elerationTransformer]: Accelerated Formula: (and (= v_main_~k~0_1 (+ v_main_~k~0_2 (- 4))) (= (let ((.cse0 (mod v_main_~j~0_3 2))) (ite (and (< v_main_~j~0_3 0) (not (= .cse0 0))) (+ (- 2) .cse0) .cse0)) 0) (= v_main_~j~0_2 (+ v_main_~j~0_3 (- 4)))) InVars {main_~k~0=v_main_~k~0_2, main_~j~0=v_main_~j~0_3} OutVars{main_~k~0=v_main_~k~0_1, main_~j~0=v_main_~j~0_2} AuxVars[] AssignedVars[main_~k~0, main_~j~0] to Formula: (let ((.cse0 (= (mod v_main_~j~0_3 2) 0))) (or (and (= v_main_~k~0_2 v_main_~k~0_1) (= v_main_~j~0_3 v_main_~j~0_2) (not .cse0)) (and (< 0 (div (+ v_main_~k~0_2 (* (- 1) v_main_~k~0_1)) 4)) (= (mod (+ v_main_~k~0_2 (* v_main_~k~0_1 3)) 4) 0) (= v_main_~j~0_2 (+ (* (- 4) (div (+ v_main_~k~0_2 (- v_main_~k~0_1)) 4)) v_main_~j~0_3)) .cse0))) InVars {main_~k~0=v_main_~k~0_2, main_~j~0=v_main_~j~0_3} OutVars{main_~k~0=v_main_~k~0_1, main_~j~0=v_main_~j~0_2} AuxVars[] AssignedVars[main_~k~0, main_~j~0] [2022-04-27 16:45:40,947 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 27.04 04:45:40 BasicIcfg [2022-04-27 16:45:40,947 INFO L132 PluginConnector]: ------------------------ END IcfgTransformer---------------------------- [2022-04-27 16:45:40,949 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-27 16:45:40,949 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-27 16:45:40,952 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-27 16:45:40,952 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.04 04:45:39" (1/4) ... [2022-04-27 16:45:40,952 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@38a9d60c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.04 04:45:40, skipping insertion in model container [2022-04-27 16:45:40,952 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 04:45:40" (2/4) ... [2022-04-27 16:45:40,953 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@38a9d60c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.04 04:45:40, skipping insertion in model container [2022-04-27 16:45:40,953 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.04 04:45:40" (3/4) ... [2022-04-27 16:45:40,954 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@38a9d60c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.04 04:45:40, skipping insertion in model container [2022-04-27 16:45:40,955 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 27.04 04:45:40" (4/4) ... [2022-04-27 16:45:40,955 INFO L111 eAbstractionObserver]: Analyzing ICFG loopv2.cJordan [2022-04-27 16:45:40,966 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION [2022-04-27 16:45:40,966 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-27 16:45:41,000 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-27 16:45:41,006 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@1cabbfd8, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@36456fb6 [2022-04-27 16:45:41,006 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-27 16:45:41,012 INFO L276 IsEmpty]: Start isEmpty. Operand has 22 states, 14 states have (on average 1.5) internal successors, (21), 15 states have internal predecessors, (21), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-27 16:45:41,016 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-04-27 16:45:41,016 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 16:45:41,017 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 16:45:41,017 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 16:45:41,022 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 16:45:41,022 INFO L85 PathProgramCache]: Analyzing trace with hash -123410816, now seen corresponding path program 1 times [2022-04-27 16:45:41,029 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 16:45:41,030 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1529275123] [2022-04-27 16:45:41,030 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 16:45:41,031 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 16:45:41,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 16:45:41,145 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 16:45:41,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 16:45:41,169 INFO L290 TraceCheckUtils]: 0: Hoare triple {30#(and (= |old(~SIZE~0)| ~SIZE~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [67] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= v_~SIZE~0_3 50000001) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 2) 9) (= (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{~SIZE~0=v_~SIZE~0_3, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[~SIZE~0, #NULL.offset, #NULL.base] {25#true} is VALID [2022-04-27 16:45:41,169 INFO L290 TraceCheckUtils]: 1: Hoare triple {25#true} [70] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {25#true} is VALID [2022-04-27 16:45:41,170 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {25#true} {25#true} [89] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {25#true} is VALID [2022-04-27 16:45:41,171 INFO L272 TraceCheckUtils]: 0: Hoare triple {25#true} [65] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {30#(and (= |old(~SIZE~0)| ~SIZE~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 16:45:41,172 INFO L290 TraceCheckUtils]: 1: Hoare triple {30#(and (= |old(~SIZE~0)| ~SIZE~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [67] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= v_~SIZE~0_3 50000001) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 2) 9) (= (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{~SIZE~0=v_~SIZE~0_3, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[~SIZE~0, #NULL.offset, #NULL.base] {25#true} is VALID [2022-04-27 16:45:41,172 INFO L290 TraceCheckUtils]: 2: Hoare triple {25#true} [70] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {25#true} is VALID [2022-04-27 16:45:41,172 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {25#true} {25#true} [89] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {25#true} is VALID [2022-04-27 16:45:41,172 INFO L272 TraceCheckUtils]: 4: Hoare triple {25#true} [66] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {25#true} is VALID [2022-04-27 16:45:41,173 INFO L290 TraceCheckUtils]: 5: Hoare triple {25#true} [69] mainENTRY-->L20: Formula: (and (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= |v_main_#t~nondet4_2| 2147483647) (= v_main_~n~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_4, main_~j~0=v_main_~j~0_4} AuxVars[] AssignedVars[main_#t~nondet4, main_~k~0, main_~j~0, main_~i~0, main_~n~0] {25#true} is VALID [2022-04-27 16:45:41,173 INFO L290 TraceCheckUtils]: 6: Hoare triple {25#true} [72] L20-->L22-2: Formula: (and (= v_main_~i~0_2 0) (= v_main_~j~0_5 0) (<= v_main_~n~0_5 v_~SIZE~0_2)) InVars {~SIZE~0=v_~SIZE~0_2, main_~n~0=v_main_~n~0_5} OutVars{~SIZE~0=v_~SIZE~0_2, main_~i~0=v_main_~i~0_2, main_~n~0=v_main_~n~0_5, main_~j~0=v_main_~j~0_5} AuxVars[] AssignedVars[main_~j~0, main_~i~0] {25#true} is VALID [2022-04-27 16:45:41,173 INFO L290 TraceCheckUtils]: 7: Hoare triple {25#true} [74] L22-2-->L22-3: Formula: false InVars {} OutVars{} AuxVars[] AssignedVars[] {26#false} is VALID [2022-04-27 16:45:41,174 INFO L290 TraceCheckUtils]: 8: Hoare triple {26#false} [77] L22-3-->L28-2: Formula: (= v_main_~i~0_6 v_main_~k~0_5) InVars {main_~i~0=v_main_~i~0_6} OutVars{main_~i~0=v_main_~i~0_6, main_~k~0=v_main_~k~0_5} AuxVars[] AssignedVars[main_~k~0] {26#false} is VALID [2022-04-27 16:45:41,174 INFO L290 TraceCheckUtils]: 9: Hoare triple {26#false} [78] L28-2-->L28-3: Formula: false InVars {} OutVars{} AuxVars[] AssignedVars[] {26#false} is VALID [2022-04-27 16:45:41,174 INFO L272 TraceCheckUtils]: 10: Hoare triple {26#false} [81] L28-3-->__VERIFIER_assertENTRY: Formula: (= (ite (= (let ((.cse0 (mod v_main_~k~0_6 2))) (ite (and (< v_main_~k~0_6 0) (not (= .cse0 0))) (+ (- 2) .cse0) .cse0)) 0) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~k~0=v_main_~k~0_6} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~k~0] {26#false} is VALID [2022-04-27 16:45:41,174 INFO L290 TraceCheckUtils]: 11: Hoare triple {26#false} [83] __VERIFIER_assertENTRY-->L11: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {26#false} is VALID [2022-04-27 16:45:41,174 INFO L290 TraceCheckUtils]: 12: Hoare triple {26#false} [84] L11-->L12: Formula: (= v___VERIFIER_assert_~cond_2 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {26#false} is VALID [2022-04-27 16:45:41,175 INFO L290 TraceCheckUtils]: 13: Hoare triple {26#false} [86] L12-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {26#false} is VALID [2022-04-27 16:45:41,175 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 16:45:41,175 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 16:45:41,175 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1529275123] [2022-04-27 16:45:41,176 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1529275123] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 16:45:41,176 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 16:45:41,176 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-27 16:45:41,178 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [828434632] [2022-04-27 16:45:41,179 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 16:45:41,182 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 2 states have internal predecessors, (10), 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 14 [2022-04-27 16:45:41,183 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 16:45:41,185 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 2 states have internal predecessors, (10), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 16:45:41,199 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 14 edges. 14 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 16:45:41,200 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-27 16:45:41,200 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 16:45:41,220 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-27 16:45:41,221 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-27 16:45:41,222 INFO L87 Difference]: Start difference. First operand has 22 states, 14 states have (on average 1.5) internal successors, (21), 15 states have internal predecessors, (21), 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.3333333333333335) internal successors, (10), 2 states have internal predecessors, (10), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 16:45:41,274 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 16:45:41,274 INFO L93 Difference]: Finished difference Result 22 states and 24 transitions. [2022-04-27 16:45:41,274 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-27 16:45:41,275 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 2 states have internal predecessors, (10), 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 14 [2022-04-27 16:45:41,275 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 16:45:41,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 2 states have internal predecessors, (10), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 16:45:41,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 27 transitions. [2022-04-27 16:45:41,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 2 states have internal predecessors, (10), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 16:45:41,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 27 transitions. [2022-04-27 16:45:41,325 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 27 transitions. [2022-04-27 16:45:41,356 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 27 edges. 27 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 16:45:41,363 INFO L225 Difference]: With dead ends: 22 [2022-04-27 16:45:41,363 INFO L226 Difference]: Without dead ends: 15 [2022-04-27 16:45:41,364 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-27 16:45:41,367 INFO L413 NwaCegarLoop]: 21 mSDtfsCounter, 15 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 24 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 16:45:41,369 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 24 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 16:45:41,379 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2022-04-27 16:45:41,387 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2022-04-27 16:45:41,387 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 16:45:41,388 INFO L82 GeneralOperation]: Start isEquivalent. First operand 15 states. Second operand has 15 states, 10 states have (on average 1.2) internal successors, (12), 10 states have internal predecessors, (12), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 16:45:41,388 INFO L74 IsIncluded]: Start isIncluded. First operand 15 states. Second operand has 15 states, 10 states have (on average 1.2) internal successors, (12), 10 states have internal predecessors, (12), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 16:45:41,388 INFO L87 Difference]: Start difference. First operand 15 states. Second operand has 15 states, 10 states have (on average 1.2) internal successors, (12), 10 states have internal predecessors, (12), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 16:45:41,394 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 16:45:41,394 INFO L93 Difference]: Finished difference Result 15 states and 16 transitions. [2022-04-27 16:45:41,394 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 16 transitions. [2022-04-27 16:45:41,394 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 16:45:41,395 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 16:45:41,395 INFO L74 IsIncluded]: Start isIncluded. First operand has 15 states, 10 states have (on average 1.2) internal successors, (12), 10 states have internal predecessors, (12), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 15 states. [2022-04-27 16:45:41,395 INFO L87 Difference]: Start difference. First operand has 15 states, 10 states have (on average 1.2) internal successors, (12), 10 states have internal predecessors, (12), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 15 states. [2022-04-27 16:45:41,397 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 16:45:41,397 INFO L93 Difference]: Finished difference Result 15 states and 16 transitions. [2022-04-27 16:45:41,397 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 16 transitions. [2022-04-27 16:45:41,398 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 16:45:41,398 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 16:45:41,398 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 16:45:41,398 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 16:45:41,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 10 states have (on average 1.2) internal successors, (12), 10 states have internal predecessors, (12), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 16:45:41,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 16 transitions. [2022-04-27 16:45:41,402 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 16 transitions. Word has length 14 [2022-04-27 16:45:41,404 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 16:45:41,404 INFO L495 AbstractCegarLoop]: Abstraction has 15 states and 16 transitions. [2022-04-27 16:45:41,408 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 2 states have internal predecessors, (10), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 16:45:41,408 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 16 transitions. [2022-04-27 16:45:41,409 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-04-27 16:45:41,409 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 16:45:41,409 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 16:45:41,409 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-27 16:45:41,410 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 16:45:41,410 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 16:45:41,410 INFO L85 PathProgramCache]: Analyzing trace with hash 765016386, now seen corresponding path program 1 times [2022-04-27 16:45:41,410 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 16:45:41,411 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1921606248] [2022-04-27 16:45:41,411 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 16:45:41,411 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 16:45:41,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 16:45:41,499 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 16:45:41,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 16:45:41,517 INFO L290 TraceCheckUtils]: 0: Hoare triple {106#(and (= |old(~SIZE~0)| ~SIZE~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [67] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= v_~SIZE~0_3 50000001) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 2) 9) (= (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{~SIZE~0=v_~SIZE~0_3, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[~SIZE~0, #NULL.offset, #NULL.base] {100#true} is VALID [2022-04-27 16:45:41,518 INFO L290 TraceCheckUtils]: 1: Hoare triple {100#true} [70] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {100#true} is VALID [2022-04-27 16:45:41,518 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {100#true} {100#true} [89] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {100#true} is VALID [2022-04-27 16:45:41,519 INFO L272 TraceCheckUtils]: 0: Hoare triple {100#true} [65] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {106#(and (= |old(~SIZE~0)| ~SIZE~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 16:45:41,519 INFO L290 TraceCheckUtils]: 1: Hoare triple {106#(and (= |old(~SIZE~0)| ~SIZE~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [67] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= v_~SIZE~0_3 50000001) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 2) 9) (= (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{~SIZE~0=v_~SIZE~0_3, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[~SIZE~0, #NULL.offset, #NULL.base] {100#true} is VALID [2022-04-27 16:45:41,519 INFO L290 TraceCheckUtils]: 2: Hoare triple {100#true} [70] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {100#true} is VALID [2022-04-27 16:45:41,519 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {100#true} {100#true} [89] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {100#true} is VALID [2022-04-27 16:45:41,520 INFO L272 TraceCheckUtils]: 4: Hoare triple {100#true} [66] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {100#true} is VALID [2022-04-27 16:45:41,520 INFO L290 TraceCheckUtils]: 5: Hoare triple {100#true} [69] mainENTRY-->L20: Formula: (and (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= |v_main_#t~nondet4_2| 2147483647) (= v_main_~n~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_4, main_~j~0=v_main_~j~0_4} AuxVars[] AssignedVars[main_#t~nondet4, main_~k~0, main_~j~0, main_~i~0, main_~n~0] {100#true} is VALID [2022-04-27 16:45:41,520 INFO L290 TraceCheckUtils]: 6: Hoare triple {100#true} [72] L20-->L22-2: Formula: (and (= v_main_~i~0_2 0) (= v_main_~j~0_5 0) (<= v_main_~n~0_5 v_~SIZE~0_2)) InVars {~SIZE~0=v_~SIZE~0_2, main_~n~0=v_main_~n~0_5} OutVars{~SIZE~0=v_~SIZE~0_2, main_~i~0=v_main_~i~0_2, main_~n~0=v_main_~n~0_5, main_~j~0=v_main_~j~0_5} AuxVars[] AssignedVars[main_~j~0, main_~i~0] {105#(= main_~j~0 0)} is VALID [2022-04-27 16:45:41,521 INFO L290 TraceCheckUtils]: 7: Hoare triple {105#(= main_~j~0 0)} [75] L22-2-->L22-3: Formula: (not (< v_main_~i~0_3 v_main_~n~0_6)) InVars {main_~i~0=v_main_~i~0_3, main_~n~0=v_main_~n~0_6} OutVars{main_~i~0=v_main_~i~0_3, main_~n~0=v_main_~n~0_6} AuxVars[] AssignedVars[] {105#(= main_~j~0 0)} is VALID [2022-04-27 16:45:41,521 INFO L290 TraceCheckUtils]: 8: Hoare triple {105#(= main_~j~0 0)} [77] L22-3-->L28-2: Formula: (= v_main_~i~0_6 v_main_~k~0_5) InVars {main_~i~0=v_main_~i~0_6} OutVars{main_~i~0=v_main_~i~0_6, main_~k~0=v_main_~k~0_5} AuxVars[] AssignedVars[main_~k~0] {105#(= main_~j~0 0)} is VALID [2022-04-27 16:45:41,522 INFO L290 TraceCheckUtils]: 9: Hoare triple {105#(= main_~j~0 0)} [79] L28-2-->L28-3: Formula: (not (= (let ((.cse0 (mod v_main_~j~0_1 2))) (ite (and (not (= .cse0 0)) (< v_main_~j~0_1 0)) (+ (- 2) .cse0) .cse0)) 0)) InVars {main_~j~0=v_main_~j~0_1} OutVars{main_~j~0=v_main_~j~0_1} AuxVars[] AssignedVars[] {101#false} is VALID [2022-04-27 16:45:41,522 INFO L272 TraceCheckUtils]: 10: Hoare triple {101#false} [81] L28-3-->__VERIFIER_assertENTRY: Formula: (= (ite (= (let ((.cse0 (mod v_main_~k~0_6 2))) (ite (and (< v_main_~k~0_6 0) (not (= .cse0 0))) (+ (- 2) .cse0) .cse0)) 0) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~k~0=v_main_~k~0_6} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~k~0] {101#false} is VALID [2022-04-27 16:45:41,522 INFO L290 TraceCheckUtils]: 11: Hoare triple {101#false} [83] __VERIFIER_assertENTRY-->L11: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {101#false} is VALID [2022-04-27 16:45:41,522 INFO L290 TraceCheckUtils]: 12: Hoare triple {101#false} [84] L11-->L12: Formula: (= v___VERIFIER_assert_~cond_2 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {101#false} is VALID [2022-04-27 16:45:41,522 INFO L290 TraceCheckUtils]: 13: Hoare triple {101#false} [86] L12-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {101#false} is VALID [2022-04-27 16:45:41,522 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 16:45:41,523 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 16:45:41,523 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1921606248] [2022-04-27 16:45:41,523 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1921606248] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 16:45:41,523 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 16:45:41,523 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-27 16:45:41,523 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [459103650] [2022-04-27 16:45:41,523 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 16:45:41,525 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.5) internal successors, (10), 3 states have internal predecessors, (10), 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 14 [2022-04-27 16:45:41,525 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 16:45:41,525 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 2.5) internal successors, (10), 3 states have internal predecessors, (10), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 16:45:41,537 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 14 edges. 14 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 16:45:41,538 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-27 16:45:41,540 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 16:45:41,540 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-27 16:45:41,541 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-27 16:45:41,541 INFO L87 Difference]: Start difference. First operand 15 states and 16 transitions. Second operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 3 states have internal predecessors, (10), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 16:45:41,592 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 16:45:41,592 INFO L93 Difference]: Finished difference Result 18 states and 20 transitions. [2022-04-27 16:45:41,593 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-27 16:45:41,593 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.5) internal successors, (10), 3 states have internal predecessors, (10), 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 14 [2022-04-27 16:45:41,593 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 16:45:41,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 3 states have internal predecessors, (10), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 16:45:41,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 21 transitions. [2022-04-27 16:45:41,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 3 states have internal predecessors, (10), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 16:45:41,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 21 transitions. [2022-04-27 16:45:41,600 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 21 transitions. [2022-04-27 16:45:41,621 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 21 edges. 21 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 16:45:41,622 INFO L225 Difference]: With dead ends: 18 [2022-04-27 16:45:41,622 INFO L226 Difference]: Without dead ends: 18 [2022-04-27 16:45:41,623 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-27 16:45:41,624 INFO L413 NwaCegarLoop]: 13 mSDtfsCounter, 12 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 20 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 16:45:41,625 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 20 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 16:45:41,626 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2022-04-27 16:45:41,628 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2022-04-27 16:45:41,628 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 16:45:41,629 INFO L82 GeneralOperation]: Start isEquivalent. First operand 18 states. Second operand has 18 states, 13 states have (on average 1.2307692307692308) internal successors, (16), 13 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 16:45:41,629 INFO L74 IsIncluded]: Start isIncluded. First operand 18 states. Second operand has 18 states, 13 states have (on average 1.2307692307692308) internal successors, (16), 13 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 16:45:41,630 INFO L87 Difference]: Start difference. First operand 18 states. Second operand has 18 states, 13 states have (on average 1.2307692307692308) internal successors, (16), 13 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 16:45:41,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 16:45:41,631 INFO L93 Difference]: Finished difference Result 18 states and 20 transitions. [2022-04-27 16:45:41,631 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 20 transitions. [2022-04-27 16:45:41,632 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 16:45:41,632 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 16:45:41,632 INFO L74 IsIncluded]: Start isIncluded. First operand has 18 states, 13 states have (on average 1.2307692307692308) internal successors, (16), 13 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 18 states. [2022-04-27 16:45:41,632 INFO L87 Difference]: Start difference. First operand has 18 states, 13 states have (on average 1.2307692307692308) internal successors, (16), 13 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 18 states. [2022-04-27 16:45:41,633 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 16:45:41,634 INFO L93 Difference]: Finished difference Result 18 states and 20 transitions. [2022-04-27 16:45:41,634 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 20 transitions. [2022-04-27 16:45:41,634 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 16:45:41,634 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 16:45:41,634 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 16:45:41,634 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 16:45:41,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 13 states have (on average 1.2307692307692308) internal successors, (16), 13 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 16:45:41,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 20 transitions. [2022-04-27 16:45:41,636 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 20 transitions. Word has length 14 [2022-04-27 16:45:41,636 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 16:45:41,636 INFO L495 AbstractCegarLoop]: Abstraction has 18 states and 20 transitions. [2022-04-27 16:45:41,636 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.5) internal successors, (10), 3 states have internal predecessors, (10), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 16:45:41,636 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 20 transitions. [2022-04-27 16:45:41,637 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-04-27 16:45:41,637 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 16:45:41,637 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 16:45:41,637 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-27 16:45:41,637 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 16:45:41,638 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 16:45:41,638 INFO L85 PathProgramCache]: Analyzing trace with hash -2027574220, now seen corresponding path program 1 times [2022-04-27 16:45:41,638 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 16:45:41,638 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2067915274] [2022-04-27 16:45:41,638 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 16:45:41,638 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 16:45:41,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 16:45:41,739 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 16:45:41,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 16:45:41,756 INFO L290 TraceCheckUtils]: 0: Hoare triple {190#(and (= |old(~SIZE~0)| ~SIZE~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [67] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= v_~SIZE~0_3 50000001) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 2) 9) (= (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{~SIZE~0=v_~SIZE~0_3, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[~SIZE~0, #NULL.offset, #NULL.base] {183#true} is VALID [2022-04-27 16:45:41,757 INFO L290 TraceCheckUtils]: 1: Hoare triple {183#true} [70] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {183#true} is VALID [2022-04-27 16:45:41,758 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {183#true} {183#true} [89] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {183#true} is VALID [2022-04-27 16:45:41,758 INFO L272 TraceCheckUtils]: 0: Hoare triple {183#true} [65] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {190#(and (= |old(~SIZE~0)| ~SIZE~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 16:45:41,759 INFO L290 TraceCheckUtils]: 1: Hoare triple {190#(and (= |old(~SIZE~0)| ~SIZE~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [67] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= v_~SIZE~0_3 50000001) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 2) 9) (= (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{~SIZE~0=v_~SIZE~0_3, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[~SIZE~0, #NULL.offset, #NULL.base] {183#true} is VALID [2022-04-27 16:45:41,759 INFO L290 TraceCheckUtils]: 2: Hoare triple {183#true} [70] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {183#true} is VALID [2022-04-27 16:45:41,760 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {183#true} {183#true} [89] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {183#true} is VALID [2022-04-27 16:45:41,760 INFO L272 TraceCheckUtils]: 4: Hoare triple {183#true} [66] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {183#true} is VALID [2022-04-27 16:45:41,760 INFO L290 TraceCheckUtils]: 5: Hoare triple {183#true} [69] mainENTRY-->L20: Formula: (and (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= |v_main_#t~nondet4_2| 2147483647) (= v_main_~n~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_4, main_~j~0=v_main_~j~0_4} AuxVars[] AssignedVars[main_#t~nondet4, main_~k~0, main_~j~0, main_~i~0, main_~n~0] {183#true} is VALID [2022-04-27 16:45:41,761 INFO L290 TraceCheckUtils]: 6: Hoare triple {183#true} [72] L20-->L22-2: Formula: (and (= v_main_~i~0_2 0) (= v_main_~j~0_5 0) (<= v_main_~n~0_5 v_~SIZE~0_2)) InVars {~SIZE~0=v_~SIZE~0_2, main_~n~0=v_main_~n~0_5} OutVars{~SIZE~0=v_~SIZE~0_2, main_~i~0=v_main_~i~0_2, main_~n~0=v_main_~n~0_5, main_~j~0=v_main_~j~0_5} AuxVars[] AssignedVars[main_~j~0, main_~i~0] {188#(= main_~j~0 0)} is VALID [2022-04-27 16:45:41,761 INFO L290 TraceCheckUtils]: 7: Hoare triple {188#(= main_~j~0 0)} [75] L22-2-->L22-3: Formula: (not (< v_main_~i~0_3 v_main_~n~0_6)) InVars {main_~i~0=v_main_~i~0_3, main_~n~0=v_main_~n~0_6} OutVars{main_~i~0=v_main_~i~0_3, main_~n~0=v_main_~n~0_6} AuxVars[] AssignedVars[] {188#(= main_~j~0 0)} is VALID [2022-04-27 16:45:41,762 INFO L290 TraceCheckUtils]: 8: Hoare triple {188#(= main_~j~0 0)} [77] L22-3-->L28-2: Formula: (= v_main_~i~0_6 v_main_~k~0_5) InVars {main_~i~0=v_main_~i~0_6} OutVars{main_~i~0=v_main_~i~0_6, main_~k~0=v_main_~k~0_5} AuxVars[] AssignedVars[main_~k~0] {188#(= main_~j~0 0)} is VALID [2022-04-27 16:45:41,763 INFO L290 TraceCheckUtils]: 9: Hoare triple {188#(= main_~j~0 0)} [80] L28-2-->L28-2: Formula: (let ((.cse0 (= (mod v_main_~j~0_3 2) 0))) (or (and (= v_main_~k~0_2 v_main_~k~0_1) (= v_main_~j~0_3 v_main_~j~0_2) (not .cse0)) (and (< 0 (div (+ v_main_~k~0_2 (* (- 1) v_main_~k~0_1)) 4)) (= (mod (+ v_main_~k~0_2 (* v_main_~k~0_1 3)) 4) 0) (= v_main_~j~0_2 (+ (* (- 4) (div (+ v_main_~k~0_2 (- v_main_~k~0_1)) 4)) v_main_~j~0_3)) .cse0))) InVars {main_~k~0=v_main_~k~0_2, main_~j~0=v_main_~j~0_3} OutVars{main_~k~0=v_main_~k~0_1, main_~j~0=v_main_~j~0_2} AuxVars[] AssignedVars[main_~k~0, main_~j~0] {189#(<= main_~j~0 (* 2 (div main_~j~0 2)))} is VALID [2022-04-27 16:45:41,763 INFO L290 TraceCheckUtils]: 10: Hoare triple {189#(<= main_~j~0 (* 2 (div main_~j~0 2)))} [79] L28-2-->L28-3: Formula: (not (= (let ((.cse0 (mod v_main_~j~0_1 2))) (ite (and (not (= .cse0 0)) (< v_main_~j~0_1 0)) (+ (- 2) .cse0) .cse0)) 0)) InVars {main_~j~0=v_main_~j~0_1} OutVars{main_~j~0=v_main_~j~0_1} AuxVars[] AssignedVars[] {184#false} is VALID [2022-04-27 16:45:41,763 INFO L272 TraceCheckUtils]: 11: Hoare triple {184#false} [81] L28-3-->__VERIFIER_assertENTRY: Formula: (= (ite (= (let ((.cse0 (mod v_main_~k~0_6 2))) (ite (and (< v_main_~k~0_6 0) (not (= .cse0 0))) (+ (- 2) .cse0) .cse0)) 0) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~k~0=v_main_~k~0_6} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~k~0] {184#false} is VALID [2022-04-27 16:45:41,766 INFO L290 TraceCheckUtils]: 12: Hoare triple {184#false} [83] __VERIFIER_assertENTRY-->L11: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {184#false} is VALID [2022-04-27 16:45:41,766 INFO L290 TraceCheckUtils]: 13: Hoare triple {184#false} [84] L11-->L12: Formula: (= v___VERIFIER_assert_~cond_2 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {184#false} is VALID [2022-04-27 16:45:41,767 INFO L290 TraceCheckUtils]: 14: Hoare triple {184#false} [86] L12-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {184#false} is VALID [2022-04-27 16:45:41,767 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 16:45:41,768 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 16:45:41,768 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2067915274] [2022-04-27 16:45:41,768 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2067915274] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 16:45:41,768 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [610302977] [2022-04-27 16:45:41,768 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 16:45:41,768 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 16:45:41,768 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 16:45:41,775 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-27 16:45:41,777 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-04-27 16:45:41,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 16:45:41,813 INFO L263 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 8 conjunts are in the unsatisfiable core [2022-04-27 16:45:41,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 16:45:41,829 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 16:45:42,286 INFO L272 TraceCheckUtils]: 0: Hoare triple {183#true} [65] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {183#true} is VALID [2022-04-27 16:45:42,286 INFO L290 TraceCheckUtils]: 1: Hoare triple {183#true} [67] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= v_~SIZE~0_3 50000001) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 2) 9) (= (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{~SIZE~0=v_~SIZE~0_3, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[~SIZE~0, #NULL.offset, #NULL.base] {183#true} is VALID [2022-04-27 16:45:42,287 INFO L290 TraceCheckUtils]: 2: Hoare triple {183#true} [70] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {183#true} is VALID [2022-04-27 16:45:42,287 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {183#true} {183#true} [89] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {183#true} is VALID [2022-04-27 16:45:42,287 INFO L272 TraceCheckUtils]: 4: Hoare triple {183#true} [66] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {183#true} is VALID [2022-04-27 16:45:42,287 INFO L290 TraceCheckUtils]: 5: Hoare triple {183#true} [69] mainENTRY-->L20: Formula: (and (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= |v_main_#t~nondet4_2| 2147483647) (= v_main_~n~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_4, main_~j~0=v_main_~j~0_4} AuxVars[] AssignedVars[main_#t~nondet4, main_~k~0, main_~j~0, main_~i~0, main_~n~0] {183#true} is VALID [2022-04-27 16:45:42,287 INFO L290 TraceCheckUtils]: 6: Hoare triple {183#true} [72] L20-->L22-2: Formula: (and (= v_main_~i~0_2 0) (= v_main_~j~0_5 0) (<= v_main_~n~0_5 v_~SIZE~0_2)) InVars {~SIZE~0=v_~SIZE~0_2, main_~n~0=v_main_~n~0_5} OutVars{~SIZE~0=v_~SIZE~0_2, main_~i~0=v_main_~i~0_2, main_~n~0=v_main_~n~0_5, main_~j~0=v_main_~j~0_5} AuxVars[] AssignedVars[main_~j~0, main_~i~0] {212#(= main_~i~0 0)} is VALID [2022-04-27 16:45:42,288 INFO L290 TraceCheckUtils]: 7: Hoare triple {212#(= main_~i~0 0)} [75] L22-2-->L22-3: Formula: (not (< v_main_~i~0_3 v_main_~n~0_6)) InVars {main_~i~0=v_main_~i~0_3, main_~n~0=v_main_~n~0_6} OutVars{main_~i~0=v_main_~i~0_3, main_~n~0=v_main_~n~0_6} AuxVars[] AssignedVars[] {212#(= main_~i~0 0)} is VALID [2022-04-27 16:45:42,288 INFO L290 TraceCheckUtils]: 8: Hoare triple {212#(= main_~i~0 0)} [77] L22-3-->L28-2: Formula: (= v_main_~i~0_6 v_main_~k~0_5) InVars {main_~i~0=v_main_~i~0_6} OutVars{main_~i~0=v_main_~i~0_6, main_~k~0=v_main_~k~0_5} AuxVars[] AssignedVars[main_~k~0] {219#(= main_~k~0 0)} is VALID [2022-04-27 16:45:42,289 INFO L290 TraceCheckUtils]: 9: Hoare triple {219#(= main_~k~0 0)} [80] L28-2-->L28-2: Formula: (let ((.cse0 (= (mod v_main_~j~0_3 2) 0))) (or (and (= v_main_~k~0_2 v_main_~k~0_1) (= v_main_~j~0_3 v_main_~j~0_2) (not .cse0)) (and (< 0 (div (+ v_main_~k~0_2 (* (- 1) v_main_~k~0_1)) 4)) (= (mod (+ v_main_~k~0_2 (* v_main_~k~0_1 3)) 4) 0) (= v_main_~j~0_2 (+ (* (- 4) (div (+ v_main_~k~0_2 (- v_main_~k~0_1)) 4)) v_main_~j~0_3)) .cse0))) InVars {main_~k~0=v_main_~k~0_2, main_~j~0=v_main_~j~0_3} OutVars{main_~k~0=v_main_~k~0_1, main_~j~0=v_main_~j~0_2} AuxVars[] AssignedVars[main_~k~0, main_~j~0] {223#(or (= main_~k~0 0) (and (= (mod (* main_~k~0 3) 4) 0) (< 0 (div (* (- 1) main_~k~0) 4))))} is VALID [2022-04-27 16:45:42,290 INFO L290 TraceCheckUtils]: 10: Hoare triple {223#(or (= main_~k~0 0) (and (= (mod (* main_~k~0 3) 4) 0) (< 0 (div (* (- 1) main_~k~0) 4))))} [79] L28-2-->L28-3: Formula: (not (= (let ((.cse0 (mod v_main_~j~0_1 2))) (ite (and (not (= .cse0 0)) (< v_main_~j~0_1 0)) (+ (- 2) .cse0) .cse0)) 0)) InVars {main_~j~0=v_main_~j~0_1} OutVars{main_~j~0=v_main_~j~0_1} AuxVars[] AssignedVars[] {223#(or (= main_~k~0 0) (and (= (mod (* main_~k~0 3) 4) 0) (< 0 (div (* (- 1) main_~k~0) 4))))} is VALID [2022-04-27 16:45:42,291 INFO L272 TraceCheckUtils]: 11: Hoare triple {223#(or (= main_~k~0 0) (and (= (mod (* main_~k~0 3) 4) 0) (< 0 (div (* (- 1) main_~k~0) 4))))} [81] L28-3-->__VERIFIER_assertENTRY: Formula: (= (ite (= (let ((.cse0 (mod v_main_~k~0_6 2))) (ite (and (< v_main_~k~0_6 0) (not (= .cse0 0))) (+ (- 2) .cse0) .cse0)) 0) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~k~0=v_main_~k~0_6} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~k~0] {230#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 16:45:42,291 INFO L290 TraceCheckUtils]: 12: Hoare triple {230#(<= 1 |__VERIFIER_assert_#in~cond|)} [83] __VERIFIER_assertENTRY-->L11: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {234#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 16:45:42,292 INFO L290 TraceCheckUtils]: 13: Hoare triple {234#(<= 1 __VERIFIER_assert_~cond)} [84] L11-->L12: Formula: (= v___VERIFIER_assert_~cond_2 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {184#false} is VALID [2022-04-27 16:45:42,292 INFO L290 TraceCheckUtils]: 14: Hoare triple {184#false} [86] L12-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {184#false} is VALID [2022-04-27 16:45:42,292 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 16:45:42,292 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 16:45:42,953 INFO L290 TraceCheckUtils]: 14: Hoare triple {184#false} [86] L12-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {184#false} is VALID [2022-04-27 16:45:42,953 INFO L290 TraceCheckUtils]: 13: Hoare triple {234#(<= 1 __VERIFIER_assert_~cond)} [84] L11-->L12: Formula: (= v___VERIFIER_assert_~cond_2 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {184#false} is VALID [2022-04-27 16:45:42,954 INFO L290 TraceCheckUtils]: 12: Hoare triple {230#(<= 1 |__VERIFIER_assert_#in~cond|)} [83] __VERIFIER_assertENTRY-->L11: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {234#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 16:45:42,954 INFO L272 TraceCheckUtils]: 11: Hoare triple {250#(= (mod main_~k~0 2) 0)} [81] L28-3-->__VERIFIER_assertENTRY: Formula: (= (ite (= (let ((.cse0 (mod v_main_~k~0_6 2))) (ite (and (< v_main_~k~0_6 0) (not (= .cse0 0))) (+ (- 2) .cse0) .cse0)) 0) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~k~0=v_main_~k~0_6} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~k~0] {230#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 16:45:42,955 INFO L290 TraceCheckUtils]: 10: Hoare triple {250#(= (mod main_~k~0 2) 0)} [79] L28-2-->L28-3: Formula: (not (= (let ((.cse0 (mod v_main_~j~0_1 2))) (ite (and (not (= .cse0 0)) (< v_main_~j~0_1 0)) (+ (- 2) .cse0) .cse0)) 0)) InVars {main_~j~0=v_main_~j~0_1} OutVars{main_~j~0=v_main_~j~0_1} AuxVars[] AssignedVars[] {250#(= (mod main_~k~0 2) 0)} is VALID [2022-04-27 16:45:42,955 INFO L290 TraceCheckUtils]: 9: Hoare triple {250#(= (mod main_~k~0 2) 0)} [80] L28-2-->L28-2: Formula: (let ((.cse0 (= (mod v_main_~j~0_3 2) 0))) (or (and (= v_main_~k~0_2 v_main_~k~0_1) (= v_main_~j~0_3 v_main_~j~0_2) (not .cse0)) (and (< 0 (div (+ v_main_~k~0_2 (* (- 1) v_main_~k~0_1)) 4)) (= (mod (+ v_main_~k~0_2 (* v_main_~k~0_1 3)) 4) 0) (= v_main_~j~0_2 (+ (* (- 4) (div (+ v_main_~k~0_2 (- v_main_~k~0_1)) 4)) v_main_~j~0_3)) .cse0))) InVars {main_~k~0=v_main_~k~0_2, main_~j~0=v_main_~j~0_3} OutVars{main_~k~0=v_main_~k~0_1, main_~j~0=v_main_~j~0_2} AuxVars[] AssignedVars[main_~k~0, main_~j~0] {250#(= (mod main_~k~0 2) 0)} is VALID [2022-04-27 16:45:42,956 INFO L290 TraceCheckUtils]: 8: Hoare triple {260#(= 0 (mod main_~i~0 2))} [77] L22-3-->L28-2: Formula: (= v_main_~i~0_6 v_main_~k~0_5) InVars {main_~i~0=v_main_~i~0_6} OutVars{main_~i~0=v_main_~i~0_6, main_~k~0=v_main_~k~0_5} AuxVars[] AssignedVars[main_~k~0] {250#(= (mod main_~k~0 2) 0)} is VALID [2022-04-27 16:45:42,956 INFO L290 TraceCheckUtils]: 7: Hoare triple {260#(= 0 (mod main_~i~0 2))} [75] L22-2-->L22-3: Formula: (not (< v_main_~i~0_3 v_main_~n~0_6)) InVars {main_~i~0=v_main_~i~0_3, main_~n~0=v_main_~n~0_6} OutVars{main_~i~0=v_main_~i~0_3, main_~n~0=v_main_~n~0_6} AuxVars[] AssignedVars[] {260#(= 0 (mod main_~i~0 2))} is VALID [2022-04-27 16:45:42,957 INFO L290 TraceCheckUtils]: 6: Hoare triple {183#true} [72] L20-->L22-2: Formula: (and (= v_main_~i~0_2 0) (= v_main_~j~0_5 0) (<= v_main_~n~0_5 v_~SIZE~0_2)) InVars {~SIZE~0=v_~SIZE~0_2, main_~n~0=v_main_~n~0_5} OutVars{~SIZE~0=v_~SIZE~0_2, main_~i~0=v_main_~i~0_2, main_~n~0=v_main_~n~0_5, main_~j~0=v_main_~j~0_5} AuxVars[] AssignedVars[main_~j~0, main_~i~0] {260#(= 0 (mod main_~i~0 2))} is VALID [2022-04-27 16:45:42,957 INFO L290 TraceCheckUtils]: 5: Hoare triple {183#true} [69] mainENTRY-->L20: Formula: (and (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= |v_main_#t~nondet4_2| 2147483647) (= v_main_~n~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_4, main_~j~0=v_main_~j~0_4} AuxVars[] AssignedVars[main_#t~nondet4, main_~k~0, main_~j~0, main_~i~0, main_~n~0] {183#true} is VALID [2022-04-27 16:45:42,957 INFO L272 TraceCheckUtils]: 4: Hoare triple {183#true} [66] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {183#true} is VALID [2022-04-27 16:45:42,957 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {183#true} {183#true} [89] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {183#true} is VALID [2022-04-27 16:45:42,957 INFO L290 TraceCheckUtils]: 2: Hoare triple {183#true} [70] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {183#true} is VALID [2022-04-27 16:45:42,957 INFO L290 TraceCheckUtils]: 1: Hoare triple {183#true} [67] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= v_~SIZE~0_3 50000001) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 2) 9) (= (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{~SIZE~0=v_~SIZE~0_3, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[~SIZE~0, #NULL.offset, #NULL.base] {183#true} is VALID [2022-04-27 16:45:42,957 INFO L272 TraceCheckUtils]: 0: Hoare triple {183#true} [65] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {183#true} is VALID [2022-04-27 16:45:42,958 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-27 16:45:42,958 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [610302977] provided 1 perfect and 1 imperfect interpolant sequences [2022-04-27 16:45:42,960 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-04-27 16:45:42,960 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [5, 7] total 12 [2022-04-27 16:45:42,960 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [224104464] [2022-04-27 16:45:42,960 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 16:45:42,961 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 5 states have internal predecessors, (11), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 15 [2022-04-27 16:45:42,961 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 16:45:42,961 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 5 states have internal predecessors, (11), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 16:45:42,979 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 15 edges. 15 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 16:45:42,979 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-27 16:45:42,979 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 16:45:42,980 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-27 16:45:42,980 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2022-04-27 16:45:42,980 INFO L87 Difference]: Start difference. First operand 18 states and 20 transitions. Second operand has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 5 states have internal predecessors, (11), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 16:45:43,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 16:45:43,045 INFO L93 Difference]: Finished difference Result 16 states and 18 transitions. [2022-04-27 16:45:43,045 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-27 16:45:43,045 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 5 states have internal predecessors, (11), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 15 [2022-04-27 16:45:43,045 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 16:45:43,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 5 states have internal predecessors, (11), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 16:45:43,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 15 transitions. [2022-04-27 16:45:43,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 5 states have internal predecessors, (11), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 16:45:43,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 15 transitions. [2022-04-27 16:45:43,047 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 15 transitions. [2022-04-27 16:45:43,061 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 15 edges. 15 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 16:45:43,061 INFO L225 Difference]: With dead ends: 16 [2022-04-27 16:45:43,061 INFO L226 Difference]: Without dead ends: 0 [2022-04-27 16:45:43,061 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 23 SyntacticMatches, 2 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=148, Unknown=0, NotChecked=0, Total=182 [2022-04-27 16:45:43,062 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 3 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 36 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 16:45:43,062 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 36 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 16:45:43,063 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-04-27 16:45:43,063 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-04-27 16:45:43,063 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 16:45:43,063 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-27 16:45:43,063 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-27 16:45:43,063 INFO L87 Difference]: Start difference. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-27 16:45:43,063 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 16:45:43,063 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-27 16:45:43,064 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-27 16:45:43,064 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 16:45:43,064 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 16:45:43,064 INFO L74 IsIncluded]: Start isIncluded. First operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 0 states. [2022-04-27 16:45:43,064 INFO L87 Difference]: Start difference. First operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 0 states. [2022-04-27 16:45:43,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 16:45:43,064 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-27 16:45:43,064 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-27 16:45:43,064 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 16:45:43,064 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 16:45:43,064 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 16:45:43,064 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 16:45:43,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-27 16:45:43,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-04-27 16:45:43,065 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 15 [2022-04-27 16:45:43,065 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 16:45:43,065 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-04-27 16:45:43,065 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 5 states have internal predecessors, (11), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 16:45:43,065 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-27 16:45:43,065 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 16:45:43,069 INFO L805 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-04-27 16:45:43,088 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-04-27 16:45:43,269 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 16:45:43,271 INFO L356 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2022-04-27 16:45:43,273 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-04-27 16:45:43,275 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.04 04:45:43 BasicIcfg [2022-04-27 16:45:43,275 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-04-27 16:45:43,276 INFO L158 Benchmark]: Toolchain (without parser) took 3282.94ms. Allocated memory was 206.6MB in the beginning and 248.5MB in the end (delta: 41.9MB). Free memory was 184.3MB in the beginning and 187.2MB in the end (delta: -2.9MB). Peak memory consumption was 38.8MB. Max. memory is 8.0GB. [2022-04-27 16:45:43,276 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 206.6MB. Free memory is still 169.4MB. There was no memory consumed. Max. memory is 8.0GB. [2022-04-27 16:45:43,276 INFO L158 Benchmark]: CACSL2BoogieTranslator took 202.65ms. Allocated memory is still 206.6MB. Free memory was 184.3MB in the beginning and 180.7MB in the end (delta: 3.5MB). Peak memory consumption was 11.7MB. Max. memory is 8.0GB. [2022-04-27 16:45:43,277 INFO L158 Benchmark]: Boogie Preprocessor took 32.84ms. Allocated memory is still 206.6MB. Free memory was 180.7MB in the beginning and 179.3MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-04-27 16:45:43,277 INFO L158 Benchmark]: RCFGBuilder took 255.41ms. Allocated memory is still 206.6MB. Free memory was 178.9MB in the beginning and 168.4MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. [2022-04-27 16:45:43,277 INFO L158 Benchmark]: IcfgTransformer took 458.78ms. Allocated memory is still 206.6MB. Free memory was 168.4MB in the beginning and 139.4MB in the end (delta: 29.0MB). Peak memory consumption was 29.4MB. Max. memory is 8.0GB. [2022-04-27 16:45:43,277 INFO L158 Benchmark]: TraceAbstraction took 2326.21ms. Allocated memory was 206.6MB in the beginning and 248.5MB in the end (delta: 41.9MB). Free memory was 138.8MB in the beginning and 187.2MB in the end (delta: -48.4MB). There was no memory consumed. Max. memory is 8.0GB. [2022-04-27 16:45:43,278 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from IcfgTransformer: - StatisticsResult: Jordan loop acceleration statistics 0 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=1}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult - StatisticsResult: Jordan loop acceleration statistics 0 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult * Results from de.uni_freiburg.informatik.ultimate.core: - AssertionsEnabledResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.11ms. Allocated memory is still 206.6MB. Free memory is still 169.4MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 202.65ms. Allocated memory is still 206.6MB. Free memory was 184.3MB in the beginning and 180.7MB in the end (delta: 3.5MB). Peak memory consumption was 11.7MB. Max. memory is 8.0GB. * Boogie Preprocessor took 32.84ms. Allocated memory is still 206.6MB. Free memory was 180.7MB in the beginning and 179.3MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 255.41ms. Allocated memory is still 206.6MB. Free memory was 178.9MB in the beginning and 168.4MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. * IcfgTransformer took 458.78ms. Allocated memory is still 206.6MB. Free memory was 168.4MB in the beginning and 139.4MB in the end (delta: 29.0MB). Peak memory consumption was 29.4MB. Max. memory is 8.0GB. * TraceAbstraction took 2326.21ms. Allocated memory was 206.6MB in the beginning and 248.5MB in the end (delta: 41.9MB). Free memory was 138.8MB in the beginning and 187.2MB in the end (delta: -48.4MB). 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 - PositiveResult [Line: 12]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 22 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 2.3s, OverallIterations: 3, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 31 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 30 mSDsluCounter, 80 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 37 mSDsCounter, 8 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 41 IncrementalHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 8 mSolverCounterUnsat, 43 mSDtfsCounter, 41 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 47 GetRequests, 29 SyntacticMatches, 2 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=22occurred 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.0s AutomataMinimizationTime, 3 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.4s InterpolantComputationTime, 58 NumberOfCodeBlocks, 58 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 68 ConstructedInterpolants, 0 QuantifiedInterpolants, 183 SizeOfPredicates, 4 NumberOfNonLiveVariables, 68 ConjunctsInSsa, 8 ConjunctsInUnsatCore, 5 InterpolantComputations, 3 PerfectInterpolantSequences, 1/3 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2022-04-27 16:45:43,305 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...