./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/mix041_power.oepc_false-unreach-call.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 635dfa2a Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_fed2a6b7-7b4d-4ad7-81a0-5bccef2fe637/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_fed2a6b7-7b4d-4ad7-81a0-5bccef2fe637/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_fed2a6b7-7b4d-4ad7-81a0-5bccef2fe637/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_fed2a6b7-7b4d-4ad7-81a0-5bccef2fe637/bin-2019/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/pthread-wmm/mix041_power.oepc_false-unreach-call.i -s /tmp/vcloud-vcloud-master/worker/working_dir_fed2a6b7-7b4d-4ad7-81a0-5bccef2fe637/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_fed2a6b7-7b4d-4ad7-81a0-5bccef2fe637/bin-2019/utaipan --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 Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 424d85e81579c93fea3149876316172742bff15d ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. 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.23-635dfa2 [2018-12-09 19:20:10,313 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-09 19:20:10,314 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-09 19:20:10,320 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-09 19:20:10,320 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-09 19:20:10,321 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-09 19:20:10,321 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-09 19:20:10,323 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-09 19:20:10,324 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-09 19:20:10,324 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-09 19:20:10,325 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-09 19:20:10,325 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-09 19:20:10,326 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-09 19:20:10,326 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-09 19:20:10,327 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-09 19:20:10,327 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-09 19:20:10,327 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-09 19:20:10,328 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-09 19:20:10,329 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-09 19:20:10,330 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-09 19:20:10,330 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-09 19:20:10,331 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-09 19:20:10,333 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-09 19:20:10,333 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-09 19:20:10,333 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-09 19:20:10,333 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-09 19:20:10,334 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-09 19:20:10,334 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-09 19:20:10,335 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-09 19:20:10,335 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-09 19:20:10,335 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-09 19:20:10,336 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-09 19:20:10,336 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-09 19:20:10,336 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-09 19:20:10,336 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-09 19:20:10,337 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-09 19:20:10,337 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_fed2a6b7-7b4d-4ad7-81a0-5bccef2fe637/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2018-12-09 19:20:10,344 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-09 19:20:10,344 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-09 19:20:10,345 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-09 19:20:10,345 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-09 19:20:10,345 INFO L133 SettingsManager]: * User list type=DISABLED [2018-12-09 19:20:10,345 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-12-09 19:20:10,345 INFO L133 SettingsManager]: * Explicit value domain=true [2018-12-09 19:20:10,345 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-12-09 19:20:10,346 INFO L133 SettingsManager]: * Octagon Domain=false [2018-12-09 19:20:10,346 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-12-09 19:20:10,346 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-12-09 19:20:10,346 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-12-09 19:20:10,346 INFO L133 SettingsManager]: * Interval Domain=false [2018-12-09 19:20:10,347 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-09 19:20:10,347 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-09 19:20:10,347 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-09 19:20:10,347 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-09 19:20:10,347 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-09 19:20:10,347 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-09 19:20:10,348 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-09 19:20:10,348 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-09 19:20:10,348 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-09 19:20:10,348 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-09 19:20:10,348 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-09 19:20:10,348 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-09 19:20:10,348 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-09 19:20:10,349 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-09 19:20:10,349 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-09 19:20:10,349 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-09 19:20:10,349 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-09 19:20:10,349 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-09 19:20:10,349 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-09 19:20:10,349 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-12-09 19:20:10,350 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-09 19:20:10,350 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-09 19:20:10,350 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-12-09 19:20:10,350 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES 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/working_dir_fed2a6b7-7b4d-4ad7-81a0-5bccef2fe637/bin-2019/utaipan 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 -> Taipan 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 -> 424d85e81579c93fea3149876316172742bff15d [2018-12-09 19:20:10,372 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-09 19:20:10,379 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-09 19:20:10,381 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-09 19:20:10,382 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-09 19:20:10,383 INFO L276 PluginConnector]: CDTParser initialized [2018-12-09 19:20:10,383 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_fed2a6b7-7b4d-4ad7-81a0-5bccef2fe637/bin-2019/utaipan/../../sv-benchmarks/c/pthread-wmm/mix041_power.oepc_false-unreach-call.i [2018-12-09 19:20:10,416 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_fed2a6b7-7b4d-4ad7-81a0-5bccef2fe637/bin-2019/utaipan/data/41763f68c/a01a00bd025a43e3be6c0c10a6c78d44/FLAG269b1dcb2 [2018-12-09 19:20:10,745 INFO L307 CDTParser]: Found 1 translation units. [2018-12-09 19:20:10,745 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_fed2a6b7-7b4d-4ad7-81a0-5bccef2fe637/sv-benchmarks/c/pthread-wmm/mix041_power.oepc_false-unreach-call.i [2018-12-09 19:20:10,753 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_fed2a6b7-7b4d-4ad7-81a0-5bccef2fe637/bin-2019/utaipan/data/41763f68c/a01a00bd025a43e3be6c0c10a6c78d44/FLAG269b1dcb2 [2018-12-09 19:20:11,144 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_fed2a6b7-7b4d-4ad7-81a0-5bccef2fe637/bin-2019/utaipan/data/41763f68c/a01a00bd025a43e3be6c0c10a6c78d44 [2018-12-09 19:20:11,146 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-09 19:20:11,146 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-09 19:20:11,147 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-09 19:20:11,147 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-09 19:20:11,149 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-09 19:20:11,150 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 07:20:11" (1/1) ... [2018-12-09 19:20:11,152 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@bf327e1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 07:20:11, skipping insertion in model container [2018-12-09 19:20:11,152 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 07:20:11" (1/1) ... [2018-12-09 19:20:11,156 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-09 19:20:11,178 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-09 19:20:11,352 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-09 19:20:11,360 INFO L191 MainTranslator]: Completed pre-run [2018-12-09 19:20:11,449 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-09 19:20:11,489 INFO L195 MainTranslator]: Completed translation [2018-12-09 19:20:11,489 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 07:20:11 WrapperNode [2018-12-09 19:20:11,489 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-09 19:20:11,490 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-09 19:20:11,490 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-09 19:20:11,490 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-09 19:20:11,495 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 07:20:11" (1/1) ... [2018-12-09 19:20:11,509 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 07:20:11" (1/1) ... [2018-12-09 19:20:11,529 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-09 19:20:11,529 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-09 19:20:11,529 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-09 19:20:11,529 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-09 19:20:11,536 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 07:20:11" (1/1) ... [2018-12-09 19:20:11,536 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 07:20:11" (1/1) ... [2018-12-09 19:20:11,538 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 07:20:11" (1/1) ... [2018-12-09 19:20:11,538 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 07:20:11" (1/1) ... [2018-12-09 19:20:11,543 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 07:20:11" (1/1) ... [2018-12-09 19:20:11,546 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 07:20:11" (1/1) ... [2018-12-09 19:20:11,547 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 07:20:11" (1/1) ... [2018-12-09 19:20:11,549 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-09 19:20:11,550 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-09 19:20:11,550 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-09 19:20:11,550 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-09 19:20:11,551 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 07:20:11" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_fed2a6b7-7b4d-4ad7-81a0-5bccef2fe637/bin-2019/utaipan/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 [2018-12-09 19:20:11,588 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-12-09 19:20:11,589 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-12-09 19:20:11,589 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2018-12-09 19:20:11,589 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-12-09 19:20:11,589 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2018-12-09 19:20:11,589 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2018-12-09 19:20:11,589 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2018-12-09 19:20:11,590 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2018-12-09 19:20:11,590 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2018-12-09 19:20:11,590 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-09 19:20:11,590 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-09 19:20:11,591 WARN L198 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2018-12-09 19:20:11,907 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-09 19:20:11,907 INFO L280 CfgBuilder]: Removed 8 assue(true) statements. [2018-12-09 19:20:11,908 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 07:20:11 BoogieIcfgContainer [2018-12-09 19:20:11,908 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-09 19:20:11,908 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-09 19:20:11,909 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-09 19:20:11,911 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-09 19:20:11,911 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.12 07:20:11" (1/3) ... [2018-12-09 19:20:11,912 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7b4219ba and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.12 07:20:11, skipping insertion in model container [2018-12-09 19:20:11,912 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 07:20:11" (2/3) ... [2018-12-09 19:20:11,912 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7b4219ba and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.12 07:20:11, skipping insertion in model container [2018-12-09 19:20:11,913 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 07:20:11" (3/3) ... [2018-12-09 19:20:11,914 INFO L112 eAbstractionObserver]: Analyzing ICFG mix041_power.oepc_false-unreach-call.i [2018-12-09 19:20:11,944 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:20:11,944 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:20:11,944 WARN L317 ript$VariableManager]: TermVariabe Thread0_P0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:20:11,944 WARN L317 ript$VariableManager]: TermVariabe Thread0_P0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:20:11,944 WARN L317 ript$VariableManager]: TermVariabe Thread0_P0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:20:11,945 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:20:11,945 WARN L317 ript$VariableManager]: TermVariabe Thread0_P0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:20:11,945 WARN L317 ript$VariableManager]: TermVariabe Thread0_P0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:20:11,945 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:20:11,945 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:20:11,945 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:20:11,945 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:20:11,945 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:20:11,946 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:20:11,946 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:20:11,946 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:20:11,946 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:20:11,946 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:20:11,946 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:20:11,946 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:20:11,946 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:20:11,946 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:20:11,946 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:20:11,946 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:20:11,947 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:20:11,947 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:20:11,947 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:20:11,947 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:20:11,947 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:20:11,947 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:20:11,947 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:20:11,947 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:20:11,947 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet9.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:20:11,947 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet9.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:20:11,948 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:20:11,948 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:20:11,948 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet9.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:20:11,948 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet9.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:20:11,948 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet11.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:20:11,948 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet11.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:20:11,948 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:20:11,948 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet10.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:20:11,948 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:20:11,949 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet10.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:20:11,949 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet11.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:20:11,949 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet10.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:20:11,949 WARN L317 ript$VariableManager]: TermVariabe Thread1_P1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:20:11,949 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet11.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:20:11,949 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet10.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:20:11,949 WARN L317 ript$VariableManager]: TermVariabe Thread1_P1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:20:11,949 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:20:11,949 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:20:11,949 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:20:11,949 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:20:11,949 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:20:11,950 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:20:11,950 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:20:11,950 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:20:11,950 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:20:11,950 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:20:11,950 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:20:11,950 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:20:11,950 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:20:11,950 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:20:11,950 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:20:11,951 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:20:11,951 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:20:11,951 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:20:11,951 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:20:11,951 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:20:11,951 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:20:11,951 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:20:11,951 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:20:11,951 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:20:11,951 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:20:11,951 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:20:11,952 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:20:11,952 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:20:11,952 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:20:11,952 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:20:11,952 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:20:11,952 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:20:11,952 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:20:11,952 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:20:11,952 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:20:11,952 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:20:11,952 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:20:11,953 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:20:11,953 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:20:11,953 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:20:11,953 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:20:11,953 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:20:11,953 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:20:11,953 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:20:11,953 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:20:11,953 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:20:11,953 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:20:11,953 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:20:11,954 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:20:11,954 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:20:11,954 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:20:11,954 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:20:11,954 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:20:11,956 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:20:11,956 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:20:11,956 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:20:11,956 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:20:11,956 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:20:11,957 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:20:11,957 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:20:11,957 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:20:11,957 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:20:11,957 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:20:11,957 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:20:11,957 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:20:11,958 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:20:11,958 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:20:11,958 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:20:11,958 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:20:11,958 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:20:11,958 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:20:11,958 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:20:11,959 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:20:11,959 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:20:11,959 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:20:11,959 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:20:11,959 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:20:11,959 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:20:11,960 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:20:11,960 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:20:11,960 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:20:11,960 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:20:11,960 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:20:11,960 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:20:11,960 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:20:11,961 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:20:11,961 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:20:11,961 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:20:11,961 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:20:11,961 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:20:11,961 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:20:11,961 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:20:11,961 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:20:11,962 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:20:11,962 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:20:11,962 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:20:11,962 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:20:11,962 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:20:11,962 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:20:11,962 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:20:11,963 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:20:11,963 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:20:11,963 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:20:11,963 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:20:11,963 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:20:11,963 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:20:11,963 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:20:11,964 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:20:11,964 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet39.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:20:11,964 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet39.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:20:11,964 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:20:11,964 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:20:11,964 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet39.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:20:11,964 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet39.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:20:11,968 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2018-12-09 19:20:11,968 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-09 19:20:11,974 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 3 error locations. [2018-12-09 19:20:11,983 INFO L257 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2018-12-09 19:20:11,998 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-09 19:20:11,998 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-09 19:20:11,998 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-09 19:20:11,998 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-09 19:20:11,998 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-09 19:20:11,998 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-09 19:20:11,998 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-09 19:20:11,998 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-09 19:20:12,004 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 143places, 181 transitions [2018-12-09 19:20:13,436 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 34807 states. [2018-12-09 19:20:13,438 INFO L276 IsEmpty]: Start isEmpty. Operand 34807 states. [2018-12-09 19:20:13,443 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-12-09 19:20:13,443 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:20:13,444 INFO L402 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] [2018-12-09 19:20:13,446 INFO L423 AbstractCegarLoop]: === Iteration 1 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 19:20:13,449 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:20:13,450 INFO L82 PathProgramCache]: Analyzing trace with hash 375373260, now seen corresponding path program 1 times [2018-12-09 19:20:13,451 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 19:20:13,491 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:20:13,491 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:20:13,491 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:20:13,491 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 19:20:13,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:20:13,604 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 19:20:13,606 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 19:20:13,606 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 19:20:13,606 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 19:20:13,610 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 19:20:13,622 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 19:20:13,622 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 19:20:13,624 INFO L87 Difference]: Start difference. First operand 34807 states. Second operand 4 states. [2018-12-09 19:20:14,113 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:20:14,113 INFO L93 Difference]: Finished difference Result 60791 states and 234494 transitions. [2018-12-09 19:20:14,114 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 19:20:14,115 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 34 [2018-12-09 19:20:14,115 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:20:14,270 INFO L225 Difference]: With dead ends: 60791 [2018-12-09 19:20:14,270 INFO L226 Difference]: Without dead ends: 44271 [2018-12-09 19:20:14,271 INFO L631 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 [2018-12-09 19:20:14,466 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44271 states. [2018-12-09 19:20:14,923 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44271 to 27339. [2018-12-09 19:20:14,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27339 states. [2018-12-09 19:20:15,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27339 states to 27339 states and 105500 transitions. [2018-12-09 19:20:15,009 INFO L78 Accepts]: Start accepts. Automaton has 27339 states and 105500 transitions. Word has length 34 [2018-12-09 19:20:15,009 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:20:15,009 INFO L480 AbstractCegarLoop]: Abstraction has 27339 states and 105500 transitions. [2018-12-09 19:20:15,009 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 19:20:15,009 INFO L276 IsEmpty]: Start isEmpty. Operand 27339 states and 105500 transitions. [2018-12-09 19:20:15,013 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-12-09 19:20:15,014 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:20:15,014 INFO L402 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] [2018-12-09 19:20:15,014 INFO L423 AbstractCegarLoop]: === Iteration 2 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 19:20:15,014 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:20:15,014 INFO L82 PathProgramCache]: Analyzing trace with hash 510140563, now seen corresponding path program 1 times [2018-12-09 19:20:15,014 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 19:20:15,017 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:20:15,017 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:20:15,017 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:20:15,017 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 19:20:15,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:20:15,062 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 19:20:15,062 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 19:20:15,062 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 19:20:15,062 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 19:20:15,063 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 19:20:15,063 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 19:20:15,063 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 19:20:15,063 INFO L87 Difference]: Start difference. First operand 27339 states and 105500 transitions. Second operand 4 states. [2018-12-09 19:20:15,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:20:15,120 INFO L93 Difference]: Finished difference Result 8529 states and 28345 transitions. [2018-12-09 19:20:15,120 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-09 19:20:15,120 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 46 [2018-12-09 19:20:15,120 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:20:15,137 INFO L225 Difference]: With dead ends: 8529 [2018-12-09 19:20:15,138 INFO L226 Difference]: Without dead ends: 7467 [2018-12-09 19:20:15,138 INFO L631 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 [2018-12-09 19:20:15,154 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7467 states. [2018-12-09 19:20:15,212 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7467 to 7467. [2018-12-09 19:20:15,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7467 states. [2018-12-09 19:20:15,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7467 states to 7467 states and 24637 transitions. [2018-12-09 19:20:15,223 INFO L78 Accepts]: Start accepts. Automaton has 7467 states and 24637 transitions. Word has length 46 [2018-12-09 19:20:15,224 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:20:15,224 INFO L480 AbstractCegarLoop]: Abstraction has 7467 states and 24637 transitions. [2018-12-09 19:20:15,224 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 19:20:15,224 INFO L276 IsEmpty]: Start isEmpty. Operand 7467 states and 24637 transitions. [2018-12-09 19:20:15,225 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-12-09 19:20:15,225 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:20:15,225 INFO L402 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] [2018-12-09 19:20:15,225 INFO L423 AbstractCegarLoop]: === Iteration 3 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 19:20:15,225 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:20:15,225 INFO L82 PathProgramCache]: Analyzing trace with hash 1974914378, now seen corresponding path program 1 times [2018-12-09 19:20:15,225 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 19:20:15,228 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:20:15,228 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:20:15,229 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:20:15,229 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 19:20:15,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:20:15,288 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 19:20:15,288 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 19:20:15,289 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-09 19:20:15,289 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 19:20:15,289 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-09 19:20:15,289 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-09 19:20:15,289 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-09 19:20:15,289 INFO L87 Difference]: Start difference. First operand 7467 states and 24637 transitions. Second operand 5 states. [2018-12-09 19:20:15,514 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:20:15,514 INFO L93 Difference]: Finished difference Result 13999 states and 45806 transitions. [2018-12-09 19:20:15,515 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-09 19:20:15,515 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 47 [2018-12-09 19:20:15,515 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:20:15,536 INFO L225 Difference]: With dead ends: 13999 [2018-12-09 19:20:15,537 INFO L226 Difference]: Without dead ends: 13931 [2018-12-09 19:20:15,537 INFO L631 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 [2018-12-09 19:20:15,566 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13931 states. [2018-12-09 19:20:15,706 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13931 to 9442. [2018-12-09 19:20:15,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9442 states. [2018-12-09 19:20:15,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9442 states to 9442 states and 30543 transitions. [2018-12-09 19:20:15,718 INFO L78 Accepts]: Start accepts. Automaton has 9442 states and 30543 transitions. Word has length 47 [2018-12-09 19:20:15,719 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:20:15,719 INFO L480 AbstractCegarLoop]: Abstraction has 9442 states and 30543 transitions. [2018-12-09 19:20:15,719 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-09 19:20:15,719 INFO L276 IsEmpty]: Start isEmpty. Operand 9442 states and 30543 transitions. [2018-12-09 19:20:15,721 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-12-09 19:20:15,721 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:20:15,721 INFO L402 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] [2018-12-09 19:20:15,721 INFO L423 AbstractCegarLoop]: === Iteration 4 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 19:20:15,721 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:20:15,722 INFO L82 PathProgramCache]: Analyzing trace with hash 489356304, now seen corresponding path program 1 times [2018-12-09 19:20:15,722 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 19:20:15,723 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:20:15,723 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:20:15,723 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:20:15,723 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 19:20:15,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:20:15,751 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 19:20:15,751 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 19:20:15,751 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 19:20:15,751 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 19:20:15,751 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 19:20:15,751 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 19:20:15,751 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 19:20:15,752 INFO L87 Difference]: Start difference. First operand 9442 states and 30543 transitions. Second operand 3 states. [2018-12-09 19:20:15,814 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:20:15,814 INFO L93 Difference]: Finished difference Result 13280 states and 42642 transitions. [2018-12-09 19:20:15,814 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 19:20:15,814 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 49 [2018-12-09 19:20:15,815 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:20:15,831 INFO L225 Difference]: With dead ends: 13280 [2018-12-09 19:20:15,831 INFO L226 Difference]: Without dead ends: 13280 [2018-12-09 19:20:15,831 INFO L631 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 [2018-12-09 19:20:15,855 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13280 states. [2018-12-09 19:20:15,948 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13280 to 9846. [2018-12-09 19:20:15,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9846 states. [2018-12-09 19:20:15,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9846 states to 9846 states and 31509 transitions. [2018-12-09 19:20:15,964 INFO L78 Accepts]: Start accepts. Automaton has 9846 states and 31509 transitions. Word has length 49 [2018-12-09 19:20:15,964 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:20:15,964 INFO L480 AbstractCegarLoop]: Abstraction has 9846 states and 31509 transitions. [2018-12-09 19:20:15,965 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 19:20:15,965 INFO L276 IsEmpty]: Start isEmpty. Operand 9846 states and 31509 transitions. [2018-12-09 19:20:15,966 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-12-09 19:20:15,966 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:20:15,966 INFO L402 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] [2018-12-09 19:20:15,966 INFO L423 AbstractCegarLoop]: === Iteration 5 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 19:20:15,966 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:20:15,966 INFO L82 PathProgramCache]: Analyzing trace with hash 35134875, now seen corresponding path program 1 times [2018-12-09 19:20:15,966 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 19:20:15,968 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:20:15,968 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:20:15,968 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:20:15,968 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 19:20:15,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:20:16,014 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 19:20:16,014 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 19:20:16,014 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-09 19:20:16,014 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 19:20:16,014 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-09 19:20:16,014 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-09 19:20:16,014 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-09 19:20:16,015 INFO L87 Difference]: Start difference. First operand 9846 states and 31509 transitions. Second operand 6 states. [2018-12-09 19:20:16,275 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:20:16,275 INFO L93 Difference]: Finished difference Result 14204 states and 45065 transitions. [2018-12-09 19:20:16,276 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-09 19:20:16,276 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 53 [2018-12-09 19:20:16,276 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:20:16,293 INFO L225 Difference]: With dead ends: 14204 [2018-12-09 19:20:16,293 INFO L226 Difference]: Without dead ends: 14132 [2018-12-09 19:20:16,293 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=43, Invalid=113, Unknown=0, NotChecked=0, Total=156 [2018-12-09 19:20:16,315 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14132 states. [2018-12-09 19:20:16,403 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14132 to 10850. [2018-12-09 19:20:16,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10850 states. [2018-12-09 19:20:16,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10850 states to 10850 states and 34564 transitions. [2018-12-09 19:20:16,420 INFO L78 Accepts]: Start accepts. Automaton has 10850 states and 34564 transitions. Word has length 53 [2018-12-09 19:20:16,420 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:20:16,420 INFO L480 AbstractCegarLoop]: Abstraction has 10850 states and 34564 transitions. [2018-12-09 19:20:16,420 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-09 19:20:16,420 INFO L276 IsEmpty]: Start isEmpty. Operand 10850 states and 34564 transitions. [2018-12-09 19:20:16,423 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2018-12-09 19:20:16,423 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:20:16,424 INFO L402 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] [2018-12-09 19:20:16,424 INFO L423 AbstractCegarLoop]: === Iteration 6 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 19:20:16,424 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:20:16,424 INFO L82 PathProgramCache]: Analyzing trace with hash 1993804535, now seen corresponding path program 1 times [2018-12-09 19:20:16,424 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 19:20:16,425 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:20:16,425 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:20:16,425 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:20:16,425 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 19:20:16,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:20:16,464 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 19:20:16,464 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 19:20:16,464 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 19:20:16,464 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 19:20:16,464 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 19:20:16,464 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 19:20:16,464 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 19:20:16,465 INFO L87 Difference]: Start difference. First operand 10850 states and 34564 transitions. Second operand 4 states. [2018-12-09 19:20:16,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:20:16,574 INFO L93 Difference]: Finished difference Result 12397 states and 39573 transitions. [2018-12-09 19:20:16,575 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-09 19:20:16,575 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 61 [2018-12-09 19:20:16,575 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:20:16,589 INFO L225 Difference]: With dead ends: 12397 [2018-12-09 19:20:16,589 INFO L226 Difference]: Without dead ends: 12397 [2018-12-09 19:20:16,589 INFO L631 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 [2018-12-09 19:20:16,610 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12397 states. [2018-12-09 19:20:16,694 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12397 to 11370. [2018-12-09 19:20:16,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11370 states. [2018-12-09 19:20:16,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11370 states to 11370 states and 36237 transitions. [2018-12-09 19:20:16,712 INFO L78 Accepts]: Start accepts. Automaton has 11370 states and 36237 transitions. Word has length 61 [2018-12-09 19:20:16,713 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:20:16,713 INFO L480 AbstractCegarLoop]: Abstraction has 11370 states and 36237 transitions. [2018-12-09 19:20:16,713 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 19:20:16,713 INFO L276 IsEmpty]: Start isEmpty. Operand 11370 states and 36237 transitions. [2018-12-09 19:20:16,717 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2018-12-09 19:20:16,717 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:20:16,717 INFO L402 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] [2018-12-09 19:20:16,717 INFO L423 AbstractCegarLoop]: === Iteration 7 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 19:20:16,717 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:20:16,718 INFO L82 PathProgramCache]: Analyzing trace with hash -558352426, now seen corresponding path program 1 times [2018-12-09 19:20:16,718 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 19:20:16,719 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:20:16,719 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:20:16,719 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:20:16,719 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 19:20:16,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:20:16,757 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 19:20:16,757 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 19:20:16,758 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-09 19:20:16,758 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 19:20:16,758 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-09 19:20:16,758 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-09 19:20:16,758 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-09 19:20:16,758 INFO L87 Difference]: Start difference. First operand 11370 states and 36237 transitions. Second operand 6 states. [2018-12-09 19:20:17,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:20:17,018 INFO L93 Difference]: Finished difference Result 20970 states and 66487 transitions. [2018-12-09 19:20:17,018 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-09 19:20:17,019 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 61 [2018-12-09 19:20:17,019 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:20:17,045 INFO L225 Difference]: With dead ends: 20970 [2018-12-09 19:20:17,045 INFO L226 Difference]: Without dead ends: 20899 [2018-12-09 19:20:17,046 INFO L631 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 [2018-12-09 19:20:17,077 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20899 states. [2018-12-09 19:20:17,215 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20899 to 13756. [2018-12-09 19:20:17,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13756 states. [2018-12-09 19:20:17,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13756 states to 13756 states and 43281 transitions. [2018-12-09 19:20:17,237 INFO L78 Accepts]: Start accepts. Automaton has 13756 states and 43281 transitions. Word has length 61 [2018-12-09 19:20:17,237 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:20:17,237 INFO L480 AbstractCegarLoop]: Abstraction has 13756 states and 43281 transitions. [2018-12-09 19:20:17,237 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-09 19:20:17,237 INFO L276 IsEmpty]: Start isEmpty. Operand 13756 states and 43281 transitions. [2018-12-09 19:20:17,241 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2018-12-09 19:20:17,241 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:20:17,242 INFO L402 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] [2018-12-09 19:20:17,242 INFO L423 AbstractCegarLoop]: === Iteration 8 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 19:20:17,242 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:20:17,242 INFO L82 PathProgramCache]: Analyzing trace with hash -1959879191, now seen corresponding path program 1 times [2018-12-09 19:20:17,242 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 19:20:17,243 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:20:17,243 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:20:17,243 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:20:17,243 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 19:20:17,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:20:17,270 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 19:20:17,270 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 19:20:17,270 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 19:20:17,270 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 19:20:17,270 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 19:20:17,271 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 19:20:17,271 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 19:20:17,271 INFO L87 Difference]: Start difference. First operand 13756 states and 43281 transitions. Second operand 3 states. [2018-12-09 19:20:17,423 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:20:17,423 INFO L93 Difference]: Finished difference Result 14388 states and 44981 transitions. [2018-12-09 19:20:17,423 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 19:20:17,424 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 65 [2018-12-09 19:20:17,424 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:20:17,441 INFO L225 Difference]: With dead ends: 14388 [2018-12-09 19:20:17,441 INFO L226 Difference]: Without dead ends: 14388 [2018-12-09 19:20:17,441 INFO L631 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 [2018-12-09 19:20:17,465 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14388 states. [2018-12-09 19:20:17,585 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14388 to 14072. [2018-12-09 19:20:17,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14072 states. [2018-12-09 19:20:17,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14072 states to 14072 states and 44131 transitions. [2018-12-09 19:20:17,615 INFO L78 Accepts]: Start accepts. Automaton has 14072 states and 44131 transitions. Word has length 65 [2018-12-09 19:20:17,615 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:20:17,615 INFO L480 AbstractCegarLoop]: Abstraction has 14072 states and 44131 transitions. [2018-12-09 19:20:17,615 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 19:20:17,615 INFO L276 IsEmpty]: Start isEmpty. Operand 14072 states and 44131 transitions. [2018-12-09 19:20:17,620 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2018-12-09 19:20:17,620 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:20:17,620 INFO L402 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] [2018-12-09 19:20:17,620 INFO L423 AbstractCegarLoop]: === Iteration 9 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 19:20:17,620 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:20:17,620 INFO L82 PathProgramCache]: Analyzing trace with hash 117330152, now seen corresponding path program 1 times [2018-12-09 19:20:17,620 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 19:20:17,621 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:20:17,622 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:20:17,622 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:20:17,622 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 19:20:17,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:20:17,651 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 19:20:17,651 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 19:20:17,651 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 19:20:17,651 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 19:20:17,651 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 19:20:17,651 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 19:20:17,652 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 19:20:17,652 INFO L87 Difference]: Start difference. First operand 14072 states and 44131 transitions. Second operand 4 states. [2018-12-09 19:20:17,862 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:20:17,862 INFO L93 Difference]: Finished difference Result 17952 states and 55436 transitions. [2018-12-09 19:20:17,862 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 19:20:17,862 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 65 [2018-12-09 19:20:17,863 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:20:17,884 INFO L225 Difference]: With dead ends: 17952 [2018-12-09 19:20:17,884 INFO L226 Difference]: Without dead ends: 17952 [2018-12-09 19:20:17,885 INFO L631 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 [2018-12-09 19:20:17,913 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17952 states. [2018-12-09 19:20:18,098 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17952 to 16110. [2018-12-09 19:20:18,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16110 states. [2018-12-09 19:20:18,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16110 states to 16110 states and 49982 transitions. [2018-12-09 19:20:18,123 INFO L78 Accepts]: Start accepts. Automaton has 16110 states and 49982 transitions. Word has length 65 [2018-12-09 19:20:18,124 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:20:18,124 INFO L480 AbstractCegarLoop]: Abstraction has 16110 states and 49982 transitions. [2018-12-09 19:20:18,124 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 19:20:18,124 INFO L276 IsEmpty]: Start isEmpty. Operand 16110 states and 49982 transitions. [2018-12-09 19:20:18,129 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-12-09 19:20:18,129 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:20:18,129 INFO L402 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] [2018-12-09 19:20:18,129 INFO L423 AbstractCegarLoop]: === Iteration 10 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 19:20:18,130 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:20:18,130 INFO L82 PathProgramCache]: Analyzing trace with hash 1735068466, now seen corresponding path program 1 times [2018-12-09 19:20:18,130 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 19:20:18,131 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:20:18,131 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:20:18,132 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:20:18,132 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 19:20:18,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:20:18,187 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 19:20:18,187 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 19:20:18,187 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-09 19:20:18,187 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 19:20:18,188 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-09 19:20:18,188 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-09 19:20:18,188 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-12-09 19:20:18,188 INFO L87 Difference]: Start difference. First operand 16110 states and 49982 transitions. Second operand 6 states. [2018-12-09 19:20:18,769 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:20:18,769 INFO L93 Difference]: Finished difference Result 19822 states and 60438 transitions. [2018-12-09 19:20:18,770 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-09 19:20:18,770 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 67 [2018-12-09 19:20:18,770 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:20:18,791 INFO L225 Difference]: With dead ends: 19822 [2018-12-09 19:20:18,791 INFO L226 Difference]: Without dead ends: 19822 [2018-12-09 19:20:18,792 INFO L631 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 [2018-12-09 19:20:18,820 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19822 states. [2018-12-09 19:20:18,963 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19822 to 18618. [2018-12-09 19:20:18,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18618 states. [2018-12-09 19:20:18,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18618 states to 18618 states and 57218 transitions. [2018-12-09 19:20:18,992 INFO L78 Accepts]: Start accepts. Automaton has 18618 states and 57218 transitions. Word has length 67 [2018-12-09 19:20:18,992 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:20:18,992 INFO L480 AbstractCegarLoop]: Abstraction has 18618 states and 57218 transitions. [2018-12-09 19:20:18,992 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-09 19:20:18,992 INFO L276 IsEmpty]: Start isEmpty. Operand 18618 states and 57218 transitions. [2018-12-09 19:20:18,999 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-12-09 19:20:18,999 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:20:18,999 INFO L402 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] [2018-12-09 19:20:19,000 INFO L423 AbstractCegarLoop]: === Iteration 11 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 19:20:19,000 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:20:19,000 INFO L82 PathProgramCache]: Analyzing trace with hash -342140877, now seen corresponding path program 1 times [2018-12-09 19:20:19,000 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 19:20:19,001 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:20:19,001 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:20:19,001 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:20:19,001 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 19:20:19,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:20:19,084 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 19:20:19,084 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 19:20:19,085 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-09 19:20:19,085 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 19:20:19,085 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-09 19:20:19,085 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-09 19:20:19,085 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-12-09 19:20:19,085 INFO L87 Difference]: Start difference. First operand 18618 states and 57218 transitions. Second operand 6 states. [2018-12-09 19:20:19,349 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:20:19,349 INFO L93 Difference]: Finished difference Result 21450 states and 63627 transitions. [2018-12-09 19:20:19,349 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-09 19:20:19,349 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 67 [2018-12-09 19:20:19,349 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:20:19,372 INFO L225 Difference]: With dead ends: 21450 [2018-12-09 19:20:19,372 INFO L226 Difference]: Without dead ends: 21450 [2018-12-09 19:20:19,372 INFO L631 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 [2018-12-09 19:20:19,402 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21450 states. [2018-12-09 19:20:19,553 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21450 to 19134. [2018-12-09 19:20:19,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19134 states. [2018-12-09 19:20:19,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19134 states to 19134 states and 57765 transitions. [2018-12-09 19:20:19,582 INFO L78 Accepts]: Start accepts. Automaton has 19134 states and 57765 transitions. Word has length 67 [2018-12-09 19:20:19,583 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:20:19,583 INFO L480 AbstractCegarLoop]: Abstraction has 19134 states and 57765 transitions. [2018-12-09 19:20:19,583 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-09 19:20:19,583 INFO L276 IsEmpty]: Start isEmpty. Operand 19134 states and 57765 transitions. [2018-12-09 19:20:19,590 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-12-09 19:20:19,590 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:20:19,590 INFO L402 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] [2018-12-09 19:20:19,590 INFO L423 AbstractCegarLoop]: === Iteration 12 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 19:20:19,590 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:20:19,590 INFO L82 PathProgramCache]: Analyzing trace with hash -130789964, now seen corresponding path program 1 times [2018-12-09 19:20:19,590 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 19:20:19,591 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:20:19,592 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:20:19,592 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:20:19,592 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 19:20:19,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:20:19,653 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 19:20:19,653 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 19:20:19,653 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-09 19:20:19,653 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 19:20:19,653 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-09 19:20:19,653 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-09 19:20:19,653 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-09 19:20:19,654 INFO L87 Difference]: Start difference. First operand 19134 states and 57765 transitions. Second operand 5 states. [2018-12-09 19:20:19,901 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:20:19,901 INFO L93 Difference]: Finished difference Result 25025 states and 75019 transitions. [2018-12-09 19:20:19,901 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-09 19:20:19,901 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 67 [2018-12-09 19:20:19,901 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:20:19,930 INFO L225 Difference]: With dead ends: 25025 [2018-12-09 19:20:19,930 INFO L226 Difference]: Without dead ends: 25025 [2018-12-09 19:20:19,930 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-12-09 19:20:19,965 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25025 states. [2018-12-09 19:20:20,153 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25025 to 22710. [2018-12-09 19:20:20,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22710 states. [2018-12-09 19:20:20,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22710 states to 22710 states and 68033 transitions. [2018-12-09 19:20:20,189 INFO L78 Accepts]: Start accepts. Automaton has 22710 states and 68033 transitions. Word has length 67 [2018-12-09 19:20:20,189 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:20:20,190 INFO L480 AbstractCegarLoop]: Abstraction has 22710 states and 68033 transitions. [2018-12-09 19:20:20,190 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-09 19:20:20,190 INFO L276 IsEmpty]: Start isEmpty. Operand 22710 states and 68033 transitions. [2018-12-09 19:20:20,197 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-12-09 19:20:20,198 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:20:20,198 INFO L402 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] [2018-12-09 19:20:20,198 INFO L423 AbstractCegarLoop]: === Iteration 13 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 19:20:20,198 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:20:20,198 INFO L82 PathProgramCache]: Analyzing trace with hash -641324141, now seen corresponding path program 1 times [2018-12-09 19:20:20,198 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 19:20:20,200 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:20:20,200 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:20:20,200 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:20:20,200 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 19:20:20,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:20:20,247 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 19:20:20,247 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 19:20:20,248 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-09 19:20:20,248 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 19:20:20,248 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-09 19:20:20,248 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-09 19:20:20,248 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-09 19:20:20,248 INFO L87 Difference]: Start difference. First operand 22710 states and 68033 transitions. Second operand 5 states. [2018-12-09 19:20:20,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:20:20,581 INFO L93 Difference]: Finished difference Result 31960 states and 94872 transitions. [2018-12-09 19:20:20,581 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-09 19:20:20,581 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 67 [2018-12-09 19:20:20,581 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:20:20,615 INFO L225 Difference]: With dead ends: 31960 [2018-12-09 19:20:20,616 INFO L226 Difference]: Without dead ends: 31960 [2018-12-09 19:20:20,616 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-12-09 19:20:20,655 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31960 states. [2018-12-09 19:20:20,905 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31960 to 28240. [2018-12-09 19:20:20,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28240 states. [2018-12-09 19:20:20,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28240 states to 28240 states and 84260 transitions. [2018-12-09 19:20:20,951 INFO L78 Accepts]: Start accepts. Automaton has 28240 states and 84260 transitions. Word has length 67 [2018-12-09 19:20:20,951 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:20:20,951 INFO L480 AbstractCegarLoop]: Abstraction has 28240 states and 84260 transitions. [2018-12-09 19:20:20,951 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-09 19:20:20,951 INFO L276 IsEmpty]: Start isEmpty. Operand 28240 states and 84260 transitions. [2018-12-09 19:20:20,960 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-12-09 19:20:20,960 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:20:20,960 INFO L402 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] [2018-12-09 19:20:20,960 INFO L423 AbstractCegarLoop]: === Iteration 14 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 19:20:20,960 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:20:20,961 INFO L82 PathProgramCache]: Analyzing trace with hash 1846188692, now seen corresponding path program 1 times [2018-12-09 19:20:20,961 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 19:20:20,962 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:20:20,962 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:20:20,962 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:20:20,962 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 19:20:20,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:20:20,988 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 19:20:20,988 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 19:20:20,988 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-09 19:20:20,989 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 19:20:20,989 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-09 19:20:20,989 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-09 19:20:20,989 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-12-09 19:20:20,989 INFO L87 Difference]: Start difference. First operand 28240 states and 84260 transitions. Second operand 5 states. [2018-12-09 19:20:21,048 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:20:21,048 INFO L93 Difference]: Finished difference Result 9044 states and 21835 transitions. [2018-12-09 19:20:21,048 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-09 19:20:21,048 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 67 [2018-12-09 19:20:21,048 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:20:21,053 INFO L225 Difference]: With dead ends: 9044 [2018-12-09 19:20:21,054 INFO L226 Difference]: Without dead ends: 7192 [2018-12-09 19:20:21,054 INFO L631 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 [2018-12-09 19:20:21,060 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7192 states. [2018-12-09 19:20:21,097 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7192 to 6089. [2018-12-09 19:20:21,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6089 states. [2018-12-09 19:20:21,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6089 states to 6089 states and 14306 transitions. [2018-12-09 19:20:21,104 INFO L78 Accepts]: Start accepts. Automaton has 6089 states and 14306 transitions. Word has length 67 [2018-12-09 19:20:21,104 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:20:21,104 INFO L480 AbstractCegarLoop]: Abstraction has 6089 states and 14306 transitions. [2018-12-09 19:20:21,104 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-09 19:20:21,104 INFO L276 IsEmpty]: Start isEmpty. Operand 6089 states and 14306 transitions. [2018-12-09 19:20:21,108 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-12-09 19:20:21,109 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:20:21,109 INFO L402 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] [2018-12-09 19:20:21,109 INFO L423 AbstractCegarLoop]: === Iteration 15 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 19:20:21,109 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:20:21,109 INFO L82 PathProgramCache]: Analyzing trace with hash -1392892313, now seen corresponding path program 1 times [2018-12-09 19:20:21,109 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 19:20:21,111 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:20:21,111 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:20:21,111 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:20:21,111 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 19:20:21,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:20:21,127 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 19:20:21,127 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 19:20:21,127 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 19:20:21,127 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 19:20:21,127 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 19:20:21,127 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 19:20:21,127 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 19:20:21,128 INFO L87 Difference]: Start difference. First operand 6089 states and 14306 transitions. Second operand 3 states. [2018-12-09 19:20:21,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:20:21,150 INFO L93 Difference]: Finished difference Result 8276 states and 19333 transitions. [2018-12-09 19:20:21,150 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 19:20:21,150 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 67 [2018-12-09 19:20:21,150 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:20:21,155 INFO L225 Difference]: With dead ends: 8276 [2018-12-09 19:20:21,155 INFO L226 Difference]: Without dead ends: 8276 [2018-12-09 19:20:21,156 INFO L631 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 [2018-12-09 19:20:21,163 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8276 states. [2018-12-09 19:20:21,212 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8276 to 6028. [2018-12-09 19:20:21,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6028 states. [2018-12-09 19:20:21,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6028 states to 6028 states and 13846 transitions. [2018-12-09 19:20:21,221 INFO L78 Accepts]: Start accepts. Automaton has 6028 states and 13846 transitions. Word has length 67 [2018-12-09 19:20:21,221 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:20:21,222 INFO L480 AbstractCegarLoop]: Abstraction has 6028 states and 13846 transitions. [2018-12-09 19:20:21,222 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 19:20:21,222 INFO L276 IsEmpty]: Start isEmpty. Operand 6028 states and 13846 transitions. [2018-12-09 19:20:21,228 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2018-12-09 19:20:21,228 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:20:21,228 INFO L402 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] [2018-12-09 19:20:21,228 INFO L423 AbstractCegarLoop]: === Iteration 16 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 19:20:21,228 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:20:21,228 INFO L82 PathProgramCache]: Analyzing trace with hash 1912290010, now seen corresponding path program 1 times [2018-12-09 19:20:21,228 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 19:20:21,230 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:20:21,230 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:20:21,230 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:20:21,230 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 19:20:21,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:20:21,281 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 19:20:21,281 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 19:20:21,281 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-09 19:20:21,281 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 19:20:21,281 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-09 19:20:21,282 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-09 19:20:21,282 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-09 19:20:21,282 INFO L87 Difference]: Start difference. First operand 6028 states and 13846 transitions. Second operand 5 states. [2018-12-09 19:20:21,384 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:20:21,385 INFO L93 Difference]: Finished difference Result 7198 states and 16487 transitions. [2018-12-09 19:20:21,385 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-09 19:20:21,385 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 73 [2018-12-09 19:20:21,385 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:20:21,390 INFO L225 Difference]: With dead ends: 7198 [2018-12-09 19:20:21,390 INFO L226 Difference]: Without dead ends: 7198 [2018-12-09 19:20:21,390 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-12-09 19:20:21,397 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7198 states. [2018-12-09 19:20:21,437 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7198 to 6472. [2018-12-09 19:20:21,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6472 states. [2018-12-09 19:20:21,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6472 states to 6472 states and 14850 transitions. [2018-12-09 19:20:21,446 INFO L78 Accepts]: Start accepts. Automaton has 6472 states and 14850 transitions. Word has length 73 [2018-12-09 19:20:21,446 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:20:21,447 INFO L480 AbstractCegarLoop]: Abstraction has 6472 states and 14850 transitions. [2018-12-09 19:20:21,447 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-09 19:20:21,447 INFO L276 IsEmpty]: Start isEmpty. Operand 6472 states and 14850 transitions. [2018-12-09 19:20:21,452 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2018-12-09 19:20:21,452 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:20:21,452 INFO L402 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] [2018-12-09 19:20:21,453 INFO L423 AbstractCegarLoop]: === Iteration 17 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 19:20:21,453 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:20:21,453 INFO L82 PathProgramCache]: Analyzing trace with hash -639866951, now seen corresponding path program 1 times [2018-12-09 19:20:21,453 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 19:20:21,454 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:20:21,454 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:20:21,454 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:20:21,454 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 19:20:21,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:20:21,500 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 19:20:21,500 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 19:20:21,500 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-09 19:20:21,500 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 19:20:21,500 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-09 19:20:21,500 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-09 19:20:21,500 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-12-09 19:20:21,501 INFO L87 Difference]: Start difference. First operand 6472 states and 14850 transitions. Second operand 7 states. [2018-12-09 19:20:21,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:20:21,730 INFO L93 Difference]: Finished difference Result 7545 states and 17112 transitions. [2018-12-09 19:20:21,730 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-12-09 19:20:21,731 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 73 [2018-12-09 19:20:21,731 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:20:21,735 INFO L225 Difference]: With dead ends: 7545 [2018-12-09 19:20:21,735 INFO L226 Difference]: Without dead ends: 7426 [2018-12-09 19:20:21,735 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=61, Invalid=211, Unknown=0, NotChecked=0, Total=272 [2018-12-09 19:20:21,741 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7426 states. [2018-12-09 19:20:21,776 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7426 to 6569. [2018-12-09 19:20:21,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6569 states. [2018-12-09 19:20:21,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6569 states to 6569 states and 14943 transitions. [2018-12-09 19:20:21,783 INFO L78 Accepts]: Start accepts. Automaton has 6569 states and 14943 transitions. Word has length 73 [2018-12-09 19:20:21,783 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:20:21,783 INFO L480 AbstractCegarLoop]: Abstraction has 6569 states and 14943 transitions. [2018-12-09 19:20:21,783 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-09 19:20:21,783 INFO L276 IsEmpty]: Start isEmpty. Operand 6569 states and 14943 transitions. [2018-12-09 19:20:21,788 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2018-12-09 19:20:21,788 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:20:21,788 INFO L402 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] [2018-12-09 19:20:21,789 INFO L423 AbstractCegarLoop]: === Iteration 18 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 19:20:21,789 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:20:21,789 INFO L82 PathProgramCache]: Analyzing trace with hash -1914844155, now seen corresponding path program 1 times [2018-12-09 19:20:21,789 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 19:20:21,790 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:20:21,790 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:20:21,790 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:20:21,790 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 19:20:21,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:20:21,818 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 19:20:21,818 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 19:20:21,819 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 19:20:21,819 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 19:20:21,819 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 19:20:21,819 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 19:20:21,819 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-09 19:20:21,819 INFO L87 Difference]: Start difference. First operand 6569 states and 14943 transitions. Second operand 4 states. [2018-12-09 19:20:21,976 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:20:21,976 INFO L93 Difference]: Finished difference Result 10256 states and 23214 transitions. [2018-12-09 19:20:21,976 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 19:20:21,976 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 92 [2018-12-09 19:20:21,976 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:20:21,983 INFO L225 Difference]: With dead ends: 10256 [2018-12-09 19:20:21,983 INFO L226 Difference]: Without dead ends: 10256 [2018-12-09 19:20:21,983 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-09 19:20:21,990 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10256 states. [2018-12-09 19:20:22,038 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10256 to 7689. [2018-12-09 19:20:22,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7689 states. [2018-12-09 19:20:22,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7689 states to 7689 states and 17277 transitions. [2018-12-09 19:20:22,047 INFO L78 Accepts]: Start accepts. Automaton has 7689 states and 17277 transitions. Word has length 92 [2018-12-09 19:20:22,047 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:20:22,047 INFO L480 AbstractCegarLoop]: Abstraction has 7689 states and 17277 transitions. [2018-12-09 19:20:22,047 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 19:20:22,047 INFO L276 IsEmpty]: Start isEmpty. Operand 7689 states and 17277 transitions. [2018-12-09 19:20:22,053 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2018-12-09 19:20:22,053 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:20:22,053 INFO L402 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] [2018-12-09 19:20:22,053 INFO L423 AbstractCegarLoop]: === Iteration 19 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 19:20:22,053 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:20:22,053 INFO L82 PathProgramCache]: Analyzing trace with hash -1127474233, now seen corresponding path program 2 times [2018-12-09 19:20:22,053 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 19:20:22,054 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:20:22,054 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:20:22,054 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:20:22,054 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 19:20:22,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:20:22,093 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 19:20:22,093 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 19:20:22,093 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 19:20:22,093 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 19:20:22,094 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 19:20:22,094 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 19:20:22,094 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 19:20:22,094 INFO L87 Difference]: Start difference. First operand 7689 states and 17277 transitions. Second operand 4 states. [2018-12-09 19:20:22,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:20:22,157 INFO L93 Difference]: Finished difference Result 8254 states and 18570 transitions. [2018-12-09 19:20:22,157 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 19:20:22,157 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 92 [2018-12-09 19:20:22,158 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:20:22,163 INFO L225 Difference]: With dead ends: 8254 [2018-12-09 19:20:22,163 INFO L226 Difference]: Without dead ends: 8254 [2018-12-09 19:20:22,163 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-09 19:20:22,169 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8254 states. [2018-12-09 19:20:22,211 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8254 to 7595. [2018-12-09 19:20:22,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7595 states. [2018-12-09 19:20:22,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7595 states to 7595 states and 17172 transitions. [2018-12-09 19:20:22,220 INFO L78 Accepts]: Start accepts. Automaton has 7595 states and 17172 transitions. Word has length 92 [2018-12-09 19:20:22,220 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:20:22,220 INFO L480 AbstractCegarLoop]: Abstraction has 7595 states and 17172 transitions. [2018-12-09 19:20:22,220 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 19:20:22,220 INFO L276 IsEmpty]: Start isEmpty. Operand 7595 states and 17172 transitions. [2018-12-09 19:20:22,226 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-12-09 19:20:22,226 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:20:22,226 INFO L402 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] [2018-12-09 19:20:22,226 INFO L423 AbstractCegarLoop]: === Iteration 20 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 19:20:22,226 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:20:22,226 INFO L82 PathProgramCache]: Analyzing trace with hash 879761931, now seen corresponding path program 1 times [2018-12-09 19:20:22,227 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 19:20:22,228 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:20:22,228 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 19:20:22,228 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:20:22,228 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 19:20:22,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:20:22,285 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 19:20:22,285 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 19:20:22,285 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-09 19:20:22,285 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 19:20:22,285 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-09 19:20:22,285 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-09 19:20:22,286 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2018-12-09 19:20:22,286 INFO L87 Difference]: Start difference. First operand 7595 states and 17172 transitions. Second operand 7 states. [2018-12-09 19:20:22,639 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:20:22,640 INFO L93 Difference]: Finished difference Result 9369 states and 21120 transitions. [2018-12-09 19:20:22,640 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-09 19:20:22,640 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 94 [2018-12-09 19:20:22,640 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:20:22,646 INFO L225 Difference]: With dead ends: 9369 [2018-12-09 19:20:22,646 INFO L226 Difference]: Without dead ends: 9369 [2018-12-09 19:20:22,646 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2018-12-09 19:20:22,653 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9369 states. [2018-12-09 19:20:22,697 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9369 to 7707. [2018-12-09 19:20:22,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7707 states. [2018-12-09 19:20:22,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7707 states to 7707 states and 17492 transitions. [2018-12-09 19:20:22,706 INFO L78 Accepts]: Start accepts. Automaton has 7707 states and 17492 transitions. Word has length 94 [2018-12-09 19:20:22,706 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:20:22,706 INFO L480 AbstractCegarLoop]: Abstraction has 7707 states and 17492 transitions. [2018-12-09 19:20:22,706 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-09 19:20:22,706 INFO L276 IsEmpty]: Start isEmpty. Operand 7707 states and 17492 transitions. [2018-12-09 19:20:22,711 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-12-09 19:20:22,712 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:20:22,712 INFO L402 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] [2018-12-09 19:20:22,712 INFO L423 AbstractCegarLoop]: === Iteration 21 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 19:20:22,712 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:20:22,712 INFO L82 PathProgramCache]: Analyzing trace with hash 45519536, now seen corresponding path program 1 times [2018-12-09 19:20:22,712 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 19:20:22,713 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:20:22,713 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:20:22,714 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:20:22,714 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 19:20:22,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:20:22,755 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 19:20:22,755 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 19:20:22,755 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-09 19:20:22,755 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 19:20:22,756 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-09 19:20:22,756 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-09 19:20:22,756 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-09 19:20:22,756 INFO L87 Difference]: Start difference. First operand 7707 states and 17492 transitions. Second operand 5 states. [2018-12-09 19:20:22,827 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:20:22,827 INFO L93 Difference]: Finished difference Result 8614 states and 19450 transitions. [2018-12-09 19:20:22,827 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-09 19:20:22,827 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 94 [2018-12-09 19:20:22,828 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:20:22,833 INFO L225 Difference]: With dead ends: 8614 [2018-12-09 19:20:22,833 INFO L226 Difference]: Without dead ends: 8614 [2018-12-09 19:20:22,833 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-12-09 19:20:22,839 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8614 states. [2018-12-09 19:20:22,878 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8614 to 6603. [2018-12-09 19:20:22,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6603 states. [2018-12-09 19:20:22,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6603 states to 6603 states and 15011 transitions. [2018-12-09 19:20:22,885 INFO L78 Accepts]: Start accepts. Automaton has 6603 states and 15011 transitions. Word has length 94 [2018-12-09 19:20:22,885 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:20:22,885 INFO L480 AbstractCegarLoop]: Abstraction has 6603 states and 15011 transitions. [2018-12-09 19:20:22,886 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-09 19:20:22,886 INFO L276 IsEmpty]: Start isEmpty. Operand 6603 states and 15011 transitions. [2018-12-09 19:20:22,890 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-12-09 19:20:22,890 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:20:22,890 INFO L402 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] [2018-12-09 19:20:22,891 INFO L423 AbstractCegarLoop]: === Iteration 22 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 19:20:22,891 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:20:22,891 INFO L82 PathProgramCache]: Analyzing trace with hash -209217009, now seen corresponding path program 1 times [2018-12-09 19:20:22,891 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 19:20:22,892 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:20:22,892 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:20:22,892 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:20:22,892 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 19:20:22,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:20:22,922 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 19:20:22,922 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 19:20:22,922 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-09 19:20:22,922 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 19:20:22,922 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-09 19:20:22,922 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-09 19:20:22,922 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-09 19:20:22,922 INFO L87 Difference]: Start difference. First operand 6603 states and 15011 transitions. Second operand 5 states. [2018-12-09 19:20:23,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:20:23,170 INFO L93 Difference]: Finished difference Result 10737 states and 24548 transitions. [2018-12-09 19:20:23,171 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-09 19:20:23,171 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 94 [2018-12-09 19:20:23,171 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:20:23,177 INFO L225 Difference]: With dead ends: 10737 [2018-12-09 19:20:23,177 INFO L226 Difference]: Without dead ends: 10659 [2018-12-09 19:20:23,177 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-12-09 19:20:23,185 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10659 states. [2018-12-09 19:20:23,235 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10659 to 7744. [2018-12-09 19:20:23,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7744 states. [2018-12-09 19:20:23,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7744 states to 7744 states and 17658 transitions. [2018-12-09 19:20:23,243 INFO L78 Accepts]: Start accepts. Automaton has 7744 states and 17658 transitions. Word has length 94 [2018-12-09 19:20:23,243 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:20:23,243 INFO L480 AbstractCegarLoop]: Abstraction has 7744 states and 17658 transitions. [2018-12-09 19:20:23,243 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-09 19:20:23,244 INFO L276 IsEmpty]: Start isEmpty. Operand 7744 states and 17658 transitions. [2018-12-09 19:20:23,249 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-12-09 19:20:23,249 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:20:23,249 INFO L402 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] [2018-12-09 19:20:23,249 INFO L423 AbstractCegarLoop]: === Iteration 23 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 19:20:23,249 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:20:23,249 INFO L82 PathProgramCache]: Analyzing trace with hash 1035547472, now seen corresponding path program 1 times [2018-12-09 19:20:23,250 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 19:20:23,250 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:20:23,251 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:20:23,251 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:20:23,251 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 19:20:23,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:20:23,302 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 19:20:23,302 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 19:20:23,302 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-09 19:20:23,302 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 19:20:23,303 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-09 19:20:23,303 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-09 19:20:23,303 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-09 19:20:23,303 INFO L87 Difference]: Start difference. First operand 7744 states and 17658 transitions. Second operand 6 states. [2018-12-09 19:20:23,488 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:20:23,488 INFO L93 Difference]: Finished difference Result 9751 states and 22060 transitions. [2018-12-09 19:20:23,488 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-09 19:20:23,488 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 94 [2018-12-09 19:20:23,488 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:20:23,494 INFO L225 Difference]: With dead ends: 9751 [2018-12-09 19:20:23,494 INFO L226 Difference]: Without dead ends: 9672 [2018-12-09 19:20:23,494 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2018-12-09 19:20:23,502 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9672 states. [2018-12-09 19:20:23,550 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9672 to 7343. [2018-12-09 19:20:23,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7343 states. [2018-12-09 19:20:23,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7343 states to 7343 states and 16768 transitions. [2018-12-09 19:20:23,558 INFO L78 Accepts]: Start accepts. Automaton has 7343 states and 16768 transitions. Word has length 94 [2018-12-09 19:20:23,558 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:20:23,558 INFO L480 AbstractCegarLoop]: Abstraction has 7343 states and 16768 transitions. [2018-12-09 19:20:23,558 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-09 19:20:23,558 INFO L276 IsEmpty]: Start isEmpty. Operand 7343 states and 16768 transitions. [2018-12-09 19:20:23,564 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-12-09 19:20:23,564 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:20:23,565 INFO L402 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] [2018-12-09 19:20:23,565 INFO L423 AbstractCegarLoop]: === Iteration 24 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 19:20:23,565 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:20:23,565 INFO L82 PathProgramCache]: Analyzing trace with hash -202429449, now seen corresponding path program 1 times [2018-12-09 19:20:23,565 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 19:20:23,566 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:20:23,567 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:20:23,567 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:20:23,567 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 19:20:23,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:20:23,663 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 19:20:23,663 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 19:20:23,663 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-12-09 19:20:23,663 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 19:20:23,663 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-09 19:20:23,664 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-09 19:20:23,664 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2018-12-09 19:20:23,664 INFO L87 Difference]: Start difference. First operand 7343 states and 16768 transitions. Second operand 9 states. [2018-12-09 19:20:24,027 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:20:24,027 INFO L93 Difference]: Finished difference Result 10375 states and 23670 transitions. [2018-12-09 19:20:24,027 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-12-09 19:20:24,027 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 94 [2018-12-09 19:20:24,027 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:20:24,033 INFO L225 Difference]: With dead ends: 10375 [2018-12-09 19:20:24,033 INFO L226 Difference]: Without dead ends: 10343 [2018-12-09 19:20:24,034 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=61, Invalid=245, Unknown=0, NotChecked=0, Total=306 [2018-12-09 19:20:24,042 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10343 states. [2018-12-09 19:20:24,094 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10343 to 9164. [2018-12-09 19:20:24,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9164 states. [2018-12-09 19:20:24,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9164 states to 9164 states and 20930 transitions. [2018-12-09 19:20:24,102 INFO L78 Accepts]: Start accepts. Automaton has 9164 states and 20930 transitions. Word has length 94 [2018-12-09 19:20:24,103 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:20:24,103 INFO L480 AbstractCegarLoop]: Abstraction has 9164 states and 20930 transitions. [2018-12-09 19:20:24,103 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-09 19:20:24,103 INFO L276 IsEmpty]: Start isEmpty. Operand 9164 states and 20930 transitions. [2018-12-09 19:20:24,108 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-12-09 19:20:24,108 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:20:24,108 INFO L402 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] [2018-12-09 19:20:24,108 INFO L423 AbstractCegarLoop]: === Iteration 25 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 19:20:24,108 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:20:24,108 INFO L82 PathProgramCache]: Analyzing trace with hash -1999380808, now seen corresponding path program 1 times [2018-12-09 19:20:24,109 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 19:20:24,109 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:20:24,109 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:20:24,109 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:20:24,109 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 19:20:24,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:20:24,182 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 19:20:24,182 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 19:20:24,182 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-12-09 19:20:24,182 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 19:20:24,182 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-09 19:20:24,183 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-09 19:20:24,183 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-12-09 19:20:24,183 INFO L87 Difference]: Start difference. First operand 9164 states and 20930 transitions. Second operand 8 states. [2018-12-09 19:20:24,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:20:24,454 INFO L93 Difference]: Finished difference Result 14572 states and 33838 transitions. [2018-12-09 19:20:24,454 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-12-09 19:20:24,454 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 94 [2018-12-09 19:20:24,455 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:20:24,464 INFO L225 Difference]: With dead ends: 14572 [2018-12-09 19:20:24,464 INFO L226 Difference]: Without dead ends: 14572 [2018-12-09 19:20:24,465 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=51, Invalid=159, Unknown=0, NotChecked=0, Total=210 [2018-12-09 19:20:24,476 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14572 states. [2018-12-09 19:20:24,552 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14572 to 9802. [2018-12-09 19:20:24,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9802 states. [2018-12-09 19:20:24,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9802 states to 9802 states and 22597 transitions. [2018-12-09 19:20:24,563 INFO L78 Accepts]: Start accepts. Automaton has 9802 states and 22597 transitions. Word has length 94 [2018-12-09 19:20:24,563 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:20:24,564 INFO L480 AbstractCegarLoop]: Abstraction has 9802 states and 22597 transitions. [2018-12-09 19:20:24,564 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-09 19:20:24,564 INFO L276 IsEmpty]: Start isEmpty. Operand 9802 states and 22597 transitions. [2018-12-09 19:20:24,570 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-12-09 19:20:24,571 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:20:24,571 INFO L402 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] [2018-12-09 19:20:24,571 INFO L423 AbstractCegarLoop]: === Iteration 26 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 19:20:24,571 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:20:24,571 INFO L82 PathProgramCache]: Analyzing trace with hash -1111877127, now seen corresponding path program 1 times [2018-12-09 19:20:24,571 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 19:20:24,572 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:20:24,572 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:20:24,572 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:20:24,572 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 19:20:24,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:20:24,658 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 19:20:24,658 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 19:20:24,658 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-09 19:20:24,659 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 19:20:24,659 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-09 19:20:24,659 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-09 19:20:24,659 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-12-09 19:20:24,659 INFO L87 Difference]: Start difference. First operand 9802 states and 22597 transitions. Second operand 7 states. [2018-12-09 19:20:24,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:20:24,784 INFO L93 Difference]: Finished difference Result 13733 states and 31919 transitions. [2018-12-09 19:20:24,784 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-09 19:20:24,784 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 94 [2018-12-09 19:20:24,784 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:20:24,793 INFO L225 Difference]: With dead ends: 13733 [2018-12-09 19:20:24,794 INFO L226 Difference]: Without dead ends: 13733 [2018-12-09 19:20:24,794 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 3 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2018-12-09 19:20:24,804 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13733 states. [2018-12-09 19:20:24,870 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13733 to 9882. [2018-12-09 19:20:24,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9882 states. [2018-12-09 19:20:24,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9882 states to 9882 states and 22528 transitions. [2018-12-09 19:20:24,881 INFO L78 Accepts]: Start accepts. Automaton has 9882 states and 22528 transitions. Word has length 94 [2018-12-09 19:20:24,881 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:20:24,881 INFO L480 AbstractCegarLoop]: Abstraction has 9882 states and 22528 transitions. [2018-12-09 19:20:24,881 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-09 19:20:24,881 INFO L276 IsEmpty]: Start isEmpty. Operand 9882 states and 22528 transitions. [2018-12-09 19:20:24,887 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-12-09 19:20:24,888 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:20:24,888 INFO L402 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] [2018-12-09 19:20:24,888 INFO L423 AbstractCegarLoop]: === Iteration 27 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 19:20:24,888 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:20:24,888 INFO L82 PathProgramCache]: Analyzing trace with hash 1451114617, now seen corresponding path program 1 times [2018-12-09 19:20:24,888 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 19:20:24,889 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:20:24,889 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:20:24,889 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:20:24,889 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 19:20:24,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:20:24,959 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 19:20:24,960 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 19:20:24,960 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-09 19:20:24,960 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 19:20:24,960 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-09 19:20:24,960 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-09 19:20:24,960 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-12-09 19:20:24,960 INFO L87 Difference]: Start difference. First operand 9882 states and 22528 transitions. Second operand 6 states. [2018-12-09 19:20:25,042 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:20:25,042 INFO L93 Difference]: Finished difference Result 9610 states and 21576 transitions. [2018-12-09 19:20:25,042 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-09 19:20:25,043 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 94 [2018-12-09 19:20:25,043 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:20:25,049 INFO L225 Difference]: With dead ends: 9610 [2018-12-09 19:20:25,049 INFO L226 Difference]: Without dead ends: 9610 [2018-12-09 19:20:25,049 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2018-12-09 19:20:25,056 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9610 states. [2018-12-09 19:20:25,101 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9610 to 5823. [2018-12-09 19:20:25,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5823 states. [2018-12-09 19:20:25,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5823 states to 5823 states and 13050 transitions. [2018-12-09 19:20:25,106 INFO L78 Accepts]: Start accepts. Automaton has 5823 states and 13050 transitions. Word has length 94 [2018-12-09 19:20:25,107 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:20:25,107 INFO L480 AbstractCegarLoop]: Abstraction has 5823 states and 13050 transitions. [2018-12-09 19:20:25,107 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-09 19:20:25,107 INFO L276 IsEmpty]: Start isEmpty. Operand 5823 states and 13050 transitions. [2018-12-09 19:20:25,110 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2018-12-09 19:20:25,110 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:20:25,110 INFO L402 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, 1] [2018-12-09 19:20:25,111 INFO L423 AbstractCegarLoop]: === Iteration 28 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 19:20:25,111 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:20:25,111 INFO L82 PathProgramCache]: Analyzing trace with hash 322215098, now seen corresponding path program 1 times [2018-12-09 19:20:25,111 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 19:20:25,111 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:20:25,111 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:20:25,112 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:20:25,112 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 19:20:25,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:20:25,198 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 19:20:25,198 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 19:20:25,198 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-12-09 19:20:25,198 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 19:20:25,198 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-09 19:20:25,198 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-09 19:20:25,198 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2018-12-09 19:20:25,198 INFO L87 Difference]: Start difference. First operand 5823 states and 13050 transitions. Second operand 9 states. [2018-12-09 19:20:25,452 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:20:25,452 INFO L93 Difference]: Finished difference Result 6968 states and 15490 transitions. [2018-12-09 19:20:25,452 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-12-09 19:20:25,452 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 96 [2018-12-09 19:20:25,452 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:20:25,456 INFO L225 Difference]: With dead ends: 6968 [2018-12-09 19:20:25,457 INFO L226 Difference]: Without dead ends: 6968 [2018-12-09 19:20:25,457 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 4 SyntacticMatches, 3 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=115, Invalid=305, Unknown=0, NotChecked=0, Total=420 [2018-12-09 19:20:25,462 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6968 states. [2018-12-09 19:20:25,499 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6968 to 6729. [2018-12-09 19:20:25,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6729 states. [2018-12-09 19:20:25,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6729 states to 6729 states and 15021 transitions. [2018-12-09 19:20:25,505 INFO L78 Accepts]: Start accepts. Automaton has 6729 states and 15021 transitions. Word has length 96 [2018-12-09 19:20:25,505 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:20:25,505 INFO L480 AbstractCegarLoop]: Abstraction has 6729 states and 15021 transitions. [2018-12-09 19:20:25,505 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-09 19:20:25,506 INFO L276 IsEmpty]: Start isEmpty. Operand 6729 states and 15021 transitions. [2018-12-09 19:20:25,510 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2018-12-09 19:20:25,510 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:20:25,510 INFO L402 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, 1] [2018-12-09 19:20:25,510 INFO L423 AbstractCegarLoop]: === Iteration 29 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 19:20:25,510 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:20:25,510 INFO L82 PathProgramCache]: Analyzing trace with hash 1209718779, now seen corresponding path program 1 times [2018-12-09 19:20:25,510 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 19:20:25,511 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:20:25,511 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:20:25,511 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:20:25,511 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 19:20:25,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:20:25,605 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 19:20:25,605 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 19:20:25,605 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-12-09 19:20:25,605 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 19:20:25,606 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-09 19:20:25,606 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-09 19:20:25,606 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2018-12-09 19:20:25,606 INFO L87 Difference]: Start difference. First operand 6729 states and 15021 transitions. Second operand 11 states. [2018-12-09 19:20:26,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:20:26,368 INFO L93 Difference]: Finished difference Result 12990 states and 29183 transitions. [2018-12-09 19:20:26,368 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-12-09 19:20:26,368 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 96 [2018-12-09 19:20:26,369 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:20:26,374 INFO L225 Difference]: With dead ends: 12990 [2018-12-09 19:20:26,374 INFO L226 Difference]: Without dead ends: 8864 [2018-12-09 19:20:26,374 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=86, Invalid=376, Unknown=0, NotChecked=0, Total=462 [2018-12-09 19:20:26,381 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8864 states. [2018-12-09 19:20:26,421 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8864 to 6572. [2018-12-09 19:20:26,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6572 states. [2018-12-09 19:20:26,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6572 states to 6572 states and 14628 transitions. [2018-12-09 19:20:26,427 INFO L78 Accepts]: Start accepts. Automaton has 6572 states and 14628 transitions. Word has length 96 [2018-12-09 19:20:26,427 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:20:26,427 INFO L480 AbstractCegarLoop]: Abstraction has 6572 states and 14628 transitions. [2018-12-09 19:20:26,427 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-09 19:20:26,427 INFO L276 IsEmpty]: Start isEmpty. Operand 6572 states and 14628 transitions. [2018-12-09 19:20:26,431 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2018-12-09 19:20:26,431 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:20:26,431 INFO L402 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, 1] [2018-12-09 19:20:26,431 INFO L423 AbstractCegarLoop]: === Iteration 30 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 19:20:26,431 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:20:26,431 INFO L82 PathProgramCache]: Analyzing trace with hash -1847691802, now seen corresponding path program 1 times [2018-12-09 19:20:26,431 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 19:20:26,432 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:20:26,432 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:20:26,432 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:20:26,432 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 19:20:26,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:20:26,475 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 19:20:26,475 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 19:20:26,475 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-09 19:20:26,475 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 19:20:26,475 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-09 19:20:26,476 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-09 19:20:26,476 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-12-09 19:20:26,476 INFO L87 Difference]: Start difference. First operand 6572 states and 14628 transitions. Second operand 5 states. [2018-12-09 19:20:26,620 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:20:26,620 INFO L93 Difference]: Finished difference Result 5952 states and 13080 transitions. [2018-12-09 19:20:26,620 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-09 19:20:26,620 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 96 [2018-12-09 19:20:26,620 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:20:26,624 INFO L225 Difference]: With dead ends: 5952 [2018-12-09 19:20:26,624 INFO L226 Difference]: Without dead ends: 5931 [2018-12-09 19:20:26,624 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-12-09 19:20:26,630 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5931 states. [2018-12-09 19:20:26,666 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5931 to 5552. [2018-12-09 19:20:26,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5552 states. [2018-12-09 19:20:26,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5552 states to 5552 states and 12239 transitions. [2018-12-09 19:20:26,672 INFO L78 Accepts]: Start accepts. Automaton has 5552 states and 12239 transitions. Word has length 96 [2018-12-09 19:20:26,673 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:20:26,673 INFO L480 AbstractCegarLoop]: Abstraction has 5552 states and 12239 transitions. [2018-12-09 19:20:26,673 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-09 19:20:26,673 INFO L276 IsEmpty]: Start isEmpty. Operand 5552 states and 12239 transitions. [2018-12-09 19:20:26,677 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2018-12-09 19:20:26,677 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:20:26,677 INFO L402 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, 1] [2018-12-09 19:20:26,677 INFO L423 AbstractCegarLoop]: === Iteration 31 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 19:20:26,678 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:20:26,678 INFO L82 PathProgramCache]: Analyzing trace with hash -157130344, now seen corresponding path program 2 times [2018-12-09 19:20:26,678 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 19:20:26,679 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:20:26,679 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:20:26,679 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:20:26,679 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 19:20:26,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:20:26,741 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 19:20:26,742 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 19:20:26,742 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-09 19:20:26,742 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 19:20:26,742 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-09 19:20:26,742 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-09 19:20:26,742 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-12-09 19:20:26,742 INFO L87 Difference]: Start difference. First operand 5552 states and 12239 transitions. Second operand 6 states. [2018-12-09 19:20:26,917 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:20:26,917 INFO L93 Difference]: Finished difference Result 6325 states and 13928 transitions. [2018-12-09 19:20:26,917 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-09 19:20:26,917 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 96 [2018-12-09 19:20:26,918 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:20:26,922 INFO L225 Difference]: With dead ends: 6325 [2018-12-09 19:20:26,922 INFO L226 Difference]: Without dead ends: 6283 [2018-12-09 19:20:26,922 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2018-12-09 19:20:26,928 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6283 states. [2018-12-09 19:20:26,966 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6283 to 5716. [2018-12-09 19:20:26,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5716 states. [2018-12-09 19:20:26,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5716 states to 5716 states and 12591 transitions. [2018-12-09 19:20:26,973 INFO L78 Accepts]: Start accepts. Automaton has 5716 states and 12591 transitions. Word has length 96 [2018-12-09 19:20:26,973 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:20:26,974 INFO L480 AbstractCegarLoop]: Abstraction has 5716 states and 12591 transitions. [2018-12-09 19:20:26,974 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-09 19:20:26,974 INFO L276 IsEmpty]: Start isEmpty. Operand 5716 states and 12591 transitions. [2018-12-09 19:20:26,978 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2018-12-09 19:20:26,978 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:20:26,978 INFO L402 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, 1] [2018-12-09 19:20:26,978 INFO L423 AbstractCegarLoop]: === Iteration 32 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 19:20:26,979 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:20:26,979 INFO L82 PathProgramCache]: Analyzing trace with hash -2092257192, now seen corresponding path program 1 times [2018-12-09 19:20:26,979 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 19:20:26,980 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:20:26,980 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 19:20:26,980 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:20:26,980 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 19:20:26,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:20:27,045 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 19:20:27,046 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 19:20:27,046 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-09 19:20:27,046 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 19:20:27,046 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-09 19:20:27,046 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-09 19:20:27,046 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-12-09 19:20:27,046 INFO L87 Difference]: Start difference. First operand 5716 states and 12591 transitions. Second operand 6 states. [2018-12-09 19:20:27,162 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:20:27,162 INFO L93 Difference]: Finished difference Result 6530 states and 14233 transitions. [2018-12-09 19:20:27,162 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-09 19:20:27,162 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 96 [2018-12-09 19:20:27,162 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:20:27,166 INFO L225 Difference]: With dead ends: 6530 [2018-12-09 19:20:27,166 INFO L226 Difference]: Without dead ends: 6480 [2018-12-09 19:20:27,167 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2018-12-09 19:20:27,172 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6480 states. [2018-12-09 19:20:27,203 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6480 to 5593. [2018-12-09 19:20:27,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5593 states. [2018-12-09 19:20:27,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5593 states to 5593 states and 12240 transitions. [2018-12-09 19:20:27,209 INFO L78 Accepts]: Start accepts. Automaton has 5593 states and 12240 transitions. Word has length 96 [2018-12-09 19:20:27,210 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:20:27,210 INFO L480 AbstractCegarLoop]: Abstraction has 5593 states and 12240 transitions. [2018-12-09 19:20:27,210 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-09 19:20:27,210 INFO L276 IsEmpty]: Start isEmpty. Operand 5593 states and 12240 transitions. [2018-12-09 19:20:27,214 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2018-12-09 19:20:27,214 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:20:27,214 INFO L402 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, 1] [2018-12-09 19:20:27,214 INFO L423 AbstractCegarLoop]: === Iteration 33 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 19:20:27,215 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:20:27,215 INFO L82 PathProgramCache]: Analyzing trace with hash -1130643175, now seen corresponding path program 2 times [2018-12-09 19:20:27,215 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 19:20:27,216 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:20:27,216 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:20:27,216 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:20:27,216 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 19:20:27,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 19:20:27,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 19:20:27,253 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2018-12-09 19:20:27,329 INFO L305 ceAbstractionStarter]: Did not count any witness invariants because Icfg is not BoogieIcfg [2018-12-09 19:20:27,330 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.12 07:20:27 BasicIcfg [2018-12-09 19:20:27,331 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-09 19:20:27,331 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-09 19:20:27,331 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-09 19:20:27,331 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-09 19:20:27,332 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 07:20:11" (3/4) ... [2018-12-09 19:20:27,333 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample [2018-12-09 19:20:27,432 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_fed2a6b7-7b4d-4ad7-81a0-5bccef2fe637/bin-2019/utaipan/witness.graphml [2018-12-09 19:20:27,432 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-09 19:20:27,433 INFO L168 Benchmark]: Toolchain (without parser) took 16286.83 ms. Allocated memory was 1.0 GB in the beginning and 2.4 GB in the end (delta: 1.4 GB). Free memory was 945.9 MB in the beginning and 2.1 GB in the end (delta: -1.1 GB). Peak memory consumption was 286.3 MB. Max. memory is 11.5 GB. [2018-12-09 19:20:27,434 INFO L168 Benchmark]: CDTParser took 0.12 ms. Allocated memory is still 1.0 GB. Free memory is still 976.0 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-09 19:20:27,434 INFO L168 Benchmark]: CACSL2BoogieTranslator took 342.54 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 109.1 MB). Free memory was 945.9 MB in the beginning and 1.1 GB in the end (delta: -140.2 MB). Peak memory consumption was 33.8 MB. Max. memory is 11.5 GB. [2018-12-09 19:20:27,434 INFO L168 Benchmark]: Boogie Procedure Inliner took 39.10 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2018-12-09 19:20:27,434 INFO L168 Benchmark]: Boogie Preprocessor took 20.43 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-09 19:20:27,434 INFO L168 Benchmark]: RCFGBuilder took 358.28 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 46.1 MB). Peak memory consumption was 46.1 MB. Max. memory is 11.5 GB. [2018-12-09 19:20:27,435 INFO L168 Benchmark]: TraceAbstraction took 15422.16 ms. Allocated memory was 1.1 GB in the beginning and 2.4 GB in the end (delta: 1.3 GB). Free memory was 1.0 GB in the beginning and 2.1 GB in the end (delta: -1.1 GB). Peak memory consumption was 210.9 MB. Max. memory is 11.5 GB. [2018-12-09 19:20:27,435 INFO L168 Benchmark]: Witness Printer took 101.19 ms. Allocated memory is still 2.4 GB. Free memory was 2.1 GB in the beginning and 2.1 GB in the end (delta: 57.8 MB). Peak memory consumption was 57.8 MB. Max. memory is 11.5 GB. [2018-12-09 19:20:27,436 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.12 ms. Allocated memory is still 1.0 GB. Free memory is still 976.0 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 342.54 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 109.1 MB). Free memory was 945.9 MB in the beginning and 1.1 GB in the end (delta: -140.2 MB). Peak memory consumption was 33.8 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 39.10 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 20.43 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 358.28 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 46.1 MB). Peak memory consumption was 46.1 MB. Max. memory is 11.5 GB. * TraceAbstraction took 15422.16 ms. Allocated memory was 1.1 GB in the beginning and 2.4 GB in the end (delta: 1.3 GB). Free memory was 1.0 GB in the beginning and 2.1 GB in the end (delta: -1.1 GB). Peak memory consumption was 210.9 MB. Max. memory is 11.5 GB. * Witness Printer took 101.19 ms. Allocated memory is still 2.4 GB. Free memory was 2.1 GB in the beginning and 2.1 GB in the end (delta: 57.8 MB). Peak memory consumption was 57.8 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: [L671] -1 int __unbuffered_cnt = 0; VAL [__unbuffered_cnt=0] [L673] -1 int __unbuffered_p1_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0] [L675] -1 int __unbuffered_p1_EBX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0] [L676] -1 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0] [L677] -1 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0] [L679] -1 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] [L681] -1 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, y=0] [L683] -1 int z = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0] [L684] -1 _Bool z$flush_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0] [L685] -1 int z$mem_tmp; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0] [L686] -1 _Bool z$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, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0] [L687] -1 _Bool z$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, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0] [L688] -1 _Bool z$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, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0] [L689] -1 _Bool z$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, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff1_thd0=0] [L690] -1 _Bool z$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, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0] [L691] -1 _Bool z$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, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0] [L692] -1 _Bool z$read_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0] [L693] -1 int *z$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, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}] [L694] -1 int z$w_buff0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0] [L695] -1 _Bool z$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, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0] [L696] -1 int z$w_buff1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0] [L697] -1 _Bool z$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, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L698] -1 _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, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L699] -1 _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, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L778] -1 pthread_t t1091; 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, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L779] FCALL, FORK -1 pthread_create(&t1091, ((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, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L703] 0 z$w_buff1 = z$w_buff0 [L704] 0 z$w_buff0 = 1 [L705] 0 z$w_buff1_used = z$w_buff0_used [L706] 0 z$w_buff0_used = (_Bool)1 [L4] COND FALSE 0 !(!expression) 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, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L708] 0 z$r_buff1_thd0 = z$r_buff0_thd0 [L709] 0 z$r_buff1_thd1 = z$r_buff0_thd1 [L710] 0 z$r_buff1_thd2 = z$r_buff0_thd2 [L711] 0 z$r_buff0_thd1 = (_Bool)1 [L714] 0 x = 1 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=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L717] EXPR 0 z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd1 ? z$w_buff1 : z) 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=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L780] -1 pthread_t t1092; 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=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L781] FCALL, FORK -1 pthread_create(&t1092, ((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=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L731] 1 x = 2 [L734] 1 y = 1 [L737] 1 __unbuffered_p1_EAX = y [L740] 1 weak$$choice0 = __VERIFIER_nondet_pointer() [L741] 1 weak$$choice2 = __VERIFIER_nondet_pointer() [L742] 1 z$flush_delayed = weak$$choice2 [L743] 1 z$mem_tmp = z VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=2, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L744] EXPR 1 !z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff1) VAL [!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=2, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L744] 1 z = !z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff1) [L745] EXPR 1 weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff0))=1, x=2, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L745] 1 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff0)) [L746] EXPR 1 weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff1 : z$w_buff1)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff1 : z$w_buff1))=0, x=2, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L746] 1 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff1 : z$w_buff1)) [L747] EXPR 1 weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used))=1, x=2, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L747] 1 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used)) [L748] EXPR 1 weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0))=0, x=2, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L748] 1 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L749] EXPR 1 weak$$choice2 ? z$r_buff0_thd2 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$r_buff0_thd2 : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, weak$$choice2 ? z$r_buff0_thd2 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$r_buff0_thd2 : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2))=0, x=2, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L749] 1 z$r_buff0_thd2 = weak$$choice2 ? z$r_buff0_thd2 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$r_buff0_thd2 : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2)) [L750] EXPR 1 weak$$choice2 ? z$r_buff1_thd2 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$r_buff1_thd2 : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, weak$$choice2 ? z$r_buff1_thd2 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$r_buff1_thd2 : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0))=0, x=2, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L750] 1 z$r_buff1_thd2 = weak$$choice2 ? z$r_buff1_thd2 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$r_buff1_thd2 : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L751] 1 __unbuffered_p1_EBX = z VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=2, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L752] EXPR 1 z$flush_delayed ? z$mem_tmp : z VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=2, y=1, z=0, z$flush_delayed=1, z$flush_delayed ? z$mem_tmp : z=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L717] 0 z = z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd1 ? z$w_buff1 : z) [L752] 1 z = z$flush_delayed ? z$mem_tmp : z [L753] 1 z$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=2, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L756] EXPR 1 z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=2, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L756] EXPR 1 z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=2, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z=0] [L756] EXPR 1 z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=2, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z)=0, z$w_buff1=0, z$w_buff1_used=0, z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z=0] [L756] 1 z = z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z) [L757] EXPR 1 z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=2, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L757] 1 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used [L758] EXPR 1 z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$w_buff1_used VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=2, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$w_buff1_used=0, z$w_buff1=0, z$w_buff1_used=0] [L758] 1 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$w_buff1_used [L759] EXPR 1 z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=2, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2=0, z$w_buff1=0, z$w_buff1_used=0] [L759] 1 z$r_buff0_thd2 = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2 [L718] EXPR 0 z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$w_buff0_used VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=2, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L718] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$w_buff0_used [L719] EXPR 0 z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$w_buff1_used VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=2, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L719] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$w_buff1_used [L720] EXPR 0 z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$r_buff0_thd1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=2, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L720] 0 z$r_buff0_thd1 = z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$r_buff0_thd1 [L721] EXPR 0 z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$r_buff1_thd1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=2, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L721] 0 z$r_buff1_thd1 = z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$r_buff1_thd1 [L724] 0 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=2, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L760] EXPR 1 z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$r_buff1_thd2 VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=2, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$r_buff1_thd2=0, z$w_buff1=0, z$w_buff1_used=0] [L760] 1 z$r_buff1_thd2 = z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$r_buff1_thd2 [L763] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=2, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L783] -1 main$tmp_guard0 = __unbuffered_cnt == 2 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=2, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L787] EXPR -1 z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=2, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L787] EXPR -1 z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=2, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L787] EXPR -1 z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=2, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L787] -1 z = z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L788] EXPR -1 z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=2, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L788] -1 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L789] EXPR -1 z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=2, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L789] -1 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L790] EXPR -1 z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=2, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L790] -1 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L791] EXPR -1 z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=2, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L791] -1 z$r_buff1_thd0 = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 [L794] -1 main$tmp_guard1 = !(x == 2 && __unbuffered_p1_EAX == 1 && __unbuffered_p1_EBX == 0) VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=2, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L4] COND TRUE -1 !expression VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=2, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L4] -1 __VERIFIER_error() VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=2, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 223 locations, 3 error locations. UNSAFE Result, 15.3s OverallTime, 33 OverallIterations, 1 TraceHistogramMax, 7.5s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 8523 SDtfs, 9273 SDslu, 20134 SDs, 0 SdLazy, 8401 SolverSat, 452 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 4.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 334 GetRequests, 84 SyntacticMatches, 31 SemanticMatches, 219 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 255 ImplicationChecksByTransitivity, 1.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=34807occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 4.1s AutomataMinimizationTime, 32 MinimizatonAttempts, 83048 StatesRemovedByMinimization, 31 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.3s InterpolantComputationTime, 2541 NumberOfCodeBlocks, 2541 NumberOfCodeBlocksAsserted, 33 NumberOfCheckSat, 2413 ConstructedInterpolants, 0 QuantifiedInterpolants, 576677 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 32 InterpolantComputations, 32 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...