./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/forester-heap/sll-rb-sentinel-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version cad46833 Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_11ae7644-8a6e-48e5-b9e9-727e41cd7785/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_11ae7644-8a6e-48e5-b9e9-727e41cd7785/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_11ae7644-8a6e-48e5-b9e9-727e41cd7785/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_11ae7644-8a6e-48e5-b9e9-727e41cd7785/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/forester-heap/sll-rb-sentinel-2.i -s /tmp/vcloud-vcloud-master/worker/run_dir_11ae7644-8a6e-48e5-b9e9-727e41cd7785/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_11ae7644-8a6e-48e5-b9e9-727e41cd7785/bin/uautomizer --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash d9f9c3b0fdd5428a38e0eab9236fadbdbb3aa880 .......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE --- Real Ultimate output --- This is Ultimate 0.1.24-cad4683 [2019-11-15 22:11:33,130 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-15 22:11:33,132 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-15 22:11:33,150 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-15 22:11:33,151 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-15 22:11:33,152 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-15 22:11:33,155 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-15 22:11:33,166 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-15 22:11:33,171 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-15 22:11:33,173 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-15 22:11:33,174 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-15 22:11:33,176 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-15 22:11:33,176 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-15 22:11:33,177 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-15 22:11:33,178 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-15 22:11:33,179 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-15 22:11:33,180 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-15 22:11:33,181 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-15 22:11:33,186 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-15 22:11:33,191 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-15 22:11:33,198 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-15 22:11:33,200 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-15 22:11:33,204 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-15 22:11:33,205 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-15 22:11:33,213 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-15 22:11:33,213 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-15 22:11:33,214 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-15 22:11:33,217 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-15 22:11:33,217 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-15 22:11:33,219 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-15 22:11:33,220 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-15 22:11:33,220 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-15 22:11:33,221 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-15 22:11:33,222 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-15 22:11:33,224 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-15 22:11:33,224 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-15 22:11:33,225 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-15 22:11:33,225 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-15 22:11:33,225 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-15 22:11:33,226 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-15 22:11:33,227 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-15 22:11:33,228 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_11ae7644-8a6e-48e5-b9e9-727e41cd7785/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-11-15 22:11:33,262 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-15 22:11:33,262 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-15 22:11:33,264 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-15 22:11:33,264 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-15 22:11:33,264 INFO L138 SettingsManager]: * Use SBE=true [2019-11-15 22:11:33,265 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-15 22:11:33,265 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-15 22:11:33,265 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-15 22:11:33,265 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-15 22:11:33,266 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-15 22:11:33,266 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-15 22:11:33,266 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-15 22:11:33,266 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-15 22:11:33,267 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-15 22:11:33,267 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-15 22:11:33,267 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-15 22:11:33,267 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-15 22:11:33,268 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-15 22:11:33,268 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-15 22:11:33,268 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-15 22:11:33,269 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-15 22:11:33,269 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-15 22:11:33,269 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-15 22:11:33,269 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-15 22:11:33,270 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-15 22:11:33,270 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-15 22:11:33,270 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-15 22:11:33,276 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-15 22:11:33,277 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud-vcloud-master/worker/run_dir_11ae7644-8a6e-48e5-b9e9-727e41cd7785/bin/uautomizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> d9f9c3b0fdd5428a38e0eab9236fadbdbb3aa880 [2019-11-15 22:11:33,310 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-15 22:11:33,323 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-15 22:11:33,326 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-15 22:11:33,328 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-15 22:11:33,328 INFO L275 PluginConnector]: CDTParser initialized [2019-11-15 22:11:33,329 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_11ae7644-8a6e-48e5-b9e9-727e41cd7785/bin/uautomizer/../../sv-benchmarks/c/forester-heap/sll-rb-sentinel-2.i [2019-11-15 22:11:33,401 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_11ae7644-8a6e-48e5-b9e9-727e41cd7785/bin/uautomizer/data/d621afe2c/0548c6e6d3034e7c8a47ea38ea29c744/FLAG9629ed7a5 [2019-11-15 22:11:34,020 INFO L306 CDTParser]: Found 1 translation units. [2019-11-15 22:11:34,021 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_11ae7644-8a6e-48e5-b9e9-727e41cd7785/sv-benchmarks/c/forester-heap/sll-rb-sentinel-2.i [2019-11-15 22:11:34,039 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_11ae7644-8a6e-48e5-b9e9-727e41cd7785/bin/uautomizer/data/d621afe2c/0548c6e6d3034e7c8a47ea38ea29c744/FLAG9629ed7a5 [2019-11-15 22:11:34,219 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_11ae7644-8a6e-48e5-b9e9-727e41cd7785/bin/uautomizer/data/d621afe2c/0548c6e6d3034e7c8a47ea38ea29c744 [2019-11-15 22:11:34,222 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-15 22:11:34,224 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-15 22:11:34,226 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-15 22:11:34,227 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-15 22:11:34,232 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-15 22:11:34,233 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.11 10:11:34" (1/1) ... [2019-11-15 22:11:34,236 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1aa2f979 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:11:34, skipping insertion in model container [2019-11-15 22:11:34,236 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.11 10:11:34" (1/1) ... [2019-11-15 22:11:34,246 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-15 22:11:34,312 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-15 22:11:34,850 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-15 22:11:34,861 INFO L188 MainTranslator]: Completed pre-run [2019-11-15 22:11:34,944 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-15 22:11:35,014 INFO L192 MainTranslator]: Completed translation [2019-11-15 22:11:35,015 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:11:35 WrapperNode [2019-11-15 22:11:35,015 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-15 22:11:35,016 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-15 22:11:35,017 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-15 22:11:35,017 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-15 22:11:35,028 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:11:35" (1/1) ... [2019-11-15 22:11:35,045 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:11:35" (1/1) ... [2019-11-15 22:11:35,072 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-15 22:11:35,073 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-15 22:11:35,073 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-15 22:11:35,074 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-15 22:11:35,084 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:11:35" (1/1) ... [2019-11-15 22:11:35,084 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:11:35" (1/1) ... [2019-11-15 22:11:35,091 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:11:35" (1/1) ... [2019-11-15 22:11:35,092 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:11:35" (1/1) ... [2019-11-15 22:11:35,104 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:11:35" (1/1) ... [2019-11-15 22:11:35,115 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:11:35" (1/1) ... [2019-11-15 22:11:35,118 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:11:35" (1/1) ... [2019-11-15 22:11:35,122 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-15 22:11:35,122 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-15 22:11:35,123 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-15 22:11:35,123 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-15 22:11:35,124 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:11:35" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_11ae7644-8a6e-48e5-b9e9-727e41cd7785/bin/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-15 22:11:35,206 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-11-15 22:11:35,207 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-11-15 22:11:35,207 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-11-15 22:11:35,207 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-11-15 22:11:35,207 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-11-15 22:11:35,208 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-15 22:11:35,208 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-15 22:11:35,208 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-15 22:11:35,669 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-15 22:11:35,669 INFO L284 CfgBuilder]: Removed 15 assume(true) statements. [2019-11-15 22:11:35,670 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 10:11:35 BoogieIcfgContainer [2019-11-15 22:11:35,671 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-15 22:11:35,672 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-15 22:11:35,672 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-15 22:11:35,675 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-15 22:11:35,676 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.11 10:11:34" (1/3) ... [2019-11-15 22:11:35,676 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@16278a53 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.11 10:11:35, skipping insertion in model container [2019-11-15 22:11:35,677 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:11:35" (2/3) ... [2019-11-15 22:11:35,677 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@16278a53 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.11 10:11:35, skipping insertion in model container [2019-11-15 22:11:35,677 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 10:11:35" (3/3) ... [2019-11-15 22:11:35,679 INFO L109 eAbstractionObserver]: Analyzing ICFG sll-rb-sentinel-2.i [2019-11-15 22:11:35,691 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-15 22:11:35,699 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 4 error locations. [2019-11-15 22:11:35,710 INFO L249 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2019-11-15 22:11:35,737 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-15 22:11:35,737 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-15 22:11:35,738 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-15 22:11:35,738 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-15 22:11:35,738 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-15 22:11:35,738 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-15 22:11:35,738 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-15 22:11:35,738 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-15 22:11:35,753 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states. [2019-11-15 22:11:35,759 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-11-15 22:11:35,760 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:11:35,760 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-11-15 22:11:35,762 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:11:35,769 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:11:35,769 INFO L82 PathProgramCache]: Analyzing trace with hash 889968582, now seen corresponding path program 1 times [2019-11-15 22:11:35,777 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:11:35,777 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1627788977] [2019-11-15 22:11:35,778 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:11:35,778 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:11:35,778 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:11:35,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:11:35,947 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:11:35,948 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1627788977] [2019-11-15 22:11:35,949 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:11:35,949 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-15 22:11:35,950 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [571821297] [2019-11-15 22:11:35,953 INFO L442 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-11-15 22:11:35,954 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:11:35,970 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-11-15 22:11:35,971 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-11-15 22:11:35,973 INFO L87 Difference]: Start difference. First operand 33 states. Second operand 2 states. [2019-11-15 22:11:35,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:11:35,994 INFO L93 Difference]: Finished difference Result 61 states and 98 transitions. [2019-11-15 22:11:35,994 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-11-15 22:11:35,995 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 6 [2019-11-15 22:11:35,995 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:11:36,005 INFO L225 Difference]: With dead ends: 61 [2019-11-15 22:11:36,005 INFO L226 Difference]: Without dead ends: 27 [2019-11-15 22:11:36,008 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-11-15 22:11:36,025 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2019-11-15 22:11:36,040 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2019-11-15 22:11:36,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2019-11-15 22:11:36,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 30 transitions. [2019-11-15 22:11:36,044 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 30 transitions. Word has length 6 [2019-11-15 22:11:36,044 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:11:36,044 INFO L462 AbstractCegarLoop]: Abstraction has 27 states and 30 transitions. [2019-11-15 22:11:36,044 INFO L463 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-11-15 22:11:36,045 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 30 transitions. [2019-11-15 22:11:36,045 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-11-15 22:11:36,045 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:11:36,045 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:11:36,046 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:11:36,046 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:11:36,046 INFO L82 PathProgramCache]: Analyzing trace with hash 1806853233, now seen corresponding path program 1 times [2019-11-15 22:11:36,047 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:11:36,047 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1376268359] [2019-11-15 22:11:36,047 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:11:36,047 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:11:36,047 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:11:36,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:11:36,150 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:11:36,150 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1376268359] [2019-11-15 22:11:36,151 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:11:36,151 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 22:11:36,151 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [531092669] [2019-11-15 22:11:36,152 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 22:11:36,153 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:11:36,153 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 22:11:36,153 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 22:11:36,153 INFO L87 Difference]: Start difference. First operand 27 states and 30 transitions. Second operand 4 states. [2019-11-15 22:11:36,280 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:11:36,280 INFO L93 Difference]: Finished difference Result 33 states and 38 transitions. [2019-11-15 22:11:36,281 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 22:11:36,281 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 7 [2019-11-15 22:11:36,281 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:11:36,282 INFO L225 Difference]: With dead ends: 33 [2019-11-15 22:11:36,282 INFO L226 Difference]: Without dead ends: 31 [2019-11-15 22:11:36,283 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-15 22:11:36,283 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2019-11-15 22:11:36,287 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 25. [2019-11-15 22:11:36,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2019-11-15 22:11:36,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 28 transitions. [2019-11-15 22:11:36,289 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 28 transitions. Word has length 7 [2019-11-15 22:11:36,289 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:11:36,289 INFO L462 AbstractCegarLoop]: Abstraction has 25 states and 28 transitions. [2019-11-15 22:11:36,289 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 22:11:36,289 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 28 transitions. [2019-11-15 22:11:36,290 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-11-15 22:11:36,290 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:11:36,290 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:11:36,291 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:11:36,292 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:11:36,292 INFO L82 PathProgramCache]: Analyzing trace with hash -856511048, now seen corresponding path program 1 times [2019-11-15 22:11:36,292 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:11:36,293 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1972755626] [2019-11-15 22:11:36,293 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:11:36,293 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:11:36,293 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:11:36,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:11:36,441 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:11:36,441 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1972755626] [2019-11-15 22:11:36,441 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:11:36,442 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-15 22:11:36,442 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [30286797] [2019-11-15 22:11:36,442 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-15 22:11:36,443 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:11:36,443 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-15 22:11:36,443 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-15 22:11:36,443 INFO L87 Difference]: Start difference. First operand 25 states and 28 transitions. Second operand 5 states. [2019-11-15 22:11:36,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:11:36,612 INFO L93 Difference]: Finished difference Result 50 states and 56 transitions. [2019-11-15 22:11:36,612 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-15 22:11:36,612 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 10 [2019-11-15 22:11:36,613 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:11:36,614 INFO L225 Difference]: With dead ends: 50 [2019-11-15 22:11:36,614 INFO L226 Difference]: Without dead ends: 48 [2019-11-15 22:11:36,615 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-11-15 22:11:36,615 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2019-11-15 22:11:36,621 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 32. [2019-11-15 22:11:36,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2019-11-15 22:11:36,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 36 transitions. [2019-11-15 22:11:36,623 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 36 transitions. Word has length 10 [2019-11-15 22:11:36,624 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:11:36,624 INFO L462 AbstractCegarLoop]: Abstraction has 32 states and 36 transitions. [2019-11-15 22:11:36,624 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-15 22:11:36,624 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 36 transitions. [2019-11-15 22:11:36,625 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-11-15 22:11:36,625 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:11:36,627 INFO L380 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:11:36,627 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:11:36,628 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:11:36,628 INFO L82 PathProgramCache]: Analyzing trace with hash 1594081566, now seen corresponding path program 1 times [2019-11-15 22:11:36,629 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:11:36,629 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1253821270] [2019-11-15 22:11:36,629 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:11:36,629 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:11:36,630 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:11:36,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:11:36,925 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:11:36,926 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1253821270] [2019-11-15 22:11:36,926 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [653057668] [2019-11-15 22:11:36,926 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_11ae7644-8a6e-48e5-b9e9-727e41cd7785/bin/uautomizer/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 22:11:37,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:11:37,045 INFO L256 TraceCheckSpWp]: Trace formula consists of 96 conjuncts, 37 conjunts are in the unsatisfiable core [2019-11-15 22:11:37,056 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:11:37,176 INFO L341 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2019-11-15 22:11:37,177 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 9 treesize of output 11 [2019-11-15 22:11:37,177 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:11:37,206 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:11:37,215 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2019-11-15 22:11:37,216 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 22:11:37,240 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:11:37,242 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-15 22:11:37,242 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:32, output treesize:29 [2019-11-15 22:11:37,357 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:11:37,358 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 39 [2019-11-15 22:11:37,359 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:11:37,441 INFO L567 ElimStorePlain]: treesize reduction 14, result has 80.3 percent of original size [2019-11-15 22:11:37,451 INFO L496 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-15 22:11:37,480 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:11:37,489 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:11:37,492 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 20 [2019-11-15 22:11:37,493 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-15 22:11:37,515 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:11:37,516 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 22:11:37,516 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:59, output treesize:27 [2019-11-15 22:11:37,595 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:11:37,596 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 26 [2019-11-15 22:11:37,597 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:11:37,642 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:11:37,644 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_int_27|], 2=[|v_#memory_int_28|], 4=[|v_#memory_int_30|]} [2019-11-15 22:11:37,660 INFO L496 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-15 22:11:37,707 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:11:37,713 INFO L496 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-15 22:11:37,747 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:11:37,760 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:11:37,779 INFO L341 Elim1Store]: treesize reduction 23, result has 28.1 percent of original size [2019-11-15 22:11:37,780 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 43 [2019-11-15 22:11:37,781 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-11-15 22:11:37,827 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:11:37,830 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, 3 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-11-15 22:11:37,830 INFO L221 ElimStorePlain]: Needed 5 recursive calls to eliminate 7 variables, input treesize:78, output treesize:41 [2019-11-15 22:11:37,958 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 13 [2019-11-15 22:11:37,959 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:11:37,972 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:11:37,973 INFO L496 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 22:11:37,973 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:43, output treesize:3 [2019-11-15 22:11:37,978 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:11:37,978 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 22:11:37,979 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 11 [2019-11-15 22:11:37,979 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [324520438] [2019-11-15 22:11:37,979 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-11-15 22:11:37,980 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:11:37,980 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-11-15 22:11:37,981 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2019-11-15 22:11:37,981 INFO L87 Difference]: Start difference. First operand 32 states and 36 transitions. Second operand 11 states. [2019-11-15 22:11:38,682 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:11:38,682 INFO L93 Difference]: Finished difference Result 58 states and 67 transitions. [2019-11-15 22:11:38,684 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-11-15 22:11:38,684 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 13 [2019-11-15 22:11:38,684 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:11:38,685 INFO L225 Difference]: With dead ends: 58 [2019-11-15 22:11:38,686 INFO L226 Difference]: Without dead ends: 56 [2019-11-15 22:11:38,687 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=69, Invalid=171, Unknown=0, NotChecked=0, Total=240 [2019-11-15 22:11:38,687 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2019-11-15 22:11:38,693 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 23. [2019-11-15 22:11:38,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2019-11-15 22:11:38,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 26 transitions. [2019-11-15 22:11:38,697 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 26 transitions. Word has length 13 [2019-11-15 22:11:38,697 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:11:38,698 INFO L462 AbstractCegarLoop]: Abstraction has 23 states and 26 transitions. [2019-11-15 22:11:38,698 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-11-15 22:11:38,698 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 26 transitions. [2019-11-15 22:11:38,699 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-11-15 22:11:38,699 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:11:38,700 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:11:38,912 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 22:11:38,913 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:11:38,913 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:11:38,914 INFO L82 PathProgramCache]: Analyzing trace with hash -1689639521, now seen corresponding path program 1 times [2019-11-15 22:11:38,914 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:11:38,914 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [612126346] [2019-11-15 22:11:38,915 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:11:38,915 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:11:38,916 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:11:38,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:11:39,113 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:11:39,113 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [612126346] [2019-11-15 22:11:39,114 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:11:39,114 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-15 22:11:39,114 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1351966023] [2019-11-15 22:11:39,115 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-15 22:11:39,115 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:11:39,115 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-15 22:11:39,116 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-15 22:11:39,116 INFO L87 Difference]: Start difference. First operand 23 states and 26 transitions. Second operand 5 states. [2019-11-15 22:11:39,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:11:39,217 INFO L93 Difference]: Finished difference Result 38 states and 43 transitions. [2019-11-15 22:11:39,219 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-15 22:11:39,219 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2019-11-15 22:11:39,219 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:11:39,219 INFO L225 Difference]: With dead ends: 38 [2019-11-15 22:11:39,220 INFO L226 Difference]: Without dead ends: 26 [2019-11-15 22:11:39,220 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 0 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-15 22:11:39,220 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2019-11-15 22:11:39,235 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 25. [2019-11-15 22:11:39,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2019-11-15 22:11:39,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 28 transitions. [2019-11-15 22:11:39,237 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 28 transitions. Word has length 14 [2019-11-15 22:11:39,237 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:11:39,237 INFO L462 AbstractCegarLoop]: Abstraction has 25 states and 28 transitions. [2019-11-15 22:11:39,237 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-15 22:11:39,237 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 28 transitions. [2019-11-15 22:11:39,238 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-11-15 22:11:39,238 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:11:39,239 INFO L380 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:11:39,239 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:11:39,239 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:11:39,240 INFO L82 PathProgramCache]: Analyzing trace with hash 2084817261, now seen corresponding path program 1 times [2019-11-15 22:11:39,240 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:11:39,240 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1206737487] [2019-11-15 22:11:39,243 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:11:39,243 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:11:39,243 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:11:39,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:11:39,342 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:11:39,342 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1206737487] [2019-11-15 22:11:39,343 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1145708762] [2019-11-15 22:11:39,343 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_11ae7644-8a6e-48e5-b9e9-727e41cd7785/bin/uautomizer/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 22:11:39,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:11:39,433 INFO L256 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 11 conjunts are in the unsatisfiable core [2019-11-15 22:11:39,436 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:11:39,452 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:11:39,533 INFO L341 Elim1Store]: treesize reduction 33, result has 55.4 percent of original size [2019-11-15 22:11:39,534 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 48 [2019-11-15 22:11:39,535 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:11:39,617 INFO L567 ElimStorePlain]: treesize reduction 16, result has 81.4 percent of original size [2019-11-15 22:11:39,623 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:11:39,692 INFO L341 Elim1Store]: treesize reduction 33, result has 55.4 percent of original size [2019-11-15 22:11:39,693 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 48 [2019-11-15 22:11:39,693 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 22:11:39,759 INFO L567 ElimStorePlain]: treesize reduction 16, result has 79.7 percent of original size [2019-11-15 22:11:39,760 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 22:11:39,760 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:77, output treesize:63 [2019-11-15 22:11:39,936 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 22:11:39,948 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 22:11:39,975 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 21 [2019-11-15 22:11:39,976 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:11:39,994 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:11:39,994 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 43 treesize of output 43 [2019-11-15 22:11:39,995 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 22:11:40,000 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 25 [2019-11-15 22:11:40,000 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-15 22:11:40,049 INFO L567 ElimStorePlain]: treesize reduction 12, result has 84.6 percent of original size [2019-11-15 22:11:40,057 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 10 [2019-11-15 22:11:40,058 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-11-15 22:11:40,069 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:11:40,070 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 25 [2019-11-15 22:11:40,071 INFO L496 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-11-15 22:11:40,083 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2019-11-15 22:11:40,083 INFO L496 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-11-15 22:11:40,106 INFO L567 ElimStorePlain]: treesize reduction 20, result has 25.9 percent of original size [2019-11-15 22:11:40,106 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 22:11:40,106 INFO L221 ElimStorePlain]: Needed 7 recursive calls to eliminate 4 variables, input treesize:110, output treesize:7 [2019-11-15 22:11:40,128 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:11:40,129 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 22:11:40,129 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2019-11-15 22:11:40,129 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2021514908] [2019-11-15 22:11:40,130 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-15 22:11:40,130 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:11:40,131 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-15 22:11:40,131 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2019-11-15 22:11:40,131 INFO L87 Difference]: Start difference. First operand 25 states and 28 transitions. Second operand 8 states. [2019-11-15 22:11:40,285 WARN L191 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 46 [2019-11-15 22:11:40,530 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:11:40,530 INFO L93 Difference]: Finished difference Result 49 states and 54 transitions. [2019-11-15 22:11:40,531 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-15 22:11:40,531 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 17 [2019-11-15 22:11:40,531 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:11:40,532 INFO L225 Difference]: With dead ends: 49 [2019-11-15 22:11:40,532 INFO L226 Difference]: Without dead ends: 27 [2019-11-15 22:11:40,533 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2019-11-15 22:11:40,534 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2019-11-15 22:11:40,538 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2019-11-15 22:11:40,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2019-11-15 22:11:40,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 30 transitions. [2019-11-15 22:11:40,539 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 30 transitions. Word has length 17 [2019-11-15 22:11:40,539 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:11:40,539 INFO L462 AbstractCegarLoop]: Abstraction has 27 states and 30 transitions. [2019-11-15 22:11:40,539 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-15 22:11:40,540 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 30 transitions. [2019-11-15 22:11:40,540 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-11-15 22:11:40,540 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:11:40,540 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:11:40,741 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 22:11:40,741 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:11:40,742 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:11:40,742 INFO L82 PathProgramCache]: Analyzing trace with hash -1088473273, now seen corresponding path program 1 times [2019-11-15 22:11:40,742 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:11:40,742 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1010842302] [2019-11-15 22:11:40,742 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:11:40,742 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:11:40,743 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:11:40,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:11:41,163 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:11:41,163 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1010842302] [2019-11-15 22:11:41,164 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [475717960] [2019-11-15 22:11:41,164 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_11ae7644-8a6e-48e5-b9e9-727e41cd7785/bin/uautomizer/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 22:11:41,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:11:41,254 INFO L256 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 40 conjunts are in the unsatisfiable core [2019-11-15 22:11:41,257 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:11:41,281 INFO L341 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2019-11-15 22:11:41,282 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 9 treesize of output 11 [2019-11-15 22:11:41,282 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:11:41,290 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:11:41,290 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-15 22:11:41,290 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:17 [2019-11-15 22:11:41,401 INFO L341 Elim1Store]: treesize reduction 8, result has 87.3 percent of original size [2019-11-15 22:11:41,401 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 22 treesize of output 69 [2019-11-15 22:11:41,403 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:11:41,477 INFO L567 ElimStorePlain]: treesize reduction 28, result has 74.3 percent of original size [2019-11-15 22:11:41,485 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2019-11-15 22:11:41,486 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 22:11:41,512 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:11:41,519 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2019-11-15 22:11:41,519 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-15 22:11:41,542 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:11:41,542 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 22:11:41,543 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:79, output treesize:55 [2019-11-15 22:11:41,681 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:11:41,682 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 25 treesize of output 49 [2019-11-15 22:11:41,683 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:11:41,779 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:11:41,789 INFO L496 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-15 22:11:41,851 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:11:42,088 WARN L191 SmtUtils]: Spent 228.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 52 [2019-11-15 22:11:42,088 INFO L341 Elim1Store]: treesize reduction 131, result has 48.2 percent of original size [2019-11-15 22:11:42,089 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 185 treesize of output 197 [2019-11-15 22:11:42,090 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 22:11:42,091 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:11:42,092 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 22:11:42,093 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 22:11:42,094 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 22:11:42,098 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-15 22:11:42,304 WARN L191 SmtUtils]: Spent 205.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 55 [2019-11-15 22:11:42,304 INFO L567 ElimStorePlain]: treesize reduction 1470, result has 9.8 percent of original size [2019-11-15 22:11:42,311 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 143 treesize of output 122 [2019-11-15 22:11:42,312 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-11-15 22:11:42,344 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:11:42,351 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:11:42,363 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 70 treesize of output 29 [2019-11-15 22:11:42,364 INFO L496 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-11-15 22:11:42,401 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:11:42,403 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, 4 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-15 22:11:42,403 INFO L221 ElimStorePlain]: Needed 6 recursive calls to eliminate 8 variables, input treesize:229, output treesize:79 [2019-11-15 22:11:42,537 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2019-11-15 22:11:42,537 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:11:42,561 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:11:42,563 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-11-15 22:11:42,563 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:93, output treesize:82 [2019-11-15 22:11:42,631 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:11:42,632 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 3 case distinctions, treesize of input 83 treesize of output 69 [2019-11-15 22:11:42,633 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:11:42,634 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:11:42,634 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:11:42,635 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:11:42,636 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:11:42,637 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:11:42,638 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:11:42,638 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:11:42,639 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-15 22:11:42,681 INFO L567 ElimStorePlain]: treesize reduction 36, result has 36.8 percent of original size [2019-11-15 22:11:42,682 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 22:11:42,682 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:83, output treesize:4 [2019-11-15 22:11:42,688 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:11:42,689 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 22:11:42,689 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8] total 15 [2019-11-15 22:11:42,689 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2142430138] [2019-11-15 22:11:42,690 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-11-15 22:11:42,690 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:11:42,690 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-11-15 22:11:42,691 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=172, Unknown=0, NotChecked=0, Total=210 [2019-11-15 22:11:42,691 INFO L87 Difference]: Start difference. First operand 27 states and 30 transitions. Second operand 15 states. [2019-11-15 22:11:42,986 WARN L191 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 40 [2019-11-15 22:11:43,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:11:43,970 INFO L93 Difference]: Finished difference Result 84 states and 96 transitions. [2019-11-15 22:11:43,970 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-11-15 22:11:43,970 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 20 [2019-11-15 22:11:43,970 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:11:43,971 INFO L225 Difference]: With dead ends: 84 [2019-11-15 22:11:43,972 INFO L226 Difference]: Without dead ends: 82 [2019-11-15 22:11:43,972 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 81 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=105, Invalid=447, Unknown=0, NotChecked=0, Total=552 [2019-11-15 22:11:43,973 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2019-11-15 22:11:43,981 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 42. [2019-11-15 22:11:43,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2019-11-15 22:11:43,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 48 transitions. [2019-11-15 22:11:43,983 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 48 transitions. Word has length 20 [2019-11-15 22:11:43,983 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:11:43,983 INFO L462 AbstractCegarLoop]: Abstraction has 42 states and 48 transitions. [2019-11-15 22:11:43,983 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-11-15 22:11:43,984 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 48 transitions. [2019-11-15 22:11:43,984 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-11-15 22:11:43,985 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:11:43,985 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:11:44,189 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 22:11:44,189 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:11:44,189 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:11:44,189 INFO L82 PathProgramCache]: Analyzing trace with hash -67404919, now seen corresponding path program 1 times [2019-11-15 22:11:44,190 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:11:44,190 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [417052916] [2019-11-15 22:11:44,190 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:11:44,190 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:11:44,190 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:11:44,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:11:44,593 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:11:44,594 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [417052916] [2019-11-15 22:11:44,594 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [910667611] [2019-11-15 22:11:44,594 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_11ae7644-8a6e-48e5-b9e9-727e41cd7785/bin/uautomizer/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 22:11:44,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:11:44,687 INFO L256 TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 36 conjunts are in the unsatisfiable core [2019-11-15 22:11:44,690 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:11:44,714 INFO L341 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2019-11-15 22:11:44,714 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 9 treesize of output 11 [2019-11-15 22:11:44,715 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:11:44,728 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:11:44,728 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-15 22:11:44,728 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:19, output treesize:20 [2019-11-15 22:11:44,783 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:11:44,783 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 15 [2019-11-15 22:11:44,784 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:11:44,799 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:11:44,805 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2019-11-15 22:11:44,805 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 22:11:44,820 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:11:44,825 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2019-11-15 22:11:44,825 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-15 22:11:44,846 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:11:44,847 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 22:11:44,847 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:68, output treesize:29 [2019-11-15 22:11:44,887 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_int_31|], 2=[|v_#memory_$Pointer$.base_27|], 4=[|v_#memory_$Pointer$.offset_27|]} [2019-11-15 22:11:44,897 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2019-11-15 22:11:44,897 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:11:44,926 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:11:44,951 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:11:44,951 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 85 treesize of output 83 [2019-11-15 22:11:44,952 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:11:44,953 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 22:11:44,978 INFO L567 ElimStorePlain]: treesize reduction 28, result has 69.9 percent of original size [2019-11-15 22:11:44,983 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 25 [2019-11-15 22:11:44,984 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-15 22:11:45,002 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:11:45,002 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 22:11:45,002 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:100, output treesize:38 [2019-11-15 22:11:45,095 INFO L392 ElimStorePlain]: Different costs {0=[|#memory_$Pointer$.base|], 2=[|#memory_$Pointer$.offset|]} [2019-11-15 22:11:45,101 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 22 [2019-11-15 22:11:45,102 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:11:45,115 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:11:45,119 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2019-11-15 22:11:45,120 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 22:11:45,129 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:11:45,129 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 22:11:45,129 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:52, output treesize:11 [2019-11-15 22:11:45,179 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2019-11-15 22:11:45,180 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:11:45,188 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:11:45,188 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 22:11:45,188 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:3 [2019-11-15 22:11:45,226 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:11:45,226 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 22:11:45,227 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 8] total 18 [2019-11-15 22:11:45,227 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1529686739] [2019-11-15 22:11:45,227 INFO L442 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-11-15 22:11:45,228 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:11:45,228 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-11-15 22:11:45,228 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=267, Unknown=0, NotChecked=0, Total=306 [2019-11-15 22:11:45,228 INFO L87 Difference]: Start difference. First operand 42 states and 48 transitions. Second operand 18 states. [2019-11-15 22:11:46,356 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:11:46,356 INFO L93 Difference]: Finished difference Result 83 states and 94 transitions. [2019-11-15 22:11:46,357 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-11-15 22:11:46,357 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 20 [2019-11-15 22:11:46,357 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:11:46,359 INFO L225 Difference]: With dead ends: 83 [2019-11-15 22:11:46,359 INFO L226 Difference]: Without dead ends: 71 [2019-11-15 22:11:46,361 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 14 SyntacticMatches, 1 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 82 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=132, Invalid=624, Unknown=0, NotChecked=0, Total=756 [2019-11-15 22:11:46,361 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2019-11-15 22:11:46,371 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 53. [2019-11-15 22:11:46,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2019-11-15 22:11:46,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 60 transitions. [2019-11-15 22:11:46,372 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 60 transitions. Word has length 20 [2019-11-15 22:11:46,373 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:11:46,373 INFO L462 AbstractCegarLoop]: Abstraction has 53 states and 60 transitions. [2019-11-15 22:11:46,373 INFO L463 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-11-15 22:11:46,373 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 60 transitions. [2019-11-15 22:11:46,374 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-11-15 22:11:46,374 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:11:46,375 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:11:46,578 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 22:11:46,578 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:11:46,579 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:11:46,579 INFO L82 PathProgramCache]: Analyzing trace with hash 299800945, now seen corresponding path program 1 times [2019-11-15 22:11:46,579 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:11:46,579 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [682108489] [2019-11-15 22:11:46,579 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:11:46,579 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:11:46,580 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:11:46,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 22:11:46,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 22:11:46,697 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 22:11:46,697 INFO L445 BasicCegarLoop]: Counterexample might be feasible [2019-11-15 22:11:46,764 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.11 10:11:46 BoogieIcfgContainer [2019-11-15 22:11:46,765 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-15 22:11:46,765 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-15 22:11:46,765 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-15 22:11:46,766 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-15 22:11:46,766 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 10:11:35" (3/4) ... [2019-11-15 22:11:46,769 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2019-11-15 22:11:46,854 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_11ae7644-8a6e-48e5-b9e9-727e41cd7785/bin/uautomizer/witness.graphml [2019-11-15 22:11:46,854 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-15 22:11:46,856 INFO L168 Benchmark]: Toolchain (without parser) took 12632.24 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 289.9 MB). Free memory was 938.0 MB in the beginning and 993.5 MB in the end (delta: -55.5 MB). Peak memory consumption was 234.4 MB. Max. memory is 11.5 GB. [2019-11-15 22:11:46,856 INFO L168 Benchmark]: CDTParser took 0.25 ms. Allocated memory is still 1.0 GB. Free memory is still 967.5 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-15 22:11:46,857 INFO L168 Benchmark]: CACSL2BoogieTranslator took 789.60 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 167.8 MB). Free memory was 938.0 MB in the beginning and 1.1 GB in the end (delta: -206.3 MB). Peak memory consumption was 18.1 MB. Max. memory is 11.5 GB. [2019-11-15 22:11:46,857 INFO L168 Benchmark]: Boogie Procedure Inliner took 56.38 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-15 22:11:46,857 INFO L168 Benchmark]: Boogie Preprocessor took 48.95 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-15 22:11:46,858 INFO L168 Benchmark]: RCFGBuilder took 548.35 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 33.6 MB). Peak memory consumption was 33.6 MB. Max. memory is 11.5 GB. [2019-11-15 22:11:46,859 INFO L168 Benchmark]: TraceAbstraction took 11092.94 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 122.2 MB). Free memory was 1.1 GB in the beginning and 996.5 MB in the end (delta: 114.2 MB). Peak memory consumption was 236.3 MB. Max. memory is 11.5 GB. [2019-11-15 22:11:46,859 INFO L168 Benchmark]: Witness Printer took 89.04 ms. Allocated memory is still 1.3 GB. Free memory was 996.5 MB in the beginning and 993.5 MB in the end (delta: 3.0 MB). Peak memory consumption was 3.0 MB. Max. memory is 11.5 GB. [2019-11-15 22:11:46,864 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.25 ms. Allocated memory is still 1.0 GB. Free memory is still 967.5 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 789.60 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 167.8 MB). Free memory was 938.0 MB in the beginning and 1.1 GB in the end (delta: -206.3 MB). Peak memory consumption was 18.1 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 56.38 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 48.95 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 548.35 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 33.6 MB). Peak memory consumption was 33.6 MB. Max. memory is 11.5 GB. * TraceAbstraction took 11092.94 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 122.2 MB). Free memory was 1.1 GB in the beginning and 996.5 MB in the end (delta: 114.2 MB). Peak memory consumption was 236.3 MB. Max. memory is 11.5 GB. * Witness Printer took 89.04 ms. Allocated memory is still 1.3 GB. Free memory was 996.5 MB in the beginning and 993.5 MB in the end (delta: 3.0 MB). Peak memory consumption was 3.0 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 1039]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L994] SLL* null = malloc(sizeof(SLL)); [L995] null->colour = BLACK [L996] null->next = ((void*)0) [L998] SLL* list = malloc(sizeof(SLL)); [L999] list->next = null [L1000] list->colour = BLACK [L1002] SLL* end = list; [L1005] COND TRUE __VERIFIER_nondet_int() [L1008] end->next = malloc(sizeof(SLL)) [L1009] EXPR end->next [L1009] end = end->next [L1010] end->next = null [L1012] COND FALSE !(__VERIFIER_nondet_int()) [L1018] end->colour = RED [L1019] end->next = malloc(sizeof(SLL)) [L1020] EXPR end->next [L1020] end = end->next [L1021] end->next = null [L1022] end->colour = BLACK [L1005] COND FALSE !(__VERIFIER_nondet_int()) [L1026] end = null [L1027] end = list [L1030] COND FALSE !(!(null != end)) [L1031] EXPR end->colour [L1031] COND FALSE !(!(BLACK == end->colour)) [L1033] COND TRUE null != end [L1035] EXPR end->colour [L1035] COND FALSE !(RED == end->colour) [L1042] EXPR end->next [L1042] end = end->next [L1033] COND TRUE null != end [L1035] EXPR end->colour [L1035] COND TRUE RED == end->colour [L1037] EXPR end->next [L1037] end = end->next [L1038] COND FALSE !(!(null != end)) [L1039] EXPR end->colour [L1039] COND TRUE !(BLACK != end->colour) [L1039] __VERIFIER_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 33 locations, 4 error locations. Result: UNSAFE, OverallTime: 11.0s, OverallIterations: 9, TraceHistogramMax: 2, AutomataDifference: 3.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 201 SDtfs, 315 SDslu, 783 SDs, 0 SdLazy, 873 SolverSat, 119 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 146 GetRequests, 61 SyntacticMatches, 3 SemanticMatches, 82 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 191 ImplicationChecksByTransitivity, 3.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=53occurred in iteration=8, 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, 8 MinimizatonAttempts, 114 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 5.0s InterpolantComputationTime, 200 NumberOfCodeBlocks, 200 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 165 ConstructedInterpolants, 19 QuantifiedInterpolants, 69554 SizeOfPredicates, 50 NumberOfNonLiveVariables, 394 ConjunctsInSsa, 124 ConjunctsInUnsatCore, 12 InterpolantComputations, 4 PerfectInterpolantSequences, 2/24 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...