./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/systemc/transmitter.01.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 6b5699aa Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_e3029ebd-3803-4b06-bf29-f2f20e2a1973/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_e3029ebd-3803-4b06-bf29-f2f20e2a1973/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_e3029ebd-3803-4b06-bf29-f2f20e2a1973/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_e3029ebd-3803-4b06-bf29-f2f20e2a1973/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/systemc/transmitter.01.cil.c -s /tmp/vcloud-vcloud-master/worker/run_dir_e3029ebd-3803-4b06-bf29-f2f20e2a1973/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_e3029ebd-3803-4b06-bf29-f2f20e2a1973/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 18c351eab8f6ce363bd7076ce800527c30b2b6c5 .................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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-6b5699a [2019-11-25 08:49:20,108 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-25 08:49:20,110 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-25 08:49:20,125 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-25 08:49:20,125 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-25 08:49:20,126 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-25 08:49:20,128 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-25 08:49:20,136 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-25 08:49:20,141 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-25 08:49:20,145 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-25 08:49:20,146 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-25 08:49:20,147 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-25 08:49:20,147 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-25 08:49:20,149 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-25 08:49:20,150 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-25 08:49:20,151 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-25 08:49:20,152 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-25 08:49:20,153 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-25 08:49:20,155 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-25 08:49:20,158 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-25 08:49:20,162 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-25 08:49:20,165 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-25 08:49:20,167 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-25 08:49:20,167 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-25 08:49:20,171 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-25 08:49:20,171 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-25 08:49:20,171 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-25 08:49:20,173 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-25 08:49:20,173 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-25 08:49:20,174 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-25 08:49:20,174 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-25 08:49:20,175 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-25 08:49:20,176 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-25 08:49:20,176 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-25 08:49:20,177 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-25 08:49:20,177 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-25 08:49:20,178 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-25 08:49:20,178 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-25 08:49:20,178 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-25 08:49:20,179 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-25 08:49:20,180 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-25 08:49:20,181 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_e3029ebd-3803-4b06-bf29-f2f20e2a1973/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-11-25 08:49:20,204 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-25 08:49:20,213 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-25 08:49:20,215 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-25 08:49:20,215 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-25 08:49:20,215 INFO L138 SettingsManager]: * Use SBE=true [2019-11-25 08:49:20,215 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-25 08:49:20,215 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-25 08:49:20,216 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-25 08:49:20,216 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-25 08:49:20,216 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-25 08:49:20,216 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-25 08:49:20,217 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-25 08:49:20,217 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-25 08:49:20,217 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-25 08:49:20,217 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-25 08:49:20,217 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-25 08:49:20,218 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-25 08:49:20,219 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-25 08:49:20,219 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-25 08:49:20,219 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-25 08:49:20,220 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-25 08:49:20,220 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-25 08:49:20,220 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-25 08:49:20,220 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-25 08:49:20,220 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-25 08:49:20,221 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-25 08:49:20,221 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-25 08:49:20,221 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-25 08:49:20,222 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_e3029ebd-3803-4b06-bf29-f2f20e2a1973/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 -> 18c351eab8f6ce363bd7076ce800527c30b2b6c5 [2019-11-25 08:49:20,398 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-25 08:49:20,409 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-25 08:49:20,412 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-25 08:49:20,414 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-25 08:49:20,414 INFO L275 PluginConnector]: CDTParser initialized [2019-11-25 08:49:20,415 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_e3029ebd-3803-4b06-bf29-f2f20e2a1973/bin/uautomizer/../../sv-benchmarks/c/systemc/transmitter.01.cil.c [2019-11-25 08:49:20,465 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_e3029ebd-3803-4b06-bf29-f2f20e2a1973/bin/uautomizer/data/47315a65e/122f0d0c57cb42499849009078fd4492/FLAGe8570e922 [2019-11-25 08:49:20,885 INFO L306 CDTParser]: Found 1 translation units. [2019-11-25 08:49:20,886 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_e3029ebd-3803-4b06-bf29-f2f20e2a1973/sv-benchmarks/c/systemc/transmitter.01.cil.c [2019-11-25 08:49:20,895 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_e3029ebd-3803-4b06-bf29-f2f20e2a1973/bin/uautomizer/data/47315a65e/122f0d0c57cb42499849009078fd4492/FLAGe8570e922 [2019-11-25 08:49:20,909 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_e3029ebd-3803-4b06-bf29-f2f20e2a1973/bin/uautomizer/data/47315a65e/122f0d0c57cb42499849009078fd4492 [2019-11-25 08:49:20,912 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-25 08:49:20,913 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-25 08:49:20,918 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-25 08:49:20,918 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-25 08:49:20,922 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-25 08:49:20,923 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 08:49:20" (1/1) ... [2019-11-25 08:49:20,925 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@697d6204 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:49:20, skipping insertion in model container [2019-11-25 08:49:20,925 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 08:49:20" (1/1) ... [2019-11-25 08:49:20,934 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-25 08:49:20,985 INFO L179 MainTranslator]: Built tables and reachable declarations [2019-11-25 08:49:21,278 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-25 08:49:21,292 INFO L201 MainTranslator]: Completed pre-run [2019-11-25 08:49:21,352 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-25 08:49:21,372 INFO L205 MainTranslator]: Completed translation [2019-11-25 08:49:21,373 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:49:21 WrapperNode [2019-11-25 08:49:21,373 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-25 08:49:21,374 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-25 08:49:21,374 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-25 08:49:21,374 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-25 08:49:21,383 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:49:21" (1/1) ... [2019-11-25 08:49:21,391 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:49:21" (1/1) ... [2019-11-25 08:49:21,427 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-25 08:49:21,427 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-25 08:49:21,428 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-25 08:49:21,428 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-25 08:49:21,435 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:49:21" (1/1) ... [2019-11-25 08:49:21,435 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:49:21" (1/1) ... [2019-11-25 08:49:21,438 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:49:21" (1/1) ... [2019-11-25 08:49:21,438 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:49:21" (1/1) ... [2019-11-25 08:49:21,446 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:49:21" (1/1) ... [2019-11-25 08:49:21,468 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:49:21" (1/1) ... [2019-11-25 08:49:21,476 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:49:21" (1/1) ... [2019-11-25 08:49:21,483 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-25 08:49:21,484 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-25 08:49:21,484 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-25 08:49:21,484 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-25 08:49:21,485 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:49:21" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_e3029ebd-3803-4b06-bf29-f2f20e2a1973/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-25 08:49:21,554 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-25 08:49:21,554 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-25 08:49:22,081 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-25 08:49:22,081 INFO L284 CfgBuilder]: Removed 73 assume(true) statements. [2019-11-25 08:49:22,082 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 08:49:22 BoogieIcfgContainer [2019-11-25 08:49:22,082 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-25 08:49:22,082 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-25 08:49:22,082 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-25 08:49:22,084 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-25 08:49:22,085 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.11 08:49:20" (1/3) ... [2019-11-25 08:49:22,085 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@20cf2493 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.11 08:49:22, skipping insertion in model container [2019-11-25 08:49:22,085 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:49:21" (2/3) ... [2019-11-25 08:49:22,087 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@20cf2493 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.11 08:49:22, skipping insertion in model container [2019-11-25 08:49:22,087 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 08:49:22" (3/3) ... [2019-11-25 08:49:22,089 INFO L109 eAbstractionObserver]: Analyzing ICFG transmitter.01.cil.c [2019-11-25 08:49:22,096 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-25 08:49:22,102 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-25 08:49:22,109 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-25 08:49:22,131 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-25 08:49:22,131 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-25 08:49:22,131 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-25 08:49:22,132 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-25 08:49:22,132 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-25 08:49:22,132 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-25 08:49:22,132 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-25 08:49:22,132 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-25 08:49:22,150 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states. [2019-11-25 08:49:22,156 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-11-25 08:49:22,157 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:49:22,157 INFO L410 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:49:22,158 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:49:22,163 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:49:22,164 INFO L82 PathProgramCache]: Analyzing trace with hash 827300887, now seen corresponding path program 1 times [2019-11-25 08:49:22,170 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:49:22,171 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [392477463] [2019-11-25 08:49:22,171 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:49:22,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:49:22,293 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-25 08:49:22,294 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [392477463] [2019-11-25 08:49:22,294 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:49:22,295 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-25 08:49:22,296 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [51316725] [2019-11-25 08:49:22,300 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-25 08:49:22,301 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:49:22,313 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-25 08:49:22,313 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-25 08:49:22,315 INFO L87 Difference]: Start difference. First operand 122 states. Second operand 3 states. [2019-11-25 08:49:22,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:49:22,361 INFO L93 Difference]: Finished difference Result 239 states and 373 transitions. [2019-11-25 08:49:22,362 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-25 08:49:22,363 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 37 [2019-11-25 08:49:22,363 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:49:22,374 INFO L225 Difference]: With dead ends: 239 [2019-11-25 08:49:22,375 INFO L226 Difference]: Without dead ends: 118 [2019-11-25 08:49:22,378 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-25 08:49:22,391 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2019-11-25 08:49:22,413 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 118. [2019-11-25 08:49:22,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 118 states. [2019-11-25 08:49:22,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 174 transitions. [2019-11-25 08:49:22,419 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 174 transitions. Word has length 37 [2019-11-25 08:49:22,419 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:49:22,419 INFO L462 AbstractCegarLoop]: Abstraction has 118 states and 174 transitions. [2019-11-25 08:49:22,419 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-25 08:49:22,419 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 174 transitions. [2019-11-25 08:49:22,421 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-11-25 08:49:22,421 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:49:22,421 INFO L410 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:49:22,421 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:49:22,422 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:49:22,422 INFO L82 PathProgramCache]: Analyzing trace with hash 899687445, now seen corresponding path program 1 times [2019-11-25 08:49:22,422 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:49:22,422 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [16700430] [2019-11-25 08:49:22,423 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:49:22,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:49:22,459 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-25 08:49:22,459 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [16700430] [2019-11-25 08:49:22,459 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:49:22,459 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-25 08:49:22,460 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [360909515] [2019-11-25 08:49:22,461 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-25 08:49:22,461 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:49:22,461 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-25 08:49:22,461 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-25 08:49:22,462 INFO L87 Difference]: Start difference. First operand 118 states and 174 transitions. Second operand 3 states. [2019-11-25 08:49:22,540 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:49:22,540 INFO L93 Difference]: Finished difference Result 308 states and 454 transitions. [2019-11-25 08:49:22,543 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-25 08:49:22,544 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 37 [2019-11-25 08:49:22,544 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:49:22,546 INFO L225 Difference]: With dead ends: 308 [2019-11-25 08:49:22,546 INFO L226 Difference]: Without dead ends: 196 [2019-11-25 08:49:22,547 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-25 08:49:22,548 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 196 states. [2019-11-25 08:49:22,568 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 196 to 194. [2019-11-25 08:49:22,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 194 states. [2019-11-25 08:49:22,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 280 transitions. [2019-11-25 08:49:22,572 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 280 transitions. Word has length 37 [2019-11-25 08:49:22,572 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:49:22,572 INFO L462 AbstractCegarLoop]: Abstraction has 194 states and 280 transitions. [2019-11-25 08:49:22,573 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-25 08:49:22,573 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 280 transitions. [2019-11-25 08:49:22,574 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-11-25 08:49:22,574 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:49:22,574 INFO L410 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:49:22,574 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:49:22,575 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:49:22,575 INFO L82 PathProgramCache]: Analyzing trace with hash -413900843, now seen corresponding path program 1 times [2019-11-25 08:49:22,575 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:49:22,575 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [86825066] [2019-11-25 08:49:22,575 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:49:22,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:49:22,606 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-25 08:49:22,607 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [86825066] [2019-11-25 08:49:22,607 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:49:22,607 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-25 08:49:22,607 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [124030017] [2019-11-25 08:49:22,608 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-25 08:49:22,608 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:49:22,608 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-25 08:49:22,609 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-25 08:49:22,609 INFO L87 Difference]: Start difference. First operand 194 states and 280 transitions. Second operand 3 states. [2019-11-25 08:49:22,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:49:22,644 INFO L93 Difference]: Finished difference Result 381 states and 551 transitions. [2019-11-25 08:49:22,644 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-25 08:49:22,645 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 37 [2019-11-25 08:49:22,645 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:49:22,646 INFO L225 Difference]: With dead ends: 381 [2019-11-25 08:49:22,647 INFO L226 Difference]: Without dead ends: 194 [2019-11-25 08:49:22,648 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-25 08:49:22,649 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194 states. [2019-11-25 08:49:22,665 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194 to 194. [2019-11-25 08:49:22,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 194 states. [2019-11-25 08:49:22,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 272 transitions. [2019-11-25 08:49:22,667 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 272 transitions. Word has length 37 [2019-11-25 08:49:22,668 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:49:22,668 INFO L462 AbstractCegarLoop]: Abstraction has 194 states and 272 transitions. [2019-11-25 08:49:22,668 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-25 08:49:22,668 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 272 transitions. [2019-11-25 08:49:22,669 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-11-25 08:49:22,669 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:49:22,669 INFO L410 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:49:22,670 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:49:22,670 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:49:22,670 INFO L82 PathProgramCache]: Analyzing trace with hash -733369323, now seen corresponding path program 1 times [2019-11-25 08:49:22,670 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:49:22,670 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [327102493] [2019-11-25 08:49:22,671 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:49:22,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:49:22,707 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-25 08:49:22,708 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [327102493] [2019-11-25 08:49:22,708 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:49:22,708 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-25 08:49:22,708 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [752624776] [2019-11-25 08:49:22,709 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-25 08:49:22,709 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:49:22,709 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-25 08:49:22,709 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-25 08:49:22,710 INFO L87 Difference]: Start difference. First operand 194 states and 272 transitions. Second operand 3 states. [2019-11-25 08:49:22,768 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:49:22,768 INFO L93 Difference]: Finished difference Result 380 states and 534 transitions. [2019-11-25 08:49:22,772 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-25 08:49:22,772 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 37 [2019-11-25 08:49:22,773 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:49:22,774 INFO L225 Difference]: With dead ends: 380 [2019-11-25 08:49:22,776 INFO L226 Difference]: Without dead ends: 194 [2019-11-25 08:49:22,777 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-25 08:49:22,780 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194 states. [2019-11-25 08:49:22,801 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194 to 194. [2019-11-25 08:49:22,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 194 states. [2019-11-25 08:49:22,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 260 transitions. [2019-11-25 08:49:22,809 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 260 transitions. Word has length 37 [2019-11-25 08:49:22,809 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:49:22,810 INFO L462 AbstractCegarLoop]: Abstraction has 194 states and 260 transitions. [2019-11-25 08:49:22,810 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-25 08:49:22,810 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 260 transitions. [2019-11-25 08:49:22,811 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-11-25 08:49:22,813 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:49:22,813 INFO L410 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:49:22,813 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:49:22,814 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:49:22,814 INFO L82 PathProgramCache]: Analyzing trace with hash -2103987404, now seen corresponding path program 1 times [2019-11-25 08:49:22,814 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:49:22,814 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [729863795] [2019-11-25 08:49:22,815 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:49:22,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:49:22,890 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-25 08:49:22,890 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [729863795] [2019-11-25 08:49:22,891 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:49:22,891 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-25 08:49:22,891 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1400039807] [2019-11-25 08:49:22,891 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-25 08:49:22,891 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:49:22,892 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-25 08:49:22,892 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-25 08:49:22,892 INFO L87 Difference]: Start difference. First operand 194 states and 260 transitions. Second operand 3 states. [2019-11-25 08:49:22,958 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:49:22,958 INFO L93 Difference]: Finished difference Result 525 states and 700 transitions. [2019-11-25 08:49:22,958 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-25 08:49:22,958 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 37 [2019-11-25 08:49:22,959 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:49:22,961 INFO L225 Difference]: With dead ends: 525 [2019-11-25 08:49:22,961 INFO L226 Difference]: Without dead ends: 356 [2019-11-25 08:49:22,962 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-25 08:49:22,963 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 356 states. [2019-11-25 08:49:22,980 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 356 to 334. [2019-11-25 08:49:22,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 334 states. [2019-11-25 08:49:22,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 334 states to 334 states and 435 transitions. [2019-11-25 08:49:22,982 INFO L78 Accepts]: Start accepts. Automaton has 334 states and 435 transitions. Word has length 37 [2019-11-25 08:49:22,982 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:49:22,982 INFO L462 AbstractCegarLoop]: Abstraction has 334 states and 435 transitions. [2019-11-25 08:49:22,982 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-25 08:49:22,982 INFO L276 IsEmpty]: Start isEmpty. Operand 334 states and 435 transitions. [2019-11-25 08:49:22,985 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-11-25 08:49:22,985 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:49:22,985 INFO L410 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:49:22,986 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:49:22,986 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:49:22,986 INFO L82 PathProgramCache]: Analyzing trace with hash -303434219, now seen corresponding path program 1 times [2019-11-25 08:49:22,986 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:49:22,987 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [731672736] [2019-11-25 08:49:22,987 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:49:22,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:49:23,044 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-25 08:49:23,045 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [731672736] [2019-11-25 08:49:23,045 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:49:23,045 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-25 08:49:23,045 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1869026650] [2019-11-25 08:49:23,046 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-25 08:49:23,046 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:49:23,046 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-25 08:49:23,046 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-25 08:49:23,047 INFO L87 Difference]: Start difference. First operand 334 states and 435 transitions. Second operand 3 states. [2019-11-25 08:49:23,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:49:23,102 INFO L93 Difference]: Finished difference Result 910 states and 1192 transitions. [2019-11-25 08:49:23,103 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-25 08:49:23,103 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 38 [2019-11-25 08:49:23,103 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:49:23,107 INFO L225 Difference]: With dead ends: 910 [2019-11-25 08:49:23,107 INFO L226 Difference]: Without dead ends: 606 [2019-11-25 08:49:23,108 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-25 08:49:23,109 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 606 states. [2019-11-25 08:49:23,134 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 606 to 598. [2019-11-25 08:49:23,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 598 states. [2019-11-25 08:49:23,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 598 states to 598 states and 772 transitions. [2019-11-25 08:49:23,137 INFO L78 Accepts]: Start accepts. Automaton has 598 states and 772 transitions. Word has length 38 [2019-11-25 08:49:23,137 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:49:23,137 INFO L462 AbstractCegarLoop]: Abstraction has 598 states and 772 transitions. [2019-11-25 08:49:23,137 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-25 08:49:23,137 INFO L276 IsEmpty]: Start isEmpty. Operand 598 states and 772 transitions. [2019-11-25 08:49:23,139 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-11-25 08:49:23,139 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:49:23,139 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:49:23,139 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:49:23,140 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:49:23,140 INFO L82 PathProgramCache]: Analyzing trace with hash -1237930563, now seen corresponding path program 1 times [2019-11-25 08:49:23,140 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:49:23,140 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [323380985] [2019-11-25 08:49:23,140 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:49:23,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:49:23,180 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-25 08:49:23,181 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [323380985] [2019-11-25 08:49:23,181 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:49:23,181 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-25 08:49:23,181 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1824345895] [2019-11-25 08:49:23,182 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-25 08:49:23,182 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:49:23,182 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-25 08:49:23,183 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-25 08:49:23,183 INFO L87 Difference]: Start difference. First operand 598 states and 772 transitions. Second operand 3 states. [2019-11-25 08:49:23,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:49:23,254 INFO L93 Difference]: Finished difference Result 1152 states and 1499 transitions. [2019-11-25 08:49:23,255 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-25 08:49:23,255 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 51 [2019-11-25 08:49:23,255 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:49:23,260 INFO L225 Difference]: With dead ends: 1152 [2019-11-25 08:49:23,260 INFO L226 Difference]: Without dead ends: 864 [2019-11-25 08:49:23,261 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-25 08:49:23,263 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 864 states. [2019-11-25 08:49:23,303 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 864 to 864. [2019-11-25 08:49:23,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 864 states. [2019-11-25 08:49:23,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 864 states to 864 states and 1109 transitions. [2019-11-25 08:49:23,307 INFO L78 Accepts]: Start accepts. Automaton has 864 states and 1109 transitions. Word has length 51 [2019-11-25 08:49:23,307 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:49:23,308 INFO L462 AbstractCegarLoop]: Abstraction has 864 states and 1109 transitions. [2019-11-25 08:49:23,308 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-25 08:49:23,308 INFO L276 IsEmpty]: Start isEmpty. Operand 864 states and 1109 transitions. [2019-11-25 08:49:23,309 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-11-25 08:49:23,309 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:49:23,310 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 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, 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, 1] [2019-11-25 08:49:23,310 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:49:23,310 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:49:23,310 INFO L82 PathProgramCache]: Analyzing trace with hash -690734764, now seen corresponding path program 1 times [2019-11-25 08:49:23,310 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:49:23,311 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [853796632] [2019-11-25 08:49:23,311 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:49:23,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:49:23,403 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-11-25 08:49:23,403 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [853796632] [2019-11-25 08:49:23,403 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:49:23,403 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-25 08:49:23,404 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1923747607] [2019-11-25 08:49:23,404 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-25 08:49:23,404 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:49:23,405 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-25 08:49:23,405 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-25 08:49:23,405 INFO L87 Difference]: Start difference. First operand 864 states and 1109 transitions. Second operand 5 states. [2019-11-25 08:49:23,671 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:49:23,671 INFO L93 Difference]: Finished difference Result 2777 states and 3544 transitions. [2019-11-25 08:49:23,672 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-25 08:49:23,672 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 68 [2019-11-25 08:49:23,672 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:49:23,682 INFO L225 Difference]: With dead ends: 2777 [2019-11-25 08:49:23,682 INFO L226 Difference]: Without dead ends: 1948 [2019-11-25 08:49:23,683 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-11-25 08:49:23,687 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1948 states. [2019-11-25 08:49:23,750 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1948 to 909. [2019-11-25 08:49:23,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 909 states. [2019-11-25 08:49:23,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 909 states to 909 states and 1143 transitions. [2019-11-25 08:49:23,754 INFO L78 Accepts]: Start accepts. Automaton has 909 states and 1143 transitions. Word has length 68 [2019-11-25 08:49:23,754 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:49:23,755 INFO L462 AbstractCegarLoop]: Abstraction has 909 states and 1143 transitions. [2019-11-25 08:49:23,755 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-25 08:49:23,755 INFO L276 IsEmpty]: Start isEmpty. Operand 909 states and 1143 transitions. [2019-11-25 08:49:23,758 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-11-25 08:49:23,758 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:49:23,758 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 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, 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, 1] [2019-11-25 08:49:23,758 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:49:23,758 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:49:23,759 INFO L82 PathProgramCache]: Analyzing trace with hash 696050646, now seen corresponding path program 1 times [2019-11-25 08:49:23,759 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:49:23,761 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [906304655] [2019-11-25 08:49:23,761 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:49:23,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:49:23,868 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-11-25 08:49:23,868 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [906304655] [2019-11-25 08:49:23,868 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:49:23,869 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-25 08:49:23,869 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1254582067] [2019-11-25 08:49:23,869 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-25 08:49:23,869 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:49:23,870 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-25 08:49:23,870 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-25 08:49:23,870 INFO L87 Difference]: Start difference. First operand 909 states and 1143 transitions. Second operand 5 states. [2019-11-25 08:49:24,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:49:24,071 INFO L93 Difference]: Finished difference Result 2232 states and 2821 transitions. [2019-11-25 08:49:24,071 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-25 08:49:24,071 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 68 [2019-11-25 08:49:24,072 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:49:24,078 INFO L225 Difference]: With dead ends: 2232 [2019-11-25 08:49:24,079 INFO L226 Difference]: Without dead ends: 1361 [2019-11-25 08:49:24,080 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-11-25 08:49:24,082 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1361 states. [2019-11-25 08:49:24,155 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1361 to 921. [2019-11-25 08:49:24,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 921 states. [2019-11-25 08:49:24,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 921 states to 921 states and 1133 transitions. [2019-11-25 08:49:24,159 INFO L78 Accepts]: Start accepts. Automaton has 921 states and 1133 transitions. Word has length 68 [2019-11-25 08:49:24,159 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:49:24,159 INFO L462 AbstractCegarLoop]: Abstraction has 921 states and 1133 transitions. [2019-11-25 08:49:24,159 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-25 08:49:24,159 INFO L276 IsEmpty]: Start isEmpty. Operand 921 states and 1133 transitions. [2019-11-25 08:49:24,160 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-11-25 08:49:24,160 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:49:24,161 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 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, 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, 1] [2019-11-25 08:49:24,161 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:49:24,161 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:49:24,161 INFO L82 PathProgramCache]: Analyzing trace with hash 680531928, now seen corresponding path program 1 times [2019-11-25 08:49:24,162 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:49:24,162 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [893900975] [2019-11-25 08:49:24,162 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:49:24,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-25 08:49:24,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-25 08:49:24,245 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-25 08:49:24,245 INFO L475 BasicCegarLoop]: Counterexample might be feasible [2019-11-25 08:49:24,342 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.11 08:49:24 BoogieIcfgContainer [2019-11-25 08:49:24,342 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-25 08:49:24,342 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-25 08:49:24,342 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-25 08:49:24,343 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-25 08:49:24,343 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 08:49:22" (3/4) ... [2019-11-25 08:49:24,345 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2019-11-25 08:49:24,460 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_e3029ebd-3803-4b06-bf29-f2f20e2a1973/bin/uautomizer/witness.graphml [2019-11-25 08:49:24,461 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-25 08:49:24,463 INFO L168 Benchmark]: Toolchain (without parser) took 3548.81 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 144.7 MB). Free memory was 950.1 MB in the beginning and 986.0 MB in the end (delta: -36.0 MB). Peak memory consumption was 108.8 MB. Max. memory is 11.5 GB. [2019-11-25 08:49:24,467 INFO L168 Benchmark]: CDTParser took 0.25 ms. Allocated memory is still 1.0 GB. Free memory is still 966.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-25 08:49:24,468 INFO L168 Benchmark]: CACSL2BoogieTranslator took 455.30 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 144.7 MB). Free memory was 950.1 MB in the beginning and 1.1 GB in the end (delta: -189.6 MB). Peak memory consumption was 24.1 MB. Max. memory is 11.5 GB. [2019-11-25 08:49:24,468 INFO L168 Benchmark]: Boogie Procedure Inliner took 53.69 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: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. [2019-11-25 08:49:24,469 INFO L168 Benchmark]: Boogie Preprocessor took 56.10 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-25 08:49:24,469 INFO L168 Benchmark]: RCFGBuilder took 598.04 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: 38.5 MB). Peak memory consumption was 38.5 MB. Max. memory is 11.5 GB. [2019-11-25 08:49:24,469 INFO L168 Benchmark]: TraceAbstraction took 2259.57 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 992.9 MB in the end (delta: 101.5 MB). Peak memory consumption was 101.5 MB. Max. memory is 11.5 GB. [2019-11-25 08:49:24,470 INFO L168 Benchmark]: Witness Printer took 118.53 ms. Allocated memory is still 1.2 GB. Free memory was 992.9 MB in the beginning and 986.0 MB in the end (delta: 6.9 MB). Peak memory consumption was 6.9 MB. Max. memory is 11.5 GB. [2019-11-25 08:49:24,472 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.25 ms. Allocated memory is still 1.0 GB. Free memory is still 966.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 455.30 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 144.7 MB). Free memory was 950.1 MB in the beginning and 1.1 GB in the end (delta: -189.6 MB). Peak memory consumption was 24.1 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 53.69 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: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 56.10 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 598.04 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: 38.5 MB). Peak memory consumption was 38.5 MB. Max. memory is 11.5 GB. * TraceAbstraction took 2259.57 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 992.9 MB in the end (delta: 101.5 MB). Peak memory consumption was 101.5 MB. Max. memory is 11.5 GB. * Witness Printer took 118.53 ms. Allocated memory is still 1.2 GB. Free memory was 992.9 MB in the beginning and 986.0 MB in the end (delta: 6.9 MB). Peak memory consumption was 6.9 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 11]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L15] int m_pc = 0; [L16] int t1_pc = 0; [L17] int m_st ; [L18] int t1_st ; [L19] int m_i ; [L20] int t1_i ; [L21] int M_E = 2; [L22] int T1_E = 2; [L23] int E_1 = 2; VAL [E_1=2, M_E=2, m_i=0, m_pc=0, m_st=0, T1_E=2, t1_i=0, t1_pc=0, t1_st=0] [L439] int __retres1 ; [L354] m_i = 1 [L355] t1_i = 1 VAL [E_1=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0] [L380] int kernel_st ; [L381] int tmp ; [L382] int tmp___0 ; [L386] kernel_st = 0 VAL [E_1=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0] [L151] COND TRUE m_i == 1 [L152] m_st = 0 VAL [E_1=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0] [L156] COND TRUE t1_i == 1 [L157] t1_st = 0 VAL [E_1=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0] [L240] COND FALSE !(M_E == 0) VAL [E_1=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0] [L245] COND FALSE !(T1_E == 0) VAL [E_1=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0] [L250] COND FALSE !(E_1 == 0) VAL [E_1=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0] [L283] int tmp ; [L284] int tmp___0 ; [L102] int __retres1 ; VAL [E_1=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0] [L105] COND FALSE !(m_pc == 1) VAL [E_1=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0] [L115] __retres1 = 0 VAL [E_1=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0] [L117] return (__retres1); VAL [E_1=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0] [L288] tmp = is_master_triggered() [L290] COND FALSE !(\read(tmp)) VAL [E_1=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0] [L121] int __retres1 ; VAL [E_1=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0] [L124] COND FALSE !(t1_pc == 1) VAL [E_1=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0] [L134] __retres1 = 0 VAL [E_1=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0] [L136] return (__retres1); VAL [E_1=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0] [L296] tmp___0 = is_transmit1_triggered() [L298] COND FALSE !(\read(tmp___0)) VAL [E_1=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0] [L263] COND FALSE !(M_E == 1) VAL [E_1=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0] [L268] COND FALSE !(T1_E == 1) VAL [E_1=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0] [L273] COND FALSE !(E_1 == 1) VAL [E_1=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0] [L394] COND TRUE 1 VAL [E_1=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0] [L397] kernel_st = 1 [L187] int tmp ; VAL [E_1=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0] [L191] COND TRUE 1 VAL [E_1=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0] [L166] int __retres1 ; VAL [E_1=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0] [L169] COND TRUE m_st == 0 [L170] __retres1 = 1 VAL [E_1=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0] [L182] return (__retres1); VAL [E_1=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0] [L194] tmp = exists_runnable_thread() [L196] COND TRUE \read(tmp) VAL [E_1=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0] [L201] COND TRUE m_st == 0 [L202] int tmp_ndt_1; [L203] tmp_ndt_1 = __VERIFIER_nondet_int() [L204] COND FALSE !(\read(tmp_ndt_1)) VAL [E_1=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0] [L215] COND TRUE t1_st == 0 [L216] int tmp_ndt_2; [L217] tmp_ndt_2 = __VERIFIER_nondet_int() [L218] COND TRUE \read(tmp_ndt_2) [L220] t1_st = 1 VAL [E_1=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=1] [L72] COND TRUE t1_pc == 0 VAL [E_1=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=1] [L83] COND TRUE 1 VAL [E_1=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=1] [L85] t1_pc = 1 [L86] t1_st = 2 VAL [E_1=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2] [L191] COND TRUE 1 VAL [E_1=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2] [L166] int __retres1 ; VAL [E_1=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2] [L169] COND TRUE m_st == 0 [L170] __retres1 = 1 VAL [E_1=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2] [L182] return (__retres1); VAL [E_1=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2] [L194] tmp = exists_runnable_thread() [L196] COND TRUE \read(tmp) VAL [E_1=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2] [L201] COND TRUE m_st == 0 [L202] int tmp_ndt_1; [L203] tmp_ndt_1 = __VERIFIER_nondet_int() [L204] COND TRUE \read(tmp_ndt_1) [L206] m_st = 1 VAL [E_1=2, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2] [L31] COND TRUE m_pc == 0 VAL [E_1=2, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2] [L42] COND TRUE 1 VAL [E_1=2, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2] [L45] E_1 = 1 [L283] int tmp ; [L284] int tmp___0 ; [L102] int __retres1 ; VAL [E_1=1, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2] [L105] COND FALSE !(m_pc == 1) VAL [E_1=1, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2] [L115] __retres1 = 0 VAL [E_1=1, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2] [L117] return (__retres1); VAL [E_1=1, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2] [L288] tmp = is_master_triggered() [L290] COND FALSE !(\read(tmp)) VAL [E_1=1, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2] [L121] int __retres1 ; VAL [E_1=1, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2] [L124] COND TRUE t1_pc == 1 VAL [E_1=1, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2] [L125] COND TRUE E_1 == 1 [L126] __retres1 = 1 VAL [E_1=1, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2] [L136] return (__retres1); VAL [E_1=1, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2] [L296] tmp___0 = is_transmit1_triggered() [L298] COND TRUE \read(tmp___0) [L299] t1_st = 0 VAL [E_1=1, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=0] [L47] E_1 = 2 VAL [E_1=2, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=0] [L50] COND TRUE 1 VAL [E_1=2, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=0] [L52] m_pc = 1 [L53] m_st = 2 VAL [E_1=2, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=0] [L215] COND TRUE t1_st == 0 [L216] int tmp_ndt_2; [L217] tmp_ndt_2 = __VERIFIER_nondet_int() [L218] COND TRUE \read(tmp_ndt_2) [L220] t1_st = 1 VAL [E_1=2, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1] [L72] COND FALSE !(t1_pc == 0) VAL [E_1=2, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1] [L75] COND TRUE t1_pc == 1 VAL [E_1=2, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1] [L11] __VERIFIER_error() VAL [E_1=2, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 122 locations, 1 error locations. Result: UNSAFE, OverallTime: 2.2s, OverallIterations: 10, TraceHistogramMax: 2, AutomataDifference: 0.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 1554 SDtfs, 1693 SDslu, 1435 SDs, 0 SdLazy, 165 SolverSat, 70 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 31 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=921occurred in iteration=9, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 9 MinimizatonAttempts, 1511 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.3s InterpolantComputationTime, 478 NumberOfCodeBlocks, 478 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 401 ConstructedInterpolants, 0 QuantifiedInterpolants, 28171 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 9 InterpolantComputations, 9 PerfectInterpolantSequences, 33/33 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...