/usr/bin/java -ea -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data --core.log.level.for.class de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN -tc ../../../trunk/examples/toolchains/AutomizerCTransformed.xml -s ../../../trunk/examples/settings/automizer/LoopAccelerationJordanC.epf -i ../../../trunk/examples/svcomp/loop-lit/jm2006_variant.i
--------------------------------------------------------------------------------
This is Ultimate 0.2.2-dev-e106359-m
[2022-04-14 19:21:00,497 INFO L177 SettingsManager]: Resetting all preferences to default values...
[2022-04-14 19:21:00,498 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values
[2022-04-14 19:21:00,537 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring...
[2022-04-14 19:21:00,538 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values
[2022-04-14 19:21:00,539 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values
[2022-04-14 19:21:00,540 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values
[2022-04-14 19:21:00,541 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values
[2022-04-14 19:21:00,542 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values
[2022-04-14 19:21:00,543 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values
[2022-04-14 19:21:00,544 INFO L181 SettingsManager]: Resetting Sifa preferences to default values
[2022-04-14 19:21:00,545 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring...
[2022-04-14 19:21:00,545 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values
[2022-04-14 19:21:00,546 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values
[2022-04-14 19:21:00,547 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values
[2022-04-14 19:21:00,548 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values
[2022-04-14 19:21:00,548 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values
[2022-04-14 19:21:00,549 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values
[2022-04-14 19:21:00,550 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values
[2022-04-14 19:21:00,552 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values
[2022-04-14 19:21:00,553 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values
[2022-04-14 19:21:00,554 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values
[2022-04-14 19:21:00,555 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values
[2022-04-14 19:21:00,556 INFO L181 SettingsManager]: Resetting Referee preferences to default values
[2022-04-14 19:21:00,557 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values
[2022-04-14 19:21:00,559 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring...
[2022-04-14 19:21:00,559 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring...
[2022-04-14 19:21:00,560 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values
[2022-04-14 19:21:00,560 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values
[2022-04-14 19:21:00,561 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values
[2022-04-14 19:21:00,561 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring...
[2022-04-14 19:21:00,562 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values
[2022-04-14 19:21:00,562 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values
[2022-04-14 19:21:00,563 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values
[2022-04-14 19:21:00,563 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values
[2022-04-14 19:21:00,564 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring...
[2022-04-14 19:21:00,564 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values
[2022-04-14 19:21:00,565 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring...
[2022-04-14 19:21:00,565 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring...
[2022-04-14 19:21:00,565 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values
[2022-04-14 19:21:00,566 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values
[2022-04-14 19:21:00,567 INFO L188 SettingsManager]: Finished resetting all preferences to default values...
[2022-04-14 19:21:00,568 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/LoopAccelerationJordanC.epf
[2022-04-14 19:21:00,577 INFO L113 SettingsManager]: Loading preferences was successful
[2022-04-14 19:21:00,578 INFO L115 SettingsManager]: Preferences different from defaults after loading the file:
[2022-04-14 19:21:00,579 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2022-04-14 19:21:00,579 INFO L138 SettingsManager]: * sizeof long=4
[2022-04-14 19:21:00,579 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true
[2022-04-14 19:21:00,579 INFO L138 SettingsManager]: * sizeof POINTER=4
[2022-04-14 19:21:00,579 INFO L138 SettingsManager]: * Check division by zero=IGNORE
[2022-04-14 19:21:00,580 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE
[2022-04-14 19:21:00,580 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE
[2022-04-14 19:21:00,580 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE
[2022-04-14 19:21:00,580 INFO L138 SettingsManager]: * sizeof long double=12
[2022-04-14 19:21:00,580 INFO L138 SettingsManager]: * Check if freed pointer was valid=false
[2022-04-14 19:21:00,581 INFO L138 SettingsManager]: * Use constant arrays=true
[2022-04-14 19:21:00,581 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE
[2022-04-14 19:21:00,581 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults:
[2022-04-14 19:21:00,581 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements
[2022-04-14 19:21:00,581 INFO L138 SettingsManager]: * To the following directory=./dump/
[2022-04-14 19:21:00,581 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode
[2022-04-14 19:21:00,582 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000
[2022-04-14 19:21:00,582 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2022-04-14 19:21:00,582 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL
[2022-04-14 19:21:00,583 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults:
[2022-04-14 19:21:00,583 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-14 19:21:00,781 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp
[2022-04-14 19:21:00,797 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2022-04-14 19:21:00,799 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2022-04-14 19:21:00,800 INFO L271 PluginConnector]: Initializing CDTParser...
[2022-04-14 19:21:00,801 INFO L275 PluginConnector]: CDTParser initialized
[2022-04-14 19:21:00,802 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-lit/jm2006_variant.i
[2022-04-14 19:21:00,865 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a79db68ac/a85be0dbb0e24f7f950fb8a65ecbda23/FLAG7bfe4cb3a
[2022-04-14 19:21:01,220 INFO L306 CDTParser]: Found 1 translation units.
[2022-04-14 19:21:01,221 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-lit/jm2006_variant.i
[2022-04-14 19:21:01,228 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a79db68ac/a85be0dbb0e24f7f950fb8a65ecbda23/FLAG7bfe4cb3a
[2022-04-14 19:21:01,241 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a79db68ac/a85be0dbb0e24f7f950fb8a65ecbda23
[2022-04-14 19:21:01,244 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2022-04-14 19:21:01,245 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements.
[2022-04-14 19:21:01,246 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2022-04-14 19:21:01,246 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator...
[2022-04-14 19:21:01,248 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized
[2022-04-14 19:21:01,249 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.04 07:21:01" (1/1) ...
[2022-04-14 19:21:01,250 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5568277e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 07:21:01, skipping insertion in model container
[2022-04-14 19:21:01,250 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.04 07:21:01" (1/1) ...
[2022-04-14 19:21:01,255 INFO L145 MainTranslator]: Starting translation in SV-COMP mode
[2022-04-14 19:21:01,268 INFO L178 MainTranslator]: Built tables and reachable declarations
[2022-04-14 19:21:01,440 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-lit/jm2006_variant.i[895,908]
[2022-04-14 19:21:01,480 INFO L210 PostProcessor]: Analyzing one entry point: main
[2022-04-14 19:21:01,491 INFO L203 MainTranslator]: Completed pre-run
[2022-04-14 19:21:01,501 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-lit/jm2006_variant.i[895,908]
[2022-04-14 19:21:01,504 INFO L210 PostProcessor]: Analyzing one entry point: main
[2022-04-14 19:21:01,514 INFO L208 MainTranslator]: Completed translation
[2022-04-14 19:21:01,515 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 07:21:01 WrapperNode
[2022-04-14 19:21:01,515 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2022-04-14 19:21:01,516 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2022-04-14 19:21:01,516 INFO L271 PluginConnector]: Initializing Boogie Preprocessor...
[2022-04-14 19:21:01,516 INFO L275 PluginConnector]: Boogie Preprocessor initialized
[2022-04-14 19:21:01,524 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 07:21:01" (1/1) ...
[2022-04-14 19:21:01,524 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 07:21:01" (1/1) ...
[2022-04-14 19:21:01,528 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 07:21:01" (1/1) ...
[2022-04-14 19:21:01,528 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 07:21:01" (1/1) ...
[2022-04-14 19:21:01,534 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 07:21:01" (1/1) ...
[2022-04-14 19:21:01,537 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 07:21:01" (1/1) ...
[2022-04-14 19:21:01,538 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 07:21:01" (1/1) ...
[2022-04-14 19:21:01,539 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2022-04-14 19:21:01,540 INFO L113 PluginConnector]: ------------------------RCFGBuilder----------------------------
[2022-04-14 19:21:01,540 INFO L271 PluginConnector]: Initializing RCFGBuilder...
[2022-04-14 19:21:01,540 INFO L275 PluginConnector]: RCFGBuilder initialized
[2022-04-14 19:21:01,541 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 07:21:01" (1/1) ...
[2022-04-14 19:21:01,553 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000
[2022-04-14 19:21:01,562 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2022-04-14 19:21:01,572 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-14 19:21:01,573 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-14 19:21:01,599 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init
[2022-04-14 19:21:01,600 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2022-04-14 19:21:01,600 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error
[2022-04-14 19:21:01,600 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not
[2022-04-14 19:21:01,601 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert
[2022-04-14 19:21:01,601 INFO L138 BoogieDeclarations]: Found implementation of procedure main
[2022-04-14 19:21:01,601 INFO L130 BoogieDeclarations]: Found specification of procedure abort
[2022-04-14 19:21:01,602 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail
[2022-04-14 19:21:01,602 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_perror_fail
[2022-04-14 19:21:01,602 INFO L130 BoogieDeclarations]: Found specification of procedure __assert
[2022-04-14 19:21:01,602 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error
[2022-04-14 19:21:01,602 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit
[2022-04-14 19:21:01,602 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not
[2022-04-14 19:21:01,603 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert
[2022-04-14 19:21:01,603 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int
[2022-04-14 19:21:01,605 INFO L130 BoogieDeclarations]: Found specification of procedure main
[2022-04-14 19:21:01,605 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init
[2022-04-14 19:21:01,606 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int
[2022-04-14 19:21:01,606 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2022-04-14 19:21:01,606 INFO L130 BoogieDeclarations]: Found specification of procedure write~int
[2022-04-14 19:21:01,606 INFO L130 BoogieDeclarations]: Found specification of procedure read~int
[2022-04-14 19:21:01,606 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc
[2022-04-14 19:21:01,663 INFO L234 CfgBuilder]: Building ICFG
[2022-04-14 19:21:01,664 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation
[2022-04-14 19:21:01,775 INFO L275 CfgBuilder]: Performing block encoding
[2022-04-14 19:21:01,781 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2022-04-14 19:21:01,781 INFO L299 CfgBuilder]: Removed 1 assume(true) statements.
[2022-04-14 19:21:01,783 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.04 07:21:01 BoogieIcfgContainer
[2022-04-14 19:21:01,783 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder----------------------------
[2022-04-14 19:21:01,784 INFO L113 PluginConnector]: ------------------------IcfgTransformer----------------------------
[2022-04-14 19:21:01,784 INFO L271 PluginConnector]: Initializing IcfgTransformer...
[2022-04-14 19:21:01,785 INFO L275 PluginConnector]: IcfgTransformer initialized
[2022-04-14 19:21:01,788 INFO L185 PluginConnector]: Executing the observer IcfgTransformationObserver from plugin IcfgTransformer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.04 07:21:01" (1/1) ...
[2022-04-14 19:21:01,789 INFO L168 ansformationObserver]: Applying ICFG transformation LOOP_ACCELERATION_JORDAN
[2022-04-14 19:21:02,151 INFO L89 elerationTransformer]: Jordan loop acceleration statistics: 2 HavocedVariables, 3 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=2, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult
[2022-04-14 19:21:02,152 INFO L91 elerationTransformer]: Accelerated Formula: (and (= v_main_~z~0_1 (+ v_main_~z~0_2 1)) (= (+ v_main_~x~0_1 1) v_main_~x~0_2) (not (= v_main_~x~0_2 0)) (= (+ (- 2) v_main_~y~0_2) v_main_~y~0_1)) InVars {main_~x~0=v_main_~x~0_2, main_~z~0=v_main_~z~0_2, main_~y~0=v_main_~y~0_2} OutVars{main_~x~0=v_main_~x~0_1, main_~z~0=v_main_~z~0_1, main_#t~post4=|v_main_#t~post4_1|, main_~y~0=v_main_~y~0_1, main_#t~post3=|v_main_#t~post3_1|} AuxVars[] AssignedVars[main_~x~0, main_~z~0, main_#t~post4, main_~y~0, main_#t~post3] to Formula: (let ((.cse0 (= v_main_~x~0_2 0))) (or (and (< v_main_~z~0_2 v_main_~z~0_1) (or (not (<= 1 v_main_~x~0_2)) (not (<= (+ v_main_~x~0_2 v_main_~z~0_2 1) v_main_~z~0_1))) (= v_main_~y~0_1 (+ v_main_~y~0_2 (* v_main_~z~0_2 2) (* (- 2) v_main_~z~0_1))) (= v_main_~x~0_1 (+ v_main_~x~0_2 v_main_~z~0_2 (* (- 1) v_main_~z~0_1))) (not .cse0)) (and (= v_main_~z~0_2 v_main_~z~0_1) (= v_main_~y~0_2 v_main_~y~0_1) (= |v_main_#t~post3_3| |v_main_#t~post3_1|) (= v_main_~x~0_2 v_main_~x~0_1) (= |v_main_#t~post4_3| |v_main_#t~post4_1|) .cse0))) InVars {main_#t~post4=|v_main_#t~post4_3|, main_~y~0=v_main_~y~0_2, main_#t~post3=|v_main_#t~post3_3|, main_~x~0=v_main_~x~0_2, main_~z~0=v_main_~z~0_2} OutVars{main_#t~post4=|v_main_#t~post4_1|, main_~y~0=v_main_~y~0_1, main_#t~post3=|v_main_#t~post3_1|, main_~x~0=v_main_~x~0_1, main_~z~0=v_main_~z~0_1} AuxVars[] AssignedVars[main_~x~0, main_~z~0, main_#t~post4, main_~y~0, main_#t~post3]
[2022-04-14 19:21:02,158 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 14.04 07:21:02 BasicIcfg
[2022-04-14 19:21:02,158 INFO L132 PluginConnector]: ------------------------ END IcfgTransformer----------------------------
[2022-04-14 19:21:02,159 INFO L113 PluginConnector]: ------------------------TraceAbstraction----------------------------
[2022-04-14 19:21:02,159 INFO L271 PluginConnector]: Initializing TraceAbstraction...
[2022-04-14 19:21:02,161 INFO L275 PluginConnector]: TraceAbstraction initialized
[2022-04-14 19:21:02,161 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.04 07:21:01" (1/4) ...
[2022-04-14 19:21:02,163 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7996090 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.04 07:21:02, skipping insertion in model container
[2022-04-14 19:21:02,163 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 07:21:01" (2/4) ...
[2022-04-14 19:21:02,164 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7996090 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.04 07:21:02, skipping insertion in model container
[2022-04-14 19:21:02,164 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.04 07:21:01" (3/4) ...
[2022-04-14 19:21:02,164 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7996090 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.04 07:21:02, skipping insertion in model container
[2022-04-14 19:21:02,164 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 14.04 07:21:02" (4/4) ...
[2022-04-14 19:21:02,165 INFO L111 eAbstractionObserver]: Analyzing ICFG jm2006_variant.iJordan
[2022-04-14 19:21:02,169 INFO L202 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION
[2022-04-14 19:21:02,169 INFO L161 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations.
[2022-04-14 19:21:02,211 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2022-04-14 19:21:02,218 INFO L340 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
[2022-04-14 19:21:02,218 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations.
[2022-04-14 19:21:02,230 INFO L276 IsEmpty]: Start isEmpty. Operand has 22 states, 14 states have (on average 1.5) internal successors, (21), 16 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-14 19:21:02,235 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15
[2022-04-14 19:21:02,235 INFO L491 BasicCegarLoop]: Found error trace
[2022-04-14 19:21:02,236 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2022-04-14 19:21:02,236 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2022-04-14 19:21:02,240 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2022-04-14 19:21:02,241 INFO L85 PathProgramCache]: Analyzing trace with hash 1409552995, now seen corresponding path program 1 times
[2022-04-14 19:21:02,249 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-04-14 19:21:02,249 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [944876704]
[2022-04-14 19:21:02,249 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-04-14 19:21:02,250 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-04-14 19:21:02,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-04-14 19:21:02,401 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0
[2022-04-14 19:21:02,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-04-14 19:21:02,428 INFO L290 TraceCheckUtils]: 0: Hoare triple {30#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [69] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= (select |v_#length_1| 2) 9) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {25#true} is VALID
[2022-04-14 19:21:02,428 INFO L290 TraceCheckUtils]: 1: Hoare triple {25#true} [72] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {25#true} is VALID
[2022-04-14 19:21:02,429 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {25#true} {25#true} [91] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {25#true} is VALID
[2022-04-14 19:21:02,432 INFO L272 TraceCheckUtils]: 0: Hoare triple {25#true} [67] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {30#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID
[2022-04-14 19:21:02,432 INFO L290 TraceCheckUtils]: 1: Hoare triple {30#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [69] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= (select |v_#length_1| 2) 9) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {25#true} is VALID
[2022-04-14 19:21:02,433 INFO L290 TraceCheckUtils]: 2: Hoare triple {25#true} [72] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {25#true} is VALID
[2022-04-14 19:21:02,433 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {25#true} {25#true} [91] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {25#true} is VALID
[2022-04-14 19:21:02,433 INFO L272 TraceCheckUtils]: 4: Hoare triple {25#true} [68] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {25#true} is VALID
[2022-04-14 19:21:02,434 INFO L290 TraceCheckUtils]: 5: Hoare triple {25#true} [71] mainENTRY-->L28: Formula: (and (<= |v_main_#t~nondet1_2| 2147483647) (= v_main_~j~0_3 |v_main_#t~nondet2_2|) (<= 0 (+ |v_main_#t~nondet2_2| 2147483648)) (<= |v_main_#t~nondet2_2| 2147483647) (<= 0 (+ |v_main_#t~nondet1_2| 2147483648)) (= v_main_~i~0_3 |v_main_#t~nondet1_2|)) InVars {main_#t~nondet1=|v_main_#t~nondet1_2|, main_#t~nondet2=|v_main_#t~nondet2_2|} OutVars{main_~i~0=v_main_~i~0_3, main_~j~0=v_main_~j~0_3} AuxVars[] AssignedVars[main_#t~nondet1, main_~j~0, main_#t~nondet2, main_~i~0] {25#true} is VALID
[2022-04-14 19:21:02,434 INFO L290 TraceCheckUtils]: 6: Hoare triple {25#true} [74] L28-->L29: Formula: (and (<= v_main_~i~0_7 1000000) (<= 0 v_main_~i~0_7)) InVars {main_~i~0=v_main_~i~0_7} OutVars{main_~i~0=v_main_~i~0_7} AuxVars[] AssignedVars[] {25#true} is VALID
[2022-04-14 19:21:02,435 INFO L290 TraceCheckUtils]: 7: Hoare triple {25#true} [77] L29-->L33-2: Formula: (and (= v_main_~j~0_7 v_main_~y~0_4) (= v_main_~i~0_8 v_main_~x~0_3) (= v_main_~z~0_4 0) (<= 0 v_main_~j~0_7)) InVars {main_~i~0=v_main_~i~0_8, main_~j~0=v_main_~j~0_7} OutVars{main_~i~0=v_main_~i~0_8, main_~y~0=v_main_~y~0_4, main_~x~0=v_main_~x~0_3, main_~z~0=v_main_~z~0_4, main_~j~0=v_main_~j~0_7} AuxVars[] AssignedVars[main_~x~0, main_~z~0, main_~y~0] {25#true} is VALID
[2022-04-14 19:21:02,435 INFO L290 TraceCheckUtils]: 8: Hoare triple {25#true} [78] L33-2-->L33-3: Formula: false InVars {} OutVars{} AuxVars[] AssignedVars[] {26#false} is VALID
[2022-04-14 19:21:02,436 INFO L290 TraceCheckUtils]: 9: Hoare triple {26#false} [81] L33-3-->L39: Formula: (= v_main_~i~0_1 v_main_~j~0_1) InVars {main_~i~0=v_main_~i~0_1, main_~j~0=v_main_~j~0_1} OutVars{main_~i~0=v_main_~i~0_1, main_~j~0=v_main_~j~0_1} AuxVars[] AssignedVars[] {26#false} is VALID
[2022-04-14 19:21:02,437 INFO L272 TraceCheckUtils]: 10: Hoare triple {26#false} [83] L39-->__VERIFIER_assertENTRY: Formula: (= (ite (= (- v_main_~z~0_5) v_main_~y~0_5) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~y~0=v_main_~y~0_5, main_~z~0=v_main_~z~0_5} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~z~0, main_~y~0] {26#false} is VALID
[2022-04-14 19:21:02,438 INFO L290 TraceCheckUtils]: 11: Hoare triple {26#false} [85] __VERIFIER_assertENTRY-->L18: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {26#false} is VALID
[2022-04-14 19:21:02,438 INFO L290 TraceCheckUtils]: 12: Hoare triple {26#false} [86] L18-->L19: Formula: (= v___VERIFIER_assert_~cond_2 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {26#false} is VALID
[2022-04-14 19:21:02,438 INFO L290 TraceCheckUtils]: 13: Hoare triple {26#false} [88] L19-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {26#false} is VALID
[2022-04-14 19:21:02,439 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-14 19:21:02,439 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-04-14 19:21:02,439 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [944876704]
[2022-04-14 19:21:02,440 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [944876704] provided 1 perfect and 0 imperfect interpolant sequences
[2022-04-14 19:21:02,440 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-04-14 19:21:02,440 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2022-04-14 19:21:02,443 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [159075304]
[2022-04-14 19:21:02,444 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-04-14 19:21:02,448 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-14 19:21:02,450 INFO L84 Accepts]: Finished accepts. word is accepted.
[2022-04-14 19:21:02,452 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-14 19:21:02,472 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-14 19:21:02,472 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2022-04-14 19:21:02,473 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2022-04-14 19:21:02,505 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2022-04-14 19:21:02,506 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2022-04-14 19:21:02,509 INFO L87 Difference]: Start difference. First operand has 22 states, 14 states have (on average 1.5) internal successors, (21), 16 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-14 19:21:02,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-14 19:21:02,569 INFO L93 Difference]: Finished difference Result 22 states and 25 transitions.
[2022-04-14 19:21:02,570 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states.
[2022-04-14 19:21:02,570 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-14 19:21:02,570 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2022-04-14 19:21:02,571 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-14 19:21:02,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 27 transitions.
[2022-04-14 19:21:02,582 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-14 19:21:02,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 27 transitions.
[2022-04-14 19:21:02,588 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 27 transitions.
[2022-04-14 19:21:02,620 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-14 19:21:02,627 INFO L225 Difference]: With dead ends: 22
[2022-04-14 19:21:02,627 INFO L226 Difference]: Without dead ends: 15
[2022-04-14 19:21:02,629 INFO L912 BasicCegarLoop]: 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-14 19:21:02,633 INFO L913 BasicCegarLoop]: 24 mSDtfsCounter, 16 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 27 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2022-04-14 19:21:02,634 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [17 Valid, 27 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2022-04-14 19:21:02,648 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states.
[2022-04-14 19:21:02,657 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15.
[2022-04-14 19:21:02,657 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa
[2022-04-14 19:21:02,658 INFO L82 GeneralOperation]: Start isEquivalent. First operand 15 states. Second operand has 15 states, 10 states have (on average 1.1) internal successors, (11), 10 states have internal predecessors, (11), 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-14 19:21:02,659 INFO L74 IsIncluded]: Start isIncluded. First operand 15 states. Second operand has 15 states, 10 states have (on average 1.1) internal successors, (11), 10 states have internal predecessors, (11), 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-14 19:21:02,659 INFO L87 Difference]: Start difference. First operand 15 states. Second operand has 15 states, 10 states have (on average 1.1) internal successors, (11), 10 states have internal predecessors, (11), 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-14 19:21:02,666 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-14 19:21:02,666 INFO L93 Difference]: Finished difference Result 15 states and 15 transitions.
[2022-04-14 19:21:02,666 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions.
[2022-04-14 19:21:02,666 INFO L282 IsEmpty]: Finished isEmpty. No accepting run.
[2022-04-14 19:21:02,667 INFO L83 IsIncluded]: Finished isIncluded. Language is included
[2022-04-14 19:21:02,667 INFO L74 IsIncluded]: Start isIncluded. First operand has 15 states, 10 states have (on average 1.1) internal successors, (11), 10 states have internal predecessors, (11), 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-14 19:21:02,667 INFO L87 Difference]: Start difference. First operand has 15 states, 10 states have (on average 1.1) internal successors, (11), 10 states have internal predecessors, (11), 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-14 19:21:02,670 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-14 19:21:02,670 INFO L93 Difference]: Finished difference Result 15 states and 15 transitions.
[2022-04-14 19:21:02,670 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions.
[2022-04-14 19:21:02,670 INFO L282 IsEmpty]: Finished isEmpty. No accepting run.
[2022-04-14 19:21:02,670 INFO L83 IsIncluded]: Finished isIncluded. Language is included
[2022-04-14 19:21:02,671 INFO L88 GeneralOperation]: Finished isEquivalent.
[2022-04-14 19:21:02,671 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa
[2022-04-14 19:21:02,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 10 states have (on average 1.1) internal successors, (11), 10 states have internal predecessors, (11), 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-14 19:21:02,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 15 transitions.
[2022-04-14 19:21:02,675 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 15 transitions. Word has length 14
[2022-04-14 19:21:02,678 INFO L84 Accepts]: Finished accepts. word is rejected.
[2022-04-14 19:21:02,678 INFO L478 AbstractCegarLoop]: Abstraction has 15 states and 15 transitions.
[2022-04-14 19:21:02,681 INFO L479 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-14 19:21:02,681 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions.
[2022-04-14 19:21:02,682 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15
[2022-04-14 19:21:02,682 INFO L491 BasicCegarLoop]: Found error trace
[2022-04-14 19:21:02,682 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2022-04-14 19:21:02,682 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0
[2022-04-14 19:21:02,682 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2022-04-14 19:21:02,683 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2022-04-14 19:21:02,683 INFO L85 PathProgramCache]: Analyzing trace with hash 1438182146, now seen corresponding path program 1 times
[2022-04-14 19:21:02,683 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-04-14 19:21:02,683 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [266017433]
[2022-04-14 19:21:02,683 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-04-14 19:21:02,684 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-04-14 19:21:02,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-04-14 19:21:02,927 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0
[2022-04-14 19:21:02,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-04-14 19:21:02,943 INFO L290 TraceCheckUtils]: 0: Hoare triple {110#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [69] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= (select |v_#length_1| 2) 9) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {100#true} is VALID
[2022-04-14 19:21:02,943 INFO L290 TraceCheckUtils]: 1: Hoare triple {100#true} [72] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {100#true} is VALID
[2022-04-14 19:21:02,944 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {100#true} {100#true} [91] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {100#true} is VALID
[2022-04-14 19:21:02,944 INFO L272 TraceCheckUtils]: 0: Hoare triple {100#true} [67] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {110#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID
[2022-04-14 19:21:02,945 INFO L290 TraceCheckUtils]: 1: Hoare triple {110#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [69] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= (select |v_#length_1| 2) 9) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {100#true} is VALID
[2022-04-14 19:21:02,945 INFO L290 TraceCheckUtils]: 2: Hoare triple {100#true} [72] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {100#true} is VALID
[2022-04-14 19:21:02,945 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {100#true} {100#true} [91] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {100#true} is VALID
[2022-04-14 19:21:02,945 INFO L272 TraceCheckUtils]: 4: Hoare triple {100#true} [68] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {100#true} is VALID
[2022-04-14 19:21:02,945 INFO L290 TraceCheckUtils]: 5: Hoare triple {100#true} [71] mainENTRY-->L28: Formula: (and (<= |v_main_#t~nondet1_2| 2147483647) (= v_main_~j~0_3 |v_main_#t~nondet2_2|) (<= 0 (+ |v_main_#t~nondet2_2| 2147483648)) (<= |v_main_#t~nondet2_2| 2147483647) (<= 0 (+ |v_main_#t~nondet1_2| 2147483648)) (= v_main_~i~0_3 |v_main_#t~nondet1_2|)) InVars {main_#t~nondet1=|v_main_#t~nondet1_2|, main_#t~nondet2=|v_main_#t~nondet2_2|} OutVars{main_~i~0=v_main_~i~0_3, main_~j~0=v_main_~j~0_3} AuxVars[] AssignedVars[main_#t~nondet1, main_~j~0, main_#t~nondet2, main_~i~0] {100#true} is VALID
[2022-04-14 19:21:02,946 INFO L290 TraceCheckUtils]: 6: Hoare triple {100#true} [74] L28-->L29: Formula: (and (<= v_main_~i~0_7 1000000) (<= 0 v_main_~i~0_7)) InVars {main_~i~0=v_main_~i~0_7} OutVars{main_~i~0=v_main_~i~0_7} AuxVars[] AssignedVars[] {100#true} is VALID
[2022-04-14 19:21:02,947 INFO L290 TraceCheckUtils]: 7: Hoare triple {100#true} [77] L29-->L33-2: Formula: (and (= v_main_~j~0_7 v_main_~y~0_4) (= v_main_~i~0_8 v_main_~x~0_3) (= v_main_~z~0_4 0) (<= 0 v_main_~j~0_7)) InVars {main_~i~0=v_main_~i~0_8, main_~j~0=v_main_~j~0_7} OutVars{main_~i~0=v_main_~i~0_8, main_~y~0=v_main_~y~0_4, main_~x~0=v_main_~x~0_3, main_~z~0=v_main_~z~0_4, main_~j~0=v_main_~j~0_7} AuxVars[] AssignedVars[main_~x~0, main_~z~0, main_~y~0] {105#(and (or (= main_~i~0 0) (= main_~i~0 main_~x~0)) (or (and (= main_~z~0 0) (or (<= main_~y~0 main_~j~0) (<= (+ main_~z~0 main_~y~0) 0)) (< 0 (+ main_~z~0 main_~y~0 1))) (not (= main_~i~0 0))))} is VALID
[2022-04-14 19:21:02,948 INFO L290 TraceCheckUtils]: 8: Hoare triple {105#(and (or (= main_~i~0 0) (= main_~i~0 main_~x~0)) (or (and (= main_~z~0 0) (or (<= main_~y~0 main_~j~0) (<= (+ main_~z~0 main_~y~0) 0)) (< 0 (+ main_~z~0 main_~y~0 1))) (not (= main_~i~0 0))))} [79] L33-2-->L33-3: Formula: (= v_main_~x~0_4 0) InVars {main_~x~0=v_main_~x~0_4} OutVars{main_~x~0=v_main_~x~0_4} AuxVars[] AssignedVars[] {106#(and (= main_~z~0 0) (or (<= main_~y~0 main_~j~0) (<= (+ main_~z~0 main_~y~0) 0)) (= main_~i~0 0) (< 0 (+ main_~z~0 main_~y~0 1)))} is VALID
[2022-04-14 19:21:02,949 INFO L290 TraceCheckUtils]: 9: Hoare triple {106#(and (= main_~z~0 0) (or (<= main_~y~0 main_~j~0) (<= (+ main_~z~0 main_~y~0) 0)) (= main_~i~0 0) (< 0 (+ main_~z~0 main_~y~0 1)))} [81] L33-3-->L39: Formula: (= v_main_~i~0_1 v_main_~j~0_1) InVars {main_~i~0=v_main_~i~0_1, main_~j~0=v_main_~j~0_1} OutVars{main_~i~0=v_main_~i~0_1, main_~j~0=v_main_~j~0_1} AuxVars[] AssignedVars[] {107#(and (= main_~z~0 0) (<= main_~y~0 0) (< 0 (+ main_~z~0 main_~y~0 1)))} is VALID
[2022-04-14 19:21:02,950 INFO L272 TraceCheckUtils]: 10: Hoare triple {107#(and (= main_~z~0 0) (<= main_~y~0 0) (< 0 (+ main_~z~0 main_~y~0 1)))} [83] L39-->__VERIFIER_assertENTRY: Formula: (= (ite (= (- v_main_~z~0_5) v_main_~y~0_5) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~y~0=v_main_~y~0_5, main_~z~0=v_main_~z~0_5} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~z~0, main_~y~0] {108#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID
[2022-04-14 19:21:02,950 INFO L290 TraceCheckUtils]: 11: Hoare triple {108#(not (= |__VERIFIER_assert_#in~cond| 0))} [85] __VERIFIER_assertENTRY-->L18: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {109#(not (= __VERIFIER_assert_~cond 0))} is VALID
[2022-04-14 19:21:02,951 INFO L290 TraceCheckUtils]: 12: Hoare triple {109#(not (= __VERIFIER_assert_~cond 0))} [86] L18-->L19: Formula: (= v___VERIFIER_assert_~cond_2 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {101#false} is VALID
[2022-04-14 19:21:02,951 INFO L290 TraceCheckUtils]: 13: Hoare triple {101#false} [88] L19-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {101#false} is VALID
[2022-04-14 19:21:02,952 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-14 19:21:02,952 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-04-14 19:21:02,952 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [266017433]
[2022-04-14 19:21:02,952 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [266017433] provided 1 perfect and 0 imperfect interpolant sequences
[2022-04-14 19:21:02,952 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-04-14 19:21:02,952 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2022-04-14 19:21:02,953 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [730952782]
[2022-04-14 19:21:02,953 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-04-14 19:21:02,954 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 1.4285714285714286) internal successors, (10), 6 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-14 19:21:02,954 INFO L84 Accepts]: Finished accepts. word is accepted.
[2022-04-14 19:21:02,955 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 8 states, 7 states have (on average 1.4285714285714286) internal successors, (10), 6 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-14 19:21:02,969 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-14 19:21:02,969 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2022-04-14 19:21:02,969 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2022-04-14 19:21:02,970 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2022-04-14 19:21:02,971 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56
[2022-04-14 19:21:02,972 INFO L87 Difference]: Start difference. First operand 15 states and 15 transitions. Second operand has 8 states, 7 states have (on average 1.4285714285714286) internal successors, (10), 6 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-14 19:21:03,202 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-14 19:21:03,203 INFO L93 Difference]: Finished difference Result 20 states and 20 transitions.
[2022-04-14 19:21:03,203 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states.
[2022-04-14 19:21:03,203 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 1.4285714285714286) internal successors, (10), 6 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-14 19:21:03,204 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2022-04-14 19:21:03,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 7 states have (on average 1.4285714285714286) internal successors, (10), 6 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-14 19:21:03,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 21 transitions.
[2022-04-14 19:21:03,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 7 states have (on average 1.4285714285714286) internal successors, (10), 6 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-14 19:21:03,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 21 transitions.
[2022-04-14 19:21:03,213 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 21 transitions.
[2022-04-14 19:21:03,233 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-14 19:21:03,234 INFO L225 Difference]: With dead ends: 20
[2022-04-14 19:21:03,234 INFO L226 Difference]: Without dead ends: 16
[2022-04-14 19:21:03,237 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=114, Unknown=0, NotChecked=0, Total=156
[2022-04-14 19:21:03,239 INFO L913 BasicCegarLoop]: 11 mSDtfsCounter, 15 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 38 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time
[2022-04-14 19:21:03,240 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [15 Valid, 38 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time]
[2022-04-14 19:21:03,241 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states.
[2022-04-14 19:21:03,243 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16.
[2022-04-14 19:21:03,243 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa
[2022-04-14 19:21:03,244 INFO L82 GeneralOperation]: Start isEquivalent. First operand 16 states. Second operand has 16 states, 11 states have (on average 1.0909090909090908) internal successors, (12), 11 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-14 19:21:03,245 INFO L74 IsIncluded]: Start isIncluded. First operand 16 states. Second operand has 16 states, 11 states have (on average 1.0909090909090908) internal successors, (12), 11 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-14 19:21:03,245 INFO L87 Difference]: Start difference. First operand 16 states. Second operand has 16 states, 11 states have (on average 1.0909090909090908) internal successors, (12), 11 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-14 19:21:03,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-14 19:21:03,247 INFO L93 Difference]: Finished difference Result 16 states and 16 transitions.
[2022-04-14 19:21:03,248 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 16 transitions.
[2022-04-14 19:21:03,249 INFO L282 IsEmpty]: Finished isEmpty. No accepting run.
[2022-04-14 19:21:03,249 INFO L83 IsIncluded]: Finished isIncluded. Language is included
[2022-04-14 19:21:03,249 INFO L74 IsIncluded]: Start isIncluded. First operand has 16 states, 11 states have (on average 1.0909090909090908) internal successors, (12), 11 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 16 states.
[2022-04-14 19:21:03,249 INFO L87 Difference]: Start difference. First operand has 16 states, 11 states have (on average 1.0909090909090908) internal successors, (12), 11 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 16 states.
[2022-04-14 19:21:03,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-14 19:21:03,251 INFO L93 Difference]: Finished difference Result 16 states and 16 transitions.
[2022-04-14 19:21:03,251 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 16 transitions.
[2022-04-14 19:21:03,251 INFO L282 IsEmpty]: Finished isEmpty. No accepting run.
[2022-04-14 19:21:03,251 INFO L83 IsIncluded]: Finished isIncluded. Language is included
[2022-04-14 19:21:03,252 INFO L88 GeneralOperation]: Finished isEquivalent.
[2022-04-14 19:21:03,252 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa
[2022-04-14 19:21:03,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 11 states have (on average 1.0909090909090908) internal successors, (12), 11 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-14 19:21:03,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 16 transitions.
[2022-04-14 19:21:03,253 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 16 transitions. Word has length 14
[2022-04-14 19:21:03,253 INFO L84 Accepts]: Finished accepts. word is rejected.
[2022-04-14 19:21:03,253 INFO L478 AbstractCegarLoop]: Abstraction has 16 states and 16 transitions.
[2022-04-14 19:21:03,254 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 1.4285714285714286) internal successors, (10), 6 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-14 19:21:03,254 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 16 transitions.
[2022-04-14 19:21:03,255 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16
[2022-04-14 19:21:03,255 INFO L491 BasicCegarLoop]: Found error trace
[2022-04-14 19:21:03,255 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2022-04-14 19:21:03,255 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1
[2022-04-14 19:21:03,255 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2022-04-14 19:21:03,256 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2022-04-14 19:21:03,256 INFO L85 PathProgramCache]: Analyzing trace with hash -1832655910, now seen corresponding path program 1 times
[2022-04-14 19:21:03,256 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-04-14 19:21:03,256 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1164907929]
[2022-04-14 19:21:03,256 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-04-14 19:21:03,256 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-04-14 19:21:03,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-04-14 19:21:03,563 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0
[2022-04-14 19:21:03,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-04-14 19:21:03,570 INFO L290 TraceCheckUtils]: 0: Hoare triple {202#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [69] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= (select |v_#length_1| 2) 9) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {191#true} is VALID
[2022-04-14 19:21:03,570 INFO L290 TraceCheckUtils]: 1: Hoare triple {191#true} [72] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {191#true} is VALID
[2022-04-14 19:21:03,570 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {191#true} {191#true} [91] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {191#true} is VALID
[2022-04-14 19:21:03,571 INFO L272 TraceCheckUtils]: 0: Hoare triple {191#true} [67] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {202#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID
[2022-04-14 19:21:03,571 INFO L290 TraceCheckUtils]: 1: Hoare triple {202#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [69] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= (select |v_#length_1| 2) 9) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {191#true} is VALID
[2022-04-14 19:21:03,572 INFO L290 TraceCheckUtils]: 2: Hoare triple {191#true} [72] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {191#true} is VALID
[2022-04-14 19:21:03,572 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {191#true} {191#true} [91] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {191#true} is VALID
[2022-04-14 19:21:03,572 INFO L272 TraceCheckUtils]: 4: Hoare triple {191#true} [68] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {191#true} is VALID
[2022-04-14 19:21:03,572 INFO L290 TraceCheckUtils]: 5: Hoare triple {191#true} [71] mainENTRY-->L28: Formula: (and (<= |v_main_#t~nondet1_2| 2147483647) (= v_main_~j~0_3 |v_main_#t~nondet2_2|) (<= 0 (+ |v_main_#t~nondet2_2| 2147483648)) (<= |v_main_#t~nondet2_2| 2147483647) (<= 0 (+ |v_main_#t~nondet1_2| 2147483648)) (= v_main_~i~0_3 |v_main_#t~nondet1_2|)) InVars {main_#t~nondet1=|v_main_#t~nondet1_2|, main_#t~nondet2=|v_main_#t~nondet2_2|} OutVars{main_~i~0=v_main_~i~0_3, main_~j~0=v_main_~j~0_3} AuxVars[] AssignedVars[main_#t~nondet1, main_~j~0, main_#t~nondet2, main_~i~0] {191#true} is VALID
[2022-04-14 19:21:03,573 INFO L290 TraceCheckUtils]: 6: Hoare triple {191#true} [74] L28-->L29: Formula: (and (<= v_main_~i~0_7 1000000) (<= 0 v_main_~i~0_7)) InVars {main_~i~0=v_main_~i~0_7} OutVars{main_~i~0=v_main_~i~0_7} AuxVars[] AssignedVars[] {191#true} is VALID
[2022-04-14 19:21:03,573 INFO L290 TraceCheckUtils]: 7: Hoare triple {191#true} [77] L29-->L33-2: Formula: (and (= v_main_~j~0_7 v_main_~y~0_4) (= v_main_~i~0_8 v_main_~x~0_3) (= v_main_~z~0_4 0) (<= 0 v_main_~j~0_7)) InVars {main_~i~0=v_main_~i~0_8, main_~j~0=v_main_~j~0_7} OutVars{main_~i~0=v_main_~i~0_8, main_~y~0=v_main_~y~0_4, main_~x~0=v_main_~x~0_3, main_~z~0=v_main_~z~0_4, main_~j~0=v_main_~j~0_7} AuxVars[] AssignedVars[main_~x~0, main_~z~0, main_~y~0] {196#(and (= main_~z~0 0) (<= main_~j~0 main_~y~0) (<= main_~y~0 main_~j~0) (= main_~i~0 main_~x~0))} is VALID
[2022-04-14 19:21:03,575 INFO L290 TraceCheckUtils]: 8: Hoare triple {196#(and (= main_~z~0 0) (<= main_~j~0 main_~y~0) (<= main_~y~0 main_~j~0) (= main_~i~0 main_~x~0))} [80] L33-2-->L33-2: Formula: (let ((.cse0 (= v_main_~x~0_2 0))) (or (and (< v_main_~z~0_2 v_main_~z~0_1) (or (not (<= 1 v_main_~x~0_2)) (not (<= (+ v_main_~x~0_2 v_main_~z~0_2 1) v_main_~z~0_1))) (= v_main_~y~0_1 (+ v_main_~y~0_2 (* v_main_~z~0_2 2) (* (- 2) v_main_~z~0_1))) (= v_main_~x~0_1 (+ v_main_~x~0_2 v_main_~z~0_2 (* (- 1) v_main_~z~0_1))) (not .cse0)) (and (= v_main_~z~0_2 v_main_~z~0_1) (= v_main_~y~0_2 v_main_~y~0_1) (= |v_main_#t~post3_3| |v_main_#t~post3_1|) (= v_main_~x~0_2 v_main_~x~0_1) (= |v_main_#t~post4_3| |v_main_#t~post4_1|) .cse0))) InVars {main_#t~post4=|v_main_#t~post4_3|, main_~y~0=v_main_~y~0_2, main_#t~post3=|v_main_#t~post3_3|, main_~x~0=v_main_~x~0_2, main_~z~0=v_main_~z~0_2} OutVars{main_#t~post4=|v_main_#t~post4_1|, main_~y~0=v_main_~y~0_1, main_#t~post3=|v_main_#t~post3_1|, main_~x~0=v_main_~x~0_1, main_~z~0=v_main_~z~0_1} AuxVars[] AssignedVars[main_~x~0, main_~z~0, main_#t~post4, main_~y~0, main_#t~post3] {197#(or (and (or (<= (+ main_~i~0 main_~z~0 main_~y~0) (+ main_~j~0 main_~x~0)) (<= (+ main_~z~0 main_~y~0) 0)) (or (<= (+ main_~j~0 main_~x~0) (+ main_~i~0 main_~z~0 main_~y~0)) (not (<= (+ main_~z~0 main_~y~0 1) 0)))) (and (or (<= (+ main_~z~0 main_~y~0) 0) (<= (+ main_~z~0 main_~y~0) main_~j~0)) (or (<= main_~j~0 (+ main_~i~0 main_~z~0 main_~y~0)) (not (<= (+ main_~z~0 main_~y~0 1) 0))) (= main_~i~0 0)))} is VALID
[2022-04-14 19:21:03,576 INFO L290 TraceCheckUtils]: 9: Hoare triple {197#(or (and (or (<= (+ main_~i~0 main_~z~0 main_~y~0) (+ main_~j~0 main_~x~0)) (<= (+ main_~z~0 main_~y~0) 0)) (or (<= (+ main_~j~0 main_~x~0) (+ main_~i~0 main_~z~0 main_~y~0)) (not (<= (+ main_~z~0 main_~y~0 1) 0)))) (and (or (<= (+ main_~z~0 main_~y~0) 0) (<= (+ main_~z~0 main_~y~0) main_~j~0)) (or (<= main_~j~0 (+ main_~i~0 main_~z~0 main_~y~0)) (not (<= (+ main_~z~0 main_~y~0 1) 0))) (= main_~i~0 0)))} [79] L33-2-->L33-3: Formula: (= v_main_~x~0_4 0) InVars {main_~x~0=v_main_~x~0_4} OutVars{main_~x~0=v_main_~x~0_4} AuxVars[] AssignedVars[] {198#(and (or (<= main_~j~0 (+ main_~i~0 main_~z~0 main_~y~0)) (not (<= (+ main_~z~0 main_~y~0 1) 0))) (or (<= (+ main_~z~0 main_~y~0) 0) (<= (+ main_~i~0 main_~z~0 main_~y~0) main_~j~0)))} is VALID
[2022-04-14 19:21:03,577 INFO L290 TraceCheckUtils]: 10: Hoare triple {198#(and (or (<= main_~j~0 (+ main_~i~0 main_~z~0 main_~y~0)) (not (<= (+ main_~z~0 main_~y~0 1) 0))) (or (<= (+ main_~z~0 main_~y~0) 0) (<= (+ main_~i~0 main_~z~0 main_~y~0) main_~j~0)))} [81] L33-3-->L39: Formula: (= v_main_~i~0_1 v_main_~j~0_1) InVars {main_~i~0=v_main_~i~0_1, main_~j~0=v_main_~j~0_1} OutVars{main_~i~0=v_main_~i~0_1, main_~j~0=v_main_~j~0_1} AuxVars[] AssignedVars[] {199#(and (<= (+ main_~z~0 main_~y~0) 0) (< 0 (+ main_~z~0 main_~y~0 1)))} is VALID
[2022-04-14 19:21:03,578 INFO L272 TraceCheckUtils]: 11: Hoare triple {199#(and (<= (+ main_~z~0 main_~y~0) 0) (< 0 (+ main_~z~0 main_~y~0 1)))} [83] L39-->__VERIFIER_assertENTRY: Formula: (= (ite (= (- v_main_~z~0_5) v_main_~y~0_5) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~y~0=v_main_~y~0_5, main_~z~0=v_main_~z~0_5} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~z~0, main_~y~0] {200#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID
[2022-04-14 19:21:03,578 INFO L290 TraceCheckUtils]: 12: Hoare triple {200#(not (= |__VERIFIER_assert_#in~cond| 0))} [85] __VERIFIER_assertENTRY-->L18: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {201#(not (= __VERIFIER_assert_~cond 0))} is VALID
[2022-04-14 19:21:03,579 INFO L290 TraceCheckUtils]: 13: Hoare triple {201#(not (= __VERIFIER_assert_~cond 0))} [86] L18-->L19: Formula: (= v___VERIFIER_assert_~cond_2 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {192#false} is VALID
[2022-04-14 19:21:03,579 INFO L290 TraceCheckUtils]: 14: Hoare triple {192#false} [88] L19-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {192#false} is VALID
[2022-04-14 19:21:03,580 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-14 19:21:03,580 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-04-14 19:21:03,580 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1164907929]
[2022-04-14 19:21:03,580 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1164907929] provided 0 perfect and 1 imperfect interpolant sequences
[2022-04-14 19:21:03,580 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1955248507]
[2022-04-14 19:21:03,580 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-04-14 19:21:03,581 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2022-04-14 19:21:03,581 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2022-04-14 19:21:03,583 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-14 19:21:03,593 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process
[2022-04-14 19:21:03,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-04-14 19:21:03,652 INFO L263 TraceCheckSpWp]: Trace formula consists of 66 conjuncts, 14 conjunts are in the unsatisfiable core
[2022-04-14 19:21:03,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-04-14 19:21:03,690 INFO L286 TraceCheckSpWp]: Computing forward predicates...
[2022-04-14 19:21:04,251 INFO L272 TraceCheckUtils]: 0: Hoare triple {191#true} [67] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {191#true} is VALID
[2022-04-14 19:21:04,252 INFO L290 TraceCheckUtils]: 1: Hoare triple {191#true} [69] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= (select |v_#length_1| 2) 9) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {191#true} is VALID
[2022-04-14 19:21:04,252 INFO L290 TraceCheckUtils]: 2: Hoare triple {191#true} [72] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {191#true} is VALID
[2022-04-14 19:21:04,252 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {191#true} {191#true} [91] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {191#true} is VALID
[2022-04-14 19:21:04,253 INFO L272 TraceCheckUtils]: 4: Hoare triple {191#true} [68] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {191#true} is VALID
[2022-04-14 19:21:04,253 INFO L290 TraceCheckUtils]: 5: Hoare triple {191#true} [71] mainENTRY-->L28: Formula: (and (<= |v_main_#t~nondet1_2| 2147483647) (= v_main_~j~0_3 |v_main_#t~nondet2_2|) (<= 0 (+ |v_main_#t~nondet2_2| 2147483648)) (<= |v_main_#t~nondet2_2| 2147483647) (<= 0 (+ |v_main_#t~nondet1_2| 2147483648)) (= v_main_~i~0_3 |v_main_#t~nondet1_2|)) InVars {main_#t~nondet1=|v_main_#t~nondet1_2|, main_#t~nondet2=|v_main_#t~nondet2_2|} OutVars{main_~i~0=v_main_~i~0_3, main_~j~0=v_main_~j~0_3} AuxVars[] AssignedVars[main_#t~nondet1, main_~j~0, main_#t~nondet2, main_~i~0] {191#true} is VALID
[2022-04-14 19:21:04,253 INFO L290 TraceCheckUtils]: 6: Hoare triple {191#true} [74] L28-->L29: Formula: (and (<= v_main_~i~0_7 1000000) (<= 0 v_main_~i~0_7)) InVars {main_~i~0=v_main_~i~0_7} OutVars{main_~i~0=v_main_~i~0_7} AuxVars[] AssignedVars[] {224#(<= 0 main_~i~0)} is VALID
[2022-04-14 19:21:04,254 INFO L290 TraceCheckUtils]: 7: Hoare triple {224#(<= 0 main_~i~0)} [77] L29-->L33-2: Formula: (and (= v_main_~j~0_7 v_main_~y~0_4) (= v_main_~i~0_8 v_main_~x~0_3) (= v_main_~z~0_4 0) (<= 0 v_main_~j~0_7)) InVars {main_~i~0=v_main_~i~0_8, main_~j~0=v_main_~j~0_7} OutVars{main_~i~0=v_main_~i~0_8, main_~y~0=v_main_~y~0_4, main_~x~0=v_main_~x~0_3, main_~z~0=v_main_~z~0_4, main_~j~0=v_main_~j~0_7} AuxVars[] AssignedVars[main_~x~0, main_~z~0, main_~y~0] {228#(and (= main_~z~0 0) (= main_~j~0 main_~y~0) (<= 0 main_~i~0) (= main_~i~0 main_~x~0))} is VALID
[2022-04-14 19:21:04,255 INFO L290 TraceCheckUtils]: 8: Hoare triple {228#(and (= main_~z~0 0) (= main_~j~0 main_~y~0) (<= 0 main_~i~0) (= main_~i~0 main_~x~0))} [80] L33-2-->L33-2: Formula: (let ((.cse0 (= v_main_~x~0_2 0))) (or (and (< v_main_~z~0_2 v_main_~z~0_1) (or (not (<= 1 v_main_~x~0_2)) (not (<= (+ v_main_~x~0_2 v_main_~z~0_2 1) v_main_~z~0_1))) (= v_main_~y~0_1 (+ v_main_~y~0_2 (* v_main_~z~0_2 2) (* (- 2) v_main_~z~0_1))) (= v_main_~x~0_1 (+ v_main_~x~0_2 v_main_~z~0_2 (* (- 1) v_main_~z~0_1))) (not .cse0)) (and (= v_main_~z~0_2 v_main_~z~0_1) (= v_main_~y~0_2 v_main_~y~0_1) (= |v_main_#t~post3_3| |v_main_#t~post3_1|) (= v_main_~x~0_2 v_main_~x~0_1) (= |v_main_#t~post4_3| |v_main_#t~post4_1|) .cse0))) InVars {main_#t~post4=|v_main_#t~post4_3|, main_~y~0=v_main_~y~0_2, main_#t~post3=|v_main_#t~post3_3|, main_~x~0=v_main_~x~0_2, main_~z~0=v_main_~z~0_2} OutVars{main_#t~post4=|v_main_#t~post4_1|, main_~y~0=v_main_~y~0_1, main_#t~post3=|v_main_#t~post3_1|, main_~x~0=v_main_~x~0_1, main_~z~0=v_main_~z~0_1} AuxVars[] AssignedVars[main_~x~0, main_~z~0, main_#t~post4, main_~y~0, main_#t~post3] {232#(or (and (= main_~z~0 0) (= main_~j~0 main_~y~0) (= main_~i~0 0) (= main_~i~0 main_~x~0)) (and (< 0 main_~z~0) (= main_~i~0 (+ main_~z~0 main_~x~0)) (not (<= (+ main_~i~0 1) main_~z~0)) (= (+ main_~y~0 (* main_~z~0 2)) main_~j~0)))} is VALID
[2022-04-14 19:21:04,256 INFO L290 TraceCheckUtils]: 9: Hoare triple {232#(or (and (= main_~z~0 0) (= main_~j~0 main_~y~0) (= main_~i~0 0) (= main_~i~0 main_~x~0)) (and (< 0 main_~z~0) (= main_~i~0 (+ main_~z~0 main_~x~0)) (not (<= (+ main_~i~0 1) main_~z~0)) (= (+ main_~y~0 (* main_~z~0 2)) main_~j~0)))} [79] L33-2-->L33-3: Formula: (= v_main_~x~0_4 0) InVars {main_~x~0=v_main_~x~0_4} OutVars{main_~x~0=v_main_~x~0_4} AuxVars[] AssignedVars[] {236#(or (and (< 0 main_~z~0) (<= main_~i~0 main_~z~0) (not (<= (+ main_~i~0 1) main_~z~0)) (= (+ main_~y~0 (* main_~z~0 2)) main_~j~0)) (and (= main_~z~0 0) (= main_~j~0 main_~y~0) (= main_~i~0 0)))} is VALID
[2022-04-14 19:21:04,257 INFO L290 TraceCheckUtils]: 10: Hoare triple {236#(or (and (< 0 main_~z~0) (<= main_~i~0 main_~z~0) (not (<= (+ main_~i~0 1) main_~z~0)) (= (+ main_~y~0 (* main_~z~0 2)) main_~j~0)) (and (= main_~z~0 0) (= main_~j~0 main_~y~0) (= main_~i~0 0)))} [81] L33-3-->L39: Formula: (= v_main_~i~0_1 v_main_~j~0_1) InVars {main_~i~0=v_main_~i~0_1, main_~j~0=v_main_~j~0_1} OutVars{main_~i~0=v_main_~i~0_1, main_~j~0=v_main_~j~0_1} AuxVars[] AssignedVars[] {240#(or (and (< 0 main_~z~0) (not (<= (+ main_~z~0 main_~y~0 1) 0)) (<= (+ main_~z~0 main_~y~0) 0)) (and (= main_~z~0 0) (= main_~y~0 0)))} is VALID
[2022-04-14 19:21:04,258 INFO L272 TraceCheckUtils]: 11: Hoare triple {240#(or (and (< 0 main_~z~0) (not (<= (+ main_~z~0 main_~y~0 1) 0)) (<= (+ main_~z~0 main_~y~0) 0)) (and (= main_~z~0 0) (= main_~y~0 0)))} [83] L39-->__VERIFIER_assertENTRY: Formula: (= (ite (= (- v_main_~z~0_5) v_main_~y~0_5) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~y~0=v_main_~y~0_5, main_~z~0=v_main_~z~0_5} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~z~0, main_~y~0] {244#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID
[2022-04-14 19:21:04,259 INFO L290 TraceCheckUtils]: 12: Hoare triple {244#(<= 1 |__VERIFIER_assert_#in~cond|)} [85] __VERIFIER_assertENTRY-->L18: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {248#(<= 1 __VERIFIER_assert_~cond)} is VALID
[2022-04-14 19:21:04,259 INFO L290 TraceCheckUtils]: 13: Hoare triple {248#(<= 1 __VERIFIER_assert_~cond)} [86] L18-->L19: Formula: (= v___VERIFIER_assert_~cond_2 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {192#false} is VALID
[2022-04-14 19:21:04,259 INFO L290 TraceCheckUtils]: 14: Hoare triple {192#false} [88] L19-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {192#false} is VALID
[2022-04-14 19:21:04,260 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-14 19:21:04,260 INFO L328 TraceCheckSpWp]: Computing backward predicates...
[2022-04-14 19:21:04,804 INFO L290 TraceCheckUtils]: 14: Hoare triple {192#false} [88] L19-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {192#false} is VALID
[2022-04-14 19:21:04,805 INFO L290 TraceCheckUtils]: 13: Hoare triple {248#(<= 1 __VERIFIER_assert_~cond)} [86] L18-->L19: Formula: (= v___VERIFIER_assert_~cond_2 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {192#false} is VALID
[2022-04-14 19:21:04,806 INFO L290 TraceCheckUtils]: 12: Hoare triple {244#(<= 1 |__VERIFIER_assert_#in~cond|)} [85] __VERIFIER_assertENTRY-->L18: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {248#(<= 1 __VERIFIER_assert_~cond)} is VALID
[2022-04-14 19:21:04,807 INFO L272 TraceCheckUtils]: 11: Hoare triple {199#(and (<= (+ main_~z~0 main_~y~0) 0) (< 0 (+ main_~z~0 main_~y~0 1)))} [83] L39-->__VERIFIER_assertENTRY: Formula: (= (ite (= (- v_main_~z~0_5) v_main_~y~0_5) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~y~0=v_main_~y~0_5, main_~z~0=v_main_~z~0_5} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~z~0, main_~y~0] {244#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID
[2022-04-14 19:21:04,807 INFO L290 TraceCheckUtils]: 10: Hoare triple {267#(or (not (= main_~i~0 main_~j~0)) (and (<= (+ main_~z~0 main_~y~0) 0) (< 0 (+ main_~z~0 main_~y~0 1))))} [81] L33-3-->L39: Formula: (= v_main_~i~0_1 v_main_~j~0_1) InVars {main_~i~0=v_main_~i~0_1, main_~j~0=v_main_~j~0_1} OutVars{main_~i~0=v_main_~i~0_1, main_~j~0=v_main_~j~0_1} AuxVars[] AssignedVars[] {199#(and (<= (+ main_~z~0 main_~y~0) 0) (< 0 (+ main_~z~0 main_~y~0 1)))} is VALID
[2022-04-14 19:21:04,808 INFO L290 TraceCheckUtils]: 9: Hoare triple {271#(or (not (= main_~i~0 main_~j~0)) (not (<= main_~x~0 0)) (and (<= (+ main_~z~0 main_~y~0) 0) (< 0 (+ main_~z~0 main_~y~0 1))))} [79] L33-2-->L33-3: Formula: (= v_main_~x~0_4 0) InVars {main_~x~0=v_main_~x~0_4} OutVars{main_~x~0=v_main_~x~0_4} AuxVars[] AssignedVars[] {267#(or (not (= main_~i~0 main_~j~0)) (and (<= (+ main_~z~0 main_~y~0) 0) (< 0 (+ main_~z~0 main_~y~0 1))))} is VALID
[2022-04-14 19:21:04,809 INFO L290 TraceCheckUtils]: 8: Hoare triple {275#(or (not (= main_~i~0 main_~j~0)) (and (or (and (<= 1 main_~x~0) (<= main_~x~0 (+ main_~z~0 main_~y~0)) (<= (+ main_~z~0 main_~y~0) main_~x~0)) (= main_~x~0 0)) (or (and (<= (+ main_~z~0 main_~y~0) 0) (< 0 (+ main_~z~0 main_~y~0 1))) (not (= main_~x~0 0)))))} [80] L33-2-->L33-2: Formula: (let ((.cse0 (= v_main_~x~0_2 0))) (or (and (< v_main_~z~0_2 v_main_~z~0_1) (or (not (<= 1 v_main_~x~0_2)) (not (<= (+ v_main_~x~0_2 v_main_~z~0_2 1) v_main_~z~0_1))) (= v_main_~y~0_1 (+ v_main_~y~0_2 (* v_main_~z~0_2 2) (* (- 2) v_main_~z~0_1))) (= v_main_~x~0_1 (+ v_main_~x~0_2 v_main_~z~0_2 (* (- 1) v_main_~z~0_1))) (not .cse0)) (and (= v_main_~z~0_2 v_main_~z~0_1) (= v_main_~y~0_2 v_main_~y~0_1) (= |v_main_#t~post3_3| |v_main_#t~post3_1|) (= v_main_~x~0_2 v_main_~x~0_1) (= |v_main_#t~post4_3| |v_main_#t~post4_1|) .cse0))) InVars {main_#t~post4=|v_main_#t~post4_3|, main_~y~0=v_main_~y~0_2, main_#t~post3=|v_main_#t~post3_3|, main_~x~0=v_main_~x~0_2, main_~z~0=v_main_~z~0_2} OutVars{main_#t~post4=|v_main_#t~post4_1|, main_~y~0=v_main_~y~0_1, main_#t~post3=|v_main_#t~post3_1|, main_~x~0=v_main_~x~0_1, main_~z~0=v_main_~z~0_1} AuxVars[] AssignedVars[main_~x~0, main_~z~0, main_#t~post4, main_~y~0, main_#t~post3] {271#(or (not (= main_~i~0 main_~j~0)) (not (<= main_~x~0 0)) (and (<= (+ main_~z~0 main_~y~0) 0) (< 0 (+ main_~z~0 main_~y~0 1))))} is VALID
[2022-04-14 19:21:04,813 INFO L290 TraceCheckUtils]: 7: Hoare triple {224#(<= 0 main_~i~0)} [77] L29-->L33-2: Formula: (and (= v_main_~j~0_7 v_main_~y~0_4) (= v_main_~i~0_8 v_main_~x~0_3) (= v_main_~z~0_4 0) (<= 0 v_main_~j~0_7)) InVars {main_~i~0=v_main_~i~0_8, main_~j~0=v_main_~j~0_7} OutVars{main_~i~0=v_main_~i~0_8, main_~y~0=v_main_~y~0_4, main_~x~0=v_main_~x~0_3, main_~z~0=v_main_~z~0_4, main_~j~0=v_main_~j~0_7} AuxVars[] AssignedVars[main_~x~0, main_~z~0, main_~y~0] {275#(or (not (= main_~i~0 main_~j~0)) (and (or (and (<= 1 main_~x~0) (<= main_~x~0 (+ main_~z~0 main_~y~0)) (<= (+ main_~z~0 main_~y~0) main_~x~0)) (= main_~x~0 0)) (or (and (<= (+ main_~z~0 main_~y~0) 0) (< 0 (+ main_~z~0 main_~y~0 1))) (not (= main_~x~0 0)))))} is VALID
[2022-04-14 19:21:04,813 INFO L290 TraceCheckUtils]: 6: Hoare triple {191#true} [74] L28-->L29: Formula: (and (<= v_main_~i~0_7 1000000) (<= 0 v_main_~i~0_7)) InVars {main_~i~0=v_main_~i~0_7} OutVars{main_~i~0=v_main_~i~0_7} AuxVars[] AssignedVars[] {224#(<= 0 main_~i~0)} is VALID
[2022-04-14 19:21:04,813 INFO L290 TraceCheckUtils]: 5: Hoare triple {191#true} [71] mainENTRY-->L28: Formula: (and (<= |v_main_#t~nondet1_2| 2147483647) (= v_main_~j~0_3 |v_main_#t~nondet2_2|) (<= 0 (+ |v_main_#t~nondet2_2| 2147483648)) (<= |v_main_#t~nondet2_2| 2147483647) (<= 0 (+ |v_main_#t~nondet1_2| 2147483648)) (= v_main_~i~0_3 |v_main_#t~nondet1_2|)) InVars {main_#t~nondet1=|v_main_#t~nondet1_2|, main_#t~nondet2=|v_main_#t~nondet2_2|} OutVars{main_~i~0=v_main_~i~0_3, main_~j~0=v_main_~j~0_3} AuxVars[] AssignedVars[main_#t~nondet1, main_~j~0, main_#t~nondet2, main_~i~0] {191#true} is VALID
[2022-04-14 19:21:04,813 INFO L272 TraceCheckUtils]: 4: Hoare triple {191#true} [68] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {191#true} is VALID
[2022-04-14 19:21:04,814 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {191#true} {191#true} [91] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {191#true} is VALID
[2022-04-14 19:21:04,814 INFO L290 TraceCheckUtils]: 2: Hoare triple {191#true} [72] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {191#true} is VALID
[2022-04-14 19:21:04,814 INFO L290 TraceCheckUtils]: 1: Hoare triple {191#true} [69] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= (select |v_#length_1| 2) 9) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {191#true} is VALID
[2022-04-14 19:21:04,814 INFO L272 TraceCheckUtils]: 0: Hoare triple {191#true} [67] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {191#true} is VALID
[2022-04-14 19:21:04,814 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-14 19:21:04,815 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1955248507] provided 0 perfect and 2 imperfect interpolant sequences
[2022-04-14 19:21:04,817 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2022-04-14 19:21:04,817 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 19
[2022-04-14 19:21:04,817 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1417065041]
[2022-04-14 19:21:04,817 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2022-04-14 19:21:04,818 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 17 states have (on average 1.3529411764705883) internal successors, (23), 16 states have internal predecessors, (23), 3 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 15
[2022-04-14 19:21:04,819 INFO L84 Accepts]: Finished accepts. word is accepted.
[2022-04-14 19:21:04,820 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 19 states, 17 states have (on average 1.3529411764705883) internal successors, (23), 16 states have internal predecessors, (23), 3 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-14 19:21:04,844 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 30 edges. 30 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity.
[2022-04-14 19:21:04,845 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 19 states
[2022-04-14 19:21:04,846 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2022-04-14 19:21:04,846 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants.
[2022-04-14 19:21:04,847 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=278, Unknown=0, NotChecked=0, Total=342
[2022-04-14 19:21:04,847 INFO L87 Difference]: Start difference. First operand 16 states and 16 transitions. Second operand has 19 states, 17 states have (on average 1.3529411764705883) internal successors, (23), 16 states have internal predecessors, (23), 3 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-14 19:21:05,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-14 19:21:05,303 INFO L93 Difference]: Finished difference Result 14 states and 14 transitions.
[2022-04-14 19:21:05,303 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states.
[2022-04-14 19:21:05,303 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 17 states have (on average 1.3529411764705883) internal successors, (23), 16 states have internal predecessors, (23), 3 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 15
[2022-04-14 19:21:05,303 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2022-04-14 19:21:05,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 17 states have (on average 1.3529411764705883) internal successors, (23), 16 states have internal predecessors, (23), 3 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-14 19:21:05,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 15 transitions.
[2022-04-14 19:21:05,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 17 states have (on average 1.3529411764705883) internal successors, (23), 16 states have internal predecessors, (23), 3 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-14 19:21:05,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 15 transitions.
[2022-04-14 19:21:05,306 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 10 states and 15 transitions.
[2022-04-14 19:21:05,325 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-14 19:21:05,326 INFO L225 Difference]: With dead ends: 14
[2022-04-14 19:21:05,326 INFO L226 Difference]: Without dead ends: 0
[2022-04-14 19:21:05,326 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 21 SyntacticMatches, 3 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 144 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=129, Invalid=521, Unknown=0, NotChecked=0, Total=650
[2022-04-14 19:21:05,327 INFO L913 BasicCegarLoop]: 8 mSDtfsCounter, 19 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 50 SdHoareTripleChecker+Invalid, 70 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time
[2022-04-14 19:21:05,327 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [19 Valid, 50 Invalid, 70 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time]
[2022-04-14 19:21:05,328 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states.
[2022-04-14 19:21:05,328 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0.
[2022-04-14 19:21:05,328 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa
[2022-04-14 19:21:05,328 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-14 19:21:05,328 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-14 19:21:05,328 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-14 19:21:05,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-14 19:21:05,329 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions.
[2022-04-14 19:21:05,329 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions.
[2022-04-14 19:21:05,329 INFO L282 IsEmpty]: Finished isEmpty. No accepting run.
[2022-04-14 19:21:05,329 INFO L83 IsIncluded]: Finished isIncluded. Language is included
[2022-04-14 19:21:05,329 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-14 19:21:05,329 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-14 19:21:05,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-14 19:21:05,329 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions.
[2022-04-14 19:21:05,329 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions.
[2022-04-14 19:21:05,329 INFO L282 IsEmpty]: Finished isEmpty. No accepting run.
[2022-04-14 19:21:05,329 INFO L83 IsIncluded]: Finished isIncluded. Language is included
[2022-04-14 19:21:05,329 INFO L88 GeneralOperation]: Finished isEquivalent.
[2022-04-14 19:21:05,329 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa
[2022-04-14 19:21:05,330 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-14 19:21:05,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions.
[2022-04-14 19:21:05,330 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 15
[2022-04-14 19:21:05,330 INFO L84 Accepts]: Finished accepts. word is rejected.
[2022-04-14 19:21:05,330 INFO L478 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions.
[2022-04-14 19:21:05,330 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 17 states have (on average 1.3529411764705883) internal successors, (23), 16 states have internal predecessors, (23), 3 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-14 19:21:05,330 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions.
[2022-04-14 19:21:05,330 INFO L282 IsEmpty]: Finished isEmpty. No accepting run.
[2022-04-14 19:21:05,332 INFO L788 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining)
[2022-04-14 19:21:05,359 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-14 19:21:05,543 WARN L460 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-14 19:21:05,545 INFO L719 BasicCegarLoop]: Path program histogram: [1, 1, 1]
[2022-04-14 19:21:05,546 INFO L177 ceAbstractionStarter]: Computing trace abstraction results
[2022-04-14 19:21:05,548 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.04 07:21:05 BasicIcfg
[2022-04-14 19:21:05,548 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction----------------------------
[2022-04-14 19:21:05,549 INFO L158 Benchmark]: Toolchain (without parser) took 4304.50ms. Allocated memory was 174.1MB in the beginning and 219.2MB in the end (delta: 45.1MB). Free memory was 117.7MB in the beginning and 169.8MB in the end (delta: -52.0MB). There was no memory consumed. Max. memory is 8.0GB.
[2022-04-14 19:21:05,549 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 174.1MB. Free memory is still 133.8MB. There was no memory consumed. Max. memory is 8.0GB.
[2022-04-14 19:21:05,550 INFO L158 Benchmark]: CACSL2BoogieTranslator took 269.28ms. Allocated memory was 174.1MB in the beginning and 219.2MB in the end (delta: 45.1MB). Free memory was 117.6MB in the beginning and 191.2MB in the end (delta: -73.6MB). Peak memory consumption was 13.3MB. Max. memory is 8.0GB.
[2022-04-14 19:21:05,550 INFO L158 Benchmark]: Boogie Preprocessor took 23.73ms. Allocated memory is still 219.2MB. Free memory was 191.2MB in the beginning and 189.6MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB.
[2022-04-14 19:21:05,550 INFO L158 Benchmark]: RCFGBuilder took 243.12ms. Allocated memory is still 219.2MB. Free memory was 189.6MB in the beginning and 177.6MB in the end (delta: 12.1MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB.
[2022-04-14 19:21:05,551 INFO L158 Benchmark]: IcfgTransformer took 374.04ms. Allocated memory is still 219.2MB. Free memory was 177.6MB in the beginning and 160.3MB in the end (delta: 17.3MB). Peak memory consumption was 16.8MB. Max. memory is 8.0GB.
[2022-04-14 19:21:05,551 INFO L158 Benchmark]: TraceAbstraction took 3389.09ms. Allocated memory is still 219.2MB. Free memory was 159.8MB in the beginning and 169.8MB in the end (delta: -10.0MB). There was no memory consumed. Max. memory is 8.0GB.
[2022-04-14 19:21:05,552 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] #######################
--- Results ---
* Results from IcfgTransformer:
- StatisticsResult: Jordan loop acceleration statistics
2 HavocedVariables, 3 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=2, 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 174.1MB. Free memory is still 133.8MB. There was no memory consumed. Max. memory is 8.0GB.
* CACSL2BoogieTranslator took 269.28ms. Allocated memory was 174.1MB in the beginning and 219.2MB in the end (delta: 45.1MB). Free memory was 117.6MB in the beginning and 191.2MB in the end (delta: -73.6MB). Peak memory consumption was 13.3MB. Max. memory is 8.0GB.
* Boogie Preprocessor took 23.73ms. Allocated memory is still 219.2MB. Free memory was 191.2MB in the beginning and 189.6MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB.
* RCFGBuilder took 243.12ms. Allocated memory is still 219.2MB. Free memory was 189.6MB in the beginning and 177.6MB in the end (delta: 12.1MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB.
* IcfgTransformer took 374.04ms. Allocated memory is still 219.2MB. Free memory was 177.6MB in the beginning and 160.3MB in the end (delta: 17.3MB). Peak memory consumption was 16.8MB. Max. memory is 8.0GB.
* TraceAbstraction took 3389.09ms. Allocated memory is still 219.2MB. Free memory was 159.8MB in the beginning and 169.8MB in the end (delta: -10.0MB). 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: 19]: call to reach_error is unreachable
For all program executions holds that call to reach_error is unreachable at this location
- StatisticsResult: Ultimate Automizer benchmark data
CFG has 4 procedures, 22 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 3.3s, OverallIterations: 3, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 51 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 50 mSDsluCounter, 115 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 72 mSDsCounter, 18 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 115 IncrementalHoareTripleChecker+Invalid, 133 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 18 mSolverCounterUnsat, 43 mSDtfsCounter, 115 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 67 GetRequests, 28 SyntacticMatches, 3 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 156 ImplicationChecksByTransitivity, 0.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=22occurred in iteration=0, InterpolantAutomatonStates: 21, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 3 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.8s InterpolantComputationTime, 58 NumberOfCodeBlocks, 58 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 68 ConstructedInterpolants, 0 QuantifiedInterpolants, 470 SizeOfPredicates, 5 NumberOfNonLiveVariables, 66 ConjunctsInSsa, 14 ConjunctsInUnsatCore, 5 InterpolantComputations, 2 PerfectInterpolantSequences, 0/3 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available
- AllSpecificationsHoldResult: All specifications hold
1 specifications checked. All of them hold
RESULT: Ultimate proved your program to be correct!
[2022-04-14 19:21:05,583 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0
Received shutdown request...