./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/forester-heap/dll-rb-sentinel-1.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_d17a352f-c488-4312-8241-6670274c9f14/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_d17a352f-c488-4312-8241-6670274c9f14/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_d17a352f-c488-4312-8241-6670274c9f14/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_d17a352f-c488-4312-8241-6670274c9f14/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/forester-heap/dll-rb-sentinel-1.i -s /tmp/vcloud-vcloud-master/worker/run_dir_d17a352f-c488-4312-8241-6670274c9f14/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_d17a352f-c488-4312-8241-6670274c9f14/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 b9633ec6dc7e01a7231c1be5ed310faef61ba6b0 ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ 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-16 00:43:52,131 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-16 00:43:52,133 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-16 00:43:52,147 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-16 00:43:52,147 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-16 00:43:52,149 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-16 00:43:52,151 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-16 00:43:52,162 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-16 00:43:52,164 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-16 00:43:52,165 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-16 00:43:52,166 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-16 00:43:52,167 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-16 00:43:52,167 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-16 00:43:52,168 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-16 00:43:52,169 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-16 00:43:52,170 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-16 00:43:52,170 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-16 00:43:52,171 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-16 00:43:52,173 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-16 00:43:52,174 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-16 00:43:52,176 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-16 00:43:52,176 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-16 00:43:52,177 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-16 00:43:52,178 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-16 00:43:52,181 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-16 00:43:52,181 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-16 00:43:52,182 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-16 00:43:52,182 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-16 00:43:52,183 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-16 00:43:52,183 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-16 00:43:52,184 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-16 00:43:52,184 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-16 00:43:52,185 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-16 00:43:52,185 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-16 00:43:52,186 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-16 00:43:52,186 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-16 00:43:52,187 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-16 00:43:52,187 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-16 00:43:52,187 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-16 00:43:52,188 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-16 00:43:52,189 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-16 00:43:52,189 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_d17a352f-c488-4312-8241-6670274c9f14/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-11-16 00:43:52,202 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-16 00:43:52,202 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-16 00:43:52,203 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-16 00:43:52,204 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-16 00:43:52,204 INFO L138 SettingsManager]: * Use SBE=true [2019-11-16 00:43:52,204 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-16 00:43:52,204 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-16 00:43:52,205 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-16 00:43:52,205 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-16 00:43:52,205 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-16 00:43:52,205 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-16 00:43:52,206 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-16 00:43:52,206 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-16 00:43:52,206 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-16 00:43:52,206 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-16 00:43:52,206 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-16 00:43:52,207 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-16 00:43:52,207 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-16 00:43:52,207 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-16 00:43:52,207 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-16 00:43:52,208 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-16 00:43:52,208 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-16 00:43:52,208 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-16 00:43:52,208 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-16 00:43:52,208 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-16 00:43:52,209 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-16 00:43:52,209 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-16 00:43:52,209 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-16 00:43:52,209 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_d17a352f-c488-4312-8241-6670274c9f14/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 -> b9633ec6dc7e01a7231c1be5ed310faef61ba6b0 [2019-11-16 00:43:52,236 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-16 00:43:52,247 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-16 00:43:52,250 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-16 00:43:52,251 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-16 00:43:52,252 INFO L275 PluginConnector]: CDTParser initialized [2019-11-16 00:43:52,252 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_d17a352f-c488-4312-8241-6670274c9f14/bin/uautomizer/../../sv-benchmarks/c/forester-heap/dll-rb-sentinel-1.i [2019-11-16 00:43:52,312 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_d17a352f-c488-4312-8241-6670274c9f14/bin/uautomizer/data/ae08d5c18/d82c254a80714a329b841cbfed262a70/FLAG60a658645 [2019-11-16 00:43:52,784 INFO L306 CDTParser]: Found 1 translation units. [2019-11-16 00:43:52,784 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_d17a352f-c488-4312-8241-6670274c9f14/sv-benchmarks/c/forester-heap/dll-rb-sentinel-1.i [2019-11-16 00:43:52,806 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_d17a352f-c488-4312-8241-6670274c9f14/bin/uautomizer/data/ae08d5c18/d82c254a80714a329b841cbfed262a70/FLAG60a658645 [2019-11-16 00:43:53,057 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_d17a352f-c488-4312-8241-6670274c9f14/bin/uautomizer/data/ae08d5c18/d82c254a80714a329b841cbfed262a70 [2019-11-16 00:43:53,060 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-16 00:43:53,061 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-16 00:43:53,062 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-16 00:43:53,062 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-16 00:43:53,066 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-16 00:43:53,067 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 12:43:53" (1/1) ... [2019-11-16 00:43:53,070 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6365c130 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:43:53, skipping insertion in model container [2019-11-16 00:43:53,070 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 12:43:53" (1/1) ... [2019-11-16 00:43:53,078 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-16 00:43:53,125 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-16 00:43:53,578 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-16 00:43:53,589 INFO L188 MainTranslator]: Completed pre-run [2019-11-16 00:43:53,645 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-16 00:43:53,702 INFO L192 MainTranslator]: Completed translation [2019-11-16 00:43:53,702 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:43:53 WrapperNode [2019-11-16 00:43:53,703 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-16 00:43:53,703 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-16 00:43:53,704 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-16 00:43:53,704 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-16 00:43:53,713 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:43:53" (1/1) ... [2019-11-16 00:43:53,729 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:43:53" (1/1) ... [2019-11-16 00:43:53,758 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-16 00:43:53,758 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-16 00:43:53,759 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-16 00:43:53,759 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-16 00:43:53,769 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:43:53" (1/1) ... [2019-11-16 00:43:53,770 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:43:53" (1/1) ... [2019-11-16 00:43:53,774 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:43:53" (1/1) ... [2019-11-16 00:43:53,775 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:43:53" (1/1) ... [2019-11-16 00:43:53,786 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:43:53" (1/1) ... [2019-11-16 00:43:53,793 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:43:53" (1/1) ... [2019-11-16 00:43:53,796 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:43:53" (1/1) ... [2019-11-16 00:43:53,806 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-16 00:43:53,807 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-16 00:43:53,807 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-16 00:43:53,807 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-16 00:43:53,808 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:43:53" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_d17a352f-c488-4312-8241-6670274c9f14/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-16 00:43:53,881 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-11-16 00:43:53,881 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-11-16 00:43:53,882 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-11-16 00:43:53,882 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-11-16 00:43:53,883 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-11-16 00:43:53,884 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-16 00:43:53,884 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-16 00:43:53,884 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-16 00:43:54,392 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-16 00:43:54,393 INFO L284 CfgBuilder]: Removed 21 assume(true) statements. [2019-11-16 00:43:54,394 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 12:43:54 BoogieIcfgContainer [2019-11-16 00:43:54,394 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-16 00:43:54,395 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-16 00:43:54,395 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-16 00:43:54,398 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-16 00:43:54,398 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.11 12:43:53" (1/3) ... [2019-11-16 00:43:54,399 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3b748fa2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 12:43:54, skipping insertion in model container [2019-11-16 00:43:54,399 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:43:53" (2/3) ... [2019-11-16 00:43:54,399 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3b748fa2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 12:43:54, skipping insertion in model container [2019-11-16 00:43:54,400 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 12:43:54" (3/3) ... [2019-11-16 00:43:54,401 INFO L109 eAbstractionObserver]: Analyzing ICFG dll-rb-sentinel-1.i [2019-11-16 00:43:54,412 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-16 00:43:54,420 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 7 error locations. [2019-11-16 00:43:54,432 INFO L249 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2019-11-16 00:43:54,456 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-16 00:43:54,456 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-16 00:43:54,457 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-16 00:43:54,457 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-16 00:43:54,457 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-16 00:43:54,457 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-16 00:43:54,457 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-16 00:43:54,457 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-16 00:43:54,474 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states. [2019-11-16 00:43:54,479 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-11-16 00:43:54,480 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:43:54,480 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-11-16 00:43:54,482 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:43:54,487 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:43:54,488 INFO L82 PathProgramCache]: Analyzing trace with hash 891600134, now seen corresponding path program 1 times [2019-11-16 00:43:54,495 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:43:54,495 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1264974961] [2019-11-16 00:43:54,495 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:43:54,495 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:43:54,496 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:43:54,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:43:54,671 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-16 00:43:54,672 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1264974961] [2019-11-16 00:43:54,673 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:43:54,673 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-16 00:43:54,674 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1630749290] [2019-11-16 00:43:54,678 INFO L442 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-11-16 00:43:54,678 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:43:54,694 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-11-16 00:43:54,695 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-11-16 00:43:54,697 INFO L87 Difference]: Start difference. First operand 47 states. Second operand 2 states. [2019-11-16 00:43:54,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:43:54,734 INFO L93 Difference]: Finished difference Result 92 states and 150 transitions. [2019-11-16 00:43:54,735 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-11-16 00:43:54,736 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 6 [2019-11-16 00:43:54,736 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:43:54,748 INFO L225 Difference]: With dead ends: 92 [2019-11-16 00:43:54,753 INFO L226 Difference]: Without dead ends: 41 [2019-11-16 00:43:54,757 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-16 00:43:54,771 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2019-11-16 00:43:54,792 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2019-11-16 00:43:54,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2019-11-16 00:43:54,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 44 transitions. [2019-11-16 00:43:54,799 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 44 transitions. Word has length 6 [2019-11-16 00:43:54,799 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:43:54,800 INFO L462 AbstractCegarLoop]: Abstraction has 41 states and 44 transitions. [2019-11-16 00:43:54,800 INFO L463 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-11-16 00:43:54,800 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 44 transitions. [2019-11-16 00:43:54,800 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-11-16 00:43:54,801 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:43:54,801 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:43:54,801 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:43:54,802 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:43:54,802 INFO L82 PathProgramCache]: Analyzing trace with hash 1806905862, now seen corresponding path program 1 times [2019-11-16 00:43:54,802 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:43:54,802 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [898751469] [2019-11-16 00:43:54,802 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:43:54,803 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:43:54,803 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:43:54,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:43:54,903 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-16 00:43:54,903 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [898751469] [2019-11-16 00:43:54,903 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:43:54,904 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-16 00:43:54,904 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1863995357] [2019-11-16 00:43:54,905 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-16 00:43:54,905 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:43:54,906 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-16 00:43:54,906 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-16 00:43:54,906 INFO L87 Difference]: Start difference. First operand 41 states and 44 transitions. Second operand 4 states. [2019-11-16 00:43:55,047 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:43:55,047 INFO L93 Difference]: Finished difference Result 47 states and 52 transitions. [2019-11-16 00:43:55,048 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-16 00:43:55,048 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 7 [2019-11-16 00:43:55,049 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:43:55,050 INFO L225 Difference]: With dead ends: 47 [2019-11-16 00:43:55,050 INFO L226 Difference]: Without dead ends: 45 [2019-11-16 00:43:55,051 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-16 00:43:55,051 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2019-11-16 00:43:55,056 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 39. [2019-11-16 00:43:55,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2019-11-16 00:43:55,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 42 transitions. [2019-11-16 00:43:55,057 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 42 transitions. Word has length 7 [2019-11-16 00:43:55,058 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:43:55,058 INFO L462 AbstractCegarLoop]: Abstraction has 39 states and 42 transitions. [2019-11-16 00:43:55,058 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-16 00:43:55,058 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 42 transitions. [2019-11-16 00:43:55,059 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-11-16 00:43:55,059 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:43:55,059 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:43:55,060 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:43:55,060 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:43:55,060 INFO L82 PathProgramCache]: Analyzing trace with hash 179566605, now seen corresponding path program 1 times [2019-11-16 00:43:55,061 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:43:55,061 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [126106830] [2019-11-16 00:43:55,061 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:43:55,061 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:43:55,062 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:43:55,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:43:55,161 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-16 00:43:55,161 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [126106830] [2019-11-16 00:43:55,161 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:43:55,162 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-16 00:43:55,162 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [726847621] [2019-11-16 00:43:55,162 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-16 00:43:55,162 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:43:55,163 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-16 00:43:55,163 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-16 00:43:55,163 INFO L87 Difference]: Start difference. First operand 39 states and 42 transitions. Second operand 4 states. [2019-11-16 00:43:55,275 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:43:55,275 INFO L93 Difference]: Finished difference Result 39 states and 42 transitions. [2019-11-16 00:43:55,276 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-16 00:43:55,277 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 8 [2019-11-16 00:43:55,277 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:43:55,278 INFO L225 Difference]: With dead ends: 39 [2019-11-16 00:43:55,278 INFO L226 Difference]: Without dead ends: 37 [2019-11-16 00:43:55,278 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-16 00:43:55,279 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2019-11-16 00:43:55,282 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2019-11-16 00:43:55,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2019-11-16 00:43:55,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 40 transitions. [2019-11-16 00:43:55,284 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 40 transitions. Word has length 8 [2019-11-16 00:43:55,284 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:43:55,284 INFO L462 AbstractCegarLoop]: Abstraction has 37 states and 40 transitions. [2019-11-16 00:43:55,284 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-16 00:43:55,284 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 40 transitions. [2019-11-16 00:43:55,285 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-11-16 00:43:55,285 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:43:55,287 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:43:55,288 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:43:55,288 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:43:55,289 INFO L82 PathProgramCache]: Analyzing trace with hash 711412120, now seen corresponding path program 1 times [2019-11-16 00:43:55,289 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:43:55,289 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [622435505] [2019-11-16 00:43:55,289 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:43:55,290 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:43:55,290 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:43:55,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:43:55,520 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-16 00:43:55,521 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [622435505] [2019-11-16 00:43:55,521 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:43:55,521 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-16 00:43:55,521 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [825912326] [2019-11-16 00:43:55,522 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-16 00:43:55,522 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:43:55,522 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-16 00:43:55,522 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-11-16 00:43:55,522 INFO L87 Difference]: Start difference. First operand 37 states and 40 transitions. Second operand 6 states. [2019-11-16 00:43:55,930 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:43:55,930 INFO L93 Difference]: Finished difference Result 78 states and 86 transitions. [2019-11-16 00:43:55,931 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-16 00:43:55,931 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 10 [2019-11-16 00:43:55,932 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:43:55,933 INFO L225 Difference]: With dead ends: 78 [2019-11-16 00:43:55,933 INFO L226 Difference]: Without dead ends: 76 [2019-11-16 00:43:55,934 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2019-11-16 00:43:55,934 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2019-11-16 00:43:55,946 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 55. [2019-11-16 00:43:55,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2019-11-16 00:43:55,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 63 transitions. [2019-11-16 00:43:55,954 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 63 transitions. Word has length 10 [2019-11-16 00:43:55,954 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:43:55,954 INFO L462 AbstractCegarLoop]: Abstraction has 55 states and 63 transitions. [2019-11-16 00:43:55,954 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-16 00:43:55,954 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 63 transitions. [2019-11-16 00:43:55,955 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-11-16 00:43:55,955 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:43:55,955 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:43:55,955 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:43:55,956 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:43:55,956 INFO L82 PathProgramCache]: Analyzing trace with hash -2056579816, now seen corresponding path program 1 times [2019-11-16 00:43:55,956 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:43:55,956 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [584110469] [2019-11-16 00:43:55,956 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:43:55,956 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:43:55,957 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:43:55,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:43:56,080 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-16 00:43:56,081 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [584110469] [2019-11-16 00:43:56,081 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:43:56,081 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-16 00:43:56,082 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1953947250] [2019-11-16 00:43:56,082 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-16 00:43:56,082 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:43:56,083 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-16 00:43:56,083 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-16 00:43:56,083 INFO L87 Difference]: Start difference. First operand 55 states and 63 transitions. Second operand 4 states. [2019-11-16 00:43:56,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:43:56,230 INFO L93 Difference]: Finished difference Result 55 states and 63 transitions. [2019-11-16 00:43:56,230 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-16 00:43:56,230 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-11-16 00:43:56,231 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:43:56,232 INFO L225 Difference]: With dead ends: 55 [2019-11-16 00:43:56,232 INFO L226 Difference]: Without dead ends: 53 [2019-11-16 00:43:56,232 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-16 00:43:56,233 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2019-11-16 00:43:56,243 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2019-11-16 00:43:56,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2019-11-16 00:43:56,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 60 transitions. [2019-11-16 00:43:56,244 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 60 transitions. Word has length 11 [2019-11-16 00:43:56,244 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:43:56,245 INFO L462 AbstractCegarLoop]: Abstraction has 53 states and 60 transitions. [2019-11-16 00:43:56,245 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-16 00:43:56,245 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 60 transitions. [2019-11-16 00:43:56,246 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-11-16 00:43:56,246 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:43:56,246 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:43:56,246 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:43:56,247 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:43:56,247 INFO L82 PathProgramCache]: Analyzing trace with hash -688119236, now seen corresponding path program 1 times [2019-11-16 00:43:56,247 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:43:56,247 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1271650405] [2019-11-16 00:43:56,247 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:43:56,248 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:43:56,248 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:43:56,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:43:56,387 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-16 00:43:56,387 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1271650405] [2019-11-16 00:43:56,387 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:43:56,387 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-16 00:43:56,387 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1454477635] [2019-11-16 00:43:56,388 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-16 00:43:56,388 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:43:56,388 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-16 00:43:56,389 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-16 00:43:56,389 INFO L87 Difference]: Start difference. First operand 53 states and 60 transitions. Second operand 4 states. [2019-11-16 00:43:56,483 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:43:56,483 INFO L93 Difference]: Finished difference Result 53 states and 60 transitions. [2019-11-16 00:43:56,484 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-16 00:43:56,485 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2019-11-16 00:43:56,485 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:43:56,488 INFO L225 Difference]: With dead ends: 53 [2019-11-16 00:43:56,488 INFO L226 Difference]: Without dead ends: 51 [2019-11-16 00:43:56,489 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-16 00:43:56,489 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2019-11-16 00:43:56,498 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2019-11-16 00:43:56,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2019-11-16 00:43:56,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 57 transitions. [2019-11-16 00:43:56,503 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 57 transitions. Word has length 13 [2019-11-16 00:43:56,504 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:43:56,504 INFO L462 AbstractCegarLoop]: Abstraction has 51 states and 57 transitions. [2019-11-16 00:43:56,504 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-16 00:43:56,511 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 57 transitions. [2019-11-16 00:43:56,512 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-11-16 00:43:56,512 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:43:56,512 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:43:56,513 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:43:56,513 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:43:56,513 INFO L82 PathProgramCache]: Analyzing trace with hash -1285114177, now seen corresponding path program 1 times [2019-11-16 00:43:56,514 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:43:56,514 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1185089167] [2019-11-16 00:43:56,514 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:43:56,514 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:43:56,515 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:43:56,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:43:56,650 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-16 00:43:56,650 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1185089167] [2019-11-16 00:43:56,650 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:43:56,651 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-16 00:43:56,651 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1408402114] [2019-11-16 00:43:56,651 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-16 00:43:56,652 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:43:56,652 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-16 00:43:56,652 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-16 00:43:56,652 INFO L87 Difference]: Start difference. First operand 51 states and 57 transitions. Second operand 5 states. [2019-11-16 00:43:56,779 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:43:56,779 INFO L93 Difference]: Finished difference Result 66 states and 74 transitions. [2019-11-16 00:43:56,780 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-16 00:43:56,780 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2019-11-16 00:43:56,780 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:43:56,781 INFO L225 Difference]: With dead ends: 66 [2019-11-16 00:43:56,781 INFO L226 Difference]: Without dead ends: 54 [2019-11-16 00:43:56,782 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-16 00:43:56,782 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2019-11-16 00:43:56,787 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 53. [2019-11-16 00:43:56,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2019-11-16 00:43:56,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 59 transitions. [2019-11-16 00:43:56,789 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 59 transitions. Word has length 14 [2019-11-16 00:43:56,789 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:43:56,789 INFO L462 AbstractCegarLoop]: Abstraction has 53 states and 59 transitions. [2019-11-16 00:43:56,789 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-16 00:43:56,790 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 59 transitions. [2019-11-16 00:43:56,790 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-11-16 00:43:56,791 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:43:56,791 INFO L380 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:43:56,791 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:43:56,792 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:43:56,792 INFO L82 PathProgramCache]: Analyzing trace with hash 1621160418, now seen corresponding path program 1 times [2019-11-16 00:43:56,792 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:43:56,792 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [923570225] [2019-11-16 00:43:56,792 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:43:56,793 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:43:56,793 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:43:56,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:43:56,872 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-16 00:43:56,872 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [923570225] [2019-11-16 00:43:56,872 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1580473226] [2019-11-16 00:43:56,873 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_d17a352f-c488-4312-8241-6670274c9f14/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-16 00:43:56,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:43:56,955 INFO L256 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 11 conjunts are in the unsatisfiable core [2019-11-16 00:43:56,963 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:43:57,024 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:43:57,026 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:43:57,027 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:43:57,044 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 17 [2019-11-16 00:43:57,045 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:43:57,067 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:43:57,075 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:43:57,076 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:43:57,078 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:43:57,081 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 17 [2019-11-16 00:43:57,081 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-16 00:43:57,097 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:43:57,098 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:43:57,098 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:55, output treesize:33 [2019-11-16 00:43:57,168 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:43:57,170 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 24 treesize of output 10 [2019-11-16 00:43:57,170 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:43:57,186 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:43:57,192 INFO L341 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2019-11-16 00:43:57,192 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 24 treesize of output 10 [2019-11-16 00:43:57,193 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-16 00:43:57,199 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:43:57,199 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-16 00:43:57,200 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:47, output treesize:7 [2019-11-16 00:43:57,204 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-16 00:43:57,204 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-16 00:43:57,205 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 7 [2019-11-16 00:43:57,205 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1306105390] [2019-11-16 00:43:57,206 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-16 00:43:57,206 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:43:57,206 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-16 00:43:57,206 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-11-16 00:43:57,207 INFO L87 Difference]: Start difference. First operand 53 states and 59 transitions. Second operand 7 states. [2019-11-16 00:43:57,445 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:43:57,446 INFO L93 Difference]: Finished difference Result 75 states and 82 transitions. [2019-11-16 00:43:57,446 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-16 00:43:57,446 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 17 [2019-11-16 00:43:57,446 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:43:57,447 INFO L225 Difference]: With dead ends: 75 [2019-11-16 00:43:57,447 INFO L226 Difference]: Without dead ends: 53 [2019-11-16 00:43:57,448 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2019-11-16 00:43:57,448 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2019-11-16 00:43:57,453 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2019-11-16 00:43:57,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2019-11-16 00:43:57,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 58 transitions. [2019-11-16 00:43:57,454 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 58 transitions. Word has length 17 [2019-11-16 00:43:57,454 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:43:57,454 INFO L462 AbstractCegarLoop]: Abstraction has 53 states and 58 transitions. [2019-11-16 00:43:57,454 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-16 00:43:57,455 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 58 transitions. [2019-11-16 00:43:57,455 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-11-16 00:43:57,455 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:43:57,456 INFO L380 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:43:57,661 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:43:57,661 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:43:57,662 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:43:57,662 INFO L82 PathProgramCache]: Analyzing trace with hash 1036168340, now seen corresponding path program 1 times [2019-11-16 00:43:57,662 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:43:57,662 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1997052492] [2019-11-16 00:43:57,662 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:43:57,663 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:43:57,663 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:43:57,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:43:57,960 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-16 00:43:57,961 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1997052492] [2019-11-16 00:43:57,961 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1368562780] [2019-11-16 00:43:57,961 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_d17a352f-c488-4312-8241-6670274c9f14/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-16 00:43:58,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:43:58,057 INFO L256 TraceCheckSpWp]: Trace formula consists of 116 conjuncts, 30 conjunts are in the unsatisfiable core [2019-11-16 00:43:58,064 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:43:58,106 INFO L341 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2019-11-16 00:43:58,107 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-16 00:43:58,107 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:43:58,122 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:43:58,128 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-16 00:43:58,129 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-16 00:43:58,153 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:43:58,154 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-16 00:43:58,154 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:29, output treesize:26 [2019-11-16 00:43:58,305 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:43:58,305 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-16 00:43:58,306 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:43:58,404 INFO L567 ElimStorePlain]: treesize reduction 14, result has 88.6 percent of original size [2019-11-16 00:43:58,423 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:43:58,424 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-16 00:43:58,462 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:43:58,470 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-16 00:43:58,507 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:43:58,514 INFO L496 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-16 00:43:58,555 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:43:58,566 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:43:58,595 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:43:58,596 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 1 case distinctions, treesize of input 77 treesize of output 55 [2019-11-16 00:43:58,597 INFO L496 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-11-16 00:43:58,662 INFO L567 ElimStorePlain]: treesize reduction 20, result has 72.2 percent of original size [2019-11-16 00:43:58,664 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, 4 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:43:58,664 INFO L221 ElimStorePlain]: Needed 6 recursive calls to eliminate 8 variables, input treesize:111, output treesize:24 [2019-11-16 00:43:58,738 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:43:58,739 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-16 00:43:58,739 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:43:58,819 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:43:58,822 INFO L392 ElimStorePlain]: Different costs {2=[|v_#memory_$Pointer$.base_28|, |v_#memory_int_37|, |v_#memory_int_38|, |v_#memory_int_39|], 4=[|v_#memory_int_41|]} [2019-11-16 00:43:58,827 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:43:58,827 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-16 00:43:58,875 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:43:58,880 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-16 00:43:58,908 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:43:58,912 INFO L496 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-16 00:43:58,936 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:43:58,939 INFO L496 ElimStorePlain]: Start of recursive call 6: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-16 00:43:58,960 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:43:58,965 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:43:59,028 INFO L341 Elim1Store]: treesize reduction 65, result has 46.7 percent of original size [2019-11-16 00:43:59,029 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 57 treesize of output 85 [2019-11-16 00:43:59,029 INFO L496 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-11-16 00:43:59,084 INFO L567 ElimStorePlain]: treesize reduction 18, result has 80.9 percent of original size [2019-11-16 00:43:59,086 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:43:59,091 INFO L496 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, 5 dim-2 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-11-16 00:43:59,091 INFO L221 ElimStorePlain]: Needed 7 recursive calls to eliminate 11 variables, input treesize:246, output treesize:40 [2019-11-16 00:43:59,213 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 37 treesize of output 13 [2019-11-16 00:43:59,214 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:43:59,222 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:43:59,223 INFO L496 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:43:59,223 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 7 variables, input treesize:49, output treesize:3 [2019-11-16 00:43:59,231 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-16 00:43:59,232 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-16 00:43:59,232 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 12 [2019-11-16 00:43:59,232 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [611504285] [2019-11-16 00:43:59,233 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-11-16 00:43:59,233 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:43:59,233 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-11-16 00:43:59,234 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2019-11-16 00:43:59,234 INFO L87 Difference]: Start difference. First operand 53 states and 58 transitions. Second operand 12 states. [2019-11-16 00:43:59,948 WARN L191 SmtUtils]: Spent 456.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 58 [2019-11-16 00:44:00,448 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:44:00,448 INFO L93 Difference]: Finished difference Result 85 states and 93 transitions. [2019-11-16 00:44:00,449 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-11-16 00:44:00,449 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 21 [2019-11-16 00:44:00,449 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:44:00,450 INFO L225 Difference]: With dead ends: 85 [2019-11-16 00:44:00,450 INFO L226 Difference]: Without dead ends: 83 [2019-11-16 00:44:00,451 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=88, Invalid=254, Unknown=0, NotChecked=0, Total=342 [2019-11-16 00:44:00,451 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2019-11-16 00:44:00,455 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 35. [2019-11-16 00:44:00,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2019-11-16 00:44:00,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 38 transitions. [2019-11-16 00:44:00,456 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 38 transitions. Word has length 21 [2019-11-16 00:44:00,456 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:44:00,457 INFO L462 AbstractCegarLoop]: Abstraction has 35 states and 38 transitions. [2019-11-16 00:44:00,457 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-11-16 00:44:00,457 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 38 transitions. [2019-11-16 00:44:00,464 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-11-16 00:44:00,466 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:44:00,466 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, 1, 1, 1, 1, 1] [2019-11-16 00:44:00,670 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:44:00,674 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:44:00,674 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:44:00,674 INFO L82 PathProgramCache]: Analyzing trace with hash 1438350182, now seen corresponding path program 1 times [2019-11-16 00:44:00,674 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:44:00,674 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [551493670] [2019-11-16 00:44:00,674 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:44:00,674 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:44:00,674 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:44:00,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:44:01,141 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-16 00:44:01,141 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [551493670] [2019-11-16 00:44:01,141 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1705988700] [2019-11-16 00:44:01,142 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_d17a352f-c488-4312-8241-6670274c9f14/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-16 00:44:01,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:44:01,236 INFO L256 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 60 conjunts are in the unsatisfiable core [2019-11-16 00:44:01,241 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:44:01,261 INFO L341 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2019-11-16 00:44:01,262 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-16 00:44:01,262 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:44:01,273 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:44:01,273 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-16 00:44:01,274 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:22, output treesize:23 [2019-11-16 00:44:01,326 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:44:01,327 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-16 00:44:01,327 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:44:01,446 WARN L191 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 50 [2019-11-16 00:44:01,447 INFO L567 ElimStorePlain]: treesize reduction 14, result has 93.5 percent of original size [2019-11-16 00:44:01,452 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:44:01,456 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:44:01,457 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-16 00:44:01,470 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:44:01,471 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 63 treesize of output 41 [2019-11-16 00:44:01,471 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-16 00:44:01,582 WARN L191 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 46 [2019-11-16 00:44:01,582 INFO L567 ElimStorePlain]: treesize reduction 16, result has 89.4 percent of original size [2019-11-16 00:44:01,585 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:44:01,591 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:44:01,602 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:44:01,603 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 1 case distinctions, treesize of input 63 treesize of output 41 [2019-11-16 00:44:01,603 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-16 00:44:01,691 INFO L567 ElimStorePlain]: treesize reduction 16, result has 81.2 percent of original size [2019-11-16 00:44:01,692 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-16 00:44:01,692 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:203, output treesize:66 [2019-11-16 00:44:01,857 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:44:01,858 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 20 treesize of output 30 [2019-11-16 00:44:01,859 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:44:02,108 WARN L191 SmtUtils]: Spent 248.00 ms on a formula simplification that was a NOOP. DAG size: 81 [2019-11-16 00:44:02,108 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:44:02,111 INFO L392 ElimStorePlain]: Different costs {6=[|v_#memory_$Pointer$.base_32|, |v_#memory_$Pointer$.offset_30|], 11=[|v_#memory_$Pointer$.offset_28|, |v_#memory_$Pointer$.base_30|]} [2019-11-16 00:44:02,129 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:44:02,129 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 433 treesize of output 289 [2019-11-16 00:44:02,131 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-16 00:44:02,459 WARN L191 SmtUtils]: Spent 327.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 75 [2019-11-16 00:44:02,459 INFO L567 ElimStorePlain]: treesize reduction 24, result has 94.6 percent of original size [2019-11-16 00:44:02,490 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 39 [2019-11-16 00:44:02,491 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-16 00:44:02,599 WARN L191 SmtUtils]: Spent 107.00 ms on a formula simplification that was a NOOP. DAG size: 69 [2019-11-16 00:44:02,599 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:44:02,604 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:44:02,610 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:44:02,617 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:44:02,618 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-16 00:44:02,627 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:44:02,674 INFO L341 Elim1Store]: treesize reduction 5, result has 90.7 percent of original size [2019-11-16 00:44:02,675 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 135 treesize of output 97 [2019-11-16 00:44:02,676 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-11-16 00:44:02,838 WARN L191 SmtUtils]: Spent 161.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 60 [2019-11-16 00:44:02,838 INFO L567 ElimStorePlain]: treesize reduction 41, result has 86.4 percent of original size [2019-11-16 00:44:02,849 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:44:02,851 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:44:02,911 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:44:02,911 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 7 case distinctions, treesize of input 174 treesize of output 144 [2019-11-16 00:44:02,914 INFO L496 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-11-16 00:44:03,092 WARN L191 SmtUtils]: Spent 177.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 45 [2019-11-16 00:44:03,093 INFO L567 ElimStorePlain]: treesize reduction 134, result has 42.7 percent of original size [2019-11-16 00:44:03,093 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, 4 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:44:03,094 INFO L221 ElimStorePlain]: Needed 6 recursive calls to eliminate 6 variables, input treesize:457, output treesize:97 [2019-11-16 00:44:03,236 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:44:03,389 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:44:03,391 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:44:03,392 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 5 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 67 treesize of output 19 [2019-11-16 00:44:03,393 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:44:03,412 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:44:03,413 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-16 00:44:03,413 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:138, output treesize:75 [2019-11-16 00:44:03,562 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:44:03,562 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 2 disjoint index pairs (out of 15 index pairs), introduced 9 new quantified variables, introduced 14 case distinctions, treesize of input 85 treesize of output 86 [2019-11-16 00:44:03,563 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:44:03,564 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:44:03,564 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:44:03,565 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:44:03,566 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:44:03,566 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:44:03,567 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:44:03,574 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:44:03,575 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-16 00:44:03,575 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:89, output treesize:4 [2019-11-16 00:44:03,616 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-16 00:44:03,616 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-16 00:44:03,617 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11] total 20 [2019-11-16 00:44:03,617 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1120822382] [2019-11-16 00:44:03,617 INFO L442 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-11-16 00:44:03,617 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:44:03,618 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-11-16 00:44:03,618 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=322, Unknown=0, NotChecked=0, Total=380 [2019-11-16 00:44:03,618 INFO L87 Difference]: Start difference. First operand 35 states and 38 transitions. Second operand 20 states. [2019-11-16 00:44:05,186 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:44:05,186 INFO L93 Difference]: Finished difference Result 117 states and 130 transitions. [2019-11-16 00:44:05,189 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-11-16 00:44:05,190 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 28 [2019-11-16 00:44:05,190 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:44:05,191 INFO L225 Difference]: With dead ends: 117 [2019-11-16 00:44:05,191 INFO L226 Difference]: Without dead ends: 115 [2019-11-16 00:44:05,192 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 20 SyntacticMatches, 1 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 187 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=151, Invalid=779, Unknown=0, NotChecked=0, Total=930 [2019-11-16 00:44:05,192 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2019-11-16 00:44:05,202 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 69. [2019-11-16 00:44:05,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2019-11-16 00:44:05,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 77 transitions. [2019-11-16 00:44:05,203 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 77 transitions. Word has length 28 [2019-11-16 00:44:05,204 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:44:05,204 INFO L462 AbstractCegarLoop]: Abstraction has 69 states and 77 transitions. [2019-11-16 00:44:05,204 INFO L463 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-11-16 00:44:05,204 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 77 transitions. [2019-11-16 00:44:05,205 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-11-16 00:44:05,206 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:44:05,206 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, 1, 1, 1, 1, 1] [2019-11-16 00:44:05,409 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:44:05,410 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:44:05,410 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:44:05,410 INFO L82 PathProgramCache]: Analyzing trace with hash 1572363688, now seen corresponding path program 1 times [2019-11-16 00:44:05,410 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:44:05,411 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1677723740] [2019-11-16 00:44:05,411 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:44:05,411 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:44:05,411 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:44:05,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:44:06,318 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-16 00:44:06,319 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1677723740] [2019-11-16 00:44:06,319 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [788418995] [2019-11-16 00:44:06,319 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_d17a352f-c488-4312-8241-6670274c9f14/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-16 00:44:06,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:44:06,387 INFO L256 TraceCheckSpWp]: Trace formula consists of 121 conjuncts, 30 conjunts are in the unsatisfiable core [2019-11-16 00:44:06,389 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:44:06,413 INFO L341 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2019-11-16 00:44:06,413 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-16 00:44:06,413 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:44:06,425 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:44:06,426 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-16 00:44:06,426 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:16, output treesize:17 [2019-11-16 00:44:06,489 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:44:06,490 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-16 00:44:06,490 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:44:06,532 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:44:06,541 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:44:06,545 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:44:06,546 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-16 00:44:06,559 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:44:06,560 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 67 treesize of output 49 [2019-11-16 00:44:06,560 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-16 00:44:06,610 INFO L567 ElimStorePlain]: treesize reduction 22, result has 85.2 percent of original size [2019-11-16 00:44:06,613 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:44:06,620 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:44:06,636 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:44:06,637 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 1 case distinctions, treesize of input 67 treesize of output 51 [2019-11-16 00:44:06,637 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-16 00:44:06,680 INFO L567 ElimStorePlain]: treesize reduction 24, result has 70.4 percent of original size [2019-11-16 00:44:06,681 INFO L496 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:44:06,681 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 7 variables, input treesize:203, output treesize:45 [2019-11-16 00:44:06,732 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_int_42|], 6=[|v_#memory_$Pointer$.base_34|, |v_#memory_$Pointer$.offset_32|]} [2019-11-16 00:44:06,742 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 25 treesize of output 17 [2019-11-16 00:44:06,742 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:44:06,777 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:44:06,824 INFO L341 Elim1Store]: treesize reduction 74, result has 47.5 percent of original size [2019-11-16 00:44:06,825 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 138 treesize of output 153 [2019-11-16 00:44:06,825 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:44:06,826 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-16 00:44:06,855 INFO L567 ElimStorePlain]: treesize reduction 40, result has 71.2 percent of original size [2019-11-16 00:44:06,875 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:44:06,876 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 91 treesize of output 109 [2019-11-16 00:44:06,877 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-16 00:44:06,899 INFO L567 ElimStorePlain]: treesize reduction 64, result has 48.4 percent of original size [2019-11-16 00:44:06,900 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:44:06,900 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:146, output treesize:60 [2019-11-16 00:44:07,030 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:44:07,030 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 67 treesize of output 58 [2019-11-16 00:44:07,031 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:44:07,058 INFO L567 ElimStorePlain]: treesize reduction 18, result has 67.9 percent of original size [2019-11-16 00:44:07,062 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 3 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 21 [2019-11-16 00:44:07,063 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-16 00:44:07,069 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:44:07,070 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-16 00:44:07,070 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:74, output treesize:9 [2019-11-16 00:44:07,104 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 19 treesize of output 7 [2019-11-16 00:44:07,105 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:44:07,108 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:44:07,108 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:44:07,108 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:19, output treesize:3 [2019-11-16 00:44:07,142 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-16 00:44:07,142 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-16 00:44:07,142 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 8] total 21 [2019-11-16 00:44:07,142 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [263742924] [2019-11-16 00:44:07,143 INFO L442 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-11-16 00:44:07,143 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:44:07,143 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-11-16 00:44:07,144 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=372, Unknown=0, NotChecked=0, Total=420 [2019-11-16 00:44:07,144 INFO L87 Difference]: Start difference. First operand 69 states and 77 transitions. Second operand 21 states. [2019-11-16 00:44:07,336 WARN L191 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 46 [2019-11-16 00:44:07,593 WARN L191 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 56 [2019-11-16 00:44:07,994 WARN L191 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 55 [2019-11-16 00:44:09,304 WARN L191 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 67 [2019-11-16 00:44:09,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:44:09,782 INFO L93 Difference]: Finished difference Result 127 states and 140 transitions. [2019-11-16 00:44:09,783 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-11-16 00:44:09,783 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 28 [2019-11-16 00:44:09,783 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:44:09,786 INFO L225 Difference]: With dead ends: 127 [2019-11-16 00:44:09,786 INFO L226 Difference]: Without dead ends: 115 [2019-11-16 00:44:09,787 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 21 SyntacticMatches, 3 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 245 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=211, Invalid=1121, Unknown=0, NotChecked=0, Total=1332 [2019-11-16 00:44:09,787 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2019-11-16 00:44:09,806 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 78. [2019-11-16 00:44:09,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2019-11-16 00:44:09,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 86 transitions. [2019-11-16 00:44:09,810 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 86 transitions. Word has length 28 [2019-11-16 00:44:09,811 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:44:09,811 INFO L462 AbstractCegarLoop]: Abstraction has 78 states and 86 transitions. [2019-11-16 00:44:09,811 INFO L463 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-11-16 00:44:09,811 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 86 transitions. [2019-11-16 00:44:09,816 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-11-16 00:44:09,818 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:44:09,819 INFO L380 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:44:10,022 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:44:10,026 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:44:10,026 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:44:10,026 INFO L82 PathProgramCache]: Analyzing trace with hash 120690651, now seen corresponding path program 2 times [2019-11-16 00:44:10,026 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:44:10,026 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1297488480] [2019-11-16 00:44:10,027 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:44:10,027 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:44:10,027 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:44:10,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:44:10,583 WARN L191 SmtUtils]: Spent 179.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 46 [2019-11-16 00:44:10,724 WARN L191 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 44 [2019-11-16 00:44:11,385 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:44:11,385 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1297488480] [2019-11-16 00:44:11,386 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1655845573] [2019-11-16 00:44:11,386 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_d17a352f-c488-4312-8241-6670274c9f14/bin/uautomizer/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:44:11,496 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-16 00:44:11,496 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-16 00:44:11,498 INFO L256 TraceCheckSpWp]: Trace formula consists of 147 conjuncts, 53 conjunts are in the unsatisfiable core [2019-11-16 00:44:11,502 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:44:11,529 INFO L341 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2019-11-16 00:44:11,530 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-16 00:44:11,530 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:44:11,546 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:44:11,546 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-16 00:44:11,547 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:22, output treesize:23 [2019-11-16 00:44:11,600 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:44:11,601 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-16 00:44:11,601 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:44:11,760 WARN L191 SmtUtils]: Spent 157.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 51 [2019-11-16 00:44:11,760 INFO L567 ElimStorePlain]: treesize reduction 18, result has 91.8 percent of original size [2019-11-16 00:44:11,766 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:44:11,773 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-16 00:44:11,786 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:44:11,786 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 1 case distinctions, treesize of input 63 treesize of output 41 [2019-11-16 00:44:11,786 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-16 00:44:11,855 INFO L567 ElimStorePlain]: treesize reduction 16, result has 89.4 percent of original size [2019-11-16 00:44:11,858 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:44:11,874 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:44:11,875 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 63 treesize of output 41 [2019-11-16 00:44:11,875 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-16 00:44:11,932 INFO L567 ElimStorePlain]: treesize reduction 16, result has 81.2 percent of original size [2019-11-16 00:44:11,933 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-16 00:44:11,933 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:203, output treesize:66 [2019-11-16 00:44:12,110 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:44:12,110 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 20 treesize of output 30 [2019-11-16 00:44:12,111 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:44:13,062 WARN L191 SmtUtils]: Spent 950.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 102 [2019-11-16 00:44:13,062 INFO L567 ElimStorePlain]: treesize reduction 4, result has 99.7 percent of original size [2019-11-16 00:44:13,066 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_int_45|, |v_#memory_int_46|], 2=[|v_#memory_int_44|, |v_#memory_int_43|], 6=[|v_#memory_$Pointer$.base_37|, |v_#memory_$Pointer$.offset_35|], 11=[|v_#memory_$Pointer$.base_35|, |v_#memory_$Pointer$.offset_33|]} [2019-11-16 00:44:13,083 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-16 00:44:13,708 WARN L191 SmtUtils]: Spent 624.00 ms on a formula simplification that was a NOOP. DAG size: 99 [2019-11-16 00:44:13,708 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:44:13,838 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 23 [2019-11-16 00:44:13,839 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-16 00:44:14,215 WARN L191 SmtUtils]: Spent 375.00 ms on a formula simplification that was a NOOP. DAG size: 93 [2019-11-16 00:44:14,215 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:44:14,238 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:44:14,265 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 290 treesize of output 29 [2019-11-16 00:44:14,266 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-11-16 00:44:14,512 WARN L191 SmtUtils]: Spent 245.00 ms on a formula simplification that was a NOOP. DAG size: 87 [2019-11-16 00:44:14,512 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:44:14,541 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:44:14,542 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 188 treesize of output 138 [2019-11-16 00:44:14,543 INFO L496 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-11-16 00:44:14,918 WARN L191 SmtUtils]: Spent 374.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 83 [2019-11-16 00:44:14,918 INFO L567 ElimStorePlain]: treesize reduction 8, result has 99.3 percent of original size [2019-11-16 00:44:14,926 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:44:14,927 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 1047 treesize of output 635 [2019-11-16 00:44:14,928 INFO L496 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-11-16 00:44:15,231 WARN L191 SmtUtils]: Spent 302.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 77 [2019-11-16 00:44:15,231 INFO L567 ElimStorePlain]: treesize reduction 24, result has 97.7 percent of original size [2019-11-16 00:44:15,261 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 39 [2019-11-16 00:44:15,262 INFO L496 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-11-16 00:44:15,418 WARN L191 SmtUtils]: Spent 156.00 ms on a formula simplification that was a NOOP. DAG size: 71 [2019-11-16 00:44:15,419 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:44:15,602 WARN L191 SmtUtils]: Spent 177.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 67 [2019-11-16 00:44:15,602 INFO L341 Elim1Store]: treesize reduction 151, result has 60.6 percent of original size [2019-11-16 00:44:15,602 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 6 new quantified variables, introduced 9 case distinctions, treesize of input 535 treesize of output 537 [2019-11-16 00:44:15,605 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:44:15,606 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:44:15,608 INFO L496 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-11-16 00:44:15,850 WARN L191 SmtUtils]: Spent 241.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 57 [2019-11-16 00:44:15,850 INFO L567 ElimStorePlain]: treesize reduction 883, result has 28.4 percent of original size [2019-11-16 00:44:15,854 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:44:15,863 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:44:15,864 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:44:15,866 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 90 treesize of output 60 [2019-11-16 00:44:15,867 INFO L496 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-11-16 00:44:15,905 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:44:15,906 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, 8 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:44:15,906 INFO L221 ElimStorePlain]: Needed 10 recursive calls to eliminate 10 variables, input treesize:1422, output treesize:131 [2019-11-16 00:44:16,102 INFO L392 ElimStorePlain]: Different costs {2=[|#memory_$Pointer$.base|], 4=[|#memory_$Pointer$.offset|]} [2019-11-16 00:44:16,122 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:44:16,122 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 6 case distinctions, treesize of input 128 treesize of output 78 [2019-11-16 00:44:16,124 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:44:16,124 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:44:16,125 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:44:16,126 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:44:16,127 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:44:16,128 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:44:16,128 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-16 00:44:16,202 INFO L567 ElimStorePlain]: treesize reduction 12, result has 84.4 percent of original size [2019-11-16 00:44:16,207 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:44:16,210 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 4 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 19 [2019-11-16 00:44:16,211 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-16 00:44:16,226 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:44:16,226 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-16 00:44:16,226 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:142, output treesize:18 [2019-11-16 00:44:16,290 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:44:16,290 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 22 treesize of output 18 [2019-11-16 00:44:16,290 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:44:16,307 INFO L567 ElimStorePlain]: treesize reduction 4, result has 66.7 percent of original size [2019-11-16 00:44:16,308 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:44:16,308 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:22, output treesize:3 [2019-11-16 00:44:16,360 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:44:16,361 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-16 00:44:16,361 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 8] total 20 [2019-11-16 00:44:16,361 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [946606739] [2019-11-16 00:44:16,363 INFO L442 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-11-16 00:44:16,363 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:44:16,363 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-11-16 00:44:16,364 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=326, Unknown=0, NotChecked=0, Total=380 [2019-11-16 00:44:16,364 INFO L87 Difference]: Start difference. First operand 78 states and 86 transitions. Second operand 20 states. [2019-11-16 00:44:16,597 WARN L191 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 57 [2019-11-16 00:44:17,059 WARN L191 SmtUtils]: Spent 261.00 ms on a formula simplification. DAG size of input: 110 DAG size of output: 93 [2019-11-16 00:44:17,274 WARN L191 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 61 [2019-11-16 00:44:17,490 WARN L191 SmtUtils]: Spent 185.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 86 [2019-11-16 00:44:17,771 WARN L191 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 62 [2019-11-16 00:44:18,200 WARN L191 SmtUtils]: Spent 191.00 ms on a formula simplification. DAG size of input: 127 DAG size of output: 79 [2019-11-16 00:44:18,605 WARN L191 SmtUtils]: Spent 148.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 47 [2019-11-16 00:44:18,954 WARN L191 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 63 [2019-11-16 00:44:19,114 WARN L191 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 57 [2019-11-16 00:44:19,274 WARN L191 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 65 [2019-11-16 00:44:19,547 WARN L191 SmtUtils]: Spent 221.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 57 [2019-11-16 00:44:19,748 WARN L191 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 55 [2019-11-16 00:44:19,975 WARN L191 SmtUtils]: Spent 150.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 54 [2019-11-16 00:44:20,645 WARN L191 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 69 [2019-11-16 00:44:20,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:44:20,665 INFO L93 Difference]: Finished difference Result 151 states and 166 transitions. [2019-11-16 00:44:20,666 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-11-16 00:44:20,666 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 31 [2019-11-16 00:44:20,666 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:44:20,667 INFO L225 Difference]: With dead ends: 151 [2019-11-16 00:44:20,667 INFO L226 Difference]: Without dead ends: 139 [2019-11-16 00:44:20,668 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 24 SyntacticMatches, 6 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 372 ImplicationChecksByTransitivity, 4.7s TimeCoverageRelationStatistics Valid=301, Invalid=1339, Unknown=0, NotChecked=0, Total=1640 [2019-11-16 00:44:20,669 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2019-11-16 00:44:20,680 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 102. [2019-11-16 00:44:20,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102 states. [2019-11-16 00:44:20,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 111 transitions. [2019-11-16 00:44:20,682 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 111 transitions. Word has length 31 [2019-11-16 00:44:20,682 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:44:20,682 INFO L462 AbstractCegarLoop]: Abstraction has 102 states and 111 transitions. [2019-11-16 00:44:20,682 INFO L463 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-11-16 00:44:20,683 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 111 transitions. [2019-11-16 00:44:20,683 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-11-16 00:44:20,684 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:44:20,684 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, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:44:20,887 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:44:20,888 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:44:20,888 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:44:20,888 INFO L82 PathProgramCache]: Analyzing trace with hash -994395513, now seen corresponding path program 1 times [2019-11-16 00:44:20,888 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:44:20,888 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [48514157] [2019-11-16 00:44:20,888 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:44:20,889 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:44:20,889 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:44:20,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:44:20,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:44:20,988 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-16 00:44:20,989 INFO L445 BasicCegarLoop]: Counterexample might be feasible [2019-11-16 00:44:21,074 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.11 12:44:21 BoogieIcfgContainer [2019-11-16 00:44:21,074 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-16 00:44:21,075 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-16 00:44:21,075 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-16 00:44:21,075 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-16 00:44:21,076 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 12:43:54" (3/4) ... [2019-11-16 00:44:21,078 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2019-11-16 00:44:21,160 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_d17a352f-c488-4312-8241-6670274c9f14/bin/uautomizer/witness.graphml [2019-11-16 00:44:21,160 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-16 00:44:21,163 INFO L168 Benchmark]: Toolchain (without parser) took 28101.31 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 375.4 MB). Free memory was 946.2 MB in the beginning and 1.1 GB in the end (delta: -139.9 MB). Peak memory consumption was 235.5 MB. Max. memory is 11.5 GB. [2019-11-16 00:44:21,163 INFO L168 Benchmark]: CDTParser took 0.19 ms. Allocated memory is still 1.0 GB. Free memory is still 967.7 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-16 00:44:21,163 INFO L168 Benchmark]: CACSL2BoogieTranslator took 641.23 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 158.3 MB). Free memory was 946.2 MB in the beginning and 1.1 GB in the end (delta: -188.1 MB). Peak memory consumption was 18.2 MB. Max. memory is 11.5 GB. [2019-11-16 00:44:21,164 INFO L168 Benchmark]: Boogie Procedure Inliner took 54.79 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-16 00:44:21,164 INFO L168 Benchmark]: Boogie Preprocessor took 48.31 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-16 00:44:21,165 INFO L168 Benchmark]: RCFGBuilder took 587.24 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: 35.3 MB). Peak memory consumption was 35.3 MB. Max. memory is 11.5 GB. [2019-11-16 00:44:21,165 INFO L168 Benchmark]: TraceAbstraction took 26679.46 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 217.1 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 9.3 MB). Peak memory consumption was 226.4 MB. Max. memory is 11.5 GB. [2019-11-16 00:44:21,166 INFO L168 Benchmark]: Witness Printer took 85.77 ms. Allocated memory is still 1.4 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 3.6 MB). Peak memory consumption was 3.6 MB. Max. memory is 11.5 GB. [2019-11-16 00:44:21,172 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.19 ms. Allocated memory is still 1.0 GB. Free memory is still 967.7 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 641.23 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 158.3 MB). Free memory was 946.2 MB in the beginning and 1.1 GB in the end (delta: -188.1 MB). Peak memory consumption was 18.2 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 54.79 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.31 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 587.24 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: 35.3 MB). Peak memory consumption was 35.3 MB. Max. memory is 11.5 GB. * TraceAbstraction took 26679.46 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 217.1 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 9.3 MB). Peak memory consumption was 226.4 MB. Max. memory is 11.5 GB. * Witness Printer took 85.77 ms. Allocated memory is still 1.4 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 3.6 MB). Peak memory consumption was 3.6 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 1038]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L987] struct TSLL* null = malloc(sizeof(struct TSLL)); [L988] null->next = ((void*)0) [L989] null->prev = ((void*)0) [L990] null->colour = BLACK [L992] struct TSLL* list = malloc(sizeof(struct TSLL)); [L993] list->next = null [L994] list->prev = null [L995] list->colour = BLACK [L997] struct TSLL* end = list; [L1000] COND TRUE __VERIFIER_nondet_int() [L1003] end->next = malloc(sizeof(struct TSLL)) [L1004] EXPR end->next [L1004] end->next->prev = end [L1005] EXPR end->next [L1005] end = end->next [L1006] end->next = null [L1008] COND FALSE !(__VERIFIER_nondet_int()) [L1014] end->colour = RED [L1015] end->next = malloc(sizeof(struct TSLL)) [L1016] EXPR end->next [L1016] end->next->prev = end [L1017] EXPR end->next [L1017] end = end->next [L1018] end->next = null [L1019] end->colour = BLACK [L1021] EXPR end->colour [L1021] COND FALSE !(!(BLACK == end->colour)) [L1022] EXPR end->next [L1022] COND FALSE !(!(null == end->next)) [L1023] COND FALSE !(!(null != end)) [L1000] 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)) [L1032] COND TRUE null != end [L1034] EXPR end->colour [L1034] COND FALSE !(RED == end->colour) [L1041] EXPR end->next [L1041] end = end->next [L1032] COND TRUE null != end [L1034] EXPR end->colour [L1034] COND TRUE RED == end->colour [L1036] EXPR end->next [L1036] end = end->next [L1037] COND FALSE !(!(null != end)) [L1038] EXPR end->colour [L1038] COND TRUE !(BLACK != end->colour) [L1038] __VERIFIER_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 47 locations, 7 error locations. Result: UNSAFE, OverallTime: 26.6s, OverallIterations: 13, TraceHistogramMax: 3, AutomataDifference: 11.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 375 SDtfs, 1097 SDslu, 1397 SDs, 0 SdLazy, 1647 SolverSat, 294 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 3.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 274 GetRequests, 111 SyntacticMatches, 13 SemanticMatches, 150 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 843 ImplicationChecksByTransitivity, 10.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=102occurred in iteration=12, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 12 MinimizatonAttempts, 196 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 12.9s InterpolantComputationTime, 350 NumberOfCodeBlocks, 350 NumberOfCodeBlocksAsserted, 19 NumberOfCheckSat, 302 ConstructedInterpolants, 29 QuantifiedInterpolants, 296787 SizeOfPredicates, 70 NumberOfNonLiveVariables, 602 ConjunctsInSsa, 184 ConjunctsInUnsatCore, 17 InterpolantComputations, 7 PerfectInterpolantSequences, 7/42 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...