./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/rfi004_pso.oepc.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version cad46833 Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_69caf3cf-9129-4991-b0a8-e7a703d6657a/bin/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_69caf3cf-9129-4991-b0a8-e7a703d6657a/bin/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_69caf3cf-9129-4991-b0a8-e7a703d6657a/bin/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_69caf3cf-9129-4991-b0a8-e7a703d6657a/bin/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/pthread-wmm/rfi004_pso.oepc.i -s /tmp/vcloud-vcloud-master/worker/working_dir_69caf3cf-9129-4991-b0a8-e7a703d6657a/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_69caf3cf-9129-4991-b0a8-e7a703d6657a/bin/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 a7cf93ac7e82b5488cc7ec2f90288a287cc6071b ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE --- Real Ultimate output --- This is Ultimate 0.1.24-cad4683 [2019-10-22 11:26:11,397 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-22 11:26:11,400 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-22 11:26:11,411 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-22 11:26:11,411 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-22 11:26:11,412 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-22 11:26:11,413 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-22 11:26:11,415 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-22 11:26:11,416 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-22 11:26:11,417 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-22 11:26:11,418 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-22 11:26:11,418 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-22 11:26:11,419 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-22 11:26:11,419 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-22 11:26:11,420 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-22 11:26:11,421 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-22 11:26:11,422 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-22 11:26:11,423 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-22 11:26:11,424 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-22 11:26:11,425 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-22 11:26:11,427 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-22 11:26:11,427 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-22 11:26:11,428 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-22 11:26:11,429 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-22 11:26:11,430 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-22 11:26:11,431 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-22 11:26:11,431 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-22 11:26:11,432 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-22 11:26:11,432 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-22 11:26:11,433 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-22 11:26:11,433 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-22 11:26:11,434 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-22 11:26:11,434 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-22 11:26:11,435 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-22 11:26:11,435 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-22 11:26:11,435 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-22 11:26:11,436 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-22 11:26:11,436 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-22 11:26:11,436 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-22 11:26:11,437 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-22 11:26:11,438 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-22 11:26:11,438 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_69caf3cf-9129-4991-b0a8-e7a703d6657a/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2019-10-22 11:26:11,448 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-22 11:26:11,449 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-22 11:26:11,449 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-10-22 11:26:11,449 INFO L138 SettingsManager]: * User list type=DISABLED [2019-10-22 11:26:11,450 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-10-22 11:26:11,450 INFO L138 SettingsManager]: * Explicit value domain=true [2019-10-22 11:26:11,450 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-10-22 11:26:11,450 INFO L138 SettingsManager]: * Octagon Domain=false [2019-10-22 11:26:11,450 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2019-10-22 11:26:11,450 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-10-22 11:26:11,451 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2019-10-22 11:26:11,451 INFO L138 SettingsManager]: * Interval Domain=false [2019-10-22 11:26:11,451 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-22 11:26:11,452 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-22 11:26:11,452 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-22 11:26:11,452 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-22 11:26:11,452 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-22 11:26:11,452 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-22 11:26:11,453 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-22 11:26:11,453 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-22 11:26:11,453 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-22 11:26:11,453 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-22 11:26:11,453 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-22 11:26:11,454 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-22 11:26:11,454 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-22 11:26:11,454 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-22 11:26:11,454 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-22 11:26:11,454 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-22 11:26:11,455 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-22 11:26:11,455 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-22 11:26:11,455 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-22 11:26:11,455 INFO L138 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-10-22 11:26:11,455 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-22 11:26:11,455 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-22 11:26:11,456 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-10-22 11:26:11,456 INFO L138 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_69caf3cf-9129-4991-b0a8-e7a703d6657a/bin/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 -> a7cf93ac7e82b5488cc7ec2f90288a287cc6071b [2019-10-22 11:26:11,481 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-22 11:26:11,491 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-22 11:26:11,494 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-22 11:26:11,496 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-22 11:26:11,496 INFO L275 PluginConnector]: CDTParser initialized [2019-10-22 11:26:11,497 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_69caf3cf-9129-4991-b0a8-e7a703d6657a/bin/utaipan/../../sv-benchmarks/c/pthread-wmm/rfi004_pso.oepc.i [2019-10-22 11:26:11,547 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_69caf3cf-9129-4991-b0a8-e7a703d6657a/bin/utaipan/data/f930a569c/c9cecef52fd64e48be4de09ffcfdf89f/FLAG4b4276461 [2019-10-22 11:26:11,995 INFO L306 CDTParser]: Found 1 translation units. [2019-10-22 11:26:11,995 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_69caf3cf-9129-4991-b0a8-e7a703d6657a/sv-benchmarks/c/pthread-wmm/rfi004_pso.oepc.i [2019-10-22 11:26:12,008 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_69caf3cf-9129-4991-b0a8-e7a703d6657a/bin/utaipan/data/f930a569c/c9cecef52fd64e48be4de09ffcfdf89f/FLAG4b4276461 [2019-10-22 11:26:12,299 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_69caf3cf-9129-4991-b0a8-e7a703d6657a/bin/utaipan/data/f930a569c/c9cecef52fd64e48be4de09ffcfdf89f [2019-10-22 11:26:12,302 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-22 11:26:12,303 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-10-22 11:26:12,304 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-22 11:26:12,304 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-22 11:26:12,308 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-22 11:26:12,309 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.10 11:26:12" (1/1) ... [2019-10-22 11:26:12,311 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@25293ab7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:26:12, skipping insertion in model container [2019-10-22 11:26:12,312 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.10 11:26:12" (1/1) ... [2019-10-22 11:26:12,318 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-22 11:26:12,368 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-22 11:26:12,830 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-22 11:26:12,850 INFO L188 MainTranslator]: Completed pre-run [2019-10-22 11:26:12,931 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-22 11:26:12,999 INFO L192 MainTranslator]: Completed translation [2019-10-22 11:26:12,999 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:26:12 WrapperNode [2019-10-22 11:26:13,000 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-22 11:26:13,001 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-10-22 11:26:13,001 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-10-22 11:26:13,001 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-10-22 11:26:13,011 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:26:12" (1/1) ... [2019-10-22 11:26:13,041 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:26:12" (1/1) ... [2019-10-22 11:26:13,071 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-10-22 11:26:13,072 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-22 11:26:13,072 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-22 11:26:13,072 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-22 11:26:13,080 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:26:12" (1/1) ... [2019-10-22 11:26:13,080 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:26:12" (1/1) ... [2019-10-22 11:26:13,084 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:26:12" (1/1) ... [2019-10-22 11:26:13,084 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:26:12" (1/1) ... [2019-10-22 11:26:13,094 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:26:12" (1/1) ... [2019-10-22 11:26:13,104 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:26:12" (1/1) ... [2019-10-22 11:26:13,107 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:26:12" (1/1) ... [2019-10-22 11:26:13,111 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-22 11:26:13,114 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-22 11:26:13,115 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-22 11:26:13,115 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-22 11:26:13,116 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:26:12" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_69caf3cf-9129-4991-b0a8-e7a703d6657a/bin/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 [2019-10-22 11:26:13,188 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-10-22 11:26:13,188 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-10-22 11:26:13,188 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-10-22 11:26:13,188 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-10-22 11:26:13,189 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-10-22 11:26:13,189 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-10-22 11:26:13,189 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-10-22 11:26:13,189 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-10-22 11:26:13,189 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-10-22 11:26:13,189 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-22 11:26:13,189 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-22 11:26:13,191 WARN L202 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-10-22 11:26:13,873 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-22 11:26:13,874 INFO L284 CfgBuilder]: Removed 8 assume(true) statements. [2019-10-22 11:26:13,875 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 11:26:13 BoogieIcfgContainer [2019-10-22 11:26:13,875 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-22 11:26:13,876 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-22 11:26:13,876 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-22 11:26:13,879 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-22 11:26:13,879 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.10 11:26:12" (1/3) ... [2019-10-22 11:26:13,880 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@540a6d96 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.10 11:26:13, skipping insertion in model container [2019-10-22 11:26:13,880 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:26:12" (2/3) ... [2019-10-22 11:26:13,881 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@540a6d96 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.10 11:26:13, skipping insertion in model container [2019-10-22 11:26:13,881 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 11:26:13" (3/3) ... [2019-10-22 11:26:13,882 INFO L109 eAbstractionObserver]: Analyzing ICFG rfi004_pso.oepc.i [2019-10-22 11:26:13,930 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 11:26:13,930 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 11:26:13,930 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 11:26:13,930 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 11:26:13,930 WARN L315 ript$VariableManager]: TermVariabe Thread0_P0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 11:26:13,931 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 11:26:13,931 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 11:26:13,931 WARN L315 ript$VariableManager]: TermVariabe Thread0_P0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 11:26:13,931 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 11:26:13,931 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 11:26:13,931 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 11:26:13,932 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 11:26:13,932 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 11:26:13,932 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 11:26:13,932 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 11:26:13,932 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 11:26:13,932 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 11:26:13,933 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 11:26:13,933 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 11:26:13,933 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 11:26:13,933 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 11:26:13,933 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 11:26:13,933 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 11:26:13,934 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 11:26:13,934 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 11:26:13,934 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 11:26:13,934 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 11:26:13,934 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 11:26:13,934 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 11:26:13,935 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 11:26:13,935 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 11:26:13,935 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 11:26:13,935 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 11:26:13,935 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 11:26:13,935 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 11:26:13,936 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 11:26:13,936 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 11:26:13,936 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 11:26:13,936 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 11:26:13,936 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 11:26:13,936 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 11:26:13,937 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 11:26:13,937 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 11:26:13,937 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 11:26:13,937 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 11:26:13,937 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 11:26:13,937 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 11:26:13,938 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 11:26:13,938 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 11:26:13,938 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 11:26:13,938 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 11:26:13,938 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 11:26:13,939 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 11:26:13,939 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 11:26:13,939 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 11:26:13,939 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 11:26:13,939 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 11:26:13,939 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 11:26:13,940 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 11:26:13,940 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 11:26:13,940 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 11:26:13,940 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 11:26:13,940 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 11:26:13,940 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 11:26:13,941 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 11:26:13,941 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 11:26:13,941 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 11:26:13,941 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 11:26:13,941 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 11:26:13,941 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 11:26:13,942 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 11:26:13,942 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 11:26:13,942 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 11:26:13,942 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 11:26:13,942 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 11:26:13,942 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 11:26:13,943 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 11:26:13,943 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 11:26:13,943 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 11:26:13,943 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 11:26:13,943 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 11:26:13,943 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 11:26:13,944 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 11:26:13,944 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 11:26:13,944 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 11:26:13,944 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 11:26:13,944 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 11:26:13,944 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 11:26:13,945 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 11:26:13,945 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 11:26:13,945 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 11:26:13,945 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 11:26:13,945 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet26.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 11:26:13,945 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet26.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 11:26:13,945 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 11:26:13,946 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 11:26:13,946 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet26.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 11:26:13,946 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet26.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 11:26:13,946 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 11:26:13,946 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 11:26:13,947 WARN L315 ript$VariableManager]: TermVariabe Thread1_P1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 11:26:13,947 WARN L315 ript$VariableManager]: TermVariabe Thread1_P1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 11:26:13,947 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 11:26:13,947 WARN L315 ript$VariableManager]: TermVariabe Thread1_P1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 11:26:13,947 WARN L315 ript$VariableManager]: TermVariabe Thread1_P1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 11:26:13,947 WARN L315 ript$VariableManager]: TermVariabe Thread1_P1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 11:26:13,948 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 11:26:13,952 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 11:26:13,953 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 11:26:13,953 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 11:26:13,953 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 11:26:13,953 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 11:26:13,953 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 11:26:13,954 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 11:26:13,954 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 11:26:13,954 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 11:26:13,954 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 11:26:13,954 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 11:26:13,954 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 11:26:13,954 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 11:26:13,955 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 11:26:13,955 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 11:26:13,955 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 11:26:13,955 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 11:26:13,955 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 11:26:13,955 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 11:26:13,956 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 11:26:13,956 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 11:26:13,956 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 11:26:13,956 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 11:26:13,956 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet33.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 11:26:13,956 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet33.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 11:26:13,956 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 11:26:13,957 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 11:26:13,957 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet33.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 11:26:13,957 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet33.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 11:26:13,963 WARN L141 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-10-22 11:26:13,964 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-22 11:26:13,972 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 3 error locations. [2019-10-22 11:26:13,980 INFO L249 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2019-10-22 11:26:13,998 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-22 11:26:13,998 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-22 11:26:13,998 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-22 11:26:13,999 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-22 11:26:13,999 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-22 11:26:13,999 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-22 11:26:13,999 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-22 11:26:13,999 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-22 11:26:14,009 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 132 places, 164 transitions [2019-10-22 11:26:16,354 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 27856 states. [2019-10-22 11:26:16,356 INFO L276 IsEmpty]: Start isEmpty. Operand 27856 states. [2019-10-22 11:26:16,365 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-10-22 11:26:16,365 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:26:16,366 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 11:26:16,368 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:26:16,372 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:26:16,373 INFO L82 PathProgramCache]: Analyzing trace with hash 1406083354, now seen corresponding path program 1 times [2019-10-22 11:26:16,383 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:26:16,383 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1107330760] [2019-10-22 11:26:16,384 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:26:16,384 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:26:16,384 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:26:16,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:26:16,629 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 11:26:16,629 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1107330760] [2019-10-22 11:26:16,630 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:26:16,630 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-22 11:26:16,631 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1169743652] [2019-10-22 11:26:16,636 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-22 11:26:16,637 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:26:16,653 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-22 11:26:16,654 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-22 11:26:16,657 INFO L87 Difference]: Start difference. First operand 27856 states. Second operand 4 states. [2019-10-22 11:26:17,534 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:26:17,534 INFO L93 Difference]: Finished difference Result 28524 states and 108881 transitions. [2019-10-22 11:26:17,536 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-22 11:26:17,537 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 39 [2019-10-22 11:26:17,538 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:26:17,713 INFO L225 Difference]: With dead ends: 28524 [2019-10-22 11:26:17,713 INFO L226 Difference]: Without dead ends: 21756 [2019-10-22 11:26:17,715 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-22 11:26:17,954 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21756 states. [2019-10-22 11:26:18,527 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21756 to 21756. [2019-10-22 11:26:18,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21756 states. [2019-10-22 11:26:18,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21756 states to 21756 states and 83441 transitions. [2019-10-22 11:26:18,623 INFO L78 Accepts]: Start accepts. Automaton has 21756 states and 83441 transitions. Word has length 39 [2019-10-22 11:26:18,623 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:26:18,625 INFO L462 AbstractCegarLoop]: Abstraction has 21756 states and 83441 transitions. [2019-10-22 11:26:18,625 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-22 11:26:18,625 INFO L276 IsEmpty]: Start isEmpty. Operand 21756 states and 83441 transitions. [2019-10-22 11:26:18,634 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-10-22 11:26:18,635 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:26:18,635 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 11:26:18,639 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:26:18,639 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:26:18,640 INFO L82 PathProgramCache]: Analyzing trace with hash -322753813, now seen corresponding path program 1 times [2019-10-22 11:26:18,640 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:26:18,640 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1857500930] [2019-10-22 11:26:18,640 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:26:18,640 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:26:18,640 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:26:18,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:26:18,751 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 11:26:18,751 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1857500930] [2019-10-22 11:26:18,751 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:26:18,751 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-22 11:26:18,752 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [88727065] [2019-10-22 11:26:18,753 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-22 11:26:18,754 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:26:18,754 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-22 11:26:18,754 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-22 11:26:18,754 INFO L87 Difference]: Start difference. First operand 21756 states and 83441 transitions. Second operand 5 states. [2019-10-22 11:26:19,811 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:26:19,811 INFO L93 Difference]: Finished difference Result 34170 states and 124041 transitions. [2019-10-22 11:26:19,813 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-22 11:26:19,813 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 47 [2019-10-22 11:26:19,813 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:26:19,951 INFO L225 Difference]: With dead ends: 34170 [2019-10-22 11:26:19,951 INFO L226 Difference]: Without dead ends: 33602 [2019-10-22 11:26:19,952 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-10-22 11:26:20,162 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33602 states. [2019-10-22 11:26:20,758 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33602 to 31796. [2019-10-22 11:26:20,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31796 states. [2019-10-22 11:26:21,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31796 states to 31796 states and 116819 transitions. [2019-10-22 11:26:21,215 INFO L78 Accepts]: Start accepts. Automaton has 31796 states and 116819 transitions. Word has length 47 [2019-10-22 11:26:21,216 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:26:21,216 INFO L462 AbstractCegarLoop]: Abstraction has 31796 states and 116819 transitions. [2019-10-22 11:26:21,217 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-22 11:26:21,217 INFO L276 IsEmpty]: Start isEmpty. Operand 31796 states and 116819 transitions. [2019-10-22 11:26:21,221 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-10-22 11:26:21,221 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:26:21,221 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 11:26:21,221 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:26:21,222 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:26:21,222 INFO L82 PathProgramCache]: Analyzing trace with hash -38024889, now seen corresponding path program 1 times [2019-10-22 11:26:21,222 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:26:21,222 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1549088458] [2019-10-22 11:26:21,222 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:26:21,223 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:26:21,223 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:26:21,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:26:21,299 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 11:26:21,299 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1549088458] [2019-10-22 11:26:21,300 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:26:21,300 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-22 11:26:21,300 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1975808913] [2019-10-22 11:26:21,300 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-22 11:26:21,301 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:26:21,301 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-22 11:26:21,301 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-22 11:26:21,301 INFO L87 Difference]: Start difference. First operand 31796 states and 116819 transitions. Second operand 5 states. [2019-10-22 11:26:21,769 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:26:21,769 INFO L93 Difference]: Finished difference Result 41644 states and 149743 transitions. [2019-10-22 11:26:21,770 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-22 11:26:21,770 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 48 [2019-10-22 11:26:21,770 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:26:21,935 INFO L225 Difference]: With dead ends: 41644 [2019-10-22 11:26:21,935 INFO L226 Difference]: Without dead ends: 41180 [2019-10-22 11:26:21,936 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-10-22 11:26:22,166 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41180 states. [2019-10-22 11:26:22,793 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41180 to 35364. [2019-10-22 11:26:22,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35364 states. [2019-10-22 11:26:22,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35364 states to 35364 states and 128877 transitions. [2019-10-22 11:26:22,916 INFO L78 Accepts]: Start accepts. Automaton has 35364 states and 128877 transitions. Word has length 48 [2019-10-22 11:26:22,917 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:26:22,917 INFO L462 AbstractCegarLoop]: Abstraction has 35364 states and 128877 transitions. [2019-10-22 11:26:22,917 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-22 11:26:22,917 INFO L276 IsEmpty]: Start isEmpty. Operand 35364 states and 128877 transitions. [2019-10-22 11:26:22,925 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-10-22 11:26:22,925 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:26:22,925 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 11:26:22,926 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:26:22,926 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:26:22,926 INFO L82 PathProgramCache]: Analyzing trace with hash 606739501, now seen corresponding path program 1 times [2019-10-22 11:26:22,926 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:26:22,927 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [326508385] [2019-10-22 11:26:22,927 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:26:22,927 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:26:22,927 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:26:22,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:26:22,996 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 11:26:22,997 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [326508385] [2019-10-22 11:26:22,997 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:26:22,997 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 11:26:22,997 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [735537035] [2019-10-22 11:26:22,998 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 11:26:22,998 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:26:22,998 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 11:26:22,999 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 11:26:22,999 INFO L87 Difference]: Start difference. First operand 35364 states and 128877 transitions. Second operand 3 states. [2019-10-22 11:26:23,553 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:26:23,554 INFO L93 Difference]: Finished difference Result 45910 states and 163945 transitions. [2019-10-22 11:26:23,554 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 11:26:23,554 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 50 [2019-10-22 11:26:23,554 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:26:23,694 INFO L225 Difference]: With dead ends: 45910 [2019-10-22 11:26:23,694 INFO L226 Difference]: Without dead ends: 45910 [2019-10-22 11:26:23,695 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 11:26:23,937 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45910 states. [2019-10-22 11:26:24,432 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45910 to 40247. [2019-10-22 11:26:24,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40247 states. [2019-10-22 11:26:24,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40247 states to 40247 states and 145215 transitions. [2019-10-22 11:26:24,544 INFO L78 Accepts]: Start accepts. Automaton has 40247 states and 145215 transitions. Word has length 50 [2019-10-22 11:26:24,544 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:26:24,544 INFO L462 AbstractCegarLoop]: Abstraction has 40247 states and 145215 transitions. [2019-10-22 11:26:24,544 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 11:26:24,544 INFO L276 IsEmpty]: Start isEmpty. Operand 40247 states and 145215 transitions. [2019-10-22 11:26:24,557 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-10-22 11:26:24,557 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:26:24,558 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 11:26:24,558 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:26:24,558 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:26:24,558 INFO L82 PathProgramCache]: Analyzing trace with hash -807412104, now seen corresponding path program 1 times [2019-10-22 11:26:24,558 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:26:24,558 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1538328760] [2019-10-22 11:26:24,559 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:26:24,559 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:26:24,559 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:26:24,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:26:24,677 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 11:26:24,678 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1538328760] [2019-10-22 11:26:24,678 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:26:24,678 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-22 11:26:24,678 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1857064594] [2019-10-22 11:26:24,679 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-22 11:26:24,679 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:26:24,679 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-22 11:26:24,679 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-22 11:26:24,680 INFO L87 Difference]: Start difference. First operand 40247 states and 145215 transitions. Second operand 6 states. [2019-10-22 11:26:25,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:26:25,641 INFO L93 Difference]: Finished difference Result 52466 states and 185477 transitions. [2019-10-22 11:26:25,641 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-10-22 11:26:25,641 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 54 [2019-10-22 11:26:25,641 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:26:25,779 INFO L225 Difference]: With dead ends: 52466 [2019-10-22 11:26:25,779 INFO L226 Difference]: Without dead ends: 51930 [2019-10-22 11:26:25,780 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=49, Invalid=133, Unknown=0, NotChecked=0, Total=182 [2019-10-22 11:26:25,986 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51930 states. [2019-10-22 11:26:26,497 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51930 to 40898. [2019-10-22 11:26:26,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40898 states. [2019-10-22 11:26:26,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40898 states to 40898 states and 147668 transitions. [2019-10-22 11:26:26,598 INFO L78 Accepts]: Start accepts. Automaton has 40898 states and 147668 transitions. Word has length 54 [2019-10-22 11:26:26,598 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:26:26,598 INFO L462 AbstractCegarLoop]: Abstraction has 40898 states and 147668 transitions. [2019-10-22 11:26:26,598 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-22 11:26:26,599 INFO L276 IsEmpty]: Start isEmpty. Operand 40898 states and 147668 transitions. [2019-10-22 11:26:26,612 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-10-22 11:26:26,612 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:26:26,612 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 11:26:26,612 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:26:26,613 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:26:26,613 INFO L82 PathProgramCache]: Analyzing trace with hash 1566342864, now seen corresponding path program 1 times [2019-10-22 11:26:26,613 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:26:26,613 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [790482638] [2019-10-22 11:26:26,613 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:26:26,614 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:26:26,614 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:26:26,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:26:26,716 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 11:26:26,717 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [790482638] [2019-10-22 11:26:26,717 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:26:26,717 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-22 11:26:26,717 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [253203096] [2019-10-22 11:26:26,718 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-22 11:26:26,718 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:26:26,718 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-22 11:26:26,718 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-10-22 11:26:26,719 INFO L87 Difference]: Start difference. First operand 40898 states and 147668 transitions. Second operand 6 states. [2019-10-22 11:26:27,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:26:27,403 INFO L93 Difference]: Finished difference Result 56599 states and 201648 transitions. [2019-10-22 11:26:27,404 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-22 11:26:27,404 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 54 [2019-10-22 11:26:27,404 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:26:27,530 INFO L225 Difference]: With dead ends: 56599 [2019-10-22 11:26:27,530 INFO L226 Difference]: Without dead ends: 55460 [2019-10-22 11:26:27,530 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-10-22 11:26:27,752 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55460 states. [2019-10-22 11:26:28,781 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55460 to 51955. [2019-10-22 11:26:28,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51955 states. [2019-10-22 11:26:28,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51955 states to 51955 states and 186007 transitions. [2019-10-22 11:26:28,897 INFO L78 Accepts]: Start accepts. Automaton has 51955 states and 186007 transitions. Word has length 54 [2019-10-22 11:26:28,898 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:26:28,898 INFO L462 AbstractCegarLoop]: Abstraction has 51955 states and 186007 transitions. [2019-10-22 11:26:28,898 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-22 11:26:28,898 INFO L276 IsEmpty]: Start isEmpty. Operand 51955 states and 186007 transitions. [2019-10-22 11:26:28,910 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-10-22 11:26:28,911 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:26:28,911 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 11:26:28,911 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:26:28,911 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:26:28,911 INFO L82 PathProgramCache]: Analyzing trace with hash -230608495, now seen corresponding path program 1 times [2019-10-22 11:26:28,911 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:26:28,912 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [360611836] [2019-10-22 11:26:28,912 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:26:28,912 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:26:28,912 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:26:28,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:26:28,991 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 11:26:28,991 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [360611836] [2019-10-22 11:26:28,991 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:26:28,991 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 11:26:28,991 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1536568391] [2019-10-22 11:26:28,992 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 11:26:28,992 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:26:28,992 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 11:26:28,992 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 11:26:28,993 INFO L87 Difference]: Start difference. First operand 51955 states and 186007 transitions. Second operand 3 states. [2019-10-22 11:26:29,184 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:26:29,184 INFO L93 Difference]: Finished difference Result 46767 states and 162434 transitions. [2019-10-22 11:26:29,185 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 11:26:29,185 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 54 [2019-10-22 11:26:29,185 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:26:29,278 INFO L225 Difference]: With dead ends: 46767 [2019-10-22 11:26:29,278 INFO L226 Difference]: Without dead ends: 46187 [2019-10-22 11:26:29,278 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 11:26:29,477 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46187 states. [2019-10-22 11:26:29,970 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46187 to 44422. [2019-10-22 11:26:29,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44422 states. [2019-10-22 11:26:30,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44422 states to 44422 states and 155155 transitions. [2019-10-22 11:26:30,074 INFO L78 Accepts]: Start accepts. Automaton has 44422 states and 155155 transitions. Word has length 54 [2019-10-22 11:26:30,075 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:26:30,075 INFO L462 AbstractCegarLoop]: Abstraction has 44422 states and 155155 transitions. [2019-10-22 11:26:30,075 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 11:26:30,075 INFO L276 IsEmpty]: Start isEmpty. Operand 44422 states and 155155 transitions. [2019-10-22 11:26:30,085 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-10-22 11:26:30,085 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:26:30,085 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 11:26:30,085 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:26:30,085 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:26:30,086 INFO L82 PathProgramCache]: Analyzing trace with hash 617907270, now seen corresponding path program 1 times [2019-10-22 11:26:30,086 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:26:30,086 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [534641045] [2019-10-22 11:26:30,086 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:26:30,086 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:26:30,086 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:26:30,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:26:30,160 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 11:26:30,160 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [534641045] [2019-10-22 11:26:30,160 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:26:30,160 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-22 11:26:30,161 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1510995191] [2019-10-22 11:26:30,161 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-22 11:26:30,161 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:26:30,161 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-22 11:26:30,161 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-22 11:26:30,161 INFO L87 Difference]: Start difference. First operand 44422 states and 155155 transitions. Second operand 4 states. [2019-10-22 11:26:30,209 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:26:30,209 INFO L93 Difference]: Finished difference Result 10152 states and 31522 transitions. [2019-10-22 11:26:30,210 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-22 11:26:30,210 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 55 [2019-10-22 11:26:30,210 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:26:30,220 INFO L225 Difference]: With dead ends: 10152 [2019-10-22 11:26:30,220 INFO L226 Difference]: Without dead ends: 8646 [2019-10-22 11:26:30,221 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-22 11:26:30,239 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8646 states. [2019-10-22 11:26:30,537 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8646 to 8598. [2019-10-22 11:26:30,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8598 states. [2019-10-22 11:26:30,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8598 states to 8598 states and 26467 transitions. [2019-10-22 11:26:30,550 INFO L78 Accepts]: Start accepts. Automaton has 8598 states and 26467 transitions. Word has length 55 [2019-10-22 11:26:30,550 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:26:30,550 INFO L462 AbstractCegarLoop]: Abstraction has 8598 states and 26467 transitions. [2019-10-22 11:26:30,550 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-22 11:26:30,550 INFO L276 IsEmpty]: Start isEmpty. Operand 8598 states and 26467 transitions. [2019-10-22 11:26:30,553 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-10-22 11:26:30,553 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:26:30,553 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 11:26:30,553 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:26:30,553 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:26:30,553 INFO L82 PathProgramCache]: Analyzing trace with hash 1743224388, now seen corresponding path program 1 times [2019-10-22 11:26:30,553 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:26:30,554 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [553072178] [2019-10-22 11:26:30,554 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:26:30,554 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:26:30,554 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:26:30,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:26:30,636 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 11:26:30,636 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [553072178] [2019-10-22 11:26:30,636 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:26:30,636 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-22 11:26:30,636 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1725124883] [2019-10-22 11:26:30,637 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-22 11:26:30,637 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:26:30,637 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-22 11:26:30,637 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-22 11:26:30,637 INFO L87 Difference]: Start difference. First operand 8598 states and 26467 transitions. Second operand 4 states. [2019-10-22 11:26:30,781 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:26:30,782 INFO L93 Difference]: Finished difference Result 10217 states and 31174 transitions. [2019-10-22 11:26:30,782 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-22 11:26:30,782 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 64 [2019-10-22 11:26:30,782 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:26:30,802 INFO L225 Difference]: With dead ends: 10217 [2019-10-22 11:26:30,802 INFO L226 Difference]: Without dead ends: 10217 [2019-10-22 11:26:30,802 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-22 11:26:30,832 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10217 states. [2019-10-22 11:26:30,949 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10217 to 9249. [2019-10-22 11:26:30,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9249 states. [2019-10-22 11:26:30,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9249 states to 9249 states and 28328 transitions. [2019-10-22 11:26:30,972 INFO L78 Accepts]: Start accepts. Automaton has 9249 states and 28328 transitions. Word has length 64 [2019-10-22 11:26:30,972 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:26:30,972 INFO L462 AbstractCegarLoop]: Abstraction has 9249 states and 28328 transitions. [2019-10-22 11:26:30,972 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-22 11:26:30,972 INFO L276 IsEmpty]: Start isEmpty. Operand 9249 states and 28328 transitions. [2019-10-22 11:26:30,977 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-10-22 11:26:30,978 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:26:30,978 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 11:26:30,978 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:26:30,978 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:26:30,978 INFO L82 PathProgramCache]: Analyzing trace with hash -808932573, now seen corresponding path program 1 times [2019-10-22 11:26:30,979 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:26:30,979 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [977273027] [2019-10-22 11:26:30,980 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:26:30,980 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:26:30,980 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:26:30,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:26:31,077 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 11:26:31,078 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [977273027] [2019-10-22 11:26:31,078 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:26:31,078 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-22 11:26:31,078 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2008296844] [2019-10-22 11:26:31,079 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-22 11:26:31,079 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:26:31,079 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-22 11:26:31,079 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-22 11:26:31,079 INFO L87 Difference]: Start difference. First operand 9249 states and 28328 transitions. Second operand 6 states. [2019-10-22 11:26:31,426 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:26:31,426 INFO L93 Difference]: Finished difference Result 12022 states and 36327 transitions. [2019-10-22 11:26:31,427 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-10-22 11:26:31,427 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 64 [2019-10-22 11:26:31,427 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:26:31,447 INFO L225 Difference]: With dead ends: 12022 [2019-10-22 11:26:31,447 INFO L226 Difference]: Without dead ends: 11958 [2019-10-22 11:26:31,448 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2019-10-22 11:26:31,478 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11958 states. [2019-10-22 11:26:31,580 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11958 to 10330. [2019-10-22 11:26:31,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10330 states. [2019-10-22 11:26:31,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10330 states to 10330 states and 31497 transitions. [2019-10-22 11:26:31,599 INFO L78 Accepts]: Start accepts. Automaton has 10330 states and 31497 transitions. Word has length 64 [2019-10-22 11:26:31,599 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:26:31,599 INFO L462 AbstractCegarLoop]: Abstraction has 10330 states and 31497 transitions. [2019-10-22 11:26:31,599 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-22 11:26:31,599 INFO L276 IsEmpty]: Start isEmpty. Operand 10330 states and 31497 transitions. [2019-10-22 11:26:31,605 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-10-22 11:26:31,605 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:26:31,605 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 11:26:31,605 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:26:31,605 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:26:31,605 INFO L82 PathProgramCache]: Analyzing trace with hash 2016404966, now seen corresponding path program 1 times [2019-10-22 11:26:31,606 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:26:31,606 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1112922916] [2019-10-22 11:26:31,606 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:26:31,606 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:26:31,606 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:26:31,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:26:31,706 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 11:26:31,707 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1112922916] [2019-10-22 11:26:31,707 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:26:31,707 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-22 11:26:31,707 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1570690091] [2019-10-22 11:26:31,708 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-22 11:26:31,708 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:26:31,708 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-22 11:26:31,708 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-10-22 11:26:31,708 INFO L87 Difference]: Start difference. First operand 10330 states and 31497 transitions. Second operand 6 states. [2019-10-22 11:26:32,179 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:26:32,180 INFO L93 Difference]: Finished difference Result 11717 states and 35093 transitions. [2019-10-22 11:26:32,180 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-22 11:26:32,180 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 68 [2019-10-22 11:26:32,180 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:26:32,194 INFO L225 Difference]: With dead ends: 11717 [2019-10-22 11:26:32,195 INFO L226 Difference]: Without dead ends: 11717 [2019-10-22 11:26:32,195 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-10-22 11:26:32,218 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11717 states. [2019-10-22 11:26:32,325 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11717 to 11383. [2019-10-22 11:26:32,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11383 states. [2019-10-22 11:26:32,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11383 states to 11383 states and 34215 transitions. [2019-10-22 11:26:32,346 INFO L78 Accepts]: Start accepts. Automaton has 11383 states and 34215 transitions. Word has length 68 [2019-10-22 11:26:32,346 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:26:32,346 INFO L462 AbstractCegarLoop]: Abstraction has 11383 states and 34215 transitions. [2019-10-22 11:26:32,346 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-22 11:26:32,347 INFO L276 IsEmpty]: Start isEmpty. Operand 11383 states and 34215 transitions. [2019-10-22 11:26:32,353 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-10-22 11:26:32,354 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:26:32,354 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 11:26:32,354 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:26:32,354 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:26:32,354 INFO L82 PathProgramCache]: Analyzing trace with hash 771640485, now seen corresponding path program 1 times [2019-10-22 11:26:32,354 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:26:32,354 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [97692895] [2019-10-22 11:26:32,355 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:26:32,355 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:26:32,355 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:26:32,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:26:32,424 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 11:26:32,424 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [97692895] [2019-10-22 11:26:32,425 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:26:32,425 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-22 11:26:32,425 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [983878448] [2019-10-22 11:26:32,425 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-22 11:26:32,425 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:26:32,426 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-22 11:26:32,426 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-22 11:26:32,426 INFO L87 Difference]: Start difference. First operand 11383 states and 34215 transitions. Second operand 4 states. [2019-10-22 11:26:32,620 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:26:32,620 INFO L93 Difference]: Finished difference Result 14998 states and 44528 transitions. [2019-10-22 11:26:32,620 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-22 11:26:32,620 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 68 [2019-10-22 11:26:32,621 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:26:32,640 INFO L225 Difference]: With dead ends: 14998 [2019-10-22 11:26:32,640 INFO L226 Difference]: Without dead ends: 14998 [2019-10-22 11:26:32,640 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-22 11:26:32,667 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14998 states. [2019-10-22 11:26:32,798 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14998 to 12734. [2019-10-22 11:26:32,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12734 states. [2019-10-22 11:26:32,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12734 states to 12734 states and 37974 transitions. [2019-10-22 11:26:32,820 INFO L78 Accepts]: Start accepts. Automaton has 12734 states and 37974 transitions. Word has length 68 [2019-10-22 11:26:32,820 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:26:32,820 INFO L462 AbstractCegarLoop]: Abstraction has 12734 states and 37974 transitions. [2019-10-22 11:26:32,820 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-22 11:26:32,820 INFO L276 IsEmpty]: Start isEmpty. Operand 12734 states and 37974 transitions. [2019-10-22 11:26:32,827 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-10-22 11:26:32,828 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:26:32,828 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 11:26:32,828 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:26:32,828 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:26:32,828 INFO L82 PathProgramCache]: Analyzing trace with hash -60804377, now seen corresponding path program 1 times [2019-10-22 11:26:32,828 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:26:32,828 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1621944555] [2019-10-22 11:26:32,829 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:26:32,829 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:26:32,829 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:26:32,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:26:32,931 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 11:26:32,931 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1621944555] [2019-10-22 11:26:32,931 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:26:32,931 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-22 11:26:32,931 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [180026847] [2019-10-22 11:26:32,932 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-22 11:26:32,932 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:26:32,932 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-22 11:26:32,933 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-22 11:26:32,933 INFO L87 Difference]: Start difference. First operand 12734 states and 37974 transitions. Second operand 6 states. [2019-10-22 11:26:33,287 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:26:33,287 INFO L93 Difference]: Finished difference Result 15083 states and 43757 transitions. [2019-10-22 11:26:33,288 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-10-22 11:26:33,288 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 68 [2019-10-22 11:26:33,288 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:26:33,306 INFO L225 Difference]: With dead ends: 15083 [2019-10-22 11:26:33,306 INFO L226 Difference]: Without dead ends: 15083 [2019-10-22 11:26:33,306 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2019-10-22 11:26:33,334 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15083 states. [2019-10-22 11:26:33,466 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15083 to 12973. [2019-10-22 11:26:33,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12973 states. [2019-10-22 11:26:33,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12973 states to 12973 states and 38018 transitions. [2019-10-22 11:26:33,489 INFO L78 Accepts]: Start accepts. Automaton has 12973 states and 38018 transitions. Word has length 68 [2019-10-22 11:26:33,489 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:26:33,489 INFO L462 AbstractCegarLoop]: Abstraction has 12973 states and 38018 transitions. [2019-10-22 11:26:33,489 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-22 11:26:33,489 INFO L276 IsEmpty]: Start isEmpty. Operand 12973 states and 38018 transitions. [2019-10-22 11:26:33,497 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-10-22 11:26:33,498 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:26:33,498 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 11:26:33,498 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:26:33,498 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:26:33,498 INFO L82 PathProgramCache]: Analyzing trace with hash 150546536, now seen corresponding path program 1 times [2019-10-22 11:26:33,498 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:26:33,498 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [283059081] [2019-10-22 11:26:33,499 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:26:33,499 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:26:33,499 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:26:33,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:26:33,565 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 11:26:33,565 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [283059081] [2019-10-22 11:26:33,566 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:26:33,566 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-22 11:26:33,566 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1928410944] [2019-10-22 11:26:33,566 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-22 11:26:33,566 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:26:33,566 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-22 11:26:33,567 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-22 11:26:33,567 INFO L87 Difference]: Start difference. First operand 12973 states and 38018 transitions. Second operand 5 states. [2019-10-22 11:26:33,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:26:33,784 INFO L93 Difference]: Finished difference Result 15978 states and 46602 transitions. [2019-10-22 11:26:33,784 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-22 11:26:33,784 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 68 [2019-10-22 11:26:33,785 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:26:33,804 INFO L225 Difference]: With dead ends: 15978 [2019-10-22 11:26:33,804 INFO L226 Difference]: Without dead ends: 15978 [2019-10-22 11:26:33,804 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-10-22 11:26:33,832 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15978 states. [2019-10-22 11:26:33,971 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15978 to 13916. [2019-10-22 11:26:33,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13916 states. [2019-10-22 11:26:33,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13916 states to 13916 states and 40448 transitions. [2019-10-22 11:26:33,995 INFO L78 Accepts]: Start accepts. Automaton has 13916 states and 40448 transitions. Word has length 68 [2019-10-22 11:26:33,995 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:26:33,996 INFO L462 AbstractCegarLoop]: Abstraction has 13916 states and 40448 transitions. [2019-10-22 11:26:33,996 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-22 11:26:33,996 INFO L276 IsEmpty]: Start isEmpty. Operand 13916 states and 40448 transitions. [2019-10-22 11:26:34,005 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-10-22 11:26:34,006 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:26:34,006 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 11:26:34,006 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:26:34,006 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:26:34,006 INFO L82 PathProgramCache]: Analyzing trace with hash -359987641, now seen corresponding path program 1 times [2019-10-22 11:26:34,007 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:26:34,007 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [206032340] [2019-10-22 11:26:34,007 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:26:34,007 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:26:34,007 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:26:34,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:26:34,068 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 11:26:34,068 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [206032340] [2019-10-22 11:26:34,068 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:26:34,068 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-22 11:26:34,068 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2141680072] [2019-10-22 11:26:34,069 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-22 11:26:34,069 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:26:34,069 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-22 11:26:34,069 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-22 11:26:34,069 INFO L87 Difference]: Start difference. First operand 13916 states and 40448 transitions. Second operand 4 states. [2019-10-22 11:26:34,490 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:26:34,490 INFO L93 Difference]: Finished difference Result 17364 states and 50542 transitions. [2019-10-22 11:26:34,490 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-22 11:26:34,490 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 68 [2019-10-22 11:26:34,491 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:26:34,512 INFO L225 Difference]: With dead ends: 17364 [2019-10-22 11:26:34,512 INFO L226 Difference]: Without dead ends: 16852 [2019-10-22 11:26:34,512 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-22 11:26:34,544 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16852 states. [2019-10-22 11:26:34,724 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16852 to 16120. [2019-10-22 11:26:34,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16120 states. [2019-10-22 11:26:34,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16120 states to 16120 states and 46797 transitions. [2019-10-22 11:26:34,752 INFO L78 Accepts]: Start accepts. Automaton has 16120 states and 46797 transitions. Word has length 68 [2019-10-22 11:26:34,752 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:26:34,752 INFO L462 AbstractCegarLoop]: Abstraction has 16120 states and 46797 transitions. [2019-10-22 11:26:34,752 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-22 11:26:34,752 INFO L276 IsEmpty]: Start isEmpty. Operand 16120 states and 46797 transitions. [2019-10-22 11:26:34,760 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-10-22 11:26:34,760 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:26:34,760 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 11:26:34,761 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:26:34,761 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:26:34,761 INFO L82 PathProgramCache]: Analyzing trace with hash 2138028296, now seen corresponding path program 1 times [2019-10-22 11:26:34,761 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:26:34,761 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [766051389] [2019-10-22 11:26:34,761 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:26:34,761 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:26:34,761 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:26:34,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:26:34,831 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 11:26:34,831 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [766051389] [2019-10-22 11:26:34,832 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:26:34,832 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-22 11:26:34,832 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1223554382] [2019-10-22 11:26:34,832 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-22 11:26:34,833 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:26:34,833 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-22 11:26:34,833 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-10-22 11:26:34,833 INFO L87 Difference]: Start difference. First operand 16120 states and 46797 transitions. Second operand 5 states. [2019-10-22 11:26:34,883 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:26:34,884 INFO L93 Difference]: Finished difference Result 5108 states and 12214 transitions. [2019-10-22 11:26:34,884 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-22 11:26:34,884 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 68 [2019-10-22 11:26:34,884 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:26:34,890 INFO L225 Difference]: With dead ends: 5108 [2019-10-22 11:26:34,890 INFO L226 Difference]: Without dead ends: 4115 [2019-10-22 11:26:34,890 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-10-22 11:26:34,898 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4115 states. [2019-10-22 11:26:34,938 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4115 to 3574. [2019-10-22 11:26:34,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3574 states. [2019-10-22 11:26:34,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3574 states to 3574 states and 8322 transitions. [2019-10-22 11:26:34,944 INFO L78 Accepts]: Start accepts. Automaton has 3574 states and 8322 transitions. Word has length 68 [2019-10-22 11:26:34,945 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:26:34,945 INFO L462 AbstractCegarLoop]: Abstraction has 3574 states and 8322 transitions. [2019-10-22 11:26:34,945 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-22 11:26:34,945 INFO L276 IsEmpty]: Start isEmpty. Operand 3574 states and 8322 transitions. [2019-10-22 11:26:34,949 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-10-22 11:26:34,950 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:26:34,950 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 11:26:34,950 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:26:34,950 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:26:34,950 INFO L82 PathProgramCache]: Analyzing trace with hash 1916520924, now seen corresponding path program 1 times [2019-10-22 11:26:34,951 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:26:34,951 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2064980222] [2019-10-22 11:26:34,951 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:26:34,951 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:26:34,951 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:26:34,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:26:35,019 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 11:26:35,019 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2064980222] [2019-10-22 11:26:35,019 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:26:35,020 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-22 11:26:35,020 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [876238752] [2019-10-22 11:26:35,020 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-22 11:26:35,020 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:26:35,021 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-22 11:26:35,021 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-22 11:26:35,021 INFO L87 Difference]: Start difference. First operand 3574 states and 8322 transitions. Second operand 4 states. [2019-10-22 11:26:35,057 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:26:35,057 INFO L93 Difference]: Finished difference Result 3494 states and 8090 transitions. [2019-10-22 11:26:35,058 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-22 11:26:35,058 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 85 [2019-10-22 11:26:35,058 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:26:35,062 INFO L225 Difference]: With dead ends: 3494 [2019-10-22 11:26:35,063 INFO L226 Difference]: Without dead ends: 3494 [2019-10-22 11:26:35,063 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-22 11:26:35,072 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3494 states. [2019-10-22 11:26:35,105 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3494 to 3048. [2019-10-22 11:26:35,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3048 states. [2019-10-22 11:26:35,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3048 states to 3048 states and 7058 transitions. [2019-10-22 11:26:35,111 INFO L78 Accepts]: Start accepts. Automaton has 3048 states and 7058 transitions. Word has length 85 [2019-10-22 11:26:35,111 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:26:35,111 INFO L462 AbstractCegarLoop]: Abstraction has 3048 states and 7058 transitions. [2019-10-22 11:26:35,112 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-22 11:26:35,112 INFO L276 IsEmpty]: Start isEmpty. Operand 3048 states and 7058 transitions. [2019-10-22 11:26:35,115 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-10-22 11:26:35,115 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:26:35,116 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 11:26:35,116 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:26:35,116 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:26:35,116 INFO L82 PathProgramCache]: Analyzing trace with hash -390964612, now seen corresponding path program 1 times [2019-10-22 11:26:35,116 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:26:35,116 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [582554690] [2019-10-22 11:26:35,116 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:26:35,117 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:26:35,117 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:26:35,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:26:35,229 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 11:26:35,230 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [582554690] [2019-10-22 11:26:35,230 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:26:35,230 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-22 11:26:35,230 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1143023653] [2019-10-22 11:26:35,231 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-22 11:26:35,231 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:26:35,231 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-22 11:26:35,231 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-22 11:26:35,231 INFO L87 Difference]: Start difference. First operand 3048 states and 7058 transitions. Second operand 6 states. [2019-10-22 11:26:35,481 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:26:35,481 INFO L93 Difference]: Finished difference Result 3181 states and 7324 transitions. [2019-10-22 11:26:35,482 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-22 11:26:35,482 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 85 [2019-10-22 11:26:35,482 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:26:35,485 INFO L225 Difference]: With dead ends: 3181 [2019-10-22 11:26:35,485 INFO L226 Difference]: Without dead ends: 3181 [2019-10-22 11:26:35,486 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2019-10-22 11:26:35,491 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3181 states. [2019-10-22 11:26:35,522 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3181 to 2977. [2019-10-22 11:26:35,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2977 states. [2019-10-22 11:26:35,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2977 states to 2977 states and 6891 transitions. [2019-10-22 11:26:35,527 INFO L78 Accepts]: Start accepts. Automaton has 2977 states and 6891 transitions. Word has length 85 [2019-10-22 11:26:35,527 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:26:35,527 INFO L462 AbstractCegarLoop]: Abstraction has 2977 states and 6891 transitions. [2019-10-22 11:26:35,527 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-22 11:26:35,528 INFO L276 IsEmpty]: Start isEmpty. Operand 2977 states and 6891 transitions. [2019-10-22 11:26:35,531 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-10-22 11:26:35,531 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:26:35,531 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 11:26:35,532 INFO L410 AbstractCegarLoop]: === Iteration 19 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:26:35,532 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:26:35,532 INFO L82 PathProgramCache]: Analyzing trace with hash -904470467, now seen corresponding path program 1 times [2019-10-22 11:26:35,532 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:26:35,533 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1655343347] [2019-10-22 11:26:35,533 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:26:35,533 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:26:35,533 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:26:35,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:26:35,716 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 11:26:35,716 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1655343347] [2019-10-22 11:26:35,716 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:26:35,717 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-10-22 11:26:35,717 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1070110576] [2019-10-22 11:26:35,717 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-22 11:26:35,718 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:26:35,718 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-22 11:26:35,718 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-10-22 11:26:35,719 INFO L87 Difference]: Start difference. First operand 2977 states and 6891 transitions. Second operand 9 states. [2019-10-22 11:26:36,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:26:36,080 INFO L93 Difference]: Finished difference Result 8024 states and 18761 transitions. [2019-10-22 11:26:36,081 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-10-22 11:26:36,081 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 85 [2019-10-22 11:26:36,081 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:26:36,087 INFO L225 Difference]: With dead ends: 8024 [2019-10-22 11:26:36,087 INFO L226 Difference]: Without dead ends: 5370 [2019-10-22 11:26:36,087 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=87, Invalid=293, Unknown=0, NotChecked=0, Total=380 [2019-10-22 11:26:36,097 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5370 states. [2019-10-22 11:26:36,141 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5370 to 3181. [2019-10-22 11:26:36,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3181 states. [2019-10-22 11:26:36,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3181 states to 3181 states and 7330 transitions. [2019-10-22 11:26:36,147 INFO L78 Accepts]: Start accepts. Automaton has 3181 states and 7330 transitions. Word has length 85 [2019-10-22 11:26:36,147 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:26:36,148 INFO L462 AbstractCegarLoop]: Abstraction has 3181 states and 7330 transitions. [2019-10-22 11:26:36,148 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-22 11:26:36,148 INFO L276 IsEmpty]: Start isEmpty. Operand 3181 states and 7330 transitions. [2019-10-22 11:26:36,151 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-10-22 11:26:36,152 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:26:36,152 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 11:26:36,152 INFO L410 AbstractCegarLoop]: === Iteration 20 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:26:36,153 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:26:36,153 INFO L82 PathProgramCache]: Analyzing trace with hash -1409265495, now seen corresponding path program 2 times [2019-10-22 11:26:36,153 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:26:36,153 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2035440548] [2019-10-22 11:26:36,153 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:26:36,153 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:26:36,153 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:26:36,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:26:36,280 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 11:26:36,281 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2035440548] [2019-10-22 11:26:36,281 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:26:36,281 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-10-22 11:26:36,281 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [998339853] [2019-10-22 11:26:36,281 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-10-22 11:26:36,282 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:26:36,282 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-10-22 11:26:36,282 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2019-10-22 11:26:36,282 INFO L87 Difference]: Start difference. First operand 3181 states and 7330 transitions. Second operand 8 states. [2019-10-22 11:26:36,375 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:26:36,375 INFO L93 Difference]: Finished difference Result 5416 states and 12524 transitions. [2019-10-22 11:26:36,375 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-22 11:26:36,376 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 85 [2019-10-22 11:26:36,376 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:26:36,378 INFO L225 Difference]: With dead ends: 5416 [2019-10-22 11:26:36,379 INFO L226 Difference]: Without dead ends: 2340 [2019-10-22 11:26:36,379 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2019-10-22 11:26:36,384 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2340 states. [2019-10-22 11:26:36,405 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2340 to 2340. [2019-10-22 11:26:36,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2340 states. [2019-10-22 11:26:36,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2340 states to 2340 states and 5382 transitions. [2019-10-22 11:26:36,410 INFO L78 Accepts]: Start accepts. Automaton has 2340 states and 5382 transitions. Word has length 85 [2019-10-22 11:26:36,410 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:26:36,410 INFO L462 AbstractCegarLoop]: Abstraction has 2340 states and 5382 transitions. [2019-10-22 11:26:36,410 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-10-22 11:26:36,410 INFO L276 IsEmpty]: Start isEmpty. Operand 2340 states and 5382 transitions. [2019-10-22 11:26:36,412 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-10-22 11:26:36,413 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:26:36,413 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 11:26:36,413 INFO L410 AbstractCegarLoop]: === Iteration 21 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:26:36,413 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:26:36,413 INFO L82 PathProgramCache]: Analyzing trace with hash 1815808569, now seen corresponding path program 3 times [2019-10-22 11:26:36,413 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:26:36,414 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1978574230] [2019-10-22 11:26:36,414 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:26:36,414 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:26:36,414 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:26:36,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:26:36,558 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 11:26:36,559 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1978574230] [2019-10-22 11:26:36,559 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:26:36,559 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-10-22 11:26:36,559 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [976577521] [2019-10-22 11:26:36,560 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-10-22 11:26:36,561 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:26:36,561 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-10-22 11:26:36,561 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2019-10-22 11:26:36,561 INFO L87 Difference]: Start difference. First operand 2340 states and 5382 transitions. Second operand 10 states. [2019-10-22 11:26:36,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:26:36,835 INFO L93 Difference]: Finished difference Result 3872 states and 8949 transitions. [2019-10-22 11:26:36,836 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-10-22 11:26:36,836 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 85 [2019-10-22 11:26:36,836 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:26:36,838 INFO L225 Difference]: With dead ends: 3872 [2019-10-22 11:26:36,838 INFO L226 Difference]: Without dead ends: 2526 [2019-10-22 11:26:36,838 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=53, Invalid=219, Unknown=0, NotChecked=0, Total=272 [2019-10-22 11:26:36,842 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2526 states. [2019-10-22 11:26:36,857 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2526 to 2320. [2019-10-22 11:26:36,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2320 states. [2019-10-22 11:26:36,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2320 states to 2320 states and 5340 transitions. [2019-10-22 11:26:36,860 INFO L78 Accepts]: Start accepts. Automaton has 2320 states and 5340 transitions. Word has length 85 [2019-10-22 11:26:36,860 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:26:36,860 INFO L462 AbstractCegarLoop]: Abstraction has 2320 states and 5340 transitions. [2019-10-22 11:26:36,860 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-10-22 11:26:36,860 INFO L276 IsEmpty]: Start isEmpty. Operand 2320 states and 5340 transitions. [2019-10-22 11:26:36,862 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-10-22 11:26:36,862 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:26:36,862 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 11:26:36,863 INFO L410 AbstractCegarLoop]: === Iteration 22 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:26:36,863 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:26:36,863 INFO L82 PathProgramCache]: Analyzing trace with hash -509425223, now seen corresponding path program 4 times [2019-10-22 11:26:36,863 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:26:36,863 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1004957663] [2019-10-22 11:26:36,863 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:26:36,863 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:26:36,864 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:26:36,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 11:26:36,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 11:26:36,940 INFO L168 tionRefinementEngine]: Strategy TAIPAN found a feasible trace [2019-10-22 11:26:36,940 INFO L445 BasicCegarLoop]: Counterexample might be feasible [2019-10-22 11:26:37,065 INFO L303 ceAbstractionStarter]: Did not count any witness invariants because Icfg is not BoogieIcfg [2019-10-22 11:26:37,067 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.10 11:26:37 BasicIcfg [2019-10-22 11:26:37,067 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-10-22 11:26:37,068 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-10-22 11:26:37,068 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-10-22 11:26:37,068 INFO L275 PluginConnector]: Witness Printer initialized [2019-10-22 11:26:37,069 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 11:26:13" (3/4) ... [2019-10-22 11:26:37,071 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2019-10-22 11:26:37,225 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_69caf3cf-9129-4991-b0a8-e7a703d6657a/bin/utaipan/witness.graphml [2019-10-22 11:26:37,228 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-10-22 11:26:37,230 INFO L168 Benchmark]: Toolchain (without parser) took 24926.79 ms. Allocated memory was 1.0 GB in the beginning and 3.0 GB in the end (delta: 2.0 GB). Free memory was 944.7 MB in the beginning and 2.4 GB in the end (delta: -1.4 GB). Peak memory consumption was 601.6 MB. Max. memory is 11.5 GB. [2019-10-22 11:26:37,230 INFO L168 Benchmark]: CDTParser took 0.19 ms. Allocated memory is still 1.0 GB. Free memory is still 967.5 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-10-22 11:26:37,231 INFO L168 Benchmark]: CACSL2BoogieTranslator took 695.99 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 138.9 MB). Free memory was 944.7 MB in the beginning and 1.1 GB in the end (delta: -156.6 MB). Peak memory consumption was 24.0 MB. Max. memory is 11.5 GB. [2019-10-22 11:26:37,231 INFO L168 Benchmark]: Boogie Procedure Inliner took 70.82 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. [2019-10-22 11:26:37,231 INFO L168 Benchmark]: Boogie Preprocessor took 40.08 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-10-22 11:26:37,231 INFO L168 Benchmark]: RCFGBuilder took 760.96 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 48.3 MB). Peak memory consumption was 48.3 MB. Max. memory is 11.5 GB. [2019-10-22 11:26:37,232 INFO L168 Benchmark]: TraceAbstraction took 23191.32 ms. Allocated memory was 1.2 GB in the beginning and 3.0 GB in the end (delta: 1.9 GB). Free memory was 1.0 GB in the beginning and 2.4 GB in the end (delta: -1.3 GB). Peak memory consumption was 551.8 MB. Max. memory is 11.5 GB. [2019-10-22 11:26:37,233 INFO L168 Benchmark]: Witness Printer took 161.03 ms. Allocated memory is still 3.0 GB. Free memory was 2.4 GB in the beginning and 2.4 GB in the end (delta: 12.5 MB). Peak memory consumption was 12.5 MB. Max. memory is 11.5 GB. [2019-10-22 11:26:37,235 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.19 ms. Allocated memory is still 1.0 GB. Free memory is still 967.5 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 695.99 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 138.9 MB). Free memory was 944.7 MB in the beginning and 1.1 GB in the end (delta: -156.6 MB). Peak memory consumption was 24.0 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 70.82 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 40.08 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 760.96 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 48.3 MB). Peak memory consumption was 48.3 MB. Max. memory is 11.5 GB. * TraceAbstraction took 23191.32 ms. Allocated memory was 1.2 GB in the beginning and 3.0 GB in the end (delta: 1.9 GB). Free memory was 1.0 GB in the beginning and 2.4 GB in the end (delta: -1.3 GB). Peak memory consumption was 551.8 MB. Max. memory is 11.5 GB. * Witness Printer took 161.03 ms. Allocated memory is still 3.0 GB. Free memory was 2.4 GB in the beginning and 2.4 GB in the end (delta: 12.5 MB). Peak memory consumption was 12.5 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 5]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L695] 0 int __unbuffered_cnt = 0; VAL [__unbuffered_cnt=0] [L697] 0 int __unbuffered_p0_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0] [L699] 0 int __unbuffered_p1_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0] [L701] 0 int __unbuffered_p1_EBX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0] [L702] 0 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0] [L703] 0 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0] [L705] 0 int x = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0] [L707] 0 int y = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0] [L708] 0 _Bool y$flush_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0] [L709] 0 int y$mem_tmp; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0] [L710] 0 _Bool y$r_buff0_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0] [L711] 0 _Bool y$r_buff0_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0] [L712] 0 _Bool y$r_buff0_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0] [L713] 0 _Bool y$r_buff1_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0] [L714] 0 _Bool y$r_buff1_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0] [L715] 0 _Bool y$r_buff1_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0] [L716] 0 _Bool y$read_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0] [L717] 0 int *y$read_delayed_var; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}] [L718] 0 int y$w_buff0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0] [L719] 0 _Bool y$w_buff0_used; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0] [L720] 0 int y$w_buff1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0] [L721] 0 _Bool y$w_buff1_used; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L723] 0 int z = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L724] 0 _Bool weak$$choice0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L725] 0 _Bool weak$$choice2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L801] 0 pthread_t t1653; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L802] FCALL, FORK 0 pthread_create(&t1653, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L803] 0 pthread_t t1654; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L804] FCALL, FORK 0 pthread_create(&t1654, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L759] 2 y$w_buff1 = y$w_buff0 [L760] 2 y$w_buff0 = 1 [L761] 2 y$w_buff1_used = y$w_buff0_used [L762] 2 y$w_buff0_used = (_Bool)1 [L5] COND FALSE 2 !(!expression) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L764] 2 y$r_buff1_thd0 = y$r_buff0_thd0 [L765] 2 y$r_buff1_thd1 = y$r_buff0_thd1 [L766] 2 y$r_buff1_thd2 = y$r_buff0_thd2 [L767] 2 y$r_buff0_thd2 = (_Bool)1 [L770] 2 z = 1 [L773] 2 __unbuffered_p1_EAX = z [L776] 2 __unbuffered_p1_EBX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L779] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L729] 1 x = 1 [L734] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L735] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L736] 1 y$flush_delayed = weak$$choice2 [L737] 1 y$mem_tmp = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L738] EXPR 1 !y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1) VAL [!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p0_EAX=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=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L779] 2 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L780] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used VAL [!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p0_EAX=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=5, weak$$choice2=1, x=1, y=1, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L780] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L781] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used VAL [!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p0_EAX=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=5, weak$$choice2=1, x=1, y=1, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L738] 1 y = !y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1) [L739] EXPR 1 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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=5, weak$$choice2=1, weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff0))=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L739] 1 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff0)) [L740] EXPR 1 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff1 : y$w_buff1)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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=5, weak$$choice2=1, weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff1 : y$w_buff1))=0, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L740] 1 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff1 : y$w_buff1)) [L781] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L782] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L782] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L783] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L783] 2 y$r_buff1_thd2 = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 [L786] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=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=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L741] EXPR 1 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used)) VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=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=5, weak$$choice2=1, weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used))=0, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L741] 1 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used)) [L742] EXPR 1 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=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=5, weak$$choice2=1, weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0))=0, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L742] 1 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L743] EXPR 1 weak$$choice2 ? y$r_buff0_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff0_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1)) VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=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=5, weak$$choice2=1, weak$$choice2 ? y$r_buff0_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff0_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1))=0, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L743] 1 y$r_buff0_thd1 = weak$$choice2 ? y$r_buff0_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff0_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1)) [L744] EXPR 1 weak$$choice2 ? y$r_buff1_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff1_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=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=5, weak$$choice2=1, weak$$choice2 ? y$r_buff1_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff1_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0))=0, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L744] 1 y$r_buff1_thd1 = weak$$choice2 ? y$r_buff1_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff1_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L745] 1 __unbuffered_p0_EAX = y VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=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=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L746] EXPR 1 y$flush_delayed ? y$mem_tmp : y VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=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=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$flush_delayed ? y$mem_tmp : y=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L746] 1 y = y$flush_delayed ? y$mem_tmp : y [L747] 1 y$flush_delayed = (_Bool)0 [L752] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=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=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L806] 0 main$tmp_guard0 = __unbuffered_cnt == 2 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L810] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L810] EXPR 0 y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L810] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L810] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L811] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L811] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L812] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L812] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L813] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L813] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L814] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L814] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 [L817] 0 main$tmp_guard1 = !(__unbuffered_p0_EAX == 0 && __unbuffered_p1_EAX == 1 && __unbuffered_p1_EBX == 0) VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L5] COND TRUE 0 !expression VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L5] 0 __VERIFIER_error() VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 200 locations, 3 error locations. Result: UNSAFE, OverallTime: 23.0s, OverallIterations: 22, TraceHistogramMax: 1, AutomataDifference: 9.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 5457 SDtfs, 6230 SDslu, 13225 SDs, 0 SdLazy, 3414 SolverSat, 225 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 3.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 191 GetRequests, 53 SyntacticMatches, 8 SemanticMatches, 130 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 116 ImplicationChecksByTransitivity, 1.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=51955occurred in iteration=6, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 8.8s AutomataMinimizationTime, 21 MinimizatonAttempts, 43319 StatesRemovedByMinimization, 19 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 1.4s InterpolantComputationTime, 1447 NumberOfCodeBlocks, 1447 NumberOfCodeBlocksAsserted, 22 NumberOfCheckSat, 1341 ConstructedInterpolants, 0 QuantifiedInterpolants, 251060 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 21 InterpolantComputations, 21 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...