./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/rfi007_rmo.oepc.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_b98348c0-83f9-4d19-80d5-c9975d2d1644/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_b98348c0-83f9-4d19-80d5-c9975d2d1644/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_b98348c0-83f9-4d19-80d5-c9975d2d1644/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_b98348c0-83f9-4d19-80d5-c9975d2d1644/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/pthread-wmm/rfi007_rmo.oepc.i -s /tmp/vcloud-vcloud-master/worker/run_dir_b98348c0-83f9-4d19-80d5-c9975d2d1644/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_b98348c0-83f9-4d19-80d5-c9975d2d1644/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 e1c75c07e8ecf18c400b7c2089e688b990558729 .............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. 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:37:19,286 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-16 00:37:19,287 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-16 00:37:19,297 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-16 00:37:19,298 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-16 00:37:19,299 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-16 00:37:19,300 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-16 00:37:19,302 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-16 00:37:19,304 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-16 00:37:19,304 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-16 00:37:19,305 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-16 00:37:19,306 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-16 00:37:19,307 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-16 00:37:19,308 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-16 00:37:19,308 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-16 00:37:19,309 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-16 00:37:19,310 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-16 00:37:19,311 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-16 00:37:19,312 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-16 00:37:19,314 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-16 00:37:19,315 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-16 00:37:19,316 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-16 00:37:19,317 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-16 00:37:19,318 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-16 00:37:19,320 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-16 00:37:19,320 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-16 00:37:19,321 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-16 00:37:19,321 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-16 00:37:19,322 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-16 00:37:19,323 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-16 00:37:19,323 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-16 00:37:19,323 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-16 00:37:19,324 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-16 00:37:19,325 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-16 00:37:19,325 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-16 00:37:19,326 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-16 00:37:19,326 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-16 00:37:19,326 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-16 00:37:19,327 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-16 00:37:19,327 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-16 00:37:19,328 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-16 00:37:19,329 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_b98348c0-83f9-4d19-80d5-c9975d2d1644/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-11-16 00:37:19,341 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-16 00:37:19,341 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-16 00:37:19,342 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-16 00:37:19,342 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-16 00:37:19,342 INFO L138 SettingsManager]: * Use SBE=true [2019-11-16 00:37:19,343 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-16 00:37:19,343 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-16 00:37:19,343 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-16 00:37:19,343 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-16 00:37:19,343 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-16 00:37:19,344 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-16 00:37:19,344 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-16 00:37:19,344 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-16 00:37:19,344 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-16 00:37:19,344 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-16 00:37:19,345 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-16 00:37:19,345 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-16 00:37:19,345 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-16 00:37:19,345 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-16 00:37:19,346 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-16 00:37:19,346 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-16 00:37:19,346 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-16 00:37:19,346 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-16 00:37:19,346 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-16 00:37:19,347 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-16 00:37:19,347 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-16 00:37:19,347 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-16 00:37:19,347 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-16 00:37:19,347 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_b98348c0-83f9-4d19-80d5-c9975d2d1644/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 -> e1c75c07e8ecf18c400b7c2089e688b990558729 [2019-11-16 00:37:19,372 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-16 00:37:19,386 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-16 00:37:19,388 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-16 00:37:19,390 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-16 00:37:19,390 INFO L275 PluginConnector]: CDTParser initialized [2019-11-16 00:37:19,391 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_b98348c0-83f9-4d19-80d5-c9975d2d1644/bin/uautomizer/../../sv-benchmarks/c/pthread-wmm/rfi007_rmo.oepc.i [2019-11-16 00:37:19,452 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_b98348c0-83f9-4d19-80d5-c9975d2d1644/bin/uautomizer/data/3d1d84a87/9dd43c039705442bb21c0b72b16eafb5/FLAGd685a5a91 [2019-11-16 00:37:19,947 INFO L306 CDTParser]: Found 1 translation units. [2019-11-16 00:37:19,948 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_b98348c0-83f9-4d19-80d5-c9975d2d1644/sv-benchmarks/c/pthread-wmm/rfi007_rmo.oepc.i [2019-11-16 00:37:19,963 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_b98348c0-83f9-4d19-80d5-c9975d2d1644/bin/uautomizer/data/3d1d84a87/9dd43c039705442bb21c0b72b16eafb5/FLAGd685a5a91 [2019-11-16 00:37:20,462 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_b98348c0-83f9-4d19-80d5-c9975d2d1644/bin/uautomizer/data/3d1d84a87/9dd43c039705442bb21c0b72b16eafb5 [2019-11-16 00:37:20,465 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-16 00:37:20,466 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-16 00:37:20,467 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-16 00:37:20,467 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-16 00:37:20,471 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-16 00:37:20,471 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 12:37:20" (1/1) ... [2019-11-16 00:37:20,474 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4c12a99e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:37:20, skipping insertion in model container [2019-11-16 00:37:20,474 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 12:37:20" (1/1) ... [2019-11-16 00:37:20,481 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-16 00:37:20,534 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-16 00:37:20,949 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-16 00:37:20,961 INFO L188 MainTranslator]: Completed pre-run [2019-11-16 00:37:21,024 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-16 00:37:21,089 INFO L192 MainTranslator]: Completed translation [2019-11-16 00:37:21,090 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:37:21 WrapperNode [2019-11-16 00:37:21,090 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-16 00:37:21,090 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-16 00:37:21,091 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-16 00:37:21,091 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-16 00:37:21,097 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:37:21" (1/1) ... [2019-11-16 00:37:21,112 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:37:21" (1/1) ... [2019-11-16 00:37:21,147 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-16 00:37:21,147 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-16 00:37:21,148 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-16 00:37:21,148 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-16 00:37:21,156 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:37:21" (1/1) ... [2019-11-16 00:37:21,157 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:37:21" (1/1) ... [2019-11-16 00:37:21,165 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:37:21" (1/1) ... [2019-11-16 00:37:21,165 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:37:21" (1/1) ... [2019-11-16 00:37:21,192 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:37:21" (1/1) ... [2019-11-16 00:37:21,209 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:37:21" (1/1) ... [2019-11-16 00:37:21,212 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:37:21" (1/1) ... [2019-11-16 00:37:21,216 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-16 00:37:21,217 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-16 00:37:21,217 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-16 00:37:21,217 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-16 00:37:21,218 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:37:21" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_b98348c0-83f9-4d19-80d5-c9975d2d1644/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:37:21,297 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-11-16 00:37:21,297 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-11-16 00:37:21,297 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-16 00:37:21,298 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-16 00:37:21,299 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-11-16 00:37:21,299 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-11-16 00:37:21,299 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-11-16 00:37:21,300 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-11-16 00:37:21,300 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-11-16 00:37:21,300 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-16 00:37:21,302 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-16 00:37:21,304 WARN L202 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-11-16 00:37:21,940 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-16 00:37:21,941 INFO L284 CfgBuilder]: Removed 8 assume(true) statements. [2019-11-16 00:37:21,942 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 12:37:21 BoogieIcfgContainer [2019-11-16 00:37:21,942 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-16 00:37:21,943 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-16 00:37:21,943 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-16 00:37:21,946 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-16 00:37:21,946 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.11 12:37:20" (1/3) ... [2019-11-16 00:37:21,946 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7688228 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 12:37:21, skipping insertion in model container [2019-11-16 00:37:21,947 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:37:21" (2/3) ... [2019-11-16 00:37:21,947 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7688228 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 12:37:21, skipping insertion in model container [2019-11-16 00:37:21,947 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 12:37:21" (3/3) ... [2019-11-16 00:37:21,949 INFO L109 eAbstractionObserver]: Analyzing ICFG rfi007_rmo.oepc.i [2019-11-16 00:37:22,016 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:37:22,016 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:37:22,016 WARN L315 ript$VariableManager]: TermVariabe Thread0_P0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:37:22,016 WARN L315 ript$VariableManager]: TermVariabe Thread0_P0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:37:22,017 WARN L315 ript$VariableManager]: TermVariabe Thread0_P0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:37:22,018 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:37:22,019 WARN L315 ript$VariableManager]: TermVariabe Thread0_P0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:37:22,019 WARN L315 ript$VariableManager]: TermVariabe Thread0_P0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:37:22,019 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:37:22,019 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:37:22,020 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:37:22,020 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:37:22,020 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:37:22,020 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:37:22,021 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:37:22,021 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:37:22,021 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:37:22,021 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:37:22,021 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:37:22,022 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:37:22,022 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:37:22,022 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:37:22,022 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:37:22,022 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:37:22,023 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:37:22,023 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:37:22,023 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:37:22,024 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:37:22,024 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:37:22,024 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:37:22,024 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:37:22,025 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:37:22,025 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:37:22,025 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:37:22,027 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:37:22,027 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:37:22,028 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:37:22,028 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:37:22,028 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:37:22,028 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:37:22,028 WARN L315 ript$VariableManager]: TermVariabe Thread1_P1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:37:22,029 WARN L315 ript$VariableManager]: TermVariabe Thread1_P1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:37:22,030 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:37:22,031 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:37:22,031 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:37:22,032 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:37:22,032 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:37:22,033 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:37:22,033 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:37:22,033 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:37:22,033 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:37:22,034 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:37:22,034 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:37:22,034 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:37:22,034 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:37:22,034 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:37:22,035 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:37:22,036 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:37:22,036 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:37:22,036 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:37:22,037 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:37:22,037 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:37:22,037 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:37:22,037 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:37:22,038 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:37:22,039 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:37:22,039 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:37:22,040 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:37:22,040 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:37:22,041 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:37:22,041 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:37:22,041 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:37:22,042 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:37:22,042 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:37:22,042 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:37:22,042 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:37:22,042 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:37:22,043 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:37:22,043 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:37:22,043 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:37:22,043 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:37:22,044 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:37:22,044 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:37:22,044 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:37:22,044 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:37:22,044 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:37:22,045 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:37:22,045 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:37:22,045 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:37:22,045 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:37:22,046 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:37:22,046 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:37:22,046 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:37:22,047 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:37:22,047 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:37:22,047 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:37:22,047 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:37:22,048 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:37:22,048 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:37:22,048 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:37:22,049 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:37:22,052 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:37:22,053 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:37:22,053 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:37:22,053 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:37:22,053 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:37:22,053 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:37:22,054 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:37:22,055 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:37:22,055 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:37:22,056 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:37:22,056 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:37:22,056 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:37:22,064 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:37:22,064 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:37:22,064 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:37:22,064 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:37:22,064 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:37:22,065 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:37:22,065 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:37:22,065 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:37:22,065 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:37:22,065 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:37:22,065 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:37:22,066 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:37:22,066 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:37:22,066 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:37:22,066 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:37:22,066 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:37:22,066 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:37:22,067 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:37:22,067 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:37:22,067 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:37:22,067 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:37:22,067 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:37:22,067 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:37:22,068 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:37:22,068 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:37:22,068 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:37:22,068 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:37:22,068 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:37:22,068 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:37:22,069 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:37:22,069 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:37:22,069 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:37:22,069 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:37:22,069 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:37:22,070 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:37:22,070 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:37:22,070 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:37:22,070 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:37:22,070 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:37:22,077 WARN L141 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-11-16 00:37:22,077 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-16 00:37:22,089 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 3 error locations. [2019-11-16 00:37:22,100 INFO L249 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2019-11-16 00:37:22,121 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-16 00:37:22,122 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-16 00:37:22,122 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-16 00:37:22,122 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-16 00:37:22,122 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-16 00:37:22,122 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-16 00:37:22,122 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-16 00:37:22,122 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-16 00:37:22,135 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 140 places, 178 transitions [2019-11-16 00:37:24,661 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 32590 states. [2019-11-16 00:37:24,663 INFO L276 IsEmpty]: Start isEmpty. Operand 32590 states. [2019-11-16 00:37:24,670 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-11-16 00:37:24,670 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:37:24,671 INFO L380 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] [2019-11-16 00:37:24,673 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:37:24,676 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:37:24,677 INFO L82 PathProgramCache]: Analyzing trace with hash -1414647361, now seen corresponding path program 1 times [2019-11-16 00:37:24,682 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:37:24,683 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1568982322] [2019-11-16 00:37:24,683 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:37:24,683 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:37:24,683 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:37:24,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:37:24,906 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:37:24,907 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1568982322] [2019-11-16 00:37:24,908 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:37:24,908 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-16 00:37:24,908 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [361081272] [2019-11-16 00:37:24,912 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-16 00:37:24,912 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:37:24,926 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-16 00:37:24,926 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-16 00:37:24,928 INFO L87 Difference]: Start difference. First operand 32590 states. Second operand 4 states. [2019-11-16 00:37:25,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:37:25,821 INFO L93 Difference]: Finished difference Result 33590 states and 129567 transitions. [2019-11-16 00:37:25,822 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-16 00:37:25,823 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 33 [2019-11-16 00:37:25,823 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:37:26,093 INFO L225 Difference]: With dead ends: 33590 [2019-11-16 00:37:26,093 INFO L226 Difference]: Without dead ends: 25702 [2019-11-16 00:37:26,095 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-16 00:37:26,446 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25702 states. [2019-11-16 00:37:27,411 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25702 to 25702. [2019-11-16 00:37:27,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25702 states. [2019-11-16 00:37:27,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25702 states to 25702 states and 99583 transitions. [2019-11-16 00:37:27,715 INFO L78 Accepts]: Start accepts. Automaton has 25702 states and 99583 transitions. Word has length 33 [2019-11-16 00:37:27,716 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:37:27,716 INFO L462 AbstractCegarLoop]: Abstraction has 25702 states and 99583 transitions. [2019-11-16 00:37:27,716 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-16 00:37:27,716 INFO L276 IsEmpty]: Start isEmpty. Operand 25702 states and 99583 transitions. [2019-11-16 00:37:27,729 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-11-16 00:37:27,729 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:37:27,730 INFO L380 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, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:37:27,730 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:37:27,730 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:37:27,731 INFO L82 PathProgramCache]: Analyzing trace with hash 1018218352, now seen corresponding path program 1 times [2019-11-16 00:37:27,731 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:37:27,731 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2067957488] [2019-11-16 00:37:27,731 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:37:27,731 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:37:27,731 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:37:27,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:37:27,850 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:37:27,851 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2067957488] [2019-11-16 00:37:27,851 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:37:27,851 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-16 00:37:27,851 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [834217877] [2019-11-16 00:37:27,852 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-16 00:37:27,853 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:37:27,853 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-16 00:37:27,853 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-16 00:37:27,853 INFO L87 Difference]: Start difference. First operand 25702 states and 99583 transitions. Second operand 5 states. [2019-11-16 00:37:29,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:37:29,025 INFO L93 Difference]: Finished difference Result 41080 states and 150430 transitions. [2019-11-16 00:37:29,026 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-16 00:37:29,026 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 45 [2019-11-16 00:37:29,027 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:37:29,197 INFO L225 Difference]: With dead ends: 41080 [2019-11-16 00:37:29,197 INFO L226 Difference]: Without dead ends: 40544 [2019-11-16 00:37:29,198 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-11-16 00:37:29,471 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40544 states. [2019-11-16 00:37:30,686 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40544 to 38924. [2019-11-16 00:37:30,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38924 states. [2019-11-16 00:37:30,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38924 states to 38924 states and 143580 transitions. [2019-11-16 00:37:30,806 INFO L78 Accepts]: Start accepts. Automaton has 38924 states and 143580 transitions. Word has length 45 [2019-11-16 00:37:30,807 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:37:30,807 INFO L462 AbstractCegarLoop]: Abstraction has 38924 states and 143580 transitions. [2019-11-16 00:37:30,808 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-16 00:37:30,808 INFO L276 IsEmpty]: Start isEmpty. Operand 38924 states and 143580 transitions. [2019-11-16 00:37:30,817 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2019-11-16 00:37:30,817 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:37:30,818 INFO L380 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, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:37:30,818 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:37:30,818 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:37:30,818 INFO L82 PathProgramCache]: Analyzing trace with hash 352520797, now seen corresponding path program 1 times [2019-11-16 00:37:30,819 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:37:30,819 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [574375067] [2019-11-16 00:37:30,819 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:37:30,819 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:37:30,820 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:37:30,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:37:30,904 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:37:30,904 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [574375067] [2019-11-16 00:37:30,905 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:37:30,905 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-16 00:37:30,905 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [35016096] [2019-11-16 00:37:30,905 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-16 00:37:30,906 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:37:30,906 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-16 00:37:30,906 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-16 00:37:30,906 INFO L87 Difference]: Start difference. First operand 38924 states and 143580 transitions. Second operand 5 states. [2019-11-16 00:37:31,524 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:37:31,524 INFO L93 Difference]: Finished difference Result 49777 states and 180632 transitions. [2019-11-16 00:37:31,525 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-16 00:37:31,525 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 46 [2019-11-16 00:37:31,526 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:37:31,743 INFO L225 Difference]: With dead ends: 49777 [2019-11-16 00:37:31,743 INFO L226 Difference]: Without dead ends: 49273 [2019-11-16 00:37:31,744 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-11-16 00:37:32,669 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49273 states. [2019-11-16 00:37:33,379 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49273 to 42676. [2019-11-16 00:37:33,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42676 states. [2019-11-16 00:37:33,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42676 states to 42676 states and 156591 transitions. [2019-11-16 00:37:33,468 INFO L78 Accepts]: Start accepts. Automaton has 42676 states and 156591 transitions. Word has length 46 [2019-11-16 00:37:33,468 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:37:33,468 INFO L462 AbstractCegarLoop]: Abstraction has 42676 states and 156591 transitions. [2019-11-16 00:37:33,469 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-16 00:37:33,469 INFO L276 IsEmpty]: Start isEmpty. Operand 42676 states and 156591 transitions. [2019-11-16 00:37:33,478 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-11-16 00:37:33,478 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:37:33,478 INFO L380 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:37:33,478 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:37:33,479 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:37:33,479 INFO L82 PathProgramCache]: Analyzing trace with hash 441299907, now seen corresponding path program 1 times [2019-11-16 00:37:33,479 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:37:33,479 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1271148033] [2019-11-16 00:37:33,479 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:37:33,480 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:37:33,480 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:37:33,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:37:33,523 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:37:33,523 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1271148033] [2019-11-16 00:37:33,523 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:37:33,523 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-16 00:37:33,523 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1440072484] [2019-11-16 00:37:33,524 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-16 00:37:33,524 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:37:33,524 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-16 00:37:33,524 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-16 00:37:33,524 INFO L87 Difference]: Start difference. First operand 42676 states and 156591 transitions. Second operand 3 states. [2019-11-16 00:37:33,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:37:33,784 INFO L93 Difference]: Finished difference Result 61086 states and 221429 transitions. [2019-11-16 00:37:33,784 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-16 00:37:33,785 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 48 [2019-11-16 00:37:33,785 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:37:34,169 INFO L225 Difference]: With dead ends: 61086 [2019-11-16 00:37:34,169 INFO L226 Difference]: Without dead ends: 61086 [2019-11-16 00:37:34,169 INFO L600 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-16 00:37:35,258 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61086 states. [2019-11-16 00:37:35,855 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61086 to 48015. [2019-11-16 00:37:35,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48015 states. [2019-11-16 00:37:35,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48015 states to 48015 states and 174178 transitions. [2019-11-16 00:37:35,957 INFO L78 Accepts]: Start accepts. Automaton has 48015 states and 174178 transitions. Word has length 48 [2019-11-16 00:37:35,957 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:37:35,957 INFO L462 AbstractCegarLoop]: Abstraction has 48015 states and 174178 transitions. [2019-11-16 00:37:35,957 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-16 00:37:35,957 INFO L276 IsEmpty]: Start isEmpty. Operand 48015 states and 174178 transitions. [2019-11-16 00:37:35,974 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-11-16 00:37:35,974 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:37:35,975 INFO L380 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:37:35,975 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:37:35,975 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:37:35,975 INFO L82 PathProgramCache]: Analyzing trace with hash -2076880242, now seen corresponding path program 1 times [2019-11-16 00:37:35,975 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:37:35,976 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [987676869] [2019-11-16 00:37:35,976 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:37:35,976 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:37:35,976 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:37:35,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:37:36,070 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:37:36,070 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [987676869] [2019-11-16 00:37:36,071 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:37:36,071 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-16 00:37:36,071 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1533715645] [2019-11-16 00:37:36,071 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-16 00:37:36,071 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:37:36,072 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-16 00:37:36,072 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-11-16 00:37:36,072 INFO L87 Difference]: Start difference. First operand 48015 states and 174178 transitions. Second operand 6 states. [2019-11-16 00:37:36,810 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:37:36,810 INFO L93 Difference]: Finished difference Result 61593 states and 219936 transitions. [2019-11-16 00:37:36,810 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-11-16 00:37:36,810 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 52 [2019-11-16 00:37:36,810 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:37:36,929 INFO L225 Difference]: With dead ends: 61593 [2019-11-16 00:37:36,929 INFO L226 Difference]: Without dead ends: 61025 [2019-11-16 00:37:36,929 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=49, Invalid=133, Unknown=0, NotChecked=0, Total=182 [2019-11-16 00:37:37,998 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61025 states. [2019-11-16 00:37:38,533 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61025 to 47875. [2019-11-16 00:37:38,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47875 states. [2019-11-16 00:37:38,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47875 states to 47875 states and 174134 transitions. [2019-11-16 00:37:38,638 INFO L78 Accepts]: Start accepts. Automaton has 47875 states and 174134 transitions. Word has length 52 [2019-11-16 00:37:38,638 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:37:38,638 INFO L462 AbstractCegarLoop]: Abstraction has 47875 states and 174134 transitions. [2019-11-16 00:37:38,638 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-16 00:37:38,638 INFO L276 IsEmpty]: Start isEmpty. Operand 47875 states and 174134 transitions. [2019-11-16 00:37:38,651 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-11-16 00:37:38,651 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:37:38,652 INFO L380 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:37:38,652 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:37:38,652 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:37:38,652 INFO L82 PathProgramCache]: Analyzing trace with hash -995861021, now seen corresponding path program 1 times [2019-11-16 00:37:38,653 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:37:38,653 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [716861350] [2019-11-16 00:37:38,653 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:37:38,653 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:37:38,653 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:37:38,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:37:38,764 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:37:38,765 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [716861350] [2019-11-16 00:37:38,765 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:37:38,765 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-16 00:37:38,765 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1472271630] [2019-11-16 00:37:38,765 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-16 00:37:38,766 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:37:38,766 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-16 00:37:38,766 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-11-16 00:37:38,766 INFO L87 Difference]: Start difference. First operand 47875 states and 174134 transitions. Second operand 6 states. [2019-11-16 00:37:39,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:37:39,673 INFO L93 Difference]: Finished difference Result 64221 states and 231062 transitions. [2019-11-16 00:37:39,673 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-16 00:37:39,673 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 52 [2019-11-16 00:37:39,673 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:37:39,806 INFO L225 Difference]: With dead ends: 64221 [2019-11-16 00:37:39,806 INFO L226 Difference]: Without dead ends: 64221 [2019-11-16 00:37:39,806 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-11-16 00:37:40,059 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64221 states. [2019-11-16 00:37:43,818 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64221 to 60245. [2019-11-16 00:37:43,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60245 states. [2019-11-16 00:37:43,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60245 states to 60245 states and 216821 transitions. [2019-11-16 00:37:43,959 INFO L78 Accepts]: Start accepts. Automaton has 60245 states and 216821 transitions. Word has length 52 [2019-11-16 00:37:43,959 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:37:43,960 INFO L462 AbstractCegarLoop]: Abstraction has 60245 states and 216821 transitions. [2019-11-16 00:37:43,960 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-16 00:37:43,960 INFO L276 IsEmpty]: Start isEmpty. Operand 60245 states and 216821 transitions. [2019-11-16 00:37:43,974 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-11-16 00:37:43,974 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:37:43,975 INFO L380 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:37:43,975 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:37:43,975 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:37:43,975 INFO L82 PathProgramCache]: Analyzing trace with hash 1502154916, now seen corresponding path program 1 times [2019-11-16 00:37:43,975 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:37:43,975 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [603374977] [2019-11-16 00:37:43,975 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:37:43,976 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:37:43,976 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:37:43,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:37:44,072 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:37:44,072 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [603374977] [2019-11-16 00:37:44,072 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:37:44,072 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-16 00:37:44,072 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [626237385] [2019-11-16 00:37:44,073 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-16 00:37:44,073 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:37:44,073 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-16 00:37:44,073 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-16 00:37:44,073 INFO L87 Difference]: Start difference. First operand 60245 states and 216821 transitions. Second operand 4 states. [2019-11-16 00:37:44,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:37:44,151 INFO L93 Difference]: Finished difference Result 12808 states and 39725 transitions. [2019-11-16 00:37:44,151 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-16 00:37:44,152 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 52 [2019-11-16 00:37:44,152 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:37:44,171 INFO L225 Difference]: With dead ends: 12808 [2019-11-16 00:37:44,171 INFO L226 Difference]: Without dead ends: 11096 [2019-11-16 00:37:44,172 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:37:44,200 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11096 states. [2019-11-16 00:37:44,315 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11096 to 11047. [2019-11-16 00:37:44,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11047 states. [2019-11-16 00:37:44,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11047 states to 11047 states and 33784 transitions. [2019-11-16 00:37:44,336 INFO L78 Accepts]: Start accepts. Automaton has 11047 states and 33784 transitions. Word has length 52 [2019-11-16 00:37:44,336 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:37:44,336 INFO L462 AbstractCegarLoop]: Abstraction has 11047 states and 33784 transitions. [2019-11-16 00:37:44,336 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-16 00:37:44,337 INFO L276 IsEmpty]: Start isEmpty. Operand 11047 states and 33784 transitions. [2019-11-16 00:37:44,340 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-11-16 00:37:44,340 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:37:44,340 INFO L380 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, 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:37:44,340 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:37:44,340 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:37:44,341 INFO L82 PathProgramCache]: Analyzing trace with hash -1137223062, now seen corresponding path program 1 times [2019-11-16 00:37:44,341 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:37:44,341 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1833082322] [2019-11-16 00:37:44,341 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:37:44,341 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:37:44,341 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:37:44,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:37:44,411 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:37:44,412 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1833082322] [2019-11-16 00:37:44,412 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:37:44,412 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-16 00:37:44,412 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1028099340] [2019-11-16 00:37:44,413 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-16 00:37:44,413 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:37:44,413 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-16 00:37:44,413 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-16 00:37:44,414 INFO L87 Difference]: Start difference. First operand 11047 states and 33784 transitions. Second operand 4 states. [2019-11-16 00:37:44,583 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:37:44,584 INFO L93 Difference]: Finished difference Result 12861 states and 39390 transitions. [2019-11-16 00:37:44,584 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-16 00:37:44,584 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 60 [2019-11-16 00:37:44,584 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:37:44,609 INFO L225 Difference]: With dead ends: 12861 [2019-11-16 00:37:44,609 INFO L226 Difference]: Without dead ends: 12861 [2019-11-16 00:37:44,610 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-16 00:37:44,643 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12861 states. [2019-11-16 00:37:44,800 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12861 to 11692. [2019-11-16 00:37:44,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11692 states. [2019-11-16 00:37:44,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11692 states to 11692 states and 35761 transitions. [2019-11-16 00:37:44,831 INFO L78 Accepts]: Start accepts. Automaton has 11692 states and 35761 transitions. Word has length 60 [2019-11-16 00:37:44,832 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:37:44,832 INFO L462 AbstractCegarLoop]: Abstraction has 11692 states and 35761 transitions. [2019-11-16 00:37:44,832 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-16 00:37:44,832 INFO L276 IsEmpty]: Start isEmpty. Operand 11692 states and 35761 transitions. [2019-11-16 00:37:44,837 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-11-16 00:37:44,837 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:37:44,837 INFO L380 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, 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:37:44,837 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:37:44,838 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:37:44,838 INFO L82 PathProgramCache]: Analyzing trace with hash 605587273, now seen corresponding path program 1 times [2019-11-16 00:37:44,838 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:37:44,838 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1834068974] [2019-11-16 00:37:44,839 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:37:44,839 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:37:44,839 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:37:44,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:37:44,950 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:37:44,951 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1834068974] [2019-11-16 00:37:44,951 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:37:44,952 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-16 00:37:44,952 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [836219536] [2019-11-16 00:37:44,952 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-16 00:37:44,952 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:37:44,953 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-16 00:37:44,953 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-11-16 00:37:44,954 INFO L87 Difference]: Start difference. First operand 11692 states and 35761 transitions. Second operand 6 states. [2019-11-16 00:37:45,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:37:45,336 INFO L93 Difference]: Finished difference Result 14218 states and 42859 transitions. [2019-11-16 00:37:45,337 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-11-16 00:37:45,337 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 60 [2019-11-16 00:37:45,337 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:37:45,356 INFO L225 Difference]: With dead ends: 14218 [2019-11-16 00:37:45,356 INFO L226 Difference]: Without dead ends: 14157 [2019-11-16 00:37:45,357 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2019-11-16 00:37:45,381 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14157 states. [2019-11-16 00:37:45,513 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14157 to 13460. [2019-11-16 00:37:45,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13460 states. [2019-11-16 00:37:45,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13460 states to 13460 states and 40778 transitions. [2019-11-16 00:37:45,537 INFO L78 Accepts]: Start accepts. Automaton has 13460 states and 40778 transitions. Word has length 60 [2019-11-16 00:37:45,537 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:37:45,538 INFO L462 AbstractCegarLoop]: Abstraction has 13460 states and 40778 transitions. [2019-11-16 00:37:45,538 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-16 00:37:45,538 INFO L276 IsEmpty]: Start isEmpty. Operand 13460 states and 40778 transitions. [2019-11-16 00:37:45,543 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-11-16 00:37:45,543 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:37:45,544 INFO L380 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, 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:37:45,544 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:37:45,544 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:37:45,544 INFO L82 PathProgramCache]: Analyzing trace with hash -386360045, now seen corresponding path program 1 times [2019-11-16 00:37:45,544 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:37:45,545 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [876503723] [2019-11-16 00:37:45,545 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:37:45,545 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:37:45,545 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:37:45,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:37:45,622 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:37:45,622 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [876503723] [2019-11-16 00:37:45,623 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:37:45,623 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-16 00:37:45,623 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1579619133] [2019-11-16 00:37:45,623 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-16 00:37:45,623 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:37:45,623 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-16 00:37:45,624 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-16 00:37:45,624 INFO L87 Difference]: Start difference. First operand 13460 states and 40778 transitions. Second operand 4 states. [2019-11-16 00:37:45,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:37:45,924 INFO L93 Difference]: Finished difference Result 16502 states and 49370 transitions. [2019-11-16 00:37:45,924 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-16 00:37:45,924 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 64 [2019-11-16 00:37:45,924 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:37:45,944 INFO L225 Difference]: With dead ends: 16502 [2019-11-16 00:37:45,944 INFO L226 Difference]: Without dead ends: 16502 [2019-11-16 00:37:45,944 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-16 00:37:45,968 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16502 states. [2019-11-16 00:37:46,096 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16502 to 14981. [2019-11-16 00:37:46,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14981 states. [2019-11-16 00:37:46,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14981 states to 14981 states and 44959 transitions. [2019-11-16 00:37:46,119 INFO L78 Accepts]: Start accepts. Automaton has 14981 states and 44959 transitions. Word has length 64 [2019-11-16 00:37:46,119 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:37:46,119 INFO L462 AbstractCegarLoop]: Abstraction has 14981 states and 44959 transitions. [2019-11-16 00:37:46,119 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-16 00:37:46,119 INFO L276 IsEmpty]: Start isEmpty. Operand 14981 states and 44959 transitions. [2019-11-16 00:37:46,125 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-11-16 00:37:46,125 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:37:46,125 INFO L380 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, 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:37:46,125 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:37:46,126 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:37:46,126 INFO L82 PathProgramCache]: Analyzing trace with hash 1831397908, now seen corresponding path program 1 times [2019-11-16 00:37:46,126 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:37:46,126 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1844724054] [2019-11-16 00:37:46,126 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:37:46,126 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:37:46,126 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:37:46,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:37:46,170 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:37:46,170 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1844724054] [2019-11-16 00:37:46,171 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:37:46,171 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-16 00:37:46,171 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1114704968] [2019-11-16 00:37:46,171 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-16 00:37:46,171 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:37:46,171 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-16 00:37:46,172 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-16 00:37:46,172 INFO L87 Difference]: Start difference. First operand 14981 states and 44959 transitions. Second operand 3 states. [2019-11-16 00:37:46,906 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:37:46,906 INFO L93 Difference]: Finished difference Result 15529 states and 46402 transitions. [2019-11-16 00:37:46,907 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-16 00:37:46,907 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 64 [2019-11-16 00:37:46,907 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:37:46,926 INFO L225 Difference]: With dead ends: 15529 [2019-11-16 00:37:46,926 INFO L226 Difference]: Without dead ends: 15529 [2019-11-16 00:37:46,927 INFO L600 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-16 00:37:46,950 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15529 states. [2019-11-16 00:37:47,122 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15529 to 15275. [2019-11-16 00:37:47,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15275 states. [2019-11-16 00:37:47,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15275 states to 15275 states and 45727 transitions. [2019-11-16 00:37:47,158 INFO L78 Accepts]: Start accepts. Automaton has 15275 states and 45727 transitions. Word has length 64 [2019-11-16 00:37:47,158 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:37:47,158 INFO L462 AbstractCegarLoop]: Abstraction has 15275 states and 45727 transitions. [2019-11-16 00:37:47,158 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-16 00:37:47,159 INFO L276 IsEmpty]: Start isEmpty. Operand 15275 states and 45727 transitions. [2019-11-16 00:37:47,168 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-11-16 00:37:47,168 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:37:47,168 INFO L380 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, 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-16 00:37:47,168 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:37:47,169 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:37:47,169 INFO L82 PathProgramCache]: Analyzing trace with hash -55827014, now seen corresponding path program 1 times [2019-11-16 00:37:47,169 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:37:47,169 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1142975123] [2019-11-16 00:37:47,169 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:37:47,169 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:37:47,170 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:37:47,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:37:47,208 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:37:47,209 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1142975123] [2019-11-16 00:37:47,209 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:37:47,209 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-16 00:37:47,209 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [397225400] [2019-11-16 00:37:47,210 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-16 00:37:47,210 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:37:47,210 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-16 00:37:47,210 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-16 00:37:47,211 INFO L87 Difference]: Start difference. First operand 15275 states and 45727 transitions. Second operand 3 states. [2019-11-16 00:37:47,309 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:37:47,309 INFO L93 Difference]: Finished difference Result 19973 states and 59414 transitions. [2019-11-16 00:37:47,310 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-16 00:37:47,310 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 66 [2019-11-16 00:37:47,310 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:37:47,344 INFO L225 Difference]: With dead ends: 19973 [2019-11-16 00:37:47,344 INFO L226 Difference]: Without dead ends: 19973 [2019-11-16 00:37:47,344 INFO L600 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-16 00:37:47,386 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19973 states. [2019-11-16 00:37:47,542 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19973 to 15169. [2019-11-16 00:37:47,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15169 states. [2019-11-16 00:37:47,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15169 states to 15169 states and 44681 transitions. [2019-11-16 00:37:47,567 INFO L78 Accepts]: Start accepts. Automaton has 15169 states and 44681 transitions. Word has length 66 [2019-11-16 00:37:47,567 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:37:47,567 INFO L462 AbstractCegarLoop]: Abstraction has 15169 states and 44681 transitions. [2019-11-16 00:37:47,567 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-16 00:37:47,567 INFO L276 IsEmpty]: Start isEmpty. Operand 15169 states and 44681 transitions. [2019-11-16 00:37:47,574 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-11-16 00:37:47,574 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:37:47,574 INFO L380 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, 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-16 00:37:47,574 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:37:47,574 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:37:47,575 INFO L82 PathProgramCache]: Analyzing trace with hash 1183419736, now seen corresponding path program 1 times [2019-11-16 00:37:47,575 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:37:47,575 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2080343810] [2019-11-16 00:37:47,575 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:37:47,575 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:37:47,575 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:37:47,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:37:47,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:37:47,672 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2080343810] [2019-11-16 00:37:47,672 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:37:47,672 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-16 00:37:47,672 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [835221052] [2019-11-16 00:37:47,673 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-16 00:37:47,673 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:37:47,673 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-16 00:37:47,673 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-11-16 00:37:47,674 INFO L87 Difference]: Start difference. First operand 15169 states and 44681 transitions. Second operand 6 states. [2019-11-16 00:37:48,220 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:37:48,220 INFO L93 Difference]: Finished difference Result 16152 states and 46959 transitions. [2019-11-16 00:37:48,221 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-16 00:37:48,221 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 66 [2019-11-16 00:37:48,221 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:37:48,241 INFO L225 Difference]: With dead ends: 16152 [2019-11-16 00:37:48,241 INFO L226 Difference]: Without dead ends: 16152 [2019-11-16 00:37:48,241 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-11-16 00:37:48,265 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16152 states. [2019-11-16 00:37:48,393 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16152 to 15734. [2019-11-16 00:37:48,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15734 states. [2019-11-16 00:37:48,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15734 states to 15734 states and 45914 transitions. [2019-11-16 00:37:48,416 INFO L78 Accepts]: Start accepts. Automaton has 15734 states and 45914 transitions. Word has length 66 [2019-11-16 00:37:48,416 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:37:48,417 INFO L462 AbstractCegarLoop]: Abstraction has 15734 states and 45914 transitions. [2019-11-16 00:37:48,417 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-16 00:37:48,417 INFO L276 IsEmpty]: Start isEmpty. Operand 15734 states and 45914 transitions. [2019-11-16 00:37:48,424 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-11-16 00:37:48,424 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:37:48,424 INFO L380 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, 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-16 00:37:48,425 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:37:48,425 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:37:48,425 INFO L82 PathProgramCache]: Analyzing trace with hash -893789607, now seen corresponding path program 1 times [2019-11-16 00:37:48,425 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:37:48,425 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1097010992] [2019-11-16 00:37:48,426 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:37:48,426 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:37:48,426 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:37:48,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:37:48,509 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:37:48,510 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1097010992] [2019-11-16 00:37:48,510 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:37:48,510 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-16 00:37:48,510 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [488539502] [2019-11-16 00:37:48,511 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-16 00:37:48,511 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:37:48,511 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-16 00:37:48,511 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-16 00:37:48,511 INFO L87 Difference]: Start difference. First operand 15734 states and 45914 transitions. Second operand 6 states. [2019-11-16 00:37:48,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:37:48,938 INFO L93 Difference]: Finished difference Result 18009 states and 51105 transitions. [2019-11-16 00:37:48,939 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-16 00:37:48,939 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 66 [2019-11-16 00:37:48,939 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:37:48,959 INFO L225 Difference]: With dead ends: 18009 [2019-11-16 00:37:48,959 INFO L226 Difference]: Without dead ends: 18009 [2019-11-16 00:37:48,959 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2019-11-16 00:37:48,985 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18009 states. [2019-11-16 00:37:49,120 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18009 to 16463. [2019-11-16 00:37:49,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16463 states. [2019-11-16 00:37:49,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16463 states to 16463 states and 47196 transitions. [2019-11-16 00:37:49,144 INFO L78 Accepts]: Start accepts. Automaton has 16463 states and 47196 transitions. Word has length 66 [2019-11-16 00:37:49,144 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:37:49,144 INFO L462 AbstractCegarLoop]: Abstraction has 16463 states and 47196 transitions. [2019-11-16 00:37:49,145 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-16 00:37:49,145 INFO L276 IsEmpty]: Start isEmpty. Operand 16463 states and 47196 transitions. [2019-11-16 00:37:49,154 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-11-16 00:37:49,154 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:37:49,154 INFO L380 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, 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-16 00:37:49,154 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:37:49,154 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:37:49,155 INFO L82 PathProgramCache]: Analyzing trace with hash -682438694, now seen corresponding path program 1 times [2019-11-16 00:37:49,155 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:37:49,155 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1292152705] [2019-11-16 00:37:49,155 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:37:49,155 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:37:49,155 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:37:49,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:37:49,226 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:37:49,226 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1292152705] [2019-11-16 00:37:49,226 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:37:49,226 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-16 00:37:49,226 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [574025146] [2019-11-16 00:37:49,227 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-16 00:37:49,227 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:37:49,227 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-16 00:37:49,227 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-16 00:37:49,227 INFO L87 Difference]: Start difference. First operand 16463 states and 47196 transitions. Second operand 5 states. [2019-11-16 00:37:49,568 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:37:49,568 INFO L93 Difference]: Finished difference Result 21377 states and 61186 transitions. [2019-11-16 00:37:49,569 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-16 00:37:49,569 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 66 [2019-11-16 00:37:49,569 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:37:49,593 INFO L225 Difference]: With dead ends: 21377 [2019-11-16 00:37:49,593 INFO L226 Difference]: Without dead ends: 21377 [2019-11-16 00:37:49,593 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-11-16 00:37:49,623 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21377 states. [2019-11-16 00:37:49,787 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21377 to 19442. [2019-11-16 00:37:49,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19442 states. [2019-11-16 00:37:49,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19442 states to 19442 states and 55401 transitions. [2019-11-16 00:37:49,816 INFO L78 Accepts]: Start accepts. Automaton has 19442 states and 55401 transitions. Word has length 66 [2019-11-16 00:37:49,816 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:37:49,816 INFO L462 AbstractCegarLoop]: Abstraction has 19442 states and 55401 transitions. [2019-11-16 00:37:49,816 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-16 00:37:49,816 INFO L276 IsEmpty]: Start isEmpty. Operand 19442 states and 55401 transitions. [2019-11-16 00:37:49,825 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-11-16 00:37:49,826 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:37:49,826 INFO L380 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, 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-16 00:37:49,826 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:37:49,826 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:37:49,827 INFO L82 PathProgramCache]: Analyzing trace with hash -1192972871, now seen corresponding path program 1 times [2019-11-16 00:37:49,827 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:37:49,827 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1711281437] [2019-11-16 00:37:49,827 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:37:49,827 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:37:49,828 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:37:49,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:37:49,887 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:37:49,887 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1711281437] [2019-11-16 00:37:49,887 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:37:49,887 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-16 00:37:49,887 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1031200439] [2019-11-16 00:37:49,888 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-16 00:37:49,888 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:37:49,888 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-16 00:37:49,888 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-16 00:37:49,888 INFO L87 Difference]: Start difference. First operand 19442 states and 55401 transitions. Second operand 5 states. [2019-11-16 00:37:50,348 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:37:50,349 INFO L93 Difference]: Finished difference Result 25955 states and 73603 transitions. [2019-11-16 00:37:50,349 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-16 00:37:50,349 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 66 [2019-11-16 00:37:50,349 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:37:50,380 INFO L225 Difference]: With dead ends: 25955 [2019-11-16 00:37:50,380 INFO L226 Difference]: Without dead ends: 25955 [2019-11-16 00:37:50,381 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-11-16 00:37:50,415 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25955 states. [2019-11-16 00:37:50,629 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25955 to 21135. [2019-11-16 00:37:50,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21135 states. [2019-11-16 00:37:50,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21135 states to 21135 states and 60029 transitions. [2019-11-16 00:37:50,670 INFO L78 Accepts]: Start accepts. Automaton has 21135 states and 60029 transitions. Word has length 66 [2019-11-16 00:37:50,670 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:37:50,670 INFO L462 AbstractCegarLoop]: Abstraction has 21135 states and 60029 transitions. [2019-11-16 00:37:50,670 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-16 00:37:50,670 INFO L276 IsEmpty]: Start isEmpty. Operand 21135 states and 60029 transitions. [2019-11-16 00:37:50,678 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-11-16 00:37:50,679 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:37:50,679 INFO L380 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, 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-16 00:37:50,679 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:37:50,679 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:37:50,680 INFO L82 PathProgramCache]: Analyzing trace with hash 1294539962, now seen corresponding path program 1 times [2019-11-16 00:37:50,680 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:37:50,680 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1636592861] [2019-11-16 00:37:50,680 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:37:50,680 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:37:50,681 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:37:50,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:37:50,740 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:37:50,740 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1636592861] [2019-11-16 00:37:50,740 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:37:50,740 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-16 00:37:50,741 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [786424320] [2019-11-16 00:37:50,741 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-16 00:37:50,741 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:37:50,741 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-16 00:37:50,742 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-16 00:37:50,742 INFO L87 Difference]: Start difference. First operand 21135 states and 60029 transitions. Second operand 4 states. [2019-11-16 00:37:51,298 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:37:51,298 INFO L93 Difference]: Finished difference Result 27651 states and 79004 transitions. [2019-11-16 00:37:51,298 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-16 00:37:51,299 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 66 [2019-11-16 00:37:51,299 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:37:51,332 INFO L225 Difference]: With dead ends: 27651 [2019-11-16 00:37:51,333 INFO L226 Difference]: Without dead ends: 27516 [2019-11-16 00:37:51,333 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-16 00:37:51,370 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27516 states. [2019-11-16 00:37:51,931 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27516 to 25527. [2019-11-16 00:37:51,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25527 states. [2019-11-16 00:37:51,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25527 states to 25527 states and 72941 transitions. [2019-11-16 00:37:51,970 INFO L78 Accepts]: Start accepts. Automaton has 25527 states and 72941 transitions. Word has length 66 [2019-11-16 00:37:51,971 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:37:51,971 INFO L462 AbstractCegarLoop]: Abstraction has 25527 states and 72941 transitions. [2019-11-16 00:37:51,971 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-16 00:37:51,971 INFO L276 IsEmpty]: Start isEmpty. Operand 25527 states and 72941 transitions. [2019-11-16 00:37:51,977 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-11-16 00:37:51,977 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:37:51,977 INFO L380 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, 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-16 00:37:51,978 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:37:51,978 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:37:51,978 INFO L82 PathProgramCache]: Analyzing trace with hash -502411397, now seen corresponding path program 1 times [2019-11-16 00:37:51,978 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:37:51,978 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [981983405] [2019-11-16 00:37:51,978 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:37:51,978 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:37:51,978 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:37:51,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:37:52,049 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:37:52,050 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [981983405] [2019-11-16 00:37:52,050 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:37:52,050 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-16 00:37:52,050 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1730721129] [2019-11-16 00:37:52,050 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-16 00:37:52,051 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:37:52,051 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-16 00:37:52,051 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-11-16 00:37:52,051 INFO L87 Difference]: Start difference. First operand 25527 states and 72941 transitions. Second operand 5 states. [2019-11-16 00:37:52,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:37:52,103 INFO L93 Difference]: Finished difference Result 7275 states and 16793 transitions. [2019-11-16 00:37:52,103 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-16 00:37:52,103 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 66 [2019-11-16 00:37:52,103 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:37:52,110 INFO L225 Difference]: With dead ends: 7275 [2019-11-16 00:37:52,110 INFO L226 Difference]: Without dead ends: 6105 [2019-11-16 00:37:52,110 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-11-16 00:37:52,120 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6105 states. [2019-11-16 00:37:52,174 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6105 to 5195. [2019-11-16 00:37:52,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5195 states. [2019-11-16 00:37:52,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5195 states to 5195 states and 11682 transitions. [2019-11-16 00:37:52,182 INFO L78 Accepts]: Start accepts. Automaton has 5195 states and 11682 transitions. Word has length 66 [2019-11-16 00:37:52,183 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:37:52,183 INFO L462 AbstractCegarLoop]: Abstraction has 5195 states and 11682 transitions. [2019-11-16 00:37:52,183 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-16 00:37:52,183 INFO L276 IsEmpty]: Start isEmpty. Operand 5195 states and 11682 transitions. [2019-11-16 00:37:52,187 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-11-16 00:37:52,188 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:37:52,188 INFO L380 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, 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-16 00:37:52,188 INFO L410 AbstractCegarLoop]: === Iteration 19 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:37:52,188 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:37:52,189 INFO L82 PathProgramCache]: Analyzing trace with hash -1221361139, now seen corresponding path program 1 times [2019-11-16 00:37:52,189 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:37:52,189 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1445459485] [2019-11-16 00:37:52,189 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:37:52,189 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:37:52,189 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:37:52,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:37:52,279 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:37:52,279 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1445459485] [2019-11-16 00:37:52,279 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:37:52,280 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-16 00:37:52,280 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1789833584] [2019-11-16 00:37:52,281 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-16 00:37:52,281 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:37:52,281 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-16 00:37:52,282 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-16 00:37:52,282 INFO L87 Difference]: Start difference. First operand 5195 states and 11682 transitions. Second operand 5 states. [2019-11-16 00:37:52,448 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:37:52,448 INFO L93 Difference]: Finished difference Result 6272 states and 14147 transitions. [2019-11-16 00:37:52,448 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-16 00:37:52,448 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 72 [2019-11-16 00:37:52,449 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:37:52,453 INFO L225 Difference]: With dead ends: 6272 [2019-11-16 00:37:52,454 INFO L226 Difference]: Without dead ends: 6272 [2019-11-16 00:37:52,454 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-11-16 00:37:52,461 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6272 states. [2019-11-16 00:37:52,501 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6272 to 5615. [2019-11-16 00:37:52,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5615 states. [2019-11-16 00:37:52,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5615 states to 5615 states and 12640 transitions. [2019-11-16 00:37:52,508 INFO L78 Accepts]: Start accepts. Automaton has 5615 states and 12640 transitions. Word has length 72 [2019-11-16 00:37:52,508 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:37:52,508 INFO L462 AbstractCegarLoop]: Abstraction has 5615 states and 12640 transitions. [2019-11-16 00:37:52,509 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-16 00:37:52,509 INFO L276 IsEmpty]: Start isEmpty. Operand 5615 states and 12640 transitions. [2019-11-16 00:37:52,512 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-11-16 00:37:52,512 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:37:52,513 INFO L380 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, 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-16 00:37:52,513 INFO L410 AbstractCegarLoop]: === Iteration 20 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:37:52,513 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:37:52,513 INFO L82 PathProgramCache]: Analyzing trace with hash 521449196, now seen corresponding path program 1 times [2019-11-16 00:37:52,513 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:37:52,513 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1319544701] [2019-11-16 00:37:52,513 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:37:52,514 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:37:52,514 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:37:52,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:37:52,588 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:37:52,588 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1319544701] [2019-11-16 00:37:52,589 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:37:52,589 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-16 00:37:52,589 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1310111123] [2019-11-16 00:37:52,589 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-16 00:37:52,590 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:37:52,590 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-16 00:37:52,590 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-11-16 00:37:52,590 INFO L87 Difference]: Start difference. First operand 5615 states and 12640 transitions. Second operand 7 states. [2019-11-16 00:37:53,071 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:37:53,071 INFO L93 Difference]: Finished difference Result 6482 states and 14450 transitions. [2019-11-16 00:37:53,072 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-11-16 00:37:53,072 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 72 [2019-11-16 00:37:53,072 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:37:53,079 INFO L225 Difference]: With dead ends: 6482 [2019-11-16 00:37:53,079 INFO L226 Difference]: Without dead ends: 6429 [2019-11-16 00:37:53,080 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=61, Invalid=211, Unknown=0, NotChecked=0, Total=272 [2019-11-16 00:37:53,090 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6429 states. [2019-11-16 00:37:53,143 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6429 to 5702. [2019-11-16 00:37:53,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5702 states. [2019-11-16 00:37:53,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5702 states to 5702 states and 12729 transitions. [2019-11-16 00:37:53,152 INFO L78 Accepts]: Start accepts. Automaton has 5702 states and 12729 transitions. Word has length 72 [2019-11-16 00:37:53,153 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:37:53,153 INFO L462 AbstractCegarLoop]: Abstraction has 5702 states and 12729 transitions. [2019-11-16 00:37:53,153 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-16 00:37:53,153 INFO L276 IsEmpty]: Start isEmpty. Operand 5702 states and 12729 transitions. [2019-11-16 00:37:53,159 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2019-11-16 00:37:53,159 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:37:53,159 INFO L380 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, 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, 1, 1, 1] [2019-11-16 00:37:53,159 INFO L410 AbstractCegarLoop]: === Iteration 21 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:37:53,160 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:37:53,160 INFO L82 PathProgramCache]: Analyzing trace with hash 1052720416, now seen corresponding path program 1 times [2019-11-16 00:37:53,160 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:37:53,160 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2144503847] [2019-11-16 00:37:53,160 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:37:53,160 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:37:53,161 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:37:53,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:37:53,198 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:37:53,198 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2144503847] [2019-11-16 00:37:53,198 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:37:53,199 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-16 00:37:53,199 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1712153943] [2019-11-16 00:37:53,200 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-16 00:37:53,200 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:37:53,200 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-16 00:37:53,204 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-16 00:37:53,204 INFO L87 Difference]: Start difference. First operand 5702 states and 12729 transitions. Second operand 3 states. [2019-11-16 00:37:53,379 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:37:53,379 INFO L93 Difference]: Finished difference Result 7168 states and 15786 transitions. [2019-11-16 00:37:53,379 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-16 00:37:53,379 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 91 [2019-11-16 00:37:53,379 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:37:53,385 INFO L225 Difference]: With dead ends: 7168 [2019-11-16 00:37:53,385 INFO L226 Difference]: Without dead ends: 7168 [2019-11-16 00:37:53,385 INFO L600 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-16 00:37:53,394 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7168 states. [2019-11-16 00:37:53,450 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7168 to 6671. [2019-11-16 00:37:53,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6671 states. [2019-11-16 00:37:53,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6671 states to 6671 states and 14733 transitions. [2019-11-16 00:37:53,458 INFO L78 Accepts]: Start accepts. Automaton has 6671 states and 14733 transitions. Word has length 91 [2019-11-16 00:37:53,458 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:37:53,458 INFO L462 AbstractCegarLoop]: Abstraction has 6671 states and 14733 transitions. [2019-11-16 00:37:53,458 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-16 00:37:53,458 INFO L276 IsEmpty]: Start isEmpty. Operand 6671 states and 14733 transitions. [2019-11-16 00:37:53,463 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2019-11-16 00:37:53,463 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:37:53,463 INFO L380 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, 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, 1, 1, 1] [2019-11-16 00:37:53,464 INFO L410 AbstractCegarLoop]: === Iteration 22 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:37:53,464 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:37:53,464 INFO L82 PathProgramCache]: Analyzing trace with hash -1530140064, now seen corresponding path program 2 times [2019-11-16 00:37:53,464 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:37:53,465 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1465886881] [2019-11-16 00:37:53,465 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:37:53,465 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:37:53,465 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:37:53,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:37:53,522 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:37:53,522 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1465886881] [2019-11-16 00:37:53,522 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:37:53,523 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-16 00:37:53,523 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [240046133] [2019-11-16 00:37:53,523 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-16 00:37:53,523 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:37:53,524 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-16 00:37:53,524 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-16 00:37:53,524 INFO L87 Difference]: Start difference. First operand 6671 states and 14733 transitions. Second operand 4 states. [2019-11-16 00:37:53,602 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:37:53,602 INFO L93 Difference]: Finished difference Result 7148 states and 15815 transitions. [2019-11-16 00:37:53,602 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-16 00:37:53,602 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 91 [2019-11-16 00:37:53,602 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:37:53,608 INFO L225 Difference]: With dead ends: 7148 [2019-11-16 00:37:53,608 INFO L226 Difference]: Without dead ends: 7148 [2019-11-16 00:37:53,608 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 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:37:53,615 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7148 states. [2019-11-16 00:37:53,658 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7148 to 6569. [2019-11-16 00:37:53,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6569 states. [2019-11-16 00:37:53,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6569 states to 6569 states and 14589 transitions. [2019-11-16 00:37:53,665 INFO L78 Accepts]: Start accepts. Automaton has 6569 states and 14589 transitions. Word has length 91 [2019-11-16 00:37:53,665 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:37:53,665 INFO L462 AbstractCegarLoop]: Abstraction has 6569 states and 14589 transitions. [2019-11-16 00:37:53,665 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-16 00:37:53,665 INFO L276 IsEmpty]: Start isEmpty. Operand 6569 states and 14589 transitions. [2019-11-16 00:37:53,675 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-11-16 00:37:53,675 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:37:53,675 INFO L380 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, 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, 1, 1, 1, 1, 1] [2019-11-16 00:37:53,675 INFO L410 AbstractCegarLoop]: === Iteration 23 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:37:53,676 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:37:53,676 INFO L82 PathProgramCache]: Analyzing trace with hash -536967306, now seen corresponding path program 1 times [2019-11-16 00:37:53,676 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:37:53,676 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [117252861] [2019-11-16 00:37:53,676 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:37:53,677 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:37:53,677 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:37:53,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:37:53,771 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:37:53,771 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [117252861] [2019-11-16 00:37:53,771 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:37:53,771 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-16 00:37:53,771 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [255507589] [2019-11-16 00:37:53,774 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-16 00:37:53,774 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:37:53,774 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-16 00:37:53,775 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-16 00:37:53,775 INFO L87 Difference]: Start difference. First operand 6569 states and 14589 transitions. Second operand 5 states. [2019-11-16 00:37:54,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:37:54,033 INFO L93 Difference]: Finished difference Result 7502 states and 16583 transitions. [2019-11-16 00:37:54,033 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-16 00:37:54,033 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 93 [2019-11-16 00:37:54,033 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:37:54,039 INFO L225 Difference]: With dead ends: 7502 [2019-11-16 00:37:54,039 INFO L226 Difference]: Without dead ends: 7502 [2019-11-16 00:37:54,039 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-11-16 00:37:54,047 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7502 states. [2019-11-16 00:37:54,091 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7502 to 6609. [2019-11-16 00:37:54,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6609 states. [2019-11-16 00:37:54,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6609 states to 6609 states and 14672 transitions. [2019-11-16 00:37:54,098 INFO L78 Accepts]: Start accepts. Automaton has 6609 states and 14672 transitions. Word has length 93 [2019-11-16 00:37:54,098 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:37:54,098 INFO L462 AbstractCegarLoop]: Abstraction has 6609 states and 14672 transitions. [2019-11-16 00:37:54,099 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-16 00:37:54,099 INFO L276 IsEmpty]: Start isEmpty. Operand 6609 states and 14672 transitions. [2019-11-16 00:37:54,106 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-11-16 00:37:54,106 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:37:54,106 INFO L380 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, 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, 1, 1, 1, 1, 1] [2019-11-16 00:37:54,107 INFO L410 AbstractCegarLoop]: === Iteration 24 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:37:54,107 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:37:54,107 INFO L82 PathProgramCache]: Analyzing trace with hash 506934328, now seen corresponding path program 1 times [2019-11-16 00:37:54,107 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:37:54,107 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [547130213] [2019-11-16 00:37:54,108 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:37:54,108 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:37:54,108 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:37:54,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:37:54,232 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:37:54,233 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [547130213] [2019-11-16 00:37:54,233 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:37:54,234 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-11-16 00:37:54,234 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2061701945] [2019-11-16 00:37:54,234 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-11-16 00:37:54,234 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:37:54,235 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-11-16 00:37:54,235 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2019-11-16 00:37:54,235 INFO L87 Difference]: Start difference. First operand 6609 states and 14672 transitions. Second operand 9 states. [2019-11-16 00:37:55,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:37:55,545 INFO L93 Difference]: Finished difference Result 13060 states and 28465 transitions. [2019-11-16 00:37:55,545 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-11-16 00:37:55,545 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 93 [2019-11-16 00:37:55,545 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:37:55,555 INFO L225 Difference]: With dead ends: 13060 [2019-11-16 00:37:55,556 INFO L226 Difference]: Without dead ends: 13060 [2019-11-16 00:37:55,556 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 261 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=207, Invalid=785, Unknown=0, NotChecked=0, Total=992 [2019-11-16 00:37:55,576 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13060 states. [2019-11-16 00:37:55,646 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13060 to 8461. [2019-11-16 00:37:55,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8461 states. [2019-11-16 00:37:55,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8461 states to 8461 states and 18673 transitions. [2019-11-16 00:37:55,655 INFO L78 Accepts]: Start accepts. Automaton has 8461 states and 18673 transitions. Word has length 93 [2019-11-16 00:37:55,656 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:37:55,656 INFO L462 AbstractCegarLoop]: Abstraction has 8461 states and 18673 transitions. [2019-11-16 00:37:55,656 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-11-16 00:37:55,656 INFO L276 IsEmpty]: Start isEmpty. Operand 8461 states and 18673 transitions. [2019-11-16 00:37:55,662 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-11-16 00:37:55,663 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:37:55,663 INFO L380 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, 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, 1, 1, 1, 1, 1] [2019-11-16 00:37:55,663 INFO L410 AbstractCegarLoop]: === Iteration 25 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:37:55,663 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:37:55,664 INFO L82 PathProgramCache]: Analyzing trace with hash 499174969, now seen corresponding path program 1 times [2019-11-16 00:37:55,664 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:37:55,664 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1721112302] [2019-11-16 00:37:55,664 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:37:55,664 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:37:55,664 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:37:55,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:37:55,731 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:37:55,731 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1721112302] [2019-11-16 00:37:55,732 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:37:55,732 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-16 00:37:55,732 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1733490754] [2019-11-16 00:37:55,732 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-16 00:37:55,733 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:37:55,733 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-16 00:37:55,733 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-16 00:37:55,733 INFO L87 Difference]: Start difference. First operand 8461 states and 18673 transitions. Second operand 5 states. [2019-11-16 00:37:55,857 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:37:55,857 INFO L93 Difference]: Finished difference Result 8585 states and 19120 transitions. [2019-11-16 00:37:55,857 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-16 00:37:55,857 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 93 [2019-11-16 00:37:55,858 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:37:55,864 INFO L225 Difference]: With dead ends: 8585 [2019-11-16 00:37:55,864 INFO L226 Difference]: Without dead ends: 8585 [2019-11-16 00:37:55,864 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-11-16 00:37:55,872 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8585 states. [2019-11-16 00:37:55,919 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8585 to 6542. [2019-11-16 00:37:55,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6542 states. [2019-11-16 00:37:55,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6542 states to 6542 states and 14641 transitions. [2019-11-16 00:37:55,927 INFO L78 Accepts]: Start accepts. Automaton has 6542 states and 14641 transitions. Word has length 93 [2019-11-16 00:37:55,927 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:37:55,927 INFO L462 AbstractCegarLoop]: Abstraction has 6542 states and 14641 transitions. [2019-11-16 00:37:55,927 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-16 00:37:55,927 INFO L276 IsEmpty]: Start isEmpty. Operand 6542 states and 14641 transitions. [2019-11-16 00:37:55,931 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-11-16 00:37:55,931 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:37:55,932 INFO L380 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, 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, 1, 1, 1, 1, 1] [2019-11-16 00:37:55,932 INFO L410 AbstractCegarLoop]: === Iteration 26 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:37:55,932 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:37:55,933 INFO L82 PathProgramCache]: Analyzing trace with hash -1684501958, now seen corresponding path program 1 times [2019-11-16 00:37:55,933 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:37:55,933 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1031515633] [2019-11-16 00:37:55,933 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:37:55,933 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:37:55,933 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:37:55,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:37:56,071 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:37:56,071 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1031515633] [2019-11-16 00:37:56,071 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:37:56,071 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-11-16 00:37:56,072 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [901396992] [2019-11-16 00:37:56,072 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-16 00:37:56,072 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:37:56,072 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-16 00:37:56,073 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2019-11-16 00:37:56,073 INFO L87 Difference]: Start difference. First operand 6542 states and 14641 transitions. Second operand 8 states. [2019-11-16 00:37:56,554 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:37:56,554 INFO L93 Difference]: Finished difference Result 10035 states and 22193 transitions. [2019-11-16 00:37:56,555 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-11-16 00:37:56,555 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 93 [2019-11-16 00:37:56,555 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:37:56,565 INFO L225 Difference]: With dead ends: 10035 [2019-11-16 00:37:56,566 INFO L226 Difference]: Without dead ends: 10023 [2019-11-16 00:37:56,566 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2019-11-16 00:37:56,580 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10023 states. [2019-11-16 00:37:56,663 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10023 to 7459. [2019-11-16 00:37:56,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7459 states. [2019-11-16 00:37:56,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7459 states to 7459 states and 16697 transitions. [2019-11-16 00:37:56,675 INFO L78 Accepts]: Start accepts. Automaton has 7459 states and 16697 transitions. Word has length 93 [2019-11-16 00:37:56,675 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:37:56,675 INFO L462 AbstractCegarLoop]: Abstraction has 7459 states and 16697 transitions. [2019-11-16 00:37:56,675 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-16 00:37:56,675 INFO L276 IsEmpty]: Start isEmpty. Operand 7459 states and 16697 transitions. [2019-11-16 00:37:56,682 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-11-16 00:37:56,683 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:37:56,683 INFO L380 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, 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, 1, 1, 1, 1, 1] [2019-11-16 00:37:56,683 INFO L410 AbstractCegarLoop]: === Iteration 27 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:37:56,683 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:37:56,684 INFO L82 PathProgramCache]: Analyzing trace with hash -439737477, now seen corresponding path program 1 times [2019-11-16 00:37:56,684 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:37:56,684 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [883118379] [2019-11-16 00:37:56,684 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:37:56,684 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:37:56,685 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:37:56,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:37:56,750 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:37:56,750 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [883118379] [2019-11-16 00:37:56,751 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:37:56,751 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-16 00:37:56,751 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1263832619] [2019-11-16 00:37:56,751 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-16 00:37:56,752 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:37:56,752 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-16 00:37:56,752 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-11-16 00:37:56,752 INFO L87 Difference]: Start difference. First operand 7459 states and 16697 transitions. Second operand 6 states. [2019-11-16 00:37:57,089 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:37:57,089 INFO L93 Difference]: Finished difference Result 9307 states and 20721 transitions. [2019-11-16 00:37:57,090 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-11-16 00:37:57,090 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 93 [2019-11-16 00:37:57,090 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:37:57,097 INFO L225 Difference]: With dead ends: 9307 [2019-11-16 00:37:57,097 INFO L226 Difference]: Without dead ends: 9307 [2019-11-16 00:37:57,097 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2019-11-16 00:37:57,106 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9307 states. [2019-11-16 00:37:57,161 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9307 to 7248. [2019-11-16 00:37:57,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7248 states. [2019-11-16 00:37:57,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7248 states to 7248 states and 16275 transitions. [2019-11-16 00:37:57,169 INFO L78 Accepts]: Start accepts. Automaton has 7248 states and 16275 transitions. Word has length 93 [2019-11-16 00:37:57,169 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:37:57,169 INFO L462 AbstractCegarLoop]: Abstraction has 7248 states and 16275 transitions. [2019-11-16 00:37:57,169 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-16 00:37:57,169 INFO L276 IsEmpty]: Start isEmpty. Operand 7248 states and 16275 transitions. [2019-11-16 00:37:57,174 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-11-16 00:37:57,174 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:37:57,174 INFO L380 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, 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, 1, 1, 1, 1, 1] [2019-11-16 00:37:57,174 INFO L410 AbstractCegarLoop]: === Iteration 28 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:37:57,174 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:37:57,175 INFO L82 PathProgramCache]: Analyzing trace with hash 1995980714, now seen corresponding path program 1 times [2019-11-16 00:37:57,175 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:37:57,175 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1665915271] [2019-11-16 00:37:57,175 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:37:57,175 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:37:57,175 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:37:57,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:37:57,280 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:37:57,280 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1665915271] [2019-11-16 00:37:57,281 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:37:57,281 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-16 00:37:57,281 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1173003128] [2019-11-16 00:37:57,281 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-16 00:37:57,282 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:37:57,282 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-16 00:37:57,282 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-11-16 00:37:57,282 INFO L87 Difference]: Start difference. First operand 7248 states and 16275 transitions. Second operand 6 states. [2019-11-16 00:37:57,630 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:37:57,630 INFO L93 Difference]: Finished difference Result 9153 states and 20401 transitions. [2019-11-16 00:37:57,631 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-16 00:37:57,631 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 93 [2019-11-16 00:37:57,631 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:37:57,641 INFO L225 Difference]: With dead ends: 9153 [2019-11-16 00:37:57,641 INFO L226 Difference]: Without dead ends: 9135 [2019-11-16 00:37:57,641 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-11-16 00:37:57,654 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9135 states. [2019-11-16 00:37:57,730 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9135 to 7422. [2019-11-16 00:37:57,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7422 states. [2019-11-16 00:37:57,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7422 states to 7422 states and 16683 transitions. [2019-11-16 00:37:57,742 INFO L78 Accepts]: Start accepts. Automaton has 7422 states and 16683 transitions. Word has length 93 [2019-11-16 00:37:57,743 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:37:57,743 INFO L462 AbstractCegarLoop]: Abstraction has 7422 states and 16683 transitions. [2019-11-16 00:37:57,743 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-16 00:37:57,743 INFO L276 IsEmpty]: Start isEmpty. Operand 7422 states and 16683 transitions. [2019-11-16 00:37:57,750 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-11-16 00:37:57,751 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:37:57,751 INFO L380 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, 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, 1, 1, 1, 1, 1] [2019-11-16 00:37:57,751 INFO L410 AbstractCegarLoop]: === Iteration 29 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:37:57,751 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:37:57,751 INFO L82 PathProgramCache]: Analyzing trace with hash 199029355, now seen corresponding path program 1 times [2019-11-16 00:37:57,752 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:37:57,752 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2133629880] [2019-11-16 00:37:57,752 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:37:57,752 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:37:57,752 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:37:57,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:37:57,904 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:37:57,905 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2133629880] [2019-11-16 00:37:57,905 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:37:57,905 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-16 00:37:57,905 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [513485104] [2019-11-16 00:37:57,905 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-16 00:37:57,906 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:37:57,906 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-16 00:37:57,906 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-11-16 00:37:57,906 INFO L87 Difference]: Start difference. First operand 7422 states and 16683 transitions. Second operand 7 states. [2019-11-16 00:37:58,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:37:58,148 INFO L93 Difference]: Finished difference Result 9441 states and 21188 transitions. [2019-11-16 00:37:58,150 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-16 00:37:58,150 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 93 [2019-11-16 00:37:58,150 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:37:58,159 INFO L225 Difference]: With dead ends: 9441 [2019-11-16 00:37:58,159 INFO L226 Difference]: Without dead ends: 9441 [2019-11-16 00:37:58,161 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2019-11-16 00:37:58,175 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9441 states. [2019-11-16 00:37:58,240 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9441 to 6959. [2019-11-16 00:37:58,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6959 states. [2019-11-16 00:37:58,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6959 states to 6959 states and 15528 transitions. [2019-11-16 00:37:58,248 INFO L78 Accepts]: Start accepts. Automaton has 6959 states and 15528 transitions. Word has length 93 [2019-11-16 00:37:58,248 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:37:58,248 INFO L462 AbstractCegarLoop]: Abstraction has 6959 states and 15528 transitions. [2019-11-16 00:37:58,248 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-16 00:37:58,248 INFO L276 IsEmpty]: Start isEmpty. Operand 6959 states and 15528 transitions. [2019-11-16 00:37:58,253 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-11-16 00:37:58,253 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:37:58,253 INFO L380 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, 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, 1, 1, 1, 1, 1] [2019-11-16 00:37:58,254 INFO L410 AbstractCegarLoop]: === Iteration 30 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:37:58,254 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:37:58,254 INFO L82 PathProgramCache]: Analyzing trace with hash -1878179988, now seen corresponding path program 1 times [2019-11-16 00:37:58,254 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:37:58,254 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1614740278] [2019-11-16 00:37:58,255 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:37:58,255 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:37:58,255 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:37:58,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:37:58,347 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:37:58,347 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1614740278] [2019-11-16 00:37:58,348 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:37:58,348 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-16 00:37:58,348 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2066681897] [2019-11-16 00:37:58,348 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-16 00:37:58,348 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:37:58,349 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-16 00:37:58,349 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-11-16 00:37:58,349 INFO L87 Difference]: Start difference. First operand 6959 states and 15528 transitions. Second operand 6 states. [2019-11-16 00:37:58,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:37:58,430 INFO L93 Difference]: Finished difference Result 8560 states and 18892 transitions. [2019-11-16 00:37:58,430 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-16 00:37:58,430 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 93 [2019-11-16 00:37:58,430 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:37:58,437 INFO L225 Difference]: With dead ends: 8560 [2019-11-16 00:37:58,437 INFO L226 Difference]: Without dead ends: 8560 [2019-11-16 00:37:58,437 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-11-16 00:37:58,446 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8560 states. [2019-11-16 00:37:58,497 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8560 to 7093. [2019-11-16 00:37:58,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7093 states. [2019-11-16 00:37:58,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7093 states to 7093 states and 15727 transitions. [2019-11-16 00:37:58,505 INFO L78 Accepts]: Start accepts. Automaton has 7093 states and 15727 transitions. Word has length 93 [2019-11-16 00:37:58,505 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:37:58,505 INFO L462 AbstractCegarLoop]: Abstraction has 7093 states and 15727 transitions. [2019-11-16 00:37:58,505 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-16 00:37:58,505 INFO L276 IsEmpty]: Start isEmpty. Operand 7093 states and 15727 transitions. [2019-11-16 00:37:58,510 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-11-16 00:37:58,510 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:37:58,510 INFO L380 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, 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, 1, 1, 1, 1, 1] [2019-11-16 00:37:58,510 INFO L410 AbstractCegarLoop]: === Iteration 31 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:37:58,510 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:37:58,510 INFO L82 PathProgramCache]: Analyzing trace with hash 1572315437, now seen corresponding path program 1 times [2019-11-16 00:37:58,511 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:37:58,511 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2102880790] [2019-11-16 00:37:58,511 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:37:58,511 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:37:58,511 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:37:58,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:37:58,566 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:37:58,566 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2102880790] [2019-11-16 00:37:58,566 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:37:58,566 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-16 00:37:58,567 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1140280830] [2019-11-16 00:37:58,567 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-16 00:37:58,567 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:37:58,567 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-16 00:37:58,568 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-16 00:37:58,568 INFO L87 Difference]: Start difference. First operand 7093 states and 15727 transitions. Second operand 3 states. [2019-11-16 00:37:58,600 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:37:58,601 INFO L93 Difference]: Finished difference Result 7057 states and 15580 transitions. [2019-11-16 00:37:58,601 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-16 00:37:58,601 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 93 [2019-11-16 00:37:58,601 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:37:58,609 INFO L225 Difference]: With dead ends: 7057 [2019-11-16 00:37:58,610 INFO L226 Difference]: Without dead ends: 7039 [2019-11-16 00:37:58,610 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-16 00:37:58,620 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7039 states. [2019-11-16 00:37:58,683 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7039 to 5942. [2019-11-16 00:37:58,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5942 states. [2019-11-16 00:37:58,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5942 states to 5942 states and 13137 transitions. [2019-11-16 00:37:58,693 INFO L78 Accepts]: Start accepts. Automaton has 5942 states and 13137 transitions. Word has length 93 [2019-11-16 00:37:58,694 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:37:58,694 INFO L462 AbstractCegarLoop]: Abstraction has 5942 states and 13137 transitions. [2019-11-16 00:37:58,694 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-16 00:37:58,694 INFO L276 IsEmpty]: Start isEmpty. Operand 5942 states and 13137 transitions. [2019-11-16 00:37:58,700 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-11-16 00:37:58,700 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:37:58,700 INFO L380 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, 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, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:37:58,701 INFO L410 AbstractCegarLoop]: === Iteration 32 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:37:58,701 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:37:58,701 INFO L82 PathProgramCache]: Analyzing trace with hash -1413552895, now seen corresponding path program 1 times [2019-11-16 00:37:58,701 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:37:58,704 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1006631235] [2019-11-16 00:37:58,704 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:37:58,704 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:37:58,704 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:37:58,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:37:58,768 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:37:58,771 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1006631235] [2019-11-16 00:37:58,772 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:37:58,772 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-16 00:37:58,772 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [178808817] [2019-11-16 00:37:58,772 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-16 00:37:58,773 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:37:58,773 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-16 00:37:58,773 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-16 00:37:58,773 INFO L87 Difference]: Start difference. First operand 5942 states and 13137 transitions. Second operand 4 states. [2019-11-16 00:37:58,811 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:37:58,811 INFO L93 Difference]: Finished difference Result 5897 states and 13014 transitions. [2019-11-16 00:37:58,811 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-16 00:37:58,811 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 95 [2019-11-16 00:37:58,812 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:37:58,817 INFO L225 Difference]: With dead ends: 5897 [2019-11-16 00:37:58,818 INFO L226 Difference]: Without dead ends: 5897 [2019-11-16 00:37:58,819 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:37:58,829 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5897 states. [2019-11-16 00:37:58,882 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5897 to 5463. [2019-11-16 00:37:58,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5463 states. [2019-11-16 00:37:58,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5463 states to 5463 states and 12032 transitions. [2019-11-16 00:37:58,892 INFO L78 Accepts]: Start accepts. Automaton has 5463 states and 12032 transitions. Word has length 95 [2019-11-16 00:37:58,892 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:37:58,892 INFO L462 AbstractCegarLoop]: Abstraction has 5463 states and 12032 transitions. [2019-11-16 00:37:58,892 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-16 00:37:58,892 INFO L276 IsEmpty]: Start isEmpty. Operand 5463 states and 12032 transitions. [2019-11-16 00:37:58,898 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-11-16 00:37:58,898 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:37:58,898 INFO L380 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, 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, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:37:58,898 INFO L410 AbstractCegarLoop]: === Iteration 33 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:37:58,899 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:37:58,899 INFO L82 PathProgramCache]: Analyzing trace with hash 573928865, now seen corresponding path program 1 times [2019-11-16 00:37:58,899 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:37:58,899 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [306269043] [2019-11-16 00:37:58,899 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:37:58,899 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:37:58,900 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:37:58,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:37:59,062 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:37:59,062 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [306269043] [2019-11-16 00:37:59,062 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:37:59,063 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-16 00:37:59,063 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1776538265] [2019-11-16 00:37:59,063 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-16 00:37:59,063 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:37:59,063 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-16 00:37:59,064 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-11-16 00:37:59,064 INFO L87 Difference]: Start difference. First operand 5463 states and 12032 transitions. Second operand 7 states. [2019-11-16 00:37:59,159 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:37:59,160 INFO L93 Difference]: Finished difference Result 9145 states and 20239 transitions. [2019-11-16 00:37:59,160 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-16 00:37:59,160 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 95 [2019-11-16 00:37:59,160 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:37:59,164 INFO L225 Difference]: With dead ends: 9145 [2019-11-16 00:37:59,164 INFO L226 Difference]: Without dead ends: 3870 [2019-11-16 00:37:59,166 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2019-11-16 00:37:59,173 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3870 states. [2019-11-16 00:37:59,205 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3870 to 3870. [2019-11-16 00:37:59,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3870 states. [2019-11-16 00:37:59,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3870 states to 3870 states and 8561 transitions. [2019-11-16 00:37:59,213 INFO L78 Accepts]: Start accepts. Automaton has 3870 states and 8561 transitions. Word has length 95 [2019-11-16 00:37:59,214 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:37:59,214 INFO L462 AbstractCegarLoop]: Abstraction has 3870 states and 8561 transitions. [2019-11-16 00:37:59,214 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-16 00:37:59,214 INFO L276 IsEmpty]: Start isEmpty. Operand 3870 states and 8561 transitions. [2019-11-16 00:37:59,217 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-11-16 00:37:59,218 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:37:59,218 INFO L380 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, 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, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:37:59,218 INFO L410 AbstractCegarLoop]: === Iteration 34 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:37:59,218 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:37:59,219 INFO L82 PathProgramCache]: Analyzing trace with hash -206398345, now seen corresponding path program 2 times [2019-11-16 00:37:59,219 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:37:59,219 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1269368578] [2019-11-16 00:37:59,219 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:37:59,219 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:37:59,220 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:37:59,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:37:59,365 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:37:59,365 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1269368578] [2019-11-16 00:37:59,366 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:37:59,366 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-11-16 00:37:59,366 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [769063040] [2019-11-16 00:37:59,366 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-16 00:37:59,367 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:37:59,367 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-16 00:37:59,367 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2019-11-16 00:37:59,367 INFO L87 Difference]: Start difference. First operand 3870 states and 8561 transitions. Second operand 10 states. [2019-11-16 00:37:59,585 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:37:59,585 INFO L93 Difference]: Finished difference Result 7861 states and 17637 transitions. [2019-11-16 00:37:59,586 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-11-16 00:37:59,586 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 95 [2019-11-16 00:37:59,586 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:37:59,590 INFO L225 Difference]: With dead ends: 7861 [2019-11-16 00:37:59,590 INFO L226 Difference]: Without dead ends: 5036 [2019-11-16 00:37:59,590 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=53, Invalid=219, Unknown=0, NotChecked=0, Total=272 [2019-11-16 00:37:59,595 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5036 states. [2019-11-16 00:37:59,622 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5036 to 3877. [2019-11-16 00:37:59,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3877 states. [2019-11-16 00:37:59,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3877 states to 3877 states and 8529 transitions. [2019-11-16 00:37:59,626 INFO L78 Accepts]: Start accepts. Automaton has 3877 states and 8529 transitions. Word has length 95 [2019-11-16 00:37:59,626 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:37:59,626 INFO L462 AbstractCegarLoop]: Abstraction has 3877 states and 8529 transitions. [2019-11-16 00:37:59,626 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-16 00:37:59,627 INFO L276 IsEmpty]: Start isEmpty. Operand 3877 states and 8529 transitions. [2019-11-16 00:37:59,629 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-11-16 00:37:59,629 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:37:59,629 INFO L380 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, 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, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:37:59,629 INFO L410 AbstractCegarLoop]: === Iteration 35 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:37:59,629 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:37:59,630 INFO L82 PathProgramCache]: Analyzing trace with hash -2012267115, now seen corresponding path program 3 times [2019-11-16 00:37:59,630 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:37:59,630 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [3061025] [2019-11-16 00:37:59,630 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:37:59,630 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:37:59,630 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:37:59,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:37:59,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:37:59,707 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-16 00:37:59,707 INFO L445 BasicCegarLoop]: Counterexample might be feasible [2019-11-16 00:37:59,836 INFO L303 ceAbstractionStarter]: Did not count any witness invariants because Icfg is not BoogieIcfg [2019-11-16 00:37:59,838 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.11 12:37:59 BasicIcfg [2019-11-16 00:37:59,838 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-16 00:37:59,839 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-16 00:37:59,839 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-16 00:37:59,839 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-16 00:37:59,840 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 12:37:21" (3/4) ... [2019-11-16 00:37:59,842 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2019-11-16 00:37:59,955 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_b98348c0-83f9-4d19-80d5-c9975d2d1644/bin/uautomizer/witness.graphml [2019-11-16 00:37:59,955 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-16 00:37:59,957 INFO L168 Benchmark]: Toolchain (without parser) took 39490.30 ms. Allocated memory was 1.0 GB in the beginning and 4.7 GB in the end (delta: 3.7 GB). Free memory was 939.3 MB in the beginning and 3.3 GB in the end (delta: -2.4 GB). Peak memory consumption was 1.3 GB. Max. memory is 11.5 GB. [2019-11-16 00:37:59,957 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 1.0 GB. Free memory is still 967.5 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-16 00:37:59,957 INFO L168 Benchmark]: CACSL2BoogieTranslator took 622.98 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 133.2 MB). Free memory was 939.3 MB in the beginning and 1.1 GB in the end (delta: -160.1 MB). Peak memory consumption was 18.5 MB. Max. memory is 11.5 GB. [2019-11-16 00:37:59,958 INFO L168 Benchmark]: Boogie Procedure Inliner took 56.76 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: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2019-11-16 00:37:59,958 INFO L168 Benchmark]: Boogie Preprocessor took 69.15 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:37:59,958 INFO L168 Benchmark]: RCFGBuilder took 725.45 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 49.2 MB). Peak memory consumption was 49.2 MB. Max. memory is 11.5 GB. [2019-11-16 00:37:59,959 INFO L168 Benchmark]: TraceAbstraction took 37895.36 ms. Allocated memory was 1.2 GB in the beginning and 4.7 GB in the end (delta: 3.5 GB). Free memory was 1.0 GB in the beginning and 3.4 GB in the end (delta: -2.3 GB). Peak memory consumption was 1.2 GB. Max. memory is 11.5 GB. [2019-11-16 00:37:59,959 INFO L168 Benchmark]: Witness Printer took 116.30 ms. Allocated memory is still 4.7 GB. Free memory was 3.4 GB in the beginning and 3.3 GB in the end (delta: 18.1 MB). Peak memory consumption was 18.1 MB. Max. memory is 11.5 GB. [2019-11-16 00:37:59,961 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.17 ms. Allocated memory is still 1.0 GB. Free memory is still 967.5 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 622.98 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 133.2 MB). Free memory was 939.3 MB in the beginning and 1.1 GB in the end (delta: -160.1 MB). Peak memory consumption was 18.5 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 56.76 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: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 69.15 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 725.45 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 49.2 MB). Peak memory consumption was 49.2 MB. Max. memory is 11.5 GB. * TraceAbstraction took 37895.36 ms. Allocated memory was 1.2 GB in the beginning and 4.7 GB in the end (delta: 3.5 GB). Free memory was 1.0 GB in the beginning and 3.4 GB in the end (delta: -2.3 GB). Peak memory consumption was 1.2 GB. Max. memory is 11.5 GB. * Witness Printer took 116.30 ms. Allocated memory is still 4.7 GB. Free memory was 3.4 GB in the beginning and 3.3 GB in the end (delta: 18.1 MB). Peak memory consumption was 18.1 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L694] 0 int __unbuffered_cnt = 0; VAL [__unbuffered_cnt=0] [L696] 0 int __unbuffered_p1_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0] [L698] 0 int __unbuffered_p1_EBX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0] [L699] 0 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0] [L700] 0 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0] [L702] 0 int x = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0] [L703] 0 _Bool x$flush_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0] [L704] 0 int x$mem_tmp; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0] [L705] 0 _Bool x$r_buff0_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0] [L706] 0 _Bool x$r_buff0_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0] [L707] 0 _Bool x$r_buff0_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0] [L708] 0 _Bool x$r_buff1_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0] [L709] 0 _Bool x$r_buff1_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0] [L710] 0 _Bool x$r_buff1_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0] [L711] 0 _Bool x$read_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0] [L712] 0 int *x$read_delayed_var; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}] [L713] 0 int x$w_buff0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0] [L714] 0 _Bool x$w_buff0_used; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0] [L715] 0 int x$w_buff1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0] [L716] 0 _Bool x$w_buff1_used; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0] [L718] 0 int y = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L719] 0 _Bool weak$$choice0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L720] 0 _Bool weak$$choice2; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L796] 0 pthread_t t1713; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L797] FCALL, FORK 0 pthread_create(&t1713, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L798] 0 pthread_t t1714; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L799] FCALL, FORK 0 pthread_create(&t1714, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L724] 1 x$w_buff1 = x$w_buff0 [L725] 1 x$w_buff0 = 1 [L726] 1 x$w_buff1_used = x$w_buff0_used [L727] 1 x$w_buff0_used = (_Bool)1 [L4] COND FALSE 1 !(!expression) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L729] 1 x$r_buff1_thd0 = x$r_buff0_thd0 [L730] 1 x$r_buff1_thd1 = x$r_buff0_thd1 [L731] 1 x$r_buff1_thd2 = x$r_buff0_thd2 [L732] 1 x$r_buff0_thd1 = (_Bool)1 [L735] 1 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L738] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L752] 2 y = 2 [L755] 2 __unbuffered_p1_EAX = y [L758] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L759] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L760] 2 x$flush_delayed = weak$$choice2 [L761] 2 x$mem_tmp = x VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=3, x=0, x$flush_delayed=3, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L762] EXPR 2 !x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff1) VAL [!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=3, x=0, x$flush_delayed=3, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L738] 1 x = x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L739] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used VAL [!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=3, x=1, x$flush_delayed=3, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L762] 2 x = !x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff1) [L739] 1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L740] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=3, x=0, x$flush_delayed=3, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L763] EXPR 2 weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=3, weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff0))=1, x=0, x$flush_delayed=3, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L763] 2 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff0)) [L764] EXPR 2 weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff1 : x$w_buff1)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=3, weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff1 : x$w_buff1))=0, x=0, x$flush_delayed=3, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L764] 2 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff1 : x$w_buff1)) [L765] EXPR 2 weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=3, weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used))=0, x=0, x$flush_delayed=3, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L765] 2 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used)) [L766] EXPR 2 weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=3, weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0))=0, x=0, x$flush_delayed=3, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L766] 2 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L767] EXPR 2 weak$$choice2 ? x$r_buff0_thd2 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff0_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=3, weak$$choice2 ? x$r_buff0_thd2 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff0_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2))=0, x=0, x$flush_delayed=3, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L767] 2 x$r_buff0_thd2 = weak$$choice2 ? x$r_buff0_thd2 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff0_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2)) [L768] EXPR 2 weak$$choice2 ? x$r_buff1_thd2 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff1_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=3, weak$$choice2 ? x$r_buff1_thd2 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff1_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0))=0, x=0, x$flush_delayed=3, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L768] 2 x$r_buff1_thd2 = weak$$choice2 ? x$r_buff1_thd2 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff1_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L769] 2 __unbuffered_p1_EBX = x VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=3, x=0, x$flush_delayed=3, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L770] EXPR 2 x$flush_delayed ? x$mem_tmp : x VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=3, x=0, x$flush_delayed=3, x$flush_delayed ? x$mem_tmp : x=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L770] 2 x = x$flush_delayed ? x$mem_tmp : x [L771] 2 x$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=3, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L774] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=3, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L774] EXPR 2 x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=3, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x=0, y=2] [L740] 1 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L741] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=3, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x=0, y=2] [L741] 1 x$r_buff0_thd1 = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L742] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=3, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x=0, y=2] [L742] 1 x$r_buff1_thd1 = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1 [L745] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=3, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x=0, y=2] [L774] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=3, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x)=0, x$w_buff1=0, x$w_buff1_used=0, x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x=0, y=2] [L774] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L775] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=3, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L775] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L776] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=3, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L776] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L777] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=3, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L777] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L778] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=3, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L778] 2 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 [L781] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=3, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L801] 0 main$tmp_guard0 = __unbuffered_cnt == 2 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=3, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L805] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=3, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L805] EXPR 0 x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=3, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L805] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=3, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L805] 0 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L806] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=3, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L806] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L807] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=3, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L807] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L808] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=3, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L808] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L809] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=3, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L809] 0 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 [L812] 0 main$tmp_guard1 = !(y == 2 && __unbuffered_p1_EAX == 2 && __unbuffered_p1_EBX == 0) VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=3, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L4] COND TRUE 0 !expression VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=3, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L4] 0 __VERIFIER_error() VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=3, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 218 locations, 3 error locations. Result: UNSAFE, OverallTime: 37.7s, OverallIterations: 35, TraceHistogramMax: 1, AutomataDifference: 14.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 9160 SDtfs, 9361 SDslu, 20112 SDs, 0 SdLazy, 7333 SolverSat, 475 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 7.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 336 GetRequests, 101 SyntacticMatches, 19 SemanticMatches, 216 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 407 ImplicationChecksByTransitivity, 2.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=60245occurred in iteration=6, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 16.5s AutomataMinimizationTime, 34 MinimizatonAttempts, 81496 StatesRemovedByMinimization, 32 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 2.2s InterpolantComputationTime, 2581 NumberOfCodeBlocks, 2581 NumberOfCodeBlocksAsserted, 35 NumberOfCheckSat, 2452 ConstructedInterpolants, 0 QuantifiedInterpolants, 466858 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 34 InterpolantComputations, 34 PerfectInterpolantSequences, 0/0 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...